version 1.1, 2009/02/20 11:04:23 |
version 1.100, 2009/09/16 15:08:31 |
|
|
/* $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 <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 "term.h" |
|
#include "man.h" |
#include "mdoc.h" |
#include "mdoc.h" |
|
|
|
extern void man_run(struct termp *, |
|
const struct man *); |
|
extern void mdoc_run(struct termp *, |
|
const struct mdoc *); |
|
|
static int termprint_r(size_t, size_t, |
static struct termp *term_alloc(enum termenc); |
const struct mdoc_node *); |
static void term_free(struct termp *); |
static void termprint_head(size_t, |
|
const struct mdoc_meta *); |
|
static void termprint_tail(size_t, |
|
const struct mdoc_meta *); |
|
|
|
static char *arch2a(enum mdoc_arch); |
static void do_escaped(struct termp *, const char **); |
static char *vol2a(enum mdoc_vol); |
static void do_special(struct termp *, |
static char *msec2a(enum mdoc_msec); |
const char *, size_t); |
|
static void do_reserved(struct termp *, |
|
const char *, size_t); |
|
static void buffer(struct termp *, char); |
|
static void encode(struct termp *, char); |
|
|
static size_t ttitle2a(char *, enum mdoc_vol, enum mdoc_msec, |
|
enum mdoc_arch, size_t); |
|
|
|
|
void * |
|
ascii_alloc(void) |
|
{ |
|
|
static char * |
return(term_alloc(TERMENC_ASCII)); |
arch2a(enum mdoc_arch arch) |
} |
|
|
|
|
|
void |
|
terminal_man(void *arg, const struct man *man) |
{ |
{ |
|
struct termp *p; |
|
|
switch (arch) { |
p = (struct termp *)arg; |
case (ARCH_alpha): |
if (NULL == p->symtab) |
return("Alpha"); |
p->symtab = term_ascii2htab(); |
case (ARCH_amd64): |
|
return("AMD64"); |
|
case (ARCH_amiga): |
|
return("Amiga"); |
|
case (ARCH_arc): |
|
return("ARC"); |
|
case (ARCH_arm): |
|
return("ARM"); |
|
case (ARCH_armish): |
|
return("ARMISH"); |
|
case (ARCH_aviion): |
|
return("AViion"); |
|
case (ARCH_hp300): |
|
return("HP300"); |
|
case (ARCH_hppa): |
|
return("HPPA"); |
|
case (ARCH_hppa64): |
|
return("HPPA64"); |
|
case (ARCH_i386): |
|
return("i386"); |
|
case (ARCH_landisk): |
|
return("LANDISK"); |
|
case (ARCH_luna88k): |
|
return("Luna88k"); |
|
case (ARCH_mac68k): |
|
return("Mac68k"); |
|
case (ARCH_macppc): |
|
return("MacPPC"); |
|
case (ARCH_mvme68k): |
|
return("MVME68k"); |
|
case (ARCH_mvme88k): |
|
return("MVME88k"); |
|
case (ARCH_mvmeppc): |
|
return("MVMEPPC"); |
|
case (ARCH_pmax): |
|
return("PMAX"); |
|
case (ARCH_sgi): |
|
return("SGI"); |
|
case (ARCH_socppc): |
|
return("SOCPPC"); |
|
case (ARCH_sparc): |
|
return("SPARC"); |
|
case (ARCH_sparc64): |
|
return("SPARC64"); |
|
case (ARCH_sun3): |
|
return("Sun3"); |
|
case (ARCH_vax): |
|
return("VAX"); |
|
case (ARCH_zaurus): |
|
return("Zaurus"); |
|
default: |
|
break; |
|
} |
|
|
|
return(NULL); |
man_run(p, man); |
} |
} |
|
|
|
|
static char * |
void |
vol2a(enum mdoc_vol vol) |
terminal_mdoc(void *arg, const struct mdoc *mdoc) |
{ |
{ |
|
struct termp *p; |
|
|
switch (vol) { |
p = (struct termp *)arg; |
case (VOL_AMD): |
if (NULL == p->symtab) |
return("OpenBSD Ancestral Manual Documents"); |
p->symtab = term_ascii2htab(); |
case (VOL_IND): |
|
return("OpenBSD Manual Master Index"); |
|
case (VOL_KM): |
|
return("OpenBSD Kernel Manual"); |
|
case (VOL_LOCAL): |
|
return("OpenBSD Local Manual"); |
|
case (VOL_PRM): |
|
return("OpenBSD Programmer's Manual"); |
|
case (VOL_PS1): |
|
return("OpenBSD Programmer's Supplementary Documents"); |
|
case (VOL_SMM): |
|
return("OpenBSD System Manager's Manual"); |
|
case (VOL_URM): |
|
return("OpenBSD Reference Manual"); |
|
case (VOL_USD): |
|
return("OpenBSD User's Supplementary Documents"); |
|
default: |
|
break; |
|
} |
|
|
|
return(NULL); |
mdoc_run(p, mdoc); |
} |
} |
|
|
|
|
static char * |
void |
msec2a(enum mdoc_msec msec) |
terminal_free(void *arg) |
{ |
{ |
|
|
switch (msec) { |
term_free((struct termp *)arg); |
case(MSEC_1): |
|
return("1"); |
|
case(MSEC_2): |
|
return("2"); |
|
case(MSEC_3): |
|
return("3"); |
|
case(MSEC_3f): |
|
return("3f"); |
|
case(MSEC_3p): |
|
return("3p"); |
|
case(MSEC_4): |
|
return("4"); |
|
case(MSEC_5): |
|
return("5"); |
|
case(MSEC_6): |
|
return("6"); |
|
case(MSEC_7): |
|
return("7"); |
|
case(MSEC_8): |
|
return("8"); |
|
case(MSEC_9): |
|
return("9"); |
|
case(MSEC_X11): |
|
return("X11"); |
|
case(MSEC_X11R6): |
|
return("X11R6"); |
|
case(MSEC_local): |
|
return("local"); |
|
case(MSEC_n): |
|
return("n"); |
|
case(MSEC_unass): |
|
/* FALLTHROUGH */ |
|
case(MSEC_draft): |
|
return("draft"); |
|
case(MSEC_paper): |
|
return("paper"); |
|
default: |
|
break; |
|
} |
|
return(NULL); |
|
} |
} |
|
|
|
|
static size_t |
static void |
ttitle2a(char *dst, enum mdoc_vol vol, enum mdoc_msec msec, |
term_free(struct termp *p) |
enum mdoc_arch arch, size_t sz) |
|
{ |
{ |
char *p; |
|
size_t ssz; |
|
|
|
if (NULL == (p = vol2a(vol))) |
if (p->buf) |
switch (msec) { |
free(p->buf); |
case (MSEC_1): |
if (TERMENC_ASCII == p->enc && p->symtab) |
/* FALLTHROUGH */ |
term_asciifree(p->symtab); |
case (MSEC_6): |
|
/* FALLTHROUGH */ |
free(p); |
case (MSEC_7): |
} |
p = vol2a(VOL_URM); |
|
break; |
|
case (MSEC_8): |
static struct termp * |
p = vol2a(VOL_SMM); |
term_alloc(enum termenc enc) |
break; |
{ |
case (MSEC_2): |
struct termp *p; |
/* FALLTHROUGH */ |
|
case (MSEC_3): |
if (NULL == (p = malloc(sizeof(struct termp)))) |
/* FALLTHROUGH */ |
return(NULL); |
case (MSEC_4): |
bzero(p, sizeof(struct termp)); |
/* FALLTHROUGH */ |
p->maxrmargin = 78; |
case (MSEC_5): |
p->enc = enc; |
p = vol2a(VOL_PRM); |
return(p); |
break; |
} |
case (MSEC_9): |
|
p = vol2a(VOL_KM); |
|
break; |
/* |
default: |
* Flush a line of text. A "line" is loosely defined as being something |
/* FIXME: capitalise. */ |
* that should be followed by a newline, regardless of whether it's |
if (NULL == (p = msec2a(msec))) |
* broken apart by newlines getting there. A line can also be a |
p = msec2a(MSEC_local); |
* fragment of a columnar list. |
break; |
* |
|
* 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_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. Extremely long |
|
* lines will cause the system to emit a warning (TODO: hyphenate, if |
|
* possible). |
|
*/ |
|
void |
|
term_flushln(struct termp *p) |
|
{ |
|
int i, j; |
|
size_t vbl, vsz, vis, maxvis, mmax, bp; |
|
static int overstep = 0; |
|
|
|
/* |
|
* First, establish the maximum columns of "visible" content. |
|
* This is usually the difference between the right-margin and |
|
* an indentation, but can be, for tagged lists or columns, a |
|
* small set of values. |
|
*/ |
|
|
|
assert(p->offset < p->rmargin); |
|
assert((int)(p->rmargin - p->offset) - overstep > 0); |
|
|
|
maxvis = /* LINTED */ |
|
p->rmargin - p->offset - overstep; |
|
mmax = /* LINTED */ |
|
p->maxrmargin - p->offset - overstep; |
|
|
|
bp = TERMP_NOBREAK & p->flags ? mmax : maxvis; |
|
vis = 0; |
|
overstep = 0; |
|
|
|
/* |
|
* If in the standard case (left-justified), then begin with our |
|
* indentation, otherwise (columns, etc.) just start spitting |
|
* out text. |
|
*/ |
|
|
|
if ( ! (p->flags & TERMP_NOLPAD)) |
|
/* LINTED */ |
|
for (j = 0; j < (int)p->offset; j++) |
|
putchar(' '); |
|
|
|
for (i = 0; i < (int)p->col; i++) { |
|
/* |
|
* Count up visible word characters. Control sequences |
|
* (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). |
|
*/ |
|
|
|
/* LINTED */ |
|
for (j = i, vsz = 0; j < (int)p->col; j++) { |
|
if (j && ' ' == p->buf[j]) |
|
break; |
|
else if (8 == p->buf[j]) |
|
vsz--; |
|
else |
|
vsz++; |
} |
} |
assert(p); |
|
|
|
if ((ssz = strlcpy(dst, p, sz)) >= sz) |
/* |
return(ssz); |
* 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); |
|
|
if ((p = arch2a(arch))) { |
/* |
if ((ssz = strlcat(dst, " (", sz)) >= sz) |
* Find out whether we would exceed the right margin. |
return(ssz); |
* If so, break to the next line. (TODO: hyphenate) |
if ((ssz = strlcat(dst, p, sz)) >= sz) |
* Otherwise, write the chosen number of blanks now. |
return(ssz); |
*/ |
if ((ssz = strlcat(dst, ")", sz)) >= sz) |
if (vis && vis + vbl + vsz > bp) { |
return(ssz); |
putchar('\n'); |
|
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(' '); |
|
vis += vbl; |
|
} |
|
|
|
/* |
|
* Finally, write out the word. |
|
*/ |
|
for ( ; i < (int)p->col; i++) { |
|
if (' ' == p->buf[i]) |
|
break; |
|
putchar(p->buf[i]); |
|
} |
|
vis += vsz; |
} |
} |
|
p->col = 0; |
|
|
return(ssz); |
if ( ! (TERMP_NOBREAK & p->flags)) { |
|
putchar('\n'); |
|
return; |
|
} |
|
|
|
if (TERMP_HANG & p->flags) { |
|
/* We need one blank after the tag. */ |
|
overstep = /* LINTED */ |
|
vis - maxvis + 1; |
|
|
|
/* |
|
* 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 (overstep >= -1) { |
|
assert((int)maxvis + overstep >= 0); |
|
/* LINTED */ |
|
maxvis += overstep; |
|
} else |
|
overstep = 0; |
|
|
|
} else if (TERMP_DANGLE & p->flags) |
|
return; |
|
|
|
/* Right-pad. */ |
|
if (maxvis > vis + /* LINTED */ |
|
((TERMP_TWOSPACE & p->flags) ? 1 : 0)) |
|
for ( ; vis < maxvis; vis++) |
|
putchar(' '); |
|
else { /* ...or newline break. */ |
|
putchar('\n'); |
|
for (i = 0; i < (int)p->rmargin; i++) |
|
putchar(' '); |
|
} |
} |
} |
|
|
|
|
static int |
/* |
termprint_r(size_t cols, size_t indent, const struct mdoc_node *node) |
* 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) |
{ |
{ |
|
|
return(1); |
p->flags |= TERMP_NOSPACE; |
|
if (0 == p->col) { |
|
p->flags &= ~TERMP_NOLPAD; |
|
return; |
|
} |
|
term_flushln(p); |
|
p->flags &= ~TERMP_NOLPAD; |
} |
} |
|
|
|
|
static void |
/* |
termprint_tail(size_t cols, const struct mdoc_meta *meta) |
* 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) |
{ |
{ |
struct tm *tm; |
|
char *buf, *os; |
|
size_t sz, osz, ssz, i; |
|
|
|
if (NULL == (buf = malloc(cols))) |
term_newln(p); |
err(1, "malloc"); |
putchar('\n'); |
if (NULL == (os = malloc(cols))) |
} |
err(1, "malloc"); |
|
|
|
tm = localtime(&meta->date); |
|
if (NULL == strftime(buf, cols, "%B %d, %Y", tm)) |
|
err(1, "strftime"); |
|
|
|
osz = strlcpy(os, meta->os, cols); |
static void |
|
do_special(struct termp *p, const char *word, size_t len) |
|
{ |
|
const char *rhs; |
|
size_t sz; |
|
int i; |
|
|
sz = strlen(buf); |
rhs = term_a2ascii(p->symtab, word, len, &sz); |
ssz = sz + osz + 1; |
|
|
|
if (ssz > cols) { |
if (NULL == rhs) { |
ssz -= cols; |
#if 0 |
assert(ssz <= osz); |
fputs("Unknown special character: ", stderr); |
os[osz - ssz] = 0; |
for (i = 0; i < (int)len; i++) |
ssz = 1; |
fputc(word[i], stderr); |
} else |
fputc('\n', stderr); |
ssz = cols - ssz + 1; |
#endif |
|
return; |
|
} |
|
for (i = 0; i < (int)sz; i++) |
|
encode(p, rhs[i]); |
|
} |
|
|
printf("%s", os); |
|
for (i = 0; i < ssz; i++) |
|
printf(" "); |
|
|
|
printf("%s\n", buf); |
static void |
|
do_reserved(struct termp *p, const char *word, size_t len) |
|
{ |
|
const char *rhs; |
|
size_t sz; |
|
int i; |
|
|
free(buf); |
rhs = term_a2res(p->symtab, word, len, &sz); |
free(os); |
|
|
if (NULL == rhs) { |
|
#if 0 |
|
fputs("Unknown reserved word: ", stderr); |
|
for (i = 0; i < (int)len; i++) |
|
fputc(word[i], stderr); |
|
fputc('\n', stderr); |
|
#endif |
|
return; |
|
} |
|
for (i = 0; i < (int)sz; i++) |
|
encode(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 |
termprint_head(size_t cols, const struct mdoc_meta *meta) |
do_escaped(struct termp *p, const char **word) |
{ |
{ |
char *msec, *buf, *title; |
int j, type; |
size_t ssz, tsz, ttsz, i; |
const char *wp; |
|
|
if (NULL == (buf = malloc(cols))) |
wp = *word; |
err(1, "malloc"); |
type = 1; |
if (NULL == (title = malloc(cols))) |
|
err(1, "malloc"); |
|
|
|
/* Format the manual page header. */ |
if (0 == *(++wp)) { |
|
*word = wp; |
|
return; |
|
} |
|
|
tsz = ttitle2a(buf, meta->vol, meta->msec, meta->arch, cols); |
if ('(' == *wp) { |
ttsz = strlcpy(title, meta->title, cols); |
wp++; |
|
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
|
return; |
|
} |
|
|
if (NULL == (msec = msec2a(meta->msec))) |
do_special(p, wp, 2); |
msec = ""; |
*word = ++wp; |
|
return; |
|
|
ssz = (2 * (ttsz + 2 + strlen(msec))) + tsz + 2; |
} else if ('*' == *wp) { |
|
if (0 == *(++wp)) { |
|
*word = wp; |
|
return; |
|
} |
|
|
if (ssz > cols) { |
switch (*wp) { |
if ((ssz -= cols) % 2) |
case ('('): |
ssz++; |
wp++; |
ssz /= 2; |
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
|
return; |
|
} |
|
|
|
do_reserved(p, wp, 2); |
|
*word = ++wp; |
|
return; |
|
case ('['): |
|
type = 0; |
|
break; |
|
default: |
|
do_reserved(p, wp, 1); |
|
*word = wp; |
|
return; |
|
} |
|
|
assert(ssz <= ttsz); |
} else if ('f' == *wp) { |
title[ttsz - ssz] = 0; |
if (0 == *(++wp)) { |
ssz = 1; |
*word = wp; |
} else |
return; |
ssz = ((cols - ssz) / 2) + 1; |
} |
|
|
printf("%s(%s)", title, msec); |
switch (*wp) { |
|
case ('B'): |
|
p->bold++; |
|
break; |
|
case ('I'): |
|
p->under++; |
|
break; |
|
case ('P'): |
|
/* FALLTHROUGH */ |
|
case ('R'): |
|
p->bold = p->under = 0; |
|
break; |
|
default: |
|
break; |
|
} |
|
|
for (i = 0; i < ssz; i++) |
*word = wp; |
printf(" "); |
return; |
|
|
printf("%s", buf); |
} else if ('[' != *wp) { |
|
do_special(p, wp, 1); |
|
*word = wp; |
|
return; |
|
} |
|
|
for (i = 0; i < ssz; i++) |
wp++; |
printf(" "); |
for (j = 0; *wp && ']' != *wp; wp++, j++) |
|
/* Loop... */ ; |
|
|
printf("%s(%s)\n\n", title, msec); |
if (0 == *wp) { |
|
*word = wp; |
|
return; |
|
} |
|
|
free(title); |
if (type) |
free(buf); |
do_special(p, wp - j, (size_t)j); |
|
else |
|
do_reserved(p, wp - j, (size_t)j); |
|
*word = wp; |
} |
} |
|
|
|
|
int |
/* |
termprint(const struct mdoc_node *node, |
* Handle pwords, partial words, which may be either a single word or a |
const struct mdoc_meta *meta) |
* phrase that cannot be broken down (such as a literal string). This |
|
* handles word styling. |
|
*/ |
|
void |
|
term_word(struct termp *p, const char *word) |
{ |
{ |
size_t cols; |
const char *sv; |
|
|
if (ERR == setupterm(NULL, STDOUT_FILENO, NULL)) |
sv = word; |
return(0); |
|
|
|
cols = columns < 60 ? 60 : (size_t)columns; |
if (word[0] && 0 == word[1]) |
|
switch (word[0]) { |
|
case('.'): |
|
/* FALLTHROUGH */ |
|
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; |
|
} |
|
|
termprint_head(cols, meta); |
if ( ! (TERMP_NOSPACE & p->flags)) |
if ( ! termprint_r(cols, 0, node)) |
buffer(p, ' '); |
return(0); |
|
termprint_tail(cols, meta); |
if ( ! (p->flags & TERMP_NONOSPACE)) |
return(1); |
p->flags &= ~TERMP_NOSPACE; |
|
|
|
for ( ; *word; word++) |
|
if ('\\' != *word) |
|
encode(p, *word); |
|
else |
|
do_escaped(p, &word); |
|
|
|
if (sv[0] && 0 == sv[1]) |
|
switch (sv[0]) { |
|
case('('): |
|
/* FALLTHROUGH */ |
|
case('['): |
|
/* FALLTHROUGH */ |
|
case('{'): |
|
p->flags |= TERMP_NOSPACE; |
|
break; |
|
default: |
|
break; |
|
} |
} |
} |
|
|
|
|
|
/* |
|
* Insert a single character into the line-buffer. If the buffer's |
|
* space is exceeded, then allocate more space by doubling the buffer |
|
* size. |
|
*/ |
|
static void |
|
buffer(struct termp *p, char c) |
|
{ |
|
size_t s; |
|
|
|
if (p->col + 1 >= p->maxcols) { |
|
if (0 == p->maxcols) |
|
p->maxcols = 256; |
|
s = p->maxcols * 2; |
|
p->buf = realloc(p->buf, s); |
|
if (NULL == p->buf) |
|
err(1, "realloc"); /* FIXME: shouldn't be here! */ |
|
p->maxcols = s; |
|
} |
|
p->buf[(int)(p->col)++] = c; |
|
} |
|
|
|
|
|
static void |
|
encode(struct termp *p, char c) |
|
{ |
|
|
|
if (' ' != c) { |
|
if (p->bold) { |
|
buffer(p, c); |
|
buffer(p, 8); |
|
} |
|
if (p->under) { |
|
buffer(p, '_'); |
|
buffer(p, 8); |
|
} |
|
} |
|
buffer(p, c); |
|
} |