/* $Id: man.c,v 1.32 2009/08/19 12:00:46 kristaps Exp $ */ /* * Copyright (c) 2008, 2009 Kristaps Dzonsons * * Permission to use, copy, modify, and distribute this software for any * purpose with or without fee is hereby granted, provided that the above * copyright notice and this permission notice appear in all copies. * * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. */ #include #include #include #include #include #include #include "libman.h" const char *const __man_merrnames[WERRMAX] = { "invalid character", /* WNPRINT */ "system: malloc error", /* WNMEM */ "invalid manual section", /* WMSEC */ "invalid date format", /* WDATE */ "scope of prior line violated", /* WLNSCOPE */ "trailing whitespace", /* WTSPACE */ "unterminated quoted parameter", /* WTQUOTE */ "document has no body", /* WNODATA */ "document has no title/section", /* WNOTITLE */ "invalid escape sequence", /* WESCAPE */ "invalid number format", /* WNUMFMT */ "expected block head arguments", /* WHEADARGS */ "expected block body arguments", /* WBODYARGS */ "expected empty block head", /* WNHEADARGS */ "unknown macro", /* WMACRO */ "ill-formed macro", /* WMACROFORM */ "scope open on exit", /* WEXITSCOPE */ "no scope context" /* WNOSCOPE */ }; const char *const __man_macronames[MAN_MAX] = { "br", "TH", "SH", "SS", "TP", "LP", "PP", "P", "IP", "HP", "SM", "SB", "BI", "IB", "BR", "RB", "R", "B", "I", "IR", "RI", "na", "i", "sp", "nf", "fi", "r", "RE", "RS" }; const char * const *man_macronames = __man_macronames; static struct man_node *man_node_alloc(int, int, enum man_type, int); static int man_node_append(struct man *, struct man_node *); static int man_ptext(struct man *, int, char *); static int man_pmacro(struct man *, int, char *); static void man_free1(struct man *); static int man_alloc1(struct man *); static int pstring(struct man *, int, int, const char *, size_t); #ifdef __linux__ extern size_t strlcpy(char *, const char *, size_t); #endif const struct man_node * man_node(const struct man *m) { return(MAN_HALT & m->flags ? NULL : m->first); } const struct man_meta * man_meta(const struct man *m) { return(MAN_HALT & m->flags ? NULL : &m->meta); } int man_reset(struct man *man) { man_free1(man); return(man_alloc1(man)); } void man_free(struct man *man) { man_free1(man); if (man->htab) man_hash_free(man->htab); free(man); } struct man * man_alloc(void *data, int pflags, const struct man_cb *cb) { struct man *p; if (NULL == (p = calloc(1, sizeof(struct man)))) return(NULL); if ( ! man_alloc1(p)) { free(p); return(NULL); } p->data = data; p->pflags = pflags; (void)memcpy(&p->cb, cb, sizeof(struct man_cb)); if (NULL == (p->htab = man_hash_alloc())) { free(p); return(NULL); } return(p); } int man_endparse(struct man *m) { if (MAN_HALT & m->flags) return(0); else if (man_macroend(m)) return(1); m->flags |= MAN_HALT; return(0); } int man_parseln(struct man *m, int ln, char *buf) { return('.' == *buf ? man_pmacro(m, ln, buf) : man_ptext(m, ln, buf)); } static void man_free1(struct man *man) { if (man->first) man_node_freelist(man->first); if (man->meta.title) free(man->meta.title); if (man->meta.source) free(man->meta.source); if (man->meta.vol) free(man->meta.vol); } static int man_alloc1(struct man *m) { bzero(&m->meta, sizeof(struct man_meta)); m->flags = 0; m->last = calloc(1, sizeof(struct man_node)); if (NULL == m->last) return(0); m->first = m->last; m->last->type = MAN_ROOT; m->next = MAN_NEXT_CHILD; return(1); } static int man_node_append(struct man *man, struct man_node *p) { assert(man->last); assert(man->first); assert(MAN_ROOT != p->type); switch (man->next) { case (MAN_NEXT_SIBLING): man->last->next = p; p->prev = man->last; p->parent = man->last->parent; break; case (MAN_NEXT_CHILD): man->last->child = p; p->parent = man->last; break; default: abort(); /* NOTREACHED */ } p->parent->nchild++; if ( ! man_valid_pre(man, p)) return(0); switch (p->type) { case (MAN_HEAD): assert(MAN_BLOCK == p->parent->type); p->parent->head = p; break; case (MAN_BODY): assert(MAN_BLOCK == p->parent->type); p->parent->body = p; break; default: break; } man->last = p; switch (p->type) { case (MAN_TEXT): if ( ! man_valid_post(man)) return(0); if ( ! man_action_post(man)) return(0); break; default: break; } return(1); } static struct man_node * man_node_alloc(int line, int pos, enum man_type type, int tok) { struct man_node *p; p = calloc(1, sizeof(struct man_node)); if (NULL == p) return(NULL); p->line = line; p->pos = pos; p->type = type; p->tok = tok; return(p); } int man_elem_alloc(struct man *m, int line, int pos, int tok) { struct man_node *p; p = man_node_alloc(line, pos, MAN_ELEM, tok); if (NULL == p) return(0); if ( ! man_node_append(m, p)) return(0); m->next = MAN_NEXT_CHILD; return(1); } int man_head_alloc(struct man *m, int line, int pos, int tok) { struct man_node *p; p = man_node_alloc(line, pos, MAN_HEAD, tok); if (NULL == p) return(0); if ( ! man_node_append(m, p)) return(0); m->next = MAN_NEXT_CHILD; return(1); } int man_body_alloc(struct man *m, int line, int pos, int tok) { struct man_node *p; p = man_node_alloc(line, pos, MAN_BODY, tok); if (NULL == p) return(0); if ( ! man_node_append(m, p)) return(0); m->next = MAN_NEXT_CHILD; return(1); } int man_block_alloc(struct man *m, int line, int pos, int tok) { struct man_node *p; p = man_node_alloc(line, pos, MAN_BLOCK, tok); if (NULL == p) return(0); if ( ! man_node_append(m, p)) return(0); m->next = MAN_NEXT_CHILD; return(1); } static int pstring(struct man *m, int line, int pos, const char *p, size_t len) { struct man_node *n; size_t sv; n = man_node_alloc(line, pos, MAN_TEXT, -1); if (NULL == n) return(0); n->string = malloc(len + 1); if (NULL == n->string) { free(n); return(0); } sv = strlcpy(n->string, p, len + 1); /* Prohibit truncation. */ assert(sv < len + 1); if ( ! man_node_append(m, n)) return(0); m->next = MAN_NEXT_SIBLING; return(1); } int man_word_alloc(struct man *m, int line, int pos, const char *word) { return(pstring(m, line, pos, word, strlen(word))); } void man_node_free(struct man_node *p) { if (p->string) free(p->string); if (p->parent) p->parent->nchild--; free(p); } void man_node_freelist(struct man_node *p) { if (p->child) man_node_freelist(p->child); if (p->next) man_node_freelist(p->next); assert(0 == p->nchild); man_node_free(p); } static int man_ptext(struct man *m, int line, char *buf) { int i, j; /* First de-chunk and allocate words. */ for (i = 0; ' ' == buf[i]; i++) /* Skip leading whitespace. */ ; if (0 == buf[i]) { if ( ! pstring(m, line, 0, &buf[i], 0)) return(0); goto descope; } for (j = i; buf[i]; i++) { if (' ' != buf[i]) continue; /* Escaped whitespace. */ if (i && ' ' == buf[i] && '\\' == buf[i - 1]) continue; buf[i++] = 0; if ( ! pstring(m, line, j, &buf[j], (size_t)(i - j))) return(0); for ( ; ' ' == buf[i]; i++) /* Skip trailing whitespace. */ ; j = i; if (0 == buf[i]) break; } if (j != i && ! pstring(m, line, j, &buf[j], (size_t)(i - j))) return(0); descope: /* * Co-ordinate what happens with having a next-line scope open: * first close out the element scope (if applicable), then close * out the block scope (also if applicable). */ /* XXX - this should be in man_action.c. */ if (MAN_ELINE & m->flags) { m->flags &= ~MAN_ELINE; if ( ! man_unscope(m, m->last->parent)) return(0); } if ( ! (MAN_BLINE & m->flags)) return(1); m->flags &= ~MAN_BLINE; if ( ! man_unscope(m, m->last->parent)) return(0); return(man_body_alloc(m, line, 0, m->last->tok)); } int man_pmacro(struct man *m, int ln, char *buf) { int i, j, c, ppos, fl; char mac[5]; /* Comments and empties are quickly ignored. */ fl = m->flags; if (0 == buf[1]) goto out; i = 1; if (' ' == buf[i]) { i++; while (buf[i] && ' ' == buf[i]) i++; if (0 == buf[i]) goto out; } ppos = i; /* Copy the first word into a nil-terminated buffer. */ for (j = 0; j < 4; j++, i++) { if (0 == (mac[j] = buf[i])) break; else if (' ' == buf[i]) break; } mac[j] = 0; if (j == 4 || j < 1) { if ( ! (MAN_IGN_MACRO & m->pflags)) { (void)man_perr(m, ln, ppos, WMACROFORM); goto err; } if ( ! man_pwarn(m, ln, ppos, WMACROFORM)) goto err; return(1); } if (MAN_MAX == (c = man_hash_find(m->htab, mac))) { if ( ! (MAN_IGN_MACRO & m->pflags)) { (void)man_perr(m, ln, ppos, WMACRO); goto err; } if ( ! man_pwarn(m, ln, ppos, WMACRO)) goto err; return(1); } /* The macro is sane. Jump to the next word. */ while (buf[i] && ' ' == buf[i]) i++; /* Begin recursive parse sequence. */ assert(man_macros[c].fp); if ( ! (*man_macros[c].fp)(m, c, ln, ppos, &i, buf)) goto err; out: if ( ! (MAN_BLINE & fl)) return(1); /* * If we've opened a new next-line element scope, then return * now, as the next line will close out the block scope. */ if (MAN_ELINE & m->flags) return(1); /* Close out the block scope opened in the prior line. */ /* XXX - this should be in man_action.c. */ assert(MAN_BLINE & m->flags); m->flags &= ~MAN_BLINE; if ( ! man_unscope(m, m->last->parent)) return(0); return(man_body_alloc(m, ln, 0, m->last->tok)); err: /* Error out. */ m->flags |= MAN_HALT; return(0); } int man_verr(struct man *man, int ln, int pos, const char *fmt, ...) { char buf[256]; va_list ap; if (NULL == man->cb.man_err) return(0); va_start(ap, fmt); (void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); va_end(ap); return((*man->cb.man_err)(man->data, ln, pos, buf)); } int man_vwarn(struct man *man, int ln, int pos, const char *fmt, ...) { char buf[256]; va_list ap; if (NULL == man->cb.man_warn) return(0); va_start(ap, fmt); (void)vsnprintf(buf, sizeof(buf) - 1, fmt, ap); va_end(ap); return((*man->cb.man_warn)(man->data, ln, pos, buf)); } int man_err(struct man *m, int line, int pos, int iserr, enum merr type) { const char *p; p = __man_merrnames[(int)type]; assert(p); if (iserr) return(man_verr(m, line, pos, p)); return(man_vwarn(m, line, pos, p)); }