6 #include "libcitadel.h"
9 typedef struct Payload Payload;
13 * \brief Hash Payload storage Structure; filled in linear.
15 void *Data; /**< the Data belonging to this storage */
16 DeleteHashDataFunc Destructor; /**< if we want to destroy Data, do it with this function. */
21 * \brief Hash key element; sorted by key
23 long Key; /**< Numeric Hashkey comperator for hash sorting */
24 long Position; /**< Pointer to a Payload struct in the Payload Aray */
25 char *HashKey; /**< the Plaintext Hashkey */
26 long HKLen; /**< length of the Plaintext Hashkey */
27 Payload *PL; /**< pointer to our payload for sorting */
32 * \brief Hash structure; holds arrays of Hashkey and Payload.
34 Payload **Members; /**< Our Payload members. This fills up linear */
35 HashKey **LookupTable; /**< Hash Lookup table. Elements point to members, and are sorted by their hashvalue */
36 char **MyKeys; /**< this keeps the members for a call of GetHashKeys */
37 HashFunc Algorithm; /**< should we use an alternating algorithm to calc the hash values? */
38 long nMembersUsed; /**< how many pointers inside of the array are used? */
39 long MemberSize; /**< how big is Members and LookupTable? */
40 long tainted; /**< if 0, we're hashed, else s.b. else sorted us in his own way. */
41 long uniq; /**< are the keys going to be uniq? */
46 * \brief Anonymous Hash Iterator Object. used for traversing the whole array from outside
53 * \brief Iterate over the hash and call PrintEntry.
54 * \param Hash your Hashlist structure
55 * \param Trans is called so you could for example print 'A:' if the next entries are like that.
56 * Must be aware to receive NULL in both pointers.
57 * \param PrintEntry print entry one by one
58 * \returns the number of items printed
60 int PrintHash(HashList *Hash, TransitionFunc Trans, PrintHashDataFunc PrintEntry)
67 for (i=0; i < Hash->nMembersUsed; i++) {
72 if (Hash->LookupTable[i - 1] == NULL)
75 Previous = Hash->Members[Hash->LookupTable[i-1]->Position]->Data;
77 if (Hash->LookupTable[i] == NULL) {
82 Next = Hash->Members[Hash->LookupTable[i]->Position]->Data;
83 KeyStr = Hash->LookupTable[i]->HashKey;
86 Trans(Previous, Next, i % 2);
87 PrintEntry(KeyStr, Next, i % 2);
94 * \brief verify the contents of a hash list; here for debugging purposes.
95 * \param Hash your Hashlist structure
96 * \param First Functionpointer to allow you to print your payload
97 * \param Second Functionpointer to allow you to print your payload
100 int dbg_PrintHash(HashList *Hash, PrintHashContent First, PrintHashContent Second)
104 const char *bla = "";
107 if (Hash->MyKeys != NULL)
110 Hash->MyKeys = (char**) malloc(sizeof(char*) * Hash->nMembersUsed);
112 printf("----------------------------------\n");
114 for (i=0; i < Hash->nMembersUsed; i++) {
116 if (Hash->LookupTable[i] == NULL)
124 key = Hash->LookupTable[i]->Key;
125 foo = Hash->LookupTable[i]->HashKey;
127 bar = First(Hash->Members[Hash->LookupTable[i]->Position]->Data);
129 bla = Second(Hash->Members[Hash->LookupTable[i]->Position]->Data);
132 printf (" ---- Hashkey[%ld][%ld]: '%s' Value: '%s' ; %s\n", i, key, foo, bar, bla);
136 printf("----------------------------------\n");
143 * \brief instanciate a new hashlist
144 * \returns the newly allocated list.
146 HashList *NewHash(int Uniq, HashFunc F)
149 NewList = malloc (sizeof(HashList));
150 memset(NewList, 0, sizeof(HashList));
152 NewList->Members = malloc(sizeof(Payload*) * 100);
153 memset(NewList->Members, 0, sizeof(Payload*) * 100);
155 NewList->LookupTable = malloc(sizeof(HashKey*) * 100);
156 memset(NewList->LookupTable, 0, sizeof(HashKey*) * 100);
158 NewList->MemberSize = 100;
159 NewList->tainted = 0;
160 NewList->uniq = Uniq;
161 NewList->Algorithm = F;
166 int GetCount(HashList *Hash)
168 if(Hash==NULL) return 0;
169 return Hash->nMembersUsed;
174 * \brief private destructor for one hash element.
175 * \param Data an element to free using the user provided destructor, or just plain free
177 static void DeleteHashPayload (Payload *Data)
179 /** do we have a destructor for our payload? */
180 if (Data->Destructor)
181 Data->Destructor(Data->Data);
187 * \brief destroy a hashlist and all of its members
188 * \param Hash Hash to destroy. Is NULL'ed so you are shure its done.
190 void DeleteHash(HashList **Hash)
198 for (i=0; i < FreeMe->nMembersUsed; i++)
200 /** get rid of our payload */
201 if (FreeMe->Members[i] != NULL)
203 DeleteHashPayload(FreeMe->Members[i]);
204 free(FreeMe->Members[i]);
206 /** delete our hashing data */
207 if (FreeMe->LookupTable[i] != NULL)
209 free(FreeMe->LookupTable[i]->HashKey);
210 free(FreeMe->LookupTable[i]);
213 /** now, free our arrays... */
214 free(FreeMe->LookupTable);
215 free(FreeMe->Members);
216 /** did s.b. want an array of our keys? free them. */
217 if (FreeMe->MyKeys != NULL)
218 free(FreeMe->MyKeys);
219 /** buye bye cruel world. */
225 * \brief Private function to increase the hash size.
226 * \param Hash the Hasharray to increase
228 static void IncreaseHashSize(HashList *Hash)
230 /* Ok, Our space is used up. Double the available space. */
231 Payload **NewPayloadArea;
234 /** double our payload area */
235 NewPayloadArea = (Payload**) malloc(sizeof(Payload*) * Hash->MemberSize * 2);
236 memset(&NewPayloadArea[Hash->MemberSize], 0, sizeof(Payload*) * Hash->MemberSize);
237 memcpy(NewPayloadArea, Hash->Members, sizeof(Payload*) * Hash->MemberSize);
239 Hash->Members = NewPayloadArea;
241 /** double our hashtable area */
242 NewTable = malloc(sizeof(HashKey*) * Hash->MemberSize * 2);
243 memset(&NewTable[Hash->MemberSize], 0, sizeof(HashKey*) * Hash->MemberSize);
244 memcpy(NewTable, Hash->LookupTable, sizeof(HashKey*) * Hash->MemberSize);
245 free(Hash->LookupTable);
246 Hash->LookupTable = NewTable;
248 Hash->MemberSize *= 2;
253 * \brief private function to add a new item to / replace an existing in - the hashlist
254 * if the hash list is full, its re-alloced with double size.
255 * \parame Hash our hashlist to manipulate
256 * \param HashPos where should we insert / replace?
257 * \param HashKeyStr the Hash-String
258 * \param HKLen length of HashKeyStr
259 * \param Data your Payload to add
260 * \param Destructor Functionpointer to free Data. if NULL, default free() is used.
262 static void InsertHashItem(HashList *Hash,
265 const char *HashKeyStr,
268 DeleteHashDataFunc Destructor)
270 Payload *NewPayloadItem;
273 if (Hash->nMembersUsed >= Hash->MemberSize)
274 IncreaseHashSize (Hash);
276 /** Arrange the payload */
277 NewPayloadItem = (Payload*) malloc (sizeof(Payload));
278 NewPayloadItem->Data = Data;
279 NewPayloadItem->Destructor = Destructor;
280 /** Arrange the hashkey */
281 NewHashKey = (HashKey*) malloc (sizeof(HashKey));
282 NewHashKey->HashKey = (char *) malloc (HKLen + 1);
283 NewHashKey->HKLen = HKLen;
284 memcpy (NewHashKey->HashKey, HashKeyStr, HKLen + 1);
285 NewHashKey->Key = HashBinKey;
286 NewHashKey->PL = NewPayloadItem;
287 /** our payload is queued at the end... */
288 NewHashKey->Position = Hash->nMembersUsed;
289 /** but if we should be sorted into a specific place... */
290 if ((Hash->nMembersUsed != 0) &&
291 (HashPos != Hash->nMembersUsed) ) {
294 ItemsAfter = Hash->nMembersUsed - HashPos;
295 /** make space were we can fill us in */
298 memmove(&Hash->LookupTable[HashPos + 1],
299 &Hash->LookupTable[HashPos],
300 ItemsAfter * sizeof(HashKey*));
304 Hash->Members[Hash->nMembersUsed] = NewPayloadItem;
305 Hash->LookupTable[HashPos] = NewHashKey;
306 Hash->nMembersUsed++;
310 * \brief if the user has tainted the hash, but wants to insert / search items by their key
311 * we need to search linear through the array. You have been warned that this will take more time!
312 * \param Hash Our Hash to manipulate
313 * \param HashBinKey the Hash-Number to lookup.
314 * \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
316 static long FindInTaintedHash(HashList *Hash, long HashBinKey)
320 for (SearchPos = 0; SearchPos < Hash->nMembersUsed; SearchPos ++) {
321 if (Hash->LookupTable[SearchPos]->Key == HashBinKey){
329 * \brief Private function to lookup the Item / the closest position to put it in
330 * \param Hash Our Hash to manipulate
331 * \param HashBinKey the Hash-Number to lookup.
332 * \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
334 static long FindInHash(HashList *Hash, long HashBinKey)
340 return FindInTaintedHash(Hash, HashBinKey);
342 SearchPos = Hash->nMembersUsed / 2;
343 StepWidth = SearchPos / 2;
344 while ((SearchPos > 0) &&
345 (SearchPos < Hash->nMembersUsed))
347 /** Did we find it? */
348 if (Hash->LookupTable[SearchPos]->Key == HashBinKey){
351 /** are we Aproximating in big steps? */
353 if (Hash->LookupTable[SearchPos]->Key > HashBinKey)
354 SearchPos -= StepWidth;
356 SearchPos += StepWidth;
359 else { /** We are right next to our target, within 4 positions */
360 if (Hash->LookupTable[SearchPos]->Key > HashBinKey) {
361 if ((SearchPos > 0) &&
362 (Hash->LookupTable[SearchPos - 1]->Key < HashBinKey))
367 if ((SearchPos + 1 < Hash->nMembersUsed) &&
368 (Hash->LookupTable[SearchPos + 1]->Key > HashBinKey))
379 * \brief private abstract wrapper around the hashing algorithm
380 * \param HKey the hash string
381 * \param HKLen length of HKey
382 * \returns the calculated hash value
384 inline static long CalcHashKey (HashList *Hash, const char *HKey, long HKLen)
386 if (Hash->Algorithm == NULL)
387 return hashlittle(HKey, HKLen, 9283457);
389 return Hash->Algorithm(HKey, HKLen);
394 * \brief Add a new / Replace an existing item in the Hash
395 * \param HashList the list to manipulate
396 * \param HKey the hash-string to store Data under
397 * \param HKeyLen Length of HKey
398 * \param Data the payload you want to associate with HKey
399 * \param DeleteIt if not free() should be used to delete Data set to NULL, else DeleteIt is used.
401 void Put(HashList *Hash, const char *HKey, long HKLen, void *Data, DeleteHashDataFunc DeleteIt)
406 /** first, find out were we could fit in... */
407 HashBinKey = CalcHashKey(Hash, HKey, HKLen);
408 HashAt = FindInHash(Hash, HashBinKey);
410 if (HashAt >= Hash->MemberSize)
411 IncreaseHashSize (Hash);
413 /** oh, we're brand new... */
414 if (Hash->LookupTable[HashAt] == NULL) {
415 InsertHashItem(Hash, HashAt, HashBinKey, HKey, HKLen, Data, DeleteIt);
416 }/** Insert After? */
417 else if (Hash->LookupTable[HashAt]->Key > HashBinKey) {
418 InsertHashItem(Hash, HashAt, HashBinKey, HKey, HKLen, Data, DeleteIt);
419 }/** Insert before? */
420 else if (Hash->LookupTable[HashAt]->Key < HashBinKey) {
421 InsertHashItem(Hash, HashAt + 1, HashBinKey, HKey, HKLen, Data, DeleteIt);
423 else { /** Ok, we have a colision. replace it. */
427 PayloadPos = Hash->LookupTable[HashAt]->Position;
428 DeleteHashPayload(Hash->Members[PayloadPos]);
429 Hash->Members[PayloadPos]->Data = Data;
430 Hash->Members[PayloadPos]->Destructor = DeleteIt;
433 InsertHashItem(Hash, HashAt + 1, HashBinKey, HKey, HKLen, Data, DeleteIt);
439 * \brief Lookup the Data associated with HKey
440 * \param Hash the Hashlist to search in
441 * \param HKey the hashkey to look up
442 * \param HKLen length of HKey
443 * \param Data returns the Data associated with HKey
444 * \returns 0 if not found, 1 if.
446 int GetHash(HashList *Hash, const char *HKey, long HKLen, void **Data)
455 /** first, find out were we could be... */
456 HashBinKey = CalcHashKey(Hash, HKey, HKLen);
457 HashAt = FindInHash(Hash, HashBinKey);
458 if ((HashAt < 0) || /**< Not found at the lower edge? */
459 (HashAt >= Hash->nMembersUsed) || /**< Not found at the upper edge? */
460 (Hash->LookupTable[HashAt]->Key != HashBinKey)) { /**< somewhere inbetween but no match? */
464 else { /** GOTCHA! */
467 MemberPosition = Hash->LookupTable[HashAt]->Position;
468 *Data = Hash->Members[MemberPosition]->Data;
474 int GetKey(HashList *Hash, char *HKey, long HKLen, void **Payload)
480 * \brief get the Keys present in this hash, simila to array_keys() in PHP
481 * Attention: List remains to Hash! don't modify or free it!
482 * \param Hash Your Hashlist to extract the keys from
483 * \param List returns the list of hashkeys stored in Hash
485 int GetHashKeys(HashList *Hash, char ***List)
488 if (Hash->MyKeys != NULL)
491 Hash->MyKeys = (char**) malloc(sizeof(char*) * Hash->nMembersUsed);
492 for (i=0; i < Hash->nMembersUsed; i++) {
494 Hash->MyKeys[i] = Hash->LookupTable[i]->HashKey;
496 *List = (char**)Hash->MyKeys;
497 return Hash->nMembersUsed;
501 * \brief creates a hash-linear iterator object
502 * \returns the hash iterator
504 HashPos *GetNewHashPos(void)
508 Ret = (HashPos*)malloc(sizeof(HashPos));
514 * \brief frees a linear hash iterator
516 void DeleteHashPos(HashPos **DelMe)
524 * \brief Get the data located where HashPos Iterator points at, and Move HashPos one forward
525 * \param Hash your Hashlist to follow
526 * \param HKLen returns Length of Hashkey Returned
527 * \param HashKey returns the Hashkey corrosponding to HashPos
528 * \param Data returns the Data found at HashPos
529 * \returns whether the item was found or not.
531 int GetNextHashPos(HashList *Hash, HashPos *At, long *HKLen, char **HashKey, void **Data)
535 if (Hash->nMembersUsed <= At->Position)
537 *HKLen = Hash->LookupTable[At->Position]->HKLen;
538 *HashKey = Hash->LookupTable[At->Position]->HashKey;
539 PayloadPos = Hash->LookupTable[At->Position]->Position;
540 *Data = Hash->Members[PayloadPos]->Data;
546 * \brief sorting function for sorting the Hash alphabeticaly by their strings
547 * \param Key1 first item
548 * \param Key2 second item
550 static int SortByKeys(const void *Key1, const void* Key2)
552 HashKey *HKey1, *HKey2;
553 HKey1 = *(HashKey**) Key1;
554 HKey2 = *(HashKey**) Key2;
556 return strcasecmp(HKey1->HashKey, HKey2->HashKey);
560 * \brief sorting function for sorting the Hash alphabeticaly reverse by their strings
561 * \param Key1 first item
562 * \param Key2 second item
564 static int SortByKeysRev(const void *Key1, const void* Key2)
566 HashKey *HKey1, *HKey2;
567 HKey1 = *(HashKey**) Key1;
568 HKey2 = *(HashKey**) Key2;
570 return strcasecmp(HKey2->HashKey, HKey1->HashKey);
574 * \brief sorting function to regain hash-sequence and revert tainted status
575 * \param Key1 first item
576 * \param Key2 second item
578 static int SortByHashKeys(const void *Key1, const void* Key2)
580 HashKey *HKey1, *HKey2;
581 HKey1 = *(HashKey**) Key1;
582 HKey2 = *(HashKey**) Key2;
584 return HKey1->Key > HKey2->Key;
589 * \brief sort the hash alphabeticaly by their keys.
590 * Caution: This taints the hashlist, so accessing it later
591 * will be significantly slower! You can un-taint it by SortByHashKeyStr
592 * \param Hash the list to sort
593 * \param Order 0/1 Forward/Backward
595 void SortByHashKey(HashList *Hash, int Order)
597 if (Hash->nMembersUsed < 2)
599 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*),
600 (Order)?SortByKeys:SortByKeysRev);
605 * \brief sort the hash by their keys (so it regains untainted state).
606 * this will result in the sequence the hashing allgorithm produces it by default.
607 * \param Hash the list to sort
609 void SortByHashKeyStr(HashList *Hash)
612 if (Hash->nMembersUsed < 2)
614 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*), SortByHashKeys);
619 * \brief gives user sort routines access to the hash payload
620 * \param Searchentry to retrieve Data to
621 * \returns Data belonging to HashVoid
623 const void *GetSearchPayload(const void *HashVoid)
625 return (*(HashKey**)HashVoid)->PL->Data;
629 * \brief sort the hash by your sort function. see the following sample.
630 * this will result in the sequence the hashing allgorithm produces it by default.
631 * \param Hash the list to sort
632 * \param SortBy Sortfunction; see below how to implement this
634 void SortByPayload(HashList *Hash, CompareFunc SortBy)
636 if (Hash->nMembersUsed < 2)
638 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*), SortBy);
646 * given you've put char * into your hash as a payload, a sort function might
648 * int SortByChar(const void* First, const void* Second)
651 * a = (char*) GetSearchPayload(First);
652 * b = (char*) GetSearchPayload(Second);
653 * return strcmp (a, b);