version 1.3, 2010/12/28 13:46:07 |
version 1.24, 2011/03/22 09:48:13 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2009, 2010 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2011 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 <time.h> |
#include <time.h> |
|
|
#include "mandoc.h" |
#include "mandoc.h" |
#include "roff.h" |
|
#include "libmandoc.h" |
#include "libmandoc.h" |
#include "libroff.h" |
#include "libroff.h" |
|
|
static const char tbl_toks[TBL_TOK__MAX] = { |
|
'(', ')', ',', ';', '.', |
|
' ', '\t', '\0' |
|
}; |
|
|
|
static void tbl_init(struct tbl *); |
|
static void tbl_clear(struct tbl *); |
|
static enum tbl_tok tbl_next_char(char); |
|
|
|
static void |
|
tbl_clear(struct tbl *tbl) |
|
{ |
|
|
|
} |
|
|
|
static void |
|
tbl_init(struct tbl *tbl) |
|
{ |
|
|
|
tbl->part = TBL_PART_OPTS; |
|
} |
|
|
|
enum rofferr |
enum rofferr |
tbl_read(struct tbl *tbl, int ln, const char *p, int offs) |
tbl_read(struct tbl_node *tbl, int ln, const char *p, int offs) |
{ |
{ |
int len; |
int len; |
const char *cp; |
const char *cp; |
Line 56 tbl_read(struct tbl *tbl, int ln, const char *p, int o |
|
Line 34 tbl_read(struct tbl *tbl, int ln, const char *p, int o |
|
cp = &p[offs]; |
cp = &p[offs]; |
len = (int)strlen(cp); |
len = (int)strlen(cp); |
|
|
if (len && TBL_PART_OPTS == tbl->part) |
/* |
|
* If we're in the options section and we don't have a |
|
* terminating semicolon, assume we've moved directly into the |
|
* layout section. No need to report a warning: this is, |
|
* apparently, standard behaviour. |
|
*/ |
|
|
|
if (TBL_PART_OPTS == tbl->part && len) |
if (';' != cp[len - 1]) |
if (';' != cp[len - 1]) |
tbl->part = TBL_PART_LAYOUT; |
tbl->part = TBL_PART_LAYOUT; |
|
|
return(ROFF_CONT); |
/* Now process each logical section of the table. */ |
|
|
|
switch (tbl->part) { |
|
case (TBL_PART_OPTS): |
|
return(tbl_option(tbl, ln, p) ? ROFF_IGN : ROFF_ERR); |
|
case (TBL_PART_LAYOUT): |
|
return(tbl_layout(tbl, ln, p) ? ROFF_IGN : ROFF_ERR); |
|
case (TBL_PART_CDATA): |
|
return(tbl_cdata(tbl, ln, p) ? ROFF_TBL : ROFF_IGN); |
|
default: |
|
break; |
|
} |
|
|
|
/* |
|
* This only returns zero if the line is empty, so we ignore it |
|
* and continue on. |
|
*/ |
|
return(tbl_data(tbl, ln, p) ? ROFF_TBL : ROFF_IGN); |
} |
} |
|
|
struct tbl * |
struct tbl_node * |
tbl_alloc(void) |
tbl_alloc(int pos, int line, struct mparse *parse) |
{ |
{ |
struct tbl *p; |
struct tbl_node *p; |
|
|
p = mandoc_malloc(sizeof(struct tbl)); |
p = mandoc_calloc(1, sizeof(struct tbl_node)); |
tbl_init(p); |
p->line = line; |
|
p->pos = pos; |
|
p->parse = parse; |
|
p->part = TBL_PART_OPTS; |
|
p->opts.tab = '\t'; |
|
p->opts.linesize = 12; |
|
p->opts.decimal = '.'; |
return(p); |
return(p); |
} |
} |
|
|
void |
void |
tbl_free(struct tbl *p) |
tbl_free(struct tbl_node *p) |
{ |
{ |
|
struct tbl_row *rp; |
|
struct tbl_cell *cp; |
|
struct tbl_span *sp; |
|
struct tbl_dat *dp; |
|
struct tbl_head *hp; |
|
|
tbl_clear(p); |
while (NULL != (rp = p->first_row)) { |
|
p->first_row = rp->next; |
|
while (rp->first) { |
|
cp = rp->first; |
|
rp->first = cp->next; |
|
free(cp); |
|
} |
|
free(rp); |
|
} |
|
|
|
while (NULL != (sp = p->first_span)) { |
|
p->first_span = sp->next; |
|
while (sp->first) { |
|
dp = sp->first; |
|
sp->first = dp->next; |
|
if (dp->string) |
|
free(dp->string); |
|
free(dp); |
|
} |
|
free(sp); |
|
} |
|
|
|
while (NULL != (hp = p->first_head)) { |
|
p->first_head = hp->next; |
|
free(hp); |
|
} |
|
|
free(p); |
free(p); |
} |
} |
|
|
void |
void |
tbl_reset(struct tbl *tbl) |
tbl_restart(int line, int pos, struct tbl_node *tbl) |
{ |
{ |
|
if (TBL_PART_CDATA == tbl->part) |
|
mandoc_msg(MANDOCERR_TBLBLOCK, tbl->parse, |
|
tbl->line, tbl->pos, NULL); |
|
|
tbl_clear(tbl); |
tbl->part = TBL_PART_LAYOUT; |
tbl_init(tbl); |
tbl->line = line; |
|
tbl->pos = pos; |
|
|
|
if (NULL == tbl->first_span || NULL == tbl->first_span->first) |
|
mandoc_msg(MANDOCERR_TBLNODATA, tbl->parse, |
|
tbl->line, tbl->pos, NULL); |
} |
} |
|
|
static enum tbl_tok |
const struct tbl_span * |
tbl_next_char(char c) |
tbl_span(struct tbl_node *tbl) |
{ |
{ |
int i; |
struct tbl_span *span; |
|
|
/* |
assert(tbl); |
* These are delimiting tokens. They separate out words in the |
span = tbl->current_span ? tbl->current_span->next |
* token stream. |
: tbl->first_span; |
* |
if (span) |
* FIXME: make this into a hashtable for faster lookup. |
tbl->current_span = span; |
*/ |
return(span); |
for (i = 0; i < TBL_TOK__MAX; i++) |
|
if (c == tbl_toks[i]) |
|
return((enum tbl_tok)i); |
|
|
|
return(TBL_TOK__MAX); |
|
} |
} |
|
|
enum tbl_tok |
void |
tbl_next(struct tbl *tbl, const char *p, int *pos) |
tbl_end(struct tbl_node *tbl) |
{ |
{ |
int i; |
|
enum tbl_tok c; |
|
|
|
tbl->buf[0] = '\0'; |
if (NULL == tbl->first_span || NULL == tbl->first_span->first) |
|
mandoc_msg(MANDOCERR_TBLNODATA, tbl->parse, |
|
tbl->line, tbl->pos, NULL); |
|
|
if (TBL_TOK__MAX != (c = tbl_next_char(p[*pos]))) { |
if (tbl->last_span) |
if (TBL_TOK_NIL != c) { |
tbl->last_span->flags |= TBL_SPAN_LAST; |
tbl->buf[0] = p[*pos]; |
|
tbl->buf[1] = '\0'; |
|
(*pos)++; |
|
} |
|
return(c); |
|
} |
|
|
|
/* |
if (TBL_PART_CDATA == tbl->part) |
* Copy words into a nil-terminated buffer. For now, we use a |
mandoc_msg(MANDOCERR_TBLBLOCK, tbl->parse, |
* static buffer. FIXME: eventually this should be made into a |
tbl->line, tbl->pos, NULL); |
* dynamic one living in struct tbl. |
|
*/ |
|
|
|
for (i = 0; i < BUFSIZ; i++, (*pos)++) |
|
if (TBL_TOK__MAX == tbl_next_char(p[*pos])) |
|
tbl->buf[i] = p[*pos]; |
|
else |
|
break; |
|
|
|
assert(i < BUFSIZ); |
|
tbl->buf[i] = '\0'; |
|
|
|
return(TBL_TOK__MAX); |
|
} |
} |
|
|
|
|