version 1.4, 2009/02/21 15:34:46 |
version 1.90, 2009/07/19 21:26:27 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se> |
* |
* |
* 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. |
|
*/ |
*/ |
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
|
#include <curses.h> |
|
#include <err.h> |
#include <err.h> |
#include <stdlib.h> |
|
#include <stdio.h> |
#include <stdio.h> |
|
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <term.h> |
|
#include <unistd.h> |
|
|
|
#include "private.h" |
#include "term.h" |
|
#include "man.h" |
|
#include "mdoc.h" |
|
|
enum termesc { |
extern int man_run(struct termp *, |
ESC_CLEAR, |
const struct man *); |
ESC_BOLD, |
extern int mdoc_run(struct termp *, |
ESC_UNDERLINE |
const struct mdoc *); |
}; |
|
|
|
struct termp { |
static struct termp *term_alloc(enum termenc); |
size_t rmargin; |
static void term_free(struct termp *); |
size_t maxrmargin; |
static void term_pescape(struct termp *, const char **); |
size_t maxcols; |
static void term_nescape(struct termp *, |
size_t offset; |
const char *, size_t); |
size_t col; |
static void term_chara(struct termp *, char); |
int flags; |
static void term_encodea(struct termp *, char); |
#define TERMP_BOLD (1 << 0) /* Embolden words. */ |
static int term_isopendelim(const char *); |
#define TERMP_UNDERLINE (1 << 1) /* Underline words. */ |
static int term_isclosedelim(const char *); |
#define TERMP_NOSPACE (1 << 2) /* No space before words. */ |
|
#define TERMP_NOLPAD (1 << 3) /* No left-padding. */ |
|
#define TERMP_NOBREAK (1 << 4) /* No break after line */ |
|
char *buf; |
|
}; |
|
|
|
struct termact { |
|
int (*pre)(struct termp *, |
|
const struct mdoc_meta *, |
|
const struct mdoc_node *); |
|
int (*post)(struct termp *, |
|
const struct mdoc_meta *, |
|
const struct mdoc_node *); |
|
}; |
|
|
|
static void termprint_r(struct termp *, |
void * |
const struct mdoc_meta *, |
ascii_alloc(void) |
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 int arg_hasattr(int, size_t, |
return(term_alloc(TERMENC_ASCII)); |
const struct mdoc_arg *); |
} |
static int arg_getattr(int, size_t, |
|
const struct mdoc_arg *); |
|
|
|
static void newln(struct termp *); |
|
static void vspace(struct termp *); |
|
static void pword(struct termp *, const char *, size_t); |
|
static void word(struct termp *, const char *); |
|
|
|
#define decl_prepost(name, suffix) \ |
int |
static int name##_##suffix(struct termp *, \ |
terminal_man(void *arg, const struct man *man) |
const struct mdoc_meta *, \ |
{ |
const struct mdoc_node *) |
struct termp *p; |
|
|
#define decl_pre(name) decl_prepost(name, pre) |
p = (struct termp *)arg; |
#define decl_post(name) decl_prepost(name, post) |
if (NULL == p->symtab) |
|
p->symtab = term_ascii2htab(); |
|
|
decl_pre(termp_fl); |
return(man_run(p, man)); |
decl_pre(termp_it); |
} |
decl_pre(termp_nd); |
|
decl_pre(termp_ns); |
|
decl_pre(termp_op); |
|
decl_pre(termp_pp); |
|
decl_pre(termp_sh); |
|
decl_pre(termp_xr); |
|
|
|
decl_post(termp_bl); |
|
decl_post(termp_it); |
|
decl_post(termp_op); |
|
decl_post(termp_sh); |
|
|
|
decl_pre(termp_bold); |
int |
decl_pre(termp_under); |
terminal_mdoc(void *arg, const struct mdoc *mdoc) |
|
{ |
|
struct termp *p; |
|
|
decl_post(termp_bold); |
p = (struct termp *)arg; |
decl_post(termp_under); |
if (NULL == p->symtab) |
|
p->symtab = term_ascii2htab(); |
|
|
const struct termact termacts[MDOC_MAX] = { |
return(mdoc_run(p, mdoc)); |
{ NULL, NULL }, /* \" */ |
} |
{ NULL, NULL }, /* Dd */ |
|
{ NULL, NULL }, /* Dt */ |
|
{ NULL, NULL }, /* Os */ |
|
{ termp_sh_pre, termp_sh_post }, /* Sh */ |
|
{ NULL, NULL }, /* Ss */ |
|
{ termp_pp_pre, NULL }, /* Pp */ |
|
{ NULL, NULL }, /* D1 */ |
|
{ NULL, NULL }, /* Dl */ |
|
{ NULL, NULL }, /* Bd */ |
|
{ NULL, NULL }, /* Ed */ |
|
{ NULL, termp_bl_post }, /* Bl */ |
|
{ NULL, NULL }, /* El */ |
|
{ termp_it_pre, termp_it_post }, /* It */ |
|
{ NULL, NULL }, /* Ad */ |
|
{ NULL, NULL }, /* An */ |
|
{ termp_under_pre, termp_under_post }, /* Ar */ |
|
{ NULL, NULL }, /* Cd */ |
|
{ NULL, NULL }, /* Cm */ |
|
{ NULL, NULL }, /* Dv */ |
|
{ NULL, NULL }, /* Er */ |
|
{ NULL, NULL }, /* Ev */ |
|
{ NULL, NULL }, /* Ex */ |
|
{ NULL, NULL }, /* Fa */ |
|
{ NULL, NULL }, /* Fd */ |
|
{ termp_fl_pre, termp_bold_post }, /* Fl */ |
|
{ NULL, NULL }, /* Fn */ |
|
{ NULL, NULL }, /* Ft */ |
|
{ NULL, NULL }, /* Ic */ |
|
{ NULL, NULL }, /* In */ |
|
{ NULL, NULL }, /* Li */ |
|
{ termp_nd_pre, NULL }, /* Nd */ |
|
{ termp_bold_pre, termp_bold_post }, /* Nm */ |
|
{ termp_op_pre, termp_op_post }, /* Op */ |
|
{ NULL, NULL }, /* Ot */ |
|
{ NULL, NULL }, /* Pa */ |
|
{ NULL, NULL }, /* Rv */ |
|
{ NULL, NULL }, /* St */ |
|
{ NULL, NULL }, /* Va */ |
|
{ NULL, NULL }, /* Vt */ |
|
{ termp_xr_pre, NULL }, /* Xr */ |
|
{ NULL, NULL }, /* %A */ |
|
{ NULL, NULL }, /* %B */ |
|
{ NULL, NULL }, /* %D */ |
|
{ NULL, NULL }, /* %I */ |
|
{ NULL, NULL }, /* %J */ |
|
{ NULL, NULL }, /* %N */ |
|
{ NULL, NULL }, /* %O */ |
|
{ NULL, NULL }, /* %P */ |
|
{ NULL, NULL }, /* %R */ |
|
{ NULL, NULL }, /* %T */ |
|
{ NULL, NULL }, /* %V */ |
|
{ NULL, NULL }, /* Ac */ |
|
{ NULL, NULL }, /* Ao */ |
|
{ NULL, NULL }, /* Aq */ |
|
{ NULL, NULL }, /* At */ |
|
{ NULL, NULL }, /* Bc */ |
|
{ NULL, NULL }, /* Bf */ |
|
{ NULL, NULL }, /* Bo */ |
|
{ NULL, NULL }, /* Bq */ |
|
{ NULL, NULL }, /* Bsx */ |
|
{ NULL, NULL }, /* Bx */ |
|
{ NULL, NULL }, /* Db */ |
|
{ NULL, NULL }, /* Dc */ |
|
{ NULL, NULL }, /* Do */ |
|
{ NULL, NULL }, /* Dq */ |
|
{ NULL, NULL }, /* Ec */ |
|
{ NULL, NULL }, /* Ef */ |
|
{ NULL, NULL }, /* Em */ |
|
{ NULL, NULL }, /* Eo */ |
|
{ NULL, NULL }, /* Fx */ |
|
{ NULL, NULL }, /* Ms */ |
|
{ NULL, NULL }, /* No */ |
|
{ termp_ns_pre, NULL }, /* Ns */ |
|
{ NULL, NULL }, /* Nx */ |
|
{ NULL, NULL }, /* Ox */ |
|
{ NULL, NULL }, /* Pc */ |
|
{ NULL, NULL }, /* Pf */ |
|
{ NULL, NULL }, /* Po */ |
|
{ NULL, NULL }, /* Pq */ |
|
{ NULL, NULL }, /* Qc */ |
|
{ NULL, NULL }, /* Ql */ |
|
{ NULL, NULL }, /* Qo */ |
|
{ NULL, NULL }, /* Qq */ |
|
{ NULL, NULL }, /* Re */ |
|
{ NULL, NULL }, /* Rs */ |
|
{ NULL, NULL }, /* Sc */ |
|
{ NULL, NULL }, /* So */ |
|
{ NULL, NULL }, /* Sq */ |
|
{ NULL, NULL }, /* Sm */ |
|
{ NULL, NULL }, /* Sx */ |
|
{ NULL, NULL }, /* Sy */ |
|
{ NULL, NULL }, /* Tn */ |
|
{ NULL, NULL }, /* Ux */ |
|
{ NULL, NULL }, /* Xc */ |
|
{ NULL, NULL }, /* Xo */ |
|
{ NULL, NULL }, /* Fo */ |
|
{ NULL, NULL }, /* Fc */ |
|
{ NULL, NULL }, /* Oo */ |
|
{ NULL, NULL }, /* Oc */ |
|
{ NULL, NULL }, /* Bk */ |
|
{ NULL, NULL }, /* Ek */ |
|
{ NULL, NULL }, /* Bt */ |
|
{ NULL, NULL }, /* Hf */ |
|
{ NULL, NULL }, /* Fr */ |
|
{ NULL, NULL }, /* Ud */ |
|
}; |
|
|
|
|
|
|
void |
|
terminal_free(void *arg) |
|
{ |
|
|
|
term_free((struct termp *)arg); |
|
} |
|
|
|
|
|
static void |
|
term_free(struct termp *p) |
|
{ |
|
|
|
if (p->buf) |
|
free(p->buf); |
|
if (TERMENC_ASCII == p->enc && p->symtab) |
|
term_asciifree(p->symtab); |
|
|
|
free(p); |
|
} |
|
|
|
|
|
static struct termp * |
|
term_alloc(enum termenc enc) |
|
{ |
|
struct termp *p; |
|
|
|
if (NULL == (p = malloc(sizeof(struct termp)))) |
|
err(1, "malloc"); |
|
bzero(p, sizeof(struct termp)); |
|
p->maxrmargin = 78; |
|
p->enc = enc; |
|
return(p); |
|
} |
|
|
|
|
static int |
static int |
arg_hasattr(int arg, size_t argc, const struct mdoc_arg *argv) |
term_isclosedelim(const char *p) |
{ |
{ |
|
|
return(-1 != arg_getattr(arg, argc, argv)); |
if ( ! (*p && 0 == *(p + 1))) |
|
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 |
static int |
arg_getattr(int arg, size_t argc, const struct mdoc_arg *argv) |
term_isopendelim(const char *p) |
{ |
{ |
int i; |
|
|
|
for (i = 0; i < (int)argc; i++) |
if ( ! (*p && 0 == *(p + 1))) |
if (argv[i].arg == arg) |
return(0); |
return(i); |
|
return(-1); |
switch (*p) { |
|
case('('): |
|
/* FALLTHROUGH */ |
|
case('['): |
|
/* FALLTHROUGH */ |
|
case('{'): |
|
return(1); |
|
default: |
|
break; |
|
} |
|
|
|
return(0); |
} |
} |
|
|
|
|
static void |
/* |
flushln(struct termp *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. |
|
* |
|
* Specifically, a line is whatever's in p->buf of length p->col, which |
|
* 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 |
|
* 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_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. 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 |
|
term_flushln(struct termp *p) |
{ |
{ |
size_t i, j, vsz, vis, maxvis; |
int i, j; |
|
size_t vbl, vsz, vis, maxvis, mmax, bp; |
|
static int sv = -1; |
|
|
/* |
/* |
* First, establish the maximum columns of "visible" content. |
* First, establish the maximum columns of "visible" content. |
Line 248 flushln(struct termp *p) |
|
Line 225 flushln(struct termp *p) |
|
|
|
assert(p->offset < p->rmargin); |
assert(p->offset < p->rmargin); |
maxvis = p->rmargin - p->offset; |
maxvis = p->rmargin - p->offset; |
|
mmax = p->maxrmargin - p->offset; |
|
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
vis = 0; |
vis = 0; |
|
|
|
if (sv >= 0) { |
|
vis = (size_t)sv; |
|
sv = -1; |
|
} |
|
|
/* |
/* |
* If in the standard case (left-justified), then begin with our |
* If in the standard case (left-justified), then begin with our |
* indentation, otherwise (columns, etc.) just start spitting |
* indentation, otherwise (columns, etc.) just start spitting |
Line 258 flushln(struct termp *p) |
|
Line 242 flushln(struct termp *p) |
|
|
|
if ( ! (p->flags & TERMP_NOLPAD)) |
if ( ! (p->flags & TERMP_NOLPAD)) |
/* LINTED */ |
/* LINTED */ |
for (j = 0; j < p->offset; j++) |
for (j = 0; j < (int)p->offset; j++) |
putchar(' '); |
putchar(' '); |
|
|
for (i = 0; i < p->col; i++) { |
for (i = 0; i < (int)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 */ |
/* LINTED */ |
for (j = i, vsz = 0; j < p->col; j++) { |
for (j = i, vsz = 0; j < (int)p->col; j++) { |
if (isspace(p->buf[j])) |
if (' ' == p->buf[j]) |
break; |
break; |
else if (27 == p->buf[j]) { |
else if (8 == p->buf[j]) |
assert(j + 4 <= p->col); |
vsz--; |
j += 3; |
else |
} else |
|
vsz++; |
vsz++; |
} |
} |
assert(vsz > 0); |
|
|
|
/* |
/* |
* If a word is too long and we're within a line, put it |
* Choose the number of blanks to prepend: no blank at the |
* on the next line. Puke if we're being asked to write |
* beginning of a line, one between words -- but do not |
* something that will exceed the right margin (i.e., |
* actually write them yet. |
* from a fresh line or when we're not allowed to break |
|
* the line with TERMP_NOBREAK). |
|
*/ |
*/ |
|
vbl = (size_t)(0 == vis ? 0 : 1); |
|
|
if (vis && vis + vsz >= maxvis) { |
/* |
/* FIXME */ |
* Find out whether we would exceed the right margin. |
if (p->flags & TERMP_NOBREAK) |
* If so, break to the next line. (TODO: hyphenate) |
errx(1, "word breaks right margin"); |
* Otherwise, write the chosen number of blanks now. |
|
*/ |
|
if (vis && vis + vbl + vsz > bp) { |
putchar('\n'); |
putchar('\n'); |
for (j = 0; j < p->offset; j++) |
if (TERMP_NOBREAK & p->flags) { |
|
for (j = 0; j < (int)p->rmargin; j++) |
|
putchar(' '); |
|
vis = p->rmargin - p->offset; |
|
} else { |
|
for (j = 0; j < (int)p->offset; j++) |
|
putchar(' '); |
|
vis = 0; |
|
} |
|
} else { |
|
for (j = 0; j < (int)vbl; j++) |
putchar(' '); |
putchar(' '); |
vis = 0; |
vis += vbl; |
} else if (vis + vsz >= maxvis) { |
|
/* FIXME */ |
|
errx(1, "word breaks right margin"); |
|
} |
} |
|
|
/* |
/* |
* Write out the word and a trailing space. Omit the |
* Finally, write out the word. |
* space if we're the last word in the line. |
|
*/ |
*/ |
|
for ( ; i < (int)p->col; i++) { |
for ( ; i < p->col; i++) { |
if (' ' == p->buf[i]) |
if (isspace(p->buf[i])) |
|
break; |
break; |
putchar(p->buf[i]); |
putchar(p->buf[i]); |
} |
} |
vis += vsz; |
vis += vsz; |
if (i < p->col) { |
} |
putchar(' '); |
|
vis++; |
/* |
|
* If we've overstepped our maximum visible no-break space, then |
|
* cause a newline and offset at the right margin. |
|
*/ |
|
|
|
if ((TERMP_NOBREAK & p->flags) && vis >= maxvis) { |
|
if ( ! (TERMP_DANGLE & p->flags) && |
|
! (TERMP_HANG & p->flags)) { |
|
putchar('\n'); |
|
for (i = 0; i < (int)p->rmargin; i++) |
|
putchar(' '); |
} |
} |
|
if (TERMP_HANG & p->flags) |
|
sv = (int)(vis - maxvis); |
|
p->col = 0; |
|
return; |
} |
} |
|
|
/* |
/* |
Line 324 flushln(struct termp *p) |
|
Line 327 flushln(struct termp *p) |
|
*/ |
*/ |
|
|
if (p->flags & TERMP_NOBREAK) { |
if (p->flags & TERMP_NOBREAK) { |
for ( ; vis <= maxvis; vis++) |
if ( ! (TERMP_DANGLE & p->flags)) |
putchar(' '); |
for ( ; vis < maxvis; vis++) |
|
putchar(' '); |
} else |
} else |
putchar('\n'); |
putchar('\n'); |
|
|
Line 333 flushln(struct termp *p) |
|
Line 337 flushln(struct termp *p) |
|
} |
} |
|
|
|
|
static void |
/* |
newln(struct termp *p) |
* 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 |
|
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) { |
|
p->flags &= ~TERMP_NOLPAD; |
return; |
return; |
flushln(p); |
} |
|
term_flushln(p); |
|
p->flags &= ~TERMP_NOLPAD; |
} |
} |
|
|
|
|
static void |
/* |
vspace(struct termp *p) |
* 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 |
|
term_vspace(struct termp *p) |
{ |
{ |
|
|
/* |
term_newln(p); |
* Asserts a vertical space (a full, empty line-break between |
|
* lines). |
|
*/ |
|
newln(p); |
|
putchar('\n'); |
putchar('\n'); |
} |
} |
|
|
|
|
|
/* |
|
* 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 |
chara(struct termp *p, char c) |
term_nescape(struct termp *p, const char *word, size_t len) |
{ |
{ |
|
const char *rhs; |
|
size_t sz; |
|
int i; |
|
|
/* TODO: dynamically expand the buffer. */ |
rhs = term_a2ascii(p->symtab, word, len, &sz); |
if (p->col + 1 >= p->maxcols) |
|
errx(1, "line overrun"); |
if (rhs) |
p->buf[(p->col)++] = c; |
for (i = 0; i < (int)sz; i++) |
|
term_encodea(p, rhs[i]); |
} |
} |
|
|
|
|
|
/* |
|
* Handle an escape sequence: determine its length and pass it to the |
|
* escape-symbol look table. Note that we assume mdoc(3) has validated |
|
* the escape sequence (we assert upon badly-formed escape sequences). |
|
*/ |
static void |
static void |
escape(struct termp *p, enum termesc esc) |
term_pescape(struct termp *p, const char **word) |
{ |
{ |
|
int j; |
|
const char *wp; |
|
|
if (p->col + 4 >= p->maxcols) |
wp = *word; |
errx(1, "line overrun"); |
|
|
|
p->buf[(p->col)++] = 27; |
if (0 == *(++wp)) { |
p->buf[(p->col)++] = '['; |
*word = wp; |
switch (esc) { |
return; |
case (ESC_CLEAR): |
|
p->buf[(p->col)++] = '0'; |
|
break; |
|
case (ESC_BOLD): |
|
p->buf[(p->col)++] = '1'; |
|
break; |
|
case (ESC_UNDERLINE): |
|
p->buf[(p->col)++] = '4'; |
|
break; |
|
default: |
|
abort(); |
|
/* NOTREACHED */ |
|
} |
} |
p->buf[(p->col)++] = 'm'; |
|
} |
|
|
|
|
if ('(' == *wp) { |
|
wp++; |
|
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
|
return; |
|
} |
|
|
static void |
term_nescape(p, wp, 2); |
pword(struct termp *p, const char *word, size_t len) |
*word = ++wp; |
{ |
return; |
size_t i; |
|
|
|
assert(len > 0); |
} else if ('*' == *wp) { |
|
if (0 == *(++wp)) { |
if ( ! (p->flags & TERMP_NOSPACE)) |
*word = wp; |
chara(p, ' '); |
return; |
|
|
p->flags &= ~TERMP_NOSPACE; |
|
|
|
if (p->flags & TERMP_BOLD) |
|
escape(p, ESC_BOLD); |
|
if (p->flags & TERMP_UNDERLINE) |
|
escape(p, ESC_UNDERLINE); |
|
|
|
/* TODO: escape patterns. */ |
|
|
|
for (i = 0; i < len; i++) |
|
chara(p, word[i]); |
|
|
|
if (p->flags & TERMP_BOLD || |
|
p->flags & TERMP_UNDERLINE) |
|
escape(p, ESC_CLEAR); |
|
} |
|
|
|
|
|
static void |
|
word(struct termp *p, const char *word) |
|
{ |
|
size_t i, j, len; |
|
|
|
if (mdoc_isdelim(word)) |
|
p->flags |= TERMP_NOSPACE; |
|
|
|
len = strlen(word); |
|
assert(len > 0); |
|
|
|
/* LINTED */ |
|
for (j = i = 0; i < len; i++) { |
|
if ( ! isspace(word[i])) { |
|
j++; |
|
continue; |
|
} |
} |
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); |
|
} |
|
} |
|
|
|
|
switch (*wp) { |
|
case ('('): |
|
wp++; |
|
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
|
return; |
|
} |
|
|
/* ARGSUSED */ |
term_nescape(p, wp, 2); |
static int |
*word = ++wp; |
termp_it_post(struct termp *p, const struct mdoc_meta *meta, |
return; |
const struct mdoc_node *node) |
case ('['): |
{ |
break; |
const struct mdoc_node *n, *it; |
default: |
const struct mdoc_block *bl; |
term_nescape(p, wp, 1); |
int i; |
*word = wp; |
size_t width; |
return; |
|
|
switch (node->type) { |
|
case (MDOC_BODY): |
|
/* FALLTHROUGH */ |
|
case (MDOC_HEAD): |
|
break; |
|
default: |
|
return(1); |
|
} |
|
|
|
it = node->parent; |
|
assert(MDOC_BLOCK == it->type); |
|
assert(MDOC_It == it->tok); |
|
|
|
n = it->parent; |
|
assert(MDOC_BODY == n->type); |
|
assert(MDOC_Bl == n->tok); |
|
n = n->parent; |
|
bl = &n->data.block; |
|
|
|
/* If `-tag', adjust our margins accordingly. */ |
|
|
|
if (arg_hasattr(MDOC_Tag, bl->argc, bl->argv)) { |
|
i = arg_getattr(MDOC_Width, bl->argc, bl->argv); |
|
assert(i >= 0); |
|
assert(1 == bl->argv[i].sz); |
|
width = strlen(*bl->argv[i].value); /* XXX */ |
|
|
|
if (MDOC_HEAD == node->type) { |
|
flushln(p); |
|
/* FIXME: nested lists. */ |
|
p->rmargin = p->maxrmargin; |
|
p->flags &= ~TERMP_NOBREAK; |
|
} else { |
|
flushln(p); |
|
p->offset -= width + 1; |
|
p->flags &= ~TERMP_NOLPAD; |
|
} |
} |
} |
|
|
} else if ('f' == *wp) { |
|
if (0 == *(++wp)) { |
|
*word = wp; |
|
return; |
|
} |
|
|
return(1); |
switch (*wp) { |
} |
case ('B'): |
|
p->flags |= TERMP_BOLD; |
|
break; |
/* ARGSUSED */ |
case ('I'): |
static int |
p->flags |= TERMP_UNDER; |
termp_it_pre(struct termp *p, const struct mdoc_meta *meta, |
break; |
const struct mdoc_node *node) |
case ('P'): |
{ |
/* FALLTHROUGH */ |
const struct mdoc_node *n, *it; |
case ('R'): |
const struct mdoc_block *bl; |
p->flags &= ~TERMP_STYLE; |
int i; |
break; |
size_t width; |
default: |
|
break; |
switch (node->type) { |
|
case (MDOC_BODY): |
|
/* FALLTHROUGH */ |
|
case (MDOC_HEAD): |
|
it = node->parent; |
|
break; |
|
case (MDOC_BLOCK): |
|
it = node; |
|
break; |
|
default: |
|
return(1); |
|
} |
|
|
|
assert(MDOC_BLOCK == it->type); |
|
assert(MDOC_It == it->tok); |
|
|
|
n = it->parent; |
|
assert(MDOC_BODY == n->type); |
|
assert(MDOC_Bl == n->tok); |
|
n = n->parent; |
|
bl = &n->data.block; |
|
|
|
/* If `-compact', don't assert vertical space. */ |
|
|
|
if (MDOC_BLOCK == node->type) { |
|
if (arg_hasattr(MDOC_Compact, bl->argc, bl->argv)) |
|
newln(p); |
|
else |
|
vspace(p); |
|
return(1); |
|
} |
|
|
|
assert(MDOC_HEAD == node->type |
|
|| MDOC_BODY == node->type); |
|
|
|
/* If `-tag', adjust our margins accordingly. */ |
|
|
|
if (arg_hasattr(MDOC_Tag, bl->argc, bl->argv)) { |
|
i = arg_getattr(MDOC_Width, bl->argc, bl->argv); |
|
assert(i >= 0); /* XXX */ |
|
assert(1 == bl->argv[i].sz); |
|
width = strlen(*bl->argv[i].value); /* XXX */ |
|
|
|
/* FIXME: nested lists. */ |
|
|
|
if (MDOC_HEAD == node->type) { |
|
p->flags |= TERMP_NOBREAK; |
|
p->flags |= TERMP_NOSPACE; |
|
p->rmargin = p->offset + width; |
|
} else { |
|
p->flags |= TERMP_NOSPACE; |
|
p->flags |= TERMP_NOLPAD; |
|
p->offset += width + 1; |
|
} |
} |
} |
|
|
|
return(1); |
*word = wp; |
} |
return; |
|
|
|
} else if ('[' != *wp) { |
/* ARGSUSED */ |
term_nescape(p, wp, 1); |
static int |
*word = wp; |
termp_bold_post(struct termp *p, const struct mdoc_meta *meta, |
return; |
const struct mdoc_node *node) |
|
{ |
|
|
|
p->flags &= ~TERMP_BOLD; |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_under_pre(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
p->flags |= TERMP_UNDERLINE; |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_bold_pre(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
p->flags |= TERMP_BOLD; |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_ns_pre(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
p->flags |= TERMP_NOSPACE; |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_pp_pre(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
vspace(p); |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_under_post(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
p->flags &= ~TERMP_UNDERLINE; |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_nd_pre(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
word(p, "-"); |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_bl_post(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
switch (node->type) { |
|
case (MDOC_BLOCK): |
|
newln(p); |
|
break; |
|
default: |
|
break; |
|
} |
} |
return(1); |
|
} |
|
|
|
|
wp++; |
|
for (j = 0; *wp && ']' != *wp; wp++, j++) |
|
/* Loop... */ ; |
|
|
/* ARGSUSED */ |
if (0 == *wp) { |
static int |
*word = wp; |
termp_op_post(struct termp *p, const struct mdoc_meta *meta, |
return; |
const struct mdoc_node *node) |
|
{ |
|
|
|
switch (node->type) { |
|
case (MDOC_BODY): |
|
p->flags |= TERMP_NOSPACE; |
|
word(p, "\\]"); |
|
break; |
|
default: |
|
break; |
|
} |
} |
return(1); |
|
} |
|
|
|
|
term_nescape(p, wp - j, (size_t)j); |
/* ARGSUSED */ |
*word = wp; |
static int |
|
termp_sh_post(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
switch (node->type) { |
|
case (MDOC_HEAD): |
|
p->flags &= ~TERMP_BOLD; |
|
newln(p); |
|
break; |
|
case (MDOC_BODY): |
|
newln(p); |
|
p->offset -= 4; |
|
break; |
|
default: |
|
break; |
|
} |
|
return(1); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* |
static int |
* Handle pwords, partial words, which may be either a single word or a |
termp_xr_pre(struct termp *p, const struct mdoc_meta *meta, |
* phrase that cannot be broken down (such as a literal string). This |
const struct mdoc_node *node) |
* handles word styling. |
|
*/ |
|
void |
|
term_word(struct termp *p, const char *word) |
{ |
{ |
const struct mdoc_node *n; |
const char *sv; |
|
|
n = node->child; |
if (term_isclosedelim(word)) |
assert(n); |
if ( ! (TERMP_IGNDELIM & p->flags)) |
|
p->flags |= TERMP_NOSPACE; |
|
|
assert(MDOC_TEXT == n->type); |
if ( ! (TERMP_NOSPACE & p->flags)) |
word(p, n->data.text.string); |
term_chara(p, ' '); |
|
|
if (NULL == (n = n->next)) |
if ( ! (p->flags & TERMP_NONOSPACE)) |
return(0); |
p->flags &= ~TERMP_NOSPACE; |
|
|
assert(MDOC_TEXT == n->type); |
/* |
p->flags |= TERMP_NOSPACE; |
* If ANSI (word-length styling), then apply our style now, |
word(p, "\\("); |
* before the word. |
p->flags |= TERMP_NOSPACE; |
*/ |
word(p, n->data.text.string); |
|
p->flags |= TERMP_NOSPACE; |
|
word(p, "\\)"); |
|
|
|
return(0); |
for (sv = word; *word; word++) |
} |
if ('\\' != *word) |
|
term_encodea(p, *word); |
|
else |
|
term_pescape(p, &word); |
|
|
|
if (term_isopendelim(sv)) |
/* ARGSUSED */ |
|
static int |
|
termp_sh_pre(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
switch (node->type) { |
|
case (MDOC_HEAD): |
|
vspace(p); |
|
p->flags |= TERMP_BOLD; |
|
break; |
|
case (MDOC_BODY): |
|
p->offset += 4; |
|
break; |
|
default: |
|
break; |
|
} |
|
return(1); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static int |
|
termp_op_pre(struct termp *p, const struct mdoc_meta *meta, |
|
const struct mdoc_node *node) |
|
{ |
|
|
|
switch (node->type) { |
|
case (MDOC_BODY): |
|
word(p, "\\["); |
|
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
break; |
|
default: |
|
break; |
|
} |
|
return(1); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* |
static int |
* Insert a single character into the line-buffer. If the buffer's |
termp_fl_pre(struct termp *p, const struct mdoc_meta *meta, |
* space is exceeded, then allocate more space by doubling the buffer |
const struct mdoc_node *node) |
* size. |
{ |
*/ |
|
|
p->flags |= TERMP_BOLD; |
|
word(p, "-"); |
|
p->flags |= TERMP_NOSPACE; |
|
return(1); |
|
} |
|
|
|
|
|
static void |
static void |
termprint_r(struct termp *p, const struct mdoc_meta *meta, |
term_chara(struct termp *p, char c) |
const struct mdoc_node *node) |
|
{ |
{ |
int dochild; |
size_t s; |
|
|
/* Pre-processing ----------------- */ |
if (p->col + 1 >= p->maxcols) { |
|
if (0 == p->maxcols) |
dochild = 1; |
p->maxcols = 256; |
|
s = p->maxcols * 2; |
if (MDOC_TEXT != node->type) { |
p->buf = realloc(p->buf, s); |
if (termacts[node->tok].pre) |
if (NULL == p->buf) |
if ( ! (*termacts[node->tok].pre)(p, meta, node)) |
err(1, "realloc"); |
dochild = 0; |
p->maxcols = s; |
} else /* MDOC_TEXT == node->type */ |
} |
word(p, node->data.text.string); |
p->buf[(int)(p->col)++] = c; |
|
|
/* Children ---------------------- */ |
|
|
|
if (dochild && NULL == node->child) { |
|
/* No-child processing. */ |
|
switch (node->type) { |
|
case (MDOC_ELEM): |
|
switch (node->tok) { |
|
case (MDOC_Nm): |
|
word(p, "progname"); /* TODO */ |
|
break; |
|
case (MDOC_Ar): |
|
word(p, "..."); |
|
break; |
|
default: |
|
break; |
|
} |
|
break; |
|
default: |
|
break; |
|
} |
|
} else if (dochild) |
|
termprint_r(p, meta, node->child); |
|
|
|
/* Post-processing --------------- */ |
|
|
|
if (MDOC_TEXT != node->type) { |
|
if (termacts[node->tok].post) |
|
if ( ! (*termacts[node->tok].post)(p, meta, node)) |
|
return; |
|
} |
|
|
|
/* Siblings ---------------------- */ |
|
|
|
if (node->next) |
|
termprint_r(p, meta, node->next); |
|
} |
} |
|
|
|
|
static void |
static void |
termprint_footer(struct termp *p, const struct mdoc_meta *meta) |
term_encodea(struct termp *p, char c) |
{ |
{ |
struct tm *tm; |
|
char *buf, *os; |
if (' ' != c && TERMP_STYLE & p->flags) { |
size_t sz, osz, ssz, i; |
if (TERMP_BOLD & p->flags) { |
|
term_chara(p, c); |
if (NULL == (buf = malloc(p->rmargin))) |
term_chara(p, 8); |
err(1, "malloc"); |
|
if (NULL == (os = malloc(p->rmargin))) |
|
err(1, "malloc"); |
|
|
|
tm = localtime(&meta->date); |
|
if (NULL == strftime(buf, p->rmargin, "%B %d, %Y", tm)) |
|
err(1, "strftime"); |
|
|
|
osz = strlcpy(os, meta->os, p->rmargin); |
|
|
|
sz = strlen(buf); |
|
ssz = sz + osz + 1; |
|
|
|
if (ssz > p->rmargin) { |
|
ssz -= p->rmargin; |
|
assert(ssz <= osz); |
|
os[osz - ssz] = 0; |
|
ssz = 1; |
|
} else |
|
ssz = p->rmargin - ssz + 1; |
|
|
|
printf("\n"); |
|
printf("%s", os); |
|
for (i = 0; i < ssz; i++) |
|
printf(" "); |
|
|
|
printf("%s\n", buf); |
|
fflush(stdout); |
|
|
|
free(buf); |
|
free(os); |
|
} |
|
|
|
|
|
static void |
|
termprint_header(struct termp *p, const struct mdoc_meta *meta) |
|
{ |
|
char *msec, *buf, *title, *pp; |
|
size_t ssz, tsz, ttsz, i;; |
|
|
|
if (NULL == (buf = malloc(p->rmargin))) |
|
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); |
if (TERMP_UNDER & p->flags) { |
|
term_chara(p, '_'); |
tsz = strlcpy(buf, pp, p->rmargin); |
term_chara(p, 8); |
assert(tsz < p->rmargin); |
} |
|
|
if ((pp = mdoc_arch2a(meta->arch))) { |
|
tsz = strlcat(buf, " (", p->rmargin); |
|
assert(tsz < p->rmargin); |
|
tsz = strlcat(buf, pp, p->rmargin); |
|
assert(tsz < p->rmargin); |
|
tsz = strlcat(buf, ")", p->rmargin); |
|
assert(tsz < p->rmargin); |
|
} |
} |
|
term_chara(p, c); |
ttsz = strlcpy(title, meta->title, p->rmargin); |
|
|
|
if (NULL == (msec = mdoc_msec2a(meta->msec))) |
|
msec = ""; |
|
|
|
ssz = (2 * (ttsz + 2 + strlen(msec))) + tsz + 2; |
|
|
|
if (ssz > p->rmargin) { |
|
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); |
|
|
|
for (i = 0; i < ssz; i++) |
|
printf(" "); |
|
|
|
printf("%s", buf); |
|
|
|
for (i = 0; i < ssz; i++) |
|
printf(" "); |
|
|
|
printf("%s(%s)\n", title, msec); |
|
fflush(stdout); |
|
|
|
free(title); |
|
free(buf); |
|
} |
} |
|
|
|
|
int |
|
termprint(const struct mdoc_node *node, |
|
const struct mdoc_meta *meta) |
|
{ |
|
struct termp p; |
|
|
|
if (ERR == setupterm(NULL, STDOUT_FILENO, NULL)) |
|
return(0); |
|
|
|
p.maxrmargin = columns < 60 ? 60 : (size_t)columns; |
|
p.rmargin = p.maxrmargin; |
|
p.maxcols = 1024; |
|
p.offset = p.col = 0; |
|
p.flags = TERMP_NOSPACE; |
|
|
|
if (NULL == (p.buf = malloc(p.maxcols))) |
|
err(1, "malloc"); |
|
|
|
termprint_header(&p, meta); |
|
termprint_r(&p, meta, node); |
|
termprint_footer(&p, meta); |
|
|
|
free(p.buf); |
|
|
|
return(1); |
|
} |
|
|
|
|
|