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
|
/* This is a pointer table implementation essentially copied from the ptr_table
* implementation in perl's sv.c, except that it has been modified to use memory
* shared across threads. */
/* This header is designed to be included several times with different
* definitions for PTABLE_NAME and PTABLE_VAL_FREE(). */
#undef pPTBLMS
#undef pPTBLMS_
#undef aPTBLMS
#undef aPTBLMS_
/* Context for PerlMemShared_* functions */
#ifdef PERL_IMPLICIT_SYS
# define pPTBLMS pTHX
# define pPTBLMS_ pTHX_
# define aPTBLMS aTHX
# define aPTBLMS_ aTHX_
#else
# define pPTBLMS
# define pPTBLMS_
# define aPTBLMS
# define aPTBLMS_
#endif
#ifndef pPTBL
# define pPTBL pPTBLMS
#endif
#ifndef pPTBL_
# define pPTBL_ pPTBLMS_
#endif
#ifndef aPTBL
# define aPTBL aPTBLMS
#endif
#ifndef aPTBL_
# define aPTBL_ aPTBLMS_
#endif
#ifndef PTABLE_NAME
# define PTABLE_NAME ptable
#endif
#ifndef PTABLE_VAL_FREE
# define PTABLE_VAL_FREE(V)
#endif
#ifndef PTABLE_JOIN
# define PTABLE_PASTE(A, B) A ## B
# define PTABLE_JOIN(A, B) PTABLE_PASTE(A, B)
#endif
#ifndef PTABLE_PREFIX
# define PTABLE_PREFIX(X) PTABLE_JOIN(PTABLE_NAME, X)
#endif
#ifndef ptable_ent
typedef struct ptable_ent {
struct ptable_ent *next;
const void * key;
void * val;
} ptable_ent;
#define ptable_ent ptable_ent
#endif /* !ptable_ent */
#ifndef ptable
typedef struct ptable {
ptable_ent **ary;
UV max;
UV items;
} ptable;
#define ptable ptable
#endif /* !ptable */
#ifndef ptable_new
STATIC ptable *ptable_new(pPTBLMS) {
#define ptable_new() ptable_new(aPTBLMS)
ptable *t = (ptable *)PerlMemShared_malloc(sizeof *t);
t->max = 63;
t->items = 0;
t->ary = (ptable_ent **)PerlMemShared_calloc(t->max + 1, sizeof *t->ary);
return t;
}
#endif /* !ptable_new */
#ifndef PTABLE_HASH
# define PTABLE_HASH(ptr) \
((PTR2UV(ptr) >> 3) ^ (PTR2UV(ptr) >> (3 + 7)) ^ (PTR2UV(ptr) >> (3 + 17)))
#endif
#ifndef ptable_find
STATIC ptable_ent *ptable_find(const ptable * const t, const void * const key) {
#define ptable_find ptable_find
ptable_ent *ent;
const UV hash = PTABLE_HASH(key);
ent = t->ary[hash & t->max];
for (; ent; ent = ent->next) {
if (ent->key == key)
return ent;
}
return NULL;
}
#endif /* !ptable_find */
#ifndef ptable_fetch
STATIC void *ptable_fetch(const ptable * const t, const void * const key) {
#define ptable_fetch ptable_fetch
const ptable_ent *const ent = ptable_find(t, key);
return ent ? ent->val : NULL;
}
#endif /* !ptable_fetch */
#ifndef ptable_split
STATIC void ptable_split(pPTBLMS_ ptable * const t) {
#define ptable_split(T) ptable_split(aPTBLMS_ (T))
ptable_ent **ary = t->ary;
const UV oldsize = t->max + 1;
UV newsize = oldsize * 2;
UV i;
ary = (ptable_ent **)PerlMemShared_realloc(ary, newsize * sizeof(*ary));
Zero(&ary[oldsize], newsize - oldsize, sizeof(*ary));
t->max = --newsize;
t->ary = ary;
for (i = 0; i < oldsize; i++, ary++) {
ptable_ent **curentp, **entp, *ent;
if (!*ary)
continue;
curentp = ary + oldsize;
for (entp = ary, ent = *ary; ent; ent = *entp) {
if ((newsize & PTABLE_HASH(ent->key)) != i) {
*entp = ent->next;
ent->next = *curentp;
*curentp = ent;
continue;
} else
entp = &ent->next;
}
}
}
#endif /* !ptable_split */
STATIC void PTABLE_PREFIX(_store)(pPTBL_ ptable * const t, const void * const key, void * const val) {
ptable_ent *ent = ptable_find(t, key);
if (ent) {
void *oldval = ent->val;
PTABLE_VAL_FREE(oldval);
ent->val = val;
} else if (val) {
const UV i = PTABLE_HASH(key) & t->max;
ent = (ptable_ent *)PerlMemShared_malloc(sizeof *ent);
ent->key = key;
ent->val = val;
ent->next = t->ary[i];
t->ary[i] = ent;
t->items++;
if (ent->next && t->items > t->max)
ptable_split(t);
}
}
/* this function appears to be unused */
#if 0
#ifndef ptable_walk
STATIC void ptable_walk(pTHX_ ptable * const t, void (*cb)(pTHX_ ptable_ent *ent, void *userdata), void *userdata) {
#define ptable_walk(T, CB, UD) ptable_walk(aTHX_ (T), (CB), (UD))
if (t && t->items) {
ptable_ent ** const array = t->ary;
UV i = t->max;
do {
ptable_ent *entry;
for (entry = array[i]; entry; entry = entry->next)
cb(aTHX_ entry, userdata);
} while (i--);
}
}
#endif /* !ptable_walk */
#endif
/* this function appears to be unused */
#if 0
STATIC void PTABLE_PREFIX(_clear)(pPTBL_ ptable * const t) {
if (t && t->items) {
ptable_ent ** const array = t->ary;
UV i = t->max;
do {
ptable_ent *entry = array[i];
while (entry) {
ptable_ent * const oentry = entry;
void *val = oentry->val;
entry = entry->next;
PTABLE_VAL_FREE(val);
PerlMemShared_free(oentry);
}
array[i] = NULL;
} while (i--);
t->items = 0;
}
}
#endif
/* this function appears to be unused */
#if 0
STATIC void PTABLE_PREFIX(_free)(pPTBL_ ptable * const t) {
if (!t)
return;
PTABLE_PREFIX(_clear)(aPTBL_ t);
PerlMemShared_free(t->ary);
PerlMemShared_free(t);
}
#endif
#undef pPTBL
#undef pPTBL_
#undef aPTBL
#undef aPTBL_
#undef PTABLE_NAME
#undef PTABLE_VAL_FREE
|
