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)
70 for (i=0; i < Hash->nMembersUsed; i++) {
75 if (Hash->LookupTable[i - 1] == NULL)
78 Previous = Hash->Members[Hash->LookupTable[i-1]->Position]->Data;
80 if (Hash->LookupTable[i] == NULL) {
85 Next = Hash->Members[Hash->LookupTable[i]->Position]->Data;
86 KeyStr = Hash->LookupTable[i]->HashKey;
89 Trans(Previous, Next, i % 2);
90 PrintEntry(KeyStr, Next, i % 2);
97 * \brief verify the contents of a hash list; here for debugging purposes.
98 * \param Hash your Hashlist structure
99 * \param First Functionpointer to allow you to print your payload
100 * \param Second Functionpointer to allow you to print your payload
103 int dbg_PrintHash(HashList *Hash, PrintHashContent First, PrintHashContent Second)
107 const char *bla = "";
114 if (Hash->MyKeys != NULL)
117 Hash->MyKeys = (char**) malloc(sizeof(char*) * Hash->nMembersUsed);
119 printf("----------------------------------\n");
121 for (i=0; i < Hash->nMembersUsed; i++) {
123 if (Hash->LookupTable[i] == NULL)
131 key = Hash->LookupTable[i]->Key;
132 foo = Hash->LookupTable[i]->HashKey;
134 bar = First(Hash->Members[Hash->LookupTable[i]->Position]->Data);
138 bla = Second(Hash->Members[Hash->LookupTable[i]->Position]->Data);
143 printf (" ---- Hashkey[%ld][%ld]: '%s' Value: '%s' ; %s\n", i, key, foo, bar, bla);
147 printf("----------------------------------\n");
154 * \brief instanciate a new hashlist
155 * \returns the newly allocated list.
157 HashList *NewHash(int Uniq, HashFunc F)
160 NewList = malloc (sizeof(HashList));
161 memset(NewList, 0, sizeof(HashList));
163 NewList->Members = malloc(sizeof(Payload*) * 100);
164 memset(NewList->Members, 0, sizeof(Payload*) * 100);
166 NewList->LookupTable = malloc(sizeof(HashKey*) * 100);
167 memset(NewList->LookupTable, 0, sizeof(HashKey*) * 100);
169 NewList->MemberSize = 100;
170 NewList->tainted = 0;
171 NewList->uniq = Uniq;
172 NewList->Algorithm = F;
177 int GetCount(HashList *Hash)
179 if(Hash==NULL) return 0;
180 return Hash->nMembersUsed;
185 * \brief private destructor for one hash element.
186 * Crashing? go one frame up and do 'print *FreeMe->LookupTable[i]'
187 * \param Data an element to free using the user provided destructor, or just plain free
189 static void DeleteHashPayload (Payload *Data)
191 /** do we have a destructor for our payload? */
192 if (Data->Destructor)
193 Data->Destructor(Data->Data);
199 * \brief destroy a hashlist and all of its members
200 * Crashing? do 'print *FreeMe->LookupTable[i]'
201 * \param Hash Hash to destroy. Is NULL'ed so you are shure its done.
203 void DeleteHash(HashList **Hash)
211 for (i=0; i < FreeMe->nMembersUsed; i++)
213 /** get rid of our payload */
214 if (FreeMe->Members[i] != NULL)
216 DeleteHashPayload(FreeMe->Members[i]);
217 free(FreeMe->Members[i]);
219 /** delete our hashing data */
220 if (FreeMe->LookupTable[i] != NULL)
222 free(FreeMe->LookupTable[i]->HashKey);
223 free(FreeMe->LookupTable[i]);
226 /** now, free our arrays... */
227 free(FreeMe->LookupTable);
228 free(FreeMe->Members);
229 /** did s.b. want an array of our keys? free them. */
230 if (FreeMe->MyKeys != NULL)
231 free(FreeMe->MyKeys);
232 /** buye bye cruel world. */
238 * \brief Private function to increase the hash size.
239 * \param Hash the Hasharray to increase
241 static void IncreaseHashSize(HashList *Hash)
243 /* Ok, Our space is used up. Double the available space. */
244 Payload **NewPayloadArea;
250 /** double our payload area */
251 NewPayloadArea = (Payload**) malloc(sizeof(Payload*) * Hash->MemberSize * 2);
252 memset(&NewPayloadArea[Hash->MemberSize], 0, sizeof(Payload*) * Hash->MemberSize);
253 memcpy(NewPayloadArea, Hash->Members, sizeof(Payload*) * Hash->MemberSize);
255 Hash->Members = NewPayloadArea;
257 /** double our hashtable area */
258 NewTable = malloc(sizeof(HashKey*) * Hash->MemberSize * 2);
259 memset(&NewTable[Hash->MemberSize], 0, sizeof(HashKey*) * Hash->MemberSize);
260 memcpy(NewTable, Hash->LookupTable, sizeof(HashKey*) * Hash->MemberSize);
261 free(Hash->LookupTable);
262 Hash->LookupTable = NewTable;
264 Hash->MemberSize *= 2;
269 * \brief private function to add a new item to / replace an existing in - the hashlist
270 * if the hash list is full, its re-alloced with double size.
271 * \parame Hash our hashlist to manipulate
272 * \param HashPos where should we insert / replace?
273 * \param HashKeyStr the Hash-String
274 * \param HKLen length of HashKeyStr
275 * \param Data your Payload to add
276 * \param Destructor Functionpointer to free Data. if NULL, default free() is used.
278 static void InsertHashItem(HashList *Hash,
281 const char *HashKeyStr,
284 DeleteHashDataFunc Destructor)
286 Payload *NewPayloadItem;
292 if (Hash->nMembersUsed >= Hash->MemberSize)
293 IncreaseHashSize (Hash);
295 /** Arrange the payload */
296 NewPayloadItem = (Payload*) malloc (sizeof(Payload));
297 NewPayloadItem->Data = Data;
298 NewPayloadItem->Destructor = Destructor;
299 /** Arrange the hashkey */
300 NewHashKey = (HashKey*) malloc (sizeof(HashKey));
301 NewHashKey->HashKey = (char *) malloc (HKLen + 1);
302 NewHashKey->HKLen = HKLen;
303 memcpy (NewHashKey->HashKey, HashKeyStr, HKLen + 1);
304 NewHashKey->Key = HashBinKey;
305 NewHashKey->PL = NewPayloadItem;
306 /** our payload is queued at the end... */
307 NewHashKey->Position = Hash->nMembersUsed;
308 /** but if we should be sorted into a specific place... */
309 if ((Hash->nMembersUsed != 0) &&
310 (HashPos != Hash->nMembersUsed) ) {
313 ItemsAfter = Hash->nMembersUsed - HashPos;
314 /** make space were we can fill us in */
317 memmove(&Hash->LookupTable[HashPos + 1],
318 &Hash->LookupTable[HashPos],
319 ItemsAfter * sizeof(HashKey*));
323 Hash->Members[Hash->nMembersUsed] = NewPayloadItem;
324 Hash->LookupTable[HashPos] = NewHashKey;
325 Hash->nMembersUsed++;
329 * \brief if the user has tainted the hash, but wants to insert / search items by their key
330 * we need to search linear through the array. You have been warned that this will take more time!
331 * \param Hash Our Hash to manipulate
332 * \param HashBinKey the Hash-Number to lookup.
333 * \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
335 static long FindInTaintedHash(HashList *Hash, long HashBinKey)
342 for (SearchPos = 0; SearchPos < Hash->nMembersUsed; SearchPos ++) {
343 if (Hash->LookupTable[SearchPos]->Key == HashBinKey){
351 * \brief Private function to lookup the Item / the closest position to put it in
352 * \param Hash Our Hash to manipulate
353 * \param HashBinKey the Hash-Number to lookup.
354 * \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
356 static long FindInHash(HashList *Hash, long HashBinKey)
365 return FindInTaintedHash(Hash, HashBinKey);
367 SearchPos = Hash->nMembersUsed / 2;
368 StepWidth = SearchPos / 2;
369 while ((SearchPos > 0) &&
370 (SearchPos < Hash->nMembersUsed))
372 /** Did we find it? */
373 if (Hash->LookupTable[SearchPos]->Key == HashBinKey){
376 /** are we Aproximating in big steps? */
378 if (Hash->LookupTable[SearchPos]->Key > HashBinKey)
379 SearchPos -= StepWidth;
381 SearchPos += StepWidth;
384 else { /** We are right next to our target, within 4 positions */
385 if (Hash->LookupTable[SearchPos]->Key > HashBinKey) {
386 if ((SearchPos > 0) &&
387 (Hash->LookupTable[SearchPos - 1]->Key < HashBinKey))
392 if ((SearchPos + 1 < Hash->nMembersUsed) &&
393 (Hash->LookupTable[SearchPos + 1]->Key > HashBinKey))
404 * \brief private abstract wrapper around the hashing algorithm
405 * \param HKey the hash string
406 * \param HKLen length of HKey
407 * \returns the calculated hash value
409 inline static long CalcHashKey (HashList *Hash, const char *HKey, long HKLen)
414 if (Hash->Algorithm == NULL)
415 return hashlittle(HKey, HKLen, 9283457);
417 return Hash->Algorithm(HKey, HKLen);
422 * \brief Add a new / Replace an existing item in the Hash
423 * \param HashList the list to manipulate
424 * \param HKey the hash-string to store Data under
425 * \param HKeyLen Length of HKey
426 * \param Data the payload you want to associate with HKey
427 * \param DeleteIt if not free() should be used to delete Data set to NULL, else DeleteIt is used.
429 void Put(HashList *Hash, const char *HKey, long HKLen, void *Data, DeleteHashDataFunc DeleteIt)
437 /** first, find out were we could fit in... */
438 HashBinKey = CalcHashKey(Hash, HKey, HKLen);
439 HashAt = FindInHash(Hash, HashBinKey);
441 if (HashAt >= Hash->MemberSize)
442 IncreaseHashSize (Hash);
444 /** oh, we're brand new... */
445 if (Hash->LookupTable[HashAt] == NULL) {
446 InsertHashItem(Hash, HashAt, HashBinKey, HKey, HKLen, Data, DeleteIt);
447 }/** Insert After? */
448 else if (Hash->LookupTable[HashAt]->Key > HashBinKey) {
449 InsertHashItem(Hash, HashAt, HashBinKey, HKey, HKLen, Data, DeleteIt);
450 }/** Insert before? */
451 else if (Hash->LookupTable[HashAt]->Key < HashBinKey) {
452 InsertHashItem(Hash, HashAt + 1, HashBinKey, HKey, HKLen, Data, DeleteIt);
454 else { /** Ok, we have a colision. replace it. */
458 PayloadPos = Hash->LookupTable[HashAt]->Position;
459 DeleteHashPayload(Hash->Members[PayloadPos]);
460 Hash->Members[PayloadPos]->Data = Data;
461 Hash->Members[PayloadPos]->Destructor = DeleteIt;
464 InsertHashItem(Hash, HashAt + 1, HashBinKey, HKey, HKLen, Data, DeleteIt);
470 * \brief Lookup the Data associated with HKey
471 * \param Hash the Hashlist to search in
472 * \param HKey the hashkey to look up
473 * \param HKLen length of HKey
474 * \param Data returns the Data associated with HKey
475 * \returns 0 if not found, 1 if.
477 int GetHash(HashList *Hash, const char *HKey, long HKLen, void **Data)
489 /** first, find out were we could be... */
490 HashBinKey = CalcHashKey(Hash, HKey, HKLen);
491 HashAt = FindInHash(Hash, HashBinKey);
492 if ((HashAt < 0) || /**< Not found at the lower edge? */
493 (HashAt >= Hash->nMembersUsed) || /**< Not found at the upper edge? */
494 (Hash->LookupTable[HashAt]->Key != HashBinKey)) { /**< somewhere inbetween but no match? */
498 else { /** GOTCHA! */
501 MemberPosition = Hash->LookupTable[HashAt]->Position;
502 *Data = Hash->Members[MemberPosition]->Data;
508 int GetKey(HashList *Hash, char *HKey, long HKLen, void **Payload)
514 * \brief get the Keys present in this hash, simila to array_keys() in PHP
515 * Attention: List remains to Hash! don't modify or free it!
516 * \param Hash Your Hashlist to extract the keys from
517 * \param List returns the list of hashkeys stored in Hash
519 int GetHashKeys(HashList *Hash, char ***List)
524 if (Hash->MyKeys != NULL)
527 Hash->MyKeys = (char**) malloc(sizeof(char*) * Hash->nMembersUsed);
528 for (i=0; i < Hash->nMembersUsed; i++) {
530 Hash->MyKeys[i] = Hash->LookupTable[i]->HashKey;
532 *List = (char**)Hash->MyKeys;
533 return Hash->nMembersUsed;
537 * \brief creates a hash-linear iterator object
538 * \returns the hash iterator
540 HashPos *GetNewHashPos(void)
544 Ret = (HashPos*)malloc(sizeof(HashPos));
550 * \brief frees a linear hash iterator
552 void DeleteHashPos(HashPos **DelMe)
563 * \brief Get the data located where HashPos Iterator points at, and Move HashPos one forward
564 * \param Hash your Hashlist to follow
565 * \param HKLen returns Length of Hashkey Returned
566 * \param HashKey returns the Hashkey corrosponding to HashPos
567 * \param Data returns the Data found at HashPos
568 * \returns whether the item was found or not.
570 int GetNextHashPos(HashList *Hash, HashPos *At, long *HKLen, const char **HashKey, void **Data)
574 if ((Hash == NULL) || (Hash->nMembersUsed <= At->Position))
576 *HKLen = Hash->LookupTable[At->Position]->HKLen;
577 *HashKey = Hash->LookupTable[At->Position]->HashKey;
578 PayloadPos = Hash->LookupTable[At->Position]->Position;
579 *Data = Hash->Members[PayloadPos]->Data;
585 * \brief sorting function for sorting the Hash alphabeticaly by their strings
586 * \param Key1 first item
587 * \param Key2 second item
589 static int SortByKeys(const void *Key1, const void* Key2)
591 HashKey *HKey1, *HKey2;
592 HKey1 = *(HashKey**) Key1;
593 HKey2 = *(HashKey**) Key2;
595 return strcasecmp(HKey1->HashKey, HKey2->HashKey);
599 * \brief sorting function for sorting the Hash alphabeticaly reverse by their strings
600 * \param Key1 first item
601 * \param Key2 second item
603 static int SortByKeysRev(const void *Key1, const void* Key2)
605 HashKey *HKey1, *HKey2;
606 HKey1 = *(HashKey**) Key1;
607 HKey2 = *(HashKey**) Key2;
609 return strcasecmp(HKey2->HashKey, HKey1->HashKey);
613 * \brief sorting function to regain hash-sequence and revert tainted status
614 * \param Key1 first item
615 * \param Key2 second item
617 static int SortByHashKeys(const void *Key1, const void* Key2)
619 HashKey *HKey1, *HKey2;
620 HKey1 = *(HashKey**) Key1;
621 HKey2 = *(HashKey**) Key2;
623 return HKey1->Key > HKey2->Key;
628 * \brief sort the hash alphabeticaly by their keys.
629 * Caution: This taints the hashlist, so accessing it later
630 * will be significantly slower! You can un-taint it by SortByHashKeyStr
631 * \param Hash the list to sort
632 * \param Order 0/1 Forward/Backward
634 void SortByHashKey(HashList *Hash, int Order)
636 if (Hash->nMembersUsed < 2)
638 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*),
639 (Order)?SortByKeys:SortByKeysRev);
644 * \brief sort the hash by their keys (so it regains untainted state).
645 * this will result in the sequence the hashing allgorithm produces it by default.
646 * \param Hash the list to sort
648 void SortByHashKeyStr(HashList *Hash)
651 if (Hash->nMembersUsed < 2)
653 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*), SortByHashKeys);
658 * \brief gives user sort routines access to the hash payload
659 * \param Searchentry to retrieve Data to
660 * \returns Data belonging to HashVoid
662 const void *GetSearchPayload(const void *HashVoid)
664 return (*(HashKey**)HashVoid)->PL->Data;
668 * \brief sort the hash by your sort function. see the following sample.
669 * this will result in the sequence the hashing allgorithm produces it by default.
670 * \param Hash the list to sort
671 * \param SortBy Sortfunction; see below how to implement this
673 void SortByPayload(HashList *Hash, CompareFunc SortBy)
675 if (Hash->nMembersUsed < 2)
677 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*), SortBy);
685 * given you've put char * into your hash as a payload, a sort function might
687 * int SortByChar(const void* First, const void* Second)
690 * a = (char*) GetSearchPayload(First);
691 * b = (char*) GetSearchPayload(Second);
692 * return strcmp (a, b);
698 * Generic function to free a pointer. This can be used as a callback with the
699 * hash table, even on systems where free() is defined as a macro or has had other
700 * horrible things done to it.
702 void generic_free_handler(void *ptr) {