version 1.6, 2009/02/21 21:00:06 |
version 1.280, 2019/01/15 12:16:18 |
|
|
/* $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-2019 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 |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* PERFORMANCE OF THIS SOFTWARE. |
|
*/ |
*/ |
|
#include "config.h" |
|
|
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
#include <err.h> |
#include <stdint.h> |
#include <stdlib.h> |
|
#include <stdio.h> |
#include <stdio.h> |
|
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <unistd.h> |
|
|
|
|
#include "mandoc.h" |
|
#include "mandoc_aux.h" |
|
#include "out.h" |
#include "term.h" |
#include "term.h" |
|
#include "main.h" |
|
|
enum termstyle { |
static size_t cond_width(const struct termp *, int, int *); |
STYLE_CLEAR, |
static void adjbuf(struct termp_col *, size_t); |
STYLE_BOLD, |
static void bufferc(struct termp *, char); |
STYLE_UNDERLINE |
static void encode(struct termp *, const char *, size_t); |
}; |
static void encode1(struct termp *, int); |
|
static void endline(struct termp *); |
|
static void term_field(struct termp *, size_t, size_t, |
|
size_t, size_t); |
|
static void term_fill(struct termp *, size_t *, size_t *, |
|
size_t); |
|
|
static void termprint_r(struct termp *, |
|
const struct mdoc_meta *, |
|
const struct mdoc_node *); |
|
static void termprint_header(struct termp *, |
|
const struct mdoc_meta *); |
|
static void termprint_footer(struct termp *, |
|
const struct mdoc_meta *); |
|
|
|
static void pword(struct termp *, const char *, size_t); |
void |
static void pescape(struct termp *, |
term_setcol(struct termp *p, size_t maxtcol) |
const char *, size_t *, size_t); |
{ |
static void chara(struct termp *, char); |
if (maxtcol > p->maxtcol) { |
static void style(struct termp *, enum termstyle); |
p->tcols = mandoc_recallocarray(p->tcols, |
|
p->maxtcol, maxtcol, sizeof(*p->tcols)); |
|
p->maxtcol = maxtcol; |
|
} |
|
p->lasttcol = maxtcol - 1; |
|
p->tcol = p->tcols; |
|
} |
|
|
|
void |
|
term_free(struct termp *p) |
|
{ |
|
for (p->tcol = p->tcols; p->tcol < p->tcols + p->maxtcol; p->tcol++) |
|
free(p->tcol->buf); |
|
free(p->tcols); |
|
free(p->fontq); |
|
free(p); |
|
} |
|
|
void |
void |
flushln(struct termp *p) |
term_begin(struct termp *p, term_margin head, |
|
term_margin foot, const struct roff_meta *arg) |
{ |
{ |
size_t i, j, vsz, vis, maxvis; |
|
|
|
/* |
p->headf = head; |
* First, establish the maximum columns of "visible" content. |
p->footf = foot; |
* This is usually the difference between the right-margin and |
p->argf = arg; |
* an indentation, but can be, for tagged lists or columns, a |
(*p->begin)(p); |
* small set of values. |
} |
*/ |
|
|
|
assert(p->offset < p->rmargin); |
void |
maxvis = p->rmargin - p->offset; |
term_end(struct termp *p) |
vis = 0; |
{ |
|
|
|
(*p->end)(p); |
|
} |
|
|
|
/* |
|
* Flush a chunk of text. By default, break the output line each time |
|
* the right margin is reached, and continue output on the next line |
|
* at the same offset as the chunk itself. By default, also break the |
|
* output line at the end of the chunk. There are many flags modifying |
|
* this behaviour, see the comments in the body of the function. |
|
*/ |
|
void |
|
term_flushln(struct termp *p) |
|
{ |
|
size_t vbl; /* Number of blanks to prepend to the output. */ |
|
size_t vbr; /* Actual visual position of the end of field. */ |
|
size_t vfield; /* Desired visual field width. */ |
|
size_t vtarget; /* Desired visual position of the right margin. */ |
|
size_t ic; /* Character position in the input buffer. */ |
|
size_t nbr; /* Number of characters to print in this field. */ |
|
|
/* |
/* |
* If in the standard case (left-justified), then begin with our |
* Normally, start writing at the left margin, but with the |
* indentation, otherwise (columns, etc.) just start spitting |
* NOPAD flag, start writing at the current position instead. |
* out text. |
|
*/ |
*/ |
|
|
if ( ! (p->flags & TERMP_NOLPAD)) |
vbl = (p->flags & TERMP_NOPAD) || p->tcol->offset < p->viscol ? |
/* LINTED */ |
0 : p->tcol->offset - p->viscol; |
for (j = 0; j < p->offset; j++) |
if (p->minbl && vbl < p->minbl) |
putchar(' '); |
vbl = p->minbl; |
|
|
for (i = 0; i < p->col; i++) { |
if ((p->flags & TERMP_MULTICOL) == 0) |
|
p->tcol->col = 0; |
|
|
|
/* Loop over output lines. */ |
|
|
|
for (;;) { |
|
vfield = p->tcol->rmargin > p->viscol + vbl ? |
|
p->tcol->rmargin - p->viscol - vbl : 0; |
|
|
/* |
/* |
* Count up visible word characters. Control sequences |
* Normally, break the line at the the right margin |
* (starting with the CSI) aren't counted. |
* of the field, but with the NOBREAK flag, only |
|
* break it at the max right margin of the screen, |
|
* and with the BRNEVER flag, never break it at all. |
*/ |
*/ |
assert( ! isspace(p->buf[i])); |
|
|
|
/* LINTED */ |
vtarget = p->flags & TERMP_BRNEVER ? SIZE_MAX : |
for (j = i, vsz = 0; j < p->col; j++) { |
(p->flags & TERMP_NOBREAK) == 0 ? vfield : |
if (isspace(p->buf[j])) |
p->maxrmargin > p->viscol + vbl ? |
break; |
p->maxrmargin - p->viscol - vbl : 0; |
else if (27 == p->buf[j]) { |
|
assert(j + 4 <= p->col); |
|
j += 3; |
|
} else |
|
vsz++; |
|
} |
|
assert(vsz > 0); |
|
|
|
/* |
/* |
* If a word is too long and we're within a line, put it |
* Figure out how much text will fit in the field. |
* on the next line. Puke if we're being asked to write |
* If there is whitespace only, print nothing. |
* something that will exceed the right margin (i.e., |
|
* from a fresh line or when we're not allowed to break |
|
* the line with TERMP_NOBREAK). |
|
*/ |
*/ |
|
|
if (vis && vis + vsz >= maxvis) { |
term_fill(p, &nbr, &vbr, vtarget); |
/* FIXME */ |
if (nbr == 0) |
if (p->flags & TERMP_NOBREAK) |
break; |
errx(1, "word breaks right margin"); |
|
putchar('\n'); |
/* |
for (j = 0; j < p->offset; j++) |
* With the CENTER or RIGHT flag, increase the indentation |
putchar(' '); |
* to center the text between the left and right margins |
vis = 0; |
* or to adjust it to the right margin, respectively. |
} else if (vis + vsz >= maxvis) { |
*/ |
/* FIXME */ |
|
errx(1, "word breaks right margin"); |
if (vbr < vtarget) { |
|
if (p->flags & TERMP_CENTER) |
|
vbl += (vtarget - vbr) / 2; |
|
else if (p->flags & TERMP_RIGHT) |
|
vbl += vtarget - vbr; |
} |
} |
|
|
/* |
/* Finally, print the field content. */ |
* Write out the word and a trailing space. Omit the |
|
* space if we're the last word in the line. |
term_field(p, vbl, nbr, vbr, vtarget); |
|
|
|
/* |
|
* If there is no text left in the field, exit the loop. |
|
* If the BRTRSP flag is set, consider trailing |
|
* whitespace significant when deciding whether |
|
* the field fits or not. |
*/ |
*/ |
|
|
for ( ; i < p->col; i++) { |
for (ic = p->tcol->col; ic < p->tcol->lastcol; ic++) { |
if (isspace(p->buf[i])) |
switch (p->tcol->buf[ic]) { |
|
case '\t': |
|
if (p->flags & TERMP_BRTRSP) |
|
vbr = term_tab_next(vbr); |
|
continue; |
|
case ' ': |
|
if (p->flags & TERMP_BRTRSP) |
|
vbr += (*p->width)(p, ' '); |
|
continue; |
|
case '\n': |
|
case ASCII_BREAK: |
|
continue; |
|
default: |
break; |
break; |
putchar(p->buf[i]); |
} |
|
break; |
} |
} |
vis += vsz; |
if (ic == p->tcol->lastcol) |
if (i < p->col) { |
break; |
putchar(' '); |
|
vis++; |
|
} |
|
} |
|
|
|
/* |
/* |
* If we're not to right-marginalise it (newline), then instead |
* At the location of an automtic line break, input |
* pad to the right margin and stay off. |
* space characters are consumed by the line break. |
*/ |
*/ |
|
|
if (p->flags & TERMP_NOBREAK) { |
while (p->tcol->col < p->tcol->lastcol && |
for ( ; vis <= maxvis; vis++) |
p->tcol->buf[p->tcol->col] == ' ') |
putchar(' '); |
p->tcol->col++; |
} else |
|
putchar('\n'); |
|
|
|
p->col = 0; |
/* |
} |
* In multi-column mode, leave the rest of the text |
|
* in the buffer to be handled by a subsequent |
|
* invocation, such that the other columns of the |
|
* table can be handled first. |
|
* In single-column mode, simply break the line. |
|
*/ |
|
|
|
if (p->flags & TERMP_MULTICOL) |
|
return; |
|
|
void |
endline(p); |
newln(struct termp *p) |
p->viscol = 0; |
{ |
|
|
|
/* |
/* |
* A newline only breaks an existing line; it won't assert |
* Normally, start the next line at the same indentation |
* vertical space. |
* as this one, but with the BRIND flag, start it at the |
*/ |
* right margin instead. This is used together with |
p->flags |= TERMP_NOSPACE; |
* NOBREAK for the tags in various kinds of tagged lists. |
if (0 == p->col) |
*/ |
return; |
|
flushln(p); |
|
} |
|
|
|
|
vbl = p->flags & TERMP_BRIND ? |
|
p->tcol->rmargin : p->tcol->offset; |
|
} |
|
|
void |
/* Reset output state in preparation for the next field. */ |
vspace(struct termp *p) |
|
{ |
|
|
|
|
p->col = p->tcol->col = p->tcol->lastcol = 0; |
|
p->minbl = p->trailspace; |
|
p->flags &= ~(TERMP_BACKAFTER | TERMP_BACKBEFORE | TERMP_NOPAD); |
|
|
|
if (p->flags & TERMP_MULTICOL) |
|
return; |
|
|
/* |
/* |
* Asserts a vertical space (a full, empty line-break between |
* The HANG flag means that the next field |
* lines). |
* always follows on the same line. |
|
* The NOBREAK flag means that the next field |
|
* follows on the same line unless the field was overrun. |
|
* Normally, break the line at the end of each field. |
*/ |
*/ |
newln(p); |
|
putchar('\n'); |
if ((p->flags & TERMP_HANG) == 0 && |
|
((p->flags & TERMP_NOBREAK) == 0 || |
|
vbr + term_len(p, p->trailspace) > vfield)) |
|
endline(p); |
} |
} |
|
|
|
/* |
|
* Store the number of input characters to print in this field in *nbr |
|
* and their total visual width to print in *vbr. |
|
* If there is only whitespace in the field, both remain zero. |
|
* The desired visual width of the field is provided by vtarget. |
|
* If the first word is longer, the field will be overrun. |
|
*/ |
static void |
static void |
chara(struct termp *p, char c) |
term_fill(struct termp *p, size_t *nbr, size_t *vbr, size_t vtarget) |
{ |
{ |
|
size_t ic; /* Character position in the input buffer. */ |
|
size_t vis; /* Visual position of the current character. */ |
|
size_t vn; /* Visual position of the next character. */ |
|
int breakline; /* Break at the end of this word. */ |
|
int graph; /* Last character was non-blank. */ |
|
|
/* TODO: dynamically expand the buffer. */ |
*nbr = *vbr = vis = 0; |
if (p->col + 1 >= p->maxcols) |
breakline = graph = 0; |
errx(1, "line overrun"); |
for (ic = p->tcol->col; ic < p->tcol->lastcol; ic++) { |
p->buf[(p->col)++] = c; |
switch (p->tcol->buf[ic]) { |
} |
case '\b': /* Escape \o (overstrike) or backspace markup. */ |
|
assert(ic > 0); |
|
vis -= (*p->width)(p, p->tcol->buf[ic - 1]); |
|
continue; |
|
|
|
case '\t': /* Normal ASCII whitespace. */ |
|
case ' ': |
|
case ASCII_BREAK: /* Escape \: (breakpoint). */ |
|
switch (p->tcol->buf[ic]) { |
|
case '\t': |
|
vn = term_tab_next(vis); |
|
break; |
|
case ' ': |
|
vn = vis + (*p->width)(p, ' '); |
|
break; |
|
case ASCII_BREAK: |
|
vn = vis; |
|
break; |
|
} |
|
/* Can break at the end of a word. */ |
|
if (breakline || vn > vtarget) |
|
break; |
|
if (graph) { |
|
*nbr = ic; |
|
*vbr = vis; |
|
graph = 0; |
|
} |
|
vis = vn; |
|
continue; |
|
|
static void |
case '\n': /* Escape \p (break at the end of the word). */ |
style(struct termp *p, enum termstyle esc) |
breakline = 1; |
{ |
continue; |
|
|
if (p->col + 4 >= p->maxcols) |
case ASCII_HYPH: /* Breakable hyphen. */ |
errx(1, "line overrun"); |
graph = 1; |
|
/* |
|
* We are about to decide whether to break the |
|
* line or not, so we no longer need this hyphen |
|
* to be marked as breakable. Put back a real |
|
* hyphen such that we get the correct width. |
|
*/ |
|
p->tcol->buf[ic] = '-'; |
|
vis += (*p->width)(p, '-'); |
|
if (vis > vtarget) { |
|
ic++; |
|
break; |
|
} |
|
*nbr = ic + 1; |
|
*vbr = vis; |
|
continue; |
|
|
p->buf[(p->col)++] = 27; |
case ASCII_NBRSP: /* Non-breakable space. */ |
p->buf[(p->col)++] = '['; |
p->tcol->buf[ic] = ' '; |
switch (esc) { |
/* FALLTHROUGH */ |
case (STYLE_CLEAR): |
default: /* Printable character. */ |
p->buf[(p->col)++] = '0'; |
graph = 1; |
|
vis += (*p->width)(p, p->tcol->buf[ic]); |
|
if (vis > vtarget && *nbr > 0) |
|
return; |
|
continue; |
|
} |
break; |
break; |
case (STYLE_BOLD): |
|
p->buf[(p->col)++] = '1'; |
|
break; |
|
case (STYLE_UNDERLINE): |
|
p->buf[(p->col)++] = '4'; |
|
break; |
|
default: |
|
abort(); |
|
/* NOTREACHED */ |
|
} |
} |
p->buf[(p->col)++] = 'm'; |
|
} |
|
|
|
|
/* |
|
* If the last word extends to the end of the field without any |
|
* trailing whitespace, the loop could not check yet whether it |
|
* can remain on this line. So do the check now. |
|
*/ |
|
|
|
if (graph && (vis <= vtarget || *nbr == 0)) { |
|
*nbr = ic; |
|
*vbr = vis; |
|
} |
|
} |
|
|
|
/* |
|
* Print the contents of one field |
|
* with an indentation of vbl visual columns, |
|
* an input string length of nbr characters, |
|
* an output width of vbr visual columns, |
|
* and a desired field width of vtarget visual columns. |
|
*/ |
static void |
static void |
pescape(struct termp *p, const char *word, size_t *i, size_t len) |
term_field(struct termp *p, size_t vbl, size_t nbr, size_t vbr, size_t vtarget) |
{ |
{ |
|
size_t ic; /* Character position in the input buffer. */ |
|
size_t vis; /* Visual position of the current character. */ |
|
size_t dv; /* Visual width of the current character. */ |
|
size_t vn; /* Visual position of the next character. */ |
|
|
(*i)++; |
vis = 0; |
assert(*i < len); |
for (ic = p->tcol->col; ic < nbr; ic++) { |
|
|
if ('(' == word[*i]) { |
/* |
/* Two-character escapes. */ |
* To avoid the printing of trailing whitespace, |
(*i)++; |
* do not print whitespace right away, only count it. |
assert(*i + 1 < len); |
*/ |
|
|
if ('r' == word[*i] && 'B' == word[*i + 1]) |
switch (p->tcol->buf[ic]) { |
chara(p, ']'); |
case '\n': |
else if ('l' == word[*i] && 'B' == word[*i + 1]) |
case ASCII_BREAK: |
chara(p, '['); |
continue; |
|
case '\t': |
(*i)++; |
vn = term_tab_next(vis); |
return; |
vbl += vn - vis; |
|
vis = vn; |
} else if ('[' != word[*i]) { |
continue; |
/* One-character escapes. */ |
case ' ': |
switch (word[*i]) { |
case ASCII_NBRSP: |
case ('\\'): |
dv = (*p->width)(p, ' '); |
/* FALLTHROUGH */ |
vbl += dv; |
case ('\''): |
vis += dv; |
/* FALLTHROUGH */ |
continue; |
case ('`'): |
|
/* FALLTHROUGH */ |
|
case ('-'): |
|
/* FALLTHROUGH */ |
|
case ('.'): |
|
chara(p, word[*i]); |
|
default: |
default: |
break; |
break; |
} |
} |
return; |
|
|
/* |
|
* We found a non-blank character to print, |
|
* so write preceding white space now. |
|
*/ |
|
|
|
if (vbl > 0) { |
|
(*p->advance)(p, vbl); |
|
p->viscol += vbl; |
|
vbl = 0; |
|
} |
|
|
|
/* Print the character and adjust the visual position. */ |
|
|
|
(*p->letter)(p, p->tcol->buf[ic]); |
|
if (p->tcol->buf[ic] == '\b') { |
|
dv = (*p->width)(p, p->tcol->buf[ic - 1]); |
|
p->viscol -= dv; |
|
vis -= dv; |
|
} else { |
|
dv = (*p->width)(p, p->tcol->buf[ic]); |
|
p->viscol += dv; |
|
vis += dv; |
|
} |
} |
} |
/* n-character escapes. */ |
p->tcol->col = nbr; |
} |
} |
|
|
|
|
static void |
static void |
pword(struct termp *p, const char *word, size_t len) |
endline(struct termp *p) |
{ |
{ |
size_t i; |
if ((p->flags & (TERMP_NEWMC | TERMP_ENDMC)) == TERMP_ENDMC) { |
|
p->mc = NULL; |
|
p->flags &= ~TERMP_ENDMC; |
|
} |
|
if (p->mc != NULL) { |
|
if (p->viscol && p->maxrmargin >= p->viscol) |
|
(*p->advance)(p, p->maxrmargin - p->viscol + 1); |
|
p->flags |= TERMP_NOBUF | TERMP_NOSPACE; |
|
term_word(p, p->mc); |
|
p->flags &= ~(TERMP_NOBUF | TERMP_NEWMC); |
|
} |
|
p->viscol = 0; |
|
p->minbl = 0; |
|
(*p->endline)(p); |
|
} |
|
|
assert(len > 0); |
/* |
|
* A newline only breaks an existing line; it won't assert vertical |
|
* space. All data in the output buffer is flushed prior to the newline |
|
* assertion. |
|
*/ |
|
void |
|
term_newln(struct termp *p) |
|
{ |
|
|
if ( ! (p->flags & TERMP_NOSPACE)) |
p->flags |= TERMP_NOSPACE; |
chara(p, ' '); |
if (p->tcol->lastcol || p->viscol) |
|
term_flushln(p); |
|
} |
|
|
p->flags &= ~TERMP_NOSPACE; |
/* |
|
* Asserts a vertical space (a full, empty line-break between lines). |
|
* Note that if used twice, this will cause two blank spaces and so on. |
|
* All data in the output buffer is flushed prior to the newline |
|
* assertion. |
|
*/ |
|
void |
|
term_vspace(struct termp *p) |
|
{ |
|
|
if (p->flags & TERMP_BOLD) |
term_newln(p); |
style(p, STYLE_BOLD); |
p->viscol = 0; |
if (p->flags & TERMP_UNDERLINE) |
p->minbl = 0; |
style(p, STYLE_UNDERLINE); |
if (0 < p->skipvsp) |
|
p->skipvsp--; |
|
else |
|
(*p->endline)(p); |
|
} |
|
|
for (i = 0; i < len; i++) { |
/* Swap current and previous font; for \fP and .ft P */ |
if ('\\' == word[i]) { |
void |
pescape(p, word, &i, len); |
term_fontlast(struct termp *p) |
continue; |
{ |
} |
enum termfont f; |
chara(p, word[i]); |
|
} |
|
|
|
if (p->flags & TERMP_BOLD || |
f = p->fontl; |
p->flags & TERMP_UNDERLINE) |
p->fontl = p->fontq[p->fonti]; |
style(p, STYLE_CLEAR); |
p->fontq[p->fonti] = f; |
} |
} |
|
|
|
/* Set font, save current, discard previous; for \f, .ft, .B etc. */ |
void |
void |
word(struct termp *p, const char *word) |
term_fontrepl(struct termp *p, enum termfont f) |
{ |
{ |
size_t i, j, len; |
|
|
|
if (mdoc_isdelim(word)) |
p->fontl = p->fontq[p->fonti]; |
p->flags |= TERMP_NOSPACE; |
p->fontq[p->fonti] = f; |
|
} |
|
|
len = strlen(word); |
/* Set font, save previous. */ |
assert(len > 0); |
void |
|
term_fontpush(struct termp *p, enum termfont f) |
|
{ |
|
|
/* LINTED */ |
p->fontl = p->fontq[p->fonti]; |
for (j = i = 0; i < len; i++) { |
if (++p->fonti == p->fontsz) { |
if ( ! isspace(word[i])) { |
p->fontsz += 8; |
j++; |
p->fontq = mandoc_reallocarray(p->fontq, |
continue; |
p->fontsz, sizeof(*p->fontq)); |
} |
|
if (0 == j) |
|
continue; |
|
assert(i >= j); |
|
pword(p, &word[i - j], j); |
|
j = 0; |
|
} |
} |
if (j > 0) { |
p->fontq[p->fonti] = f; |
assert(i >= j); |
|
pword(p, &word[i - j], j); |
|
} |
|
} |
} |
|
|
|
/* Flush to make the saved pointer current again. */ |
static void |
void |
termprint_r(struct termp *p, const struct mdoc_meta *meta, |
term_fontpopq(struct termp *p, int i) |
const struct mdoc_node *node) |
|
{ |
{ |
int dochild; |
|
|
|
/* Pre-processing. */ |
assert(i >= 0); |
|
if (p->fonti > i) |
|
p->fonti = i; |
|
} |
|
|
dochild = 1; |
/* Pop one font off the stack. */ |
|
void |
|
term_fontpop(struct termp *p) |
|
{ |
|
|
if (MDOC_TEXT != node->type) { |
assert(p->fonti); |
if (termacts[node->tok].pre) |
p->fonti--; |
if ( ! (*termacts[node->tok].pre)(p, meta, node)) |
} |
dochild = 0; |
|
} else /* MDOC_TEXT == node->type */ |
|
word(p, node->data.text.string); |
|
|
|
/* Children. */ |
/* |
|
* Handle pwords, partial words, which may be either a single word or a |
|
* phrase that cannot be broken down (such as a literal string). This |
|
* handles word styling. |
|
*/ |
|
void |
|
term_word(struct termp *p, const char *word) |
|
{ |
|
struct roffsu su; |
|
const char nbrsp[2] = { ASCII_NBRSP, 0 }; |
|
const char *seq, *cp; |
|
int sz, uc; |
|
size_t csz, lsz, ssz; |
|
enum mandoc_esc esc; |
|
|
if (dochild && node->child) |
if ((p->flags & TERMP_NOBUF) == 0) { |
termprint_r(p, meta, node->child); |
if ((p->flags & TERMP_NOSPACE) == 0) { |
|
if ((p->flags & TERMP_KEEP) == 0) { |
|
bufferc(p, ' '); |
|
if (p->flags & TERMP_SENTENCE) |
|
bufferc(p, ' '); |
|
} else |
|
bufferc(p, ASCII_NBRSP); |
|
} |
|
if (p->flags & TERMP_PREKEEP) |
|
p->flags |= TERMP_KEEP; |
|
if (p->flags & TERMP_NONOSPACE) |
|
p->flags |= TERMP_NOSPACE; |
|
else |
|
p->flags &= ~TERMP_NOSPACE; |
|
p->flags &= ~(TERMP_SENTENCE | TERMP_NONEWLINE); |
|
p->skipvsp = 0; |
|
} |
|
|
/* Post-processing. */ |
while ('\0' != *word) { |
|
if ('\\' != *word) { |
|
if (TERMP_NBRWORD & p->flags) { |
|
if (' ' == *word) { |
|
encode(p, nbrsp, 1); |
|
word++; |
|
continue; |
|
} |
|
ssz = strcspn(word, "\\ "); |
|
} else |
|
ssz = strcspn(word, "\\"); |
|
encode(p, word, ssz); |
|
word += (int)ssz; |
|
continue; |
|
} |
|
|
if (MDOC_TEXT != node->type) |
word++; |
if (termacts[node->tok].post) |
esc = mandoc_escape(&word, &seq, &sz); |
(*termacts[node->tok].post)(p, meta, node); |
switch (esc) { |
|
case ESCAPE_UNICODE: |
|
uc = mchars_num2uc(seq + 1, sz - 1); |
|
break; |
|
case ESCAPE_NUMBERED: |
|
uc = mchars_num2char(seq, sz); |
|
if (uc < 0) |
|
continue; |
|
break; |
|
case ESCAPE_SPECIAL: |
|
if (p->enc == TERMENC_ASCII) { |
|
cp = mchars_spec2str(seq, sz, &ssz); |
|
if (cp != NULL) |
|
encode(p, cp, ssz); |
|
} else { |
|
uc = mchars_spec2cp(seq, sz); |
|
if (uc > 0) |
|
encode1(p, uc); |
|
} |
|
continue; |
|
case ESCAPE_UNDEF: |
|
uc = *seq; |
|
break; |
|
case ESCAPE_FONTBOLD: |
|
term_fontrepl(p, TERMFONT_BOLD); |
|
continue; |
|
case ESCAPE_FONTITALIC: |
|
term_fontrepl(p, TERMFONT_UNDER); |
|
continue; |
|
case ESCAPE_FONTBI: |
|
term_fontrepl(p, TERMFONT_BI); |
|
continue; |
|
case ESCAPE_FONT: |
|
case ESCAPE_FONTCW: |
|
case ESCAPE_FONTROMAN: |
|
term_fontrepl(p, TERMFONT_NONE); |
|
continue; |
|
case ESCAPE_FONTPREV: |
|
term_fontlast(p); |
|
continue; |
|
case ESCAPE_BREAK: |
|
bufferc(p, '\n'); |
|
continue; |
|
case ESCAPE_NOSPACE: |
|
if (p->flags & TERMP_BACKAFTER) |
|
p->flags &= ~TERMP_BACKAFTER; |
|
else if (*word == '\0') |
|
p->flags |= (TERMP_NOSPACE | TERMP_NONEWLINE); |
|
continue; |
|
case ESCAPE_DEVICE: |
|
if (p->type == TERMTYPE_PDF) |
|
encode(p, "pdf", 3); |
|
else if (p->type == TERMTYPE_PS) |
|
encode(p, "ps", 2); |
|
else if (p->enc == TERMENC_ASCII) |
|
encode(p, "ascii", 5); |
|
else |
|
encode(p, "utf8", 4); |
|
continue; |
|
case ESCAPE_HORIZ: |
|
if (*seq == '|') { |
|
seq++; |
|
uc = -p->col; |
|
} else |
|
uc = 0; |
|
if (a2roffsu(seq, &su, SCALE_EM) == NULL) |
|
continue; |
|
uc += term_hen(p, &su); |
|
if (uc > 0) |
|
while (uc-- > 0) |
|
bufferc(p, ASCII_NBRSP); |
|
else if (p->col > (size_t)(-uc)) |
|
p->col += uc; |
|
else { |
|
uc += p->col; |
|
p->col = 0; |
|
if (p->tcol->offset > (size_t)(-uc)) { |
|
p->ti += uc; |
|
p->tcol->offset += uc; |
|
} else { |
|
p->ti -= p->tcol->offset; |
|
p->tcol->offset = 0; |
|
} |
|
} |
|
continue; |
|
case ESCAPE_HLINE: |
|
if ((cp = a2roffsu(seq, &su, SCALE_EM)) == NULL) |
|
continue; |
|
uc = term_hen(p, &su); |
|
if (uc <= 0) { |
|
if (p->tcol->rmargin <= p->tcol->offset) |
|
continue; |
|
lsz = p->tcol->rmargin - p->tcol->offset; |
|
} else |
|
lsz = uc; |
|
if (*cp == seq[-1]) |
|
uc = -1; |
|
else if (*cp == '\\') { |
|
seq = cp + 1; |
|
esc = mandoc_escape(&seq, &cp, &sz); |
|
switch (esc) { |
|
case ESCAPE_UNICODE: |
|
uc = mchars_num2uc(cp + 1, sz - 1); |
|
break; |
|
case ESCAPE_NUMBERED: |
|
uc = mchars_num2char(cp, sz); |
|
break; |
|
case ESCAPE_SPECIAL: |
|
uc = mchars_spec2cp(cp, sz); |
|
break; |
|
case ESCAPE_UNDEF: |
|
uc = *seq; |
|
break; |
|
default: |
|
uc = -1; |
|
break; |
|
} |
|
} else |
|
uc = *cp; |
|
if (uc < 0x20 || (uc > 0x7E && uc < 0xA0)) |
|
uc = '_'; |
|
if (p->enc == TERMENC_ASCII) { |
|
cp = ascii_uc2str(uc); |
|
csz = term_strlen(p, cp); |
|
ssz = strlen(cp); |
|
} else |
|
csz = (*p->width)(p, uc); |
|
while (lsz >= csz) { |
|
if (p->enc == TERMENC_ASCII) |
|
encode(p, cp, ssz); |
|
else |
|
encode1(p, uc); |
|
lsz -= csz; |
|
} |
|
continue; |
|
case ESCAPE_SKIPCHAR: |
|
p->flags |= TERMP_BACKAFTER; |
|
continue; |
|
case ESCAPE_OVERSTRIKE: |
|
cp = seq + sz; |
|
while (seq < cp) { |
|
if (*seq == '\\') { |
|
mandoc_escape(&seq, NULL, NULL); |
|
continue; |
|
} |
|
encode1(p, *seq++); |
|
if (seq < cp) { |
|
if (p->flags & TERMP_BACKBEFORE) |
|
p->flags |= TERMP_BACKAFTER; |
|
else |
|
p->flags |= TERMP_BACKBEFORE; |
|
} |
|
} |
|
/* Trim trailing backspace/blank pair. */ |
|
if (p->tcol->lastcol > 2 && |
|
(p->tcol->buf[p->tcol->lastcol - 1] == ' ' || |
|
p->tcol->buf[p->tcol->lastcol - 1] == '\t')) |
|
p->tcol->lastcol -= 2; |
|
if (p->col > p->tcol->lastcol) |
|
p->col = p->tcol->lastcol; |
|
continue; |
|
default: |
|
continue; |
|
} |
|
|
/* Siblings. */ |
/* |
|
* Common handling for Unicode and numbered |
|
* character escape sequences. |
|
*/ |
|
|
if (node->next) |
if (p->enc == TERMENC_ASCII) { |
termprint_r(p, meta, node->next); |
cp = ascii_uc2str(uc); |
|
encode(p, cp, strlen(cp)); |
|
} else { |
|
if ((uc < 0x20 && uc != 0x09) || |
|
(uc > 0x7E && uc < 0xA0)) |
|
uc = 0xFFFD; |
|
encode1(p, uc); |
|
} |
|
} |
|
p->flags &= ~TERMP_NBRWORD; |
} |
} |
|
|
|
static void |
|
adjbuf(struct termp_col *c, size_t sz) |
|
{ |
|
if (c->maxcols == 0) |
|
c->maxcols = 1024; |
|
while (c->maxcols <= sz) |
|
c->maxcols <<= 2; |
|
c->buf = mandoc_reallocarray(c->buf, c->maxcols, sizeof(*c->buf)); |
|
} |
|
|
static void |
static void |
termprint_footer(struct termp *p, const struct mdoc_meta *meta) |
bufferc(struct termp *p, char c) |
{ |
{ |
struct tm *tm; |
if (p->flags & TERMP_NOBUF) { |
char *buf, *os; |
(*p->letter)(p, c); |
size_t sz, osz, ssz, i; |
return; |
|
} |
|
if (p->col + 1 >= p->tcol->maxcols) |
|
adjbuf(p->tcol, p->col + 1); |
|
if (p->tcol->lastcol <= p->col || (c != ' ' && c != ASCII_NBRSP)) |
|
p->tcol->buf[p->col] = c; |
|
if (p->tcol->lastcol < ++p->col) |
|
p->tcol->lastcol = p->col; |
|
} |
|
|
if (NULL == (buf = malloc(p->rmargin))) |
/* |
err(1, "malloc"); |
* See encode(). |
if (NULL == (os = malloc(p->rmargin))) |
* Do this for a single (probably unicode) value. |
err(1, "malloc"); |
* Does not check for non-decorated glyphs. |
|
*/ |
|
static void |
|
encode1(struct termp *p, int c) |
|
{ |
|
enum termfont f; |
|
|
tm = localtime(&meta->date); |
if (p->flags & TERMP_NOBUF) { |
if (NULL == strftime(buf, p->rmargin, "%B %d, %Y", tm)) |
(*p->letter)(p, c); |
err(1, "strftime"); |
return; |
|
} |
|
|
osz = strlcpy(os, meta->os, p->rmargin); |
if (p->col + 7 >= p->tcol->maxcols) |
|
adjbuf(p->tcol, p->col + 7); |
|
|
sz = strlen(buf); |
f = (c == ASCII_HYPH || c > 127 || isgraph(c)) ? |
ssz = sz + osz + 1; |
p->fontq[p->fonti] : TERMFONT_NONE; |
|
|
if (ssz > p->rmargin) { |
if (p->flags & TERMP_BACKBEFORE) { |
ssz -= p->rmargin; |
if (p->tcol->buf[p->col - 1] == ' ' || |
assert(ssz <= osz); |
p->tcol->buf[p->col - 1] == '\t') |
os[osz - ssz] = 0; |
p->col--; |
ssz = 1; |
else |
} else |
p->tcol->buf[p->col++] = '\b'; |
ssz = p->rmargin - ssz + 1; |
p->flags &= ~TERMP_BACKBEFORE; |
|
} |
|
if (f == TERMFONT_UNDER || f == TERMFONT_BI) { |
|
p->tcol->buf[p->col++] = '_'; |
|
p->tcol->buf[p->col++] = '\b'; |
|
} |
|
if (f == TERMFONT_BOLD || f == TERMFONT_BI) { |
|
if (c == ASCII_HYPH) |
|
p->tcol->buf[p->col++] = '-'; |
|
else |
|
p->tcol->buf[p->col++] = c; |
|
p->tcol->buf[p->col++] = '\b'; |
|
} |
|
if (p->tcol->lastcol <= p->col || (c != ' ' && c != ASCII_NBRSP)) |
|
p->tcol->buf[p->col] = c; |
|
if (p->tcol->lastcol < ++p->col) |
|
p->tcol->lastcol = p->col; |
|
if (p->flags & TERMP_BACKAFTER) { |
|
p->flags |= TERMP_BACKBEFORE; |
|
p->flags &= ~TERMP_BACKAFTER; |
|
} |
|
} |
|
|
printf("\n"); |
static void |
printf("%s", os); |
encode(struct termp *p, const char *word, size_t sz) |
for (i = 0; i < ssz; i++) |
{ |
printf(" "); |
size_t i; |
|
|
printf("%s\n", buf); |
if (p->flags & TERMP_NOBUF) { |
fflush(stdout); |
for (i = 0; i < sz; i++) |
|
(*p->letter)(p, word[i]); |
|
return; |
|
} |
|
|
free(buf); |
if (p->col + 2 + (sz * 5) >= p->tcol->maxcols) |
free(os); |
adjbuf(p->tcol, p->col + 2 + (sz * 5)); |
} |
|
|
|
|
for (i = 0; i < sz; i++) { |
|
if (ASCII_HYPH == word[i] || |
|
isgraph((unsigned char)word[i])) |
|
encode1(p, word[i]); |
|
else { |
|
if (p->tcol->lastcol <= p->col || |
|
(word[i] != ' ' && word[i] != ASCII_NBRSP)) |
|
p->tcol->buf[p->col] = word[i]; |
|
p->col++; |
|
|
static void |
/* |
termprint_header(struct termp *p, const struct mdoc_meta *meta) |
* Postpone the effect of \z while handling |
{ |
* an overstrike sequence from ascii_uc2str(). |
char *buf, *title; |
*/ |
const char *pp, *msec; |
|
size_t ssz, tsz, ttsz, i;; |
|
|
|
if (NULL == (buf = malloc(p->rmargin))) |
if (word[i] == '\b' && |
err(1, "malloc"); |
(p->flags & TERMP_BACKBEFORE)) { |
if (NULL == (title = malloc(p->rmargin))) |
p->flags &= ~TERMP_BACKBEFORE; |
err(1, "malloc"); |
p->flags |= TERMP_BACKAFTER; |
|
} |
|
} |
|
} |
|
if (p->tcol->lastcol < p->col) |
|
p->tcol->lastcol = p->col; |
|
} |
|
|
if (NULL == (pp = mdoc_vol2a(meta->vol))) |
void |
switch (meta->msec) { |
term_setwidth(struct termp *p, const char *wstr) |
case (MSEC_1): |
{ |
/* FALLTHROUGH */ |
struct roffsu su; |
case (MSEC_6): |
int iop, width; |
/* FALLTHROUGH */ |
|
case (MSEC_7): |
iop = 0; |
pp = mdoc_vol2a(VOL_URM); |
width = 0; |
|
if (NULL != wstr) { |
|
switch (*wstr) { |
|
case '+': |
|
iop = 1; |
|
wstr++; |
break; |
break; |
case (MSEC_8): |
case '-': |
pp = mdoc_vol2a(VOL_SMM); |
iop = -1; |
|
wstr++; |
break; |
break; |
case (MSEC_2): |
|
/* FALLTHROUGH */ |
|
case (MSEC_3): |
|
/* FALLTHROUGH */ |
|
case (MSEC_4): |
|
/* FALLTHROUGH */ |
|
case (MSEC_5): |
|
pp = mdoc_vol2a(VOL_PRM); |
|
break; |
|
case (MSEC_9): |
|
pp = mdoc_vol2a(VOL_KM); |
|
break; |
|
default: |
default: |
/* FIXME: capitalise. */ |
|
if (NULL == (pp = mdoc_msec2a(meta->msec))) |
|
pp = mdoc_msec2a(MSEC_local); |
|
break; |
break; |
} |
} |
assert(pp); |
if (a2roffsu(wstr, &su, SCALE_MAX) != NULL) |
|
width = term_hspan(p, &su); |
tsz = strlcpy(buf, pp, p->rmargin); |
else |
assert(tsz < p->rmargin); |
iop = 0; |
|
|
if ((pp = mdoc_arch2a(meta->arch))) { |
|
tsz = strlcat(buf, " (", p->rmargin); |
|
assert(tsz < p->rmargin); |
|
tsz = strlcat(buf, pp, p->rmargin); |
|
assert(tsz < p->rmargin); |
|
tsz = strlcat(buf, ")", p->rmargin); |
|
assert(tsz < p->rmargin); |
|
} |
} |
|
(*p->setwidth)(p, iop, width); |
|
} |
|
|
ttsz = strlcpy(title, meta->title, p->rmargin); |
size_t |
|
term_len(const struct termp *p, size_t sz) |
|
{ |
|
|
if (NULL == (msec = mdoc_msec2a(meta->msec))) |
return (*p->width)(p, ' ') * sz; |
msec = ""; |
} |
|
|
ssz = (2 * (ttsz + 2 + strlen(msec))) + tsz + 2; |
static size_t |
|
cond_width(const struct termp *p, int c, int *skip) |
|
{ |
|
|
if (ssz > p->rmargin) { |
if (*skip) { |
if ((ssz -= p->rmargin) % 2) |
(*skip) = 0; |
ssz++; |
return 0; |
ssz /= 2; |
|
|
|
assert(ssz <= ttsz); |
|
title[ttsz - ssz] = 0; |
|
ssz = 1; |
|
} else |
} else |
ssz = ((p->rmargin - ssz) / 2) + 1; |
return (*p->width)(p, c); |
|
} |
|
|
printf("%s(%s)", title, msec); |
size_t |
|
term_strlen(const struct termp *p, const char *cp) |
|
{ |
|
size_t sz, rsz, i; |
|
int ssz, skip, uc; |
|
const char *seq, *rhs; |
|
enum mandoc_esc esc; |
|
static const char rej[] = { '\\', ASCII_NBRSP, ASCII_HYPH, |
|
ASCII_BREAK, '\0' }; |
|
|
for (i = 0; i < ssz; i++) |
/* |
printf(" "); |
* Account for escaped sequences within string length |
|
* calculations. This follows the logic in term_word() as we |
|
* must calculate the width of produced strings. |
|
*/ |
|
|
printf("%s", buf); |
sz = 0; |
|
skip = 0; |
|
while ('\0' != *cp) { |
|
rsz = strcspn(cp, rej); |
|
for (i = 0; i < rsz; i++) |
|
sz += cond_width(p, *cp++, &skip); |
|
|
for (i = 0; i < ssz; i++) |
switch (*cp) { |
printf(" "); |
case '\\': |
|
cp++; |
|
rhs = NULL; |
|
esc = mandoc_escape(&cp, &seq, &ssz); |
|
switch (esc) { |
|
case ESCAPE_UNICODE: |
|
uc = mchars_num2uc(seq + 1, ssz - 1); |
|
break; |
|
case ESCAPE_NUMBERED: |
|
uc = mchars_num2char(seq, ssz); |
|
if (uc < 0) |
|
continue; |
|
break; |
|
case ESCAPE_SPECIAL: |
|
if (p->enc == TERMENC_ASCII) { |
|
rhs = mchars_spec2str(seq, ssz, &rsz); |
|
if (rhs != NULL) |
|
break; |
|
} else { |
|
uc = mchars_spec2cp(seq, ssz); |
|
if (uc > 0) |
|
sz += cond_width(p, uc, &skip); |
|
} |
|
continue; |
|
case ESCAPE_UNDEF: |
|
uc = *seq; |
|
break; |
|
case ESCAPE_DEVICE: |
|
if (p->type == TERMTYPE_PDF) { |
|
rhs = "pdf"; |
|
rsz = 3; |
|
} else if (p->type == TERMTYPE_PS) { |
|
rhs = "ps"; |
|
rsz = 2; |
|
} else if (p->enc == TERMENC_ASCII) { |
|
rhs = "ascii"; |
|
rsz = 5; |
|
} else { |
|
rhs = "utf8"; |
|
rsz = 4; |
|
} |
|
break; |
|
case ESCAPE_SKIPCHAR: |
|
skip = 1; |
|
continue; |
|
case ESCAPE_OVERSTRIKE: |
|
rsz = 0; |
|
rhs = seq + ssz; |
|
while (seq < rhs) { |
|
if (*seq == '\\') { |
|
mandoc_escape(&seq, NULL, NULL); |
|
continue; |
|
} |
|
i = (*p->width)(p, *seq++); |
|
if (rsz < i) |
|
rsz = i; |
|
} |
|
sz += rsz; |
|
continue; |
|
default: |
|
continue; |
|
} |
|
|
printf("%s(%s)\n", title, msec); |
/* |
fflush(stdout); |
* Common handling for Unicode and numbered |
|
* character escape sequences. |
|
*/ |
|
|
free(title); |
if (rhs == NULL) { |
free(buf); |
if (p->enc == TERMENC_ASCII) { |
} |
rhs = ascii_uc2str(uc); |
|
rsz = strlen(rhs); |
|
} else { |
|
if ((uc < 0x20 && uc != 0x09) || |
|
(uc > 0x7E && uc < 0xA0)) |
|
uc = 0xFFFD; |
|
sz += cond_width(p, uc, &skip); |
|
continue; |
|
} |
|
} |
|
|
|
if (skip) { |
|
skip = 0; |
|
break; |
|
} |
|
|
void |
/* |
termprint(const struct mdoc_node *node, |
* Common handling for all escape sequences |
const struct mdoc_meta *meta) |
* printing more than one character. |
{ |
*/ |
struct termp p; |
|
|
|
p.maxrmargin = 80; /* XXX */ |
for (i = 0; i < rsz; i++) |
p.rmargin = p.maxrmargin; |
sz += (*p->width)(p, *rhs++); |
p.maxcols = 1024; |
break; |
p.offset = p.col = 0; |
case ASCII_NBRSP: |
p.flags = TERMP_NOSPACE; |
sz += cond_width(p, ' ', &skip); |
|
cp++; |
|
break; |
|
case ASCII_HYPH: |
|
sz += cond_width(p, '-', &skip); |
|
cp++; |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
if (NULL == (p.buf = malloc(p.maxcols))) |
return sz; |
err(1, "malloc"); |
} |
|
|
termprint_header(&p, meta); |
int |
termprint_r(&p, meta, node); |
term_vspan(const struct termp *p, const struct roffsu *su) |
termprint_footer(&p, meta); |
{ |
|
double r; |
|
int ri; |
|
|
free(p.buf); |
switch (su->unit) { |
|
case SCALE_BU: |
|
r = su->scale / 40.0; |
|
break; |
|
case SCALE_CM: |
|
r = su->scale * 6.0 / 2.54; |
|
break; |
|
case SCALE_FS: |
|
r = su->scale * 65536.0 / 40.0; |
|
break; |
|
case SCALE_IN: |
|
r = su->scale * 6.0; |
|
break; |
|
case SCALE_MM: |
|
r = su->scale * 0.006; |
|
break; |
|
case SCALE_PC: |
|
r = su->scale; |
|
break; |
|
case SCALE_PT: |
|
r = su->scale / 12.0; |
|
break; |
|
case SCALE_EN: |
|
case SCALE_EM: |
|
r = su->scale * 0.6; |
|
break; |
|
case SCALE_VS: |
|
r = su->scale; |
|
break; |
|
default: |
|
abort(); |
|
} |
|
ri = r > 0.0 ? r + 0.4995 : r - 0.4995; |
|
return ri < 66 ? ri : 1; |
} |
} |
|
|
|
/* |
|
* Convert a scaling width to basic units, rounding towards 0. |
|
*/ |
|
int |
|
term_hspan(const struct termp *p, const struct roffsu *su) |
|
{ |
|
|
|
return (*p->hspan)(p, su); |
|
} |
|
|
|
/* |
|
* Convert a scaling width to basic units, rounding to closest. |
|
*/ |
|
int |
|
term_hen(const struct termp *p, const struct roffsu *su) |
|
{ |
|
int bu; |
|
|
|
if ((bu = (*p->hspan)(p, su)) >= 0) |
|
return (bu + 11) / 24; |
|
else |
|
return -((-bu + 11) / 24); |
|
} |