version 1.93, 2009/07/24 11:54:25 |
version 1.157, 2010/07/02 10:50:50 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@bsd.lv> |
* |
* |
* 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 |
|
|
* 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. |
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
|
#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 "chars.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 void spec(struct termp *, const char *, size_t); |
const struct man *); |
static void res(struct termp *, const char *, size_t); |
extern int mdoc_run(struct termp *, |
static void buffera(struct termp *, const char *, size_t); |
const struct mdoc *); |
static void bufferc(struct termp *, char); |
|
static void adjbuf(struct termp *p, size_t); |
|
static void encode(struct termp *, const char *, size_t); |
|
|
static struct termp *term_alloc(enum termenc); |
|
static void term_free(struct termp *); |
|
static void term_pescape(struct termp *, const char **); |
|
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 *); |
|
static int term_isclosedelim(const char *); |
|
|
|
|
|
void * |
|
ascii_alloc(void) |
|
{ |
|
|
|
return(term_alloc(TERMENC_ASCII)); |
|
} |
|
|
|
|
|
int |
|
terminal_man(void *arg, const struct man *man) |
|
{ |
|
struct termp *p; |
|
|
|
p = (struct termp *)arg; |
|
if (NULL == p->symtab) |
|
p->symtab = term_ascii2htab(); |
|
|
|
return(man_run(p, man)); |
|
} |
|
|
|
|
|
int |
|
terminal_mdoc(void *arg, const struct mdoc *mdoc) |
|
{ |
|
struct termp *p; |
|
|
|
p = (struct termp *)arg; |
|
if (NULL == p->symtab) |
|
p->symtab = term_ascii2htab(); |
|
|
|
return(mdoc_run(p, mdoc)); |
|
} |
|
|
|
|
|
void |
void |
terminal_free(void *arg) |
|
{ |
|
|
|
term_free((struct termp *)arg); |
|
} |
|
|
|
|
|
static void |
|
term_free(struct termp *p) |
term_free(struct termp *p) |
{ |
{ |
|
|
if (p->buf) |
if (p->buf) |
free(p->buf); |
free(p->buf); |
if (TERMENC_ASCII == p->enc && p->symtab) |
if (p->symtab) |
term_asciifree(p->symtab); |
chars_free(p->symtab); |
|
|
free(p); |
free(p); |
} |
} |
|
|
|
|
static struct termp * |
void |
term_alloc(enum termenc enc) |
term_begin(struct termp *p, term_margin head, |
|
term_margin foot, const void *arg) |
{ |
{ |
struct termp *p; |
|
|
|
if (NULL == (p = malloc(sizeof(struct termp)))) |
p->headf = head; |
err(1, "malloc"); |
p->footf = foot; |
bzero(p, sizeof(struct termp)); |
p->argf = arg; |
p->maxrmargin = 78; |
(*p->begin)(p); |
p->enc = enc; |
|
return(p); |
|
} |
} |
|
|
|
|
static int |
void |
term_isclosedelim(const char *p) |
term_end(struct termp *p) |
{ |
{ |
|
|
if ( ! (*p && 0 == *(p + 1))) |
(*p->end)(p); |
return(0); |
|
|
|
switch (*p) { |
|
case('.'): |
|
/* FALLTHROUGH */ |
|
case(','): |
|
/* FALLTHROUGH */ |
|
case(';'): |
|
/* FALLTHROUGH */ |
|
case(':'): |
|
/* FALLTHROUGH */ |
|
case('?'): |
|
/* FALLTHROUGH */ |
|
case('!'): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
/* FALLTHROUGH */ |
|
case('}'): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
|
|
return(0); |
|
} |
} |
|
|
|
|
static int |
struct termp * |
term_isopendelim(const char *p) |
term_alloc(enum termenc enc) |
{ |
{ |
|
struct termp *p; |
|
|
if ( ! (*p && 0 == *(p + 1))) |
p = calloc(1, sizeof(struct termp)); |
return(0); |
if (NULL == p) { |
|
perror(NULL); |
switch (*p) { |
exit(EXIT_FAILURE); |
case('('): |
|
/* FALLTHROUGH */ |
|
case('['): |
|
/* FALLTHROUGH */ |
|
case('{'): |
|
return(1); |
|
default: |
|
break; |
|
} |
} |
|
|
return(0); |
p->enc = enc; |
|
return(p); |
} |
} |
|
|
|
|
Line 169 term_isopendelim(const char *p) |
|
Line 94 term_isopendelim(const char *p) |
|
* Flush a line of text. A "line" is loosely defined as being something |
* 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 |
* that should be followed by a newline, regardless of whether it's |
* broken apart by newlines getting there. A line can also be a |
* broken apart by newlines getting there. A line can also be a |
* fragment of a columnar list. |
* fragment of a columnar list (`Bl -tag' or `Bl -column'), which does |
|
* not have a trailing newline. |
* |
* |
* Specifically, a line is whatever's in p->buf of length p->col, which |
* The following flags may be specified: |
* is zeroed after this function returns. |
|
* |
* |
* The usage of termp:flags is as follows: |
|
* |
|
* - TERMP_NOLPAD: when beginning to write the line, don't left-pad the |
* - TERMP_NOLPAD: when beginning to write the line, don't left-pad the |
* offset value. This is useful when doing columnar lists where the |
* offset value. This is useful when doing columnar lists where the |
* prior column has right-padded. |
* prior column has right-padded. |
Line 199 term_isopendelim(const char *p) |
|
Line 122 term_isopendelim(const char *p) |
|
* If TERMP_NOBREAK is specified and the line overruns the right |
* If TERMP_NOBREAK is specified and the line overruns the right |
* margin, it will break and pad-right to the right margin after |
* margin, it will break and pad-right to the right margin after |
* writing. If maxrmargin is violated, it will break and continue |
* writing. If maxrmargin is violated, it will break and continue |
* writing from the right-margin, which will lead to the above |
* writing from the right-margin, which will lead to the above scenario |
* scenario upon exit. |
* upon exit. Otherwise, the line will break at the right margin. |
* |
|
* Otherwise, the line will break at the right margin. Extremely long |
|
* lines will cause the system to emit a warning (TODO: hyphenate, if |
|
* possible). |
|
* |
|
* FIXME: newline breaks occur (in groff) also occur when a single |
|
* space follows a NOBREAK (try `Bl -tag') |
|
* |
|
* FIXME: there's a newline error where a `Bl -diag' will have a |
|
* trailing newline if the line is exactly 73 chars long. |
|
*/ |
*/ |
void |
void |
term_flushln(struct termp *p) |
term_flushln(struct termp *p) |
{ |
{ |
int i, j; |
int i; /* current input position in p->buf */ |
size_t vbl, vsz, vis, maxvis, mmax, bp; |
size_t vis; /* current visual position on output */ |
static int overstep = 0; |
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 */ |
|
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->offset < p->rmargin); |
assert(p->offset < p->rmargin); |
assert((int)(p->rmargin - p->offset) - overstep > 0); |
|
|
|
maxvis = /* LINTED */ |
maxvis = (int)(p->rmargin - p->offset) - p->overstep < 0 ? |
p->rmargin - p->offset - overstep; |
/* LINTED */ |
mmax = /* LINTED */ |
0 : p->rmargin - p->offset - p->overstep; |
p->maxrmargin - p->offset - 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; |
vis = 0; |
|
overstep = 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 ? 0 : p->offset; |
|
|
if ( ! (p->flags & TERMP_NOLPAD)) |
vis = vend = i = 0; |
/* LINTED */ |
|
for (j = 0; j < (int)p->offset; j++) |
|
putchar(' '); |
|
|
|
for (i = 0; i < (int)p->col; i++) { |
while (i < (int)p->col) { |
/* |
/* |
|
* Handle literal tab characters: collapse all |
|
* subsequent tabs into a single huge set of spaces. |
|
*/ |
|
for (j = i; j < (int)p->col; j++) { |
|
if ('\t' != p->buf[j]) |
|
break; |
|
vend = (vis / p->tabwidth + 1) * p->tabwidth; |
|
vbl += vend - vis; |
|
vis = vend; |
|
} |
|
|
|
/* |
* Count up visible word characters. Control sequences |
* Count up visible word characters. Control sequences |
* (starting with the CSI) aren't counted. A space |
* (starting with the CSI) aren't counted. A space |
* generates a non-printing word, which is valid (the |
* generates a non-printing word, which is valid (the |
Line 258 term_flushln(struct termp *p) |
|
Line 184 term_flushln(struct termp *p) |
|
*/ |
*/ |
|
|
/* LINTED */ |
/* LINTED */ |
for (j = i, vsz = 0; j < (int)p->col; j++) { |
for (jhy = 0; j < (int)p->col; j++) { |
if (j && ' ' == p->buf[j]) |
if ((j && ' ' == p->buf[j]) || '\t' == p->buf[j]) |
break; |
break; |
else if (8 == p->buf[j]) |
|
vsz--; |
/* Back over the the last printed character. */ |
else |
if (8 == p->buf[j]) { |
vsz++; |
assert(j); |
|
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]); |
} |
} |
|
|
/* |
/* |
* Choose the number of blanks to prepend: no blank at the |
|
* beginning of a line, one between words -- but do not |
|
* actually write them yet. |
|
*/ |
|
vbl = (size_t)(0 == vis ? 0 : 1); |
|
|
|
/* |
|
* 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. (TODO: hyphenate) |
* If so, break to the next line. |
* Otherwise, write the chosen number of blanks now. |
|
*/ |
*/ |
if (vis && vis + vbl + vsz > bp) { |
if (vend > bp && 0 == jhy && vis > 0) { |
putchar('\n'); |
vend -= vis; |
|
(*p->endline)(p); |
if (TERMP_NOBREAK & p->flags) { |
if (TERMP_NOBREAK & p->flags) { |
for (j = 0; j < (int)p->rmargin; j++) |
p->viscol = p->rmargin; |
putchar(' '); |
(*p->advance)(p, p->rmargin); |
vis = p->rmargin - p->offset; |
vend += p->rmargin - p->offset; |
} else { |
} else { |
for (j = 0; j < (int)p->offset; j++) |
p->viscol = 0; |
putchar(' '); |
vbl = p->offset; |
vis = 0; |
|
} |
} |
} else { |
|
for (j = 0; j < (int)vbl; j++) |
/* Remove the p->overstep width. */ |
putchar(' '); |
|
vis += vbl; |
bp += (int)/* LINTED */ |
|
p->overstep; |
|
p->overstep = 0; |
} |
} |
|
|
/* |
/* |
* Finally, write out the word. |
* Skip leading tabs, they were handled above. |
*/ |
*/ |
|
while (i < (int)p->col && '\t' == p->buf[i]) |
|
i++; |
|
|
|
/* Write out the [remaining] word. */ |
for ( ; i < (int)p->col; i++) { |
for ( ; i < (int)p->col; i++) { |
if (' ' == 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]) { |
|
while (' ' == p->buf[i]) { |
|
vbl += (*p->width)(p, p->buf[i]); |
|
i++; |
|
} |
|
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; |
vend += vbl; |
|
vis = vend; |
} |
} |
|
|
p->col = 0; |
p->col = 0; |
|
p->overstep = 0; |
|
|
if ( ! (TERMP_NOBREAK & p->flags)) { |
if ( ! (TERMP_NOBREAK & p->flags)) { |
putchar('\n'); |
p->viscol = 0; |
|
(*p->endline)(p); |
return; |
return; |
} |
} |
|
|
if (TERMP_HANG & p->flags) { |
if (TERMP_HANG & p->flags) { |
/* We need one blank after the tag. */ |
/* We need one blank after the tag. */ |
overstep = /* LINTED */ |
p->overstep = /* LINTED */ |
vis - maxvis + 1; |
vis - maxvis + (*p->width)(p, ' '); |
|
|
/* |
/* |
* Behave exactly the same way as groff: |
* Behave exactly the same way as groff: |
Line 328 term_flushln(struct termp *p) |
|
Line 298 term_flushln(struct termp *p) |
|
* move it one step LEFT and flag the rest of the line |
* move it one step LEFT and flag the rest of the line |
* to be longer. |
* to be longer. |
*/ |
*/ |
if (overstep >= -1) { |
if (p->overstep >= -1) { |
assert((int)maxvis + overstep >= 0); |
assert((int)maxvis + p->overstep >= 0); |
/* LINTED */ |
/* LINTED */ |
maxvis += overstep; |
maxvis += p->overstep; |
} else |
} else |
overstep = 0; |
p->overstep = 0; |
|
|
} else if (TERMP_DANGLE & p->flags) |
} else if (TERMP_DANGLE & p->flags) |
return; |
return; |
|
|
/* Right-pad. */ |
/* Right-pad. */ |
if (maxvis > vis + /* LINTED */ |
if (maxvis > vis + /* LINTED */ |
((TERMP_TWOSPACE & p->flags) ? 1 : 0)) |
((TERMP_TWOSPACE & p->flags) ? |
for ( ; vis < maxvis; vis++) |
(*p->width)(p, ' ') : 0)) { |
putchar(' '); |
p->viscol += maxvis - vis; |
else { /* ...or newline break. */ |
(*p->advance)(p, maxvis - vis); |
putchar('\n'); |
vis += (maxvis - vis); |
for (i = 0; i < (int)p->rmargin; i++) |
} else { /* ...or newline break. */ |
putchar(' '); |
(*p->endline)(p); |
|
p->viscol = p->rmargin; |
|
(*p->advance)(p, p->rmargin); |
} |
} |
} |
} |
|
|
Line 361 term_newln(struct termp *p) |
|
Line 333 term_newln(struct termp *p) |
|
{ |
{ |
|
|
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
if (0 == p->col) { |
if (0 == p->col && 0 == p->viscol) { |
p->flags &= ~TERMP_NOLPAD; |
p->flags &= ~TERMP_NOLPAD; |
return; |
return; |
} |
} |
Line 381 term_vspace(struct termp *p) |
|
Line 353 term_vspace(struct termp *p) |
|
{ |
{ |
|
|
term_newln(p); |
term_newln(p); |
putchar('\n'); |
p->viscol = 0; |
|
(*p->endline)(p); |
} |
} |
|
|
|
|
/* |
|
* 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) |
spec(struct termp *p, const char *word, size_t len) |
{ |
{ |
const char *rhs; |
const char *rhs; |
size_t sz; |
size_t sz; |
int i; |
|
|
|
rhs = term_a2ascii(p->symtab, word, len, &sz); |
rhs = chars_a2ascii(p->symtab, word, len, &sz); |
|
if (rhs) |
|
encode(p, rhs, sz); |
|
} |
|
|
|
|
|
static void |
|
res(struct termp *p, const char *word, size_t len) |
|
{ |
|
const char *rhs; |
|
size_t sz; |
|
|
|
rhs = chars_a2res(p->symtab, word, len, &sz); |
if (rhs) |
if (rhs) |
for (i = 0; i < (int)sz; i++) |
encode(p, rhs, sz); |
term_encodea(p, rhs[i]); |
|
} |
} |
|
|
|
|
|
void |
|
term_fontlast(struct termp *p) |
|
{ |
|
enum termfont f; |
|
|
|
f = p->fontl; |
|
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[p->fonti] = f; |
|
} |
|
|
|
|
|
void |
|
term_fontrepl(struct termp *p, enum termfont f) |
|
{ |
|
|
|
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[p->fonti] = f; |
|
} |
|
|
|
|
|
void |
|
term_fontpush(struct termp *p, enum termfont f) |
|
{ |
|
|
|
assert(p->fonti + 1 < 10); |
|
p->fontl = p->fontq[p->fonti]; |
|
p->fontq[++p->fonti] = f; |
|
} |
|
|
|
|
|
const void * |
|
term_fontq(struct termp *p) |
|
{ |
|
|
|
return(&p->fontq[p->fonti]); |
|
} |
|
|
|
|
|
enum termfont |
|
term_fonttop(struct termp *p) |
|
{ |
|
|
|
return(p->fontq[p->fonti]); |
|
} |
|
|
|
|
|
void |
|
term_fontpopq(struct termp *p, const void *key) |
|
{ |
|
|
|
while (p->fonti >= 0 && key != &p->fontq[p->fonti]) |
|
p->fonti--; |
|
assert(p->fonti >= 0); |
|
} |
|
|
|
|
|
void |
|
term_fontpop(struct termp *p) |
|
{ |
|
|
|
assert(p->fonti); |
|
p->fonti--; |
|
} |
|
|
|
|
/* |
/* |
* Handle an escape sequence: determine its length and pass it to the |
* Handle pwords, partial words, which may be either a single word or a |
* escape-symbol look table. Note that we assume mdoc(3) has validated |
* phrase that cannot be broken down (such as a literal string). This |
* the escape sequence (we assert upon badly-formed escape sequences). |
* handles word styling. |
*/ |
*/ |
static void |
void |
term_pescape(struct termp *p, const char **word) |
term_word(struct termp *p, const char *word) |
{ |
{ |
int j; |
const char *sv, *seq; |
const char *wp; |
int sz; |
|
size_t ssz; |
|
enum roffdeco deco; |
|
|
wp = *word; |
sv = word; |
|
|
if (0 == *(++wp)) { |
if (word[0] && '\0' == word[1]) |
*word = wp; |
switch (word[0]) { |
return; |
case('.'): |
|
/* FALLTHROUGH */ |
|
case(','): |
|
/* FALLTHROUGH */ |
|
case(';'): |
|
/* FALLTHROUGH */ |
|
case(':'): |
|
/* FALLTHROUGH */ |
|
case('?'): |
|
/* FALLTHROUGH */ |
|
case('!'): |
|
/* FALLTHROUGH */ |
|
case(')'): |
|
/* FALLTHROUGH */ |
|
case(']'): |
|
if ( ! (TERMP_IGNDELIM & p->flags)) |
|
p->flags |= TERMP_NOSPACE; |
|
break; |
|
default: |
|
break; |
|
} |
|
|
|
if ( ! (TERMP_NOSPACE & p->flags)) { |
|
if ( ! (TERMP_KEEP & p->flags)) { |
|
if (TERMP_PREKEEP & p->flags) |
|
p->flags |= TERMP_KEEP; |
|
bufferc(p, ' '); |
|
if (TERMP_SENTENCE & p->flags) |
|
bufferc(p, ' '); |
|
} else |
|
bufferc(p, ASCII_NBRSP); |
} |
} |
|
|
if ('(' == *wp) { |
if ( ! (p->flags & TERMP_NONOSPACE)) |
wp++; |
p->flags &= ~TERMP_NOSPACE; |
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
|
return; |
|
} |
|
|
|
term_nescape(p, wp, 2); |
p->flags &= ~TERMP_SENTENCE; |
*word = ++wp; |
|
return; |
|
|
|
} else if ('*' == *wp) { |
/* FIXME: use strcspn. */ |
if (0 == *(++wp)) { |
|
*word = wp; |
while (*word) { |
return; |
if ('\\' != *word) { |
|
encode(p, word, 1); |
|
word++; |
|
continue; |
} |
} |
|
|
switch (*wp) { |
seq = ++word; |
case ('('): |
sz = a2roffdeco(&deco, &seq, &ssz); |
wp++; |
|
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
|
return; |
|
} |
|
|
|
term_nescape(p, wp, 2); |
switch (deco) { |
*word = ++wp; |
case (DECO_RESERVED): |
return; |
res(p, seq, ssz); |
case ('['): |
|
break; |
break; |
|
case (DECO_SPECIAL): |
|
spec(p, seq, ssz); |
|
break; |
|
case (DECO_BOLD): |
|
term_fontrepl(p, TERMFONT_BOLD); |
|
break; |
|
case (DECO_ITALIC): |
|
term_fontrepl(p, TERMFONT_UNDER); |
|
break; |
|
case (DECO_ROMAN): |
|
term_fontrepl(p, TERMFONT_NONE); |
|
break; |
|
case (DECO_PREVIOUS): |
|
term_fontlast(p); |
|
break; |
default: |
default: |
term_nescape(p, wp, 1); |
break; |
*word = wp; |
|
return; |
|
} |
} |
|
|
} else if ('f' == *wp) { |
|
if (0 == *(++wp)) { |
|
*word = wp; |
|
return; |
|
} |
|
|
|
switch (*wp) { |
word += sz; |
case ('B'): |
if (DECO_NOSPACE == deco && '\0' == *word) |
p->flags |= TERMP_BOLD; |
p->flags |= TERMP_NOSPACE; |
break; |
} |
case ('I'): |
|
p->flags |= TERMP_UNDER; |
/* |
break; |
* Note that we don't process the pipe: the parser sees it as |
case ('P'): |
* punctuation, but we don't in terms of typography. |
|
*/ |
|
if (sv[0] && 0 == sv[1]) |
|
switch (sv[0]) { |
|
case('('): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('R'): |
case('['): |
p->flags &= ~TERMP_STYLE; |
p->flags |= TERMP_NOSPACE; |
break; |
break; |
default: |
default: |
break; |
break; |
} |
} |
|
} |
|
|
*word = wp; |
|
return; |
|
|
|
} else if ('[' != *wp) { |
static void |
term_nescape(p, wp, 1); |
adjbuf(struct termp *p, size_t sz) |
*word = wp; |
{ |
return; |
|
} |
|
|
|
wp++; |
if (0 == p->maxcols) |
for (j = 0; *wp && ']' != *wp; wp++, j++) |
p->maxcols = 1024; |
/* Loop... */ ; |
while (sz >= p->maxcols) |
|
p->maxcols <<= 2; |
|
|
if (0 == *wp) { |
p->buf = realloc(p->buf, p->maxcols); |
*word = wp; |
if (NULL == p->buf) { |
return; |
perror(NULL); |
|
exit(EXIT_FAILURE); |
} |
} |
|
} |
|
|
term_nescape(p, wp - j, (size_t)j); |
|
*word = wp; |
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 |
* Handle pwords, partial words, which may be either a single word or a |
bufferc(struct termp *p, char c) |
* phrase that cannot be broken down (such as a literal string). This |
|
* handles word styling. |
|
*/ |
|
void |
|
term_word(struct termp *p, const char *word) |
|
{ |
{ |
const char *sv; |
|
|
|
if (term_isclosedelim(word)) |
if (p->col + 1 >= p->maxcols) |
if ( ! (TERMP_IGNDELIM & p->flags)) |
adjbuf(p, p->col + 1); |
p->flags |= TERMP_NOSPACE; |
|
|
|
if ( ! (TERMP_NOSPACE & p->flags)) |
p->buf[(int)p->col++] = c; |
term_chara(p, ' '); |
} |
|
|
if ( ! (p->flags & TERMP_NONOSPACE)) |
|
p->flags &= ~TERMP_NOSPACE; |
|
|
|
/* |
static void |
* If ANSI (word-length styling), then apply our style now, |
encode(struct termp *p, const char *word, size_t sz) |
* before the word. |
{ |
|
enum termfont f; |
|
int i; |
|
|
|
/* |
|
* Encode and buffer a string of characters. If the current |
|
* font mode is unset, buffer directly, else encode then buffer |
|
* character by character. |
*/ |
*/ |
|
|
for (sv = word; *word; word++) |
if (TERMFONT_NONE == (f = term_fonttop(p))) { |
if ('\\' != *word) |
buffera(p, word, sz); |
term_encodea(p, *word); |
return; |
|
} |
|
|
|
for (i = 0; i < (int)sz; i++) { |
|
if ( ! isgraph((u_char)word[i])) { |
|
bufferc(p, word[i]); |
|
continue; |
|
} |
|
|
|
if (TERMFONT_UNDER == f) |
|
bufferc(p, '_'); |
else |
else |
term_pescape(p, &word); |
bufferc(p, word[i]); |
|
|
if (term_isopendelim(sv)) |
bufferc(p, 8); |
p->flags |= TERMP_NOSPACE; |
bufferc(p, word[i]); |
|
} |
} |
} |
|
|
|
|
/* |
size_t |
* Insert a single character into the line-buffer. If the buffer's |
term_len(const struct termp *p, size_t sz) |
* space is exceeded, then allocate more space by doubling the buffer |
|
* size. |
|
*/ |
|
static void |
|
term_chara(struct termp *p, char c) |
|
{ |
{ |
size_t s; |
|
|
|
if (p->col + 1 >= p->maxcols) { |
return((*p->width)(p, ' ') * sz); |
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 |
size_t |
term_encodea(struct termp *p, char c) |
term_strlen(const struct termp *p, const char *cp) |
{ |
{ |
|
size_t sz; |
if (' ' != c && TERMP_STYLE & p->flags) { |
|
if (TERMP_BOLD & p->flags) { |
for (sz = 0; *cp; cp++) |
term_chara(p, c); |
sz += (*p->width)(p, *cp); |
term_chara(p, 8); |
|
} |
return(sz); |
if (TERMP_UNDER & p->flags) { |
} |
term_chara(p, '_'); |
|
term_chara(p, 8); |
|
} |
/* ARGSUSED */ |
|
size_t |
|
term_vspan(const struct termp *p, const struct roffsu *su) |
|
{ |
|
double r; |
|
|
|
switch (su->unit) { |
|
case (SCALE_CM): |
|
r = su->scale * 2; |
|
break; |
|
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; |
} |
} |
term_chara(p, c); |
|
|
if (r < 0.0) |
|
r = 0.0; |
|
return(/* LINTED */(size_t) |
|
r); |
|
} |
|
|
|
|
|
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); |
} |
} |