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
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
|
/* -*- Mode: c; c-basic-offset: 2 -*-
*
* raptor_set.c - Sets for checking IDs (based on Redland memory hash)
*
* $Id$
*
* Copyright (C) 2003-2004 David Beckett - http://purl.org/net/dajobe/
* Institute for Learning and Research Technology - http://www.ilrt.bris.ac.uk/
* University of Bristol - http://www.bristol.ac.uk/
*
* This package is Free Software or Open Source available under the
* following licenses (these are alternatives):
* 1. GNU Lesser General Public License (LGPL)
* 2. GNU General Public License (GPL)
* 3. Mozilla Public License (MPL)
*
* See LICENSE.html or LICENSE.txt at the top of this package for the
* full license terms.
*
*
*/
#ifdef HAVE_CONFIG_H
#include <raptor_config.h>
#endif
#ifdef WIN32
#include <win32_raptor_config.h>
#endif
#include <stdio.h>
#include <string.h>
#include <stdarg.h>
#include <sys/types.h>
#ifdef HAVE_STDLIB_H
#include <stdlib.h> /* for abort() as used in errors */
#endif
/* Raptor includes */
#include "raptor.h"
#include "raptor_internal.h"
#ifndef STANDALONE
/*
* The only methods needed here are:
* Create Set
* Destroy Set
* Check a (base, ID) pair present add it if not, return if added/not
*
*/
struct raptor_id_set_node_s
{
struct raptor_id_set_node_s* next;
char *item;
size_t item_len;
unsigned long hash;
};
typedef struct raptor_id_set_node_s raptor_id_set_node;
struct raptor_base_id_set_s
{
/* The base URI of this set of IDs */
raptor_uri *uri;
/* neighbour ID sets */
struct raptor_base_id_set_s* prev;
struct raptor_base_id_set_s* next;
/* An array pointing to a list of nodes (buckets) */
raptor_id_set_node** nodes;
/* this many buckets used (out of capacity) */
int size;
/* this many items */
int items;
/* size of the buckets array 'nodes' above */
int capacity;
/* array load factor expressed out of 1000.
* Always true: (size/capacity * 1000) < load_factor,
* or in the code: size * 1000 < load_factor * capacity
*/
int load_factor;
};
typedef struct raptor_base_id_set_s raptor_base_id_set;
struct raptor_id_set_s
{
/* start of sets, 1 per base URI */
struct raptor_base_id_set_s* first;
#ifdef RAPTOR_DEBUG
int hits;
int misses;
#endif
};
/* default load_factor out of 1000 */
static const int raptor_id_set_default_load_factor=750;
/* starting capacity - MUST BE POWER OF 2 */
static const int raptor_id_set_initial_capacity=8;
/* prototypes for local functions */
static raptor_id_set_node* raptor_base_id_set_find_node(raptor_base_id_set* set, unsigned char *item, size_t item_len, unsigned long hash);
static void raptor_free_id_set_node(raptor_id_set_node* node);
static int raptor_base_id_set_expand_size(raptor_base_id_set* set);
/*
* perldelta 5.8.0 says under *Performance Enhancements*
*
* Hashes now use Bob Jenkins "One-at-a-Time" hashing key algorithm
* http://burtleburtle.net/bob/hash/doobs.html This algorithm is
* reasonably fast while producing a much better spread of values
* than the old hashing algorithm ...
*
* Changed here to set the string backwards to help do URIs better
*
*/
#define ONE_AT_A_TIME_SET(set,str,len) \
do { \
register const unsigned char *c_oneat = str+len-1; \
register int i_oneat = len; \
register unsigned long set_oneat = 0; \
while (i_oneat--) { \
set_oneat += *c_oneat--; \
set_oneat += (set_oneat << 10); \
set_oneat ^= (set_oneat >> 6); \
} \
set_oneat += (set_oneat << 3); \
set_oneat ^= (set_oneat >> 11); \
(set) = (set_oneat + (set_oneat << 15)); \
} while(0)
/* helper functions */
/**
* raptor_id_set_find_node - Find the node for the given item with optional hash
* @set: the memory set context
* @item: item string
* @item_len: item string length
* @hash: hash value or 0 if it should be computed here
*
* Return value: &raptor_id_set_node of content or NULL on failure
**/
static raptor_id_set_node*
raptor_base_id_set_find_node(raptor_base_id_set* base,
unsigned char *item, size_t item_len,
unsigned long hash)
{
raptor_id_set_node* node;
int bucket;
/* empty set */
if(!base->capacity)
return NULL;
if(!hash)
ONE_AT_A_TIME_SET(hash, (unsigned char*)item, item_len);
/* find slot in table */
bucket=hash & (base->capacity - 1);
/* check if there is a list present */
node=base->nodes[bucket];
if(!node)
/* no list there */
return NULL;
/* walk the list */
while(node) {
if(item_len == node->item_len && !memcmp(item, node->item, item_len))
break;
node=node->next;
}
return node;
}
static void
raptor_free_id_set_node(raptor_id_set_node* node)
{
if(node->item)
RAPTOR_FREE(cstring, node->item);
RAPTOR_FREE(raptor_id_set_node, node);
}
static int
raptor_base_id_set_expand_size(raptor_base_id_set* base) {
int required_capacity=0;
raptor_id_set_node **new_nodes;
int i;
if (base->capacity) {
/* big enough */
if((1000 * base->items) < (base->load_factor * base->capacity))
return 0;
/* grow set (keeping it a power of two) */
required_capacity=base->capacity << 1;
} else {
required_capacity=raptor_id_set_initial_capacity;
}
/* allocate new table */
new_nodes=(raptor_id_set_node**)RAPTOR_CALLOC(raptor_id_set_nodes,
required_capacity,
sizeof(raptor_id_set_node*));
if(!new_nodes)
return 1;
/* it is a new set empty set - we are done */
if(!base->size) {
base->capacity=required_capacity;
base->nodes=new_nodes;
return 0;
}
for(i=0; i<base->capacity; i++) {
raptor_id_set_node *node=base->nodes[i];
/* walk all attached nodes */
while(node) {
raptor_id_set_node *next;
int bucket;
next=node->next;
/* find slot in new table */
bucket=node->hash & (required_capacity - 1);
node->next=new_nodes[bucket];
new_nodes[bucket]=node;
node=next;
}
}
/* now free old table */
RAPTOR_FREE(raptor_id_set_nodes, base->nodes);
/* attach new one */
base->capacity=required_capacity;
base->nodes=new_nodes;
return 0;
}
/* functions implementing the ID set api */
/**
* raptor_new_id_set - Create a new ID set
*
* Return value: non 0 on failure
**/
raptor_id_set*
raptor_new_id_set(void)
{
raptor_id_set* set=(raptor_id_set*)RAPTOR_CALLOC(raptor_id_set, 1,
sizeof(raptor_id_set));
if(!set)
return NULL;
return set;
}
/**
* raptor_free_base_id_set - Destroy raptor_base_id_set
* @set: &raptor_id_set
**/
static void
raptor_free_base_id_set(raptor_base_id_set *base)
{
if(base->nodes) {
int i;
for(i=0; i<base->capacity; i++) {
raptor_id_set_node *node=base->nodes[i];
/* this entry is used */
if(node) {
raptor_id_set_node *next;
/* free all attached nodes */
while(node) {
next=node->next;
raptor_free_id_set_node(node);
node=next;
}
}
}
RAPTOR_FREE(raptor_id_set_nodes, base->nodes);
}
if(base->uri)
raptor_free_uri(base->uri);
RAPTOR_FREE(raptor_base_id_set, base);
return;
}
/**
* raptor_free_id_set - Destroy a set
* @set: &raptor_id_set
*
**/
void
raptor_free_id_set(raptor_id_set *set)
{
raptor_base_id_set *base=set->first;
while(base) {
raptor_base_id_set *next=base->next;
raptor_free_base_id_set(base);
base=next;
}
RAPTOR_FREE(raptor_id_set, set);
}
/**
* raptor_id_set_add: - Add an item to the set
* @set: &raptor_id_set
* @base_uri: base &raptor_uri of identifier
* @id: identifier name
* @id_len: length of identifier
*
* Return value: <0 on failure, 0 on success, 1 if already present
**/
int
raptor_id_set_add(raptor_id_set* set, raptor_uri *base_uri,
const unsigned char *id, size_t id_len)
{
raptor_base_id_set *base;
unsigned char *base_uri_string;
size_t base_uri_string_len;
size_t item_len;
unsigned char *item;
raptor_id_set_node *node;
unsigned long hash;
char *new_item=NULL;
int bucket= (-1);
if(!base_uri || !id || !id_len)
return -1;
base=set->first;
while(base) {
if(raptor_uri_equals(base->uri, base_uri))
break;
base=base->next;
}
if(!base) {
/* a set for this base_uri not found */
base=(raptor_base_id_set*)RAPTOR_CALLOC(raptor_base_id_set, 1,
sizeof(raptor_base_id_set));
if(!base)
return -1;
base->load_factor=raptor_id_set_default_load_factor;
if(raptor_base_id_set_expand_size(base)) {
RAPTOR_FREE(raptor_base_id_set, base);
return -1;
}
base->uri=raptor_uri_copy(base_uri);
/* Add to the start of the list */
if(set->first)
set->first->prev=base;
/* base->prev=NULL; */
base->next=set->first;
set->first=base;
} else {
/* If not at the start of the list, move there */
if(base != set->first) {
/* remove from the list */
base->prev->next=base->next;
if(base->next)
base->next->prev=base->prev;
/* add at the start of the list */
set->first->prev=base;
base->prev=NULL;
base->next=set->first;
}
}
/* ensure there is enough space in the set */
if (raptor_base_id_set_expand_size(base))
return -1;
/* Storing ID + ' ' + base-uri-string + '\0' */
base_uri_string=raptor_uri_as_counted_string(base_uri, &base_uri_string_len);
item_len=id_len+1+strlen((const char*)base_uri_string)+1;
item=(unsigned char*)RAPTOR_MALLOC(cstring, item_len);
if(!item)
return 1;
strcpy((char*)item, (const char*)id);
item[id_len]=' ';
strcpy((char*)item+id_len+1, (const char*)base_uri_string); /* strcpy for end '\0' */
ONE_AT_A_TIME_SET(hash, (unsigned char*)item, item_len);
/* find node for item */
node=raptor_base_id_set_find_node(base, item, item_len, hash);
/* if already there, error */
if(node) {
#ifdef RAPTOR_DEBUG
set->misses++;
#endif
return 1;
}
#ifdef RAPTOR_DEBUG
set->hits++;
#endif
/* always a new node */
bucket=hash & (base->capacity - 1);
/* allocate new node */
node=(raptor_id_set_node*)RAPTOR_CALLOC(raptor_id_set_node, 1,
sizeof(raptor_id_set_node));
if(!node)
return 1;
node->hash=hash;
/* allocate item for new node */
new_item=(char*)RAPTOR_MALLOC(cstring, item_len);
if(!new_item) {
RAPTOR_FREE(raptor_id_set_node, node);
return -1;
}
/* copy new item */
memcpy(new_item, item, item_len);
node->item=new_item;
node->item_len=item_len;
node->next=base->nodes[bucket];
base->nodes[bucket]=node;
base->items++;
/* Only increase bucket count use when previous value was NULL */
if(!node->next)
base->size++;
RAPTOR_FREE(cstring, item);
return 0;
}
#ifdef RAPTOR_DEBUG
void
raptor_id_set_stats_print(raptor_id_set* set, FILE *stream) {
fprintf(stream, "set hits: %d misses: %d\n", set->hits, set->misses);
}
#endif
#endif
#ifdef STANDALONE
/* one more prototype */
int main(int argc, char *argv[]);
int
main(int argc, char *argv[])
{
const char *program=raptor_basename(argv[0]);
char *items[8] = { "ron", "amy", "jen", "bij", "jib", "daj", "jim", NULL };
raptor_id_set *set;
raptor_uri *base_uri;
int i=0;
raptor_init();
base_uri=raptor_new_uri((const unsigned char*)"http://example.org/base#");
fprintf(stderr, "%s: Creating set\n", program);
set=raptor_new_id_set();
if(!set) {
fprintf(stderr, "%s: Failed to create set\n", program);
exit(1);
}
for(i=0; items[i]; i++) {
size_t len=strlen(items[i]);
int rc;
fprintf(stderr, "%s: Adding set item '%s'\n", program, items[i]);
rc=raptor_id_set_add(set, base_uri, (const unsigned char*)items[i], len);
if(rc) {
fprintf(stderr, "%s: Adding set item %d '%s' failed, returning error %d\n",
program, i, items[i], rc);
exit(1);
}
}
for(i=0; items[i]; i++) {
size_t len=strlen(items[i]);
int rc;
fprintf(stderr, "%s: Adding duplicate set item '%s'\n", program, items[i]);
rc=raptor_id_set_add(set, base_uri, (const unsigned char*)items[i], len);
if(rc <= 0) {
fprintf(stderr, "%s: Adding duplicate set item %d '%s' succeeded, should have failed, returning error %d\n",
program, i, items[i], rc);
exit(1);
}
}
#ifdef RAPTOR_DEBUG
raptor_id_set_stats_print(set, stderr);
#endif
fprintf(stderr, "%s: Freeing set\n", program);
raptor_free_id_set(set);
raptor_free_uri(base_uri);
raptor_finish();
/* keep gcc -Wall happy */
return(0);
}
#endif
|