version 1.232, 2014/10/28 18:49:33 |
version 1.260, 2017/05/07 17:31:45 |
|
|
/* $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-2014 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 |
Line 43 term_free(struct termp *p) |
|
Line 43 term_free(struct termp *p) |
|
{ |
{ |
|
|
free(p->buf); |
free(p->buf); |
|
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 77 term_end(struct termp *p) |
|
Line 78 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 |
Line 100 term_flushln(struct termp *p) |
|
Line 103 term_flushln(struct termp *p) |
|
size_t j; /* temporary loop index for p->buf */ |
size_t j; /* temporary loop index for p->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 */ |
size_t mmax; /* used in calculating bp */ |
|
|
|
/* |
/* |
* First, establish the maximum columns of "visible" content. |
* First, establish the maximum columns of "visible" content. |
Line 113 term_flushln(struct termp *p) |
|
Line 115 term_flushln(struct termp *p) |
|
* is negative, it gets sign extended. Subtracting that |
* is negative, it gets sign extended. Subtracting that |
* very large size_t effectively adds a small number to dv. |
* very large size_t effectively adds a small number to dv. |
*/ |
*/ |
assert (p->rmargin >= p->offset); |
dv = p->rmargin > p->offset ? p->rmargin - p->offset : 0; |
dv = p->rmargin - p->offset; |
|
maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
dv = p->maxrmargin - p->offset; |
|
mmax = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
|
|
|
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
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. |
* Calculate the required amount of padding. |
Line 136 term_flushln(struct termp *p) |
|
Line 141 term_flushln(struct termp *p) |
|
* 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 (i < p->col && p->buf[i] == '\t') { |
vend = (vis / p->tabwidth + 1) * p->tabwidth; |
vend = term_tab_next(vis); |
vbl += vend - vis; |
vbl += vend - vis; |
vis = vend; |
vis = vend; |
ntab++; |
ntab++; |
Line 155 term_flushln(struct termp *p) |
|
Line 160 term_flushln(struct termp *p) |
|
if (' ' == p->buf[j] || '\t' == p->buf[j]) |
if (' ' == p->buf[j] || '\t' == p->buf[j]) |
break; |
break; |
|
|
/* Back over the the last printed character. */ |
/* Back over the last printed character. */ |
if (8 == p->buf[j]) { |
if (8 == p->buf[j]) { |
assert(j); |
assert(j); |
vend -= (*p->width)(p, p->buf[j - 1]); |
vend -= (*p->width)(p, p->buf[j - 1]); |
Line 187 term_flushln(struct termp *p) |
|
Line 192 term_flushln(struct termp *p) |
|
vend -= vis; |
vend -= vis; |
(*p->endline)(p); |
(*p->endline)(p); |
p->viscol = 0; |
p->viscol = 0; |
if (TERMP_BRIND & p->flags) { |
|
vbl = p->rmargin; |
|
vend += p->rmargin - 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. */ |
|
|
|
if (p->flags & TERMP_BRIND) { |
|
vbl += p->rmargin; |
|
vend += p->rmargin - p->offset; |
|
} else |
|
vbl += p->offset; |
|
|
/* |
/* |
* Remove the p->overstep width. |
* Remove the p->overstep width. |
* Again, if p->overstep is negative, |
* Again, if p->overstep is negative, |
Line 254 term_flushln(struct termp *p) |
|
Line 263 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) |
if (vis > vbl) |
vis -= vbl; |
vis -= vbl; |
|
else |
|
vis = 0; |
|
|
p->col = 0; |
p->col = 0; |
p->overstep = 0; |
p->overstep = 0; |
|
p->flags &= ~(TERMP_BACKAFTER | TERMP_BACKBEFORE); |
|
|
if ( ! (TERMP_NOBREAK & p->flags)) { |
if ( ! (TERMP_NOBREAK & p->flags)) { |
p->viscol = 0; |
p->viscol = 0; |
Line 267 term_flushln(struct termp *p) |
|
Line 279 term_flushln(struct termp *p) |
|
} |
} |
|
|
if (TERMP_HANG & p->flags) { |
if (TERMP_HANG & p->flags) { |
p->overstep = (int)(vis - maxvis + |
p->overstep += (int)(p->offset + vis - p->rmargin + |
p->trailspace * (*p->width)(p, ' ')); |
p->trailspace * (*p->width)(p, ' ')); |
|
|
/* |
/* |
Line 284 term_flushln(struct termp *p) |
|
Line 296 term_flushln(struct termp *p) |
|
} else if (TERMP_DANGLE & p->flags) |
} else if (TERMP_DANGLE & p->flags) |
return; |
return; |
|
|
|
/* Trailing whitespace is significant in some columns. */ |
|
if (vis && vbl && (TERMP_BRTRSP & p->flags)) |
|
vis += vbl; |
|
|
/* 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 (maxvis < vis + p->trailspace * (*p->width)(p, ' ')) { |
(*p->endline)(p); |
(*p->endline)(p); |
Line 323 term_vspace(struct termp *p) |
|
Line 339 term_vspace(struct termp *p) |
|
(*p->endline)(p); |
(*p->endline)(p); |
} |
} |
|
|
|
/* Swap current and previous font; for \fP and .ft P */ |
void |
void |
term_fontlast(struct termp *p) |
term_fontlast(struct termp *p) |
{ |
{ |
Line 333 term_fontlast(struct termp *p) |
|
Line 350 term_fontlast(struct termp *p) |
|
p->fontq[p->fonti] = f; |
p->fontq[p->fonti] = f; |
} |
} |
|
|
|
/* Set font, save current, discard previous; for \f, .ft, .B etc. */ |
void |
void |
term_fontrepl(struct termp *p, enum termfont f) |
term_fontrepl(struct termp *p, enum termfont f) |
{ |
{ |
Line 341 term_fontrepl(struct termp *p, enum termfont f) |
|
Line 359 term_fontrepl(struct termp *p, enum termfont f) |
|
p->fontq[p->fonti] = f; |
p->fontq[p->fonti] = f; |
} |
} |
|
|
|
/* Set font, save previous. */ |
void |
void |
term_fontpush(struct termp *p, enum termfont f) |
term_fontpush(struct termp *p, enum termfont f) |
{ |
{ |
|
|
assert(p->fonti + 1 < 10); |
|
p->fontl = p->fontq[p->fonti]; |
p->fontl = p->fontq[p->fonti]; |
p->fontq[++p->fonti] = f; |
if (++p->fonti == p->fontsz) { |
|
p->fontsz += 8; |
|
p->fontq = mandoc_reallocarray(p->fontq, |
|
p->fontsz, sizeof(*p->fontq)); |
|
} |
|
p->fontq[p->fonti] = f; |
} |
} |
|
|
const void * |
/* Flush to make the saved pointer current again. */ |
term_fontq(struct termp *p) |
|
{ |
|
|
|
return(&p->fontq[p->fonti]); |
|
} |
|
|
|
enum termfont |
|
term_fonttop(struct termp *p) |
|
{ |
|
|
|
return(p->fontq[p->fonti]); |
|
} |
|
|
|
void |
void |
term_fontpopq(struct termp *p, const void *key) |
term_fontpopq(struct termp *p, int i) |
{ |
{ |
|
|
while (p->fonti >= 0 && key < (void *)(p->fontq + p->fonti)) |
assert(i >= 0); |
p->fonti--; |
if (p->fonti > i) |
assert(p->fonti >= 0); |
p->fonti = i; |
} |
} |
|
|
|
/* Pop one font off the stack. */ |
void |
void |
term_fontpop(struct termp *p) |
term_fontpop(struct termp *p) |
{ |
{ |
Line 391 term_word(struct termp *p, const char *word) |
|
Line 402 term_word(struct termp *p, const char *word) |
|
{ |
{ |
const char nbrsp[2] = { ASCII_NBRSP, 0 }; |
const char nbrsp[2] = { ASCII_NBRSP, 0 }; |
const char *seq, *cp; |
const char *seq, *cp; |
char c; |
|
int sz, uc; |
int sz, uc; |
size_t ssz; |
size_t ssz; |
enum mandoc_esc esc; |
enum mandoc_esc esc; |
Line 412 term_word(struct termp *p, const char *word) |
|
Line 422 term_word(struct termp *p, const char *word) |
|
else |
else |
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
|
|
p->flags &= ~TERMP_SENTENCE; |
p->flags &= ~(TERMP_SENTENCE | TERMP_NONEWLINE); |
|
p->skipvsp = 0; |
|
|
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 443 term_word(struct termp *p, const char *word) |
|
Line 449 term_word(struct termp *p, const char *word) |
|
switch (esc) { |
switch (esc) { |
case ESCAPE_UNICODE: |
case ESCAPE_UNICODE: |
uc = mchars_num2uc(seq + 1, sz - 1); |
uc = mchars_num2uc(seq + 1, sz - 1); |
if (p->enc == TERMENC_ASCII) { |
|
cp = ascii_uc2str(uc); |
|
encode(p, cp, strlen(cp)); |
|
} else |
|
encode1(p, uc); |
|
break; |
break; |
case ESCAPE_NUMBERED: |
case ESCAPE_NUMBERED: |
c = mchars_num2char(seq, sz); |
uc = mchars_num2char(seq, sz); |
if ('\0' != c) |
if (uc < 0) |
encode(p, &c, 1); |
continue; |
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); |
} |
} |
break; |
continue; |
case ESCAPE_FONTBOLD: |
case ESCAPE_FONTBOLD: |
term_fontrepl(p, TERMFONT_BOLD); |
term_fontrepl(p, TERMFONT_BOLD); |
break; |
continue; |
case ESCAPE_FONTITALIC: |
case ESCAPE_FONTITALIC: |
term_fontrepl(p, TERMFONT_UNDER); |
term_fontrepl(p, TERMFONT_UNDER); |
break; |
continue; |
case ESCAPE_FONTBI: |
case ESCAPE_FONTBI: |
term_fontrepl(p, TERMFONT_BI); |
term_fontrepl(p, TERMFONT_BI); |
break; |
continue; |
case ESCAPE_FONT: |
case ESCAPE_FONT: |
/* FALLTHROUGH */ |
|
case ESCAPE_FONTROMAN: |
case ESCAPE_FONTROMAN: |
term_fontrepl(p, TERMFONT_NONE); |
term_fontrepl(p, TERMFONT_NONE); |
break; |
continue; |
case ESCAPE_FONTPREV: |
case ESCAPE_FONTPREV: |
term_fontlast(p); |
term_fontlast(p); |
break; |
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; |
p->flags |= (TERMP_NOSPACE | TERMP_NONEWLINE); |
break; |
continue; |
case ESCAPE_SKIPCHAR: |
case ESCAPE_SKIPCHAR: |
p->flags |= TERMP_SKIPCHAR; |
p->flags |= TERMP_BACKAFTER; |
break; |
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->col > 2 && |
|
(p->buf[p->col - 1] == ' ' || |
|
p->buf[p->col - 1] == '\t')) |
|
p->col -= 2; |
|
continue; |
default: |
default: |
break; |
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); |
|
} |
} |
} |
p->flags &= ~TERMP_NBRWORD; |
p->flags &= ~TERMP_NBRWORD; |
} |
} |
Line 531 encode1(struct termp *p, int c) |
|
Line 566 encode1(struct termp *p, int c) |
|
{ |
{ |
enum termfont f; |
enum termfont f; |
|
|
if (TERMP_SKIPCHAR & p->flags) { |
if (p->col + 7 >= p->maxcols) |
p->flags &= ~TERMP_SKIPCHAR; |
adjbuf(p, p->col + 7); |
return; |
|
} |
|
|
|
if (p->col + 6 >= p->maxcols) |
f = (c == ASCII_HYPH || c > 127 || isgraph(c)) ? |
adjbuf(p, p->col + 6); |
p->fontq[p->fonti] : TERMFONT_NONE; |
|
|
f = term_fonttop(p); |
if (p->flags & TERMP_BACKBEFORE) { |
|
if (p->buf[p->col - 1] == ' ' || p->buf[p->col - 1] == '\t') |
|
p->col--; |
|
else |
|
p->buf[p->col++] = 8; |
|
p->flags &= ~TERMP_BACKBEFORE; |
|
} |
if (TERMFONT_UNDER == f || TERMFONT_BI == f) { |
if (TERMFONT_UNDER == f || TERMFONT_BI == f) { |
p->buf[p->col++] = '_'; |
p->buf[p->col++] = '_'; |
p->buf[p->col++] = 8; |
p->buf[p->col++] = 8; |
Line 553 encode1(struct termp *p, int c) |
|
Line 591 encode1(struct termp *p, int c) |
|
p->buf[p->col++] = 8; |
p->buf[p->col++] = 8; |
} |
} |
p->buf[p->col++] = c; |
p->buf[p->col++] = c; |
|
if (p->flags & TERMP_BACKAFTER) { |
|
p->flags |= TERMP_BACKBEFORE; |
|
p->flags &= ~TERMP_BACKAFTER; |
|
} |
} |
} |
|
|
static void |
static void |
Line 560 encode(struct termp *p, const char *word, size_t sz) |
|
Line 602 encode(struct termp *p, const char *word, size_t sz) |
|
{ |
{ |
size_t i; |
size_t i; |
|
|
if (TERMP_SKIPCHAR & p->flags) { |
if (p->col + 2 + (sz * 5) >= p->maxcols) |
p->flags &= ~TERMP_SKIPCHAR; |
adjbuf(p, p->col + 2 + (sz * 5)); |
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 (TERMFONT_NONE == term_fonttop(p)) { |
|
if (p->col + sz >= p->maxcols) |
|
adjbuf(p, p->col + sz); |
|
for (i = 0; i < sz; i++) |
|
p->buf[p->col++] = word[i]; |
|
return; |
|
} |
|
|
|
/* Pre-buffer, assuming worst-case. */ |
|
|
|
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]; |
p->buf[p->col++] = word[i]; |
|
|
|
/* |
|
* 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; |
|
} |
|
} |
} |
} |
} |
} |
|
|
|
|
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 636 cond_width(const struct termp *p, int c, int *skip) |
|
Line 668 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 |
term_strlen(const struct termp *p, const char *cp) |
term_strlen(const struct termp *p, const char *cp) |
{ |
{ |
size_t sz, rsz, i; |
size_t sz, rsz, i; |
int ssz, skip, c; |
int ssz, skip, uc; |
const char *seq, *rhs; |
const char *seq, *rhs; |
enum mandoc_esc esc; |
enum mandoc_esc esc; |
static const char rej[] = { '\\', ASCII_NBRSP, ASCII_HYPH, |
static const char rej[] = { '\\', ASCII_NBRSP, ASCII_HYPH, |
Line 675 term_strlen(const struct termp *p, const char *cp) |
|
Line 707 term_strlen(const struct termp *p, const char *cp) |
|
|
|
switch (esc) { |
switch (esc) { |
case ESCAPE_UNICODE: |
case ESCAPE_UNICODE: |
c = mchars_num2uc(seq + 1, sz - 1); |
uc = mchars_num2uc(seq + 1, ssz - 1); |
if (p->enc == TERMENC_ASCII) { |
|
rhs = ascii_uc2str(c); |
|
rsz = strlen(rhs); |
|
} else |
|
sz += cond_width(p, c, &skip); |
|
break; |
break; |
case ESCAPE_NUMBERED: |
case ESCAPE_NUMBERED: |
c = mchars_num2char(seq, ssz); |
uc = mchars_num2char(seq, ssz); |
if ('\0' != c) |
if (uc < 0) |
sz += cond_width(p, c, &skip); |
continue; |
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) |
else { |
break; |
c = mchars_spec2cp(p->symtab, |
} else { |
seq, ssz); |
uc = mchars_spec2cp(seq, ssz); |
if (c > 0) |
if (uc > 0) |
sz += cond_width(p, c, &skip); |
sz += cond_width(p, uc, &skip); |
} |
} |
break; |
continue; |
case ESCAPE_SKIPCHAR: |
case ESCAPE_SKIPCHAR: |
skip = 1; |
skip = 1; |
break; |
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: |
default: |
break; |
continue; |
} |
} |
|
|
if (NULL == rhs) |
/* |
break; |
* Common handling for Unicode and numbered |
|
* character escape sequences. |
|
*/ |
|
|
|
if (rhs == NULL) { |
|
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) { |
if (skip) { |
skip = 0; |
skip = 0; |
break; |
break; |
} |
} |
|
|
|
/* |
|
* Common handling for all escape sequences |
|
* printing more than one character. |
|
*/ |
|
|
for (i = 0; i < rsz; i++) |
for (i = 0; i < rsz; i++) |
sz += (*p->width)(p, *rhs++); |
sz += (*p->width)(p, *rhs++); |
break; |
break; |
Line 723 term_strlen(const struct termp *p, const char *cp) |
|
Line 784 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; |
} |
} |
|
|
size_t |
int |
term_vspan(const struct termp *p, const struct roffsu *su) |
term_vspan(const struct termp *p, const struct roffsu *su) |
{ |
{ |
double r; |
double r; |
|
int ri; |
|
|
switch (su->unit) { |
switch (su->unit) { |
|
case SCALE_BU: |
|
r = su->scale / 40.0; |
|
break; |
case SCALE_CM: |
case SCALE_CM: |
r = su->scale * 2.0; |
r = su->scale * 6.0 / 2.54; |
break; |
break; |
|
case SCALE_FS: |
|
r = su->scale * 65536.0 / 40.0; |
|
break; |
case SCALE_IN: |
case SCALE_IN: |
r = su->scale * 6.0; |
r = su->scale * 6.0; |
break; |
break; |
|
case SCALE_MM: |
|
r = su->scale * 0.006; |
|
break; |
case SCALE_PC: |
case SCALE_PC: |
r = su->scale; |
r = su->scale; |
break; |
break; |
case SCALE_PT: |
case SCALE_PT: |
r = su->scale / 8.0; |
r = su->scale / 12.0; |
break; |
break; |
case SCALE_MM: |
case SCALE_EN: |
r = su->scale / 1000.0; |
case SCALE_EM: |
|
r = su->scale * 0.6; |
break; |
break; |
case SCALE_VS: |
case SCALE_VS: |
r = su->scale; |
r = su->scale; |
break; |
break; |
default: |
default: |
r = su->scale - 1.0; |
abort(); |
break; |
|
} |
} |
|
ri = r > 0.0 ? r + 0.4995 : r - 0.4995; |
if (r < 0.0) |
return ri < 66 ? ri : 1; |
r = 0.0; |
|
return((size_t)(r + 0.0005)); |
|
} |
} |
|
|
size_t |
/* |
|
* Convert a scaling width to basic units, rounding down. |
|
*/ |
|
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); |
if (v < 0.0) |
|
v = 0.0; |
|
return((size_t)(v + 0.0005)); |
|
} |
} |