version 1.79, 2009/06/17 18:42:42 |
version 1.283, 2021/08/10 12:55:04 |
|
|
/* $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-2020 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 |
* copyright notice and this permission notice appear in all copies. |
* copyright notice and this permission notice appear in all copies. |
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHORS DISCLAIM ALL WARRANTIES |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* 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. |
*/ |
*/ |
|
#include "config.h" |
|
|
|
#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 "mandoc.h" |
|
#include "mandoc_aux.h" |
|
#include "out.h" |
#include "term.h" |
#include "term.h" |
#include "man.h" |
#include "main.h" |
#include "mdoc.h" |
|
|
|
extern int man_run(struct termp *, |
static size_t cond_width(const struct termp *, int, int *); |
const struct man *); |
static void adjbuf(struct termp_col *, size_t); |
extern int mdoc_run(struct termp *, |
static void bufferc(struct termp *, char); |
const struct mdoc *); |
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); |
|
static void term_fill(struct termp *, size_t *, size_t *, |
|
size_t); |
|
|
static struct termp *term_alloc(enum termenc); |
|
static void term_free(struct termp *); |
|
static void term_pword(struct termp *, const char *, int); |
|
static void term_pescape(struct termp *, |
|
const char *, int *, int); |
|
static void term_nescape(struct termp *, |
|
const char *, size_t); |
|
static void term_chara(struct termp *, char); |
|
static void term_encodea(struct termp *, char); |
|
static int term_isopendelim(const char *, int); |
|
static int term_isclosedelim(const char *, int); |
|
|
|
|
void |
void * |
term_setcol(struct termp *p, size_t maxtcol) |
ascii_alloc(void) |
|
{ |
{ |
|
if (maxtcol > p->maxtcol) { |
|
p->tcols = mandoc_recallocarray(p->tcols, |
|
p->maxtcol, maxtcol, sizeof(*p->tcols)); |
|
p->maxtcol = maxtcol; |
|
} |
|
p->lasttcol = maxtcol - 1; |
|
p->tcol = p->tcols; |
|
} |
|
|
return(term_alloc(TERMENC_ASCII)); |
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 |
int |
term_begin(struct termp *p, term_margin head, |
terminal_man(void *arg, const struct man *man) |
term_margin foot, const struct roff_meta *arg) |
{ |
{ |
struct termp *p; |
|
|
|
p = (struct termp *)arg; |
p->headf = head; |
if (NULL == p->symtab) |
p->footf = foot; |
p->symtab = term_ascii2htab(); |
p->argf = arg; |
|
(*p->begin)(p); |
return(man_run(p, man)); |
|
} |
} |
|
|
|
void |
int |
term_end(struct termp *p) |
terminal_mdoc(void *arg, const struct mdoc *mdoc) |
|
{ |
{ |
struct termp *p; |
|
|
|
p = (struct termp *)arg; |
(*p->end)(p); |
if (NULL == p->symtab) |
|
p->symtab = term_ascii2htab(); |
|
|
|
return(mdoc_run(p, mdoc)); |
|
} |
} |
|
|
|
/* |
|
* 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 |
void |
terminal_free(void *arg) |
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. */ |
|
|
term_free((struct termp *)arg); |
/* |
} |
* Normally, start writing at the left margin, but with the |
|
* NOPAD flag, start writing at the current position instead. |
|
*/ |
|
|
|
vbl = (p->flags & TERMP_NOPAD) || p->tcol->offset < p->viscol ? |
|
0 : p->tcol->offset - p->viscol; |
|
if (p->minbl && vbl < p->minbl) |
|
vbl = p->minbl; |
|
|
static void |
if ((p->flags & TERMP_MULTICOL) == 0) |
term_free(struct termp *p) |
p->tcol->col = 0; |
{ |
|
|
|
if (p->buf) |
/* Loop over output lines. */ |
free(p->buf); |
|
if (TERMENC_ASCII == p->enc && p->symtab) |
|
term_asciifree(p->symtab); |
|
|
|
free(p); |
for (;;) { |
} |
vfield = p->tcol->rmargin > p->viscol + vbl ? |
|
p->tcol->rmargin - p->viscol - vbl : 0; |
|
|
|
/* |
|
* Normally, break the line at the the right margin |
|
* 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. |
|
*/ |
|
|
static struct termp * |
vtarget = (p->flags & TERMP_NOBREAK) == 0 ? vfield : |
term_alloc(enum termenc enc) |
p->maxrmargin > p->viscol + vbl ? |
{ |
p->maxrmargin - p->viscol - vbl : 0; |
struct termp *p; |
|
|
|
if (NULL == (p = malloc(sizeof(struct termp)))) |
/* |
err(1, "malloc"); |
* Figure out how much text will fit in the field. |
bzero(p, sizeof(struct termp)); |
* If there is whitespace only, print nothing. |
p->maxrmargin = 80; |
*/ |
p->enc = enc; |
|
return(p); |
|
} |
|
|
|
|
term_fill(p, &nbr, &vbr, |
|
p->flags & TERMP_BRNEVER ? SIZE_MAX : vtarget); |
|
if (nbr == 0) |
|
break; |
|
|
static int |
/* |
term_isclosedelim(const char *p, int len) |
* With the CENTER or RIGHT flag, increase the indentation |
{ |
* to center the text between the left and right margins |
|
* or to adjust it to the right margin, respectively. |
|
*/ |
|
|
if (1 != len) |
if (vbr < vtarget) { |
return(0); |
if (p->flags & TERMP_CENTER) |
|
vbl += (vtarget - vbr) / 2; |
|
else if (p->flags & TERMP_RIGHT) |
|
vbl += vtarget - vbr; |
|
} |
|
|
switch (*p) { |
/* Finally, print the field content. */ |
case('.'): |
|
/* FALLTHROUGH */ |
|
case(','): |
|
/* FALLTHROUGH */ |
|
case(';'): |
|
/* FALLTHROUGH */ |
|
case(':'): |
|
/* FALLTHROUGH */ |
|
case('?'): |
|
/* FALLTHROUGH */ |
|
case('!'): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
/* FALLTHROUGH */ |
|
case('}'): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
|
|
return(0); |
term_field(p, vbl, nbr); |
} |
|
|
|
|
/* |
|
* 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. |
|
*/ |
|
|
static int |
for (ic = p->tcol->col; ic < p->tcol->lastcol; ic++) { |
term_isopendelim(const char *p, int len) |
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; |
|
} |
|
if (ic == p->tcol->lastcol) |
|
break; |
|
|
if (1 != len) |
/* |
return(0); |
* At the location of an automtic line break, input |
|
* space characters are consumed by the line break. |
|
*/ |
|
|
switch (*p) { |
while (p->tcol->col < p->tcol->lastcol && |
case('('): |
p->tcol->buf[p->tcol->col] == ' ') |
/* FALLTHROUGH */ |
p->tcol->col++; |
case('['): |
|
/* FALLTHROUGH */ |
/* |
case('{'): |
* In multi-column mode, leave the rest of the text |
return(1); |
* in the buffer to be handled by a subsequent |
default: |
* invocation, such that the other columns of the |
break; |
* table can be handled first. |
|
* In single-column mode, simply break the line. |
|
*/ |
|
|
|
if (p->flags & TERMP_MULTICOL) |
|
return; |
|
|
|
endline(p); |
|
p->viscol = 0; |
|
|
|
/* |
|
* Normally, start the next line at the same indentation |
|
* as this one, but with the BRIND flag, start it at the |
|
* right margin instead. This is used together with |
|
* NOBREAK for the tags in various kinds of tagged lists. |
|
*/ |
|
|
|
vbl = p->flags & TERMP_BRIND ? |
|
p->tcol->rmargin : p->tcol->offset; |
} |
} |
|
|
return(0); |
/* Reset output state in preparation for the next field. */ |
} |
|
|
|
|
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; |
|
|
|
/* |
|
* The HANG flag means that the next field |
|
* 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. |
|
*/ |
|
|
|
if ((p->flags & TERMP_HANG) == 0 && |
|
((p->flags & TERMP_NOBREAK) == 0 || |
|
vbr + term_len(p, p->trailspace) > vfield)) |
|
endline(p); |
|
} |
|
|
/* |
/* |
* Flush a line of text. A "line" is loosely defined as being something |
* Store the number of input characters to print in this field in *nbr |
* that should be followed by a newline, regardless of whether it's |
* and their total visual width to print in *vbr. |
* broken apart by newlines getting there. A line can also be a |
* If there is only whitespace in the field, both remain zero. |
* fragment of a columnar list. |
* The desired visual width of the field is provided by vtarget. |
* |
* If the first word is longer, the field will be overrun. |
* Specifically, a line is whatever's in p->buf of length p->col, which |
|
* is zeroed after this function returns. |
|
* |
|
* The variables TERMP_NOLPAD, TERMP_LITERAL and TERMP_NOBREAK are of |
|
* critical importance here. Their behaviour 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 |
|
* columns. In short: don't print a newline and instead pad to the |
|
* right margin. Used in conjunction with TERMP_NOLPAD. |
|
* |
|
* - TERMP_NONOBREAK: don't newline when TERMP_NOBREAK is specified. |
|
* |
|
* In-line line breaking: |
|
* |
|
* If TERMP_NOBREAK is specified and the line overruns the right |
|
* margin, it will break and pad-right to the right margin after |
|
* writing. If maxrmargin is violated, it will break and continue |
|
* writing from the right-margin, which will lead to the above |
|
* scenario upon exit. |
|
* |
|
* 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 |
static void |
term_flushln(struct termp *p) |
term_fill(struct termp *p, size_t *nbr, size_t *vbr, size_t vtarget) |
{ |
{ |
int i, j; |
size_t ic; /* Character position in the input buffer. */ |
size_t vsz, vis, maxvis, mmax, bp; |
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. */ |
|
|
/* |
*nbr = *vbr = vis = 0; |
* First, establish the maximum columns of "visible" content. |
breakline = graph = 0; |
* This is usually the difference between the right-margin and |
for (ic = p->tcol->col; ic < p->tcol->lastcol; ic++) { |
* an indentation, but can be, for tagged lists or columns, a |
switch (p->tcol->buf[ic]) { |
* small set of values. |
case '\b': /* Escape \o (overstrike) or backspace markup. */ |
*/ |
assert(ic > 0); |
|
vis -= (*p->width)(p, p->tcol->buf[ic - 1]); |
|
continue; |
|
|
assert(p->offset < p->rmargin); |
case '\t': /* Normal ASCII whitespace. */ |
maxvis = p->rmargin - p->offset; |
case ' ': |
mmax = p->maxrmargin - p->offset; |
case ASCII_BREAK: /* Escape \: (breakpoint). */ |
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
switch (p->tcol->buf[ic]) { |
vis = 0; |
case '\t': |
|
vn = term_tab_next(vis); |
|
break; |
|
case ' ': |
|
vn = vis + (*p->width)(p, ' '); |
|
break; |
|
case ASCII_BREAK: |
|
vn = vis; |
|
break; |
|
default: |
|
abort(); |
|
} |
|
/* Can break at the end of a word. */ |
|
if (breakline || vn > vtarget) |
|
break; |
|
if (graph) { |
|
*nbr = ic; |
|
*vbr = vis; |
|
graph = 0; |
|
} |
|
vis = vn; |
|
continue; |
|
|
|
case '\n': /* Escape \p (break at the end of the word). */ |
|
breakline = 1; |
|
continue; |
|
|
|
case ASCII_HYPH: /* Breakable hyphen. */ |
|
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; |
|
|
|
case ASCII_NBRSP: /* Non-breakable space. */ |
|
p->tcol->buf[ic] = ' '; |
|
/* FALLTHROUGH */ |
|
default: /* Printable character. */ |
|
graph = 1; |
|
vis += (*p->width)(p, p->tcol->buf[ic]); |
|
if (vis > vtarget && *nbr > 0) |
|
return; |
|
continue; |
|
} |
|
break; |
|
} |
|
|
/* |
/* |
* If in the standard case (left-justified), then begin with our |
* If the last word extends to the end of the field without any |
* indentation, otherwise (columns, etc.) just start spitting |
* trailing whitespace, the loop could not check yet whether it |
* out text. |
* can remain on this line. So do the check now. |
*/ |
*/ |
|
|
if ( ! (p->flags & TERMP_NOLPAD)) |
if (graph && (vis <= vtarget || *nbr == 0)) { |
/* LINTED */ |
*nbr = ic; |
for (j = 0; j < (int)p->offset; j++) |
*vbr = vis; |
putchar(' '); |
} |
|
} |
|
|
for (i = 0; i < (int)p->col; i++) { |
/* |
/* |
* Print the contents of one field |
* Count up visible word characters. Control sequences |
* with an indentation of vbl visual columns, |
* (starting with the CSI) aren't counted. A space |
* and an input string length of nbr characters. |
* generates a non-printing word, which is valid (the |
*/ |
* space is printed according to regular spacing rules). |
static void |
*/ |
term_field(struct termp *p, size_t vbl, size_t nbr) |
|
{ |
|
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. */ |
|
|
/* LINTED */ |
vis = 0; |
for (j = i, vsz = 0; j < (int)p->col; j++) { |
for (ic = p->tcol->col; ic < nbr; ic++) { |
if (' ' == p->buf[j]) |
|
break; |
|
else if (8 == p->buf[j]) |
|
j += 1; |
|
else |
|
vsz++; |
|
} |
|
|
|
/* |
/* |
* Do line-breaking. If we're greater than our |
* To avoid the printing of trailing whitespace, |
* break-point and already in-line, break to the next |
* do not print whitespace right away, only count it. |
* line and start writing. If we're at the line start, |
|
* then write out the word (TODO: hyphenate) and break |
|
* in a subsequent loop invocation. |
|
*/ |
*/ |
|
|
if ( ! (TERMP_NOBREAK & p->flags)) { |
switch (p->tcol->buf[ic]) { |
if (vis && vis + vsz > bp) { |
case '\n': |
putchar('\n'); |
case ASCII_BREAK: |
for (j = 0; j < (int)p->offset; j++) |
continue; |
putchar(' '); |
case '\t': |
vis = 0; |
vn = term_tab_next(vis); |
} |
vbl += vn - vis; |
} else if (vis && vis + vsz > bp) { |
vis = vn; |
putchar('\n'); |
continue; |
for (j = 0; j < (int)p->rmargin; j++) |
case ' ': |
putchar(' '); |
case ASCII_NBRSP: |
vis = p->rmargin - p->offset; |
dv = (*p->width)(p, ' '); |
|
vbl += dv; |
|
vis += dv; |
|
continue; |
|
default: |
|
break; |
} |
} |
|
|
/* |
/* |
* Prepend a space if we're not already at the beginning |
* We found a non-blank character to print, |
* of the line, then the word. |
* so write preceding white space now. |
*/ |
*/ |
|
|
if (0 < vis++) |
if (vbl > 0) { |
putchar(' '); |
(*p->advance)(p, vbl); |
|
p->viscol += vbl; |
for ( ; i < (int)p->col; i++) { |
vbl = 0; |
if (' ' == p->buf[i]) |
|
break; |
|
putchar(p->buf[i]); |
|
} |
} |
vis += vsz; |
|
} |
|
|
|
/* |
/* Print the character and adjust the visual position. */ |
* If we've overstepped our maximum visible no-break space, then |
|
* cause a newline and offset at the right margin. |
|
*/ |
|
|
|
if ((TERMP_NOBREAK & p->flags) && vis > maxvis) { |
(*p->letter)(p, p->tcol->buf[ic]); |
if ( ! (TERMP_NONOBREAK & p->flags)) { |
if (p->tcol->buf[ic] == '\b') { |
putchar('\n'); |
dv = (*p->width)(p, p->tcol->buf[ic - 1]); |
for (i = 0; i < (int)p->rmargin; i++) |
p->viscol -= dv; |
putchar(' '); |
vis -= dv; |
|
} else { |
|
dv = (*p->width)(p, p->tcol->buf[ic]); |
|
p->viscol += dv; |
|
vis += dv; |
} |
} |
p->col = 0; |
|
return; |
|
} |
} |
|
p->tcol->col = nbr; |
|
} |
|
|
/* |
static void |
* If we're not to right-marginalise it (newline), then instead |
endline(struct termp *p) |
* pad to the right margin and stay off. |
{ |
*/ |
if ((p->flags & (TERMP_NEWMC | TERMP_ENDMC)) == TERMP_ENDMC) { |
|
p->mc = NULL; |
if (p->flags & TERMP_NOBREAK) { |
p->flags &= ~TERMP_ENDMC; |
if ( ! (TERMP_NONOBREAK & p->flags)) |
} |
for ( ; vis <= maxvis; vis++) |
if (p->mc != NULL) { |
putchar(' '); |
if (p->viscol && p->maxrmargin >= p->viscol) |
} else |
(*p->advance)(p, p->maxrmargin - p->viscol + 1); |
putchar('\n'); |
p->flags |= TERMP_NOBUF | TERMP_NOSPACE; |
|
term_word(p, p->mc); |
p->col = 0; |
p->flags &= ~(TERMP_NOBUF | TERMP_NEWMC); |
|
} |
|
p->viscol = 0; |
|
p->minbl = 0; |
|
(*p->endline)(p); |
} |
} |
|
|
|
/* |
/* |
|
* A newline only breaks an existing line; it won't assert vertical |
* 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 |
* space. All data in the output buffer is flushed prior to the newline |
* assertion. |
* assertion. |
Line 328 term_newln(struct termp *p) |
|
Line 437 term_newln(struct termp *p) |
|
{ |
{ |
|
|
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
if (0 == p->col) { |
if (p->tcol->lastcol || p->viscol) |
p->flags &= ~TERMP_NOLPAD; |
term_flushln(p); |
return; |
|
} |
|
term_flushln(p); |
|
p->flags &= ~TERMP_NOLPAD; |
|
} |
} |
|
|
|
|
/* |
/* |
* Asserts a vertical space (a full, empty line-break between lines). |
* 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. |
* Note that if used twice, this will cause two blank spaces and so on. |
Line 348 term_vspace(struct termp *p) |
|
Line 452 term_vspace(struct termp *p) |
|
{ |
{ |
|
|
term_newln(p); |
term_newln(p); |
putchar('\n'); |
p->viscol = 0; |
|
p->minbl = 0; |
|
if (0 < p->skipvsp) |
|
p->skipvsp--; |
|
else |
|
(*p->endline)(p); |
} |
} |
|
|
|
/* Swap current and previous font; for \fP and .ft P */ |
|
void |
|
term_fontlast(struct termp *p) |
|
{ |
|
enum termfont f; |
|
|
|
f = p->fontl; |
|
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[p->fonti] = f; |
|
} |
|
|
|
/* Set font, save current, discard previous; for \f, .ft, .B etc. */ |
|
void |
|
term_fontrepl(struct termp *p, enum termfont f) |
|
{ |
|
|
|
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[p->fonti] = f; |
|
} |
|
|
|
/* Set font, save previous. */ |
|
void |
|
term_fontpush(struct termp *p, enum termfont f) |
|
{ |
|
|
|
p->fontl = p->fontq[p->fonti]; |
|
if (++p->fonti == p->fontsz) { |
|
p->fontsz += 8; |
|
p->fontq = mandoc_reallocarray(p->fontq, |
|
p->fontsz, sizeof(*p->fontq)); |
|
} |
|
p->fontq[p->fonti] = f; |
|
} |
|
|
|
/* Flush to make the saved pointer current again. */ |
|
void |
|
term_fontpopq(struct termp *p, int i) |
|
{ |
|
|
|
assert(i >= 0); |
|
if (p->fonti > i) |
|
p->fonti = i; |
|
} |
|
|
|
/* Pop one font off the stack. */ |
|
void |
|
term_fontpop(struct termp *p) |
|
{ |
|
|
|
assert(p->fonti); |
|
p->fonti--; |
|
} |
|
|
/* |
/* |
* Break apart a word into "pwords" (partial-words, usually from |
* Handle pwords, partial words, which may be either a single word or a |
* breaking up a phrase into individual words) and, eventually, put them |
* phrase that cannot be broken down (such as a literal string). This |
* into the output buffer. If we're a literal word, then don't break up |
* handles word styling. |
* the word and put it verbatim into the output buffer. |
|
*/ |
*/ |
void |
void |
term_word(struct termp *p, const char *word) |
term_word(struct termp *p, const char *word) |
{ |
{ |
int i, j, len; |
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; |
|
|
len = (int)strlen(word); |
if ((p->flags & TERMP_NOBUF) == 0) { |
|
if ((p->flags & TERMP_NOSPACE) == 0) { |
if (p->flags & TERMP_LITERAL) { |
if ((p->flags & TERMP_KEEP) == 0) { |
term_pword(p, word, len); |
bufferc(p, ' '); |
return; |
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; |
} |
} |
|
|
/* LINTED */ |
while ('\0' != *word) { |
for (j = i = 0; i < len; i++) { |
if ('\\' != *word) { |
if (' ' != word[i]) { |
if (TERMP_NBRWORD & p->flags) { |
j++; |
if (' ' == *word) { |
|
encode(p, nbrsp, 1); |
|
word++; |
|
continue; |
|
} |
|
ssz = strcspn(word, "\\ "); |
|
} else |
|
ssz = strcspn(word, "\\"); |
|
encode(p, word, ssz); |
|
word += (int)ssz; |
continue; |
continue; |
} |
|
|
|
/* Escaped spaces don't delimit... */ |
|
if (i && ' ' == word[i] && '\\' == word[i - 1]) { |
|
j++; |
|
continue; |
|
} |
} |
|
|
if (0 == j) |
word++; |
|
esc = mandoc_escape(&word, &seq, &sz); |
|
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; |
continue; |
assert(i >= j); |
case ESCAPE_UNDEF: |
term_pword(p, &word[i - j], j); |
uc = *seq; |
j = 0; |
break; |
|
case ESCAPE_FONTBOLD: |
|
case ESCAPE_FONTCB: |
|
term_fontrepl(p, TERMFONT_BOLD); |
|
continue; |
|
case ESCAPE_FONTITALIC: |
|
case ESCAPE_FONTCI: |
|
term_fontrepl(p, TERMFONT_UNDER); |
|
continue; |
|
case ESCAPE_FONTBI: |
|
term_fontrepl(p, TERMFONT_BI); |
|
continue; |
|
case ESCAPE_FONT: |
|
case ESCAPE_FONTCR: |
|
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; |
|
} |
|
|
|
/* |
|
* Common handling for Unicode and numbered |
|
* character escape sequences. |
|
*/ |
|
|
|
if (p->enc == TERMENC_ASCII) { |
|
cp = ascii_uc2str(uc); |
|
encode(p, cp, strlen(cp)); |
|
} else { |
|
if ((uc < 0x20 && uc != 0x09) || |
|
(uc > 0x7E && uc < 0xA0)) |
|
uc = 0xFFFD; |
|
encode1(p, uc); |
|
} |
} |
} |
if (j > 0) { |
p->flags &= ~TERMP_NBRWORD; |
assert(i >= j); |
|
term_pword(p, &word[i - j], j); |
|
} |
|
} |
} |
|
|
|
|
/* |
|
* Determine the symbol indicated by an escape sequences, that is, one |
|
* starting with a backslash. Once done, we pass this value into the |
|
* output buffer by way of the symbol table. |
|
*/ |
|
static void |
static void |
term_nescape(struct termp *p, const char *word, size_t len) |
adjbuf(struct termp_col *c, size_t sz) |
{ |
{ |
const char *rhs; |
if (c->maxcols == 0) |
size_t sz; |
c->maxcols = 1024; |
int i; |
while (c->maxcols <= sz) |
|
c->maxcols <<= 2; |
|
c->buf = mandoc_reallocarray(c->buf, c->maxcols, sizeof(*c->buf)); |
|
} |
|
|
if ((rhs = term_a2ascii(p->symtab, word, len, &sz))) |
static void |
for (i = 0; i < (int)sz; i++) |
bufferc(struct termp *p, char c) |
term_encodea(p, rhs[i]); |
{ |
|
if (p->flags & TERMP_NOBUF) { |
|
(*p->letter)(p, c); |
|
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; |
} |
} |
|
|
|
|
/* |
/* |
* Handle an escape sequence: determine its length and pass it to the |
* See encode(). |
* escape-symbol look table. Note that we assume mdoc(3) has validated |
* Do this for a single (probably unicode) value. |
* the escape sequence (we assert upon badly-formed escape sequences). |
* Does not check for non-decorated glyphs. |
*/ |
*/ |
static void |
static void |
term_pescape(struct termp *p, const char *word, int *i, int len) |
encode1(struct termp *p, int c) |
{ |
{ |
int j; |
enum termfont f; |
|
|
if (++(*i) >= len) |
if (p->flags & TERMP_NOBUF) { |
|
(*p->letter)(p, c); |
return; |
return; |
|
} |
|
|
if ('(' == word[*i]) { |
if (p->col + 7 >= p->tcol->maxcols) |
(*i)++; |
adjbuf(p->tcol, p->col + 7); |
if (*i + 1 >= len) |
|
return; |
|
|
|
term_nescape(p, &word[*i], 2); |
f = (c == ASCII_HYPH || c > 127 || isgraph(c)) ? |
(*i)++; |
p->fontq[p->fonti] : TERMFONT_NONE; |
|
|
|
if (p->flags & TERMP_BACKBEFORE) { |
|
if (p->tcol->buf[p->col - 1] == ' ' || |
|
p->tcol->buf[p->col - 1] == '\t') |
|
p->col--; |
|
else |
|
p->tcol->buf[p->col++] = '\b'; |
|
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; |
|
} |
|
} |
|
|
|
static void |
|
encode(struct termp *p, const char *word, size_t sz) |
|
{ |
|
size_t i; |
|
|
|
if (p->flags & TERMP_NOBUF) { |
|
for (i = 0; i < sz; i++) |
|
(*p->letter)(p, word[i]); |
return; |
return; |
|
} |
|
|
} else if ('*' == word[*i]) { |
if (p->col + 2 + (sz * 5) >= p->tcol->maxcols) |
(*i)++; |
adjbuf(p->tcol, p->col + 2 + (sz * 5)); |
if (*i >= len) |
|
return; |
|
|
|
switch (word[*i]) { |
for (i = 0; i < sz; i++) { |
case ('('): |
if (ASCII_HYPH == word[i] || |
(*i)++; |
isgraph((unsigned char)word[i])) |
if (*i + 1 >= len) |
encode1(p, word[i]); |
return; |
else { |
|
if (p->tcol->lastcol <= p->col || |
|
(word[i] != ' ' && word[i] != ASCII_NBRSP)) |
|
p->tcol->buf[p->col] = word[i]; |
|
p->col++; |
|
|
term_nescape(p, &word[*i], 2); |
/* |
(*i)++; |
* Postpone the effect of \z while handling |
return; |
* an overstrike sequence from ascii_uc2str(). |
case ('['): |
*/ |
break; |
|
default: |
if (word[i] == '\b' && |
term_nescape(p, &word[*i], 1); |
(p->flags & TERMP_BACKBEFORE)) { |
return; |
p->flags &= ~TERMP_BACKBEFORE; |
|
p->flags |= TERMP_BACKAFTER; |
|
} |
} |
} |
|
} |
} else if ('f' == word[*i]) { |
if (p->tcol->lastcol < p->col) |
(*i)++; |
p->tcol->lastcol = p->col; |
if (*i >= len) |
} |
return; |
|
switch (word[*i]) { |
void |
case ('B'): |
term_setwidth(struct termp *p, const char *wstr) |
p->flags |= TERMP_BOLD; |
{ |
|
struct roffsu su; |
|
int iop, width; |
|
|
|
iop = 0; |
|
width = 0; |
|
if (NULL != wstr) { |
|
switch (*wstr) { |
|
case '+': |
|
iop = 1; |
|
wstr++; |
break; |
break; |
case ('I'): |
case '-': |
p->flags |= TERMP_UNDER; |
iop = -1; |
|
wstr++; |
break; |
break; |
case ('P'): |
|
/* FALLTHROUGH */ |
|
case ('R'): |
|
p->flags &= ~TERMP_STYLE; |
|
break; |
|
default: |
default: |
break; |
break; |
} |
} |
return; |
if (a2roffsu(wstr, &su, SCALE_MAX) != NULL) |
|
width = term_hspan(p, &su); |
} else if ('[' != word[*i]) { |
else |
term_nescape(p, &word[*i], 1); |
iop = 0; |
return; |
|
} |
} |
|
(*p->setwidth)(p, iop, width); |
|
} |
|
|
(*i)++; |
size_t |
for (j = 0; word[*i] && ']' != word[*i]; (*i)++, j++) |
term_len(const struct termp *p, size_t sz) |
/* Loop... */ ; |
{ |
|
|
if (0 == word[*i]) |
return (*p->width)(p, ' ') * sz; |
return; |
|
|
|
term_nescape(p, &word[*i - j], (size_t)j); |
|
} |
} |
|
|
|
static size_t |
|
cond_width(const struct termp *p, int c, int *skip) |
|
{ |
|
|
/* |
if (*skip) { |
* Handle pwords, partial words, which may be either a single word or a |
(*skip) = 0; |
* phrase that cannot be broken down (such as a literal string). This |
return 0; |
* handles word styling. |
} else |
*/ |
return (*p->width)(p, c); |
static void |
} |
term_pword(struct termp *p, const char *word, int len) |
|
|
size_t |
|
term_strlen(const struct termp *p, const char *cp) |
{ |
{ |
int i; |
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' }; |
|
|
if (term_isclosedelim(word, len)) |
/* |
if ( ! (TERMP_IGNDELIM & p->flags)) |
* Account for escaped sequences within string length |
p->flags |= TERMP_NOSPACE; |
* calculations. This follows the logic in term_word() as we |
|
* must calculate the width of produced strings. |
|
*/ |
|
|
if ( ! (TERMP_NOSPACE & p->flags)) |
sz = 0; |
term_chara(p, ' '); |
skip = 0; |
|
while ('\0' != *cp) { |
|
rsz = strcspn(cp, rej); |
|
for (i = 0; i < rsz; i++) |
|
sz += cond_width(p, *cp++, &skip); |
|
|
if ( ! (p->flags & TERMP_NONOSPACE)) |
switch (*cp) { |
p->flags &= ~TERMP_NOSPACE; |
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; |
|
} |
|
|
/* |
/* |
* If ANSI (word-length styling), then apply our style now, |
* Common handling for Unicode and numbered |
* before the word. |
* character escape sequences. |
*/ |
*/ |
|
|
for (i = 0; i < len; i++) |
if (rhs == NULL) { |
if ('\\' == word[i]) |
if (p->enc == TERMENC_ASCII) { |
term_pescape(p, word, &i, len); |
rhs = ascii_uc2str(uc); |
else |
rsz = strlen(rhs); |
term_encodea(p, word[i]); |
} else { |
|
if ((uc < 0x20 && uc != 0x09) || |
|
(uc > 0x7E && uc < 0xA0)) |
|
uc = 0xFFFD; |
|
sz += cond_width(p, uc, &skip); |
|
continue; |
|
} |
|
} |
|
|
if (term_isopendelim(word, len)) |
if (skip) { |
p->flags |= TERMP_NOSPACE; |
skip = 0; |
|
break; |
|
} |
|
|
|
/* |
|
* Common handling for all escape sequences |
|
* printing more than one character. |
|
*/ |
|
|
|
for (i = 0; i < rsz; i++) |
|
sz += (*p->width)(p, *rhs++); |
|
break; |
|
case ASCII_NBRSP: |
|
sz += cond_width(p, ' ', &skip); |
|
cp++; |
|
break; |
|
case ASCII_HYPH: |
|
sz += cond_width(p, '-', &skip); |
|
cp++; |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
|
return sz; |
} |
} |
|
|
|
int |
|
term_vspan(const struct termp *p, const struct roffsu *su) |
|
{ |
|
double r; |
|
int ri; |
|
|
|
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; |
|
} |
|
|
/* |
/* |
* Insert a single character into the line-buffer. If the buffer's |
* Convert a scaling width to basic units, rounding towards 0. |
* space is exceeded, then allocate more space by doubling the buffer |
|
* size. |
|
*/ |
*/ |
static void |
int |
term_chara(struct termp *p, char c) |
term_hspan(const struct termp *p, const struct roffsu *su) |
{ |
{ |
size_t s; |
|
|
|
if (p->col + 1 >= p->maxcols) { |
return (*p->hspan)(p, su); |
if (0 == p->maxcols) |
|
p->maxcols = 256; |
|
s = p->maxcols * 2; |
|
p->buf = realloc(p->buf, s); |
|
if (NULL == p->buf) |
|
err(1, "realloc"); |
|
p->maxcols = s; |
|
} |
|
p->buf[(int)(p->col)++] = c; |
|
} |
} |
|
|
|
/* |
static void |
* Convert a scaling width to basic units, rounding to closest. |
term_encodea(struct termp *p, char c) |
*/ |
|
int |
|
term_hen(const struct termp *p, const struct roffsu *su) |
{ |
{ |
|
int bu; |
|
|
if (TERMP_STYLE & p->flags) { |
if ((bu = (*p->hspan)(p, su)) >= 0) |
if (TERMP_BOLD & p->flags) { |
return (bu + 11) / 24; |
term_chara(p, c); |
else |
term_chara(p, 8); |
return -((-bu + 11) / 24); |
} |
|
if (TERMP_UNDER & p->flags) { |
|
term_chara(p, '_'); |
|
term_chara(p, 8); |
|
} |
|
} |
|
term_chara(p, c); |
|
} |
} |