version 1.137, 2010/05/17 22:11:42 |
version 1.161, 2010/07/16 22:33:30 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2008, 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2010 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 above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.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 <time.h> |
|
|
|
#include "mandoc.h" |
#include "mandoc.h" |
#include "chars.h" |
#include "chars.h" |
#include "out.h" |
#include "out.h" |
#include "term.h" |
#include "term.h" |
#include "man.h" |
|
#include "mdoc.h" |
|
#include "main.h" |
#include "main.h" |
|
|
static struct termp *term_alloc(enum termenc, size_t); |
|
static void term_free(struct termp *); |
|
static void spec(struct termp *, const char *, size_t); |
static void spec(struct termp *, const char *, size_t); |
static void res(struct termp *, const char *, size_t); |
static void res(struct termp *, const char *, size_t); |
static void buffera(struct termp *, const char *, size_t); |
static void buffera(struct termp *, const char *, size_t); |
Line 45 static void adjbuf(struct termp *p, size_t); |
|
Line 42 static void adjbuf(struct termp *p, size_t); |
|
static void encode(struct termp *, const char *, size_t); |
static void encode(struct termp *, const char *, size_t); |
|
|
|
|
void * |
void |
ascii_alloc(size_t width) |
term_free(struct termp *p) |
{ |
{ |
|
|
return(term_alloc(TERMENC_ASCII, width)); |
if (p->buf) |
|
free(p->buf); |
|
if (p->symtab) |
|
chars_free(p->symtab); |
|
|
|
free(p); |
} |
} |
|
|
|
|
void |
void |
terminal_free(void *arg) |
term_begin(struct termp *p, term_margin head, |
|
term_margin foot, const void *arg) |
{ |
{ |
|
|
term_free((struct termp *)arg); |
p->headf = head; |
|
p->footf = foot; |
|
p->argf = arg; |
|
(*p->begin)(p); |
} |
} |
|
|
|
|
static void |
void |
term_free(struct termp *p) |
term_end(struct termp *p) |
{ |
{ |
|
|
if (p->buf) |
(*p->end)(p); |
free(p->buf); |
|
if (p->symtab) |
|
chars_free(p->symtab); |
|
|
|
free(p); |
|
} |
} |
|
|
|
|
static struct termp * |
struct termp * |
term_alloc(enum termenc enc, size_t width) |
term_alloc(enum termenc enc) |
{ |
{ |
struct termp *p; |
struct termp *p; |
|
|
p = calloc(1, sizeof(struct termp)); |
p = calloc(1, sizeof(struct termp)); |
if (NULL == p) { |
if (NULL == p) { |
perror(NULL); |
perror(NULL); |
exit(EXIT_FAILURE); |
exit(EXIT_FAILURE); |
} |
} |
|
|
p->enc = enc; |
p->enc = enc; |
/* Enforce some lower boundary. */ |
|
if (width < 60) |
|
width = 60; |
|
p->defrmargin = width - 2; |
|
return(p); |
return(p); |
} |
} |
|
|
Line 136 term_flushln(struct termp *p) |
|
Line 134 term_flushln(struct termp *p) |
|
size_t vbl; /* number of blanks to prepend to output */ |
size_t vbl; /* number of blanks to prepend to output */ |
size_t vend; /* end of word visual position on output */ |
size_t vend; /* end of word visual position on output */ |
size_t bp; /* visual right border position */ |
size_t bp; /* visual right border position */ |
int j; /* temporary loop index */ |
int j; /* temporary loop index for p->buf */ |
size_t maxvis, mmax; |
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. |
Line 162 term_flushln(struct termp *p) |
|
Line 162 term_flushln(struct termp *p) |
|
*/ |
*/ |
vbl = p->flags & TERMP_NOLPAD ? 0 : p->offset; |
vbl = p->flags & TERMP_NOLPAD ? 0 : p->offset; |
|
|
/* |
|
* FIXME: if bp is zero, we still output the first word before |
|
* breaking the line. |
|
*/ |
|
|
|
vis = vend = i = 0; |
vis = vend = i = 0; |
|
|
while (i < (int)p->col) { |
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 |
Line 178 term_flushln(struct termp *p) |
|
Line 185 term_flushln(struct termp *p) |
|
*/ |
*/ |
|
|
/* LINTED */ |
/* LINTED */ |
for (j = i; 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; |
if (8 == p->buf[j]) |
|
vend--; |
/* Back over the the last printed character. */ |
else |
if (8 == p->buf[j]) { |
vend++; |
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]); |
} |
} |
|
|
/* |
/* |
* 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. |
* If so, break to the next line. |
*/ |
*/ |
if (vend > bp && vis > 0) { |
if (vend > bp && 0 == jhy && vis > 0) { |
vend -= vis; |
vend -= vis; |
putchar('\n'); |
(*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); |
vend += p->rmargin - p->offset; |
vend += p->rmargin - p->offset; |
} else { |
} else { |
|
p->viscol = 0; |
vbl = p->offset; |
vbl = p->offset; |
} |
} |
|
|
Line 209 term_flushln(struct termp *p) |
|
Line 228 term_flushln(struct termp *p) |
|
p->overstep = 0; |
p->overstep = 0; |
} |
} |
|
|
|
/* |
|
* Skip leading tabs, they were handled above. |
|
*/ |
|
while (i < (int)p->col && '\t' == p->buf[i]) |
|
i++; |
|
|
/* Write out the [remaining] word. */ |
/* Write out the [remaining] word. */ |
for ( ; i < (int)p->col; i++) { |
for ( ; i < (int)p->col; i++) { |
|
if (vend > bp && jhy > 0 && i > jhy) |
|
break; |
|
if ('\t' == p->buf[i]) |
|
break; |
if (' ' == p->buf[i]) { |
if (' ' == p->buf[i]) { |
while (' ' == p->buf[i]) { |
while (' ' == p->buf[i]) { |
vbl++; |
vbl += (*p->width)(p, p->buf[i]); |
i++; |
i++; |
} |
} |
break; |
break; |
} |
} |
if (ASCII_NBRSP == p->buf[i]) { |
if (ASCII_NBRSP == p->buf[i]) { |
vbl++; |
vbl += (*p->width)(p, ' '); |
continue; |
continue; |
} |
} |
|
|
Line 229 term_flushln(struct termp *p) |
|
Line 258 term_flushln(struct termp *p) |
|
* so write preceding white space now. |
* so write preceding white space now. |
*/ |
*/ |
if (vbl) { |
if (vbl) { |
for (j = 0; j < (int)vbl; j++) |
(*p->advance)(p, vbl); |
putchar(' '); |
p->viscol += vbl; |
vbl = 0; |
vbl = 0; |
} |
} |
putchar(p->buf[i]); |
|
|
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]); |
|
} |
} |
} |
vend += vbl; |
vend += vbl; |
vis = vend; |
vis = vend; |
Line 243 term_flushln(struct termp *p) |
|
Line 279 term_flushln(struct termp *p) |
|
p->overstep = 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. */ |
p->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 274 term_flushln(struct termp *p) |
|
Line 311 term_flushln(struct termp *p) |
|
|
|
/* 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 295 term_newln(struct termp *p) |
|
Line 334 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 315 term_vspace(struct termp *p) |
|
Line 354 term_vspace(struct termp *p) |
|
{ |
{ |
|
|
term_newln(p); |
term_newln(p); |
putchar('\n'); |
p->viscol = 0; |
|
(*p->endline)(p); |
} |
} |
|
|
|
|
Line 325 spec(struct termp *p, const char *word, size_t len) |
|
Line 365 spec(struct termp *p, const char *word, size_t len) |
|
const char *rhs; |
const char *rhs; |
size_t sz; |
size_t sz; |
|
|
rhs = chars_a2ascii(p->symtab, word, len, &sz); |
rhs = chars_spec2str(p->symtab, word, len, &sz); |
if (rhs) |
if (rhs) |
encode(p, rhs, sz); |
encode(p, rhs, sz); |
} |
} |
Line 337 res(struct termp *p, const char *word, size_t len) |
|
Line 377 res(struct termp *p, const char *word, size_t len) |
|
const char *rhs; |
const char *rhs; |
size_t sz; |
size_t sz; |
|
|
rhs = chars_a2res(p->symtab, word, len, &sz); |
rhs = chars_res2str(p->symtab, word, len, &sz); |
if (rhs) |
if (rhs) |
encode(p, rhs, sz); |
encode(p, rhs, sz); |
} |
} |
Line 448 term_word(struct termp *p, const char *word) |
|
Line 488 term_word(struct termp *p, const char *word) |
|
} |
} |
|
|
if ( ! (TERMP_NOSPACE & p->flags)) { |
if ( ! (TERMP_NOSPACE & p->flags)) { |
bufferc(p, ' '); |
if ( ! (TERMP_KEEP & p->flags)) { |
if (TERMP_SENTENCE & p->flags) |
if (TERMP_PREKEEP & p->flags) |
|
p->flags |= TERMP_KEEP; |
bufferc(p, ' '); |
bufferc(p, ' '); |
|
if (TERMP_SENTENCE & p->flags) |
|
bufferc(p, ' '); |
|
} else |
|
bufferc(p, ASCII_NBRSP); |
} |
} |
|
|
if ( ! (p->flags & TERMP_NONOSPACE)) |
if ( ! (p->flags & TERMP_NONOSPACE)) |
Line 590 encode(struct termp *p, const char *word, size_t sz) |
|
Line 635 encode(struct termp *p, const char *word, size_t sz) |
|
|
|
|
|
size_t |
size_t |
term_vspan(const struct roffsu *su) |
term_len(const struct termp *p, size_t sz) |
{ |
{ |
|
|
|
return((*p->width)(p, ' ') * sz); |
|
} |
|
|
|
|
|
size_t |
|
term_strlen(const struct termp *p, const char *cp) |
|
{ |
|
size_t sz; |
|
|
|
for (sz = 0; *cp; cp++) |
|
sz += (*p->width)(p, *cp); |
|
|
|
return(sz); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
size_t |
|
term_vspan(const struct termp *p, const struct roffsu *su) |
|
{ |
double r; |
double r; |
|
|
switch (su->unit) { |
switch (su->unit) { |
Line 626 term_vspan(const struct roffsu *su) |
|
Line 692 term_vspan(const struct roffsu *su) |
|
|
|
|
|
size_t |
size_t |
term_hspan(const struct roffsu *su) |
term_hspan(const struct termp *p, const struct roffsu *su) |
{ |
{ |
double r; |
double v; |
|
|
/* XXX: CM, IN, and PT are approximations. */ |
v = ((*p->hspan)(p, su)); |
|
if (v < 0.0) |
switch (su->unit) { |
v = 0.0; |
case (SCALE_CM): |
return((size_t) /* LINTED */ |
r = 4 * su->scale; |
v); |
break; |
|
case (SCALE_IN): |
|
/* XXX: this is an approximation. */ |
|
r = 10 * su->scale; |
|
break; |
|
case (SCALE_PC): |
|
r = (10 * su->scale) / 6; |
|
break; |
|
case (SCALE_PT): |
|
r = (10 * su->scale) / 72; |
|
break; |
|
case (SCALE_MM): |
|
r = su->scale / 1000; /* FIXME: double-check. */ |
|
break; |
|
case (SCALE_VS): |
|
r = su->scale * 2 - 1; /* FIXME: double-check. */ |
|
break; |
|
default: |
|
r = su->scale; |
|
break; |
|
} |
|
|
|
if (r < 0.0) |
|
r = 0.0; |
|
return((size_t)/* LINTED */ |
|
r); |
|
} |
} |
|
|
|
|