version 1.15, 2010/04/07 11:29:55 |
version 1.19, 2010/07/18 23:06:18 |
|
|
/* $Id$ */ |
/* $Id$ */ |
/* |
/* |
* Copyright (c) 2009 Kristaps Dzonsons <kristaps@kth.se> |
* Copyright (c) 2009, 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 above |
* purpose with or without fee is hereby granted, provided that the above |
|
|
|
|
#include "out.h" |
#include "out.h" |
|
|
/* See a2roffdeco(). */ |
|
#define C2LIM(c, l) do { \ |
|
(l) = 1; \ |
|
if ('[' == (c) || '\'' == (c)) \ |
|
(l) = 0; \ |
|
else if ('(' == (c)) \ |
|
(l) = 2; } \ |
|
while (/* CONSTCOND */ 0) |
|
|
|
/* See a2roffdeco(). */ |
|
#define C2TERM(c, t) do { \ |
|
(t) = 0; \ |
|
if ('\'' == (c)) \ |
|
(t) = 1; \ |
|
else if ('[' == (c)) \ |
|
(t) = 2; \ |
|
else if ('(' == (c)) \ |
|
(t) = 3; } \ |
|
while (/* CONSTCOND */ 0) |
|
|
|
/* |
/* |
* Convert a `scaling unit' to a consistent form, or fail. Scaling |
* Convert a `scaling unit' to a consistent form, or fail. Scaling |
* units are documented in groff.7, mdoc.7, man.7. |
* units are documented in groff.7, mdoc.7, man.7. |
Line 139 a2roffsu(const char *src, struct roffsu *dst, enum rof |
|
Line 119 a2roffsu(const char *src, struct roffsu *dst, enum rof |
|
if ((dst->scale = atof(buf)) < 0) |
if ((dst->scale = atof(buf)) < 0) |
dst->scale = 0; |
dst->scale = 0; |
dst->unit = unit; |
dst->unit = unit; |
dst->pt = hasd; |
|
|
|
return(1); |
return(1); |
} |
} |
|
|
Line 187 time2a(time_t t, char *dst, size_t sz) |
|
Line 165 time2a(time_t t, char *dst, size_t sz) |
|
} |
} |
|
|
|
|
/* |
|
* Returns length of parsed string (the leading "\" should NOT be |
|
* included). This can be zero if the current character is the nil |
|
* terminator. "d" is set to the type of parsed decorator, which may |
|
* have an adjoining "word" of size "sz" (e.g., "(ab" -> "ab", 2). |
|
*/ |
|
int |
int |
a2roffdeco(enum roffdeco *d, |
a2roffdeco(enum roffdeco *d, const char **word, size_t *sz) |
const char **word, size_t *sz) |
|
{ |
{ |
int j, term, lim; |
int i, j, lim; |
char set; |
char term, c; |
const char *wp, *sp; |
const char *wp; |
|
|
*d = DECO_NONE; |
*d = DECO_NONE; |
|
lim = i = 0; |
|
term = '\0'; |
wp = *word; |
wp = *word; |
|
|
switch ((set = *wp)) { |
switch ((c = wp[i++])) { |
case ('\0'): |
|
return(0); |
|
|
|
case ('('): |
case ('('): |
if ('\0' == *(++wp)) |
|
return(1); |
|
if ('\0' == *(wp + 1)) |
|
return(2); |
|
|
|
*d = DECO_SPECIAL; |
*d = DECO_SPECIAL; |
*sz = 2; |
lim = 2; |
*word = wp; |
break; |
return(3); |
|
|
|
case ('F'): |
case ('F'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('f'): |
case ('f'): |
/* |
*d = 'F' == c ? DECO_FFONT : DECO_FONT; |
* FIXME: this needs work and consolidation (it should |
|
* follow the sequence that special characters do, for |
switch (wp[i++]) { |
* one), but isn't a priority at the moment. Note, for |
case ('('): |
* one, that in reality \fB != \FB, although here we let |
lim = 2; |
* these slip by. |
break; |
*/ |
case ('['): |
switch (*(++wp)) { |
term = ']'; |
case ('\0'): |
break; |
return(1); |
|
case ('3'): |
case ('3'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('B'): |
case ('B'): |
*d = DECO_BOLD; |
*d = DECO_BOLD; |
return(2); |
return(i); |
case ('2'): |
case ('2'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('I'): |
case ('I'): |
*d = DECO_ITALIC; |
*d = DECO_ITALIC; |
return(2); |
return(i); |
case ('P'): |
case ('P'): |
*d = DECO_PREVIOUS; |
*d = DECO_PREVIOUS; |
return(2); |
return(i); |
case ('1'): |
case ('1'): |
/* FALLTHROUGH */ |
/* FALLTHROUGH */ |
case ('R'): |
case ('R'): |
*d = DECO_ROMAN; |
*d = DECO_ROMAN; |
return(2); |
return(i); |
|
default: |
|
i--; |
|
lim = 1; |
|
break; |
|
} |
|
break; |
|
case ('*'): |
|
*d = DECO_RESERVED; |
|
switch (wp[i++]) { |
case ('('): |
case ('('): |
if ('\0' == *(++wp)) |
lim = 2; |
return(2); |
break; |
if ('\0' == *(wp + 1)) |
|
return(3); |
|
|
|
*d = 'F' == set ? DECO_FFONT : DECO_FONT; |
|
*sz = 2; |
|
*word = wp; |
|
return(4); |
|
case ('['): |
case ('['): |
*word = ++wp; |
term = ']'; |
for (j = 0; *wp && ']' != *wp; wp++, j++) |
break; |
/* Loop... */ ; |
|
|
|
if ('\0' == *wp) |
|
return(j + 2); |
|
|
|
*d = 'F' == set ? DECO_FFONT : DECO_FONT; |
|
*sz = (size_t)j; |
|
return(j + 3); |
|
default: |
default: |
|
i--; |
|
lim = 1; |
break; |
break; |
} |
} |
|
break; |
*d = 'F' == set ? DECO_FFONT : DECO_FONT; |
case ('M'): |
*sz = 1; |
/* FALLTHROUGH */ |
*word = wp; |
case ('m'): |
return(2); |
switch (wp[i++]) { |
|
|
case ('*'): |
|
switch (*(++wp)) { |
|
case ('\0'): |
|
return(1); |
|
|
|
case ('('): |
case ('('): |
if ('\0' == *(++wp)) |
lim = 2; |
return(2); |
break; |
if ('\0' == *(wp + 1)) |
|
return(3); |
|
|
|
*d = DECO_RESERVED; |
|
*sz = 2; |
|
*word = wp; |
|
return(4); |
|
|
|
case ('['): |
case ('['): |
*word = ++wp; |
term = ']'; |
for (j = 0; *wp && ']' != *wp; wp++, j++) |
break; |
/* Loop... */ ; |
|
|
|
if ('\0' == *wp) |
|
return(j + 2); |
|
|
|
*d = DECO_RESERVED; |
|
*sz = (size_t)j; |
|
return(j + 3); |
|
|
|
default: |
default: |
|
i--; |
|
lim = 1; |
break; |
break; |
} |
} |
|
break; |
*d = DECO_RESERVED; |
|
*sz = 1; |
|
*word = wp; |
|
return(2); |
|
|
|
case ('s'): |
case ('s'): |
sp = wp; |
if ('+' == wp[i] || '-' == wp[i]) |
if ('\0' == *(++wp)) |
i++; |
return(1); |
|
|
|
C2LIM(*wp, lim); |
j = ('s' != wp[i - 1]); |
C2TERM(*wp, term); |
|
|
|
if (term) |
switch (wp[i++]) { |
wp++; |
|
|
|
*word = wp; |
|
|
|
if (*wp == '+' || *wp == '-') |
|
++wp; |
|
|
|
switch (*wp) { |
|
case ('\''): |
|
/* FALLTHROUGH */ |
|
case ('['): |
|
/* FALLTHROUGH */ |
|
case ('('): |
case ('('): |
if (term) |
lim = 2; |
return((int)(wp - sp)); |
|
|
|
C2LIM(*wp, lim); |
|
C2TERM(*wp, term); |
|
wp++; |
|
break; |
break; |
|
case ('['): |
|
term = ']'; |
|
break; |
|
case ('\''): |
|
term = '\''; |
|
break; |
default: |
default: |
|
i--; |
|
lim = 1; |
break; |
break; |
} |
} |
|
|
if ( ! isdigit((u_char)*wp)) |
if ('+' == wp[i] || '-' == wp[i]) { |
return((int)(wp - sp)); |
if (j++) |
|
return(i); |
for (j = 0; isdigit((u_char)*wp); j++) { |
i++; |
if (lim && j >= lim) |
} |
break; |
|
++wp; |
if (0 == j) |
} |
return(i); |
|
break; |
if (term && term < 3) { |
|
if (1 == term && *wp != '\'') |
|
return((int)(wp - sp)); |
|
if (2 == term && *wp != ']') |
|
return((int)(wp - sp)); |
|
++wp; |
|
} |
|
|
|
*d = DECO_SIZE; |
|
return((int)(wp - sp)); |
|
|
|
case ('['): |
case ('['): |
*word = ++wp; |
|
|
|
for (j = 0; *wp && ']' != *wp; wp++, j++) |
|
/* Loop... */ ; |
|
|
|
if ('\0' == *wp) |
|
return(j + 1); |
|
|
|
*d = DECO_SPECIAL; |
*d = DECO_SPECIAL; |
*sz = (size_t)j; |
term = ']'; |
return(j + 2); |
break; |
|
|
case ('c'): |
case ('c'): |
*d = DECO_NOSPACE; |
*d = DECO_NOSPACE; |
*sz = 1; |
return(i); |
return(1); |
|
|
|
default: |
default: |
|
*d = DECO_SPECIAL; |
|
i--; |
|
lim = 1; |
break; |
break; |
} |
} |
|
|
*d = DECO_SPECIAL; |
assert(term || lim); |
*word = wp; |
*word = &wp[i]; |
*sz = 1; |
|
return(1); |
if (term) { |
|
j = i; |
|
while (wp[i] && wp[i] != term) |
|
i++; |
|
if ('\0' == wp[i]) { |
|
*d = DECO_NONE; |
|
return(i); |
|
} |
|
|
|
assert(i >= j); |
|
*sz = (size_t)(i - j); |
|
|
|
return(i + 1); |
|
} |
|
|
|
assert(lim > 0); |
|
*sz = (size_t)lim; |
|
|
|
for (j = 0; wp[i] && j < lim; j++) |
|
i++; |
|
if (j < lim) |
|
*d = DECO_NONE; |
|
|
|
return(i); |
} |
} |