diff options
| author |   Kristaps Dzonsons <kristaps@bsd.lv> | 2008-12-05 22:54:44 +0000 |
|---|---|---|
| committer | Kristaps Dzonsons <kristaps@bsd.lv> | 2008-12-05 22:54:44 +0000 |
| commit | 3ea9404b72cf9b1b1eb9342e0208b92df0456357 (patch) | |
| tree | ff10a718f8055520c2d37d687f99f13b9941f286 /html.c | |
| parent | f907e042a4beab3f400b1b5e0d67bbc7b5ed8029 (diff) | |
| download | mandoc-3ea9404b72cf9b1b1eb9342e0208b92df0456357.tar.gz mandoc-3ea9404b72cf9b1b1eb9342e0208b92df0456357.tar.zst mandoc-3ea9404b72cf9b1b1eb9342e0208b92df0456357.zip | |
*** empty log message ***
Diffstat (limited to 'html.c')
| -rw-r--r-- | html.c | 22 |
1 files changed, 11 insertions, 11 deletions
@@ -1,4 +1,4 @@ -/* $Id: html.c,v 1.10 2008/12/05 22:34:30 kristaps Exp $ */ +/* $Id: html.c,v 1.11 2008/12/05 22:54:44 kristaps Exp $ */ /* * Copyright (c) 2008 Kristaps Dzonsons <kristaps@kth.se> * @@ -115,14 +115,14 @@ html_It_headtagname(struct md_mbuf *mbuf, struct htmlq *q, const int *argc, const char **argv, size_t *res) { struct htmlnode *n; - int i, c; + int i; for (n = q->last; n; n = n->parent) if (n->tok == ROFF_Bl) break; assert(n); - for (i = 0; ROFF_ARGMAX != (c = n->argc[i]) && + for (i = 0; ROFF_ARGMAX != n->argc[i] && i < ROFF_MAXLINEARG; i++) { switch (n->argc[i]) { case (ROFF_Tag): @@ -148,14 +148,14 @@ html_It_bodytagname(struct md_mbuf *mbuf, struct htmlq *q, const int *argc, const char **argv, size_t *res) { struct htmlnode *n; - int i, c; + int i; for (n = q->last; n; n = n->parent) if (n->tok == ROFF_Bl) break; assert(n); - for (i = 0; ROFF_ARGMAX != (c = n->argc[i]) && + for (i = 0; ROFF_ARGMAX != n->argc[i] && i < ROFF_MAXLINEARG; i++) { switch (n->argc[i]) { case (ROFF_Enum): @@ -198,9 +198,9 @@ static int html_Bl_bodytagname(struct md_mbuf *mbuf, struct htmlq *q, const int *argc, const char **argv, size_t *res) { - int c, i; + int i; - for (i = 0; ROFF_ARGMAX != (c = argc[i]) + for (i = 0; ROFF_ARGMAX != argc[i] && i < ROFF_MAXLINEARG; i++) { switch (argc[i]) { case (ROFF_Enum): @@ -242,14 +242,14 @@ html_It_blocktagname(struct md_mbuf *mbuf, struct htmlq *q, const int *argc, const char **argv, size_t *res) { struct htmlnode *n; - int i, c; + int i; for (n = q->last; n; n = n->parent) if (n->tok == ROFF_Bl) break; assert(n); - for (i = 0; ROFF_ARGMAX != (c = n->argc[i]) && + for (i = 0; ROFF_ARGMAX != n->argc[i] && i < ROFF_MAXLINEARG; i++) { switch (n->argc[i]) { case (ROFF_Enum): @@ -554,7 +554,7 @@ html_begintag(struct md_mbuf *mbuf, void *data, size_t res; struct htmlq *q; struct htmlnode *node; - int i, c; + int i; assert(ns != MD_NS_DEFAULT); res = 0; @@ -575,7 +575,7 @@ html_begintag(struct md_mbuf *mbuf, void *data, /* TODO: argv. */ assert(argv); - for (i = 0; ROFF_ARGMAX != (c = argc[i]) + for (i = 0; ROFF_ARGMAX != argc[i] && i < ROFF_MAXLINEARG; i++) node->argc[i] = argc[i]; assert(i != ROFF_MAXLINEARG); |