version 1.9, 2009/02/22 19:23:48 |
version 1.198, 2011/09/18 14:14:15 |
|
|
/* $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, 2011 Ingo Schwarze <schwarze@openbsd.org> |
* |
* |
* Permission to use, copy, modify, and distribute this software for any |
* Permission to use, copy, modify, and distribute this software for any |
* purpose with or without fee is hereby granted, provided that the |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* PERFORMANCE OF THIS SOFTWARE. |
|
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
#include <ctype.h> |
#include <err.h> |
#include <stdint.h> |
#include <stdlib.h> |
|
#include <stdio.h> |
#include <stdio.h> |
|
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <unistd.h> |
|
|
|
#ifdef __linux__ |
#include "mandoc.h" |
#include <time.h> |
#include "out.h" |
#endif |
|
|
|
#include "term.h" |
#include "term.h" |
|
#include "main.h" |
|
|
enum termstyle { |
static void adjbuf(struct termp *p, int); |
STYLE_CLEAR, |
static void bufferc(struct termp *, char); |
STYLE_BOLD, |
static void encode(struct termp *, const char *, size_t); |
STYLE_UNDERLINE |
static void encode1(struct termp *, int); |
}; |
|
|
|
static void termprint_r(struct termp *, |
void |
const struct mdoc_meta *, |
term_free(struct termp *p) |
const struct mdoc_node *); |
{ |
static void termprint_header(struct termp *, |
|
const struct mdoc_meta *); |
|
static void termprint_footer(struct termp *, |
|
const struct mdoc_meta *); |
|
|
|
static void pword(struct termp *, const char *, size_t); |
if (p->buf) |
static void pescape(struct termp *, |
free(p->buf); |
const char *, size_t *, size_t); |
if (p->symtab) |
static void chara(struct termp *, char); |
mchars_free(p->symtab); |
static void style(struct termp *, enum termstyle); |
|
|
|
#ifdef __linux__ |
free(p); |
extern size_t strlcat(char *, const char *, size_t); |
} |
extern size_t strlcpy(char *, const char *, size_t); |
|
#endif |
|
|
|
|
|
void |
void |
flushln(struct termp *p) |
term_begin(struct termp *p, term_margin head, |
|
term_margin foot, const void *arg) |
{ |
{ |
size_t i, j, vsz, vis, maxvis; |
|
|
|
|
p->headf = head; |
|
p->footf = foot; |
|
p->argf = arg; |
|
(*p->begin)(p); |
|
} |
|
|
|
|
|
void |
|
term_end(struct termp *p) |
|
{ |
|
|
|
(*p->end)(p); |
|
} |
|
|
|
/* |
|
* Flush a line of text. A "line" is loosely defined as being something |
|
* that should be followed by a newline, regardless of whether it's |
|
* broken apart by newlines getting there. A line can also be a |
|
* fragment of a columnar list (`Bl -tag' or `Bl -column'), which does |
|
* not have a trailing newline. |
|
* |
|
* The following flags may be specified: |
|
* |
|
* - 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_TWOSPACE: when padding, make sure there are at least two |
|
* space characters of padding. Otherwise, rather break the line. |
|
* |
|
* - TERMP_DANGLE: don't newline when TERMP_NOBREAK is specified and |
|
* the line is overrun, and don't pad-right if it's underrun. |
|
* |
|
* - TERMP_HANG: like TERMP_DANGLE, but doesn't newline when |
|
* overruning, instead save the position and continue at that point |
|
* when the next invocation. |
|
* |
|
* 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. |
|
*/ |
|
void |
|
term_flushln(struct termp *p) |
|
{ |
|
int i; /* current input position in p->buf */ |
|
size_t vis; /* current visual position on output */ |
|
size_t vbl; /* number of blanks to prepend to output */ |
|
size_t vend; /* end of word visual position on output */ |
|
size_t bp; /* visual right border position */ |
|
size_t dv; /* temporary for visual pos calculations */ |
|
int j; /* temporary loop index for p->buf */ |
|
int jhy; /* last hyph before overflow w/r/t j */ |
|
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. |
* This is usually the difference between the right-margin and |
* This is usually the difference between the right-margin and |
* 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); |
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
maxvis = p->rmargin - p->offset; |
|
vis = 0; |
|
|
|
/* |
/* |
* If in the standard case (left-justified), then begin with our |
* Indent the first line of a paragraph. |
* indentation, otherwise (columns, etc.) just start spitting |
|
* out text. |
|
*/ |
*/ |
|
vbl = p->flags & TERMP_NOLPAD ? (size_t)0 : p->offset; |
|
|
if ( ! (p->flags & TERMP_NOLPAD)) |
vis = vend = 0; |
/* LINTED */ |
i = 0; |
for (j = 0; j < p->offset; j++) |
|
putchar(' '); |
|
|
|
/* |
while (i < p->col) { |
* If we're literal, print out verbatim. |
/* |
*/ |
* Handle literal tab characters: collapse all |
if (p->flags & TERMP_LITERAL) { |
* subsequent tabs into a single huge set of spaces. |
/* FIXME: count non-printing chars. */ |
*/ |
for (i = 0; i < p->col; i++) |
while (i < p->col && '\t' == p->buf[i]) { |
putchar(p->buf[i]); |
vend = (vis / p->tabwidth + 1) * p->tabwidth; |
putchar('\n'); |
vbl += vend - vis; |
p->col = 0; |
vis = vend; |
return; |
i++; |
} |
} |
|
|
for (i = 0; i < p->col; i++) { |
|
/* |
/* |
* Count up visible word characters. Control sequences |
* Count up visible word characters. Control sequences |
* (starting with the CSI) aren't counted. |
* (starting with the CSI) aren't counted. A space |
|
* generates a non-printing word, which is valid (the |
|
* space is printed according to regular spacing rules). |
*/ |
*/ |
assert( ! isspace(p->buf[i])); |
|
|
|
/* LINTED */ |
for (j = i, jhy = 0; j < p->col; j++) { |
for (j = i, vsz = 0; j < p->col; j++) { |
if ((j && ' ' == p->buf[j]) || '\t' == p->buf[j]) |
if (isspace(p->buf[j])) |
|
break; |
break; |
else if (27 == p->buf[j]) { |
|
assert(j + 4 <= p->col); |
/* Back over the the last printed character. */ |
j += 3; |
if (8 == p->buf[j]) { |
} else |
assert(j); |
vsz++; |
vend -= (*p->width)(p, p->buf[j - 1]); |
|
continue; |
|
} |
|
|
|
/* Regular word. */ |
|
/* Break at the hyphen point if we overrun. */ |
|
if (vend > vis && vend < bp && |
|
ASCII_HYPH == p->buf[j]) |
|
jhy = j; |
|
|
|
vend += (*p->width)(p, p->buf[j]); |
} |
} |
assert(vsz > 0); |
|
|
|
/* |
/* |
* If a word is too long and we're within a line, put it |
* Find out whether we would exceed the right margin. |
* on the next line. Puke if we're being asked to write |
* If so, break to the next line. |
* something that will exceed the right margin (i.e., |
|
* from a fresh line or when we're not allowed to break |
|
* the line with TERMP_NOBREAK). |
|
*/ |
*/ |
|
if (vend > bp && 0 == jhy && vis > 0) { |
|
vend -= vis; |
|
(*p->endline)(p); |
|
if (TERMP_NOBREAK & p->flags) { |
|
p->viscol = p->rmargin; |
|
(*p->advance)(p, p->rmargin); |
|
vend += p->rmargin - p->offset; |
|
} else { |
|
p->viscol = 0; |
|
vbl = p->offset; |
|
} |
|
|
if (vis && vis + vsz >= maxvis) { |
/* Remove the p->overstep width. */ |
/* FIXME */ |
|
if (p->flags & TERMP_NOBREAK) |
bp += (size_t)p->overstep; |
errx(1, "word breaks right margin"); |
p->overstep = 0; |
putchar('\n'); |
|
for (j = 0; j < p->offset; j++) |
|
putchar(' '); |
|
vis = 0; |
|
} else if (vis + vsz >= maxvis) { |
|
/* FIXME */ |
|
errx(1, "word breaks right margin"); |
|
} |
} |
|
|
/* |
/* Write out the [remaining] word. */ |
* Write out the word and a trailing space. Omit the |
|
* space if we're the last word in the line. |
|
*/ |
|
|
|
for ( ; i < p->col; i++) { |
for ( ; i < p->col; i++) { |
if (isspace(p->buf[i])) |
if (vend > bp && jhy > 0 && i > jhy) |
break; |
break; |
putchar(p->buf[i]); |
if ('\t' == p->buf[i]) |
|
break; |
|
if (' ' == p->buf[i]) { |
|
j = i; |
|
while (' ' == p->buf[i]) |
|
i++; |
|
dv = (size_t)(i - j) * (*p->width)(p, ' '); |
|
vbl += dv; |
|
vend += dv; |
|
break; |
|
} |
|
if (ASCII_NBRSP == p->buf[i]) { |
|
vbl += (*p->width)(p, ' '); |
|
continue; |
|
} |
|
|
|
/* |
|
* Now we definitely know there will be |
|
* printable characters to output, |
|
* so write preceding white space now. |
|
*/ |
|
if (vbl) { |
|
(*p->advance)(p, vbl); |
|
p->viscol += vbl; |
|
vbl = 0; |
|
} |
|
|
|
if (ASCII_HYPH == p->buf[i]) { |
|
(*p->letter)(p, '-'); |
|
p->viscol += (*p->width)(p, '-'); |
|
} else { |
|
(*p->letter)(p, p->buf[i]); |
|
p->viscol += (*p->width)(p, p->buf[i]); |
|
} |
} |
} |
vis += vsz; |
vis = vend; |
if (i < p->col) { |
|
putchar(' '); |
|
vis++; |
|
} |
|
} |
} |
|
|
/* |
/* |
* If we're not to right-marginalise it (newline), then instead |
* If there was trailing white space, it was not printed; |
* pad to the right margin and stay off. |
* so reset the cursor position accordingly. |
*/ |
*/ |
|
vis -= vbl; |
|
|
if (p->flags & TERMP_NOBREAK) { |
|
for ( ; vis <= maxvis; vis++) |
|
putchar(' '); |
|
} else |
|
putchar('\n'); |
|
|
|
p->col = 0; |
p->col = 0; |
|
p->overstep = 0; |
|
|
|
if ( ! (TERMP_NOBREAK & p->flags)) { |
|
p->viscol = 0; |
|
(*p->endline)(p); |
|
return; |
|
} |
|
|
|
if (TERMP_HANG & p->flags) { |
|
/* We need one blank after the tag. */ |
|
p->overstep = (int)(vis - maxvis + (*p->width)(p, ' ')); |
|
|
|
/* |
|
* Behave exactly the same way as groff: |
|
* If we have overstepped the margin, temporarily move |
|
* it to the right and flag the rest of the line to be |
|
* shorter. |
|
* If we landed right at the margin, be happy. |
|
* If we are one step before the margin, temporarily |
|
* move it one step LEFT and flag the rest of the line |
|
* to be longer. |
|
*/ |
|
if (p->overstep >= -1) { |
|
assert((int)maxvis + p->overstep >= 0); |
|
maxvis += (size_t)p->overstep; |
|
} else |
|
p->overstep = 0; |
|
|
|
} else if (TERMP_DANGLE & p->flags) |
|
return; |
|
|
|
/* Right-pad. */ |
|
if (maxvis > vis + |
|
((TERMP_TWOSPACE & p->flags) ? (*p->width)(p, ' ') : 0)) { |
|
p->viscol += maxvis - vis; |
|
(*p->advance)(p, maxvis - vis); |
|
vis += (maxvis - vis); |
|
} else { /* ...or newline break. */ |
|
(*p->endline)(p); |
|
p->viscol = p->rmargin; |
|
(*p->advance)(p, p->rmargin); |
|
} |
} |
} |
|
|
|
|
|
/* |
|
* A newline only breaks an existing line; it won't assert vertical |
|
* space. All data in the output buffer is flushed prior to the newline |
|
* assertion. |
|
*/ |
void |
void |
newln(struct termp *p) |
term_newln(struct termp *p) |
{ |
{ |
|
|
/* |
|
* A newline only breaks an existing line; it won't assert |
|
* vertical space. |
|
*/ |
|
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
if (0 == p->col) |
if (0 == p->col && 0 == p->viscol) { |
|
p->flags &= ~TERMP_NOLPAD; |
return; |
return; |
flushln(p); |
} |
|
term_flushln(p); |
|
p->flags &= ~TERMP_NOLPAD; |
} |
} |
|
|
|
|
|
/* |
|
* Asserts a vertical space (a full, empty line-break between lines). |
|
* Note that if used twice, this will cause two blank spaces and so on. |
|
* All data in the output buffer is flushed prior to the newline |
|
* assertion. |
|
*/ |
void |
void |
vspace(struct termp *p) |
term_vspace(struct termp *p) |
{ |
{ |
|
|
/* |
term_newln(p); |
* Asserts a vertical space (a full, empty line-break between |
p->viscol = 0; |
* lines). |
(*p->endline)(p); |
*/ |
|
newln(p); |
|
putchar('\n'); |
|
} |
} |
|
|
|
void |
static void |
term_fontlast(struct termp *p) |
chara(struct termp *p, char c) |
|
{ |
{ |
|
enum termfont f; |
|
|
/* TODO: dynamically expand the buffer. */ |
f = p->fontl; |
if (p->col + 1 >= p->maxcols) |
p->fontl = p->fontq[p->fonti]; |
errx(1, "line overrun"); |
p->fontq[p->fonti] = f; |
p->buf[(p->col)++] = c; |
|
} |
} |
|
|
|
|
static void |
void |
style(struct termp *p, enum termstyle esc) |
term_fontrepl(struct termp *p, enum termfont f) |
{ |
{ |
|
|
if (p->col + 4 >= p->maxcols) |
p->fontl = p->fontq[p->fonti]; |
errx(1, "line overrun"); |
p->fontq[p->fonti] = f; |
|
|
p->buf[(p->col)++] = 27; |
|
p->buf[(p->col)++] = '['; |
|
switch (esc) { |
|
case (STYLE_CLEAR): |
|
p->buf[(p->col)++] = '0'; |
|
break; |
|
case (STYLE_BOLD): |
|
p->buf[(p->col)++] = '1'; |
|
break; |
|
case (STYLE_UNDERLINE): |
|
p->buf[(p->col)++] = '4'; |
|
break; |
|
default: |
|
abort(); |
|
/* NOTREACHED */ |
|
} |
|
p->buf[(p->col)++] = 'm'; |
|
} |
} |
|
|
|
|
static void |
void |
pescape(struct termp *p, const char *word, size_t *i, size_t len) |
term_fontpush(struct termp *p, enum termfont f) |
{ |
{ |
|
|
(*i)++; |
assert(p->fonti + 1 < 10); |
assert(*i < len); |
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[++p->fonti] = f; |
|
} |
|
|
if ('(' == word[*i]) { |
|
/* Two-character escapes. */ |
|
(*i)++; |
|
assert(*i + 1 < len); |
|
|
|
if ('r' == word[*i] && 'B' == word[*i + 1]) |
const void * |
chara(p, ']'); |
term_fontq(struct termp *p) |
else if ('l' == word[*i] && 'B' == word[*i + 1]) |
{ |
chara(p, '['); |
|
|
|
(*i)++; |
return(&p->fontq[p->fonti]); |
return; |
|
|
|
} else if ('[' != word[*i]) { |
|
/* One-character escapes. */ |
|
switch (word[*i]) { |
|
case ('\\'): |
|
/* FALLTHROUGH */ |
|
case ('\''): |
|
/* FALLTHROUGH */ |
|
case ('`'): |
|
/* FALLTHROUGH */ |
|
case ('-'): |
|
/* FALLTHROUGH */ |
|
case ('.'): |
|
chara(p, word[*i]); |
|
default: |
|
break; |
|
} |
|
return; |
|
} |
|
/* n-character escapes. */ |
|
} |
} |
|
|
|
|
static void |
enum termfont |
pword(struct termp *p, const char *word, size_t len) |
term_fonttop(struct termp *p) |
{ |
{ |
size_t i; |
|
|
|
/*assert(len > 0);*/ /* Can be, if literal. */ |
return(p->fontq[p->fonti]); |
|
} |
|
|
if ( ! (p->flags & TERMP_NOSPACE) && |
|
! (p->flags & TERMP_LITERAL)) |
|
chara(p, ' '); |
|
|
|
p->flags &= ~TERMP_NOSPACE; |
void |
|
term_fontpopq(struct termp *p, const void *key) |
|
{ |
|
|
if (p->flags & TERMP_BOLD) |
while (p->fonti >= 0 && key != &p->fontq[p->fonti]) |
style(p, STYLE_BOLD); |
p->fonti--; |
if (p->flags & TERMP_UNDERLINE) |
assert(p->fonti >= 0); |
style(p, STYLE_UNDERLINE); |
} |
|
|
for (i = 0; i < len; i++) { |
|
if ('\\' == word[i]) { |
|
pescape(p, word, &i, len); |
|
continue; |
|
} |
|
chara(p, word[i]); |
|
} |
|
|
|
if (p->flags & TERMP_BOLD || |
void |
p->flags & TERMP_UNDERLINE) |
term_fontpop(struct termp *p) |
style(p, STYLE_CLEAR); |
{ |
|
|
|
assert(p->fonti); |
|
p->fonti--; |
} |
} |
|
|
|
/* |
|
* Handle pwords, partial words, which may be either a single word or a |
|
* phrase that cannot be broken down (such as a literal string). This |
|
* handles word styling. |
|
*/ |
void |
void |
word(struct termp *p, const char *word) |
term_word(struct termp *p, const char *word) |
{ |
{ |
size_t i, j, len; |
const char *seq, *cp; |
|
char c; |
|
int sz, uc; |
|
size_t ssz; |
|
enum mandoc_esc esc; |
|
|
if (p->flags & TERMP_LITERAL) { |
if ( ! (TERMP_NOSPACE & p->flags)) { |
pword(p, word, strlen(word)); |
if ( ! (TERMP_KEEP & p->flags)) { |
return; |
if (TERMP_PREKEEP & p->flags) |
|
p->flags |= TERMP_KEEP; |
|
bufferc(p, ' '); |
|
if (TERMP_SENTENCE & p->flags) |
|
bufferc(p, ' '); |
|
} else |
|
bufferc(p, ASCII_NBRSP); |
} |
} |
|
|
len = strlen(word); |
if ( ! (p->flags & TERMP_NONOSPACE)) |
assert(len > 0); |
p->flags &= ~TERMP_NOSPACE; |
|
else |
|
p->flags |= TERMP_NOSPACE; |
|
|
if (mdoc_isdelim(word)) { |
p->flags &= ~(TERMP_SENTENCE | TERMP_IGNDELIM); |
if ( ! (p->flags & TERMP_IGNDELIM)) |
|
p->flags |= TERMP_NOSPACE; |
|
p->flags &= ~TERMP_IGNDELIM; |
|
} |
|
|
|
/* LINTED */ |
while ('\0' != *word) { |
for (j = i = 0; i < len; i++) { |
if ((ssz = strcspn(word, "\\")) > 0) |
if ( ! isspace(word[i])) { |
encode(p, word, ssz); |
j++; |
|
|
word += (int)ssz; |
|
if ('\\' != *word) |
continue; |
continue; |
|
|
|
word++; |
|
esc = mandoc_escape(&word, &seq, &sz); |
|
if (ESCAPE_ERROR == esc) |
|
break; |
|
|
|
if (TERMENC_ASCII != p->enc) |
|
switch (esc) { |
|
case (ESCAPE_UNICODE): |
|
uc = mchars_num2uc(seq + 1, sz - 1); |
|
if ('\0' == uc) |
|
break; |
|
encode1(p, uc); |
|
continue; |
|
case (ESCAPE_SPECIAL): |
|
uc = mchars_spec2cp(p->symtab, seq, sz); |
|
if (uc <= 0) |
|
break; |
|
encode1(p, uc); |
|
continue; |
|
default: |
|
break; |
|
} |
|
|
|
switch (esc) { |
|
case (ESCAPE_UNICODE): |
|
encode1(p, '?'); |
|
break; |
|
case (ESCAPE_NUMBERED): |
|
c = mchars_num2char(seq, sz); |
|
if ('\0' != c) |
|
encode(p, &c, 1); |
|
break; |
|
case (ESCAPE_SPECIAL): |
|
cp = mchars_spec2str(p->symtab, seq, sz, &ssz); |
|
if (NULL != cp) |
|
encode(p, cp, ssz); |
|
else if (1 == ssz) |
|
encode(p, seq, sz); |
|
break; |
|
case (ESCAPE_FONTBOLD): |
|
term_fontrepl(p, TERMFONT_BOLD); |
|
break; |
|
case (ESCAPE_FONTITALIC): |
|
term_fontrepl(p, TERMFONT_UNDER); |
|
break; |
|
case (ESCAPE_FONT): |
|
/* FALLTHROUGH */ |
|
case (ESCAPE_FONTROMAN): |
|
term_fontrepl(p, TERMFONT_NONE); |
|
break; |
|
case (ESCAPE_FONTPREV): |
|
term_fontlast(p); |
|
break; |
|
case (ESCAPE_NOSPACE): |
|
if ('\0' == *word) |
|
p->flags |= TERMP_NOSPACE; |
|
break; |
|
default: |
|
break; |
} |
} |
if (0 == j) |
|
continue; |
|
assert(i >= j); |
|
pword(p, &word[i - j], j); |
|
j = 0; |
|
} |
} |
if (j > 0) { |
|
assert(i >= j); |
|
pword(p, &word[i - j], j); |
|
} |
|
} |
} |
|
|
|
|
static void |
static void |
termprint_r(struct termp *p, const struct mdoc_meta *meta, |
adjbuf(struct termp *p, int sz) |
const struct mdoc_node *node) |
|
{ |
{ |
int dochild; |
|
|
|
/* Pre-processing. */ |
if (0 == p->maxcols) |
|
p->maxcols = 1024; |
|
while (sz >= p->maxcols) |
|
p->maxcols <<= 2; |
|
|
dochild = 1; |
p->buf = mandoc_realloc |
|
(p->buf, sizeof(int) * (size_t)p->maxcols); |
|
} |
|
|
if (MDOC_TEXT != node->type) { |
static void |
if (termacts[node->tok].pre) |
bufferc(struct termp *p, char c) |
if ( ! (*termacts[node->tok].pre)(p, meta, node)) |
{ |
dochild = 0; |
|
} else /* MDOC_TEXT == node->type */ |
|
word(p, node->data.text.string); |
|
|
|
/* Children. */ |
if (p->col + 1 >= p->maxcols) |
|
adjbuf(p, p->col + 1); |
|
|
if (dochild && node->child) |
p->buf[p->col++] = c; |
termprint_r(p, meta, node->child); |
} |
|
|
/* Post-processing. */ |
/* |
|
* See encode(). |
|
* Do this for a single (probably unicode) value. |
|
* Does not check for non-decorated glyphs. |
|
*/ |
|
static void |
|
encode1(struct termp *p, int c) |
|
{ |
|
enum termfont f; |
|
|
if (MDOC_TEXT != node->type) |
if (p->col + 4 >= p->maxcols) |
if (termacts[node->tok].post) |
adjbuf(p, p->col + 4); |
(*termacts[node->tok].post)(p, meta, node); |
|
|
|
/* Siblings. */ |
f = term_fonttop(p); |
|
|
if (node->next) |
if (TERMFONT_NONE == f) { |
termprint_r(p, meta, node->next); |
p->buf[p->col++] = c; |
|
return; |
|
} else if (TERMFONT_UNDER == f) { |
|
p->buf[p->col++] = '_'; |
|
} else |
|
p->buf[p->col++] = c; |
|
|
|
p->buf[p->col++] = 8; |
|
p->buf[p->col++] = c; |
} |
} |
|
|
|
|
static void |
static void |
termprint_footer(struct termp *p, const struct mdoc_meta *meta) |
encode(struct termp *p, const char *word, size_t sz) |
{ |
{ |
struct tm *tm; |
enum termfont f; |
char *buf, *os; |
int i, len; |
size_t sz, osz, ssz, i; |
|
|
|
if (NULL == (buf = malloc(p->rmargin))) |
/* LINTED */ |
err(1, "malloc"); |
len = sz; |
if (NULL == (os = malloc(p->rmargin))) |
|
err(1, "malloc"); |
|
|
|
tm = localtime(&meta->date); |
/* |
|
* Encode and buffer a string of characters. If the current |
|
* font mode is unset, buffer directly, else encode then buffer |
|
* character by character. |
|
*/ |
|
|
#ifdef __linux__ |
if (TERMFONT_NONE == (f = term_fonttop(p))) { |
if (0 == strftime(buf, p->rmargin, "%B %d, %Y", tm)) |
if (p->col + len >= p->maxcols) |
#else |
adjbuf(p, p->col + len); |
if (NULL == strftime(buf, p->rmargin, "%B %d, %Y", tm)) |
for (i = 0; i < len; i++) |
#endif |
p->buf[p->col++] = word[i]; |
err(1, "strftime"); |
return; |
|
} |
|
|
osz = strlcpy(os, meta->os, p->rmargin); |
/* Pre-buffer, assuming worst-case. */ |
|
|
sz = strlen(buf); |
if (p->col + 1 + (len * 3) >= p->maxcols) |
ssz = sz + osz + 1; |
adjbuf(p, p->col + 1 + (len * 3)); |
|
|
if (ssz > p->rmargin) { |
for (i = 0; i < len; i++) { |
ssz -= p->rmargin; |
if ( ! isgraph((unsigned char)word[i])) { |
assert(ssz <= osz); |
p->buf[p->col++] = word[i]; |
os[osz - ssz] = 0; |
continue; |
ssz = 1; |
} |
} else |
|
ssz = p->rmargin - ssz + 1; |
|
|
|
printf("\n"); |
if (TERMFONT_UNDER == f) |
printf("%s", os); |
p->buf[p->col++] = '_'; |
for (i = 0; i < ssz; i++) |
else |
printf(" "); |
p->buf[p->col++] = word[i]; |
|
|
printf("%s\n", buf); |
p->buf[p->col++] = 8; |
fflush(stdout); |
p->buf[p->col++] = word[i]; |
|
} |
free(buf); |
|
free(os); |
|
} |
} |
|
|
|
size_t |
static void |
term_len(const struct termp *p, size_t sz) |
termprint_header(struct termp *p, const struct mdoc_meta *meta) |
|
{ |
{ |
char *buf, *title; |
|
const char *pp, *msec; |
|
size_t ssz, tsz, ttsz, i;; |
|
|
|
if (NULL == (buf = malloc(p->rmargin))) |
return((*p->width)(p, ' ') * sz); |
err(1, "malloc"); |
} |
if (NULL == (title = malloc(p->rmargin))) |
|
err(1, "malloc"); |
|
|
|
if (NULL == (pp = mdoc_vol2a(meta->vol))) |
|
switch (meta->msec) { |
|
case (MSEC_1): |
|
/* FALLTHROUGH */ |
|
case (MSEC_6): |
|
/* FALLTHROUGH */ |
|
case (MSEC_7): |
|
pp = mdoc_vol2a(VOL_URM); |
|
break; |
|
case (MSEC_8): |
|
pp = mdoc_vol2a(VOL_SMM); |
|
break; |
|
case (MSEC_2): |
|
/* FALLTHROUGH */ |
|
case (MSEC_3): |
|
/* FALLTHROUGH */ |
|
case (MSEC_4): |
|
/* FALLTHROUGH */ |
|
case (MSEC_5): |
|
pp = mdoc_vol2a(VOL_PRM); |
|
break; |
|
case (MSEC_9): |
|
pp = mdoc_vol2a(VOL_KM); |
|
break; |
|
default: |
|
/* FIXME: capitalise. */ |
|
if (NULL == (pp = mdoc_msec2a(meta->msec))) |
|
pp = mdoc_msec2a(MSEC_local); |
|
break; |
|
} |
|
assert(pp); |
|
|
|
tsz = strlcpy(buf, pp, p->rmargin); |
size_t |
assert(tsz < p->rmargin); |
term_strlen(const struct termp *p, const char *cp) |
|
{ |
|
size_t sz, rsz, i; |
|
int ssz, c; |
|
const char *seq, *rhs; |
|
enum mandoc_esc esc; |
|
static const char rej[] = { '\\', ASCII_HYPH, ASCII_NBRSP, '\0' }; |
|
|
if ((pp = mdoc_arch2a(meta->arch))) { |
/* |
tsz = strlcat(buf, " (", p->rmargin); |
* Account for escaped sequences within string length |
assert(tsz < p->rmargin); |
* calculations. This follows the logic in term_word() as we |
tsz = strlcat(buf, pp, p->rmargin); |
* must calculate the width of produced strings. |
assert(tsz < p->rmargin); |
*/ |
tsz = strlcat(buf, ")", p->rmargin); |
|
assert(tsz < p->rmargin); |
|
} |
|
|
|
ttsz = strlcpy(title, meta->title, p->rmargin); |
sz = 0; |
|
while ('\0' != *cp) { |
|
rsz = strcspn(cp, rej); |
|
for (i = 0; i < rsz; i++) |
|
sz += (*p->width)(p, *cp++); |
|
|
if (NULL == (msec = mdoc_msec2a(meta->msec))) |
c = 0; |
msec = ""; |
switch (*cp) { |
|
case ('\\'): |
|
cp++; |
|
esc = mandoc_escape(&cp, &seq, &ssz); |
|
if (ESCAPE_ERROR == esc) |
|
return(sz); |
|
|
ssz = (2 * (ttsz + 2 + strlen(msec))) + tsz + 2; |
if (TERMENC_ASCII != p->enc) |
|
switch (esc) { |
|
case (ESCAPE_UNICODE): |
|
c = mchars_num2uc |
|
(seq + 1, ssz - 1); |
|
if ('\0' == c) |
|
break; |
|
sz += (*p->width)(p, c); |
|
continue; |
|
case (ESCAPE_SPECIAL): |
|
c = mchars_spec2cp |
|
(p->symtab, seq, ssz); |
|
if (c <= 0) |
|
break; |
|
sz += (*p->width)(p, c); |
|
continue; |
|
default: |
|
break; |
|
} |
|
|
if (ssz > p->rmargin) { |
rhs = NULL; |
if ((ssz -= p->rmargin) % 2) |
|
ssz++; |
|
ssz /= 2; |
|
|
|
assert(ssz <= ttsz); |
|
title[ttsz - ssz] = 0; |
|
ssz = 1; |
|
} else |
|
ssz = ((p->rmargin - ssz) / 2) + 1; |
|
|
|
printf("%s(%s)", title, msec); |
switch (esc) { |
|
case (ESCAPE_UNICODE): |
|
sz += (*p->width)(p, '?'); |
|
break; |
|
case (ESCAPE_NUMBERED): |
|
c = mchars_num2char(seq, ssz); |
|
if ('\0' != c) |
|
sz += (*p->width)(p, c); |
|
break; |
|
case (ESCAPE_SPECIAL): |
|
rhs = mchars_spec2str |
|
(p->symtab, seq, ssz, &rsz); |
|
|
for (i = 0; i < ssz; i++) |
if (ssz != 1 || rhs) |
printf(" "); |
break; |
|
|
printf("%s", buf); |
rhs = seq; |
|
rsz = ssz; |
|
break; |
|
default: |
|
break; |
|
} |
|
|
for (i = 0; i < ssz; i++) |
if (NULL == rhs) |
printf(" "); |
break; |
|
|
printf("%s(%s)\n", title, msec); |
for (i = 0; i < rsz; i++) |
fflush(stdout); |
sz += (*p->width)(p, *rhs++); |
|
break; |
|
case (ASCII_NBRSP): |
|
sz += (*p->width)(p, ' '); |
|
cp++; |
|
break; |
|
case (ASCII_HYPH): |
|
sz += (*p->width)(p, '-'); |
|
cp++; |
|
break; |
|
default: |
|
break; |
|
} |
|
} |
|
|
free(title); |
return(sz); |
free(buf); |
|
} |
} |
|
|
|
/* ARGSUSED */ |
void |
size_t |
termprint(const struct mdoc_node *node, |
term_vspan(const struct termp *p, const struct roffsu *su) |
const struct mdoc_meta *meta) |
|
{ |
{ |
struct termp p; |
double r; |
|
|
p.maxrmargin = 80; /* XXX */ |
switch (su->unit) { |
p.rmargin = p.maxrmargin; |
case (SCALE_CM): |
p.maxcols = 1024; |
r = su->scale * 2; |
p.offset = p.col = 0; |
break; |
p.flags = TERMP_NOSPACE; |
case (SCALE_IN): |
|
r = su->scale * 6; |
|
break; |
|
case (SCALE_PC): |
|
r = su->scale; |
|
break; |
|
case (SCALE_PT): |
|
r = su->scale / 8; |
|
break; |
|
case (SCALE_MM): |
|
r = su->scale / 1000; |
|
break; |
|
case (SCALE_VS): |
|
r = su->scale; |
|
break; |
|
default: |
|
r = su->scale - 1; |
|
break; |
|
} |
|
|
if (NULL == (p.buf = malloc(p.maxcols))) |
if (r < 0.0) |
err(1, "malloc"); |
r = 0.0; |
|
return(/* LINTED */(size_t) |
termprint_header(&p, meta); |
r); |
termprint_r(&p, meta, node); |
|
termprint_footer(&p, meta); |
|
|
|
free(p.buf); |
|
} |
} |
|
|
|
size_t |
|
term_hspan(const struct termp *p, const struct roffsu *su) |
|
{ |
|
double v; |
|
|
|
v = ((*p->hspan)(p, su)); |
|
if (v < 0.0) |
|
v = 0.0; |
|
return((size_t) /* LINTED */ |
|
v); |
|
} |