version 1.103, 2009/09/23 11:02:21 |
version 1.202, 2012/05/27 18:02:49 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2010, 2011, 2012 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <err.h> |
#include <ctype.h> |
|
#include <stdint.h> |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
|
|
#include "chars.h" |
#include "mandoc.h" |
|
#include "out.h" |
#include "term.h" |
#include "term.h" |
#include "man.h" |
#include "main.h" |
#include "mdoc.h" |
|
|
|
/* FIXME: accomodate non-breaking, non-collapsing white-space. */ |
static void adjbuf(struct termp *p, int); |
/* FIXME: accomodate non-breaking, collapsing white-space. */ |
static void bufferc(struct termp *, char); |
|
static void encode(struct termp *, const char *, size_t); |
|
static void encode1(struct termp *, int); |
|
|
extern void man_run(struct termp *, |
|
const struct man *); |
|
extern void mdoc_run(struct termp *, |
|
const struct mdoc *); |
|
|
|
static struct termp *term_alloc(enum termenc); |
|
static void term_free(struct termp *); |
|
|
|
static void do_escaped(struct termp *, const char **); |
|
static void do_special(struct termp *, |
|
const char *, size_t); |
|
static void do_reserved(struct termp *, |
|
const char *, size_t); |
|
static void buffer(struct termp *, char); |
|
static void encode(struct termp *, char); |
|
|
|
|
|
void * |
|
ascii_alloc(void) |
|
{ |
|
|
|
return(term_alloc(TERMENC_ASCII)); |
|
} |
|
|
|
|
|
void |
void |
terminal_man(void *arg, const struct man *man) |
term_free(struct termp *p) |
{ |
{ |
struct termp *p; |
|
|
|
p = (struct termp *)arg; |
if (p->buf) |
if (NULL == p->symtab) |
free(p->buf); |
p->symtab = chars_init(CHARS_ASCII); |
if (p->symtab) |
|
mchars_free(p->symtab); |
|
|
man_run(p, man); |
free(p); |
} |
} |
|
|
|
|
void |
void |
terminal_mdoc(void *arg, const struct mdoc *mdoc) |
term_begin(struct termp *p, term_margin head, |
|
term_margin foot, const void *arg) |
{ |
{ |
struct termp *p; |
|
|
|
p = (struct termp *)arg; |
p->headf = head; |
if (NULL == p->symtab) |
p->footf = foot; |
p->symtab = chars_init(CHARS_ASCII); |
p->argf = arg; |
|
(*p->begin)(p); |
mdoc_run(p, mdoc); |
|
} |
} |
|
|
|
|
void |
void |
terminal_free(void *arg) |
term_end(struct termp *p) |
{ |
{ |
|
|
term_free((struct termp *)arg); |
(*p->end)(p); |
} |
} |
|
|
|
|
static void |
|
term_free(struct termp *p) |
|
{ |
|
|
|
if (p->buf) |
|
free(p->buf); |
|
if (p->symtab) |
|
chars_free(p->symtab); |
|
|
|
free(p); |
|
} |
|
|
|
|
|
static struct termp * |
|
term_alloc(enum termenc enc) |
|
{ |
|
struct termp *p; |
|
|
|
if (NULL == (p = malloc(sizeof(struct termp)))) |
|
return(NULL); |
|
bzero(p, sizeof(struct termp)); |
|
p->maxrmargin = 78; |
|
p->enc = enc; |
|
return(p); |
|
} |
|
|
|
|
|
/* |
/* |
* Flush a line of text. A "line" is loosely defined as being something |
* Flush a line of text. A "line" is loosely defined as being something |
* that should be followed by a newline, regardless of whether it's |
* that should be followed by a newline, regardless of whether it's |
* broken apart by newlines getting there. A line can also be a |
* broken apart by newlines getting there. A line can also be a |
* fragment of a columnar list. |
* fragment of a columnar list (`Bl -tag' or `Bl -column'), which does |
|
* not have a trailing newline. |
* |
* |
* Specifically, a line is whatever's in p->buf of length p->col, which |
* The following flags may be specified: |
* is zeroed after this function returns. |
|
* |
* |
* The usage of termp:flags is as follows: |
|
* |
|
* - TERMP_NOLPAD: when beginning to write the line, don't left-pad the |
|
* offset value. This is useful when doing columnar lists where the |
|
* prior column has right-padded. |
|
* |
|
* - TERMP_NOBREAK: this is the most important and is used when making |
* - TERMP_NOBREAK: this is the most important and is used when making |
* columns. In short: don't print a newline and instead pad to the |
* columns. In short: don't print a newline and instead expect the |
* right margin. Used in conjunction with TERMP_NOLPAD. |
* next call to do the padding up to the start of the next column. |
* |
* |
* - TERMP_TWOSPACE: when padding, make sure there are at least two |
* - TERMP_TWOSPACE: make sure there is room for at least two space |
* space characters of padding. Otherwise, rather break the line. |
* characters of padding. Otherwise, rather break the line. |
* |
* |
* - TERMP_DANGLE: don't newline when TERMP_NOBREAK is specified and |
* - TERMP_DANGLE: don't newline when TERMP_NOBREAK is specified and |
* the line is overrun, and don't pad-right if it's underrun. |
* the line is overrun, and don't pad-right if it's underrun. |
* |
* |
* - TERMP_HANG: like TERMP_DANGLE, but doesn't newline when |
* - TERMP_HANG: like TERMP_DANGLE, but doesn't newline when |
* overruning, instead save the position and continue at that point |
* overrunning, instead save the position and continue at that point |
* when the next invocation. |
* when the next invocation. |
* |
* |
* In-line line breaking: |
* In-line line breaking: |
Line 148 term_alloc(enum termenc enc) |
|
Line 98 term_alloc(enum termenc enc) |
|
* If TERMP_NOBREAK is specified and the line overruns the right |
* If TERMP_NOBREAK is specified and the line overruns the right |
* margin, it will break and pad-right to the right margin after |
* margin, it will break and pad-right to the right margin after |
* writing. If maxrmargin is violated, it will break and continue |
* writing. If maxrmargin is violated, it will break and continue |
* writing from the right-margin, which will lead to the above |
* writing from the right-margin, which will lead to the above scenario |
* scenario upon exit. |
* upon exit. Otherwise, the line will break at the right margin. |
* |
|
* Otherwise, the line will break at the right margin. Extremely long |
|
* lines will cause the system to emit a warning (TODO: hyphenate, if |
|
* possible). |
|
*/ |
*/ |
void |
void |
term_flushln(struct termp *p) |
term_flushln(struct termp *p) |
{ |
{ |
int i, j; |
int i; /* current input position in p->buf */ |
size_t vbl, vsz, vis, maxvis, mmax, bp; |
size_t vis; /* current visual position on output */ |
static int overstep = 0; |
size_t vbl; /* number of blanks to prepend to output */ |
|
size_t vend; /* end of word visual position on output */ |
|
size_t bp; /* visual right border position */ |
|
size_t dv; /* temporary for visual pos calculations */ |
|
int j; /* temporary loop index for p->buf */ |
|
int jhy; /* last hyph before overflow w/r/t j */ |
|
size_t maxvis; /* output position of visible boundary */ |
|
size_t mmax; /* used in calculating bp */ |
|
|
/* |
/* |
* First, establish the maximum columns of "visible" content. |
* First, establish the maximum columns of "visible" content. |
* This is usually the difference between the right-margin and |
* This is usually the difference between the right-margin and |
* an indentation, but can be, for tagged lists or columns, a |
* an indentation, but can be, for tagged lists or columns, a |
* small set of values. |
* small set of values. |
*/ |
*/ |
|
assert (p->rmargin >= p->offset); |
|
dv = p->rmargin - p->offset; |
|
maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
|
dv = p->maxrmargin - p->offset; |
|
mmax = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
|
|
assert(p->offset < p->rmargin); |
|
assert((int)(p->rmargin - p->offset) - overstep > 0); |
|
|
|
maxvis = /* LINTED */ |
|
p->rmargin - p->offset - overstep; |
|
mmax = /* LINTED */ |
|
p->maxrmargin - p->offset - overstep; |
|
|
|
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
vis = 0; |
|
overstep = 0; |
|
|
|
/* |
/* |
* If in the standard case (left-justified), then begin with our |
* Calculate the required amount of padding. |
* indentation, otherwise (columns, etc.) just start spitting |
|
* out text. |
|
*/ |
*/ |
|
vbl = p->offset + p->overstep > p->viscol ? |
|
p->offset + p->overstep - p->viscol : 0; |
|
|
if ( ! (p->flags & TERMP_NOLPAD)) |
vis = vend = 0; |
/* LINTED */ |
i = 0; |
for (j = 0; j < (int)p->offset; j++) |
|
putchar(' '); |
|
|
|
for (i = 0; i < (int)p->col; i++) { |
while (i < p->col) { |
/* |
/* |
|
* Handle literal tab characters: collapse all |
|
* subsequent tabs into a single huge set of spaces. |
|
*/ |
|
while (i < p->col && '\t' == p->buf[i]) { |
|
vend = (vis / p->tabwidth + 1) * p->tabwidth; |
|
vbl += vend - vis; |
|
vis = vend; |
|
i++; |
|
} |
|
|
|
/* |
* Count up visible word characters. Control sequences |
* Count up visible word characters. Control sequences |
* (starting with the CSI) aren't counted. A space |
* (starting with the CSI) aren't counted. A space |
* generates a non-printing word, which is valid (the |
* generates a non-printing word, which is valid (the |
* space is printed according to regular spacing rules). |
* space is printed according to regular spacing rules). |
*/ |
*/ |
|
|
/* LINTED */ |
for (j = i, jhy = 0; j < p->col; j++) { |
for (j = i, vsz = 0; j < (int)p->col; j++) { |
if ((j && ' ' == p->buf[j]) || '\t' == p->buf[j]) |
if (j && ' ' == p->buf[j]) |
|
break; |
break; |
else if (8 == p->buf[j]) |
|
vsz--; |
/* Back over the the last printed character. */ |
else |
if (8 == p->buf[j]) { |
vsz++; |
assert(j); |
|
vend -= (*p->width)(p, p->buf[j - 1]); |
|
continue; |
|
} |
|
|
|
/* Regular word. */ |
|
/* Break at the hyphen point if we overrun. */ |
|
if (vend > vis && vend < bp && |
|
ASCII_HYPH == p->buf[j]) |
|
jhy = j; |
|
|
|
vend += (*p->width)(p, p->buf[j]); |
} |
} |
|
|
/* |
/* |
* Choose the number of blanks to prepend: no blank at the |
|
* beginning of a line, one between words -- but do not |
|
* actually write them yet. |
|
*/ |
|
vbl = (size_t)(0 == vis ? 0 : 1); |
|
|
|
/* |
|
* Find out whether we would exceed the right margin. |
* Find out whether we would exceed the right margin. |
* If so, break to the next line. (TODO: hyphenate) |
* If so, break to the next line. |
* Otherwise, write the chosen number of blanks now. |
|
*/ |
*/ |
if (vis && vis + vbl + vsz > bp) { |
if (vend > bp && 0 == jhy && vis > 0) { |
putchar('\n'); |
vend -= vis; |
|
(*p->endline)(p); |
|
p->viscol = 0; |
if (TERMP_NOBREAK & p->flags) { |
if (TERMP_NOBREAK & p->flags) { |
for (j = 0; j < (int)p->rmargin; j++) |
vbl = p->rmargin; |
putchar(' '); |
vend += p->rmargin - p->offset; |
vis = p->rmargin - p->offset; |
} else |
} else { |
vbl = p->offset; |
for (j = 0; j < (int)p->offset; j++) |
|
putchar(' '); |
/* Remove the p->overstep width. */ |
vis = 0; |
|
} |
bp += (size_t)p->overstep; |
} else { |
p->overstep = 0; |
for (j = 0; j < (int)vbl; j++) |
|
putchar(' '); |
|
vis += vbl; |
|
} |
} |
|
|
/* |
/* Write out the [remaining] word. */ |
* Finally, write out the word. |
for ( ; i < p->col; i++) { |
*/ |
if (vend > bp && jhy > 0 && i > jhy) |
for ( ; i < (int)p->col; i++) { |
|
if (' ' == p->buf[i]) |
|
break; |
break; |
putchar(p->buf[i]); |
if ('\t' == p->buf[i]) |
|
break; |
|
if (' ' == p->buf[i]) { |
|
j = i; |
|
while (' ' == p->buf[i]) |
|
i++; |
|
dv = (size_t)(i - j) * (*p->width)(p, ' '); |
|
vbl += dv; |
|
vend += dv; |
|
break; |
|
} |
|
if (ASCII_NBRSP == p->buf[i]) { |
|
vbl += (*p->width)(p, ' '); |
|
continue; |
|
} |
|
|
|
/* |
|
* Now we definitely know there will be |
|
* printable characters to output, |
|
* so write preceding white space now. |
|
*/ |
|
if (vbl) { |
|
(*p->advance)(p, vbl); |
|
p->viscol += vbl; |
|
vbl = 0; |
|
} |
|
|
|
if (ASCII_HYPH == p->buf[i]) { |
|
(*p->letter)(p, '-'); |
|
p->viscol += (*p->width)(p, '-'); |
|
continue; |
|
} |
|
|
|
(*p->letter)(p, p->buf[i]); |
|
if (8 == p->buf[i]) |
|
p->viscol -= (*p->width)(p, p->buf[i-1]); |
|
else |
|
p->viscol += (*p->width)(p, p->buf[i]); |
} |
} |
vis += vsz; |
vis = vend; |
} |
} |
|
|
|
/* |
|
* If there was trailing white space, it was not printed; |
|
* so reset the cursor position accordingly. |
|
*/ |
|
if (vis) |
|
vis -= vbl; |
|
|
p->col = 0; |
p->col = 0; |
|
p->overstep = 0; |
|
|
if ( ! (TERMP_NOBREAK & p->flags)) { |
if ( ! (TERMP_NOBREAK & p->flags)) { |
putchar('\n'); |
p->viscol = 0; |
|
(*p->endline)(p); |
return; |
return; |
} |
} |
|
|
if (TERMP_HANG & p->flags) { |
if (TERMP_HANG & p->flags) { |
/* We need one blank after the tag. */ |
/* We need one blank after the tag. */ |
overstep = /* LINTED */ |
p->overstep = (int)(vis - maxvis + (*p->width)(p, ' ')); |
vis - maxvis + 1; |
|
|
|
/* |
/* |
* Behave exactly the same way as groff: |
* Behave exactly the same way as groff: |
Line 271 term_flushln(struct termp *p) |
|
Line 273 term_flushln(struct termp *p) |
|
* move it one step LEFT and flag the rest of the line |
* move it one step LEFT and flag the rest of the line |
* to be longer. |
* to be longer. |
*/ |
*/ |
if (overstep >= -1) { |
if (p->overstep < -1) |
assert((int)maxvis + overstep >= 0); |
p->overstep = 0; |
/* LINTED */ |
return; |
maxvis += overstep; |
|
} else |
|
overstep = 0; |
|
|
|
} else if (TERMP_DANGLE & p->flags) |
} else if (TERMP_DANGLE & p->flags) |
return; |
return; |
|
|
/* Right-pad. */ |
/* If the column was overrun, break the line. */ |
if (maxvis > vis + /* LINTED */ |
if (maxvis <= vis + |
((TERMP_TWOSPACE & p->flags) ? 1 : 0)) |
((TERMP_TWOSPACE & p->flags) ? (*p->width)(p, ' ') : 0)) { |
for ( ; vis < maxvis; vis++) |
(*p->endline)(p); |
putchar(' '); |
p->viscol = 0; |
else { /* ...or newline break. */ |
|
putchar('\n'); |
|
for (i = 0; i < (int)p->rmargin; i++) |
|
putchar(' '); |
|
} |
} |
} |
} |
|
|
Line 304 term_newln(struct termp *p) |
|
Line 299 term_newln(struct termp *p) |
|
{ |
{ |
|
|
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
if (0 == p->col) { |
if (p->col || p->viscol) |
p->flags &= ~TERMP_NOLPAD; |
term_flushln(p); |
return; |
|
} |
|
term_flushln(p); |
|
p->flags &= ~TERMP_NOLPAD; |
|
} |
} |
|
|
|
|
Line 324 term_vspace(struct termp *p) |
|
Line 315 term_vspace(struct termp *p) |
|
{ |
{ |
|
|
term_newln(p); |
term_newln(p); |
putchar('\n'); |
p->viscol = 0; |
|
if (0 < p->skipvsp) |
|
p->skipvsp--; |
|
else |
|
(*p->endline)(p); |
} |
} |
|
|
|
void |
|
term_fontlast(struct termp *p) |
|
{ |
|
enum termfont f; |
|
|
static void |
f = p->fontl; |
do_special(struct termp *p, const char *word, size_t len) |
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[p->fonti] = f; |
|
} |
|
|
|
|
|
void |
|
term_fontrepl(struct termp *p, enum termfont f) |
{ |
{ |
const char *rhs; |
|
size_t sz; |
|
int i; |
|
|
|
rhs = chars_a2ascii(p->symtab, word, len, &sz); |
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[p->fonti] = f; |
|
} |
|
|
if (NULL == rhs) { |
|
#if 0 |
void |
fputs("Unknown special character: ", stderr); |
term_fontpush(struct termp *p, enum termfont f) |
for (i = 0; i < (int)len; i++) |
{ |
fputc(word[i], stderr); |
|
fputc('\n', stderr); |
assert(p->fonti + 1 < 10); |
#endif |
p->fontl = p->fontq[p->fonti]; |
return; |
p->fontq[++p->fonti] = f; |
} |
|
for (i = 0; i < (int)sz; i++) |
|
encode(p, rhs[i]); |
|
} |
} |
|
|
|
|
static void |
const void * |
do_reserved(struct termp *p, const char *word, size_t len) |
term_fontq(struct termp *p) |
{ |
{ |
const char *rhs; |
|
size_t sz; |
|
int i; |
|
|
|
rhs = chars_a2res(p->symtab, word, len, &sz); |
return(&p->fontq[p->fonti]); |
|
} |
|
|
if (NULL == rhs) { |
|
#if 0 |
enum termfont |
fputs("Unknown reserved word: ", stderr); |
term_fonttop(struct termp *p) |
for (i = 0; i < (int)len; i++) |
{ |
fputc(word[i], stderr); |
|
fputc('\n', stderr); |
return(p->fontq[p->fonti]); |
#endif |
|
return; |
|
} |
|
for (i = 0; i < (int)sz; i++) |
|
encode(p, rhs[i]); |
|
} |
} |
|
|
|
|
|
void |
|
term_fontpopq(struct termp *p, const void *key) |
|
{ |
|
|
|
while (p->fonti >= 0 && key != &p->fontq[p->fonti]) |
|
p->fonti--; |
|
assert(p->fonti >= 0); |
|
} |
|
|
|
|
|
void |
|
term_fontpop(struct termp *p) |
|
{ |
|
|
|
assert(p->fonti); |
|
p->fonti--; |
|
} |
|
|
/* |
/* |
* Handle an escape sequence: determine its length and pass it to the |
* Handle pwords, partial words, which may be either a single word or a |
* escape-symbol look table. Note that we assume mdoc(3) has validated |
* phrase that cannot be broken down (such as a literal string). This |
* the escape sequence (we assert upon badly-formed escape sequences). |
* handles word styling. |
*/ |
*/ |
static void |
void |
do_escaped(struct termp *p, const char **word) |
term_word(struct termp *p, const char *word) |
{ |
{ |
int j, type; |
const char *seq, *cp; |
const char *wp; |
char c; |
|
int sz, uc; |
|
size_t ssz; |
|
enum mandoc_esc esc; |
|
|
wp = *word; |
if ( ! (TERMP_NOSPACE & p->flags)) { |
type = 1; |
if ( ! (TERMP_KEEP & p->flags)) { |
|
if (TERMP_PREKEEP & p->flags) |
if (0 == *(++wp)) { |
p->flags |= TERMP_KEEP; |
*word = wp; |
bufferc(p, ' '); |
return; |
if (TERMP_SENTENCE & p->flags) |
|
bufferc(p, ' '); |
|
} else |
|
bufferc(p, ASCII_NBRSP); |
} |
} |
|
|
if ('(' == *wp) { |
if ( ! (p->flags & TERMP_NONOSPACE)) |
wp++; |
p->flags &= ~TERMP_NOSPACE; |
if (0 == *wp || 0 == *(wp + 1)) { |
else |
*word = 0 == *wp ? wp : wp + 1; |
p->flags |= TERMP_NOSPACE; |
return; |
|
} |
|
|
|
do_special(p, wp, 2); |
p->flags &= ~(TERMP_SENTENCE | TERMP_IGNDELIM); |
*word = ++wp; |
|
return; |
|
|
|
} else if ('*' == *wp) { |
while ('\0' != *word) { |
if (0 == *(++wp)) { |
if ((ssz = strcspn(word, "\\")) > 0) |
*word = wp; |
encode(p, word, ssz); |
return; |
|
} |
|
|
|
switch (*wp) { |
word += (int)ssz; |
case ('('): |
if ('\\' != *word) |
wp++; |
continue; |
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
|
return; |
|
} |
|
|
|
do_reserved(p, wp, 2); |
word++; |
*word = ++wp; |
esc = mandoc_escape(&word, &seq, &sz); |
return; |
if (ESCAPE_ERROR == esc) |
case ('['): |
|
type = 0; |
|
break; |
break; |
default: |
|
do_reserved(p, wp, 1); |
|
*word = wp; |
|
return; |
|
} |
|
|
|
} else if ('f' == *wp) { |
|
if (0 == *(++wp)) { |
|
*word = wp; |
|
return; |
|
} |
|
|
|
switch (*wp) { |
if (TERMENC_ASCII != p->enc) |
case ('B'): |
switch (esc) { |
p->bold++; |
case (ESCAPE_UNICODE): |
|
uc = mchars_num2uc(seq + 1, sz - 1); |
|
if ('\0' == uc) |
|
break; |
|
encode1(p, uc); |
|
continue; |
|
case (ESCAPE_SPECIAL): |
|
uc = mchars_spec2cp(p->symtab, seq, sz); |
|
if (uc <= 0) |
|
break; |
|
encode1(p, uc); |
|
continue; |
|
default: |
|
break; |
|
} |
|
|
|
switch (esc) { |
|
case (ESCAPE_UNICODE): |
|
encode1(p, '?'); |
break; |
break; |
case ('I'): |
case (ESCAPE_NUMBERED): |
p->under++; |
c = mchars_num2char(seq, sz); |
|
if ('\0' != c) |
|
encode(p, &c, 1); |
break; |
break; |
case ('P'): |
case (ESCAPE_SPECIAL): |
|
cp = mchars_spec2str(p->symtab, seq, sz, &ssz); |
|
if (NULL != cp) |
|
encode(p, cp, ssz); |
|
else if (1 == ssz) |
|
encode(p, seq, sz); |
|
break; |
|
case (ESCAPE_FONTBOLD): |
|
term_fontrepl(p, TERMFONT_BOLD); |
|
break; |
|
case (ESCAPE_FONTITALIC): |
|
term_fontrepl(p, TERMFONT_UNDER); |
|
break; |
|
case (ESCAPE_FONT): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('R'): |
case (ESCAPE_FONTROMAN): |
p->bold = p->under = 0; |
term_fontrepl(p, TERMFONT_NONE); |
break; |
break; |
|
case (ESCAPE_FONTPREV): |
|
term_fontlast(p); |
|
break; |
|
case (ESCAPE_NOSPACE): |
|
if ('\0' == *word) |
|
p->flags |= TERMP_NOSPACE; |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
|
} |
|
} |
|
|
*word = wp; |
static void |
|
adjbuf(struct termp *p, int sz) |
|
{ |
|
|
|
if (0 == p->maxcols) |
|
p->maxcols = 1024; |
|
while (sz >= p->maxcols) |
|
p->maxcols <<= 2; |
|
|
|
p->buf = mandoc_realloc |
|
(p->buf, sizeof(int) * (size_t)p->maxcols); |
|
} |
|
|
|
static void |
|
bufferc(struct termp *p, char c) |
|
{ |
|
|
|
if (p->col + 1 >= p->maxcols) |
|
adjbuf(p, p->col + 1); |
|
|
|
p->buf[p->col++] = c; |
|
} |
|
|
|
/* |
|
* See encode(). |
|
* Do this for a single (probably unicode) value. |
|
* Does not check for non-decorated glyphs. |
|
*/ |
|
static void |
|
encode1(struct termp *p, int c) |
|
{ |
|
enum termfont f; |
|
|
|
if (p->col + 4 >= p->maxcols) |
|
adjbuf(p, p->col + 4); |
|
|
|
f = term_fonttop(p); |
|
|
|
if (TERMFONT_NONE == f) { |
|
p->buf[p->col++] = c; |
return; |
return; |
|
} else if (TERMFONT_UNDER == f) { |
|
p->buf[p->col++] = '_'; |
|
} else |
|
p->buf[p->col++] = c; |
|
|
} else if ('[' != *wp) { |
p->buf[p->col++] = 8; |
do_special(p, wp, 1); |
p->buf[p->col++] = c; |
*word = wp; |
} |
|
|
|
static void |
|
encode(struct termp *p, const char *word, size_t sz) |
|
{ |
|
enum termfont f; |
|
int i, len; |
|
|
|
/* LINTED */ |
|
len = sz; |
|
|
|
/* |
|
* Encode and buffer a string of characters. If the current |
|
* font mode is unset, buffer directly, else encode then buffer |
|
* character by character. |
|
*/ |
|
|
|
if (TERMFONT_NONE == (f = term_fonttop(p))) { |
|
if (p->col + len >= p->maxcols) |
|
adjbuf(p, p->col + len); |
|
for (i = 0; i < len; i++) |
|
p->buf[p->col++] = word[i]; |
return; |
return; |
} |
} |
|
|
wp++; |
/* Pre-buffer, assuming worst-case. */ |
for (j = 0; *wp && ']' != *wp; wp++, j++) |
|
/* Loop... */ ; |
|
|
|
if (0 == *wp) { |
if (p->col + 1 + (len * 3) >= p->maxcols) |
*word = wp; |
adjbuf(p, p->col + 1 + (len * 3)); |
return; |
|
|
for (i = 0; i < len; i++) { |
|
if (ASCII_HYPH != word[i] && |
|
! isgraph((unsigned char)word[i])) { |
|
p->buf[p->col++] = word[i]; |
|
continue; |
|
} |
|
|
|
if (TERMFONT_UNDER == f) |
|
p->buf[p->col++] = '_'; |
|
else if (ASCII_HYPH == word[i]) |
|
p->buf[p->col++] = '-'; |
|
else |
|
p->buf[p->col++] = word[i]; |
|
|
|
p->buf[p->col++] = 8; |
|
p->buf[p->col++] = word[i]; |
} |
} |
|
} |
|
|
if (type) |
size_t |
do_special(p, wp - j, (size_t)j); |
term_len(const struct termp *p, size_t sz) |
else |
{ |
do_reserved(p, wp - j, (size_t)j); |
|
*word = wp; |
return((*p->width)(p, ' ') * sz); |
} |
} |
|
|
|
|
/* |
size_t |
* Handle pwords, partial words, which may be either a single word or a |
term_strlen(const struct termp *p, const char *cp) |
* phrase that cannot be broken down (such as a literal string). This |
|
* handles word styling. |
|
*/ |
|
void |
|
term_word(struct termp *p, const char *word) |
|
{ |
{ |
const char *sv; |
size_t sz, rsz, i; |
|
int ssz, c; |
|
const char *seq, *rhs; |
|
enum mandoc_esc esc; |
|
static const char rej[] = { '\\', ASCII_HYPH, ASCII_NBRSP, '\0' }; |
|
|
sv = word; |
/* |
|
* Account for escaped sequences within string length |
|
* calculations. This follows the logic in term_word() as we |
|
* must calculate the width of produced strings. |
|
*/ |
|
|
if (word[0] && 0 == word[1]) |
sz = 0; |
switch (word[0]) { |
while ('\0' != *cp) { |
case('.'): |
rsz = strcspn(cp, rej); |
/* FALLTHROUGH */ |
for (i = 0; i < rsz; i++) |
case(','): |
sz += (*p->width)(p, *cp++); |
/* FALLTHROUGH */ |
|
case(';'): |
|
/* FALLTHROUGH */ |
|
case(':'): |
|
/* FALLTHROUGH */ |
|
case('?'): |
|
/* FALLTHROUGH */ |
|
case('!'): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
/* FALLTHROUGH */ |
|
case('}'): |
|
if ( ! (TERMP_IGNDELIM & p->flags)) |
|
p->flags |= TERMP_NOSPACE; |
|
break; |
|
default: |
|
break; |
|
} |
|
|
|
if ( ! (TERMP_NOSPACE & p->flags)) |
c = 0; |
buffer(p, ' '); |
switch (*cp) { |
|
case ('\\'): |
|
cp++; |
|
esc = mandoc_escape(&cp, &seq, &ssz); |
|
if (ESCAPE_ERROR == esc) |
|
return(sz); |
|
|
if ( ! (p->flags & TERMP_NONOSPACE)) |
if (TERMENC_ASCII != p->enc) |
p->flags &= ~TERMP_NOSPACE; |
switch (esc) { |
|
case (ESCAPE_UNICODE): |
|
c = mchars_num2uc |
|
(seq + 1, ssz - 1); |
|
if ('\0' == c) |
|
break; |
|
sz += (*p->width)(p, c); |
|
continue; |
|
case (ESCAPE_SPECIAL): |
|
c = mchars_spec2cp |
|
(p->symtab, seq, ssz); |
|
if (c <= 0) |
|
break; |
|
sz += (*p->width)(p, c); |
|
continue; |
|
default: |
|
break; |
|
} |
|
|
for ( ; *word; word++) |
rhs = NULL; |
if ('\\' != *word) |
|
encode(p, *word); |
|
else |
|
do_escaped(p, &word); |
|
|
|
if (sv[0] && 0 == sv[1]) |
switch (esc) { |
switch (sv[0]) { |
case (ESCAPE_UNICODE): |
case('('): |
sz += (*p->width)(p, '?'); |
/* FALLTHROUGH */ |
break; |
case('['): |
case (ESCAPE_NUMBERED): |
/* FALLTHROUGH */ |
c = mchars_num2char(seq, ssz); |
case('{'): |
if ('\0' != c) |
p->flags |= TERMP_NOSPACE; |
sz += (*p->width)(p, c); |
|
break; |
|
case (ESCAPE_SPECIAL): |
|
rhs = mchars_spec2str |
|
(p->symtab, seq, ssz, &rsz); |
|
|
|
if (ssz != 1 || rhs) |
|
break; |
|
|
|
rhs = seq; |
|
rsz = ssz; |
|
break; |
|
default: |
|
break; |
|
} |
|
|
|
if (NULL == rhs) |
|
break; |
|
|
|
for (i = 0; i < rsz; i++) |
|
sz += (*p->width)(p, *rhs++); |
break; |
break; |
|
case (ASCII_NBRSP): |
|
sz += (*p->width)(p, ' '); |
|
cp++; |
|
break; |
|
case (ASCII_HYPH): |
|
sz += (*p->width)(p, '-'); |
|
cp++; |
|
break; |
default: |
default: |
break; |
break; |
} |
} |
|
} |
|
|
|
return(sz); |
} |
} |
|
|
|
/* ARGSUSED */ |
/* |
size_t |
* Insert a single character into the line-buffer. If the buffer's |
term_vspan(const struct termp *p, const struct roffsu *su) |
* space is exceeded, then allocate more space by doubling the buffer |
|
* size. |
|
*/ |
|
static void |
|
buffer(struct termp *p, char c) |
|
{ |
{ |
size_t s; |
double r; |
|
|
if (p->col + 1 >= p->maxcols) { |
switch (su->unit) { |
if (0 == p->maxcols) |
case (SCALE_CM): |
p->maxcols = 256; |
r = su->scale * 2; |
s = p->maxcols * 2; |
break; |
p->buf = realloc(p->buf, s); |
case (SCALE_IN): |
if (NULL == p->buf) |
r = su->scale * 6; |
err(1, "realloc"); /* FIXME: shouldn't be here! */ |
break; |
p->maxcols = s; |
case (SCALE_PC): |
|
r = su->scale; |
|
break; |
|
case (SCALE_PT): |
|
r = su->scale / 8; |
|
break; |
|
case (SCALE_MM): |
|
r = su->scale / 1000; |
|
break; |
|
case (SCALE_VS): |
|
r = su->scale; |
|
break; |
|
default: |
|
r = su->scale - 1; |
|
break; |
} |
} |
p->buf[(int)(p->col)++] = c; |
|
|
if (r < 0.0) |
|
r = 0.0; |
|
return(/* LINTED */(size_t) |
|
r); |
} |
} |
|
|
|
size_t |
static void |
term_hspan(const struct termp *p, const struct roffsu *su) |
encode(struct termp *p, char c) |
|
{ |
{ |
|
double v; |
if (' ' != c) { |
|
if (p->bold) { |
v = ((*p->hspan)(p, su)); |
buffer(p, c); |
if (v < 0.0) |
buffer(p, 8); |
v = 0.0; |
} |
return((size_t) /* LINTED */ |
if (p->under) { |
v); |
buffer(p, '_'); |
|
buffer(p, 8); |
|
} |
|
} |
|
buffer(p, c); |
|
} |
} |