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
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
|
3
4
1
0 -1
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: to >>
reg4.5<<: to >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: Some care is needed so that things like >>
reg4.5<<: Some care is needed so that things like >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: static unsigned last_dhash ; >>
reg4.5<<: static unsigned last_dhash ; >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: ARRAY A ; >>
reg4.5<<: ARRAY A ; >>
reg4.3<<: STRING *sval ; >>
reg4.5<<: STRING *sval ; >>
reg4.3<<: { >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: { >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: } >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: { >>
reg4.3<<: else >>
reg4.5<<: else >>
reg4.3<<: } >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: } >>
reg4.3<<: return p ; >>
reg4.5<<: return p ; >>
reg4.3<<: } >>
reg4.4<<: } >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: ARRAY A ; >>
reg4.5<<: ARRAY A ; >>
reg4.3<<: double d ; >>
reg4.5<<: double d ; >>
reg4.3<<: int cflag ; >>
reg4.5<<: int cflag ; >>
reg4.3<<: { >>
reg4.4<<: { >>
reg4.3<<: ANODE *ap ; >>
reg4.5<<: ANODE *ap ; >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.3<<: break ; >>
reg4.5<<: break ; >>
reg4.3<<: } >>
reg4.3<<: } >>
reg4.3<<: else >>
reg4.5<<: else >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
reg4.1<<: >>
reg4.2<<: >>
reg4.3<<: >>
reg4.4<<: >>
reg4.5<<: >>
26..12: each array is of size A_HASH_PRIME.
reg5.1<<A_HASH_PRIME>>
26..12: each array is of size A_HASH_PRIME.
reg5.2<<A_HASH_PRIME>>
11..7: On the D_ANODE list, we use real deletion and move to the
reg5.1<<D_ANODE>>
11..7: On the D_ANODE list, we use real deletion and move to the
reg5.2<<D_ANODE>>
32..5: (1) d1 != d2, but sprintf(A_FMT,d1) == sprintf(A_FMT,d1)
reg5.1<<A_FMT>>
32..5: (1) d1 != d2, but sprintf(A_FMT,d1) == sprintf(A_FMT,d1)
reg5.2<<A_FMT>>
42..12:#define _dhash(d) (((int)(d)&0x7fff)%A_HASH_PRIME)
reg5.1<<A_HASH_PRIME>>
42..12:#define _dhash(d) (((int)(d)&0x7fff)%A_HASH_PRIME)
reg5.2<<A_HASH_PRIME>>
34..6:#define _dhash(d) (((int)(d)&0x7fff)%A_HASH_PRIME)
reg5.3<<0x7fff>>
27..12: unsigned h = hash(s) % A_HASH_PRIME ;
reg5.1<<A_HASH_PRIME>>
27..12: unsigned h = hash(s) % A_HASH_PRIME ;
reg5.2<<A_HASH_PRIME>>
22..8: p->cp->type = C_NOINIT ;
reg5.1<<C_NOINIT>>
22..8: p->cp->type = C_NOINIT ;
reg5.2<<C_NOINIT>>
11..7:/* on the D_ANODE list, when we find a node we move it
reg5.1<<D_ANODE>>
11..7:/* on the D_ANODE list, when we find a node we move it
reg5.2<<D_ANODE>>
8..7:static D_ANODE *find_by_dval(A, d, cflag)
reg5.1<<D_ANODE>>
8..7:static D_ANODE *find_by_dval(A, d, cflag)
reg5.2<<D_ANODE>>
12..7: register D_ANODE *p = A[h].dlink ;
reg5.1<<D_ANODE>>
12..7: register D_ANODE *p = A[h].dlink ;
reg5.2<<D_ANODE>>
3..7: D_ANODE *q = 0 ; /* trails p for move to front */
reg5.1<<D_ANODE>>
3..7: D_ANODE *q = 0 ; /* trails p for move to front */
reg5.2<<D_ANODE>>
28..7: zfree(p, sizeof(D_ANODE)) ;
reg5.1<<D_ANODE>>
28..7: zfree(p, sizeof(D_ANODE)) ;
reg5.2<<D_ANODE>>
1..1:extern unsigned hash() ;
reg6.2<<e>>
23..6: which is two hash tables in one. One for strings
reg6.1<<ables >>
23..2: which is two hash tables in one. One for strings
reg6.3<<ab>>
19..5: and one for doubles.
reg6.4<<bles.>>
1 aFOOc
4 XaXbXcX
3 XaXcX
1 abX
1 abX
1 abcX
2 aXcX
1 aFOOc
4 XaXbXcX
3 XaXcX
1 abX
1 abX
1 abcX
1 a(b)c
4 {}a{}b{}c{}
3 {}a{b}c{}
3 {}a{bb}c{b}
2 a(bb)c(b)
1 a b c
1 a b c
|
