version 1.83, 2010/05/24 22:25:58 |
version 1.93, 2010/07/04 22:04:04 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
* Copyright (c) 2010 Kristaps Dzonsons <kristaps@bsd.lv> |
|
* Copyright (c) 2010 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 |
|
|
#endif |
#endif |
|
|
#include <assert.h> |
#include <assert.h> |
|
#include <errno.h> |
|
#include <ctype.h> |
|
#include <limits.h> |
#include <stdlib.h> |
#include <stdlib.h> |
#include <string.h> |
#include <string.h> |
#include <stdio.h> |
#include <stdio.h> |
|
|
#include "mandoc.h" |
#include "mandoc.h" |
|
#include "regs.h" |
#include "roff.h" |
#include "roff.h" |
|
|
#define RSTACK_MAX 128 |
#define RSTACK_MAX 128 |
|
|
#define ROFF_CTL(c) \ |
#define ROFF_CTL(c) \ |
('.' == (c) || '\'' == (c)) |
('.' == (c) || '\'' == (c)) |
|
|
|
#if 1 |
|
#define ROFF_DEBUG(fmt, args...) \ |
|
do { /* Nothing. */ } while (/*CONSTCOND*/ 0) |
|
#else |
|
#define ROFF_DEBUG(fmt, args...) \ |
|
do { fprintf(stderr, fmt , ##args); } while (/*CONSTCOND*/ 0) |
|
#endif |
|
|
enum rofft { |
enum rofft { |
ROFF_am, |
ROFF_am, |
ROFF_ami, |
ROFF_ami, |
|
|
ROFF_tr, |
ROFF_tr, |
ROFF_cblock, |
ROFF_cblock, |
ROFF_ccond, |
ROFF_ccond, |
|
ROFF_nr, |
ROFF_MAX |
ROFF_MAX |
}; |
}; |
|
|
|
|
void *data; /* privdata for messages */ |
void *data; /* privdata for messages */ |
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
enum roffrule rstack[RSTACK_MAX]; /* stack of !`ie' rules */ |
int rstackpos; /* position in rstack */ |
int rstackpos; /* position in rstack */ |
|
struct regset *regs; /* read/writable registers */ |
}; |
}; |
|
|
struct roffnode { |
struct roffnode { |
|
Line 106 struct roffmac { |
|
roffproc sub; /* process as child of macro */ |
roffproc sub; /* process as child of macro */ |
int flags; |
int flags; |
#define ROFFMAC_STRUCT (1 << 0) /* always interpret */ |
#define ROFFMAC_STRUCT (1 << 0) /* always interpret */ |
|
struct roffmac *next; |
}; |
}; |
|
|
|
struct roffstr { |
|
char *name; |
|
char *string; |
|
struct roffstr *next; |
|
} *first_string; |
|
|
static enum rofferr roff_block(ROFF_ARGS); |
static enum rofferr roff_block(ROFF_ARGS); |
static enum rofferr roff_block_text(ROFF_ARGS); |
static enum rofferr roff_block_text(ROFF_ARGS); |
static enum rofferr roff_block_sub(ROFF_ARGS); |
static enum rofferr roff_block_sub(ROFF_ARGS); |
Line 101 static enum rofferr roff_ccond(ROFF_ARGS); |
|
Line 123 static enum rofferr roff_ccond(ROFF_ARGS); |
|
static enum rofferr roff_cond(ROFF_ARGS); |
static enum rofferr roff_cond(ROFF_ARGS); |
static enum rofferr roff_cond_text(ROFF_ARGS); |
static enum rofferr roff_cond_text(ROFF_ARGS); |
static enum rofferr roff_cond_sub(ROFF_ARGS); |
static enum rofferr roff_cond_sub(ROFF_ARGS); |
|
static enum rofferr roff_ds(ROFF_ARGS); |
static enum rofferr roff_line(ROFF_ARGS); |
static enum rofferr roff_line(ROFF_ARGS); |
|
static enum rofferr roff_nr(ROFF_ARGS); |
|
static enum roffrule roff_evalcond(const char *, int *); |
|
|
const struct roffmac roffs[ROFF_MAX] = { |
/* See roff_hash_find() */ |
{ "am", roff_block, roff_block_text, roff_block_sub, 0 }, |
|
{ "ami", roff_block, roff_block_text, roff_block_sub, 0 }, |
#define ASCII_HI 126 |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0 }, |
#define ASCII_LO 33 |
{ "de", roff_block, roff_block_text, roff_block_sub, 0 }, |
#define HASHWIDTH (ASCII_HI - ASCII_LO + 1) |
{ "dei", roff_block, roff_block_text, roff_block_sub, 0 }, |
|
{ "de1", roff_block, roff_block_text, roff_block_sub, 0 }, |
static struct roffmac *hash[HASHWIDTH]; |
{ "ds", roff_line, NULL, NULL, 0 }, |
|
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT }, |
static struct roffmac roffs[ROFF_MAX] = { |
{ "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT }, |
{ "am", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT }, |
{ "ami", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "ig", roff_block, roff_block_text, roff_block_sub, 0 }, |
{ "am1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "rm", roff_line, NULL, NULL, 0 }, |
{ "de", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "tr", roff_line, NULL, NULL, 0 }, |
{ "dei", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ ".", roff_cblock, NULL, NULL, 0 }, |
{ "de1", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
{ "\\}", roff_ccond, NULL, NULL, 0 }, |
{ "ds", roff_ds, NULL, NULL, 0, NULL }, |
|
{ "el", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
|
{ "ie", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
|
{ "if", roff_cond, roff_cond_text, roff_cond_sub, ROFFMAC_STRUCT, NULL }, |
|
{ "ig", roff_block, roff_block_text, roff_block_sub, 0, NULL }, |
|
{ "rm", roff_line, NULL, NULL, 0, NULL }, |
|
{ "tr", roff_line, NULL, NULL, 0, NULL }, |
|
{ ".", roff_cblock, NULL, NULL, 0, NULL }, |
|
{ "\\}", roff_ccond, NULL, NULL, 0, NULL }, |
|
{ "nr", roff_nr, NULL, NULL, 0, NULL }, |
}; |
}; |
|
|
static void roff_free1(struct roff *); |
static void roff_free1(struct roff *); |
static enum rofft roff_hash_find(const char *); |
static enum rofft roff_hash_find(const char *); |
|
static void roff_hash_init(void); |
static void roffnode_cleanscope(struct roff *); |
static void roffnode_cleanscope(struct roff *); |
static int roffnode_push(struct roff *, |
static int roffnode_push(struct roff *, |
enum rofft, int, int); |
enum rofft, int, int); |
static void roffnode_pop(struct roff *); |
static void roffnode_pop(struct roff *); |
static enum rofft roff_parse(const char *, int *); |
static enum rofft roff_parse(const char *, int *); |
|
static int roff_parse_nat(const char *, unsigned int *); |
|
|
|
/* See roff_hash_find() */ |
|
#define ROFF_HASH(p) (p[0] - ASCII_LO) |
|
|
|
static void |
|
roff_hash_init(void) |
|
{ |
|
struct roffmac *n; |
|
int buc, i; |
|
|
|
for (i = 0; i < (int)ROFF_MAX; i++) { |
|
assert(roffs[i].name[0] >= ASCII_LO); |
|
assert(roffs[i].name[0] <= ASCII_HI); |
|
|
|
buc = ROFF_HASH(roffs[i].name); |
|
|
|
if (NULL != (n = hash[buc])) { |
|
for ( ; n->next; n = n->next) |
|
/* Do nothing. */ ; |
|
n->next = &roffs[i]; |
|
} else |
|
hash[buc] = &roffs[i]; |
|
} |
|
} |
|
|
|
|
/* |
/* |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
* Look up a roff token by its name. Returns ROFF_MAX if no macro by |
* the nil-terminated string name could be found. |
* the nil-terminated string name could be found. |
Line 137 static enum rofft roff_parse(const char *, int *); |
|
Line 197 static enum rofft roff_parse(const char *, int *); |
|
static enum rofft |
static enum rofft |
roff_hash_find(const char *p) |
roff_hash_find(const char *p) |
{ |
{ |
int i; |
int buc; |
|
struct roffmac *n; |
|
|
/* FIXME: make this be fast and efficient. */ |
/* |
|
* libroff has an extremely simple hashtable, for the time |
|
* being, which simply keys on the first character, which must |
|
* be printable, then walks a chain. It works well enough until |
|
* optimised. |
|
*/ |
|
|
for (i = 0; i < (int)ROFF_MAX; i++) |
if (p[0] < ASCII_LO || p[0] > ASCII_HI) |
if (0 == strcmp(roffs[i].name, p)) |
return(ROFF_MAX); |
return((enum rofft)i); |
|
|
|
|
buc = ROFF_HASH(p); |
|
|
|
if (NULL == (n = hash[buc])) |
|
return(ROFF_MAX); |
|
for ( ; n; n = n->next) |
|
if (0 == strcmp(n->name, p)) |
|
return((enum rofft)(n - roffs)); |
|
|
return(ROFF_MAX); |
return(ROFF_MAX); |
} |
} |
|
|
Line 203 roff_free1(struct roff *r) |
|
Line 276 roff_free1(struct roff *r) |
|
|
|
while (r->last) |
while (r->last) |
roffnode_pop(r); |
roffnode_pop(r); |
|
roff_freestr(); |
} |
} |
|
|
|
|
Line 224 roff_free(struct roff *r) |
|
Line 298 roff_free(struct roff *r) |
|
|
|
|
|
struct roff * |
struct roff * |
roff_alloc(const mandocmsg msg, void *data) |
roff_alloc(struct regset *regs, const mandocmsg msg, void *data) |
{ |
{ |
struct roff *r; |
struct roff *r; |
|
|
Line 233 roff_alloc(const mandocmsg msg, void *data) |
|
Line 307 roff_alloc(const mandocmsg msg, void *data) |
|
return(0); |
return(0); |
} |
} |
|
|
|
r->regs = regs; |
r->msg = msg; |
r->msg = msg; |
r->data = data; |
r->data = data; |
r->rstackpos = -1; |
r->rstackpos = -1; |
|
|
|
roff_hash_init(); |
return(r); |
return(r); |
} |
} |
|
|
|
|
enum rofferr |
enum rofferr |
roff_parseln(struct roff *r, int ln, |
roff_parseln(struct roff *r, int ln, char **bufp, |
char **bufp, size_t *szp, int pos, int *offs) |
size_t *szp, int pos, int *offs) |
{ |
{ |
enum rofft t; |
enum rofft t; |
int ppos; |
int ppos; |
Line 256 roff_parseln(struct roff *r, int ln, |
|
Line 333 roff_parseln(struct roff *r, int ln, |
|
if (r->last && ! ROFF_CTL((*bufp)[pos])) { |
if (r->last && ! ROFF_CTL((*bufp)[pos])) { |
t = r->last->tok; |
t = r->last->tok; |
assert(roffs[t].text); |
assert(roffs[t].text); |
|
ROFF_DEBUG("roff: intercept scoped text: %s, [%s]\n", |
|
roffs[t].name, &(*bufp)[pos]); |
return((*roffs[t].text) |
return((*roffs[t].text) |
(r, t, bufp, szp, ln, pos, pos, offs)); |
(r, t, bufp, szp, |
} else if ( ! ROFF_CTL((*bufp)[pos])) |
ln, pos, pos, offs)); |
|
} else if ( ! ROFF_CTL((*bufp)[pos])) { |
|
ROFF_DEBUG("roff: pass non-scoped text: [%s]\n", |
|
&(*bufp)[pos]); |
return(ROFF_CONT); |
return(ROFF_CONT); |
|
} |
|
|
/* |
/* |
* If a scope is open, go to the child handler for that macro, |
* If a scope is open, go to the child handler for that macro, |
Line 269 roff_parseln(struct roff *r, int ln, |
|
Line 352 roff_parseln(struct roff *r, int ln, |
|
if (r->last) { |
if (r->last) { |
t = r->last->tok; |
t = r->last->tok; |
assert(roffs[t].sub); |
assert(roffs[t].sub); |
|
ROFF_DEBUG("roff: intercept scoped context: %s\n", |
|
roffs[t].name); |
return((*roffs[t].sub) |
return((*roffs[t].sub) |
(r, t, bufp, szp, ln, pos, pos, offs)); |
(r, t, bufp, szp, |
|
ln, pos, pos, offs)); |
} |
} |
|
|
/* |
/* |
Line 280 roff_parseln(struct roff *r, int ln, |
|
Line 366 roff_parseln(struct roff *r, int ln, |
|
*/ |
*/ |
|
|
ppos = pos; |
ppos = pos; |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) { |
|
ROFF_DEBUG("roff: pass non-scoped non-macro: [%s]\n", |
|
&(*bufp)[pos]); |
return(ROFF_CONT); |
return(ROFF_CONT); |
|
} |
|
|
|
ROFF_DEBUG("roff: intercept new-scope: %s, [%s]\n", |
|
roffs[t].name, &(*bufp)[pos]); |
assert(roffs[t].proc); |
assert(roffs[t].proc); |
return((*roffs[t].proc) |
return((*roffs[t].proc) |
(r, t, bufp, szp, ln, ppos, pos, offs)); |
(r, t, bufp, szp, |
|
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
Line 341 roff_parse(const char *buf, int *pos) |
|
Line 433 roff_parse(const char *buf, int *pos) |
|
} |
} |
|
|
|
|
|
static int |
|
roff_parse_nat(const char *buf, unsigned int *res) |
|
{ |
|
char *ep; |
|
long lval; |
|
|
|
errno = 0; |
|
lval = strtol(buf, &ep, 10); |
|
if (buf[0] == '\0' || *ep != '\0') |
|
return(0); |
|
if ((errno == ERANGE && |
|
(lval == LONG_MAX || lval == LONG_MIN)) || |
|
(lval > INT_MAX || lval < 0)) |
|
return(0); |
|
|
|
*res = (unsigned int)lval; |
|
return(1); |
|
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_cblock(ROFF_ARGS) |
roff_cblock(ROFF_ARGS) |
Line 551 roff_block_sub(ROFF_ARGS) |
|
Line 663 roff_block_sub(ROFF_ARGS) |
|
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
assert(roffs[t].proc); |
assert(roffs[t].proc); |
return((*roffs[t].proc)(r, t, bufp, |
return((*roffs[t].proc)(r, t, bufp, szp, |
szp, ln, ppos, pos, offs)); |
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
Line 571 roff_cond_sub(ROFF_ARGS) |
|
Line 683 roff_cond_sub(ROFF_ARGS) |
|
{ |
{ |
enum rofft t; |
enum rofft t; |
enum roffrule rr; |
enum roffrule rr; |
|
struct roffnode *l; |
|
|
ppos = pos; |
ppos = pos; |
rr = r->last->rule; |
rr = r->last->rule; |
|
|
|
/* |
|
* Clean out scope. If we've closed ourselves, then don't |
|
* continue. |
|
*/ |
|
|
|
l = r->last; |
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
|
|
|
if (l != r->last) |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
|
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) |
if (ROFF_MAX == (t = roff_parse(*bufp, &pos))) |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
|
|
Line 591 roff_cond_sub(ROFF_ARGS) |
|
Line 713 roff_cond_sub(ROFF_ARGS) |
|
return(ROFF_IGN); |
return(ROFF_IGN); |
|
|
assert(roffs[t].proc); |
assert(roffs[t].proc); |
return((*roffs[t].proc) |
return((*roffs[t].proc)(r, t, bufp, szp, |
(r, t, bufp, szp, ln, ppos, pos, offs)); |
ln, ppos, pos, offs)); |
} |
} |
|
|
|
|
Line 616 roff_cond_text(ROFF_ARGS) |
|
Line 738 roff_cond_text(ROFF_ARGS) |
|
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
return(ROFFRULE_DENY == rr ? ROFF_IGN : ROFF_CONT); |
} |
} |
|
|
if (ep > st && '\\' != *(ep - 1)) |
if (ep == st || (ep > st && '\\' != *(ep - 1))) |
roffnode_pop(r); |
roffnode_pop(r); |
|
|
roffnode_cleanscope(r); |
roffnode_cleanscope(r); |
Line 624 roff_cond_text(ROFF_ARGS) |
|
Line 746 roff_cond_text(ROFF_ARGS) |
|
} |
} |
|
|
|
|
|
static enum roffrule |
|
roff_evalcond(const char *v, int *pos) |
|
{ |
|
|
|
switch (v[*pos]) { |
|
case ('n'): |
|
(*pos)++; |
|
return(ROFFRULE_ALLOW); |
|
case ('e'): |
|
/* FALLTHROUGH */ |
|
case ('o'): |
|
/* FALLTHROUGH */ |
|
case ('t'): |
|
(*pos)++; |
|
return(ROFFRULE_DENY); |
|
default: |
|
break; |
|
} |
|
|
|
while (v[*pos] && ' ' != v[*pos]) |
|
(*pos)++; |
|
return(ROFFRULE_DENY); |
|
} |
|
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
|
roff_line(ROFF_ARGS) |
|
{ |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
roff_cond(ROFF_ARGS) |
roff_cond(ROFF_ARGS) |
{ |
{ |
int sv; |
int sv; |
|
enum roffrule rule; |
|
|
/* Stack overflow! */ |
/* Stack overflow! */ |
|
|
Line 637 roff_cond(ROFF_ARGS) |
|
Line 794 roff_cond(ROFF_ARGS) |
|
return(ROFF_ERR); |
return(ROFF_ERR); |
} |
} |
|
|
if (ROFF_if == tok || ROFF_ie == tok) { |
/* First, evaluate the conditional. */ |
/* |
|
* Read ahead past the conditional. FIXME: this does |
|
* not work, as conditionals don't end on whitespace, |
|
* but are parsed according to a formal grammar. It's |
|
* good enough for now, however. |
|
*/ |
|
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
|
pos++; |
|
} |
|
|
|
|
if (ROFF_el == tok) { |
|
/* |
|
* An `.el' will get the value of the current rstack |
|
* entry set in prior `ie' calls or defaults to DENY. |
|
*/ |
|
if (r->rstackpos < 0) |
|
rule = ROFFRULE_DENY; |
|
else |
|
rule = r->rstack[r->rstackpos]; |
|
} else |
|
rule = roff_evalcond(*bufp, &pos); |
|
|
sv = pos; |
sv = pos; |
|
|
while (' ' == (*bufp)[pos]) |
while (' ' == (*bufp)[pos]) |
pos++; |
pos++; |
|
|
Line 658 roff_cond(ROFF_ARGS) |
|
Line 819 roff_cond(ROFF_ARGS) |
|
* really doing anything. Warn about this. It's probably |
* really doing anything. Warn about this. It's probably |
* wrong. |
* wrong. |
*/ |
*/ |
|
|
if ('\0' == (*bufp)[pos] && sv != pos) { |
if ('\0' == (*bufp)[pos] && sv != pos) { |
if ( ! (*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL)) |
if ((*r->msg)(MANDOCERR_NOARGS, r->data, ln, ppos, NULL)) |
return(ROFF_ERR); |
return(ROFF_IGN); |
return(ROFF_IGN); |
return(ROFF_ERR); |
} |
} |
|
|
if ( ! roffnode_push(r, tok, ln, ppos)) |
if ( ! roffnode_push(r, tok, ln, ppos)) |
return(ROFF_ERR); |
return(ROFF_ERR); |
|
|
/* TODO: here we would evaluate the conditional. */ |
r->last->rule = rule; |
|
|
if (ROFF_el == tok) { |
ROFF_DEBUG("roff: cond: %s -> %s\n", roffs[tok].name, |
/* |
ROFFRULE_ALLOW == rule ? "allow" : "deny"); |
* An `.el' will get the value of the current rstack |
|
* entry set in prior `ie' calls or defaults to DENY. |
if (ROFF_ie == tok) { |
*/ |
|
if (r->rstackpos < 0) |
|
r->last->rule = ROFFRULE_DENY; |
|
else |
|
r->last->rule = r->rstack[r->rstackpos]; |
|
} else if (ROFF_ie == tok) { |
|
/* |
/* |
* An if-else will put the NEGATION of the current |
* An if-else will put the NEGATION of the current |
* evaluated conditional into the stack. |
* evaluated conditional into the stack. |
Line 690 roff_cond(ROFF_ARGS) |
|
Line 846 roff_cond(ROFF_ARGS) |
|
r->rstack[r->rstackpos] = ROFFRULE_DENY; |
r->rstack[r->rstackpos] = ROFFRULE_DENY; |
} |
} |
|
|
|
/* If the parent has false as its rule, then so do we. */ |
|
|
|
if (r->last->parent && ROFFRULE_DENY == r->last->parent->rule) { |
|
r->last->rule = ROFFRULE_DENY; |
|
ROFF_DEBUG("roff: cond override: %s -> deny\n", |
|
roffs[tok].name); |
|
} |
|
|
|
/* |
|
* Determine scope. If we're invoked with "\{" trailing the |
|
* conditional, then we're in a multiline scope. Else our scope |
|
* expires on the next line. |
|
*/ |
|
|
r->last->endspan = 1; |
r->last->endspan = 1; |
|
|
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
if ('\\' == (*bufp)[pos] && '{' == (*bufp)[pos + 1]) { |
r->last->endspan = -1; |
r->last->endspan = -1; |
pos += 2; |
pos += 2; |
} |
ROFF_DEBUG("roff: cond-scope: %s, multi-line\n", |
|
roffs[tok].name); |
|
} else |
|
ROFF_DEBUG("roff: cond-scope: %s, one-line\n", |
|
roffs[tok].name); |
|
|
/* |
/* |
* If there are no arguments on the line, the next-line scope is |
* If there are no arguments on the line, the next-line scope is |
Line 714 roff_cond(ROFF_ARGS) |
|
Line 888 roff_cond(ROFF_ARGS) |
|
|
|
/* ARGSUSED */ |
/* ARGSUSED */ |
static enum rofferr |
static enum rofferr |
roff_line(ROFF_ARGS) |
roff_ds(ROFF_ARGS) |
{ |
{ |
|
char *name, *string, *end; |
|
|
|
name = *bufp + pos; |
|
if ('\0' == *name) |
|
return(ROFF_IGN); |
|
|
|
string = name; |
|
while (*string && ' ' != *string) |
|
string++; |
|
if (*string) |
|
*(string++) = NULL; |
|
if (*string && '"' == *string) |
|
string++; |
|
while (*string && ' ' == *string) |
|
string++; |
|
end = string; |
|
while (*end) |
|
end++; |
|
if (string < end) { |
|
end--; |
|
if (*end == '"') |
|
*end = '\0'; |
|
} |
|
|
|
roff_setstr(name, string); |
return(ROFF_IGN); |
return(ROFF_IGN); |
|
} |
|
|
|
|
|
/* ARGSUSED */ |
|
static enum rofferr |
|
roff_nr(ROFF_ARGS) |
|
{ |
|
const char *key, *val; |
|
struct reg *rg; |
|
|
|
key = &(*bufp)[pos]; |
|
rg = r->regs->regs; |
|
|
|
/* Parse register request. */ |
|
while ((*bufp)[pos] && ' ' != (*bufp)[pos]) |
|
pos++; |
|
|
|
/* |
|
* Set our nil terminator. Because this line is going to be |
|
* ignored anyway, we can munge it as we please. |
|
*/ |
|
if ((*bufp)[pos]) |
|
(*bufp)[pos++] = '\0'; |
|
|
|
/* Skip whitespace to register token. */ |
|
while ((*bufp)[pos] && ' ' == (*bufp)[pos]) |
|
pos++; |
|
|
|
val = &(*bufp)[pos]; |
|
|
|
/* Process register token. */ |
|
|
|
if (0 == strcmp(key, "nS")) { |
|
rg[(int)REG_nS].set = 1; |
|
if ( ! roff_parse_nat(val, &rg[(int)REG_nS].v.u)) |
|
rg[(int)REG_nS].v.u = 0; |
|
|
|
ROFF_DEBUG("roff: register nS: %u\n", |
|
rg[(int)REG_nS].v.u); |
|
} else |
|
ROFF_DEBUG("roff: ignoring register: %s\n", key); |
|
|
|
return(ROFF_IGN); |
|
} |
|
|
|
|
|
char * |
|
roff_setstr(const char *name, const char *string) |
|
{ |
|
struct roffstr *n; |
|
char *namecopy; |
|
|
|
n = first_string; |
|
while (n && strcmp(name, n->name)) |
|
n = n->next; |
|
if (n) { |
|
free(n->string); |
|
} else { |
|
if (NULL == (namecopy = strdup(name))) |
|
return(NULL); |
|
if (NULL == (n = malloc(sizeof(struct roffstr)))) { |
|
free(n); |
|
return(NULL); |
|
} |
|
n->name = namecopy; |
|
n->next = first_string; |
|
first_string = n; |
|
} |
|
if (string) |
|
n->string = strdup(string); |
|
else |
|
n->string = NULL; |
|
return(n->string); |
|
} |
|
|
|
char * |
|
roff_getstr(const char *name) |
|
{ |
|
struct roffstr *n; |
|
|
|
n = first_string; |
|
while (n && strcmp(name, n->name)) |
|
n = n->next; |
|
if (n) |
|
return(n->string); |
|
else |
|
return(NULL); |
|
} |
|
|
|
char * |
|
roff_getstrn(const char *name, size_t len) |
|
{ |
|
struct roffstr *n; |
|
|
|
n = first_string; |
|
while (n && (strncmp(name, n->name, len) || '\0' != n->name[len])) |
|
n = n->next; |
|
if (n) |
|
return(n->string); |
|
else |
|
return(NULL); |
|
} |
|
|
|
void |
|
roff_freestr(void) |
|
{ |
|
struct roffstr *n, *nn; |
|
|
|
for (n = first_string; n; n = nn) { |
|
free(n->name); |
|
free(n->string); |
|
nn = n->next; |
|
free(n); |
|
} |
|
first_string = NULL; |
} |
} |