version 1.5, 2008/11/25 16:49:57 |
version 1.76, 2010/05/16 14:47:19 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
* |
* |
* 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 |
* purpose with or without fee is hereby granted, provided that the above |
* above copyright notice and this permission notice appear in all |
* copyright notice and this permission notice appear in all copies. |
* copies. |
|
* |
* |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL |
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES |
* WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED |
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF |
* WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE |
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR |
* AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL |
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES |
* DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR |
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN |
* PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* PERFORMANCE OF THIS SOFTWARE. |
|
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
#include <ctype.h> |
|
#include <err.h> |
|
#include <stdlib.h> |
#include <stdlib.h> |
#include <stdio.h> |
|
#include <string.h> |
#include <string.h> |
#include <time.h> |
#include <stdio.h> |
|
|
#include "libmdocml.h" |
#include "mandoc.h" |
#include "private.h" |
#include "roff.h" |
|
|
#define ROFF_MAXARG 10 |
#define ROFF_CTL(c) \ |
|
('.' == (c) || '\'' == (c)) |
|
#if 0 |
|
#define ROFF_MDEBUG(p, str) \ |
|
fprintf(stderr, "%s: %s (%d:%d)\n", (str), \ |
|
roffs[(p)->last->tok].name, \ |
|
(p)->last->line, (p)->last->col) |
|
#else |
|
#define ROFF_MDEBUG(p, str) while (/* CONSTCOND */ 0) |
|
#endif |
|
|
/* Whether we're entering or leaving a roff scope. */ |
enum rofft { |
enum roffd { |
ROFF_if, |
ROFF_ENTER = 0, |
ROFF_ig, |
ROFF_EXIT |
ROFF_cblock, |
|
ROFF_ccond, |
|
#if 0 |
|
ROFF_am, |
|
ROFF_ami, |
|
ROFF_de, |
|
ROFF_dei, |
|
ROFF_close, |
|
#endif |
|
ROFF_MAX |
}; |
}; |
|
|
/* The type of a macro (see mdoc(7) for more). */ |
struct roff { |
enum rofftype { |
struct roffnode *last; /* leaf of stack */ |
ROFF_COMMENT, |
mandocmsg msg; /* err/warn/fatal messages */ |
ROFF_TEXT, |
void *data; /* privdata for messages */ |
ROFF_LAYOUT |
|
}; |
}; |
|
|
/* Arguments passed to a macro callback. */ |
struct roffnode { |
#define ROFFCALL_ARGS \ |
enum rofft tok; /* type of node */ |
int tok, struct rofftree *tree, \ |
struct roffnode *parent; /* up one in stack */ |
const char *argv[], enum roffd type |
char *end; /* end-token: custom */ |
|
int line; /* parse line */ |
|
int col; /* parse col */ |
|
int endspan; |
|
}; |
|
|
struct rofftree; |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
|
enum rofft tok, /* tok of macro */ \ |
|
char **bufp, /* input buffer */ \ |
|
size_t *szp, /* size of input buffer */ \ |
|
int ln, /* parse line */ \ |
|
int ppos, /* original pos in buffer */ \ |
|
int pos, /* current pos in buffer */ \ |
|
int *offs /* reset offset of buffer data */ |
|
|
/* Describes a roff token (like D1 or Sh). */ |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
struct rofftok { |
|
int (*cb)(ROFFCALL_ARGS); /* Callback. */ |
|
const int *args; /* Args (or NULL). */ |
|
enum rofftype type; /* Type of macro. */ |
|
int symm; /* FIXME */ |
|
int flags; |
|
#define ROFF_NESTED (1 << 0) /* Nested-layout. */ |
|
#define ROFF_PARSED (1 << 1) /* "Parsed". */ |
|
#define ROFF_CALLABLE (1 << 2) /* "Callable". */ |
|
#define ROFF_QUOTES (1 << 3) /* Quoted args. */ |
|
}; |
|
|
|
/* An argument to a roff token (like -split or -enum). */ |
struct roffmac { |
struct roffarg { |
const char *name; /* macro name */ |
int flags; |
roffproc proc; |
#define ROFF_VALUE (1 << 0) /* Has a value. */ |
|
}; |
}; |
|
|
/* mdocml remembers only the current parse node and the chain leading to |
static enum rofferr roff_if(ROFF_ARGS); |
* the document root (scopes). |
static enum rofferr roff_ig(ROFF_ARGS); |
*/ |
static enum rofferr roff_cblock(ROFF_ARGS); |
struct roffnode { |
static enum rofferr roff_ccond(ROFF_ARGS); |
int tok; /* Token id. */ |
|
struct roffnode *parent; /* Parent (or NULL). */ |
|
size_t line; /* Parsed at line. */ |
|
}; |
|
|
|
/* State of file parse. */ |
const struct roffmac roffs[ROFF_MAX] = { |
struct rofftree { |
{ "if", roff_if }, |
struct roffnode *last; /* Last parsed node. */ |
{ "ig", roff_ig }, |
time_t date; /* `Dd' results. */ |
{ ".", roff_cblock }, |
char os[64]; /* `Os' results. */ |
{ "\\}", roff_ccond }, |
char title[64]; /* `Dt' results. */ |
#if 0 |
char section[64]; /* `Dt' results. */ |
{ "am", roff_sub_ig, roff_new_ig }, |
char volume[64]; /* `Dt' results. */ |
{ "ami", roff_sub_ig, roff_new_ig }, |
int state; |
{ "de", roff_sub_ig, roff_new_ig }, |
#define ROFF_PRELUDE (1 << 1) /* In roff prelude. */ |
{ "dei", roff_sub_ig, roff_new_ig }, |
/* FIXME: if we had prev ptrs, this wouldn't be necessary. */ |
#endif |
#define ROFF_PRELUDE_Os (1 << 2) /* `Os' is parsed. */ |
|
#define ROFF_PRELUDE_Dt (1 << 3) /* `Dt' is parsed. */ |
|
#define ROFF_PRELUDE_Dd (1 << 4) /* `Dd' is parsed. */ |
|
#define ROFF_BODY (1 << 5) /* In roff body. */ |
|
roffin roffin; /* Text-macro cb. */ |
|
roffblkin roffblkin; /* Block-macro cb. */ |
|
roffout roffout; /* Text-macro cb. */ |
|
roffblkout roffblkout; /* Block-macro cb. */ |
|
struct md_mbuf *mbuf; /* Output (or NULL). */ |
|
const struct md_args *args; /* Global args. */ |
|
const struct md_rbuf *rbuf; /* Input. */ |
|
}; |
}; |
|
|
static int roff_Dd(ROFFCALL_ARGS); |
static void roff_free1(struct roff *); |
static int roff_Dt(ROFFCALL_ARGS); |
static enum rofft roff_hash_find(const char *); |
static int roff_Os(ROFFCALL_ARGS); |
static void roffnode_cleanscope(struct roff *); |
static int roff_layout(ROFFCALL_ARGS); |
static int roffnode_push(struct roff *, |
static int roff_text(ROFFCALL_ARGS); |
enum rofft, int, int); |
|
static void roffnode_pop(struct roff *); |
|
static enum rofft roff_parse(const char *, int *); |
|
|
static struct roffnode *roffnode_new(int, struct rofftree *); |
|
static void roffnode_free(int, struct rofftree *); |
|
|
|
static int rofffindtok(const char *); |
/* |
static int rofffindarg(const char *); |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
static int rofffindcallable(const char *); |
* the nil-terminated string name could be found. |
static int roffargs(int, char *, char **); |
|
static int roffargok(int, int); |
|
static int roffnextopt(int, const char ***, char **); |
|
static int roffparse(struct rofftree *, char *, size_t); |
|
static int textparse(const struct rofftree *, |
|
const char *, size_t); |
|
|
|
/* Arguments for `An' macro. */ |
|
static const int roffarg_An[] = { |
|
ROFF_Split, ROFF_Nosplit, ROFF_ARGMAX }; |
|
/* Arguments for `Bd' macro. */ |
|
static const int roffarg_Bd[] = { |
|
ROFF_Ragged, ROFF_Unfilled, ROFF_Literal, ROFF_File, |
|
ROFF_Offset, ROFF_ARGMAX }; |
|
/* Arguments for `Bl' macro. */ |
|
static const int roffarg_Bl[] = { |
|
ROFF_Bullet, ROFF_Dash, ROFF_Hyphen, ROFF_Item, ROFF_Enum, |
|
ROFF_Tag, ROFF_Diag, ROFF_Hang, ROFF_Ohang, ROFF_Inset, |
|
ROFF_Column, ROFF_Offset, ROFF_ARGMAX }; |
|
|
|
/* FIXME: a big list of fixes that must occur. |
|
* |
|
* (1) Distinction not between ROFF_TEXT and ROFF_LAYOUT, but instead |
|
* ROFF_ATOM and ROFF_NODE, which designate line spacing. If |
|
* ROFF_ATOM, we need not remember any state. |
|
* |
|
* (2) Have a maybe-NULL list of possible subsequent children for each |
|
* node. Bl, e.g., can only have It children (roffparse). |
|
* |
|
* (3) Have a maybe-NULL list of possible parents for each node. It, |
|
* e.g., can only have Bl as a parent (roffparse). |
|
* |
|
* (N.B. If (2) were complete, (3) wouldn't be necessary.) |
|
* |
|
* (4) Scope rules. If Pp exists, it closes the scope out from the |
|
* previous Pp (if it exists). Same with Sh and Ss. If El exists, |
|
* it closes out Bl and interim It. |
|
* |
|
* (5) Nesting. Sh cannot be any descendant of Sh. Bl, however, can be |
|
* nested within an It. |
|
* |
|
* Once that's done, we're golden. |
|
*/ |
*/ |
|
static enum rofft |
|
roff_hash_find(const char *p) |
|
{ |
|
int i; |
|
|
/* Table of all known tokens. */ |
/* FIXME: make this be fast and efficient. */ |
static const struct rofftok tokens[ROFF_MAX] = { |
|
{ NULL, NULL, 0, ROFF_COMMENT, 0 }, /* \" */ |
|
{ roff_Dd, NULL, 0, ROFF_TEXT, 0 }, /* Dd */ |
|
{ roff_Dt, NULL, 0, ROFF_TEXT, 0 }, /* Dt */ |
|
{ roff_Os, NULL, 0, ROFF_TEXT, 0 }, /* Os */ |
|
{ roff_layout, NULL, ROFF_Sh, ROFF_LAYOUT, ROFF_PARSED }, /* Sh */ |
|
{ roff_layout, NULL, ROFF_Ss, ROFF_LAYOUT, ROFF_PARSED }, /* Ss */ |
|
{ roff_layout, NULL, ROFF_Pp, ROFF_LAYOUT, 0 }, /* Pp */ |
|
{ roff_layout, NULL, 0, ROFF_TEXT, 0 }, /* D1 */ |
|
{ roff_layout, NULL, 0, ROFF_TEXT, 0 }, /* Dl */ |
|
{ roff_layout, roffarg_Bd, 0, ROFF_LAYOUT, 0 }, /* Bd */ |
|
{ roff_layout, NULL, ROFF_Bd, ROFF_LAYOUT, 0 }, /* Ed */ |
|
{ roff_layout, roffarg_Bl, 0, ROFF_LAYOUT, 0 }, /* Bl */ |
|
{ roff_layout, NULL, ROFF_Bl, ROFF_LAYOUT, 0 }, /* El */ |
|
{ roff_layout, NULL, ROFF_It, ROFF_LAYOUT, 0 }, /* It */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ad */ |
|
{ roff_text, roffarg_An, 0, ROFF_TEXT, ROFF_PARSED }, /* An */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ar */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Cd */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Cm */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dv */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Er */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ev */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ex */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fa */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Fd */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fl */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Fn */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ft */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ic */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* In */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Li */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Nd */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Nm */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Op */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ot */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pa */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Rv */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* St */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Va */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Vt */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xr */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %A */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %B */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %D */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %I */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE}, /* %J */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %N */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %O */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %P */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %R */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* %T */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* %V */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ac */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ao */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Aq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* At */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Bf */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bo */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Bq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bsx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Bx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Db */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Do */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Dq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ec */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Ef */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Em */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Eo */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Fx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ms */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* No */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ns */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Nx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ox */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Pf */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Po */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Pq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Ql */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qo */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Qq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Re */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Rs */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* So */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sq */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, 0 }, /* Sm */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sx */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Sy */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Tn */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED }, /* Ux */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xc */ |
|
{ roff_text, NULL, 0, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, /* Xo */ |
|
}; |
|
|
|
/* Table of all known token arguments. */ |
for (i = 0; i < (int)ROFF_MAX; i++) |
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
if (0 == strcmp(roffs[i].name, p)) |
{ 0 }, /* split */ |
return((enum rofft)i); |
{ 0 }, /* nosplit */ |
|
{ 0 }, /* ragged */ |
|
{ 0 }, /* unfilled */ |
|
{ 0 }, /* literal */ |
|
{ ROFF_VALUE }, /* file */ |
|
{ ROFF_VALUE }, /* offset */ |
|
{ 0 }, /* bullet */ |
|
{ 0 }, /* dash */ |
|
{ 0 }, /* hyphen */ |
|
{ 0 }, /* item */ |
|
{ 0 }, /* enum */ |
|
{ 0 }, /* tag */ |
|
{ 0 }, /* diag */ |
|
{ 0 }, /* hang */ |
|
{ 0 }, /* ohang */ |
|
{ 0 }, /* inset */ |
|
{ 0 }, /* column */ |
|
{ 0 }, /* width */ |
|
{ 0 }, /* compact */ |
|
}; |
|
|
|
const char *const toknamesp[ROFF_MAX] = |
return(ROFF_MAX); |
{ |
} |
"\\\"", |
|
"Dd", /* Title macros. */ |
|
"Dt", |
|
"Os", |
|
"Sh", /* Layout macros */ |
|
"Ss", |
|
"Pp", |
|
"D1", |
|
"Dl", |
|
"Bd", |
|
"Ed", |
|
"Bl", |
|
"El", |
|
"It", |
|
"Ad", /* Text macros. */ |
|
"An", |
|
"Ar", |
|
"Cd", |
|
"Cm", |
|
"Dr", |
|
"Er", |
|
"Ev", |
|
"Ex", |
|
"Fa", |
|
"Fd", |
|
"Fl", |
|
"Fn", |
|
"Ft", |
|
"Ex", |
|
"Ic", |
|
"In", |
|
"Li", |
|
"Nd", |
|
"Nm", |
|
"Op", |
|
"Ot", |
|
"Pa", |
|
"Rv", |
|
"St", |
|
"Va", |
|
"Vt", |
|
"Xr", |
|
"\%A", /* General text macros. */ |
|
"\%B", |
|
"\%D", |
|
"\%I", |
|
"\%J", |
|
"\%N", |
|
"\%O", |
|
"\%P", |
|
"\%R", |
|
"\%T", |
|
"\%V", |
|
"Ac", |
|
"Ao", |
|
"Aq", |
|
"At", |
|
"Bc", |
|
"Bf", |
|
"Bo", |
|
"Bq", |
|
"Bsx", |
|
"Bx", |
|
"Db", |
|
"Dc", |
|
"Do", |
|
"Dq", |
|
"Ec", |
|
"Ef", |
|
"Em", |
|
"Eo", |
|
"Fx", |
|
"Ms", |
|
"No", |
|
"Ns", |
|
"Nx", |
|
"Ox", |
|
"Pc", |
|
"Pf", |
|
"Po", |
|
"Pq", |
|
"Qc", |
|
"Ql", |
|
"Qo", |
|
"Qq", |
|
"Re", |
|
"Rs", |
|
"Sc", |
|
"So", |
|
"Sq", |
|
"Sm", |
|
"Sx", |
|
"Sy", |
|
"Tn", |
|
"Ux", |
|
"Xc", /* FIXME: do not support! */ |
|
"Xo", /* FIXME: do not support! */ |
|
}; |
|
|
|
const char *const tokargnamesp[ROFF_ARGMAX] = |
|
{ |
|
"split", |
|
"nosplit", |
|
"ragged", |
|
"unfilled", |
|
"literal", |
|
"file", |
|
"offset", |
|
"bullet", |
|
"dash", |
|
"hyphen", |
|
"item", |
|
"enum", |
|
"tag", |
|
"diag", |
|
"hang", |
|
"ohang", |
|
"inset", |
|
"column", |
|
"width", |
|
"compact", |
|
}; |
|
|
|
const char *const *toknames = toknamesp; |
/* |
const char *const *tokargnames = tokargnamesp; |
* Pop the current node off of the stack of roff instructions currently |
|
* pending. |
|
*/ |
int |
static void |
roff_free(struct rofftree *tree, int flush) |
roffnode_pop(struct roff *r) |
{ |
{ |
int error; |
struct roffnode *p; |
|
|
assert(tree->mbuf); |
assert(r->last); |
if ( ! flush) |
p = r->last; |
tree->mbuf = NULL; |
r->last = r->last->parent; |
|
if (p->end) |
/* LINTED */ |
free(p->end); |
while (tree->last) |
free(p); |
if ( ! (*tokens[tree->last->tok].cb) |
|
(tree->last->tok, tree, NULL, ROFF_EXIT)) |
|
/* Disallow flushing. */ |
|
tree->mbuf = NULL; |
|
|
|
error = tree->mbuf ? 0 : 1; |
|
|
|
if (tree->mbuf && (ROFF_PRELUDE & tree->state)) { |
|
warnx("%s: prelude never finished", |
|
tree->rbuf->name); |
|
error = 1; |
|
} |
|
|
|
free(tree); |
|
return(error ? 0 : 1); |
|
} |
} |
|
|
|
|
struct rofftree * |
/* |
roff_alloc(const struct md_args *args, struct md_mbuf *out, |
* Push a roff node onto the instruction stack. This must later be |
const struct md_rbuf *in, roffin textin, |
* removed with roffnode_pop(). |
roffout textout, roffblkin blkin, roffblkout blkout) |
*/ |
|
static int |
|
roffnode_push(struct roff *r, enum rofft tok, int line, int col) |
{ |
{ |
struct rofftree *tree; |
struct roffnode *p; |
|
|
if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) { |
if (NULL == (p = calloc(1, sizeof(struct roffnode)))) { |
warn("malloc"); |
(*r->msg)(MANDOCERR_MEM, r->data, line, col, NULL); |
return(NULL); |
return(0); |
} |
} |
|
|
tree->state = ROFF_PRELUDE; |
p->tok = tok; |
tree->args = args; |
p->parent = r->last; |
tree->mbuf = out; |
p->line = line; |
tree->rbuf = in; |
p->col = col; |
tree->roffin = textin; |
|
tree->roffout = textout; |
|
tree->roffblkin = blkin; |
|
tree->roffblkout = blkout; |
|
|
|
return(tree); |
r->last = p; |
|
return(1); |
} |
} |
|
|
|
|
int |
static void |
roff_engine(struct rofftree *tree, char *buf, size_t sz) |
roff_free1(struct roff *r) |
{ |
{ |
|
|
if (0 == sz) { |
while (r->last) |
warnx("%s: blank line (line %zu)", |
roffnode_pop(r); |
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} else if ('.' != *buf) |
|
return(textparse(tree, buf, sz)); |
|
|
|
return(roffparse(tree, buf, sz)); |
|
} |
} |
|
|
|
|
static int |
void |
textparse(const struct rofftree *tree, const char *buf, size_t sz) |
roff_reset(struct roff *r) |
{ |
{ |
|
|
if (NULL == tree->last) { |
|
warnx("%s: unexpected text (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} else if (NULL == tree->last->parent) { |
|
warnx("%s: disallowed text (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
/* Print text. */ |
roff_free1(r); |
|
|
return(1); |
|
} |
} |
|
|
|
|
static int |
void |
roffargs(int tok, char *buf, char **argv) |
roff_free(struct roff *r) |
{ |
{ |
int i; |
|
|
|
(void)tok;/* FIXME: quotable strings? */ |
roff_free1(r); |
|
free(r); |
assert(tok >= 0 && tok < ROFF_MAX); |
|
assert('.' == *buf); |
|
|
|
/* LINTED */ |
|
for (i = 0; *buf && i < ROFF_MAXARG; i++) { |
|
argv[i] = buf++; |
|
while (*buf && ! isspace(*buf)) |
|
buf++; |
|
if (0 == *buf) { |
|
continue; |
|
} |
|
*buf++ = 0; |
|
while (*buf && isspace(*buf)) |
|
buf++; |
|
} |
|
|
|
assert(i > 0); |
|
if (i < ROFF_MAXARG) |
|
argv[i] = NULL; |
|
|
|
return(ROFF_MAXARG > i); |
|
} |
} |
|
|
|
|
static int |
struct roff * |
roffparse(struct rofftree *tree, char *buf, size_t sz) |
roff_alloc(const mandocmsg msg, void *data) |
{ |
{ |
int tok, t; |
struct roff *r; |
struct roffnode *node; |
|
char *argv[ROFF_MAXARG]; |
|
const char **argvp; |
|
|
|
assert(sz > 0); |
if (NULL == (r = calloc(1, sizeof(struct roff)))) { |
|
(*msg)(MANDOCERR_MEM, data, 0, 0, NULL); |
/* |
|
* Extract the token identifier from the buffer. If there's no |
|
* callback for the token (comment, etc.) then exit immediately. |
|
* We don't do any error handling (yet), so if the token doesn't |
|
* exist, die. |
|
*/ |
|
|
|
if (3 > sz) { |
|
warnx("%s: malformed line (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
return(0); |
|
|
/* FIXME: .Bsx is three letters! */ |
|
} else if (ROFF_MAX == (tok = rofffindtok(buf + 1))) { |
|
warnx("%s: unknown line token `%c%c' (line %zu)", |
|
tree->rbuf->name, |
|
*(buf + 1), *(buf + 2), |
|
tree->rbuf->line); |
|
return(0); |
|
} else if (ROFF_COMMENT == tokens[tok].type) |
|
/* Ignore comment tokens. */ |
|
return(1); |
|
|
|
if ( ! roffargs(tok, buf, argv)) { |
|
warnx("%s: too many arguments to `%s' (line %zu)", |
|
tree->rbuf->name, toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
} |
|
|
/* |
r->msg = msg; |
* If this is a non-nestable layout token and we're below a |
r->data = data; |
* token of the same type, then recurse upward to the token, |
return(r); |
* closing out the interim scopes. |
} |
* |
|
* If there's a nested token on the chain, then raise an error |
|
* as nested tokens have corresponding "ending" tokens and we're |
|
* breaking their scope. |
|
*/ |
|
|
|
node = NULL; |
|
|
|
if (ROFF_LAYOUT == tokens[tok].type && |
enum rofferr |
! (ROFF_NESTED & tokens[tok].flags)) { |
roff_parseln(struct roff *r, int ln, |
for (node = tree->last; node; node = node->parent) { |
char **bufp, size_t *szp, int pos, int *offs) |
if (node->tok == tok) |
{ |
break; |
enum rofft t; |
|
int ppos; |
|
|
/* Don't break nested scope. */ |
if (r->last && ! ROFF_CTL((*bufp)[pos])) { |
|
if (ROFF_ig == r->last->tok) |
|
return(ROFF_IGN); |
|
roffnode_cleanscope(r); |
|
/* FIXME: this assumes we're discarding! */ |
|
return(ROFF_IGN); |
|
} else if ( ! ROFF_CTL((*bufp)[pos])) |
|
return(ROFF_CONT); |
|
|
if ( ! (ROFF_NESTED & tokens[node->tok].flags)) |
/* There's nothing on the stack: make us anew. */ |
continue; |
|
warnx("%s: scope of %s (line %zu) broken by " |
|
"%s (line %zu)", |
|
tree->rbuf->name, |
|
toknames[tok], node->line, |
|
toknames[node->tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
} |
|
|
|
if (node) { |
ppos = pos; |
assert(ROFF_LAYOUT == tokens[tok].type); |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) { |
assert( ! (ROFF_NESTED & tokens[tok].flags)); |
if (r->last && ROFF_ig == r->last->tok) |
assert(node->tok == tok); |
return(ROFF_IGN); |
|
return(ROFF_CONT); |
/* Clear up to last scoped token. */ |
|
|
|
/* LINTED */ |
|
do { |
|
t = tree->last->tok; |
|
if ( ! (*tokens[tree->last->tok].cb) |
|
(tree->last->tok, tree, NULL, ROFF_EXIT)) |
|
return(0); |
|
} while (t != tok); |
|
} |
} |
|
|
/* Proceed with actual token processing. */ |
assert(roffs[t].proc); |
|
return((*roffs[t].proc)(r, t, bufp, szp, ln, ppos, pos, offs)); |
argvp = (const char **)&argv[1]; |
|
return((*tokens[tok].cb)(tok, tree, argvp, ROFF_ENTER)); |
|
} |
} |
|
|
|
|
static int |
int |
rofffindarg(const char *name) |
roff_endparse(struct roff *r) |
{ |
{ |
size_t i; |
|
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
if (NULL == r->last) |
|
return(1); |
/* LINTED */ |
return((*r->msg)(MANDOCERR_SCOPEEXIT, r->data, r->last->line, |
for (i = 0; i < ROFF_ARGMAX; i++) |
r->last->col, NULL)); |
/* LINTED */ |
|
if (0 == strcmp(name, tokargnames[i])) |
|
return((int)i); |
|
|
|
return(ROFF_ARGMAX); |
|
} |
} |
|
|
|
|
static int |
/* |
rofffindtok(const char *name) |
* Parse a roff node's type from the input buffer. This must be in the |
|
* form of ".foo xxx" in the usual way. |
|
*/ |
|
static enum rofft |
|
roff_parse(const char *buf, int *pos) |
{ |
{ |
size_t i; |
int j; |
|
char mac[5]; |
|
enum rofft t; |
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
assert(ROFF_CTL(buf[*pos])); |
|
(*pos)++; |
|
|
/* LINTED */ |
while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos])) |
for (i = 0; i < ROFF_MAX; i++) |
(*pos)++; |
/* LINTED */ |
|
if (0 == strncmp(name, toknames[i], 2)) |
|
return((int)i); |
|
|
|
return(ROFF_MAX); |
|
} |
|
|
|
|
if ('\0' == buf[*pos]) |
|
return(ROFF_MAX); |
|
|
static int |
for (j = 0; j < 4; j++, (*pos)++) |
rofffindcallable(const char *name) |
if ('\0' == (mac[j] = buf[*pos])) |
{ |
break; |
int c; |
else if (' ' == buf[*pos]) |
|
break; |
|
|
if (ROFF_MAX == (c = rofffindtok(name))) |
if (j == 4 || j < 1) |
return(ROFF_MAX); |
return(ROFF_MAX); |
return(ROFF_CALLABLE & tokens[c].flags ? c : ROFF_MAX); |
|
} |
|
|
|
|
mac[j] = '\0'; |
|
|
static struct roffnode * |
if (ROFF_MAX == (t = roff_hash_find(mac))) |
roffnode_new(int tokid, struct rofftree *tree) |
return(t); |
{ |
|
struct roffnode *p; |
|
|
|
if (NULL == (p = malloc(sizeof(struct roffnode)))) { |
|
warn("malloc"); |
|
return(NULL); |
|
} |
|
|
|
p->line = tree->rbuf->line; |
while (buf[*pos] && ' ' == buf[*pos]) |
p->tok = tokid; |
(*pos)++; |
p->parent = tree->last; |
|
tree->last = p; |
|
return(p); |
|
} |
|
|
|
|
return(t); |
static int |
|
roffargok(int tokid, int argid) |
|
{ |
|
const int *c; |
|
|
|
if (NULL == (c = tokens[tokid].args)) |
|
return(0); |
|
|
|
for ( ; ROFF_ARGMAX != *c; c++) |
|
if (argid == *c) |
|
return(1); |
|
|
|
return(0); |
|
} |
} |
|
|
|
|
static void |
|
roffnode_free(int tokid, struct rofftree *tree) |
|
{ |
|
struct roffnode *p; |
|
|
|
assert(tree->last); |
|
assert(tree->last->tok == tokid); |
|
|
|
p = tree->last; |
|
tree->last = tree->last->parent; |
|
free(p); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dd(ROFFCALL_ARGS) |
roff_cblock(ROFF_ARGS) |
{ |
{ |
|
|
if (ROFF_BODY & tree->state) { |
if (NULL == r->last) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
assert(ROFF_PRELUDE_Dd & tree->state); |
return(ROFF_ERR); |
return(roff_text(tok, tree, argv, type)); |
return(ROFF_IGN); |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
if (ROFF_ig != r->last->tok) { |
assert( ! (ROFF_BODY & tree->state)); |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
if (ROFF_PRELUDE_Dd & tree->state || |
return(ROFF_IGN); |
ROFF_PRELUDE_Dt & tree->state) { |
|
warnx("%s: prelude `Dd' out-of-order (line %zu)", |
|
tree->rbuf->name, tree->rbuf->line); |
|
return(0); |
|
} |
} |
|
|
/* TODO: parse date. */ |
if ((*bufp)[pos]) |
|
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
|
return(ROFF_ERR); |
|
|
assert(NULL == tree->last); |
ROFF_MDEBUG(r, "closing ignore block"); |
tree->state |= ROFF_PRELUDE_Dd; |
roffnode_pop(r); |
|
roffnode_cleanscope(r); |
|
return(ROFF_IGN); |
|
|
return(1); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
static void |
static int |
roffnode_cleanscope(struct roff *r) |
roff_Dt(ROFFCALL_ARGS) |
|
{ |
{ |
|
|
if (ROFF_BODY & tree->state) { |
while (r->last) { |
assert( ! (ROFF_PRELUDE & tree->state)); |
if (--r->last->endspan < 0) |
assert(ROFF_PRELUDE_Dt & tree->state); |
break; |
return(roff_text(tok, tree, argv, type)); |
ROFF_MDEBUG(r, "closing implicit scope"); |
|
roffnode_pop(r); |
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
|
assert( ! (ROFF_BODY & tree->state)); |
|
|
|
if ( ! (ROFF_PRELUDE_Dd & tree->state) || |
|
(ROFF_PRELUDE_Dt & tree->state)) { |
|
warnx("%s: prelude `Dt' out-of-order (line %zu)", |
|
tree->rbuf->name, tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
/* TODO: parse date. */ |
|
|
|
assert(NULL == tree->last); |
|
tree->state |= ROFF_PRELUDE_Dt; |
|
|
|
return(1); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Os(ROFFCALL_ARGS) |
roff_ccond(ROFF_ARGS) |
{ |
{ |
|
|
if (ROFF_EXIT == type) { |
if (NULL == r->last) { |
assert(ROFF_PRELUDE_Os & tree->state); |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
return(roff_layout(tok, tree, argv, type)); |
return(ROFF_ERR); |
} else if (ROFF_BODY & tree->state) { |
return(ROFF_IGN); |
assert( ! (ROFF_PRELUDE & tree->state)); |
|
assert(ROFF_PRELUDE_Os & tree->state); |
|
return(roff_text(tok, tree, argv, type)); |
|
} |
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
if (ROFF_if != r->last->tok) { |
if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
! (ROFF_PRELUDE_Dd & tree->state)) { |
return(ROFF_ERR); |
warnx("%s: prelude `Os' out-of-order (line %zu)", |
return(ROFF_IGN); |
tree->rbuf->name, tree->rbuf->line); |
|
return(0); |
|
} |
} |
|
|
/* TODO: extract OS. */ |
if (r->last->endspan > -1) { |
|
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
|
return(ROFF_ERR); |
|
return(ROFF_IGN); |
|
} |
|
|
tree->state |= ROFF_PRELUDE_Os; |
if ((*bufp)[pos]) |
tree->state &= ~ROFF_PRELUDE; |
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, pos, NULL)) |
tree->state |= ROFF_BODY; |
return(ROFF_ERR); |
|
|
assert(NULL == tree->last); |
ROFF_MDEBUG(r, "closing explicit scope"); |
|
roffnode_pop(r); |
return(roff_layout(tok, tree, argv, type)); |
roffnode_cleanscope(r); |
|
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGUSED */ |
|
static int |
|
roffnextopt(int tok, const char ***in, char **val) |
|
{ |
|
const char *arg, **argv; |
|
int v; |
|
|
|
*val = NULL; |
|
argv = *in; |
|
assert(argv); |
|
|
|
if (NULL == (arg = *argv)) |
|
return(-1); |
|
if ('-' != *arg) |
|
return(-1); |
|
|
|
/* FIXME: should we let this slide... ? */ |
|
|
|
if (ROFF_ARGMAX == (v = rofffindarg(&arg[1]))) |
|
return(-1); |
|
|
|
/* FIXME: should we let this slide... ? */ |
|
|
|
if ( ! roffargok(tok, v)) |
|
return(-1); |
|
if ( ! (ROFF_VALUE & tokenargs[v].flags)) |
|
return(v); |
|
|
|
*in = ++argv; |
|
|
|
/* FIXME: what if this looks like a roff token or argument? */ |
|
|
|
return(*argv ? v : ROFF_ARGMAX); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_layout(ROFFCALL_ARGS) |
roff_ig(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
|
char *v, *argvp[ROFF_MAXARG]; |
|
|
|
if (ROFF_PRELUDE & tree->state) { |
if ( ! roffnode_push(r, tok, ln, ppos)) |
warnx("%s: macro `%s' called in prelude (line %zu)", |
return(ROFF_ERR); |
tree->rbuf->name, |
|
toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
if (ROFF_EXIT == type) { |
ROFF_MDEBUG(r, "opening ignore block"); |
roffnode_free(tok, tree); |
|
return((*tree->roffblkout)(tok)); |
|
} |
|
|
|
i = 0; |
/* FIXME: warn about end of line. */ |
|
|
while (-1 != (c = roffnextopt(tok, &argv, &v))) { |
return(ROFF_IGN); |
if (ROFF_ARGMAX == c) { |
|
warnx("%s: error parsing `%s' args (line %zu)", |
|
tree->rbuf->name, |
|
toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} else if ( ! roffargok(tok, c)) { |
|
warnx("%s: arg `%s' not for `%s' (line %zu)", |
|
tree->rbuf->name, |
|
tokargnames[c], |
|
toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
argcp[i] = c; |
|
argvp[i] = v; |
|
i++; |
|
argv++; |
|
} |
|
|
|
argcp[i] = ROFF_ARGMAX; |
|
argvp[i] = NULL; |
|
|
|
if (NULL == roffnode_new(tok, tree)) |
|
return(0); |
|
|
|
if ( ! (*tree->roffin)(tok, argcp, argvp)) |
|
return(0); |
|
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
|
/* TODO: print all tokens. */ |
|
|
|
if ( ! ((*tree->roffout)(tok))) |
|
return(0); |
|
return((*tree->roffblkin)(tok)); |
|
} |
|
|
|
while (*argv) { |
|
if (2 >= strlen(*argv) && ROFF_MAX != |
|
(c = rofffindcallable(*argv))) |
|
if ( ! (*tokens[c].cb)(c, tree, |
|
argv + 1, ROFF_ENTER)) |
|
return(0); |
|
|
|
/* TODO: print token. */ |
|
argv++; |
|
} |
|
|
|
if ( ! ((*tree->roffout)(tok))) |
|
return(0); |
|
|
|
return((*tree->roffblkin)(tok)); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_text(ROFFCALL_ARGS) |
roff_if(ROFF_ARGS) |
{ |
{ |
int i, c, argcp[ROFF_MAXARG]; |
|
char *v, *argvp[ROFF_MAXARG]; |
|
|
|
if (ROFF_PRELUDE & tree->state) { |
/* |
warnx("%s: macro `%s' called in prelude (line %zu)", |
* Read ahead past the conditional. |
tree->rbuf->name, |
* FIXME: this does not work, as conditionals don't end on |
toknames[tok], |
* whitespace, but are parsed according to a formal grammar. |
tree->rbuf->line); |
* It's good enough for now, however. |
return(0); |
*/ |
} |
|
|
|
i = 0; |
if ( ! roffnode_push(r, tok, ln, ppos)) |
|
return(ROFF_ERR); |
|
|
while (-1 != (c = roffnextopt(tok, &argv, &v))) { |
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
if (ROFF_ARGMAX == c) { |
pos++; |
warnx("%s: error parsing `%s' args (line %zu)", |
while (' ' == (*bufp)[pos]) |
tree->rbuf->name, |
pos++; |
toknames[tok], |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
argcp[i] = c; |
|
argvp[i] = v; |
|
i++; |
|
argv++; |
|
} |
|
|
|
argcp[i] = ROFF_ARGMAX; |
/* Don't evaluate: just assume NO. */ |
argvp[i] = NULL; |
|
|
|
if ( ! (*tree->roffin)(tok, argcp, argvp)) |
r->last->endspan = 1; |
return(0); |
|
|
|
if ( ! (ROFF_PARSED & tokens[tok].flags)) { |
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
/* TODO: print all tokens. */ |
ROFF_MDEBUG(r, "opening explicit scope"); |
return((*tree->roffout)(tok)); |
r->last->endspan = -1; |
} |
pos += 2; |
|
} else |
|
ROFF_MDEBUG(r, "opening implicit scope"); |
|
|
while (*argv) { |
if ('\0' == (*bufp)[pos]) |
if (2 >= strlen(*argv) && ROFF_MAX != |
return(ROFF_IGN); |
(c = rofffindcallable(*argv))) |
|
if ( ! (*tokens[c].cb)(c, tree, |
|
argv + 1, ROFF_ENTER)) |
|
return(0); |
|
|
|
/* TODO: print token. */ |
*offs = pos; |
argv++; |
return(ROFF_RERUN); |
} |
|
|
|
return((*tree->roffout)(tok)); |
|
} |
} |