version 1.7, 2009/10/22 18:59:00 |
version 1.24, 2010/08/16 09:37:58 |
|
|
/* $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 |
|
|
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. |
*/ |
*/ |
|
#ifdef HAVE_CONFIG_H |
|
#include "config.h" |
|
#endif |
|
|
#include <sys/types.h> |
#include <sys/types.h> |
|
|
#include <assert.h> |
#include <assert.h> |
|
|
|
|
#include "out.h" |
#include "out.h" |
|
|
#ifdef __linux__ |
|
extern size_t strlcat(char *, const char *, size_t); |
|
#endif |
|
|
|
/* |
/* |
* 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 116 a2roffsu(const char *src, struct roffsu *dst, enum rof |
|
Line 116 a2roffsu(const char *src, struct roffsu *dst, enum rof |
|
return(0); |
return(0); |
} |
} |
|
|
|
/* FIXME: do this in the caller. */ |
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 166 time2a(time_t t, char *dst, size_t sz) |
|
Line 165 time2a(time_t t, char *dst, size_t sz) |
|
(void)strftime(p, sz, "%Y", &tm); |
(void)strftime(p, sz, "%Y", &tm); |
} |
} |
|
|
|
|
|
int |
|
a2roffdeco(enum roffdeco *d, const char **word, size_t *sz) |
|
{ |
|
int i, j, lim; |
|
char term, c; |
|
const char *wp; |
|
|
|
*d = DECO_NONE; |
|
lim = i = 0; |
|
term = '\0'; |
|
wp = *word; |
|
|
|
switch ((c = wp[i++])) { |
|
case ('('): |
|
*d = DECO_SPECIAL; |
|
lim = 2; |
|
break; |
|
case ('F'): |
|
/* FALLTHROUGH */ |
|
case ('f'): |
|
*d = 'F' == c ? DECO_FFONT : DECO_FONT; |
|
|
|
switch (wp[i++]) { |
|
case ('('): |
|
lim = 2; |
|
break; |
|
case ('['): |
|
term = ']'; |
|
break; |
|
case ('3'): |
|
/* FALLTHROUGH */ |
|
case ('B'): |
|
*d = DECO_BOLD; |
|
return(i); |
|
case ('2'): |
|
/* FALLTHROUGH */ |
|
case ('I'): |
|
*d = DECO_ITALIC; |
|
return(i); |
|
case ('P'): |
|
*d = DECO_PREVIOUS; |
|
return(i); |
|
case ('1'): |
|
/* FALLTHROUGH */ |
|
case ('R'): |
|
*d = DECO_ROMAN; |
|
return(i); |
|
default: |
|
i--; |
|
lim = 1; |
|
break; |
|
} |
|
break; |
|
case ('M'): |
|
/* FALLTHROUGH */ |
|
case ('m'): |
|
/* FALLTHROUGH */ |
|
case ('*'): |
|
if ('*' == c) |
|
*d = DECO_RESERVED; |
|
|
|
switch (wp[i++]) { |
|
case ('('): |
|
lim = 2; |
|
break; |
|
case ('['): |
|
term = ']'; |
|
break; |
|
default: |
|
i--; |
|
lim = 1; |
|
break; |
|
} |
|
break; |
|
case ('h'): |
|
/* FALLTHROUGH */ |
|
case ('v'): |
|
/* FALLTHROUGH */ |
|
case ('s'): |
|
j = 0; |
|
if ('+' == wp[i] || '-' == wp[i]) { |
|
i++; |
|
j = 1; |
|
} |
|
|
|
switch (wp[i++]) { |
|
case ('('): |
|
lim = 2; |
|
break; |
|
case ('['): |
|
term = ']'; |
|
break; |
|
case ('\''): |
|
term = '\''; |
|
break; |
|
case ('0'): |
|
j = 1; |
|
/* FALLTHROUGH */ |
|
default: |
|
i--; |
|
lim = 1; |
|
break; |
|
} |
|
|
|
if ('+' == wp[i] || '-' == wp[i]) { |
|
if (j) |
|
return(i); |
|
i++; |
|
} |
|
|
|
break; |
|
case ('['): |
|
*d = DECO_SPECIAL; |
|
term = ']'; |
|
break; |
|
case ('c'): |
|
*d = DECO_NOSPACE; |
|
return(i); |
|
default: |
|
*d = DECO_SSPECIAL; |
|
i--; |
|
lim = 1; |
|
break; |
|
} |
|
|
|
assert(term || lim); |
|
*word = &wp[i]; |
|
|
|
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); |
|
} |