version 1.3, 2010/12/28 13:46:07 |
version 1.46, 2018/12/14 06:33:14 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2009, 2010 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2011, 2015 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 |
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
|
#include "config.h" |
|
|
|
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
#include <stdio.h> |
#include <stdio.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <time.h> |
#include <time.h> |
|
|
|
#include "mandoc_aux.h" |
#include "mandoc.h" |
#include "mandoc.h" |
#include "roff.h" |
#include "tbl.h" |
#include "libmandoc.h" |
#include "libmandoc.h" |
#include "libroff.h" |
#include "tbl_parse.h" |
|
#include "tbl_int.h" |
|
|
static const char tbl_toks[TBL_TOK__MAX] = { |
|
'(', ')', ',', ';', '.', |
|
' ', '\t', '\0' |
|
}; |
|
|
|
static void tbl_init(struct tbl *); |
void |
static void tbl_clear(struct tbl *); |
tbl_read(struct tbl_node *tbl, int ln, const char *p, int pos) |
static enum tbl_tok tbl_next_char(char); |
|
|
|
static void |
|
tbl_clear(struct tbl *tbl) |
|
{ |
{ |
|
const char *cp; |
|
int active; |
|
|
} |
/* |
|
* In the options section, proceed to the layout section |
|
* after a semicolon, or right away if there is no semicolon. |
|
* Ignore semicolons in arguments. |
|
*/ |
|
|
static void |
if (tbl->part == TBL_PART_OPTS) { |
tbl_init(struct tbl *tbl) |
tbl->part = TBL_PART_LAYOUT; |
{ |
active = 1; |
|
for (cp = p + pos; *cp != '\0'; cp++) { |
|
switch (*cp) { |
|
case '(': |
|
active = 0; |
|
continue; |
|
case ')': |
|
active = 1; |
|
continue; |
|
case ';': |
|
if (active) |
|
break; |
|
continue; |
|
default: |
|
continue; |
|
} |
|
break; |
|
} |
|
if (*cp == ';') { |
|
tbl_option(tbl, ln, p, &pos); |
|
if (p[pos] == '\0') |
|
return; |
|
} |
|
} |
|
|
tbl->part = TBL_PART_OPTS; |
/* Process the other section types. */ |
} |
|
|
|
enum rofferr |
switch (tbl->part) { |
tbl_read(struct tbl *tbl, int ln, const char *p, int offs) |
case TBL_PART_LAYOUT: |
{ |
tbl_layout(tbl, ln, p, pos); |
int len; |
break; |
const char *cp; |
case TBL_PART_CDATA: |
|
tbl_cdata(tbl, ln, p, pos); |
cp = &p[offs]; |
break; |
len = (int)strlen(cp); |
default: |
|
tbl_data(tbl, ln, p, pos); |
if (len && TBL_PART_OPTS == tbl->part) |
break; |
if (';' != cp[len - 1]) |
} |
tbl->part = TBL_PART_LAYOUT; |
|
|
|
return(ROFF_CONT); |
|
} |
} |
|
|
struct tbl * |
struct tbl_node * |
tbl_alloc(void) |
tbl_alloc(int pos, int line, struct tbl_node *last_tbl) |
{ |
{ |
struct tbl *p; |
struct tbl_node *tbl; |
|
|
p = mandoc_malloc(sizeof(struct tbl)); |
tbl = mandoc_calloc(1, sizeof(*tbl)); |
tbl_init(p); |
if (last_tbl != NULL) |
return(p); |
last_tbl->next = tbl; |
|
tbl->line = line; |
|
tbl->pos = pos; |
|
tbl->part = TBL_PART_OPTS; |
|
tbl->opts.tab = '\t'; |
|
tbl->opts.decimal = '.'; |
|
return tbl; |
} |
} |
|
|
void |
void |
tbl_free(struct tbl *p) |
tbl_free(struct tbl_node *tbl) |
{ |
{ |
|
struct tbl_node *old_tbl; |
|
struct tbl_row *rp; |
|
struct tbl_cell *cp; |
|
struct tbl_span *sp; |
|
struct tbl_dat *dp; |
|
|
tbl_clear(p); |
while (tbl != NULL) { |
free(p); |
while ((rp = tbl->first_row) != NULL) { |
|
tbl->first_row = rp->next; |
|
while (rp->first != NULL) { |
|
cp = rp->first; |
|
rp->first = cp->next; |
|
free(cp->wstr); |
|
free(cp); |
|
} |
|
free(rp); |
|
} |
|
while ((sp = tbl->first_span) != NULL) { |
|
tbl->first_span = sp->next; |
|
while (sp->first != NULL) { |
|
dp = sp->first; |
|
sp->first = dp->next; |
|
free(dp->string); |
|
free(dp); |
|
} |
|
free(sp); |
|
} |
|
old_tbl = tbl; |
|
tbl = tbl->next; |
|
free(old_tbl); |
|
} |
} |
} |
|
|
void |
void |
tbl_reset(struct tbl *tbl) |
tbl_restart(int line, int pos, struct tbl_node *tbl) |
{ |
{ |
|
if (tbl->part == TBL_PART_CDATA) |
|
mandoc_msg(MANDOCERR_TBLDATA_BLK, line, pos, "T&"); |
|
|
tbl_clear(tbl); |
tbl->part = TBL_PART_LAYOUT; |
tbl_init(tbl); |
tbl->line = line; |
|
tbl->pos = pos; |
} |
} |
|
|
static enum tbl_tok |
struct tbl_span * |
tbl_next_char(char c) |
tbl_span(struct tbl_node *tbl) |
{ |
{ |
int i; |
struct tbl_span *span; |
|
|
/* |
span = tbl->current_span ? tbl->current_span->next |
* These are delimiting tokens. They separate out words in the |
: tbl->first_span; |
* token stream. |
if (span != NULL) |
* |
tbl->current_span = span; |
* FIXME: make this into a hashtable for faster lookup. |
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 |
int |
tbl_next(struct tbl *tbl, const char *p, int *pos) |
tbl_end(struct tbl_node *tbl, int still_open) |
{ |
{ |
int i; |
struct tbl_span *sp; |
enum tbl_tok c; |
|
|
|
tbl->buf[0] = '\0'; |
if (still_open) |
|
mandoc_msg(MANDOCERR_BLK_NOEND, tbl->line, tbl->pos, "TS"); |
|
else if (tbl->part == TBL_PART_CDATA) |
|
mandoc_msg(MANDOCERR_TBLDATA_BLK, tbl->line, tbl->pos, "TE"); |
|
|
if (TBL_TOK__MAX != (c = tbl_next_char(p[*pos]))) { |
sp = tbl->first_span; |
if (TBL_TOK_NIL != c) { |
while (sp != NULL && sp->first == NULL) |
tbl->buf[0] = p[*pos]; |
sp = sp->next; |
tbl->buf[1] = '\0'; |
if (sp == NULL) { |
(*pos)++; |
mandoc_msg(MANDOCERR_TBLDATA_NONE, tbl->line, tbl->pos, NULL); |
} |
return 0; |
return(c); |
|
} |
} |
|
return 1; |
/* |
|
* Copy words into a nil-terminated buffer. For now, we use a |
|
* static buffer. FIXME: eventually this should be made into a |
|
* 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); |
|
} |
} |
|
|
|
|