version 1.39, 2015/01/30 17:32:16 |
version 1.43, 2017/06/16 20:01:06 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2011, 2015 Ingo Schwarze <schwarze@openbsd.org> |
* Copyright (c) 2011, 2015, 2017 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 |
Line 51 getdata(struct tbl_node *tbl, struct tbl_span *dp, |
|
Line 51 getdata(struct tbl_node *tbl, struct tbl_span *dp, |
|
cp = cp->next; |
cp = cp->next; |
|
|
/* |
/* |
* Stop processing when we reach the end of the available layout |
* If the current layout row is out of cells, allocate |
* cells. This means that we have extra input. |
* a new cell if another row of the table has at least |
|
* this number of columns, or discard the input if we |
|
* are beyond the last column of the table as a whole. |
*/ |
*/ |
|
|
if (cp == NULL) { |
if (cp == NULL) { |
mandoc_msg(MANDOCERR_TBLDATA_EXTRA, tbl->parse, |
if (dp->layout->last->col + 1 < dp->opts->cols) { |
ln, *pos, p + *pos); |
cp = mandoc_calloc(1, sizeof(*cp)); |
/* Skip to the end... */ |
cp->pos = TBL_CELL_LEFT; |
while (p[*pos]) |
dp->layout->last->next = cp; |
(*pos)++; |
cp->col = dp->layout->last->col + 1; |
return; |
dp->layout->last = cp; |
|
} else { |
|
mandoc_msg(MANDOCERR_TBLDATA_EXTRA, tbl->parse, |
|
ln, *pos, p + *pos); |
|
while (p[*pos]) |
|
(*pos)++; |
|
return; |
|
} |
} |
} |
|
|
dat = mandoc_calloc(1, sizeof(*dat)); |
dat = mandoc_calloc(1, sizeof(*dat)); |
Line 132 tbl_cdata(struct tbl_node *tbl, int ln, const char *p, |
|
Line 141 tbl_cdata(struct tbl_node *tbl, int ln, const char *p, |
|
if (p[pos] == tbl->opts.tab) { |
if (p[pos] == tbl->opts.tab) { |
tbl->part = TBL_PART_DATA; |
tbl->part = TBL_PART_DATA; |
pos++; |
pos++; |
getdata(tbl, tbl->last_span, ln, p, &pos); |
while (p[pos] != '\0') |
return(1); |
getdata(tbl, tbl->last_span, ln, p, &pos); |
|
return 1; |
} else if (p[pos] == '\0') { |
} else if (p[pos] == '\0') { |
tbl->part = TBL_PART_DATA; |
tbl->part = TBL_PART_DATA; |
return(1); |
return 1; |
} |
} |
|
|
/* Fallthrough: T} is part of a word. */ |
/* Fallthrough: T} is part of a word. */ |
} |
} |
|
|
dat->pos = TBL_DATA_DATA; |
dat->pos = TBL_DATA_DATA; |
|
dat->block = 1; |
|
|
if (dat->string != NULL) { |
if (dat->string != NULL) { |
sz = strlen(p + pos) + strlen(dat->string) + 2; |
sz = strlen(p + pos) + strlen(dat->string) + 2; |
Line 156 tbl_cdata(struct tbl_node *tbl, int ln, const char *p, |
|
Line 167 tbl_cdata(struct tbl_node *tbl, int ln, const char *p, |
|
mandoc_msg(MANDOCERR_TBLDATA_SPAN, tbl->parse, |
mandoc_msg(MANDOCERR_TBLDATA_SPAN, tbl->parse, |
ln, pos, dat->string); |
ln, pos, dat->string); |
|
|
return(0); |
return 0; |
} |
} |
|
|
static struct tbl_span * |
static struct tbl_span * |
Line 177 newspan(struct tbl_node *tbl, int line, struct tbl_row |
|
Line 188 newspan(struct tbl_node *tbl, int line, struct tbl_row |
|
dp->prev->next = dp; |
dp->prev->next = dp; |
tbl->last_span = dp; |
tbl->last_span = dp; |
|
|
return(dp); |
return dp; |
} |
} |
|
|
void |
void |
tbl_data(struct tbl_node *tbl, int ln, const char *p, int pos) |
tbl_data(struct tbl_node *tbl, int ln, const char *p, int pos) |
{ |
{ |
struct tbl_span *dp; |
|
struct tbl_row *rp; |
struct tbl_row *rp; |
|
struct tbl_cell *cp; |
|
struct tbl_span *sp, *spi; |
|
struct tbl_dat *dp; |
|
int have_data, spans; |
|
|
/* |
rp = (sp = tbl->last_span) == NULL ? tbl->first_row : |
* Choose a layout row: take the one following the last parsed |
sp->pos == TBL_SPAN_DATA && sp->layout->next != NULL ? |
* span's. If that doesn't exist, use the last parsed span's. |
sp->layout->next : sp->layout; |
* If there's no last parsed span, use the first row. Lastly, |
|
* if the last span was a horizontal line, use the same layout |
|
* (it doesn't "consume" the layout). |
|
*/ |
|
|
|
if (tbl->last_span != NULL) { |
assert(rp != NULL); |
if (tbl->last_span->pos == TBL_SPAN_DATA) { |
|
for (rp = tbl->last_span->layout->next; |
|
rp != NULL && rp->first != NULL; |
|
rp = rp->next) { |
|
switch (rp->first->pos) { |
|
case TBL_CELL_HORIZ: |
|
dp = newspan(tbl, ln, rp); |
|
dp->pos = TBL_SPAN_HORIZ; |
|
continue; |
|
case TBL_CELL_DHORIZ: |
|
dp = newspan(tbl, ln, rp); |
|
dp->pos = TBL_SPAN_DHORIZ; |
|
continue; |
|
default: |
|
break; |
|
} |
|
break; |
|
} |
|
} else |
|
rp = tbl->last_span->layout; |
|
|
|
if (rp == NULL) |
sp = newspan(tbl, ln, rp); |
rp = tbl->last_span->layout; |
|
} else |
|
rp = tbl->first_row; |
|
|
|
assert(rp); |
|
|
|
dp = newspan(tbl, ln, rp); |
|
|
|
if ( ! strcmp(p, "_")) { |
if ( ! strcmp(p, "_")) { |
dp->pos = TBL_SPAN_HORIZ; |
sp->pos = TBL_SPAN_HORIZ; |
return; |
return; |
} else if ( ! strcmp(p, "=")) { |
} else if ( ! strcmp(p, "=")) { |
dp->pos = TBL_SPAN_DHORIZ; |
sp->pos = TBL_SPAN_DHORIZ; |
return; |
return; |
} |
} |
|
sp->pos = TBL_SPAN_DATA; |
|
|
dp->pos = TBL_SPAN_DATA; |
|
|
|
while (p[pos] != '\0') |
while (p[pos] != '\0') |
getdata(tbl, dp, ln, p, &pos); |
getdata(tbl, sp, ln, p, &pos); |
|
|
|
/* |
|
* If this span contains some data, |
|
* make sure at least part of it gets printed. |
|
*/ |
|
|
|
have_data = 0; |
|
cp = rp->first; |
|
for (dp = sp->first; dp != NULL; dp = dp->next) { |
|
if (dp->pos == TBL_DATA_DATA && *dp->string != '\0') { |
|
if (cp == NULL || |
|
(cp->pos != TBL_CELL_HORIZ && |
|
cp->pos != TBL_CELL_DHORIZ)) |
|
return; |
|
have_data = 1; |
|
} |
|
spans = dp->spans; |
|
while (spans-- >= 0) { |
|
if (cp != NULL) |
|
cp = cp->next; |
|
} |
|
} |
|
if (have_data == 0 || rp->next == NULL) |
|
return; |
|
|
|
/* |
|
* There is some data, but it would all get lost |
|
* due to horizontal lines in the layout. |
|
* Insert an empty span to consume the layout row. |
|
*/ |
|
|
|
tbl->last_span = sp->prev; |
|
spi = newspan(tbl, ln, rp); |
|
spi->pos = TBL_SPAN_DATA; |
|
spi->next = sp; |
|
tbl->last_span = sp; |
|
sp->prev = spi; |
|
sp->layout = rp->next; |
|
cp = sp->layout->first; |
|
for (dp = sp->first; dp != NULL; dp = dp->next) { |
|
dp->layout = cp; |
|
dp->spans = 0; |
|
if (cp != NULL) |
|
cp = cp->next; |
|
while (cp != NULL && cp->pos == TBL_CELL_SPAN) { |
|
dp->spans++; |
|
cp = cp->next; |
|
} |
|
} |
} |
} |