Annotation of src/usr.bin/mandoc/chars.c, Revision 1.29
1.29 ! schwarze 1: /* $Id: chars.c,v 1.28 2014/04/20 16:44:44 schwarze Exp $ */
1.1 schwarze 2: /*
1.19 schwarze 3: * Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
1.16 schwarze 4: * Copyright (c) 2011 Ingo Schwarze <schwarze@openbsd.org>
1.1 schwarze 5: *
6: * Permission to use, copy, modify, and distribute this software for any
7: * purpose with or without fee is hereby granted, provided that the above
8: * copyright notice and this permission notice appear in all copies.
9: *
10: * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
11: * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
12: * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
13: * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
14: * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
15: * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
16: * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
17: */
18: #include <assert.h>
1.19 schwarze 19: #include <ctype.h>
1.1 schwarze 20: #include <stdlib.h>
21: #include <string.h>
22:
1.7 schwarze 23: #include "mandoc.h"
1.27 schwarze 24: #include "mandoc_aux.h"
1.19 schwarze 25: #include "libmandoc.h"
1.1 schwarze 26:
27: #define PRINT_HI 126
28: #define PRINT_LO 32
29:
30: struct ln {
31: struct ln *next;
32: const char *code;
33: const char *ascii;
1.9 schwarze 34: int unicode;
1.1 schwarze 35: };
36:
1.26 schwarze 37: #define LINES_MAX 330
1.1 schwarze 38:
1.10 schwarze 39: #define CHAR(in, ch, code) \
1.19 schwarze 40: { NULL, (in), (ch), (code) },
1.1 schwarze 41:
1.4 schwarze 42: #define CHAR_TBL_START static struct ln lines[LINES_MAX] = {
43: #define CHAR_TBL_END };
44:
1.1 schwarze 45: #include "chars.in"
46:
1.19 schwarze 47: struct mchars {
1.1 schwarze 48: struct ln **htab;
49: };
50:
1.28 schwarze 51: static const struct ln *find(const struct mchars *,
1.23 schwarze 52: const char *, size_t);
1.1 schwarze 53:
1.28 schwarze 54:
1.1 schwarze 55: void
1.19 schwarze 56: mchars_free(struct mchars *arg)
1.1 schwarze 57: {
58:
1.19 schwarze 59: free(arg->htab);
60: free(arg);
1.1 schwarze 61: }
62:
1.19 schwarze 63: struct mchars *
64: mchars_alloc(void)
1.1 schwarze 65: {
1.19 schwarze 66: struct mchars *tab;
1.1 schwarze 67: struct ln **htab;
68: struct ln *pp;
69: int i, hash;
70:
71: /*
72: * Constructs a very basic chaining hashtable. The hash routine
73: * is simply the integral value of the first character.
1.21 schwarze 74: * Subsequent entries are chained in the order they're processed.
1.1 schwarze 75: */
76:
1.19 schwarze 77: tab = mandoc_malloc(sizeof(struct mchars));
1.24 schwarze 78: htab = mandoc_calloc(PRINT_HI - PRINT_LO + 1, sizeof(struct ln *));
1.1 schwarze 79:
80: for (i = 0; i < LINES_MAX; i++) {
81: hash = (int)lines[i].code[0] - PRINT_LO;
82:
83: if (NULL == (pp = htab[hash])) {
84: htab[hash] = &lines[i];
85: continue;
86: }
87:
88: for ( ; pp->next; pp = pp->next)
89: /* Scan ahead. */ ;
90: pp->next = &lines[i];
91: }
92:
93: tab->htab = htab;
94: return(tab);
95: }
96:
1.9 schwarze 97: int
1.23 schwarze 98: mchars_spec2cp(const struct mchars *arg, const char *p, size_t sz)
1.9 schwarze 99: {
100: const struct ln *ln;
101:
1.19 schwarze 102: ln = find(arg, p, sz);
1.9 schwarze 103: if (NULL == ln)
104: return(-1);
105: return(ln->unicode);
106: }
107:
1.19 schwarze 108: char
109: mchars_num2char(const char *p, size_t sz)
1.9 schwarze 110: {
1.28 schwarze 111: int i;
1.9 schwarze 112:
1.22 schwarze 113: if ((i = mandoc_strntoi(p, sz, 10)) < 0)
1.19 schwarze 114: return('\0');
1.28 schwarze 115:
116: return(i > 0 && i < 256 && isprint(i) ? i : '\0');
1.16 schwarze 117: }
118:
1.19 schwarze 119: int
120: mchars_num2uc(const char *p, size_t sz)
1.16 schwarze 121: {
1.28 schwarze 122: int i;
1.16 schwarze 123:
1.22 schwarze 124: if ((i = mandoc_strntoi(p, sz, 16)) < 0)
1.19 schwarze 125: return('\0');
1.29 ! schwarze 126:
! 127: /*
! 128: * Security warning:
! 129: * Never extend the range of accepted characters
! 130: * to overlap with the ASCII range, 0x00-0x7F
! 131: * without re-auditing the callers of this function.
! 132: * Some callers might relay on the fact that we never
! 133: * return ASCII characters for their escaping decisions.
! 134: *
! 135: * XXX Code is missing here to exclude bogus ranges.
! 136: */
! 137:
1.19 schwarze 138: return(i > 0x80 && i <= 0x10FFFF ? i : '\0');
1.9 schwarze 139: }
140:
1.1 schwarze 141: const char *
1.28 schwarze 142: mchars_spec2str(const struct mchars *arg,
1.23 schwarze 143: const char *p, size_t sz, size_t *rsz)
1.1 schwarze 144: {
1.9 schwarze 145: const struct ln *ln;
146:
1.19 schwarze 147: ln = find(arg, p, sz);
1.20 schwarze 148: if (NULL == ln) {
149: *rsz = 1;
1.9 schwarze 150: return(NULL);
1.20 schwarze 151: }
1.1 schwarze 152:
1.10 schwarze 153: *rsz = strlen(ln->ascii);
1.9 schwarze 154: return(ln->ascii);
1.1 schwarze 155: }
156:
1.9 schwarze 157: static const struct ln *
1.23 schwarze 158: find(const struct mchars *tab, const char *p, size_t sz)
1.1 schwarze 159: {
1.23 schwarze 160: const struct ln *pp;
1.1 schwarze 161: int hash;
162:
163: assert(p);
164:
1.21 schwarze 165: if (0 == sz || p[0] < PRINT_LO || p[0] > PRINT_HI)
1.1 schwarze 166: return(NULL);
167:
168: hash = (int)p[0] - PRINT_LO;
169:
1.21 schwarze 170: for (pp = tab->htab[hash]; pp; pp = pp->next)
1.28 schwarze 171: if (0 == strncmp(pp->code, p, sz) &&
172: '\0' == pp->code[(int)sz])
1.21 schwarze 173: return(pp);
1.1 schwarze 174:
175: return(NULL);
176: }