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
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
|
#include "system.h"
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <rpmhook.h>
#define RPMHOOK_TABLE_INITSIZE 256
#define RPMHOOK_BUCKET_INITSIZE 5
typedef struct rpmhookItem_s {
rpmhookFunc func;
void *data;
struct rpmhookItem_s *next;
} * rpmhookItem;
typedef struct rpmhookBucket_s {
unsigned long hash;
char *name;
rpmhookItem item;
} * rpmhookBucket;
typedef struct rpmhookTable_s {
int size;
int used;
struct rpmhookBucket_s bucket[1];
} * rpmhookTable;
static rpmhookTable rpmhookTableNew(int size)
{
rpmhookTable table =
(rpmhookTable)xcalloc(1, sizeof(struct rpmhookTable_s)+
sizeof(struct rpmhookBucket_s)*(size-1));
table->size = size;
return table;
}
#if 0
static rpmhookTable rpmhookTableFree(rpmhookTable table)
{
rpmhookItem item, nextItem;
int i;
for (i = 0; i != table->size; i++) {
if (table->bucket[i].name) {
free(table->bucket[i].name);
item = table->bucket[i].item;
while (item) {
nextItem = item->next;
free(item);
item = nextItem;
}
}
}
free(table);
return NULL;
}
#endif
static void rpmhookTableRehash(rpmhookTable *table);
static int rpmhookTableFindBucket(rpmhookTable *table, const char *name)
{
/* Hash based on http://www.isthe.com/chongo/tech/comp/fnv/ */
unsigned long perturb;
unsigned long hash = 0;
unsigned char *bp = (unsigned char *)name;
unsigned char *be = bp + strlen(name);
rpmhookBucket bucket;
if (((*table)->used/2)*3 > (*table)->size)
rpmhookTableRehash(table);
int ret;
while (bp < be) {
hash ^= (unsigned long)*bp++;
hash *= (unsigned long)0x01000193;
}
perturb = hash;
ret = hash % (*table)->size;
bucket = &(*table)->bucket[ret];
while (bucket->name &&
(bucket->hash != hash || strcmp(bucket->name, name) != 0)) {
/* Collision resolution based on Python's perturb scheme. */
ret = ((ret << 2) + ret + perturb + 1) % (*table)->size;
perturb >>= 5;
bucket = &(*table)->bucket[ret];
}
if (!bucket->name)
bucket->hash = hash;
return ret;
}
static void rpmhookTableRehash(rpmhookTable *table)
{
rpmhookTable newtable = rpmhookTableNew((*table)->size*2);
int n, i = 0;
for (; i != (*table)->size; i++) {
if ((*table)->bucket[i].name) {
n = rpmhookTableFindBucket(&newtable, (*table)->bucket[i].name);
newtable->bucket[n].name = (*table)->bucket[i].name;
newtable->bucket[n].item = (*table)->bucket[i].item;
}
}
newtable->used = (*table)->used;
free(*table);
*table = newtable;
}
static void rpmhookTableAddItem(rpmhookTable *table, const char *name,
rpmhookFunc func, void *data)
{
int n = rpmhookTableFindBucket(table, name);
rpmhookBucket bucket = &(*table)->bucket[n];
rpmhookItem *item = &bucket->item;
if (!bucket->name) {
bucket->name = strdup(name);
(*table)->used++;
}
while (*item) item = &(*item)->next;
*item = calloc(1, sizeof(struct rpmhookItem_s));
(*item)->func = func;
(*item)->data = data;
}
static void rpmhookTableDelItem(rpmhookTable *table, const char *name,
rpmhookFunc func, void *data,
int matchfunc, int matchdata)
{
int n = rpmhookTableFindBucket(table, name);
rpmhookBucket bucket = &(*table)->bucket[n];
rpmhookItem item = bucket->item;
rpmhookItem lastItem = NULL;
rpmhookItem nextItem;
while (item) {
nextItem = item->next;
if ((!matchfunc || item->func == func) &&
(!matchdata || item->data == data)) {
free(item);
if (lastItem)
lastItem->next = nextItem;
else
bucket->item = nextItem;
} else {
lastItem = item;
}
item = nextItem;
}
if (!bucket->item) {
free(bucket->name);
bucket->name = NULL;
(*table)->used--;
}
}
static rpmhookArgs rpmhookArgsParse(const char *argt, va_list ap)
{
int argc = strlen(argt);
int i;
rpmhookArgs args = (rpmhookArgs)malloc(sizeof(struct rpmhookArgs_s)+
(argc-1)*sizeof(rpmhookArgv));
args->argc = argc;
args->argt = argt;
for (i = 0; i != argc; i++) {
switch (argt[i]) {
case 's':
args->argv[i].s = va_arg(ap, char *);
break;
case 'i':
args->argv[i].i = va_arg(ap, int);
break;
case 'f':
args->argv[i].f = (float)va_arg(ap, double);
break;
case 'p':
args->argv[i].p = va_arg(ap, void *);
break;
default:
fprintf(stderr, "error: unsupported type '%c' as "
"a hook argument\n", argt[i]);
break;
}
}
return args;
}
static void rpmhookTableCallV(rpmhookTable *table, const char *name,
const char *argt, va_list ap)
{
rpmhookItem item;
rpmhookArgs args;
int n;
args = rpmhookArgsParse(argt, ap);
n = rpmhookTableFindBucket(table, name);
item = (*table)->bucket[n].item;
while (item) {
if (item->func(args, item->data) != 0)
break;
item = item->next;
}
free(args);
}
static rpmhookTable globalTable = NULL;
void rpmhookRegister(const char *name, rpmhookFunc func, void *data)
{
if (!globalTable)
globalTable = rpmhookTableNew(RPMHOOK_TABLE_INITSIZE);
rpmhookTableAddItem(&globalTable, name, func, data);
}
void rpmhookUnregister(const char *name, rpmhookFunc func, void *data)
{
if (globalTable)
rpmhookTableDelItem(&globalTable, name, func, data, 1, 1);
}
void rpmhookUnregisterAny(const char *name, rpmhookFunc func)
{
if (globalTable)
rpmhookTableDelItem(&globalTable, name, func, NULL, 1, 0);
}
void rpmhookUnregisterAll(const char *name)
{
if (globalTable)
rpmhookTableDelItem(&globalTable, name, NULL, NULL, 0, 0);
}
void rpmhookCall(const char *name, const char *argt, ...)
{
if (globalTable) {
va_list ap;
va_start(ap, argt);
rpmhookTableCallV(&globalTable, name, argt, ap);
va_end(ap);
}
}
/* vim:ts=4:sw=4:et
*/
|
