version 1.244, 2015/01/31 00:12:41 |
version 1.267, 2017/06/07 20:01:19 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2008, 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010-2015 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2010-2017 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 |
|
|
#include "main.h" |
#include "main.h" |
|
|
static size_t cond_width(const struct termp *, int, int *); |
static size_t cond_width(const struct termp *, int, int *); |
static void adjbuf(struct termp *p, size_t); |
static void adjbuf(struct termp_col *, size_t); |
static void bufferc(struct termp *, char); |
static void bufferc(struct termp *, char); |
static void encode(struct termp *, const char *, size_t); |
static void encode(struct termp *, const char *, size_t); |
static void encode1(struct termp *, int); |
static void encode1(struct termp *, int); |
|
static void endline(struct termp *); |
|
|
|
|
void |
void |
term_free(struct termp *p) |
term_free(struct termp *p) |
{ |
{ |
|
for (p->tcol = p->tcols; p->tcol < p->tcols + p->maxtcol; p->tcol++) |
free(p->buf); |
free(p->tcol->buf); |
|
free(p->tcols); |
free(p->fontq); |
free(p->fontq); |
free(p); |
free(p); |
} |
} |
|
|
void |
void |
term_begin(struct termp *p, term_margin head, |
term_begin(struct termp *p, term_margin head, |
term_margin foot, const void *arg) |
term_margin foot, const struct roff_meta *arg) |
{ |
{ |
|
|
p->headf = head; |
p->headf = head; |
Line 78 term_end(struct termp *p) |
|
Line 80 term_end(struct termp *p) |
|
* the next column. However, if less than p->trailspace blanks, |
* the next column. However, if less than p->trailspace blanks, |
* which can be 0, 1, or 2, remain to the right margin, the line |
* which can be 0, 1, or 2, remain to the right margin, the line |
* will be broken. |
* will be broken. |
|
* - TERMP_BRTRSP: Consider trailing whitespace significant |
|
* when deciding whether the chunk fits or not. |
* - TERMP_BRIND: If the chunk does not fit and the output line has |
* - TERMP_BRIND: If the chunk does not fit and the output line has |
* to be broken, start the next line at the right margin instead |
* to be broken, start the next line at the right margin instead |
* of at the offset. Used together with TERMP_NOBREAK for the tags |
* of at the offset. Used together with TERMP_NOBREAK for the tags |
* in various kinds of tagged lists. |
* in various kinds of tagged lists. |
* - TERMP_DANGLE: Do not break the output line at the right margin, |
* - TERMP_HANG: Do not break the output line at the right margin, |
* append the next chunk after it even if this one is too long. |
* append the next chunk after it even if this one is too long. |
* To be used together with TERMP_NOBREAK. |
* To be used together with TERMP_NOBREAK. |
* - TERMP_HANG: Like TERMP_DANGLE, and also suppress padding before |
* - TERMP_NOPAD: Start writing at the current position, |
* the next chunk if this column is not full. |
* do not pad with blank characters up to the offset. |
*/ |
*/ |
void |
void |
term_flushln(struct termp *p) |
term_flushln(struct termp *p) |
{ |
{ |
size_t i; /* current input position in p->buf */ |
|
int ntab; /* number of tabs to prepend */ |
|
size_t vis; /* current visual position on output */ |
size_t vis; /* current visual position on output */ |
size_t vbl; /* number of blanks to prepend to output */ |
size_t vbl; /* number of blanks to prepend to output */ |
size_t vend; /* end of word visual position on output */ |
size_t vend; /* end of word visual position on output */ |
size_t bp; /* visual right border position */ |
size_t bp; /* visual right border position */ |
size_t dv; /* temporary for visual pos calculations */ |
size_t dv; /* temporary for visual pos calculations */ |
size_t j; /* temporary loop index for p->buf */ |
size_t j; /* temporary loop index for p->tcol->buf */ |
size_t jhy; /* last hyph before overflow w/r/t j */ |
size_t jhy; /* last hyph before overflow w/r/t j */ |
size_t maxvis; /* output position of visible boundary */ |
size_t maxvis; /* output position of visible boundary */ |
|
int ntab; /* number of tabs to prepend */ |
|
|
/* |
vbl = (p->flags & TERMP_NOPAD) || p->tcol->offset < p->viscol ? |
* First, establish the maximum columns of "visible" content. |
0 : p->tcol->offset - p->viscol; |
* This is usually the difference between the right-margin and |
if (p->minbl && vbl < p->minbl) |
* an indentation, but can be, for tagged lists or columns, a |
vbl = p->minbl; |
* small set of values. |
maxvis = p->tcol->rmargin > p->viscol + vbl ? |
* |
p->tcol->rmargin - p->viscol - vbl : 0; |
* The following unsigned-signed subtractions look strange, |
bp = !(p->flags & TERMP_NOBREAK) ? maxvis : |
* but they are actually correct. If the int p->overstep |
p->maxrmargin > p->viscol + vbl ? |
* is negative, it gets sign extended. Subtracting that |
p->maxrmargin - p->viscol - vbl : 0; |
* very large size_t effectively adds a small number to dv. |
|
*/ |
|
dv = p->rmargin > p->offset ? p->rmargin - p->offset : 0; |
|
maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
|
|
|
if (p->flags & TERMP_NOBREAK) { |
|
dv = p->maxrmargin > p->offset ? |
|
p->maxrmargin - p->offset : 0; |
|
bp = (int)dv > p->overstep ? |
|
dv - (size_t)p->overstep : 0; |
|
} else |
|
bp = maxvis; |
|
|
|
/* |
|
* Calculate the required amount of padding. |
|
*/ |
|
vbl = p->offset + p->overstep > p->viscol ? |
|
p->offset + p->overstep - p->viscol : 0; |
|
|
|
vis = vend = 0; |
vis = vend = 0; |
i = 0; |
|
|
|
while (i < p->col) { |
if (p->lasttcol == 0) |
|
p->tcol->col = 0; |
|
while (p->tcol->col < p->lastcol) { |
|
|
/* |
/* |
* Handle literal tab characters: collapse all |
* Handle literal tab characters: collapse all |
* subsequent tabs into a single huge set of spaces. |
* subsequent tabs into a single huge set of spaces. |
*/ |
*/ |
|
|
ntab = 0; |
ntab = 0; |
while (i < p->col && '\t' == p->buf[i]) { |
while (p->tcol->col < p->lastcol && |
vend = (vis / p->tabwidth + 1) * p->tabwidth; |
p->tcol->buf[p->tcol->col] == '\t') { |
|
vend = term_tab_next(vis); |
vbl += vend - vis; |
vbl += vend - vis; |
vis = vend; |
vis = vend; |
ntab++; |
ntab++; |
i++; |
p->tcol->col++; |
} |
} |
|
|
/* |
/* |
Line 154 term_flushln(struct termp *p) |
|
Line 142 term_flushln(struct termp *p) |
|
* space is printed according to regular spacing rules). |
* space is printed according to regular spacing rules). |
*/ |
*/ |
|
|
for (j = i, jhy = 0; j < p->col; j++) { |
jhy = 0; |
if (' ' == p->buf[j] || '\t' == p->buf[j]) |
for (j = p->tcol->col; j < p->lastcol; j++) { |
|
if (p->tcol->buf[j] == ' ' || p->tcol->buf[j] == '\t') |
break; |
break; |
|
|
/* Back over the the last printed character. */ |
/* Back over the last printed character. */ |
if (8 == p->buf[j]) { |
if (p->tcol->buf[j] == '\b') { |
assert(j); |
assert(j); |
vend -= (*p->width)(p, p->buf[j - 1]); |
vend -= (*p->width)(p, p->tcol->buf[j - 1]); |
continue; |
continue; |
} |
} |
|
|
/* Regular word. */ |
/* Regular word. */ |
/* Break at the hyphen point if we overrun. */ |
/* Break at the hyphen point if we overrun. */ |
if (vend > vis && vend < bp && |
if (vend > vis && vend < bp && |
(ASCII_HYPH == p->buf[j] || |
(p->tcol->buf[j] == ASCII_HYPH|| |
ASCII_BREAK == p->buf[j])) |
p->tcol->buf[j] == ASCII_BREAK)) |
jhy = j; |
jhy = j; |
|
|
/* |
/* |
* Hyphenation now decided, put back a real |
* Hyphenation now decided, put back a real |
* hyphen such that we get the correct width. |
* hyphen such that we get the correct width. |
*/ |
*/ |
if (ASCII_HYPH == p->buf[j]) |
if (p->tcol->buf[j] == ASCII_HYPH) |
p->buf[j] = '-'; |
p->tcol->buf[j] = '-'; |
|
|
vend += (*p->width)(p, p->buf[j]); |
vend += (*p->width)(p, p->tcol->buf[j]); |
} |
} |
|
|
/* |
/* |
* 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. |
* If so, break to the next line. |
*/ |
*/ |
if (vend > bp && 0 == jhy && vis > 0) { |
|
|
if (vend > bp && jhy == 0 && vis > 0 && |
|
(p->flags & TERMP_BRNEVER) == 0) { |
|
if (p->lasttcol) |
|
return; |
|
|
|
endline(p); |
vend -= vis; |
vend -= vis; |
(*p->endline)(p); |
|
p->viscol = 0; |
|
if (TERMP_BRIND & p->flags) { |
|
vbl = p->rmargin; |
|
vend += p->rmargin; |
|
vend -= p->offset; |
|
} else |
|
vbl = p->offset; |
|
|
|
/* use pending tabs on the new line */ |
/* Use pending tabs on the new line. */ |
|
|
if (0 < ntab) |
vbl = 0; |
vbl += ntab * p->tabwidth; |
while (ntab--) |
|
vbl = term_tab_next(vbl); |
|
|
/* |
/* Re-establish indentation. */ |
* Remove the p->overstep width. |
|
* Again, if p->overstep is negative, |
|
* sign extension does the right thing. |
|
*/ |
|
|
|
bp += (size_t)p->overstep; |
if (p->flags & TERMP_BRIND) |
p->overstep = 0; |
vbl += p->tcol->rmargin; |
|
else |
|
vbl += p->tcol->offset; |
|
maxvis = p->tcol->rmargin > vbl ? |
|
p->tcol->rmargin - vbl : 0; |
|
bp = !(p->flags & TERMP_NOBREAK) ? maxvis : |
|
p->maxrmargin > vbl ? p->maxrmargin - vbl : 0; |
} |
} |
|
|
/* Write out the [remaining] word. */ |
/* |
for ( ; i < p->col; i++) { |
* Write out the rest of the word. |
if (vend > bp && jhy > 0 && i > jhy) |
*/ |
|
|
|
for ( ; p->tcol->col < p->lastcol; p->tcol->col++) { |
|
if (vend > bp && jhy > 0 && p->tcol->col > jhy) |
break; |
break; |
if ('\t' == p->buf[i]) |
if (p->tcol->buf[p->tcol->col] == '\t') |
break; |
break; |
if (' ' == p->buf[i]) { |
if (p->tcol->buf[p->tcol->col] == ' ') { |
j = i; |
j = p->tcol->col; |
while (i < p->col && ' ' == p->buf[i]) |
while (p->tcol->col < p->lastcol && |
i++; |
p->tcol->buf[p->tcol->col] == ' ') |
dv = (i - j) * (*p->width)(p, ' '); |
p->tcol->col++; |
|
dv = (p->tcol->col - j) * (*p->width)(p, ' '); |
vbl += dv; |
vbl += dv; |
vend += dv; |
vend += dv; |
break; |
break; |
} |
} |
if (ASCII_NBRSP == p->buf[i]) { |
if (p->tcol->buf[p->tcol->col] == ASCII_NBRSP) { |
vbl += (*p->width)(p, ' '); |
vbl += (*p->width)(p, ' '); |
continue; |
continue; |
} |
} |
if (ASCII_BREAK == p->buf[i]) |
if (p->tcol->buf[p->tcol->col] == ASCII_BREAK) |
continue; |
continue; |
|
|
/* |
/* |
Line 245 term_flushln(struct termp *p) |
|
Line 239 term_flushln(struct termp *p) |
|
vbl = 0; |
vbl = 0; |
} |
} |
|
|
(*p->letter)(p, p->buf[i]); |
(*p->letter)(p, p->tcol->buf[p->tcol->col]); |
if (8 == p->buf[i]) |
if (p->tcol->buf[p->tcol->col] == '\b') |
p->viscol -= (*p->width)(p, p->buf[i-1]); |
p->viscol -= (*p->width)(p, |
|
p->tcol->buf[p->tcol->col - 1]); |
else |
else |
p->viscol += (*p->width)(p, p->buf[i]); |
p->viscol += (*p->width)(p, |
|
p->tcol->buf[p->tcol->col]); |
} |
} |
vis = vend; |
vis = vend; |
} |
} |
Line 258 term_flushln(struct termp *p) |
|
Line 254 term_flushln(struct termp *p) |
|
* If there was trailing white space, it was not printed; |
* If there was trailing white space, it was not printed; |
* so reset the cursor position accordingly. |
* so reset the cursor position accordingly. |
*/ |
*/ |
|
|
if (vis > vbl) |
if (vis > vbl) |
vis -= vbl; |
vis -= vbl; |
else |
else |
vis = 0; |
vis = 0; |
|
|
p->col = 0; |
p->col = p->lastcol = 0; |
p->overstep = 0; |
p->minbl = p->trailspace; |
|
p->flags &= ~(TERMP_BACKAFTER | TERMP_BACKBEFORE | TERMP_NOPAD); |
|
|
if ( ! (TERMP_NOBREAK & p->flags)) { |
/* Trailing whitespace is significant in some columns. */ |
p->viscol = 0; |
|
(*p->endline)(p); |
|
return; |
|
} |
|
|
|
if (TERMP_HANG & p->flags) { |
if (vis && vbl && (TERMP_BRTRSP & p->flags)) |
p->overstep += (int)(p->offset + vis - p->rmargin + |
vis += vbl; |
p->trailspace * (*p->width)(p, ' ')); |
|
|
|
/* |
|
* If we have overstepped the margin, temporarily move |
|
* it to the right and flag the rest of the line to be |
|
* shorter. |
|
* If there is a request to keep the columns together, |
|
* allow negative overstep when the column is not full. |
|
*/ |
|
if (p->trailspace && p->overstep < 0) |
|
p->overstep = 0; |
|
return; |
|
|
|
} else if (TERMP_DANGLE & p->flags) |
|
return; |
|
|
|
/* If the column was overrun, break the line. */ |
/* If the column was overrun, break the line. */ |
if (maxvis < vis + p->trailspace * (*p->width)(p, ' ')) { |
if ((p->flags & TERMP_NOBREAK) == 0 || |
(*p->endline)(p); |
((p->flags & TERMP_HANG) == 0 && |
p->viscol = 0; |
vis + p->trailspace * (*p->width)(p, ' ') > maxvis)) |
|
endline(p); |
|
} |
|
|
|
static void |
|
endline(struct termp *p) |
|
{ |
|
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); |
} |
} |
|
|
/* |
/* |
Line 307 term_newln(struct termp *p) |
|
Line 305 term_newln(struct termp *p) |
|
{ |
{ |
|
|
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
if (p->col || p->viscol) |
if (p->lastcol || p->viscol) |
term_flushln(p); |
term_flushln(p); |
} |
} |
|
|
Line 323 term_vspace(struct termp *p) |
|
Line 321 term_vspace(struct termp *p) |
|
|
|
term_newln(p); |
term_newln(p); |
p->viscol = 0; |
p->viscol = 0; |
|
p->minbl = 0; |
if (0 < p->skipvsp) |
if (0 < p->skipvsp) |
p->skipvsp--; |
p->skipvsp--; |
else |
else |
Line 358 term_fontpush(struct termp *p, enum termfont f) |
|
Line 357 term_fontpush(struct termp *p, enum termfont f) |
|
if (++p->fonti == p->fontsz) { |
if (++p->fonti == p->fontsz) { |
p->fontsz += 8; |
p->fontsz += 8; |
p->fontq = mandoc_reallocarray(p->fontq, |
p->fontq = mandoc_reallocarray(p->fontq, |
p->fontsz, sizeof(enum termfont *)); |
p->fontsz, sizeof(*p->fontq)); |
} |
} |
p->fontq[p->fonti] = f; |
p->fontq[p->fonti] = f; |
} |
} |
Line 390 term_fontpop(struct termp *p) |
|
Line 389 term_fontpop(struct termp *p) |
|
void |
void |
term_word(struct termp *p, const char *word) |
term_word(struct termp *p, const char *word) |
{ |
{ |
|
struct roffsu su; |
const char nbrsp[2] = { ASCII_NBRSP, 0 }; |
const char nbrsp[2] = { ASCII_NBRSP, 0 }; |
const char *seq, *cp; |
const char *seq, *cp; |
int sz, uc; |
int sz, uc; |
size_t ssz; |
size_t csz, lsz, ssz; |
enum mandoc_esc esc; |
enum mandoc_esc esc; |
|
|
if ( ! (TERMP_NOSPACE & p->flags)) { |
if ((p->flags & TERMP_NOBUF) == 0) { |
if ( ! (TERMP_KEEP & p->flags)) { |
if ((p->flags & TERMP_NOSPACE) == 0) { |
bufferc(p, ' '); |
if ((p->flags & TERMP_KEEP) == 0) { |
if (TERMP_SENTENCE & p->flags) |
|
bufferc(p, ' '); |
bufferc(p, ' '); |
} else |
if (p->flags & TERMP_SENTENCE) |
bufferc(p, ASCII_NBRSP); |
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; |
} |
} |
if (TERMP_PREKEEP & p->flags) |
|
p->flags |= TERMP_KEEP; |
|
|
|
if ( ! (p->flags & TERMP_NONOSPACE)) |
|
p->flags &= ~TERMP_NOSPACE; |
|
else |
|
p->flags |= TERMP_NOSPACE; |
|
|
|
p->flags &= ~(TERMP_SENTENCE | TERMP_NONEWLINE); |
|
|
|
while ('\0' != *word) { |
while ('\0' != *word) { |
if ('\\' != *word) { |
if ('\\' != *word) { |
if (TERMP_SKIPCHAR & p->flags) { |
|
p->flags &= ~TERMP_SKIPCHAR; |
|
word++; |
|
continue; |
|
} |
|
if (TERMP_NBRWORD & p->flags) { |
if (TERMP_NBRWORD & p->flags) { |
if (' ' == *word) { |
if (' ' == *word) { |
encode(p, nbrsp, 1); |
encode(p, nbrsp, 1); |
Line 451 term_word(struct termp *p, const char *word) |
|
Line 447 term_word(struct termp *p, const char *word) |
|
break; |
break; |
case ESCAPE_SPECIAL: |
case ESCAPE_SPECIAL: |
if (p->enc == TERMENC_ASCII) { |
if (p->enc == TERMENC_ASCII) { |
cp = mchars_spec2str(p->symtab, |
cp = mchars_spec2str(seq, sz, &ssz); |
seq, sz, &ssz); |
|
if (cp != NULL) |
if (cp != NULL) |
encode(p, cp, ssz); |
encode(p, cp, ssz); |
} else { |
} else { |
uc = mchars_spec2cp(p->symtab, seq, sz); |
uc = mchars_spec2cp(seq, sz); |
if (uc > 0) |
if (uc > 0) |
encode1(p, uc); |
encode1(p, uc); |
} |
} |
Line 471 term_word(struct termp *p, const char *word) |
|
Line 466 term_word(struct termp *p, const char *word) |
|
term_fontrepl(p, TERMFONT_BI); |
term_fontrepl(p, TERMFONT_BI); |
continue; |
continue; |
case ESCAPE_FONT: |
case ESCAPE_FONT: |
/* FALLTHROUGH */ |
|
case ESCAPE_FONTROMAN: |
case ESCAPE_FONTROMAN: |
term_fontrepl(p, TERMFONT_NONE); |
term_fontrepl(p, TERMFONT_NONE); |
continue; |
continue; |
Line 479 term_word(struct termp *p, const char *word) |
|
Line 473 term_word(struct termp *p, const char *word) |
|
term_fontlast(p); |
term_fontlast(p); |
continue; |
continue; |
case ESCAPE_NOSPACE: |
case ESCAPE_NOSPACE: |
if (TERMP_SKIPCHAR & p->flags) |
if (p->flags & TERMP_BACKAFTER) |
p->flags &= ~TERMP_SKIPCHAR; |
p->flags &= ~TERMP_BACKAFTER; |
else if ('\0' == *word) |
else if (*word == '\0') |
p->flags |= (TERMP_NOSPACE | TERMP_NONEWLINE); |
p->flags |= (TERMP_NOSPACE | TERMP_NONEWLINE); |
continue; |
continue; |
|
case ESCAPE_HORIZ: |
|
if (a2roffsu(seq, &su, SCALE_EM) == 0) |
|
continue; |
|
uc = term_hspan(p, &su) / 24; |
|
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 (a2roffsu(seq, &su, SCALE_EM) == 0) |
|
continue; |
|
uc = term_hspan(p, &su) / 24; |
|
if (uc <= 0) { |
|
if (p->tcol->rmargin <= p->tcol->offset) |
|
continue; |
|
lsz = p->tcol->rmargin - p->tcol->offset; |
|
} else |
|
lsz = uc; |
|
while (sz && |
|
strchr(" %&()*+-./0123456789:<=>", *seq)) { |
|
seq++; |
|
sz--; |
|
} |
|
if (sz && strchr("cifMmnPpuv", *seq)) { |
|
seq++; |
|
sz--; |
|
} |
|
if (sz == 0) |
|
uc = -1; |
|
else if (*seq == '\\') { |
|
seq++; |
|
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; |
|
default: |
|
uc = -1; |
|
break; |
|
} |
|
} else |
|
uc = *seq; |
|
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: |
case ESCAPE_SKIPCHAR: |
p->flags |= TERMP_SKIPCHAR; |
p->flags |= TERMP_BACKAFTER; |
continue; |
continue; |
case ESCAPE_OVERSTRIKE: |
case ESCAPE_OVERSTRIKE: |
cp = seq + sz; |
cp = seq + sz; |
Line 495 term_word(struct termp *p, const char *word) |
|
Line 566 term_word(struct termp *p, const char *word) |
|
continue; |
continue; |
} |
} |
encode1(p, *seq++); |
encode1(p, *seq++); |
if (seq < cp) |
if (seq < cp) { |
encode(p, "\b", 1); |
if (p->flags & TERMP_BACKBEFORE) |
|
p->flags |= TERMP_BACKAFTER; |
|
else |
|
p->flags |= TERMP_BACKBEFORE; |
|
} |
} |
} |
|
/* Trim trailing backspace/blank pair. */ |
|
if (p->lastcol > 2 && |
|
(p->tcol->buf[p->lastcol - 1] == ' ' || |
|
p->tcol->buf[p->lastcol - 1] == '\t')) |
|
p->lastcol -= 2; |
|
if (p->col > p->lastcol) |
|
p->col = p->lastcol; |
|
continue; |
default: |
default: |
continue; |
continue; |
} |
} |
Line 521 term_word(struct termp *p, const char *word) |
|
Line 604 term_word(struct termp *p, const char *word) |
|
} |
} |
|
|
static void |
static void |
adjbuf(struct termp *p, size_t sz) |
adjbuf(struct termp_col *c, size_t sz) |
{ |
{ |
|
if (c->maxcols == 0) |
if (0 == p->maxcols) |
c->maxcols = 1024; |
p->maxcols = 1024; |
while (c->maxcols <= sz) |
while (sz >= p->maxcols) |
c->maxcols <<= 2; |
p->maxcols <<= 2; |
c->buf = mandoc_reallocarray(c->buf, c->maxcols, sizeof(*c->buf)); |
|
|
p->buf = mandoc_reallocarray(p->buf, p->maxcols, sizeof(int)); |
|
} |
} |
|
|
static void |
static void |
bufferc(struct termp *p, char c) |
bufferc(struct termp *p, char c) |
{ |
{ |
|
if (p->flags & TERMP_NOBUF) { |
if (p->col + 1 >= p->maxcols) |
(*p->letter)(p, c); |
adjbuf(p, p->col + 1); |
return; |
|
} |
p->buf[p->col++] = c; |
if (p->col + 1 >= p->tcol->maxcols) |
|
adjbuf(p->tcol, p->col + 1); |
|
if (p->lastcol <= p->col || (c != ' ' && c != ASCII_NBRSP)) |
|
p->tcol->buf[p->col] = c; |
|
if (p->lastcol < ++p->col) |
|
p->lastcol = p->col; |
} |
} |
|
|
/* |
/* |
Line 552 encode1(struct termp *p, int c) |
|
Line 638 encode1(struct termp *p, int c) |
|
{ |
{ |
enum termfont f; |
enum termfont f; |
|
|
if (TERMP_SKIPCHAR & p->flags) { |
if (p->flags & TERMP_NOBUF) { |
p->flags &= ~TERMP_SKIPCHAR; |
(*p->letter)(p, c); |
return; |
return; |
} |
} |
|
|
if (p->col + 6 >= p->maxcols) |
if (p->col + 7 >= p->tcol->maxcols) |
adjbuf(p, p->col + 6); |
adjbuf(p->tcol, p->col + 7); |
|
|
f = p->fontq[p->fonti]; |
f = (c == ASCII_HYPH || c > 127 || isgraph(c)) ? |
|
p->fontq[p->fonti] : TERMFONT_NONE; |
|
|
if (TERMFONT_UNDER == f || TERMFONT_BI == f) { |
if (p->flags & TERMP_BACKBEFORE) { |
p->buf[p->col++] = '_'; |
if (p->tcol->buf[p->col - 1] == ' ' || |
p->buf[p->col++] = 8; |
p->tcol->buf[p->col - 1] == '\t') |
|
p->col--; |
|
else |
|
p->tcol->buf[p->col++] = '\b'; |
|
p->flags &= ~TERMP_BACKBEFORE; |
} |
} |
if (TERMFONT_BOLD == f || TERMFONT_BI == f) { |
if (f == TERMFONT_UNDER || f == TERMFONT_BI) { |
if (ASCII_HYPH == c) |
p->tcol->buf[p->col++] = '_'; |
p->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 |
else |
p->buf[p->col++] = c; |
p->tcol->buf[p->col++] = c; |
p->buf[p->col++] = 8; |
p->tcol->buf[p->col++] = '\b'; |
} |
} |
p->buf[p->col++] = c; |
if (p->lastcol <= p->col || (c != ' ' && c != ASCII_NBRSP)) |
|
p->tcol->buf[p->col] = c; |
|
if (p->lastcol < ++p->col) |
|
p->lastcol = p->col; |
|
if (p->flags & TERMP_BACKAFTER) { |
|
p->flags |= TERMP_BACKBEFORE; |
|
p->flags &= ~TERMP_BACKAFTER; |
|
} |
} |
} |
|
|
static void |
static void |
Line 581 encode(struct termp *p, const char *word, size_t sz) |
|
Line 683 encode(struct termp *p, const char *word, size_t sz) |
|
{ |
{ |
size_t i; |
size_t i; |
|
|
if (TERMP_SKIPCHAR & p->flags) { |
if (p->flags & TERMP_NOBUF) { |
p->flags &= ~TERMP_SKIPCHAR; |
|
return; |
|
} |
|
|
|
/* |
|
* Encode and buffer a string of characters. If the current |
|
* font mode is unset, buffer directly, else encode then buffer |
|
* character by character. |
|
*/ |
|
|
|
if (p->fontq[p->fonti] == TERMFONT_NONE) { |
|
if (p->col + sz >= p->maxcols) |
|
adjbuf(p, p->col + sz); |
|
for (i = 0; i < sz; i++) |
for (i = 0; i < sz; i++) |
p->buf[p->col++] = word[i]; |
(*p->letter)(p, word[i]); |
return; |
return; |
} |
} |
|
|
/* Pre-buffer, assuming worst-case. */ |
if (p->col + 2 + (sz * 5) >= p->tcol->maxcols) |
|
adjbuf(p->tcol, p->col + 2 + (sz * 5)); |
|
|
if (p->col + 1 + (sz * 5) >= p->maxcols) |
|
adjbuf(p, p->col + 1 + (sz * 5)); |
|
|
|
for (i = 0; i < sz; i++) { |
for (i = 0; i < sz; i++) { |
if (ASCII_HYPH == word[i] || |
if (ASCII_HYPH == word[i] || |
isgraph((unsigned char)word[i])) |
isgraph((unsigned char)word[i])) |
encode1(p, word[i]); |
encode1(p, word[i]); |
else |
else { |
p->buf[p->col++] = word[i]; |
if (p->lastcol <= p->col || |
|
(word[i] != ' ' && word[i] != ASCII_NBRSP)) |
|
p->tcol->buf[p->col] = word[i]; |
|
p->col++; |
|
|
|
/* |
|
* Postpone the effect of \z while handling |
|
* an overstrike sequence from ascii_uc2str(). |
|
*/ |
|
|
|
if (word[i] == '\b' && |
|
(p->flags & TERMP_BACKBEFORE)) { |
|
p->flags &= ~TERMP_BACKBEFORE; |
|
p->flags |= TERMP_BACKAFTER; |
|
} |
|
} |
} |
} |
|
if (p->lastcol < p->col) |
|
p->lastcol = p->col; |
} |
} |
|
|
void |
void |
term_setwidth(struct termp *p, const char *wstr) |
term_setwidth(struct termp *p, const char *wstr) |
{ |
{ |
struct roffsu su; |
struct roffsu su; |
size_t width; |
int iop, width; |
int iop; |
|
|
|
iop = 0; |
iop = 0; |
width = 0; |
width = 0; |
|
|
term_len(const struct termp *p, size_t sz) |
term_len(const struct termp *p, size_t sz) |
{ |
{ |
|
|
return((*p->width)(p, ' ') * sz); |
return (*p->width)(p, ' ') * sz; |
} |
} |
|
|
static size_t |
static size_t |
Line 657 cond_width(const struct termp *p, int c, int *skip) |
|
Line 760 cond_width(const struct termp *p, int c, int *skip) |
|
|
|
if (*skip) { |
if (*skip) { |
(*skip) = 0; |
(*skip) = 0; |
return(0); |
return 0; |
} else |
} else |
return((*p->width)(p, c)); |
return (*p->width)(p, c); |
} |
} |
|
|
size_t |
size_t |
Line 705 term_strlen(const struct termp *p, const char *cp) |
|
Line 808 term_strlen(const struct termp *p, const char *cp) |
|
break; |
break; |
case ESCAPE_SPECIAL: |
case ESCAPE_SPECIAL: |
if (p->enc == TERMENC_ASCII) { |
if (p->enc == TERMENC_ASCII) { |
rhs = mchars_spec2str(p->symtab, |
rhs = mchars_spec2str(seq, ssz, &rsz); |
seq, ssz, &rsz); |
|
if (rhs != NULL) |
if (rhs != NULL) |
break; |
break; |
} else { |
} else { |
uc = mchars_spec2cp(p->symtab, |
uc = mchars_spec2cp(seq, ssz); |
seq, ssz); |
|
if (uc > 0) |
if (uc > 0) |
sz += cond_width(p, uc, &skip); |
sz += cond_width(p, uc, &skip); |
} |
} |
Line 775 term_strlen(const struct termp *p, const char *cp) |
|
Line 876 term_strlen(const struct termp *p, const char *cp) |
|
case ASCII_HYPH: |
case ASCII_HYPH: |
sz += cond_width(p, '-', &skip); |
sz += cond_width(p, '-', &skip); |
cp++; |
cp++; |
/* FALLTHROUGH */ |
|
case ASCII_BREAK: |
|
break; |
break; |
default: |
default: |
break; |
break; |
} |
} |
} |
} |
|
|
return(sz); |
return sz; |
} |
} |
|
|
int |
int |
Line 815 term_vspan(const struct termp *p, const struct roffsu |
|
Line 914 term_vspan(const struct termp *p, const struct roffsu |
|
r = su->scale / 12.0; |
r = su->scale / 12.0; |
break; |
break; |
case SCALE_EN: |
case SCALE_EN: |
/* FALLTHROUGH */ |
|
case SCALE_EM: |
case SCALE_EM: |
r = su->scale * 0.6; |
r = su->scale * 0.6; |
break; |
break; |
Line 824 term_vspan(const struct termp *p, const struct roffsu |
|
Line 922 term_vspan(const struct termp *p, const struct roffsu |
|
break; |
break; |
default: |
default: |
abort(); |
abort(); |
/* NOTREACHED */ |
|
} |
} |
ri = r > 0.0 ? r + 0.4995 : r - 0.4995; |
ri = r > 0.0 ? r + 0.4995 : r - 0.4995; |
return(ri < 66 ? ri : 1); |
return ri < 66 ? ri : 1; |
} |
} |
|
|
|
/* |
|
* Convert a scaling width to basic units, rounding down. |
|
*/ |
int |
int |
term_hspan(const struct termp *p, const struct roffsu *su) |
term_hspan(const struct termp *p, const struct roffsu *su) |
{ |
{ |
double v; |
|
|
|
v = (*p->hspan)(p, su); |
return (*p->hspan)(p, su); |
return(v > 0.0 ? v + 0.0005 : v - 0.0005); |
|
} |
} |