version 1.10, 2008/12/05 22:34:30 |
version 1.11, 2008/12/05 22:54:44 |
Line 115 html_It_headtagname(struct md_mbuf *mbuf, struct htmlq |
|
Line 115 html_It_headtagname(struct md_mbuf *mbuf, struct htmlq |
|
const int *argc, const char **argv, size_t *res) |
const int *argc, const char **argv, size_t *res) |
{ |
{ |
struct htmlnode *n; |
struct htmlnode *n; |
int i, c; |
int i; |
|
|
for (n = q->last; n; n = n->parent) |
for (n = q->last; n; n = n->parent) |
if (n->tok == ROFF_Bl) |
if (n->tok == ROFF_Bl) |
break; |
break; |
|
|
assert(n); |
assert(n); |
for (i = 0; ROFF_ARGMAX != (c = n->argc[i]) && |
for (i = 0; ROFF_ARGMAX != n->argc[i] && |
i < ROFF_MAXLINEARG; i++) { |
i < ROFF_MAXLINEARG; i++) { |
switch (n->argc[i]) { |
switch (n->argc[i]) { |
case (ROFF_Tag): |
case (ROFF_Tag): |
Line 148 html_It_bodytagname(struct md_mbuf *mbuf, struct htmlq |
|
Line 148 html_It_bodytagname(struct md_mbuf *mbuf, struct htmlq |
|
const int *argc, const char **argv, size_t *res) |
const int *argc, const char **argv, size_t *res) |
{ |
{ |
struct htmlnode *n; |
struct htmlnode *n; |
int i, c; |
int i; |
|
|
for (n = q->last; n; n = n->parent) |
for (n = q->last; n; n = n->parent) |
if (n->tok == ROFF_Bl) |
if (n->tok == ROFF_Bl) |
break; |
break; |
|
|
assert(n); |
assert(n); |
for (i = 0; ROFF_ARGMAX != (c = n->argc[i]) && |
for (i = 0; ROFF_ARGMAX != n->argc[i] && |
i < ROFF_MAXLINEARG; i++) { |
i < ROFF_MAXLINEARG; i++) { |
switch (n->argc[i]) { |
switch (n->argc[i]) { |
case (ROFF_Enum): |
case (ROFF_Enum): |
|
|
html_Bl_bodytagname(struct md_mbuf *mbuf, struct htmlq *q, |
html_Bl_bodytagname(struct md_mbuf *mbuf, struct htmlq *q, |
const int *argc, const char **argv, size_t *res) |
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++) { |
&& i < ROFF_MAXLINEARG; i++) { |
switch (argc[i]) { |
switch (argc[i]) { |
case (ROFF_Enum): |
case (ROFF_Enum): |
Line 242 html_It_blocktagname(struct md_mbuf *mbuf, struct html |
|
Line 242 html_It_blocktagname(struct md_mbuf *mbuf, struct html |
|
const int *argc, const char **argv, size_t *res) |
const int *argc, const char **argv, size_t *res) |
{ |
{ |
struct htmlnode *n; |
struct htmlnode *n; |
int i, c; |
int i; |
|
|
for (n = q->last; n; n = n->parent) |
for (n = q->last; n; n = n->parent) |
if (n->tok == ROFF_Bl) |
if (n->tok == ROFF_Bl) |
break; |
break; |
|
|
assert(n); |
assert(n); |
for (i = 0; ROFF_ARGMAX != (c = n->argc[i]) && |
for (i = 0; ROFF_ARGMAX != n->argc[i] && |
i < ROFF_MAXLINEARG; i++) { |
i < ROFF_MAXLINEARG; i++) { |
switch (n->argc[i]) { |
switch (n->argc[i]) { |
case (ROFF_Enum): |
case (ROFF_Enum): |
Line 554 html_begintag(struct md_mbuf *mbuf, void *data, |
|
Line 554 html_begintag(struct md_mbuf *mbuf, void *data, |
|
size_t res; |
size_t res; |
struct htmlq *q; |
struct htmlq *q; |
struct htmlnode *node; |
struct htmlnode *node; |
int i, c; |
int i; |
|
|
assert(ns != MD_NS_DEFAULT); |
assert(ns != MD_NS_DEFAULT); |
res = 0; |
res = 0; |
Line 575 html_begintag(struct md_mbuf *mbuf, void *data, |
|
Line 575 html_begintag(struct md_mbuf *mbuf, void *data, |
|
/* TODO: argv. */ |
/* TODO: argv. */ |
|
|
assert(argv); |
assert(argv); |
for (i = 0; ROFF_ARGMAX != (c = argc[i]) |
for (i = 0; ROFF_ARGMAX != argc[i] |
&& i < ROFF_MAXLINEARG; i++) |
&& i < ROFF_MAXLINEARG; i++) |
node->argc[i] = argc[i]; |
node->argc[i] = argc[i]; |
assert(i != ROFF_MAXLINEARG); |
assert(i != ROFF_MAXLINEARG); |