/* $Id$ */ /* * Copyright (c) 2010, 2014, 2015, 2017 Ingo Schwarze * * 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 #include #include #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); 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 */ roff_term_pre_ft, /* ft */ roff_term_pre_ll, /* ll */ roff_term_pre_mc, /* mc */ 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->offset = p->rmargin; p->rmargin = p->maxrmargin; p->flags &= ~(TERMP_NOBREAK | TERMP_BRIND); } } static void roff_term_pre_ce(ROFF_TERM_ARGS) { const struct roff_node *nch; size_t len, lm; roff_term_pre_br(p, n); lm = p->offset; n = n->child->next; while (n != NULL) { nch = n; len = 0; do { if (n->type == ROFFT_TEXT) { if (len) len++; len += term_strlen(p, nch->string); } nch = nch->next; } while (nch != NULL && (n->type != ROFFT_TEXT || (n->flags & NODE_LINE) == 0)); p->offset = len >= p->rmargin ? 0 : lm + len >= p->rmargin ? p->rmargin - len : (lm + p->rmargin - len) / 2; while (n != nch) { if (n->type == ROFFT_TEXT) term_word(p, n->string); else roff_term_pre(p, n); n = n->next; } p->flags |= TERMP_NOSPACE; term_flushln(p); } p->offset = lm; } static void roff_term_pre_ft(ROFF_TERM_ARGS) { switch (*n->child->string) { case '4': case '3': case 'B': term_fontrepl(p, TERMFONT_BOLD); break; case '2': case 'I': term_fontrepl(p, TERMFONT_UNDER); break; case 'P': term_fontlast(p); break; case '1': case 'C': case 'R': 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; } 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) == 0) 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) == 0) return; len = term_hspan(p, &su) / 24; if (sign == 0) { p->ti = len - p->offset; p->offset = len; } else if (sign == 1) { p->ti = len; p->offset += len; } else if ((size_t)len < p->offset) { p->ti = -len; p->offset -= len; } else { p->ti = -p->offset; p->offset = 0; } }