chars.c

   1 /*      $Id: chars.c,v 1.42 2011/05/15 15:47:46 kristaps Exp $ */
   2 /*
   3  * Copyright (c) 2009, 2010 Kristaps Dzonsons <kristaps@bsd.lv>
   4  * Copyright (c) 2011 Ingo Schwarze <schwarze@openbsd.org>
   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 #ifdef HAVE_CONFIG_H
  19 #include "config.h"
  20 #endif
  21
  22 #include <assert.h>
  23 #include <ctype.h>
  24 #include <stdio.h>
  25 #include <stdlib.h>
  26 #include <string.h>
  27
  28 #include "mandoc.h"
  29
  30 #define PRINT_HI         126
  31 #define PRINT_LO         32
  32
  33 struct  ln {
  34         struct ln        *next;
  35         const char       *code;
  36         const char       *ascii;
  37         int               unicode;
  38         int               type;
  39 #define CHARS_CHAR       (1 << 0)
  40 #define CHARS_STRING     (1 << 1)
  41 #define CHARS_BOTH       (CHARS_CHAR | CHARS_STRING)
  42 };
  43
  44 #define LINES_MAX         353
  45
  46 #define CHAR(in, ch, code) \
  47         { NULL, (in), (ch), (code), CHARS_CHAR },
  48 #define STRING(in, ch, code) \
  49         { NULL, (in), (ch), (code), CHARS_STRING },
  50 #define BOTH(in, ch, code) \
  51         { NULL, (in), (ch), (code), CHARS_BOTH },
  52
  53 #define CHAR_TBL_START    static struct ln lines[LINES_MAX] = {
  54 #define CHAR_TBL_END      };
  55
  56 #include "chars.in"
  57
  58 struct  mchars {
  59         struct ln       **htab;
  60 };
  61
  62 static  inline int        match(const struct ln *,
  63                                 const char *, size_t, int);
  64 static  const struct ln  *find(struct mchars *, const char *, size_t, int);
  65
  66 void
  67 mchars_free(struct mchars *arg)
  68 {
  69
  70         free(arg->htab);
  71         free(arg);
  72 }
  73
  74 struct mchars *
  75 mchars_alloc(void)
  76 {
  77         struct mchars    *tab;
  78         struct ln       **htab;
  79         struct ln        *pp;
  80         int               i, hash;
  81
  82         /*
  83          * Constructs a very basic chaining hashtable.  The hash routine
  84          * is simply the integral value of the first character.
  85          * Subsequent entries are chained in the order they're processed
  86          * (they're in-line re-ordered during lookup).
  87          */
  88
  89         tab = mandoc_malloc(sizeof(struct mchars));
  90         htab = mandoc_calloc(PRINT_HI - PRINT_LO + 1, sizeof(struct ln **));
  91
  92         for (i = 0; i < LINES_MAX; i++) {
  93                 hash = (int)lines[i].code[0] - PRINT_LO;
  94
  95                 if (NULL == (pp = htab[hash])) {
  96                         htab[hash] = &lines[i];
  97                         continue;
  98                 }
  99
 100                 for ( ; pp->next; pp = pp->next)
 101                         /* Scan ahead. */ ;
 102                 pp->next = &lines[i];
 103         }
 104
 105         tab->htab = htab;
 106         return(tab);
 107 }
 108
 109
 110 /*
 111  * Special character to Unicode codepoint.
 112  */
 113 int
 114 mchars_spec2cp(struct mchars *arg, const char *p, size_t sz)
 115 {
 116         const struct ln *ln;
 117
 118         ln = find(arg, p, sz, CHARS_CHAR);
 119         if (NULL == ln)
 120                 return(-1);
 121         return(ln->unicode);
 122 }
 123
 124
 125 /*
 126  * Reserved word to Unicode codepoint.
 127  */
 128 int
 129 mchars_res2cp(struct mchars *arg, const char *p, size_t sz)
 130 {
 131         const struct ln *ln;
 132
 133         ln = find(arg, p, sz, CHARS_STRING);
 134         if (NULL == ln)
 135                 return(-1);
 136         return(ln->unicode);
 137 }
 138
 139 /*
 140  * Numbered character to literal character.
 141  * This can only be a printable character (i.e., alnum, punct, space) so
 142  * prevent the character from ruining our state (backspace, newline, and
 143  * so on).
 144  * If the character is illegal, returns '\0'.
 145  */
 146 char
 147 mchars_num2char(const char *p, size_t sz)
 148 {
 149         int               i;
 150
 151         if (sz > 3)
 152                 return('\0');
 153
 154         i = atoi(p);
 155         /* LINTED */
 156         return(isprint(i) ? i : '\0');
 157 }
 158
 159 /*
 160  * Special character to string array.
 161  */
 162 const char *
 163 mchars_spec2str(struct mchars *arg, const char *p, size_t sz, size_t *rsz)
 164 {
 165         const struct ln *ln;
 166
 167         ln = find(arg, p, sz, CHARS_CHAR);
 168         if (NULL == ln)
 169                 return(NULL);
 170
 171         *rsz = strlen(ln->ascii);
 172         return(ln->ascii);
 173 }
 174
 175 /*
 176  * Reserved word to string array.
 177  */
 178 const char *
 179 mchars_res2str(struct mchars *arg, const char *p, size_t sz, size_t *rsz)
 180 {
 181         const struct ln *ln;
 182
 183         ln = find(arg, p, sz, CHARS_STRING);
 184         if (NULL == ln)
 185                 return(NULL);
 186
 187         *rsz = strlen(ln->ascii);
 188         return(ln->ascii);
 189 }
 190
 191 static const struct ln *
 192 find(struct mchars *tab, const char *p, size_t sz, int type)
 193 {
 194         struct ln        *pp, *prev;
 195         struct ln       **htab;
 196         int               hash;
 197
 198         assert(p);
 199         if (0 == sz)
 200                 return(NULL);
 201
 202         if (p[0] < PRINT_LO || p[0] > PRINT_HI)
 203                 return(NULL);
 204
 205         /*
 206          * Lookup the symbol in the symbol hash.  See ascii2htab for the
 207          * hashtable specs.  This dynamically re-orders the hash chain
 208          * to optimise for repeat hits.
 209          */
 210
 211         hash = (int)p[0] - PRINT_LO;
 212         htab = tab->htab;
 213
 214         if (NULL == (pp = htab[hash]))
 215                 return(NULL);
 216
 217         for (prev = NULL; pp; pp = pp->next) {
 218                 if ( ! match(pp, p, sz, type)) {
 219                         prev = pp;
 220                         continue;
 221                 }
 222
 223                 if (prev) {
 224                         prev->next = pp->next;
 225                         pp->next = htab[hash];
 226                         htab[hash] = pp;
 227                 }
 228
 229                 return(pp);
 230         }
 231
 232         return(NULL);
 233 }
 234
 235 static inline int
 236 match(const struct ln *ln, const char *p, size_t sz, int type)
 237 {
 238
 239         if ( ! (ln->type & type))
 240                 return(0);
 241         if (strncmp(ln->code, p, sz))
 242                 return(0);
 243         return('\0' == ln->code[(int)sz]);
 244 }