freebsd-nq/contrib/mandoc/roff_term.c

245 lines
5.4 KiB
C
Raw Normal View History

2019-03-29 13:13:30 +00:00
/* $Id: roff_term.c,v 1.19 2019/01/04 03:24:33 schwarze Exp $ */
2017-06-08 19:29:07 +00:00
/*
2019-03-29 13:13:30 +00:00
* Copyright (c) 2010,2014,2015,2017-2019 Ingo Schwarze <schwarze@openbsd.org>
2017-06-08 19:29:07 +00:00
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <assert.h>
2019-03-29 13:13:30 +00:00
#include <stdio.h>
#include <string.h>
2017-06-08 19:29:07 +00:00
2017-07-31 19:17:54 +00:00
#include "mandoc.h"
2017-06-08 19:29:07 +00:00
#include "roff.h"
#include "out.h"
#include "term.h"
#define ROFF_TERM_ARGS struct termp *p, const struct roff_node *n
typedef void (*roff_term_pre_fp)(ROFF_TERM_ARGS);
static void roff_term_pre_br(ROFF_TERM_ARGS);
static void roff_term_pre_ce(ROFF_TERM_ARGS);
static void roff_term_pre_ft(ROFF_TERM_ARGS);
static void roff_term_pre_ll(ROFF_TERM_ARGS);
static void roff_term_pre_mc(ROFF_TERM_ARGS);
2017-07-31 19:17:54 +00:00
static void roff_term_pre_po(ROFF_TERM_ARGS);
2017-06-08 19:29:07 +00:00
static void roff_term_pre_sp(ROFF_TERM_ARGS);
static void roff_term_pre_ta(ROFF_TERM_ARGS);
static void roff_term_pre_ti(ROFF_TERM_ARGS);
static const roff_term_pre_fp roff_term_pre_acts[ROFF_MAX] = {
roff_term_pre_br, /* br */
roff_term_pre_ce, /* ce */
2019-03-29 13:13:30 +00:00
roff_term_pre_br, /* fi */
2017-06-08 19:29:07 +00:00
roff_term_pre_ft, /* ft */
roff_term_pre_ll, /* ll */
roff_term_pre_mc, /* mc */
2019-03-29 13:13:30 +00:00
roff_term_pre_br, /* nf */
2017-07-31 19:17:54 +00:00
roff_term_pre_po, /* po */
roff_term_pre_ce, /* rj */
2017-06-08 19:29:07 +00:00
roff_term_pre_sp, /* sp */
roff_term_pre_ta, /* ta */
roff_term_pre_ti, /* ti */
};
void
roff_term_pre(struct termp *p, const struct roff_node *n)
{
assert(n->tok < ROFF_MAX);
(*roff_term_pre_acts[n->tok])(p, n);
}
static void
roff_term_pre_br(ROFF_TERM_ARGS)
{
term_newln(p);
if (p->flags & TERMP_BRIND) {
p->tcol->offset = p->tcol->rmargin;
p->tcol->rmargin = p->maxrmargin;
2019-03-29 13:13:30 +00:00
p->trailspace = 0;
2017-06-08 19:29:07 +00:00
p->flags &= ~(TERMP_NOBREAK | TERMP_BRIND);
2019-03-29 13:13:30 +00:00
p->flags |= TERMP_NOSPACE;
2017-06-08 19:29:07 +00:00
}
}
static void
roff_term_pre_ce(ROFF_TERM_ARGS)
{
2017-07-31 19:17:54 +00:00
const struct roff_node *nc1, *nc2;
2017-06-08 19:29:07 +00:00
roff_term_pre_br(p, n);
2019-03-29 13:13:30 +00:00
p->flags |= n->tok == ROFF_ce ? TERMP_CENTER : TERMP_RIGHT;
2017-07-31 19:17:54 +00:00
nc1 = n->child->next;
while (nc1 != NULL) {
nc2 = nc1;
2017-06-08 19:29:07 +00:00
do {
2017-07-31 19:17:54 +00:00
nc2 = nc2->next;
} while (nc2 != NULL && (nc2->type != ROFFT_TEXT ||
(nc2->flags & NODE_LINE) == 0));
while (nc1 != nc2) {
if (nc1->type == ROFFT_TEXT)
term_word(p, nc1->string);
2017-06-08 19:29:07 +00:00
else
2017-07-31 19:17:54 +00:00
roff_term_pre(p, nc1);
nc1 = nc1->next;
2017-06-08 19:29:07 +00:00
}
p->flags |= TERMP_NOSPACE;
term_flushln(p);
}
2019-03-29 13:13:30 +00:00
p->flags &= ~(TERMP_CENTER | TERMP_RIGHT);
2017-06-08 19:29:07 +00:00
}
static void
roff_term_pre_ft(ROFF_TERM_ARGS)
{
2019-03-29 13:13:30 +00:00
const char *cp;
cp = n->child->string;
switch (mandoc_font(cp, (int)strlen(cp))) {
case ESCAPE_FONTBOLD:
2017-06-08 19:29:07 +00:00
term_fontrepl(p, TERMFONT_BOLD);
break;
2019-03-29 13:13:30 +00:00
case ESCAPE_FONTITALIC:
2017-06-08 19:29:07 +00:00
term_fontrepl(p, TERMFONT_UNDER);
break;
2019-03-29 13:13:30 +00:00
case ESCAPE_FONTBI:
term_fontrepl(p, TERMFONT_BI);
break;
case ESCAPE_FONTPREV:
2017-06-08 19:29:07 +00:00
term_fontlast(p);
break;
2019-03-29 13:13:30 +00:00
case ESCAPE_FONTROMAN:
case ESCAPE_FONTCW:
2017-06-08 19:29:07 +00:00
term_fontrepl(p, TERMFONT_NONE);
break;
default:
break;
}
}
static void
roff_term_pre_ll(ROFF_TERM_ARGS)
{
term_setwidth(p, n->child != NULL ? n->child->string : NULL);
}
static void
roff_term_pre_mc(ROFF_TERM_ARGS)
{
if (p->col) {
p->flags |= TERMP_NOBREAK;
term_flushln(p);
p->flags &= ~(TERMP_NOBREAK | TERMP_NOSPACE);
}
if (n->child != NULL) {
p->mc = n->child->string;
p->flags |= TERMP_NEWMC;
} else
p->flags |= TERMP_ENDMC;
}
2017-07-31 19:17:54 +00:00
static void
roff_term_pre_po(ROFF_TERM_ARGS)
{
struct roffsu su;
static int po, polast;
int ponew;
if (n->child != NULL &&
a2roffsu(n->child->string, &su, SCALE_EM) != NULL) {
ponew = term_hen(p, &su);
if (*n->child->string == '+' ||
*n->child->string == '-')
ponew += po;
} else
ponew = polast;
polast = po;
po = ponew;
ponew = po - polast + (int)p->tcol->offset;
p->tcol->offset = ponew > 0 ? ponew : 0;
}
2017-06-08 19:29:07 +00:00
static void
roff_term_pre_sp(ROFF_TERM_ARGS)
{
struct roffsu su;
int len;
if (n->child != NULL) {
if (a2roffsu(n->child->string, &su, SCALE_VS) == NULL)
su.scale = 1.0;
len = term_vspan(p, &su);
} else
len = 1;
if (len < 0)
p->skipvsp -= len;
else
while (len--)
term_vspace(p);
roff_term_pre_br(p, n);
}
static void
roff_term_pre_ta(ROFF_TERM_ARGS)
{
term_tab_set(p, NULL);
for (n = n->child; n != NULL; n = n->next)
term_tab_set(p, n->string);
}
static void
roff_term_pre_ti(ROFF_TERM_ARGS)
{
struct roffsu su;
const char *cp;
int len, sign;
roff_term_pre_br(p, n);
if (n->child == NULL)
return;
cp = n->child->string;
if (*cp == '+') {
sign = 1;
cp++;
} else if (*cp == '-') {
sign = -1;
cp++;
} else
sign = 0;
if (a2roffsu(cp, &su, SCALE_EM) == NULL)
return;
2017-07-31 19:17:54 +00:00
len = term_hen(p, &su);
2017-06-08 19:29:07 +00:00
if (sign == 0) {
p->ti = len - p->tcol->offset;
p->tcol->offset = len;
} else if (sign == 1) {
p->ti = len;
p->tcol->offset += len;
} else if ((size_t)len < p->tcol->offset) {
p->ti = -len;
p->tcol->offset -= len;
} else {
p->ti = -p->tcol->offset;
p->tcol->offset = 0;
}
}