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;
167 * \brief private destructor for one hash element.
168 * \param Data an element to free using the user provided destructor, or just plain free
170 static void DeleteHashPayload (Payload *Data)
172 /** do we have a destructor for our payload? */
173 if (Data->Destructor)
174 Data->Destructor(Data->Data);
180 * \brief destroy a hashlist and all of its members
181 * \param Hash Hash to destroy. Is NULL'ed so you are shure its done.
183 void DeleteHash(HashList **Hash)
191 for (i=0; i < FreeMe->nMembersUsed; i++)
193 /** get rid of our payload */
194 if (FreeMe->Members[i] != NULL)
196 DeleteHashPayload(FreeMe->Members[i]);
197 free(FreeMe->Members[i]);
199 /** delete our hashing data */
200 if (FreeMe->LookupTable[i] != NULL)
202 free(FreeMe->LookupTable[i]->HashKey);
203 free(FreeMe->LookupTable[i]);
206 /** now, free our arrays... */
207 free(FreeMe->LookupTable);
208 free(FreeMe->Members);
209 /** did s.b. want an array of our keys? free them. */
210 if (FreeMe->MyKeys != NULL)
211 free(FreeMe->MyKeys);
212 /** buye bye cruel world. */
218 * \brief Private function to increase the hash size.
219 * \param Hash the Hasharray to increase
221 static void IncreaseHashSize(HashList *Hash)
223 /* Ok, Our space is used up. Double the available space. */
224 Payload **NewPayloadArea;
227 /** double our payload area */
228 NewPayloadArea = (Payload**) malloc(sizeof(Payload*) * Hash->MemberSize * 2);
229 memset(&NewPayloadArea[Hash->MemberSize], 0, sizeof(Payload*) * Hash->MemberSize);
230 memcpy(NewPayloadArea, Hash->Members, sizeof(Payload*) * Hash->MemberSize);
232 Hash->Members = NewPayloadArea;
234 /** double our hashtable area */
235 NewTable = malloc(sizeof(HashKey*) * Hash->MemberSize * 2);
236 memset(&NewTable[Hash->MemberSize], 0, sizeof(HashKey*) * Hash->MemberSize);
237 memcpy(NewTable, Hash->LookupTable, sizeof(HashKey*) * Hash->MemberSize);
238 free(Hash->LookupTable);
239 Hash->LookupTable = NewTable;
241 Hash->MemberSize *= 2;
246 * \brief private function to add a new item to / replace an existing in - the hashlist
247 * if the hash list is full, its re-alloced with double size.
248 * \parame Hash our hashlist to manipulate
249 * \param HashPos where should we insert / replace?
250 * \param HashKeyStr the Hash-String
251 * \param HKLen length of HashKeyStr
252 * \param Data your Payload to add
253 * \param Destructor Functionpointer to free Data. if NULL, default free() is used.
255 static void InsertHashItem(HashList *Hash,
258 const char *HashKeyStr,
261 DeleteHashDataFunc Destructor)
263 Payload *NewPayloadItem;
266 if (Hash->nMembersUsed >= Hash->MemberSize)
267 IncreaseHashSize (Hash);
269 /** Arrange the payload */
270 NewPayloadItem = (Payload*) malloc (sizeof(Payload));
271 NewPayloadItem->Data = Data;
272 NewPayloadItem->Destructor = Destructor;
273 /** Arrange the hashkey */
274 NewHashKey = (HashKey*) malloc (sizeof(HashKey));
275 NewHashKey->HashKey = (char *) malloc (HKLen + 1);
276 NewHashKey->HKLen = HKLen;
277 memcpy (NewHashKey->HashKey, HashKeyStr, HKLen + 1);
278 NewHashKey->Key = HashBinKey;
279 NewHashKey->PL = NewPayloadItem;
280 /** our payload is queued at the end... */
281 NewHashKey->Position = Hash->nMembersUsed;
282 /** but if we should be sorted into a specific place... */
283 if ((Hash->nMembersUsed != 0) &&
284 (HashPos != Hash->nMembersUsed) ) {
288 ItemsAfter = Hash->nMembersUsed - HashPos;
290 /** make space were we can fill us in */
293 memmove(&Hash->LookupTable[InsertAt + 1],
294 &Hash->LookupTable[InsertAt],
295 ItemsAfter * sizeof(HashKey*));
299 Hash->Members[Hash->nMembersUsed] = NewPayloadItem;
300 Hash->LookupTable[HashPos] = NewHashKey;
301 Hash->nMembersUsed++;
305 * \brief if the user has tainted the hash, but wants to insert / search items by their key
306 * we need to search linear through the array. You have been warned that this will take more time!
307 * \param Hash Our Hash to manipulate
308 * \param HashBinKey the Hash-Number to lookup.
309 * \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
311 static long FindInTaintedHash(HashList *Hash, long HashBinKey)
315 for (SearchPos = 0; SearchPos < Hash->nMembersUsed; SearchPos ++) {
316 if (Hash->LookupTable[SearchPos]->Key == HashBinKey){
324 * \brief Private function to lookup the Item / the closest position to put it in
325 * \param Hash Our Hash to manipulate
326 * \param HashBinKey the Hash-Number to lookup.
327 * \returns the position (most closely) matching HashBinKey (-> Caller needs to compare! )
329 static long FindInHash(HashList *Hash, long HashBinKey)
335 return FindInTaintedHash(Hash, HashBinKey);
337 SearchPos = Hash->nMembersUsed / 2;
338 StepWidth = SearchPos / 2;
339 while ((SearchPos > 0) &&
340 (SearchPos < Hash->nMembersUsed))
342 /** Did we find it? */
343 if (Hash->LookupTable[SearchPos]->Key == HashBinKey){
346 /** are we Aproximating in big steps? */
348 if (Hash->LookupTable[SearchPos]->Key > HashBinKey)
349 SearchPos -= StepWidth;
351 SearchPos += StepWidth;
354 else { /** We are right next to our target, within 4 positions */
355 if (Hash->LookupTable[SearchPos]->Key > HashBinKey) {
356 if ((SearchPos > 0) &&
357 (Hash->LookupTable[SearchPos - 1]->Key < HashBinKey))
362 if ((SearchPos + 1 < Hash->nMembersUsed) &&
363 (Hash->LookupTable[SearchPos + 1]->Key > HashBinKey))
374 * \brief private abstract wrapper around the hashing algorithm
375 * \param HKey the hash string
376 * \param HKLen length of HKey
377 * \returns the calculated hash value
379 inline static long CalcHashKey (HashList *Hash, const char *HKey, long HKLen)
381 if (Hash->Algorithm == NULL)
382 return hashlittle(HKey, HKLen, 9283457);
384 return Hash->Algorithm(HKey, HKLen);
389 * \brief Add a new / Replace an existing item in the Hash
390 * \param HashList the list to manipulate
391 * \param HKey the hash-string to store Data under
392 * \param HKeyLen Length of HKey
393 * \param Data the payload you want to associate with HKey
394 * \param DeleteIt if not free() should be used to delete Data set to NULL, else DeleteIt is used.
396 void Put(HashList *Hash, const char *HKey, long HKLen, void *Data, DeleteHashDataFunc DeleteIt)
401 /** first, find out were we could fit in... */
402 HashBinKey = CalcHashKey(Hash, HKey, HKLen);
403 HashAt = FindInHash(Hash, HashBinKey);
405 if (HashAt >= Hash->MemberSize)
406 IncreaseHashSize (Hash);
408 /** oh, we're brand new... */
409 if (Hash->LookupTable[HashAt] == NULL) {
410 InsertHashItem(Hash, HashAt, HashBinKey, HKey, HKLen, Data, DeleteIt);
411 }/** Insert After? */
412 else if (Hash->LookupTable[HashAt]->Key > HashBinKey) {
413 InsertHashItem(Hash, HashAt, HashBinKey, HKey, HKLen, Data, DeleteIt);
414 }/** Insert before? */
415 else if (Hash->LookupTable[HashAt]->Key < HashBinKey) {
416 InsertHashItem(Hash, HashAt + 1, HashBinKey, HKey, HKLen, Data, DeleteIt);
418 else { /** Ok, we have a colision. replace it. */
422 PayloadPos = Hash->LookupTable[HashAt]->Position;
423 DeleteHashPayload(Hash->Members[PayloadPos]);
424 Hash->Members[PayloadPos]->Data = Data;
425 Hash->Members[PayloadPos]->Destructor = DeleteIt;
428 InsertHashItem(Hash, HashAt + 1, HashBinKey, HKey, HKLen, Data, DeleteIt);
434 * \brief Lookup the Data associated with HKey
435 * \param Hash the Hashlist to search in
436 * \param HKey the hashkey to look up
437 * \param HKLen length of HKey
438 * \param Data returns the Data associated with HKey
439 * \returns 0 if not found, 1 if.
441 int GetHash(HashList *Hash, const char *HKey, long HKLen, void **Data)
450 /** first, find out were we could be... */
451 HashBinKey = CalcHashKey(Hash, HKey, HKLen);
452 HashAt = FindInHash(Hash, HashBinKey);
453 if ((HashAt < 0) || /**< Not found at the lower edge? */
454 (HashAt >= Hash->nMembersUsed) || /**< Not found at the upper edge? */
455 (Hash->LookupTable[HashAt]->Key != HashBinKey)) { /**< somewhere inbetween but no match? */
459 else { /** GOTCHA! */
462 MemberPosition = Hash->LookupTable[HashAt]->Position;
463 *Data = Hash->Members[MemberPosition]->Data;
469 int GetKey(HashList *Hash, char *HKey, long HKLen, void **Payload)
475 * \brief get the Keys present in this hash, simila to array_keys() in PHP
476 * Attention: List remains to Hash! don't modify or free it!
477 * \param Hash Your Hashlist to extract the keys from
478 * \param List returns the list of hashkeys stored in Hash
480 int GetHashKeys(HashList *Hash, char ***List)
483 if (Hash->MyKeys != NULL)
486 Hash->MyKeys = (char**) malloc(sizeof(char*) * Hash->nMembersUsed);
487 for (i=0; i < Hash->nMembersUsed; i++) {
489 Hash->MyKeys[i] = Hash->LookupTable[i]->HashKey;
491 *List = (char**)Hash->MyKeys;
492 return Hash->nMembersUsed;
496 * \brief creates a hash-linear iterator object
497 * \returns the hash iterator
499 HashPos *GetNewHashPos(void)
503 Ret = (HashPos*)malloc(sizeof(HashPos));
509 * \brief frees a linear hash iterator
511 void DeleteHashPos(HashPos **DelMe)
519 * \brief Get the data located where HashPos Iterator points at, and Move HashPos one forward
520 * \param Hash your Hashlist to follow
521 * \param HKLen returns Length of Hashkey Returned
522 * \param HashKey returns the Hashkey corrosponding to HashPos
523 * \param Data returns the Data found at HashPos
524 * \returns whether the item was found or not.
526 int GetNextHashPos(HashList *Hash, HashPos *At, long *HKLen, char **HashKey, void **Data)
530 if (Hash->nMembersUsed <= At->Position)
532 *HKLen = Hash->LookupTable[At->Position]->HKLen;
533 *HashKey = Hash->LookupTable[At->Position]->HashKey;
534 PayloadPos = Hash->LookupTable[At->Position]->Position;
535 *Data = Hash->Members[PayloadPos]->Data;
541 * \brief sorting function for sorting the Hash alphabeticaly by their strings
542 * \param Key1 first item
543 * \param Key2 second item
545 static int SortByKeys(const void *Key1, const void* Key2)
547 HashKey *HKey1, *HKey2;
548 HKey1 = *(HashKey**) Key1;
549 HKey2 = *(HashKey**) Key2;
551 return strcasecmp(HKey1->HashKey, HKey2->HashKey);
555 * \brief sorting function for sorting the Hash alphabeticaly reverse by their strings
556 * \param Key1 first item
557 * \param Key2 second item
559 static int SortByKeysRev(const void *Key1, const void* Key2)
561 HashKey *HKey1, *HKey2;
562 HKey1 = *(HashKey**) Key1;
563 HKey2 = *(HashKey**) Key2;
565 return strcasecmp(HKey2->HashKey, HKey1->HashKey);
569 * \brief sorting function to regain hash-sequence and revert tainted status
570 * \param Key1 first item
571 * \param Key2 second item
573 static int SortByHashKeys(const void *Key1, const void* Key2)
575 HashKey *HKey1, *HKey2;
576 HKey1 = *(HashKey**) Key1;
577 HKey2 = *(HashKey**) Key2;
579 return HKey1->Key > HKey2->Key;
584 * \brief sort the hash alphabeticaly by their keys.
585 * Caution: This taints the hashlist, so accessing it later
586 * will be significantly slower! You can un-taint it by SortByHashKeyStr
587 * \param Hash the list to sort
588 * \param Order 0/1 Forward/Backward
590 void SortByHashKey(HashList *Hash, int Order)
592 if (Hash->nMembersUsed < 2)
594 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*),
595 (Order)?SortByKeys:SortByKeysRev);
600 * \brief sort the hash by their keys (so it regains untainted state).
601 * this will result in the sequence the hashing allgorithm produces it by default.
602 * \param Hash the list to sort
604 void SortByHashKeyStr(HashList *Hash)
607 if (Hash->nMembersUsed < 2)
609 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*), SortByHashKeys);
614 * \brief gives user sort routines access to the hash payload
615 * \param Searchentry to retrieve Data to
616 * \returns Data belonging to HashVoid
618 const void *GetSearchPayload(const void *HashVoid)
620 return (*(HashKey**)HashVoid)->PL->Data;
624 * \brief sort the hash by your sort function. see the following sample.
625 * this will result in the sequence the hashing allgorithm produces it by default.
626 * \param Hash the list to sort
627 * \param SortBy Sortfunction; see below how to implement this
629 void SortByPayload(HashList *Hash, CompareFunc SortBy)
631 if (Hash->nMembersUsed < 2)
633 qsort(Hash->LookupTable, Hash->nMembersUsed, sizeof(HashKey*), SortBy);
641 * given you've put char * into your hash as a payload, a sort function might
643 * int SortByChar(const void* First, const void* Second)
646 * a = (char*) GetSearchPayload(First);
647 * b = (char*) GetSearchPayload(Second);
648 * return strcmp (a, b);