version 1.84, 2009/07/14 15:16:41 |
version 1.86, 2009/07/15 15:37:48 |
Line 31 extern int mdoc_run(struct termp *, |
|
Line 31 extern int mdoc_run(struct termp *, |
|
|
|
static struct termp *term_alloc(enum termenc); |
static struct termp *term_alloc(enum termenc); |
static void term_free(struct termp *); |
static void term_free(struct termp *); |
static void term_pword(struct termp *, const char *, int); |
static void term_pescape(struct termp *, const char **); |
static void term_pescape(struct termp *, |
|
const char *, int *, int); |
|
static void term_nescape(struct termp *, |
static void term_nescape(struct termp *, |
const char *, size_t); |
const char *, size_t); |
static void term_chara(struct termp *, char); |
static void term_chara(struct termp *, char); |
static void term_encodea(struct termp *, char); |
static void term_encodea(struct termp *, char); |
static int term_isopendelim(const char *, int); |
static int term_isopendelim(const char *); |
static int term_isclosedelim(const char *, int); |
static int term_isclosedelim(const char *); |
|
|
|
|
void * |
void * |
Line 112 term_alloc(enum termenc enc) |
|
Line 110 term_alloc(enum termenc enc) |
|
|
|
|
|
static int |
static int |
term_isclosedelim(const char *p, int len) |
term_isclosedelim(const char *p) |
{ |
{ |
|
|
if (1 != len) |
if ( ! (*p && 0 == *(p + 1))) |
return(0); |
return(0); |
|
|
switch (*p) { |
switch (*p) { |
Line 146 term_isclosedelim(const char *p, int len) |
|
Line 144 term_isclosedelim(const char *p, int len) |
|
|
|
|
|
static int |
static int |
term_isopendelim(const char *p, int len) |
term_isopendelim(const char *p) |
{ |
{ |
|
|
if (1 != len) |
if ( ! (*p && 0 == *(p + 1))) |
return(0); |
return(0); |
|
|
switch (*p) { |
switch (*p) { |
Line 315 term_flushln(struct termp *p) |
|
Line 313 term_flushln(struct termp *p) |
|
putchar(' '); |
putchar(' '); |
} |
} |
if (TERMP_HANG & p->flags) |
if (TERMP_HANG & p->flags) |
sv = vis - maxvis; |
sv = (int)(vis - maxvis); |
p->col = 0; |
p->col = 0; |
return; |
return; |
} |
} |
Line 371 term_vspace(struct termp *p) |
|
Line 369 term_vspace(struct termp *p) |
|
|
|
|
|
/* |
/* |
* Break apart a word into "pwords" (partial-words, usually from |
|
* breaking up a phrase into individual words) and, eventually, put them |
|
* into the output buffer. If we're a literal word, then don't break up |
|
* the word and put it verbatim into the output buffer. |
|
*/ |
|
void |
|
term_word(struct termp *p, const char *word) |
|
{ |
|
int i, j, len; |
|
|
|
len = (int)strlen(word); |
|
|
|
if (p->flags & TERMP_LITERAL) { |
|
term_pword(p, word, len); |
|
return; |
|
} |
|
|
|
/* LINTED */ |
|
for (j = i = 0; i < len; i++) { |
|
if (' ' != word[i]) { |
|
j++; |
|
continue; |
|
} |
|
|
|
/* Escaped spaces don't delimit... */ |
|
if (i && ' ' == word[i] && '\\' == word[i - 1]) { |
|
j++; |
|
continue; |
|
} |
|
|
|
if (0 == j) |
|
continue; |
|
assert(i >= j); |
|
term_pword(p, &word[i - j], j); |
|
j = 0; |
|
} |
|
if (j > 0) { |
|
assert(i >= j); |
|
term_pword(p, &word[i - j], j); |
|
} |
|
} |
|
|
|
|
|
/* |
|
* Determine the symbol indicated by an escape sequences, that is, one |
* Determine the symbol indicated by an escape sequences, that is, one |
* starting with a backslash. Once done, we pass this value into the |
* starting with a backslash. Once done, we pass this value into the |
* output buffer by way of the symbol table. |
* output buffer by way of the symbol table. |
Line 427 term_nescape(struct termp *p, const char *word, size_t |
|
Line 381 term_nescape(struct termp *p, const char *word, size_t |
|
int i; |
int i; |
|
|
rhs = term_a2ascii(p->symtab, word, len, &sz); |
rhs = term_a2ascii(p->symtab, word, len, &sz); |
|
|
if (rhs) |
if (rhs) |
for (i = 0; i < (int)sz; i++) |
for (i = 0; i < (int)sz; i++) |
term_encodea(p, rhs[i]); |
term_encodea(p, rhs[i]); |
Line 439 term_nescape(struct termp *p, const char *word, size_t |
|
Line 394 term_nescape(struct termp *p, const char *word, size_t |
|
* the escape sequence (we assert upon badly-formed escape sequences). |
* the escape sequence (we assert upon badly-formed escape sequences). |
*/ |
*/ |
static void |
static void |
term_pescape(struct termp *p, const char *word, int *i, int len) |
term_pescape(struct termp *p, const char **word) |
{ |
{ |
int j; |
int j; |
|
const char *wp; |
|
|
if (++(*i) >= len) |
wp = *word; |
|
|
|
if (0 == *(++wp)) { |
|
*word = wp; |
return; |
return; |
|
} |
|
|
if ('(' == word[*i]) { |
if ('(' == *wp) { |
(*i)++; |
wp++; |
if (*i + 1 >= len) |
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
return; |
return; |
|
} |
|
|
term_nescape(p, &word[*i], 2); |
term_nescape(p, wp, 2); |
(*i)++; |
*word = ++wp; |
return; |
return; |
|
|
} else if ('*' == word[*i]) { |
} else if ('*' == *wp) { |
(*i)++; |
if (0 == *(++wp)) { |
if (*i >= len) |
*word = wp; |
return; |
return; |
|
} |
|
|
switch (word[*i]) { |
switch (*wp) { |
case ('('): |
case ('('): |
(*i)++; |
wp++; |
if (*i + 1 >= len) |
if (0 == *wp || 0 == *(wp + 1)) { |
|
*word = 0 == *wp ? wp : wp + 1; |
return; |
return; |
|
} |
|
|
term_nescape(p, &word[*i], 2); |
term_nescape(p, wp, 2); |
(*i)++; |
*word = ++wp; |
return; |
return; |
case ('['): |
case ('['): |
break; |
break; |
default: |
default: |
term_nescape(p, &word[*i], 1); |
term_nescape(p, wp, 1); |
|
*word = wp; |
return; |
return; |
} |
} |
|
|
} else if ('f' == word[*i]) { |
} else if ('f' == *wp) { |
(*i)++; |
if (0 == *(++wp)) { |
if (*i >= len) |
*word = wp; |
return; |
return; |
switch (word[*i]) { |
} |
|
|
|
switch (*wp) { |
case ('B'): |
case ('B'): |
p->flags |= TERMP_BOLD; |
p->flags |= TERMP_BOLD; |
break; |
break; |
Line 495 term_pescape(struct termp *p, const char *word, int *i |
|
Line 463 term_pescape(struct termp *p, const char *word, int *i |
|
default: |
default: |
break; |
break; |
} |
} |
|
|
|
*word = wp; |
return; |
return; |
|
|
} else if ('[' != word[*i]) { |
} else if ('[' != *wp) { |
term_nescape(p, &word[*i], 1); |
term_nescape(p, wp, 1); |
|
*word = wp; |
return; |
return; |
} |
} |
|
|
(*i)++; |
wp++; |
for (j = 0; word[*i] && ']' != word[*i]; (*i)++, j++) |
for (j = 0; *wp && ']' != *wp; wp++, j++) |
/* Loop... */ ; |
/* Loop... */ ; |
|
|
if (0 == word[*i]) |
if (0 == *wp) { |
|
*word = wp; |
return; |
return; |
|
} |
|
|
term_nescape(p, &word[*i - j], (size_t)j); |
term_nescape(p, wp - j, (size_t)j); |
|
*word = wp; |
} |
} |
|
|
|
|
Line 518 term_pescape(struct termp *p, const char *word, int *i |
|
Line 492 term_pescape(struct termp *p, const char *word, int *i |
|
* phrase that cannot be broken down (such as a literal string). This |
* phrase that cannot be broken down (such as a literal string). This |
* handles word styling. |
* handles word styling. |
*/ |
*/ |
static void |
void |
term_pword(struct termp *p, const char *word, int len) |
term_word(struct termp *p, const char *word) |
{ |
{ |
int i; |
|
|
|
if (term_isclosedelim(word, len)) |
assert(*word); |
|
if (term_isclosedelim(word)) |
if ( ! (TERMP_IGNDELIM & p->flags)) |
if ( ! (TERMP_IGNDELIM & p->flags)) |
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
|
|
Line 538 term_pword(struct termp *p, const char *word, int len) |
|
Line 512 term_pword(struct termp *p, const char *word, int len) |
|
* before the word. |
* before the word. |
*/ |
*/ |
|
|
for (i = 0; i < len; i++) |
for ( ; *word; word++) |
if ('\\' == word[i]) |
if ('\\' != *word) |
term_pescape(p, word, &i, len); |
term_encodea(p, *word); |
else |
else |
term_encodea(p, word[i]); |
term_pescape(p, &word); |
|
|
if (term_isopendelim(word, len)) |
if (term_isopendelim(word)) |
p->flags |= TERMP_NOSPACE; |
p->flags |= TERMP_NOSPACE; |
} |
} |
|
|