tbl.c

   1 /*      $Id: tbl.c,v 1.22 2011/01/25 12:24:27 schwarze Exp $ */
   2 /*
   3  * Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
   4  * Copyright (c) 2011 Ingo Schwarze <schwarze@openbsd.org>
   5  *
   6  * Permission to use, copy, modify, and distribute this software for any
   7  * purpose with or without fee is hereby granted, provided that the above
   8  * copyright notice and this permission notice appear in all copies.
   9  *
  10  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  11  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  12  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  13  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  14  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
  15  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  16  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  17  */
  18 #include <assert.h>
  19 #include <stdio.h>
  20 #include <stdlib.h>
  21 #include <string.h>
  22 #include <time.h>
  23
  24 #include "mandoc.h"
  25 #include "roff.h"
  26 #include "libmandoc.h"
  27 #include "libroff.h"
  28
  29 enum rofferr
  30 tbl_read(struct tbl_node *tbl, int ln, const char *p, int offs)
  31 {
  32         int              len;
  33         const char      *cp;
  34
  35         cp = &p[offs];
  36         len = (int)strlen(cp);
  37
  38         /*
  39          * If we're in the options section and we don't have a
  40          * terminating semicolon, assume we've moved directly into the
  41          * layout section.  No need to report a warning: this is,
  42          * apparently, standard behaviour.
  43          */
  44
  45         if (TBL_PART_OPTS == tbl->part && len)
  46                 if (';' != cp[len - 1])
  47                         tbl->part = TBL_PART_LAYOUT;
  48
  49         /* Now process each logical section of the table.  */
  50
  51         switch (tbl->part) {
  52         case (TBL_PART_OPTS):
  53                 return(tbl_option(tbl, ln, p) ? ROFF_IGN : ROFF_ERR);
  54         case (TBL_PART_LAYOUT):
  55                 return(tbl_layout(tbl, ln, p) ? ROFF_IGN : ROFF_ERR);
  56         case (TBL_PART_CDATA):
  57                 return(tbl_cdata(tbl, ln, p) ? ROFF_TBL : ROFF_IGN);
  58         default:
  59                 break;
  60         }
  61
  62         /*
  63          * This only returns zero if the line is empty, so we ignore it
  64          * and continue on.
  65          */
  66         return(tbl_data(tbl, ln, p) ? ROFF_TBL : ROFF_IGN);
  67 }
  68
  69 struct tbl_node *
  70 tbl_alloc(int pos, int line, void *data, const mandocmsg msg)
  71 {
  72         struct tbl_node *p;
  73
  74         p = mandoc_calloc(1, sizeof(struct tbl_node));
  75         p->line = line;
  76         p->pos = pos;
  77         p->data = data;
  78         p->msg = msg;
  79         p->part = TBL_PART_OPTS;
  80         p->opts.tab = '\t';
  81         p->opts.linesize = 12;
  82         p->opts.decimal = '.';
  83         return(p);
  84 }
  85
  86 void
  87 tbl_free(struct tbl_node *p)
  88 {
  89         struct tbl_row  *rp;
  90         struct tbl_cell *cp;
  91         struct tbl_span *sp;
  92         struct tbl_dat  *dp;
  93         struct tbl_head *hp;
  94
  95         while (NULL != (rp = p->first_row)) {
  96                 p->first_row = rp->next;
  97                 while (rp->first) {
  98                         cp = rp->first;
  99                         rp->first = cp->next;
 100                         free(cp);
 101                 }
 102                 free(rp);
 103         }
 104
 105         while (NULL != (sp = p->first_span)) {
 106                 p->first_span = sp->next;
 107                 while (sp->first) {
 108                         dp = sp->first;
 109                         sp->first = dp->next;
 110                         if (dp->string)
 111                                 free(dp->string);
 112                         free(dp);
 113                 }
 114                 free(sp);
 115         }
 116
 117         while (NULL != (hp = p->first_head)) {
 118                 p->first_head = hp->next;
 119                 free(hp);
 120         }
 121
 122         free(p);
 123 }
 124
 125 void
 126 tbl_restart(int line, int pos, struct tbl_node *tbl)
 127 {
 128         if (TBL_PART_CDATA == tbl->part)
 129                 TBL_MSG(tbl, MANDOCERR_TBLBLOCK, tbl->line, tbl->pos);
 130
 131         tbl->part = TBL_PART_LAYOUT;
 132         tbl->line = line;
 133         tbl->pos = pos;
 134
 135         if (NULL == tbl->first_span || NULL == tbl->first_span->first)
 136                 TBL_MSG(tbl, MANDOCERR_TBLNODATA, tbl->line, tbl->pos);
 137 }
 138
 139 const struct tbl_span *
 140 tbl_span(struct tbl_node *tbl)
 141 {
 142         struct tbl_span  *span;
 143
 144         assert(tbl);
 145         span = tbl->current_span ? tbl->current_span->next
 146                                  : tbl->first_span;
 147         if (span)
 148                 tbl->current_span = span;
 149         return(span);
 150 }
 151
 152 void
 153 tbl_end(struct tbl_node *tbl)
 154 {
 155
 156         if (NULL == tbl->first_span || NULL == tbl->first_span->first)
 157                 TBL_MSG(tbl, MANDOCERR_TBLNODATA, tbl->line, tbl->pos);
 158
 159         if (tbl->last_span)
 160                 tbl->last_span->flags |= TBL_SPAN_LAST;
 161
 162         if (TBL_PART_CDATA == tbl->part)
 163                 TBL_MSG(tbl, MANDOCERR_TBLBLOCK, tbl->line, tbl->pos);
 164 }
 165