version 1.1, 2008/11/24 14:24:55 |
version 1.74, 2010/05/16 10:59:36 |
|
|
/* $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 "libmdocml.h" |
#include "mandoc.h" |
#include "private.h" |
#include "roff.h" |
|
|
#define ROFF_MAXARG 10 |
enum rofft { |
|
#if 0 |
enum roffd { |
ROFF_am, |
ROFF_ENTER = 0, |
ROFF_ami, |
ROFF_EXIT |
ROFF_de, |
|
ROFF_dei, |
|
ROFF_if, |
|
ROFF_ig, |
|
ROFF_close, |
|
#endif |
|
ROFF_MAX |
}; |
}; |
|
|
enum rofftype { |
struct roff { |
ROFF_TITLE, |
struct roffnode *last; /* leaf of stack */ |
ROFF_COMMENT, |
mandocmsg msg; /* err/warn/fatal messages */ |
ROFF_TEXT, |
void *data; /* privdata for messages */ |
ROFF_LAYOUT |
|
}; |
}; |
|
|
#define ROFFCALL_ARGS \ |
|
struct rofftree *tree, const char *argv[], enum roffd type |
|
|
|
struct rofftree; |
|
|
|
struct rofftok { |
|
char *name; |
|
int (*cb)(ROFFCALL_ARGS); |
|
enum rofftype type; |
|
int flags; |
|
#define ROFF_NESTED (1 << 0) |
|
#define ROFF_PARSED (1 << 1) |
|
#define ROFF_CALLABLE (1 << 2) |
|
#define ROFF_QUOTES (1 << 3) |
|
}; |
|
|
|
struct roffarg { |
|
char *name; |
|
int flags; |
|
#define ROFF_VALUE (1 << 0) |
|
}; |
|
|
|
struct roffnode { |
struct roffnode { |
int tok; |
enum rofft tok; /* type of node */ |
struct roffnode *parent; |
struct roffnode *parent; /* up one in stack */ |
size_t line; |
char *end; /* end-token: custom */ |
|
int line; /* parse line */ |
|
int col; /* parse col */ |
|
int flags; |
|
#define ROFF_PARSEONLY (1 << 0) |
}; |
}; |
|
|
struct rofftree { |
#define ROFF_ARGS struct roff *r, /* parse ctx */ \ |
struct roffnode *last; |
enum rofft tok, /* tok of macro */ \ |
time_t date; |
char **bufp, /* input buffer */ \ |
char title[256]; |
size_t *szp, /* size of input buffer */ \ |
char section[256]; |
int ln, /* parse line */ \ |
char volume[256]; |
int ppos, /* current pos in buffer */ \ |
int state; |
int *offs /* reset offset of buffer data */ |
#define ROFF_PRELUDE (1 << 1) |
|
#define ROFF_PRELUDE_Os (1 << 2) |
|
#define ROFF_PRELUDE_Dt (1 << 3) |
|
#define ROFF_PRELUDE_Dd (1 << 4) |
|
#define ROFF_BODY (1 << 5) |
|
struct md_mbuf *mbuf; /* NULL if ROFF_EXIT and error. */ |
|
|
|
const struct md_args *args; |
typedef enum rofferr (*roffproc)(ROFF_ARGS); |
const struct md_rbuf *rbuf; |
|
}; |
|
|
|
#define ROFF___ 0 |
struct roffmac { |
#define ROFF_Dd 1 |
const char *name; /* macro name */ |
#define ROFF_Dt 2 |
roffproc sub; /* child of control black */ |
#define ROFF_Os 3 |
roffproc new; /* root of stack (type = ROFF_MAX) */ |
#define ROFF_Sh 4 |
|
#define ROFF_An 5 |
|
#define ROFF_Li 6 |
|
#define ROFF_MAX 7 |
|
|
|
static int roff_Dd(ROFFCALL_ARGS); |
|
static int roff_Dt(ROFFCALL_ARGS); |
|
static int roff_Os(ROFFCALL_ARGS); |
|
static int roff_Sh(ROFFCALL_ARGS); |
|
static int roff_An(ROFFCALL_ARGS); |
|
static int roff_Li(ROFFCALL_ARGS); |
|
|
|
static struct roffnode *roffnode_new(int, size_t, |
|
struct rofftree *); |
|
static void roffnode_free(int, struct rofftree *); |
|
|
|
static int rofffindtok(const char *); |
|
static int rofffindarg(const char *); |
|
static int roffargs(int, char *, char **); |
|
static int roffparse(struct rofftree *, char *, size_t); |
|
static int textparse(const struct rofftree *, |
|
const char *, size_t); |
|
|
|
static void dbg_enter(const struct md_args *, int); |
|
static void dbg_leave(const struct md_args *, int); |
|
|
|
|
|
static const struct rofftok tokens[ROFF_MAX] = { |
|
{ "\\\"", NULL, ROFF_COMMENT, 0 }, |
|
{ "Dd", roff_Dd, ROFF_TITLE, 0 }, |
|
{ "Dt", roff_Dt, ROFF_TITLE, 0 }, |
|
{ "Os", roff_Os, ROFF_TITLE, 0 }, |
|
{ "Sh", roff_Sh, ROFF_LAYOUT, 0 }, |
|
{ "An", roff_An, ROFF_TEXT, ROFF_PARSED }, |
|
{ "Li", roff_Li, ROFF_TEXT, ROFF_PARSED | ROFF_CALLABLE }, |
|
}; |
}; |
|
|
#define ROFF_Split 0 |
#if 0 |
#define ROFF_Nosplit 1 |
static enum rofferr roff_new_close(ROFF_ARGS); |
#define ROFF_ARGMAX 2 |
static enum rofferr roff_new_if(ROFF_ARGS); |
|
static enum rofferr roff_sub_if(ROFF_ARGS); |
|
static enum rofferr roff_new_ig(ROFF_ARGS); |
|
static enum rofferr roff_sub_ig(ROFF_ARGS); |
|
#endif |
|
|
static const struct roffarg tokenargs[ROFF_ARGMAX] = { |
const struct roffmac roffs[ROFF_MAX] = { |
{ "split", 0 }, |
#if 0 |
{ "nosplit", 0 }, |
{ "am", roff_sub_ig, roff_new_ig }, |
|
{ "ami", roff_sub_ig, roff_new_ig }, |
|
{ "de", roff_sub_ig, roff_new_ig }, |
|
{ "dei", roff_sub_ig, roff_new_ig }, |
|
{ "if", roff_sub_if, roff_new_if }, |
|
{ "ig", roff_sub_ig, roff_new_ig }, |
|
{ ".", NULL, roff_new_close }, |
|
#endif |
}; |
}; |
|
|
|
static void roff_free1(struct roff *); |
|
static enum rofft roff_hash_find(const char *); |
|
static int roffnode_push(struct roff *, |
|
enum rofft, int, int); |
|
static void roffnode_pop(struct roff *); |
|
static enum rofft roff_parse(const char *, int *); |
|
|
int |
|
roff_free(struct rofftree *tree, int flush) |
|
{ |
|
int error; |
|
|
|
assert(tree->mbuf); |
/* |
if ( ! flush) |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
tree->mbuf = NULL; |
* the nil-terminated string name could be found. |
|
*/ |
/* LINTED */ |
static enum rofft |
while (tree->last) |
roff_hash_find(const char *p) |
if ( ! (*tokens[tree->last->tok].cb) |
|
(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, |
|
const struct md_rbuf *in) |
|
{ |
{ |
struct rofftree *tree; |
int i; |
|
|
if (NULL == (tree = calloc(1, sizeof(struct rofftree)))) { |
/* FIXME: make this be fast and efficient. */ |
warn("malloc"); |
|
return(NULL); |
|
} |
|
|
|
tree->state = ROFF_PRELUDE; |
for (i = 0; i < (int)ROFF_MAX; i++) |
tree->args = args; |
if (0 == strcmp(roffs[i].name, p)) |
tree->mbuf = out; |
return((enum rofft)i); |
tree->rbuf = in; |
|
|
|
return(tree); |
return(ROFF_MAX); |
} |
} |
|
|
|
|
int |
/* |
roff_engine(struct rofftree *tree, char *buf, size_t sz) |
* Pop the current node off of the stack of roff instructions currently |
|
* pending. |
|
*/ |
|
static void |
|
roffnode_pop(struct roff *r) |
{ |
{ |
|
struct roffnode *p; |
|
|
if (0 == sz) { |
if (NULL == (p = r->last)) |
warnx("%s: blank line (line %zu)", |
return; |
tree->rbuf->name, |
r->last = p->parent; |
tree->rbuf->line); |
if (p->end) |
return(0); |
free(p->end); |
} else if ('.' != *buf) |
free(p); |
return(textparse(tree, buf, sz)); |
|
|
|
return(roffparse(tree, buf, sz)); |
|
} |
} |
|
|
|
|
|
/* |
|
* Push a roff node onto the instruction stack. This must later be |
|
* removed with roffnode_pop(). |
|
*/ |
static int |
static int |
textparse(const struct rofftree *tree, const char *buf, size_t sz) |
roffnode_push(struct roff *r, enum rofft tok, int line, int col) |
{ |
{ |
|
struct roffnode *p; |
if (NULL == tree->last) { |
|
warnx("%s: unexpected text (line %zu)", |
if (NULL == (p = calloc(1, sizeof(struct roffnode)))) { |
tree->rbuf->name, |
(*r->msg)(MANDOCERR_MEM, r->data, line, col, NULL); |
tree->rbuf->line); |
|
return(0); |
return(0); |
} else if (NULL == tree->last->parent) { |
|
warnx("%s: disallowed text (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} |
} |
|
|
/* Print text. */ |
p->tok = tok; |
|
p->parent = r->last; |
|
p->line = line; |
|
p->col = col; |
|
|
|
r->last = p; |
return(1); |
return(1); |
} |
} |
|
|
|
|
static int |
static void |
roffargs(int tok, char *buf, char **argv) |
roff_free1(struct roff *r) |
{ |
{ |
int i; |
|
|
|
(void)tok;/* FIXME: quotable strings? */ |
while (r->last) |
|
roffnode_pop(r); |
|
} |
|
|
assert(tok >= 0 && tok < ROFF_MAX); |
|
assert('.' == *buf); |
|
|
|
/* LINTED */ |
void |
for (i = 0; *buf && i < ROFF_MAXARG; i++) { |
roff_reset(struct roff *r) |
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); |
roff_free1(r); |
} |
} |
|
|
|
|
static int |
void |
roffparse(struct rofftree *tree, char *buf, size_t sz) |
roff_free(struct roff *r) |
{ |
{ |
int tok, t; |
|
struct roffnode *node; |
|
char *argv[ROFF_MAXARG]; |
|
const char **argvp; |
|
|
|
assert(sz > 0); |
roff_free1(r); |
|
free(r); |
|
} |
|
|
/* |
|
* 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) { |
struct roff * |
warnx("%s: malformed line (line %zu)", |
roff_alloc(const mandocmsg msg, void *data) |
tree->rbuf->name, |
{ |
tree->rbuf->line); |
struct roff *r; |
return(0); |
|
} 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, tokens[tok].name, |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
/* Domain cross-contamination (and sanity) checks. */ |
if (NULL == (r = calloc(1, sizeof(struct roff)))) { |
|
(*msg)(MANDOCERR_MEM, data, 0, 0, NULL); |
switch (tokens[tok].type) { |
|
case (ROFF_TITLE): |
|
if (ROFF_PRELUDE & tree->state) { |
|
assert( ! (ROFF_BODY & tree->state)); |
|
break; |
|
} |
|
assert(ROFF_BODY & tree->state); |
|
warnx("%s: prelude token `%s' in body (line %zu)", |
|
tree->rbuf->name, tokens[tok].name, |
|
tree->rbuf->line); |
|
return(0); |
return(0); |
case (ROFF_LAYOUT): |
|
/* FALLTHROUGH */ |
|
case (ROFF_TEXT): |
|
if (ROFF_BODY & tree->state) { |
|
assert( ! (ROFF_PRELUDE & tree->state)); |
|
break; |
|
} |
|
assert(ROFF_PRELUDE & tree->state); |
|
warnx("%s: body token `%s' in prelude (line %zu)", |
|
tree->rbuf->name, tokens[tok].name, |
|
tree->rbuf->line); |
|
return(0); |
|
case (ROFF_COMMENT): |
|
return(1); |
|
default: |
|
abort(); |
|
} |
} |
|
|
/* |
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 && |
|
! (ROFF_NESTED & tokens[tok].flags)) { |
|
for (node = tree->last; node; node = node->parent) { |
|
if (node->tok == tok) |
|
break; |
|
|
|
/* Don't break nested scope. */ |
|
|
|
if ( ! (ROFF_NESTED & tokens[node->tok].flags)) |
|
continue; |
|
warnx("%s: scope of %s (line %zu) broken by " |
|
"%s (line %zu)", |
|
tree->rbuf->name, |
|
tokens[tok].name, |
|
node->line, |
|
tokens[node->tok].name, |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
} |
|
|
|
if (node) { |
|
assert(ROFF_LAYOUT == tokens[tok].type); |
|
assert( ! (ROFF_NESTED & tokens[tok].flags)); |
|
assert(node->tok == tok); |
|
|
|
/* Clear up to last scoped token. */ |
|
|
|
/* LINTED */ |
|
do { |
|
t = tree->last->tok; |
|
if ( ! (*tokens[tree->last->tok].cb) |
|
(tree, NULL, ROFF_EXIT)) |
|
return(0); |
|
} while (t != tok); |
|
} |
|
|
|
/* Proceed with actual token processing. */ |
|
|
|
argvp = (const char **)&argv[1]; |
|
return((*tokens[tok].cb)(tree, argvp, ROFF_ENTER)); |
|
} |
} |
|
|
|
|
static int |
enum rofferr |
rofffindarg(const char *name) |
roff_parseln(struct roff *r, int ln, |
|
char **bufp, size_t *szp, int pos, int *offs) |
{ |
{ |
size_t i; |
enum rofft t; |
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
/* If stacked, jump directly into its processing function. */ |
|
|
/* LINTED */ |
if (NULL != r->last) { |
for (i = 0; i < ROFF_ARGMAX; i++) |
t = r->last->tok; |
/* LINTED */ |
assert(roffs[t].sub); |
if (0 == strcmp(name, tokenargs[i].name)) |
return((*roffs[t].sub)(r, t, bufp, szp, ln, pos, offs)); |
return((int)i); |
} |
|
|
return(ROFF_ARGMAX); |
/* Return when in free text without a context. */ |
} |
|
|
|
|
if ('.' != (*bufp)[0] && '\'' != (*bufp)[0] && NULL == r->last) |
|
return(ROFF_CONT); |
|
|
static int |
/* There's nothing on the stack: make us anew. */ |
rofffindtok(const char *name) |
|
{ |
|
size_t i; |
|
|
|
/* FIXME: use a table, this is slow but ok for now. */ |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) |
|
return(ROFF_CONT); |
|
|
/* LINTED */ |
assert(roffs[t].new); |
for (i = 0; i < ROFF_MAX; i++) |
return((*roffs[t].new)(r, t, bufp, szp, ln, pos, offs)); |
/* LINTED */ |
|
if (0 == strncmp(name, tokens[i].name, 2)) |
|
return((int)i); |
|
|
|
return(ROFF_MAX); |
|
} |
} |
|
|
|
|
/* FIXME: accept only struct rofftree *. */ |
int |
static struct roffnode * |
roff_endparse(struct roff *r) |
roffnode_new(int tokid, size_t line, struct rofftree *tree) |
|
{ |
{ |
struct roffnode *p; |
|
|
|
if (NULL == (p = malloc(sizeof(struct roffnode)))) { |
|
warn("malloc"); |
|
return(NULL); |
|
} |
|
|
|
p->line = line; |
if (NULL == r->last) |
p->tok = tokid; |
return(1); |
p->parent = tree->last; |
return((*r->msg)(MANDOCERR_SCOPEEXIT, r->data, r->last->line, |
tree->last = p; |
r->last->col, NULL)); |
return(p); |
|
} |
} |
|
|
|
|
static void |
/* |
roffnode_free(int tokid, struct rofftree *tree) |
* 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) |
{ |
{ |
struct roffnode *p; |
int j; |
|
char mac[5]; |
|
enum rofft t; |
|
|
assert(tree->last); |
assert('.' == buf[0] || '\'' == buf[0]); |
assert(tree->last->tok == tokid); |
*pos = 1; |
|
|
p = tree->last; |
while (buf[*pos] && (' ' == buf[*pos] || '\t' == buf[*pos])) |
tree->last = tree->last->parent; |
(*pos)++; |
free(p); |
|
} |
|
|
|
|
if ('\0' == buf[*pos]) |
|
return(ROFF_MAX); |
|
|
static int dbg_lvl = 0; |
for (j = 0; j < 4; j++, (*pos)++) |
|
if ('\0' == (mac[j] = buf[*pos])) |
|
break; |
|
else if (' ' == buf[*pos]) |
|
break; |
|
|
|
if (j == 4 || j < 1) |
|
return(ROFF_MAX); |
|
|
static void |
mac[j] = '\0'; |
dbg_enter(const struct md_args *args, int tokid) |
|
{ |
|
int i; |
|
static char buf[72]; |
|
|
|
assert(args); |
if (ROFF_MAX == (t = roff_hash_find(mac))) |
if ( ! (args->dbg & MD_DBG_TREE)) |
return(t); |
return; |
|
assert(tokid >= 0 && tokid <= ROFF_MAX); |
|
|
|
buf[0] = buf[71] = 0; |
while (buf[*pos] && ' ' == buf[*pos]) |
|
(*pos)++; |
|
|
switch (tokens[tokid].type) { |
return(t); |
case (ROFF_LAYOUT): |
|
(void)strncat(buf, "[body-layout] ", sizeof(buf) - 1); |
|
break; |
|
case (ROFF_TEXT): |
|
(void)strncat(buf, "[ body-text] ", sizeof(buf) - 1); |
|
break; |
|
case (ROFF_TITLE): |
|
(void)strncat(buf, "[ prelude] ", sizeof(buf) - 1); |
|
break; |
|
default: |
|
abort(); |
|
} |
|
|
|
/* LINTED */ |
|
for (i = 0; i < dbg_lvl; i++) |
|
(void)strncat(buf, " ", sizeof(buf) - 1); |
|
|
|
(void)strncat(buf, tokens[tokid].name, sizeof(buf) - 1); |
|
|
|
(void)printf("%s\n", buf); |
|
|
|
dbg_lvl++; |
|
} |
} |
|
|
|
|
/* FIXME: accept only struct rofftree *. */ |
#if 0 |
static void |
|
dbg_leave(const struct md_args *args, int tokid) |
|
{ |
|
assert(args); |
|
if ( ! (args->dbg & MD_DBG_TREE)) |
|
return; |
|
|
|
assert(tokid >= 0 && tokid <= ROFF_MAX); |
|
assert(dbg_lvl > 0); |
|
dbg_lvl--; |
|
} |
|
|
|
|
|
/* FIXME: accept only struct rofftree *. */ |
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Dd(ROFFCALL_ARGS) |
roff_sub_ig(ROFF_ARGS) |
{ |
{ |
|
int i, j; |
|
|
dbg_enter(tree->args, ROFF_Dd); |
/* Ignore free-text lines. */ |
|
|
assert(ROFF_PRELUDE & tree->state); |
if ('.' != (*bufp)[ppos] && '\'' != (*bufp)[ppos]) |
if (ROFF_PRELUDE_Dt & tree->state || |
return(ROFF_IGN); |
ROFF_PRELUDE_Dd & tree->state) { |
|
warnx("%s: prelude `Dd' out-of-order (line %zu)", |
|
tree->rbuf->name, tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
assert(NULL == tree->last); |
if (r->last->end) { |
tree->state |= ROFF_PRELUDE_Dd; |
i = ppos + 1; |
|
|
dbg_leave(tree->args, ROFF_Dd); |
while ((*bufp)[i] && ' ' == (*bufp)[i]) |
|
i++; |
|
|
return(1); |
for (j = 0; r->last->end[j]; i++, j++) |
} |
if ((*bufp)[i] != r->last->end[j]) |
|
return(ROFF_IGN); |
|
|
|
if (r->last->end[j]) |
|
return(ROFF_IGN); |
|
if ((*bufp)[i] && ' ' != (*bufp)[i]) |
|
return(ROFF_IGN); |
|
|
/* ARGSUSED */ |
while (' ' == (*bufp)[i]) |
static int |
i++; |
roff_Dt(ROFFCALL_ARGS) |
|
{ |
|
|
|
dbg_enter(tree->args, ROFF_Dt); |
} else if (ROFF_close != roff_parse(*bufp, &i)) |
|
return(ROFF_IGN); |
|
|
assert(ROFF_PRELUDE & tree->state); |
roffnode_pop(r); |
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); |
|
} |
|
|
|
assert(NULL == tree->last); |
if ('\0' == (*bufp)[i]) |
tree->state |= ROFF_PRELUDE_Dt; |
return(ROFF_IGN); |
|
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, i, NULL)) |
|
return(ROFF_ERR); |
|
|
dbg_leave(tree->args, ROFF_Dt); |
return(ROFF_IGN); |
|
|
return(1); |
|
} |
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static int |
static enum rofferr |
roff_Os(ROFFCALL_ARGS) |
roff_new_close(ROFF_ARGS) |
{ |
{ |
|
|
if (ROFF_EXIT == type) { |
if ( ! (*r->msg)(MANDOCERR_NOSCOPE, r->data, ln, ppos, NULL)) |
roffnode_free(ROFF_Os, tree); |
return(ROFF_ERR); |
dbg_leave(tree->args, ROFF_Os); |
|
return(1); |
|
} |
|
|
|
dbg_enter(tree->args, ROFF_Os); |
return(ROFF_IGN); |
|
} |
|
|
assert(ROFF_PRELUDE & tree->state); |
|
if ( ! (ROFF_PRELUDE_Dt & tree->state) || |
|
! (ROFF_PRELUDE_Dd & tree->state)) { |
|
warnx("%s: prelude `Os' out-of-order (line %zu)", |
|
tree->rbuf->name, tree->rbuf->line); |
|
return(0); |
|
} |
|
|
|
assert(NULL == tree->last); |
static enum rofferr |
if (NULL == roffnode_new(ROFF_Os, tree->rbuf->line, tree)) |
roff_sub_if(ROFF_ARGS) |
return(0); |
{ |
|
int i; |
|
enum rofft t; |
|
|
tree->state |= ROFF_PRELUDE_Os; |
i = (int)strlen(*bufp); |
tree->state &= ~ROFF_PRELUDE; |
|
tree->state |= ROFF_BODY; |
|
|
|
return(1); |
if (i > 1 && '}' == (*bufp)[i - 1] && '\\' == (*bufp)[i - 2]) |
|
roffnode_pop(r); |
|
|
|
return(ROFF_IGN); |
} |
} |
|
|
|
|
/* ARGSUSED */ |
static enum rofferr |
static int |
roff_new_if(ROFF_ARGS) |
roff_Sh(ROFFCALL_ARGS) |
|
{ |
{ |
|
struct roffnode *n; |
|
enum rofferr re; |
|
|
if (ROFF_EXIT == type) { |
/* |
roffnode_free(ROFF_Sh, tree); |
* Read ahead past the conditional. |
dbg_leave(tree->args, ROFF_Sh); |
* FIXME: this does not work, as conditionals don't end on |
return(1); |
* whitespace, but are parsed according to a formal grammar. |
} |
* It's good enough for now, however. |
|
*/ |
|
|
dbg_enter(tree->args, ROFF_Sh); |
while ((*bufp)[ppos] && ' ' != (*bufp)[ppos]) |
|
ppos++; |
|
while (' ' == (*bufp)[ppos]) |
|
ppos++; |
|
|
if (NULL == roffnode_new(ROFF_Sh, tree->rbuf->line, tree)) |
if ( ! roffnode_push(r, tok, ln, ppos)) |
return(0); |
return(ROFF_ERR); |
|
|
return(1); |
n = r->last; |
} |
|
|
|
|
/* Don't evaluate: just assume NO. */ |
|
|
/* ARGSUSED */ |
r->last->flags |= ROFF_PARSEONLY; |
static int |
|
roff_Li(ROFFCALL_ARGS) |
|
{ |
|
|
|
dbg_enter(tree->args, ROFF_Li); |
if ('\\' == (*bufp)[ppos] && '{' == (*bufp)[ppos + 1]) { |
dbg_leave(tree->args, ROFF_Li); |
re = roff_parseln(r, ln, bufp, szp, pos); |
|
if (ROFF_ERR == re) |
|
return(re); |
|
if (r->last == n) |
|
roffnode_pop(r, tok, ln, ppos); |
|
return(re); |
|
} |
|
|
return(1); |
return(ROFF_IGN); |
} |
} |
|
|
|
|
static int |
static enum rofferr |
roffnextopt(const char ***in, char **val) |
roff_new_ig(ROFF_ARGS) |
{ |
{ |
const char *arg, **argv; |
int i; |
int v; |
|
|
|
*val = NULL; |
if ( ! roffnode_push(r, tok, ln, ppos)) |
argv = *in; |
return(ROFF_ERR); |
assert(argv); |
|
|
/* |
|
* Other macros (not `ig') using this routine have additional |
|
* crap here that we discard. |
|
*/ |
|
|
if (NULL == (arg = *argv)) |
if (ROFF_ig != tok) { |
return(-1); |
while ((*bufp)[ppos] && ' ' != (*bufp)[ppos]) |
if ('-' != *arg) |
ppos++; |
return(-1); |
while (' ' == (*bufp)[ppos]) |
if (ROFF_ARGMAX == (v = rofffindarg(&arg[1]))) |
ppos++; |
return(-1); |
} |
if ( ! (ROFF_VALUE & tokenargs[v].flags)) |
|
return(v); |
|
|
|
*in = ++argv; |
i = (int)ppos; |
|
|
/* FIXME: what if this looks like a roff token or argument? */ |
while ((*bufp)[i] && ' ' != (*bufp)[i]) |
|
i++; |
|
|
return(*argv ? v : ROFF_ARGMAX); |
if (i == (int)ppos) |
} |
return(ROFF_IGN); |
|
|
|
if ((*bufp)[i]) |
|
if ( ! (*r->msg)(MANDOCERR_ARGSLOST, r->data, ln, i, NULL)) |
|
return(ROFF_ERR); |
|
|
/* ARGSUSED */ |
/* |
static int |
* If the macro has arguments, the first argument (up to the |
roff_An(ROFFCALL_ARGS) |
* next whitespace) is interpreted as an argument marking the |
{ |
* macro close. Thus, `.ig foo' will close at `.foo'. |
int c; |
* |
char *val; |
* NOTE: the closing macro `.foo' in the above case is not |
|
* allowed to have leading spaces with old groff! Thus `.foo' |
|
* != `. foo'. Oh yeah, everything after the `.foo' is lost. |
|
* Merry fucking Christmas. |
|
*/ |
|
|
dbg_enter(tree->args, ROFF_An); |
r->last->end = malloc((size_t)(i - ppos) + 1); |
|
if (NULL == r->last->end) { |
while (-1 != (c = roffnextopt(&argv, &val))) { |
(*r->msg)(MANDOCERR_MEM, r->data, ln, ppos, NULL); |
switch (c) { |
return(ROFF_ERR); |
case (ROFF_Split): |
|
/* Process argument. */ |
|
break; |
|
case (ROFF_Nosplit): |
|
/* Process argument. */ |
|
break; |
|
default: |
|
warnx("%s: error parsing `An' args (line %zu)", |
|
tree->rbuf->name, |
|
tree->rbuf->line); |
|
return(0); |
|
} |
|
argv++; |
|
} |
} |
|
|
/* Print header. */ |
memcpy(r->last->end, &(*bufp)[ppos], (size_t)(i - ppos)); |
|
r->last->end[i - ppos] = '\0'; |
while (*argv) { |
|
if (/* is_parsable && */ 2 >= strlen(*argv)) { |
|
if (ROFF_MAX != (c = rofffindtok(*argv))) { |
|
if (ROFF_CALLABLE & tokens[c].flags) { |
|
/* Call to token. */ |
|
if ( ! (*tokens[c].cb)(tree, (const char **)argv + 1, ROFF_ENTER)) |
|
return(0); |
|
} |
|
/* Print token. */ |
|
} else { |
|
/* Print token. */ |
|
} |
|
} else { |
|
/* Print token. */ |
|
} |
|
argv++; |
|
} |
|
|
|
/* Print footer. */ |
return(ROFF_IGN); |
|
|
dbg_leave(tree->args, ROFF_An); |
|
|
|
return(1); |
|
} |
} |
|
#endif |