File: constmap.c

package info (click to toggle)
qmail 1.01-5
  • links: PTS
  • area: non-free
  • in suites: hamm
  • size: 2,188 kB
  • ctags: 1,711
  • sloc: ansic: 13,993; makefile: 1,914; perl: 448; sh: 377
file content (123 lines) | stat: -rw-r--r-- 2,341 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
#include "constmap.h"
#include "alloc.h"
#include "case.h"

static constmap_hash hash(s,len)
char *s;
int len;
{
 unsigned char ch;
 constmap_hash h;
 h = 5381;
 while (len > 0)
  {
   ch = *s++ - 'A';
   if (ch <= 'Z' - 'A') ch += 'a' - 'A';
   h = ((h << 5) + h) ^ ch;
   --len;
  }
 return h;
}

char *constmap(cm,s,len)
struct constmap *cm;
char *s;
int len;
{
 constmap_hash h;
 int pos;
 h = hash(s,len);
 pos = cm->first[h & cm->mask];
 while (pos != -1)
  {
   if (h == cm->hash[pos])
     if (len == cm->inputlen[pos])
       if (!case_diffb(cm->input[pos],len,s))
	 return cm->input[pos] + cm->inputlen[pos] + 1;
   pos = cm->next[pos];
  }
 return 0;
}

int constmap_init(cm,s,len,flagcolon)
struct constmap *cm;
char *s;
int len;
int flagcolon;
{
 int i;
 int j;
 int k;
 int pos;
 constmap_hash h;

 cm->num = 0;
 for (j = 0;j < len;++j) if (!s[j]) ++cm->num;

 h = 64;
 while (h && (h < cm->num)) h += h;
 cm->mask = h - 1;

 cm->first = (int *) alloc(sizeof(int) * h);
 if (cm->first)
  {
   cm->input = (char **) alloc(sizeof(char *) * cm->num);
   if (cm->input)
    {
     cm->inputlen = (int *) alloc(sizeof(int) * cm->num);
     if (cm->inputlen)
      {
       cm->hash = (constmap_hash *) alloc(sizeof(constmap_hash) * cm->num);
       if (cm->hash)
	{
	 cm->next = (int *) alloc(sizeof(int) * cm->num);
	 if (cm->next)
	  {
	   for (h = 0;h <= cm->mask;++h)
	     cm->first[h] = -1;
           pos = 0;
           i = 0;
           for (j = 0;j < len;++j)
             if (!s[j])
              {
	       k = j - i;
	       if (flagcolon)
		{
		 for (k = i;k < j;++k)
		   if (s[k] == ':')
		     break;
		 if (k >= j) { i = j + 1; continue; }
		 k -= i;
		}
               cm->input[pos] = s + i;
               cm->inputlen[pos] = k;
               h = hash(s + i,k);
               cm->hash[pos] = h;
               h &= cm->mask;
               cm->next[pos] = cm->first[h];
               cm->first[h] = pos;
               ++pos;
               i = j + 1;
              }
           return 1;
	  }
	 alloc_free(cm->hash);
	}
       alloc_free(cm->inputlen);
      }
     alloc_free(cm->input);
    }
   alloc_free(cm->first);
  }
 return 0;
}

void constmap_free(cm)
struct constmap *cm;
{
 alloc_free(cm->next);
 alloc_free(cm->hash);
 alloc_free(cm->inputlen);
 alloc_free(cm->input);
 alloc_free(cm->first);
}