1 /* $Id: chars.c,v 1.66 2015/02/17 20:37:16 schwarze Exp $ */
3 * Copyright (c) 2009, 2010, 2011 Kristaps Dzonsons <kristaps@bsd.lv>
4 * Copyright (c) 2011, 2014 Ingo Schwarze <schwarze@openbsd.org>
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.
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.
20 #include <sys/types.h>
28 #include "mandoc_aux.h"
29 #include "libmandoc.h"
43 #define CHAR(in, ch, code) \
44 { NULL, (in), (ch), (code) },
46 #define CHAR_TBL_START static struct ln lines[LINES_MAX] = {
47 #define CHAR_TBL_END };
55 static const struct ln *find(const struct mchars *,
56 const char *, size_t);
60 mchars_free(struct mchars *arg)
76 * Constructs a very basic chaining hashtable. The hash routine
77 * is simply the integral value of the first character.
78 * Subsequent entries are chained in the order they're processed.
81 tab = mandoc_malloc(sizeof(struct mchars));
82 htab = mandoc_calloc(PRINT_HI - PRINT_LO + 1, sizeof(struct ln *));
84 for (i = 0; i < LINES_MAX; i++) {
85 hash = (int)lines[i].code[0] - PRINT_LO;
87 if (NULL == (pp = htab[hash])) {
88 htab[hash] = &lines[i];
92 for ( ; pp->next; pp = pp->next)
102 mchars_spec2cp(const struct mchars *arg, const char *p, size_t sz)
106 ln = find(arg, p, sz);
107 return(ln != NULL ? ln->unicode : sz == 1 ? (unsigned char)*p : -1);
111 mchars_num2char(const char *p, size_t sz)
115 i = mandoc_strntoi(p, sz, 10);
116 return(i >= 0 && i < 256 ? i : -1);
120 mchars_num2uc(const char *p, size_t sz)
124 i = mandoc_strntoi(p, sz, 16);
125 assert(i >= 0 && i <= 0x10FFFF);
130 mchars_spec2str(const struct mchars *arg,
131 const char *p, size_t sz, size_t *rsz)
135 ln = find(arg, p, sz);
138 return(sz == 1 ? p : NULL);
141 *rsz = strlen(ln->ascii);
146 mchars_uc2str(int uc)
150 for (i = 0; i < LINES_MAX; i++)
151 if (uc == lines[i].unicode)
152 return(lines[i].ascii);
156 static const struct ln *
157 find(const struct mchars *tab, const char *p, size_t sz)
164 if (0 == sz || p[0] < PRINT_LO || p[0] > PRINT_HI)
167 hash = (int)p[0] - PRINT_LO;
169 for (pp = tab->htab[hash]; pp; pp = pp->next)
170 if (0 == strncmp(pp->code, p, sz) &&
171 '\0' == pp->code[(int)sz])