[BACK]Return to man_hash.c CVS log [TXT][DIR] Up to [cvsweb.bsd.lv] / mandoc

Diff for /mandoc/Attic/man_hash.c between version 1.5 and 1.26

version 1.5, 2009/04/02 06:51:44 version 1.26, 2014/03/23 11:25:26
Line 1 
Line 1 
 /* $Id$ */  /*      $Id$ */
 /*  /*
  * Copyright (c) 2008, 2009 Kristaps Dzonsons <kristaps@openbsd.org>   * Copyright (c) 2008, 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   * purpose with or without fee is hereby granted, provided that the above
  * above copyright notice and this permission notice appear in all   * copyright notice and this permission notice appear in all copies.
  * copies.  
  *   *
  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL   * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
  * WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED   * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
  * WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE   * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
  * AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL   * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
  * DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR   * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
  * PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER   * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
  * TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR   * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
  * PERFORMANCE OF THIS SOFTWARE.  
  */   */
   #ifdef HAVE_CONFIG_H
   #include "config.h"
   #endif
   
   #include <sys/types.h>
   
 #include <assert.h>  #include <assert.h>
 #include <stdlib.h>  #include <ctype.h>
   #include <limits.h>
 #include <string.h>  #include <string.h>
   
   #include "man.h"
   #include "mandoc.h"
 #include "libman.h"  #include "libman.h"
   
   #define HASH_DEPTH       6
   
 /* ARGUSED */  #define HASH_ROW(x) do { \
 void                  if (isupper((unsigned char)(x))) \
 man_hash_free(void *htab)                          (x) -= 65; \
 {                  else \
                           (x) -= 97; \
                   (x) *= HASH_DEPTH; \
           } while (/* CONSTCOND */ 0)
   
         free(htab);  /*
 }   * Lookup table is indexed first by lower-case first letter (plus one
    * for the period, which is stored in the last row), then by lower or
    * uppercase second letter.  Buckets correspond to the index of the
    * macro (the integer value of the enum stored as a char to save a bit
    * of space).
    */
   static  unsigned char    table[26 * HASH_DEPTH];
   
   /*
 /* ARGUSED */   * XXX - this hash has global scope, so if intended for use as a library
 void *   * with multiple callers, it will need re-invocation protection.
 man_hash_alloc(void)   */
   void
   man_hash_init(void)
 {  {
         int             *htab;  
         int              i, j, x;          int              i, j, x;
   
         htab = calloc(26 * 4, sizeof(int));          memset(table, UCHAR_MAX, sizeof(table));
         if (NULL == htab)  
                 return(NULL);  
   
         for (i = 1; i < MAN_MAX; i++) {          assert(/* LINTED */
                           MAN_MAX < UCHAR_MAX);
   
           for (i = 0; i < (int)MAN_MAX; i++) {
                 x = man_macronames[i][0];                  x = man_macronames[i][0];
   
                 assert((x >= 65 && x <= 90) ||                  assert(isalpha((unsigned char)x));
                                 (x >= 97 && x <= 122));  
   
                 x -= (x <= 90) ? 65 : 97;                  HASH_ROW(x);
                 x *= 4;  
   
                 for (j = 0; j < 4; j++)                  for (j = 0; j < HASH_DEPTH; j++)
                         if (0 == htab[x + j]) {                          if (UCHAR_MAX == table[x + j]) {
                                 htab[x + j] = i;                                  table[x + j] = (unsigned char)i;
                                 break;                                  break;
                         }                          }
   
                 assert(j < 4);                  assert(j < HASH_DEPTH);
         }          }
   
         return((void *)htab);  
 }  }
   
   
 int  enum mant
 man_hash_find(const void *arg, const char *tmp)  man_hash_find(const char *tmp)
 {  {
         int              x, i, tok;          int              x, y, i;
         const int       *htab;          enum mant        tok;
   
         htab = (const int *)arg;          if ('\0' == (x = tmp[0]))
   
         if (0 == (x = tmp[0]))  
                 return(MAN_MAX);                  return(MAN_MAX);
         if ( ! ((x >= 65 && x <= 90) || (x >= 97 && x <= 122)))          if ( ! (isalpha((unsigned char)x)))
                 return(MAN_MAX);                  return(MAN_MAX);
   
         x -= (x <= 90) ? 65 : 97;          HASH_ROW(x);
         x *= 4;  
   
         for (i = 0; i < 4; i++) {          for (i = 0; i < HASH_DEPTH; i++) {
                 if (0 == (tok = htab[x + i]))                  if (UCHAR_MAX == (y = table[x + i]))
                         return(MAN_MAX);                          return(MAN_MAX);
   
                   tok = (enum mant)y;
                 if (0 == strcmp(tmp, man_macronames[tok]))                  if (0 == strcmp(tmp, man_macronames[tok]))
                         return(tok);                          return(tok);
         }          }
   
         return(MAN_MAX);          return(MAN_MAX);
 }  }
   
Legend:
Removed from v.1.5  
changed lines
  Added in v.1.26
CVSweb