version 1.164, 2010/07/25 22:56:47 |
version 1.176, 2011/01/04 13:14:26 |
|
|
static void spec(struct termp *, enum roffdeco, |
static void spec(struct termp *, enum roffdeco, |
const char *, size_t); |
const char *, size_t); |
static void res(struct termp *, const char *, size_t); |
static void res(struct termp *, const char *, size_t); |
static void buffera(struct termp *, const char *, size_t); |
|
static void bufferc(struct termp *, char); |
static void bufferc(struct termp *, char); |
static void adjbuf(struct termp *p, size_t); |
static void adjbuf(struct termp *p, size_t); |
static void encode(struct termp *, const char *, size_t); |
static void encode(struct termp *, const char *, size_t); |
Line 84 term_alloc(enum termenc enc) |
|
Line 83 term_alloc(enum termenc enc) |
|
p = calloc(1, sizeof(struct termp)); |
p = calloc(1, sizeof(struct termp)); |
if (NULL == p) { |
if (NULL == p) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit((int)MANDOCLEVEL_SYSERR); |
} |
} |
|
|
p->enc = enc; |
p->enc = enc; |
Line 135 term_flushln(struct termp *p) |
|
Line 134 term_flushln(struct termp *p) |
|
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 */ |
int j; /* temporary loop index for p->buf */ |
int j; /* temporary loop index for p->buf */ |
int jhy; /* last hyph before overflow w/r/t j */ |
int 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 */ |
Line 146 term_flushln(struct termp *p) |
|
Line 146 term_flushln(struct termp *p) |
|
* an indentation, but can be, for tagged lists or columns, a |
* an indentation, but can be, for tagged lists or columns, a |
* small set of values. |
* small set of values. |
*/ |
*/ |
|
assert (p->rmargin >= p->offset); |
|
dv = p->rmargin - p->offset; |
|
maxvis = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
|
dv = p->maxrmargin - p->offset; |
|
mmax = (int)dv > p->overstep ? dv - (size_t)p->overstep : 0; |
|
|
assert(p->offset < p->rmargin); |
|
|
|
maxvis = (int)(p->rmargin - p->offset) - p->overstep < 0 ? |
|
/* LINTED */ |
|
0 : p->rmargin - p->offset - p->overstep; |
|
mmax = (int)(p->maxrmargin - p->offset) - p->overstep < 0 ? |
|
/* LINTED */ |
|
0 : p->maxrmargin - p->offset - p->overstep; |
|
|
|
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
|
|
/* |
/* |
* Indent the first line of a paragraph. |
* Indent the first line of a paragraph. |
*/ |
*/ |
vbl = p->flags & TERMP_NOLPAD ? 0 : p->offset; |
vbl = p->flags & TERMP_NOLPAD ? (size_t)0 : p->offset; |
|
|
vis = vend = i = 0; |
vis = vend = 0; |
|
i = 0; |
|
|
while (i < (int)p->col) { |
while (i < (int)p->col) { |
/* |
/* |
* 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. |
*/ |
*/ |
for (j = i; j < (int)p->col; j++) { |
while (i < (int)p->col && '\t' == p->buf[i]) { |
if ('\t' != p->buf[j]) |
|
break; |
|
vend = (vis / p->tabwidth + 1) * p->tabwidth; |
vend = (vis / p->tabwidth + 1) * p->tabwidth; |
vbl += vend - vis; |
vbl += vend - vis; |
vis = vend; |
vis = vend; |
|
i++; |
} |
} |
|
|
/* |
/* |
Line 185 term_flushln(struct termp *p) |
|
Line 181 term_flushln(struct termp *p) |
|
* space is printed according to regular spacing rules). |
* space is printed according to regular spacing rules). |
*/ |
*/ |
|
|
/* LINTED */ |
for (j = i, jhy = 0; j < (int)p->col; j++) { |
for (jhy = 0; j < (int)p->col; j++) { |
|
if ((j && ' ' == p->buf[j]) || '\t' == p->buf[j]) |
if ((j && ' ' == p->buf[j]) || '\t' == p->buf[j]) |
break; |
break; |
|
|
Line 224 term_flushln(struct termp *p) |
|
Line 219 term_flushln(struct termp *p) |
|
|
|
/* Remove the p->overstep width. */ |
/* Remove the p->overstep width. */ |
|
|
bp += (int)/* LINTED */ |
bp += (size_t)p->overstep; |
p->overstep; |
|
p->overstep = 0; |
p->overstep = 0; |
} |
} |
|
|
/* |
|
* Skip leading tabs, they were handled above. |
|
*/ |
|
while (i < (int)p->col && '\t' == p->buf[i]) |
|
i++; |
|
|
|
/* Write out the [remaining] word. */ |
/* Write out the [remaining] word. */ |
for ( ; i < (int)p->col; i++) { |
for ( ; i < (int)p->col; i++) { |
if (vend > bp && jhy > 0 && i > jhy) |
if (vend > bp && jhy > 0 && i > jhy) |
Line 245 term_flushln(struct termp *p) |
|
Line 233 term_flushln(struct termp *p) |
|
j = i; |
j = i; |
while (' ' == p->buf[i]) |
while (' ' == p->buf[i]) |
i++; |
i++; |
vbl += (i - j) * (*p->width)(p, ' '); |
dv = (size_t)(i - j) * (*p->width)(p, ' '); |
|
vbl += dv; |
|
vend += dv; |
break; |
break; |
} |
} |
if (ASCII_NBRSP == p->buf[i]) { |
if (ASCII_NBRSP == p->buf[i]) { |
Line 272 term_flushln(struct termp *p) |
|
Line 262 term_flushln(struct termp *p) |
|
p->viscol += (*p->width)(p, p->buf[i]); |
p->viscol += (*p->width)(p, p->buf[i]); |
} |
} |
} |
} |
vend += vbl; |
|
vis = vend; |
vis = vend; |
} |
} |
|
|
|
/* |
|
* If there was trailing white space, it was not printed; |
|
* so reset the cursor position accordingly. |
|
*/ |
|
vis -= vbl; |
|
|
p->col = 0; |
p->col = 0; |
p->overstep = 0; |
p->overstep = 0; |
|
|
Line 287 term_flushln(struct termp *p) |
|
Line 282 term_flushln(struct termp *p) |
|
|
|
if (TERMP_HANG & p->flags) { |
if (TERMP_HANG & p->flags) { |
/* We need one blank after the tag. */ |
/* We need one blank after the tag. */ |
p->overstep = /* LINTED */ |
p->overstep = (int)(vis - maxvis + (*p->width)(p, ' ')); |
vis - maxvis + (*p->width)(p, ' '); |
|
|
|
/* |
/* |
* Behave exactly the same way as groff: |
* Behave exactly the same way as groff: |
Line 302 term_flushln(struct termp *p) |
|
Line 296 term_flushln(struct termp *p) |
|
*/ |
*/ |
if (p->overstep >= -1) { |
if (p->overstep >= -1) { |
assert((int)maxvis + p->overstep >= 0); |
assert((int)maxvis + p->overstep >= 0); |
/* LINTED */ |
maxvis += (size_t)p->overstep; |
maxvis += p->overstep; |
|
} else |
} else |
p->overstep = 0; |
p->overstep = 0; |
|
|
Line 311 term_flushln(struct termp *p) |
|
Line 304 term_flushln(struct termp *p) |
|
return; |
return; |
|
|
/* Right-pad. */ |
/* Right-pad. */ |
if (maxvis > vis + /* LINTED */ |
if (maxvis > vis + |
((TERMP_TWOSPACE & p->flags) ? |
((TERMP_TWOSPACE & p->flags) ? (*p->width)(p, ' ') : 0)) { |
(*p->width)(p, ' ') : 0)) { |
|
p->viscol += maxvis - vis; |
p->viscol += maxvis - vis; |
(*p->advance)(p, maxvis - vis); |
(*p->advance)(p, maxvis - vis); |
vis += (maxvis - vis); |
vis += (maxvis - vis); |
|
|
term_word(struct termp *p, const char *word) |
term_word(struct termp *p, const char *word) |
{ |
{ |
const char *sv, *seq; |
const char *sv, *seq; |
int sz; |
|
size_t ssz; |
size_t ssz; |
enum roffdeco deco; |
enum roffdeco deco; |
|
|
Line 503 term_word(struct termp *p, const char *word) |
|
Line 494 term_word(struct termp *p, const char *word) |
|
|
|
if ( ! (p->flags & TERMP_NONOSPACE)) |
if ( ! (p->flags & TERMP_NONOSPACE)) |
p->flags &= ~TERMP_NOSPACE; |
p->flags &= ~TERMP_NOSPACE; |
|
else |
|
p->flags |= TERMP_NOSPACE; |
|
|
p->flags &= ~TERMP_SENTENCE; |
p->flags &= ~(TERMP_SENTENCE | TERMP_IGNDELIM); |
|
|
while (*word) { |
while (*word) { |
if ((ssz = strcspn(word, "\\")) > 0) |
if ((ssz = strcspn(word, "\\")) > 0) |
Line 515 term_word(struct termp *p, const char *word) |
|
Line 508 term_word(struct termp *p, const char *word) |
|
continue; |
continue; |
|
|
seq = ++word; |
seq = ++word; |
sz = a2roffdeco(&deco, &seq, &ssz); |
word += a2roffdeco(&deco, &seq, &ssz); |
|
|
switch (deco) { |
switch (deco) { |
case (DECO_RESERVED): |
case (DECO_RESERVED): |
Line 542 term_word(struct termp *p, const char *word) |
|
Line 535 term_word(struct termp *p, const char *word) |
|
break; |
break; |
} |
} |
|
|
word += sz; |
|
if (DECO_NOSPACE == deco && '\0' == *word) |
if (DECO_NOSPACE == deco && '\0' == *word) |
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
} |
} |
Line 576 adjbuf(struct termp *p, size_t sz) |
|
Line 568 adjbuf(struct termp *p, size_t sz) |
|
p->buf = realloc(p->buf, p->maxcols); |
p->buf = realloc(p->buf, p->maxcols); |
if (NULL == p->buf) { |
if (NULL == p->buf) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit((int)MANDOCLEVEL_SYSERR); |
} |
} |
} |
} |
|
|
|
|
static void |
static void |
buffera(struct termp *p, const char *word, size_t sz) |
|
{ |
|
|
|
if (p->col + sz >= p->maxcols) |
|
adjbuf(p, p->col + sz); |
|
|
|
memcpy(&p->buf[(int)p->col], word, sz); |
|
p->col += sz; |
|
} |
|
|
|
|
|
static void |
|
bufferc(struct termp *p, char c) |
bufferc(struct termp *p, char c) |
{ |
{ |
|
|
Line 617 encode(struct termp *p, const char *word, size_t sz) |
|
Line 597 encode(struct termp *p, const char *word, size_t sz) |
|
*/ |
*/ |
|
|
if (TERMFONT_NONE == (f = term_fonttop(p))) { |
if (TERMFONT_NONE == (f = term_fonttop(p))) { |
buffera(p, word, sz); |
if (p->col + sz >= p->maxcols) |
|
adjbuf(p, p->col + sz); |
|
memcpy(&p->buf[(int)p->col], word, sz); |
|
p->col += sz; |
return; |
return; |
} |
} |
|
|
|
/* Pre-buffer, assuming worst-case. */ |
|
|
|
if (p->col + 1 + (sz * 3) >= p->maxcols) |
|
adjbuf(p, p->col + 1 + (sz * 3)); |
|
|
for (i = 0; i < (int)sz; i++) { |
for (i = 0; i < (int)sz; i++) { |
if ( ! isgraph((u_char)word[i])) { |
if ( ! isgraph((u_char)word[i])) { |
bufferc(p, word[i]); |
p->buf[(int)p->col++] = word[i]; |
continue; |
continue; |
} |
} |
|
|
if (TERMFONT_UNDER == f) |
if (TERMFONT_UNDER == f) |
bufferc(p, '_'); |
p->buf[(int)p->col++] = '_'; |
else |
else |
bufferc(p, word[i]); |
p->buf[(int)p->col++] = word[i]; |
|
|
bufferc(p, 8); |
p->buf[(int)p->col++] = 8; |
bufferc(p, word[i]); |
p->buf[(int)p->col++] = word[i]; |
} |
} |
} |
} |
|
|
Line 649 term_len(const struct termp *p, size_t sz) |
|
Line 637 term_len(const struct termp *p, size_t sz) |
|
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; |
size_t sz, ssz, rsz, i; |
|
enum roffdeco d; |
|
const char *seq, *rhs; |
|
|
for (sz = 0; *cp; cp++) |
for (sz = 0; '\0' != *cp; ) |
sz += (*p->width)(p, *cp); |
/* |
|
* Account for escaped sequences within string length |
|
* calculations. This follows the logic in term_word() |
|
* as we must calculate the width of produced strings. |
|
*/ |
|
if ('\\' == *cp) { |
|
seq = ++cp; |
|
cp += a2roffdeco(&d, &seq, &ssz); |
|
|
|
switch (d) { |
|
case (DECO_RESERVED): |
|
rhs = chars_res2str |
|
(p->symtab, seq, ssz, &rsz); |
|
break; |
|
case (DECO_SPECIAL): |
|
/* FALLTHROUGH */ |
|
case (DECO_SSPECIAL): |
|
rhs = chars_spec2str |
|
(p->symtab, seq, ssz, &rsz); |
|
|
|
/* Allow for one-char escapes. */ |
|
if (DECO_SSPECIAL != d || rhs) |
|
break; |
|
|
|
rhs = seq; |
|
rsz = ssz; |
|
break; |
|
default: |
|
rhs = NULL; |
|
break; |
|
} |
|
|
|
if (rhs) |
|
for (i = 0; i < rsz; i++) |
|
sz += (*p->width)(p, *rhs++); |
|
} else if (ASCII_NBRSP == *cp) { |
|
sz += (*p->width)(p, ' '); |
|
cp++; |
|
} else if (ASCII_HYPH == *cp) { |
|
sz += (*p->width)(p, '-'); |
|
cp++; |
|
} else |
|
sz += (*p->width)(p, *cp++); |
|
|
return(sz); |
return(sz); |
} |
} |