version 1.1, 2010/12/28 10:51:03 |
version 1.22, 2011/01/25 12:24:27 |
|
|
/* $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 |
|
|
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
#include <assert.h> |
#include <assert.h> |
|
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <time.h> |
#include <time.h> |
|
|
#include "libmandoc.h" |
#include "libmandoc.h" |
#include "libroff.h" |
#include "libroff.h" |
|
|
enum tbl_part { |
enum rofferr |
TBL_PART_OPTS, /* in options (first line) */ |
tbl_read(struct tbl_node *tbl, int ln, const char *p, int offs) |
TBL_PART_LAYOUT, /* describing layout */ |
{ |
TBL_PART_DATA /* creating data rows */ |
int len; |
}; |
const char *cp; |
|
|
|
cp = &p[offs]; |
|
len = (int)strlen(cp); |
|
|
struct tbl { |
/* |
enum tbl_part 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. |
|
*/ |
|
|
static void tbl_init(struct tbl *); |
if (TBL_PART_OPTS == tbl->part && len) |
static void tbl_clear(struct tbl *); |
if (';' != cp[len - 1]) |
|
tbl->part = TBL_PART_LAYOUT; |
|
|
static void |
/* Now process each logical section of the table. */ |
tbl_clear(struct tbl *tbl) |
|
{ |
|
|
|
|
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); |
} |
} |
|
|
static void |
struct tbl_node * |
tbl_init(struct tbl *tbl) |
tbl_alloc(int pos, int line, void *data, const mandocmsg msg) |
{ |
{ |
|
struct tbl_node *p; |
|
|
tbl->part = TBL_PART_OPTS; |
p = mandoc_calloc(1, sizeof(struct tbl_node)); |
|
p->line = line; |
|
p->pos = pos; |
|
p->data = data; |
|
p->msg = msg; |
|
p->part = TBL_PART_OPTS; |
|
p->opts.tab = '\t'; |
|
p->opts.linesize = 12; |
|
p->opts.decimal = '.'; |
|
return(p); |
} |
} |
|
|
enum rofferr |
void |
tbl_read(struct tbl *tbl, int ln, const char *p, int offs) |
tbl_free(struct tbl_node *p) |
{ |
{ |
int len; |
struct tbl_row *rp; |
const char *cp; |
struct tbl_cell *cp; |
|
struct tbl_span *sp; |
|
struct tbl_dat *dp; |
|
struct tbl_head *hp; |
|
|
cp = &p[offs]; |
while (NULL != (rp = p->first_row)) { |
len = (int)strlen(cp); |
p->first_row = rp->next; |
|
while (rp->first) { |
|
cp = rp->first; |
|
rp->first = cp->next; |
|
free(cp); |
|
} |
|
free(rp); |
|
} |
|
|
if (len && TBL_PART_OPTS == tbl->part) |
while (NULL != (sp = p->first_span)) { |
if (';' != cp[len - 1]) |
p->first_span = sp->next; |
tbl->part = TBL_PART_LAYOUT; |
while (sp->first) { |
|
dp = sp->first; |
return(1); |
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); |
} |
} |
|
|
struct tbl * |
void |
tbl_alloc(void) |
tbl_restart(int line, int pos, struct tbl_node *tbl) |
{ |
{ |
struct tbl *p; |
if (TBL_PART_CDATA == tbl->part) |
|
TBL_MSG(tbl, MANDOCERR_TBLBLOCK, tbl->line, tbl->pos); |
|
|
p = mandoc_malloc(sizeof(struct tbl)); |
tbl->part = TBL_PART_LAYOUT; |
tbl_init(p); |
tbl->line = line; |
return(p); |
tbl->pos = pos; |
|
|
|
if (NULL == tbl->first_span || NULL == tbl->first_span->first) |
|
TBL_MSG(tbl, MANDOCERR_TBLNODATA, tbl->line, tbl->pos); |
} |
} |
|
|
void |
const struct tbl_span * |
tbl_free(struct tbl *p) |
tbl_span(struct tbl_node *tbl) |
{ |
{ |
|
struct tbl_span *span; |
|
|
tbl_clear(p); |
assert(tbl); |
free(p); |
span = tbl->current_span ? tbl->current_span->next |
|
: tbl->first_span; |
|
if (span) |
|
tbl->current_span = span; |
|
return(span); |
} |
} |
|
|
void |
void |
tbl_reset(struct tbl *tbl) |
tbl_end(struct tbl_node *tbl) |
{ |
{ |
|
|
tbl_clear(tbl); |
if (NULL == tbl->first_span || NULL == tbl->first_span->first) |
tbl_init(tbl); |
TBL_MSG(tbl, MANDOCERR_TBLNODATA, tbl->line, tbl->pos); |
|
|
|
if (tbl->last_span) |
|
tbl->last_span->flags |= TBL_SPAN_LAST; |
|
|
|
if (TBL_PART_CDATA == tbl->part) |
|
TBL_MSG(tbl, MANDOCERR_TBLBLOCK, tbl->line, tbl->pos); |
} |
} |
|
|