3 /* dict - a generic dictionnary, variation over the B-tree concept */
5 /* Copyright (c) 2003,2004 Martin Quinson. All rights reserved. */
7 /* This program is free software; you can redistribute it and/or modify it
8 * under the terms of the license (GNU LGPL) which comes with this package. */
10 #define DJB2_HASH_FUNCTION
11 //#define FNV_HASH_FUNCTION
17 #include "xbt/mallocator.h"
18 #include "xbt_modinter.h"
19 #include "dict_private.h"
21 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dict,xbt,
22 "Dictionaries provide the same functionnalities than hash tables");
23 /*####[ Private prototypes ]#################################################*/
25 static xbt_mallocator_t dict_mallocator = NULL;
26 static void* dict_mallocator_new_f(void);
27 static void dict_mallocator_free_f(void* dict);
28 static void dict_mallocator_reset_f(void* dict);
31 /*####[ Code ]###############################################################*/
35 * \return pointer to the destination
36 * \see xbt_dict_new_ext(), xbt_dict_free()
38 * Creates and initialize a new dictionnary with a default hashtable size.
40 xbt_dict_t xbt_dict_new(void) {
43 if (dict_mallocator == NULL) {
45 dict_mallocator = xbt_mallocator_new(256,
46 dict_mallocator_new_f,
47 dict_mallocator_free_f,
48 dict_mallocator_reset_f);
49 dict_elm_mallocator = xbt_mallocator_new(256,
50 dict_elm_mallocator_new_f,
51 dict_elm_mallocator_free_f,
52 dict_elm_mallocator_reset_f);
55 dict = xbt_mallocator_get(dict_mallocator);
56 dict->table_size = 127;
57 dict->table = xbt_new0(xbt_dictelm_t, dict->table_size+1);
66 * \param dict the dictionnary to be freed
68 * Frees a dictionary with all the data
70 void xbt_dict_free(xbt_dict_t *dict) {
72 xbt_dictelm_t current, previous;
76 // if ( *dict ) xbt_dict_dump_sizes(*dict);
78 if (dict != NULL && *dict != NULL) {
79 table_size = (*dict)->table_size;
80 table = (*dict)->table;
81 for (i = 0; (*dict)->count && i < table_size; i++) {
83 while (current != NULL) {
85 current = current->next;
86 xbt_dictelm_free(previous);
91 xbt_mallocator_release(dict_mallocator, *dict);
97 * Returns the amount of elements in the dict
99 unsigned int xbt_dict_size(xbt_dict_t dict) {
104 * Returns the hash code of a string.
106 static XBT_INLINE unsigned int xbt_dict_hash_ext(const char *str, int str_len) {
109 #ifdef DJB2_HASH_FUNCTION
110 /* fast implementation of djb2 algorithm */
112 register unsigned int hash = 5381;
116 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
118 # elif defined(FNV_HASH_FUNCTION)
119 register unsigned int hash = 0x811c9dc5;
120 unsigned char *bp = (unsigned char *)str; /* start of buffer */
121 unsigned char *be = bp + str_len; /* beyond end of buffer */
124 /* multiply by the 32 bit FNV magic prime mod 2^32 */
125 hash += (hash<<1) + (hash<<4) + (hash<<7) + (hash<<8) + (hash<<24);
127 /* xor the bottom with the current octet */
128 hash ^= (unsigned int)*bp++;
132 register unsigned int hash = 0;
135 hash += (*str) * (*str);
143 static XBT_INLINE unsigned int xbt_dict_hash(const char *str) {
144 #ifdef DJB2_HASH_FUNCTION
145 /* fast implementation of djb2 algorithm */
147 register unsigned int hash = 5381;
149 while ( (c = *str++) ) {
150 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
153 # elif defined(FNV_HASH_FUNCTION)
154 register unsigned int hash = 0x811c9dc5;
157 /* multiply by the 32 bit FNV magic prime mod 2^32 */
158 hash += (hash<<1) + (hash<<4) + (hash<<7) + (hash<<8) + (hash<<24);
160 /* xor the bottom with the current octet */
161 hash ^= (unsigned int)*str++;
165 register unsigned int hash = 0;
168 hash += (*str) * (*str);
175 /* Expend the size of the dict */
176 static void xbt_dict_rehash(xbt_dict_t dict) {
177 const int oldsize = dict->table_size + 1;
178 register int newsize = oldsize * 2;
180 register xbt_dictelm_t *currcell;
181 register xbt_dictelm_t *twincell;
182 register xbt_dictelm_t bucklet;
183 register xbt_dictelm_t *pprev;
185 currcell = (xbt_dictelm_t*) xbt_realloc((char*)dict->table, newsize * sizeof(xbt_dictelm_t));
186 memset(&currcell[oldsize], 0, oldsize * sizeof(xbt_dictelm_t)); /* zero second half */
187 dict->table_size = --newsize;
188 dict->table = currcell;
189 DEBUG2("REHASH (%d->%d)",oldsize,newsize);
191 for (i=0; i<oldsize; i++,currcell++) {
192 if (!*currcell) /* empty cell */
194 twincell = currcell+oldsize;
195 for (pprev = currcell, bucklet = *currcell;
198 /* Since we use "& size" instead of "%size" and since the size was doubled,
199 each bucklet of this cell must either :
200 - stay in cell i (ie, currcell)
201 - go to the cell i+oldsize (ie, twincell) */
202 if ((bucklet->hash_code & newsize) != i) { /* Move to b */
203 *pprev = bucklet->next;
204 bucklet->next = *twincell;
210 pprev = &bucklet->next;
215 if (!*currcell) /* everything moved */
221 * \brief Add data to the dict (arbitrary key)
222 * \param dict the container
223 * \param key the key to set the new data
224 * \param key_len the size of the \a key
225 * \param data the data to add in the dict
226 * \param free_ctn function to call with (\a key as argument) when
227 * \a key is removed from the dictionnary
229 * Set the \a data in the structure under the \a key, which can be any kind
230 * of data, as long as its length is provided in \a key_len.
232 XBT_INLINE void xbt_dict_set_ext(xbt_dict_t dict,
233 const char *key, int key_len,
234 void *data, void_f_pvoid_t free_ctn) {
236 unsigned int hash_code = xbt_dict_hash_ext(key,key_len);
238 xbt_dictelm_t current, previous = NULL;
241 DEBUG5("ADD %.*s hash = %d, size = %d, & = %d",key_len,key,hash_code, dict->table_size, hash_code & dict->table_size);
242 current = dict->table[hash_code & dict->table_size];
243 while (current != NULL &&
244 (hash_code != current->hash_code || key_len != current->key_len || memcmp(key, current->key, key_len))) {
246 current = current->next;
249 if (current == NULL) {
250 /* this key doesn't exist yet */
251 current = xbt_dictelm_new(key, key_len, hash_code, data, free_ctn);
253 if (previous == NULL) {
254 dict->table[hash_code & dict->table_size] = current;
256 if ((dict->fill * 100) / (dict->table_size + 1) > MAX_FILL_PERCENT)
257 xbt_dict_rehash(dict);
259 previous->next = current;
264 DEBUG6("Replace %.*s by %.*s under key %.*s",
265 key_len,(char*)current->content,
268 /* there is already an element with the same key: overwrite it */
269 if (current->content != NULL && current->free_f != NULL) {
270 current->free_f(current->content);
272 current->content = data;
273 current->free_f = free_ctn;
278 * \brief Add data to the dict (null-terminated key)
280 * \param dict the dict
281 * \param key the key to set the new data
282 * \param data the data to add in the dict
283 * \param free_ctn function to call with (\a key as argument) when
284 * \a key is removed from the dictionnary
286 * set the \a data in the structure under the \a key, which is a
287 * null terminated string.
289 void xbt_dict_set(xbt_dict_t dict,
292 void_f_pvoid_t free_ctn) {
294 xbt_dict_set_ext(dict, key, strlen(key), data, free_ctn);
298 * \brief Retrieve data from the dict (arbitrary key)
300 * \param dict the dealer of data
301 * \param key the key to find data
302 * \param key_len the size of the \a key
303 * \return the data that we are looking for
305 * Search the given \a key. Throws not_found_error when not found.
307 void *xbt_dict_get_ext(xbt_dict_t dict,
308 const char *key, int key_len) {
311 unsigned int hash_code = xbt_dict_hash_ext(key,key_len);
312 xbt_dictelm_t current;
316 current = dict->table[hash_code & dict->table_size];
317 while (current != NULL &&
318 (hash_code != current->hash_code || key_len != current->key_len || memcmp(key, current->key, key_len))) {
319 current = current->next;
323 THROW2(not_found_error, 0, "key %.*s not found", key_len, key);
325 return current->content;
329 * \brief Retrieve data from the dict (null-terminated key)
331 * \param dict the dealer of data
332 * \param key the key to find data
333 * \return the data that we are looking for
335 * Search the given \a key. Throws not_found_error when not found.
336 * Check xbt_dict_get_or_null() for a version returning NULL without exception when
339 void *xbt_dict_get(xbt_dict_t dict,
342 unsigned int hash_code = xbt_dict_hash(key);
343 xbt_dictelm_t current;
347 current = dict->table[hash_code & dict->table_size];
348 while (current != NULL && (hash_code != current->hash_code || strcmp(key, current->key)))
349 current = current->next;
352 THROW1(not_found_error, 0, "key %s not found", key);
354 return current->content;
358 * \brief like xbt_dict_get(), but returning NULL when not found
360 void *xbt_dict_get_or_null(xbt_dict_t dict,
362 unsigned int hash_code = xbt_dict_hash(key);
363 xbt_dictelm_t current;
367 current = dict->table[hash_code & dict->table_size];
368 while (current != NULL &&
369 hash_code != current->hash_code && strcmp(key, current->key))
370 current = current->next;
375 return current->content;
380 * \brief Remove data from the dict (arbitrary key)
382 * \param dict the trash can
383 * \param key the key of the data to be removed
384 * \param key_len the size of the \a key
386 * Remove the entry associated with the given \a key (throws not_found)
388 void xbt_dict_remove_ext(xbt_dict_t dict,
393 unsigned int hash_code = xbt_dict_hash_ext(key,key_len);
394 xbt_dictelm_t current, previous = NULL;
398 // fprintf(stderr,"RM %.*s hash = %d, size = %d, & = %d\n",key_len,key,hash_code, dict->table_size, hash_code & dict->table_size);
399 current = dict->table[hash_code & dict->table_size];
400 while (current != NULL &&
401 (hash_code != current->hash_code || key_len != current->key_len || strncmp(key, current->key, key_len))) {
402 previous = current; /* save the previous node */
403 current = current->next;
407 THROW2(not_found_error, 0, "key %.*s not found", key_len, key);
409 if (previous != NULL) {
410 previous->next = current->next;
412 dict->table[hash_code & dict->table_size] = current->next;
415 if (!dict->table[hash_code & dict->table_size])
418 xbt_dictelm_free(current);
423 * \brief Remove data from the dict (null-terminated key)
425 * \param dict the dict
426 * \param key the key of the data to be removed
428 * Remove the entry associated with the given \a key
430 void xbt_dict_remove(xbt_dict_t dict, const char *key) {
431 xbt_dict_remove_ext(dict, key, strlen(key));
435 * \brief Remove all data from the dict
436 * \param dict the dict
438 void xbt_dict_reset(xbt_dict_t dict) {
441 xbt_dictelm_t current, previous = NULL;
445 if (dict->count == 0)
448 for (i = 0; i <= dict->table_size; i++) {
449 current = dict->table[i];
450 while (current != NULL) {
452 current = current->next;
453 xbt_dictelm_free(previous);
455 dict->table[i] = NULL;
463 * \brief Return the number of elements in the dict.
464 * \param dict a dictionary
466 int xbt_dict_length(xbt_dict_t dict) {
473 * \brief Outputs the content of the structure (debuging purpose)
475 * \param dict the exibitionist
476 * \param output a function to dump each data in the tree
478 * Ouputs the content of the structure. (for debuging purpose). \a ouput is a
479 * function to output the data. If NULL, data won't be displayed.
482 void xbt_dict_dump(xbt_dict_t dict,
483 void_f_pvoid_t output) {
485 xbt_dictelm_t element;
486 printf("Dict %p:\n", dict);
488 for (i = 0; i < dict->table_size; i++) {
489 element = dict->table[i];
492 while (element != NULL) {
493 printf(" %s -> ", element->key);
494 if (output != NULL) {
495 (*output)(element->content);
498 element = element->next;
508 xbt_dynar_t all_sizes = NULL;
509 /** @brief shows some debugging info about the bucklet repartition */
510 void xbt_dict_dump_sizes(xbt_dict_t dict) {
515 xbt_dictelm_t element;
516 xbt_dynar_t sizes = xbt_dynar_new(sizeof(int),NULL);
518 printf("Dict %p: %d bucklets, %d used cells (of %d) ", dict, dict->count, dict->fill,dict->table_size);
520 for (i = 0; i < dict->table_size; i++) {
521 element = dict->table[i];
524 while (element != NULL) {
526 element = element->next;
529 if (xbt_dynar_length(sizes) <= size) {
531 xbt_dynar_set(sizes,size,&prevsize);
534 xbt_dynar_get_cpy(sizes,size,&prevsize);
536 xbt_dynar_set(sizes,size,&prevsize);
540 all_sizes = xbt_dynar_new(sizeof(int), NULL);
542 xbt_dynar_foreach(sizes,count,size) {
543 /* Copy values of this one into all_sizes */
545 if (xbt_dynar_length(all_sizes) <= count) {
547 xbt_dynar_set(all_sizes,count,&prevcount);
549 xbt_dynar_get_cpy(all_sizes,count,&prevcount);
551 xbt_dynar_set(all_sizes,count,&prevcount);
554 /* Report current sizes */
559 printf("%delm x %u cells; ",count,size);
563 xbt_dynar_free(&sizes);
567 * Destroy the dict mallocators.
568 * This is an internal XBT function called by xbt_exit().
570 void xbt_dict_exit(void) {
571 if (dict_mallocator != NULL) {
572 xbt_mallocator_free(dict_mallocator);
573 dict_mallocator = NULL;
574 xbt_mallocator_free(dict_elm_mallocator);
575 dict_elm_mallocator = NULL;
582 printf("Overall stats:");
583 xbt_dynar_foreach(all_sizes,count,size) {
588 printf("%delm x %d cells; ",count,size);
592 printf("; %f elm per cell\n",avg/(double)total_count);
596 static void* dict_mallocator_new_f(void) {
597 return xbt_new(s_xbt_dict_t, 1);
600 static void dict_mallocator_free_f(void* dict) {
604 static void dict_mallocator_reset_f(void* dict) {
605 /* nothing to do because all fields are
606 * initialized in xbt_dict_new
613 #include "portable.h"
615 XBT_LOG_EXTERNAL_CATEGORY(xbt_dict);
616 XBT_LOG_DEFAULT_CATEGORY(xbt_dict);
618 XBT_TEST_SUITE("dict","Dict data container");
620 static void print_str(void *str) {
621 printf("%s",(char*)PRINTF_STR(str));
624 static void debuged_add_ext(xbt_dict_t head,const char*key,const char*data_to_fill) {
625 char *data=xbt_strdup(data_to_fill);
627 xbt_test_log2("Add %s under %s",PRINTF_STR(data_to_fill),PRINTF_STR(key));
629 xbt_dict_set(head,key,data,&free);
630 if (XBT_LOG_ISENABLED(xbt_dict,xbt_log_priority_debug)) {
631 xbt_dict_dump(head,(void (*)(void*))&printf);
635 static void debuged_add(xbt_dict_t head,const char*key) {
636 debuged_add_ext(head,key,key);
639 static void fill(xbt_dict_t *head) {
640 xbt_test_add0("Fill in the dictionnary");
642 *head = xbt_dict_new();
643 debuged_add(*head,"12");
644 debuged_add(*head,"12a");
645 debuged_add(*head,"12b");
646 debuged_add(*head,"123");
647 debuged_add(*head,"123456");
648 /* Child becomes child of what to add */
649 debuged_add(*head,"1234");
650 /* Need of common ancestor */
651 debuged_add(*head,"123457");
655 static void search_ext(xbt_dict_t head,const char*key, const char *data) {
658 xbt_test_add1("Search %s",key);
659 found=xbt_dict_get(head,key);
660 xbt_test_log1("Found %s",(char *)found);
662 xbt_test_assert1(found,"data do not match expectations: found NULL while searching for %s",data);
664 xbt_test_assert2(!strcmp((char*)data,found),"data do not match expectations: found %s while searching for %s", (char*)found, data);
667 static void search(xbt_dict_t head,const char*key) {
668 search_ext(head,key,key);
671 static void debuged_remove(xbt_dict_t head,const char*key) {
673 xbt_test_add1("Remove '%s'",PRINTF_STR(key));
674 xbt_dict_remove(head,key);
675 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
679 static void traverse(xbt_dict_t head) {
680 xbt_dict_cursor_t cursor=NULL;
685 xbt_dict_foreach(head,cursor,key,data) {
686 if (!key || !data || strcmp(key,data)) {
687 xbt_test_log3("Seen #%d: %s->%s",++i,PRINTF_STR(key),PRINTF_STR(data));
689 xbt_test_log2("Seen #%d: %s",++i,PRINTF_STR(key));
691 xbt_test_assert2(!data || !strcmp(key,data),
692 "Key(%s) != value(%s). Abording",key,data);
696 static void search_not_found(xbt_dict_t head, const char *data) {
700 xbt_test_add1("Search %s (expected not to be found)",data);
703 data = xbt_dict_get(head, data);
704 THROW1(unknown_error,0,"Found something which shouldn't be there (%s)",data);
706 if (e.category != not_found_error)
707 xbt_test_exception(e);
711 xbt_test_assert0(ok,"Exception not raised");
714 static void count(xbt_dict_t dict, int length) {
715 xbt_dict_cursor_t cursor;
721 xbt_test_add1("Count elements (expecting %d)", length);
722 xbt_test_assert2(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
724 xbt_dict_foreach(dict,cursor,key,data) {
727 xbt_test_assert2(effective == length, "Effective length(%d) != %d.", effective, length);
731 xbt_dict_t head=NULL;
735 XBT_TEST_UNIT("basic",test_dict_basic,"Basic usage: change, retrieve, traverse"){
736 xbt_test_add0("Traversal the null dictionnary");
739 xbt_test_add0("Traversal and search the empty dictionnary");
740 head = xbt_dict_new();
743 debuged_remove(head,"12346");
745 if (e.category != not_found_error)
746 xbt_test_exception(e);
749 xbt_dict_free(&head);
751 xbt_test_add0("Traverse the full dictionnary");
755 debuged_add_ext(head,"toto","tutu");
756 search_ext(head,"toto","tutu");
757 debuged_remove(head,"toto");
762 xbt_test_add0("Free the dictionnary (twice)");
763 xbt_dict_free(&head);
764 xbt_dict_free(&head);
769 xbt_test_add0("Change 123 to 'Changed 123'");
770 xbt_dict_set(head,"123",strdup("Changed 123"),&free);
773 xbt_test_add0("Change 123 back to '123'");
774 xbt_dict_set(head,"123",strdup("123"),&free);
777 xbt_test_add0("Change 12a to 'Dummy 12a'");
778 xbt_dict_set(head,"12a",strdup("Dummy 12a"),&free);
781 xbt_test_add0("Change 12a to '12a'");
782 xbt_dict_set(head,"12a",strdup("12a"),&free);
785 xbt_test_add0("Traverse the resulting dictionnary");
789 xbt_test_add0("Search 123");
790 data = xbt_dict_get(head,"123");
791 xbt_test_assert(data);
792 xbt_test_assert(!strcmp("123",data));
794 search_not_found(head,"Can't be found");
795 search_not_found(head,"123 Can't be found");
796 search_not_found(head,"12345678 NOT");
801 search(head,"123456");
803 search(head,"123457");
805 xbt_test_add0("Traverse the resulting dictionnary");
808 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
810 xbt_test_add0("Free the dictionnary twice");
811 xbt_dict_free(&head);
812 xbt_dict_free(&head);
814 xbt_test_add0("Traverse the resulting dictionnary");
818 XBT_TEST_UNIT("remove",test_dict_remove,"Removing some values"){
821 xbt_test_add0("Remove non existing data");
823 debuged_remove(head,"Does not exist");
825 if (e.category != not_found_error)
826 xbt_test_exception(e);
831 xbt_dict_free(&head);
833 xbt_test_add0("Remove each data manually (traversing the resulting dictionnary each time)");
835 debuged_remove(head,"12a"); traverse(head);
837 debuged_remove(head,"12b"); traverse(head);
839 debuged_remove(head,"12"); traverse(head);
841 debuged_remove(head,"123456"); traverse(head);
844 debuged_remove(head,"12346");
846 if (e.category != not_found_error)
847 xbt_test_exception(e);
851 debuged_remove(head,"1234"); traverse(head);
852 debuged_remove(head,"123457"); traverse(head);
853 debuged_remove(head,"123"); traverse(head);
855 debuged_remove(head,"12346");
857 if (e.category != not_found_error)
858 xbt_test_exception(e);
862 xbt_test_add0("Free dict, create new fresh one, and then reset the dict");
863 xbt_dict_free(&head);
865 xbt_dict_reset(head);
869 xbt_test_add0("Free the dictionnary twice");
870 xbt_dict_free(&head);
871 xbt_dict_free(&head);
874 XBT_TEST_UNIT("nulldata",test_dict_nulldata,"NULL data management"){
877 xbt_test_add0("Store NULL under 'null'");
878 xbt_dict_set(head,"null",NULL,NULL);
879 search_ext(head,"null",NULL);
881 xbt_test_add0("Check whether I see it while traversing...");
883 xbt_dict_cursor_t cursor=NULL;
887 xbt_dict_foreach(head,cursor,key,data) {
888 if (!key || !data || strcmp(key,data)) {
889 xbt_test_log2("Seen: %s->%s",PRINTF_STR(key),PRINTF_STR(data));
891 xbt_test_log1("Seen: %s",PRINTF_STR(key));
894 if (!strcmp(key,"null"))
897 xbt_test_assert0(found,"the key 'null', associated to NULL is not found");
899 xbt_dict_free(&head);
903 #define SIZEOFKEY 1024
904 static int countelems(xbt_dict_t head) {
905 xbt_dict_cursor_t cursor;
910 xbt_dict_foreach(head,cursor,key,data) {
916 XBT_TEST_UNIT("crash",test_dict_crash,"Crash test"){
917 xbt_dict_t head=NULL;
922 srand((unsigned int)time(NULL));
925 xbt_test_add2("CRASH test number %d (%d to go)",i+1,10-i-1);
926 xbt_test_log0("Fill the struct, count its elems and frees the structure");
927 xbt_test_log1("using 1000 elements with %d chars long randomized keys.",SIZEOFKEY);
929 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
931 for (j=0;j<1000;j++) {
933 key=xbt_malloc(SIZEOFKEY);
936 for (k=0;k<SIZEOFKEY-1;k++)
937 key[k]=rand() % ('z' - 'a') + 'a';
939 /* printf("[%d %s]\n",j,key); */
940 data = xbt_dict_get_or_null(head,key);
941 } while (data != NULL);
943 xbt_dict_set(head,key,key,&free);
944 data = xbt_dict_get(head,key);
945 xbt_test_assert2(!strcmp(key,data), "Retrieved value (%s) != Injected value (%s)",key,data);
949 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
951 xbt_dict_free(&head);
952 xbt_dict_free(&head);
957 xbt_test_add1("Fill %d elements, with keys being the number of element",NB_ELM);
958 for (j=0;j<NB_ELM;j++) {
959 /* if (!(j%1000)) { printf("."); fflush(stdout); } */
961 key = xbt_malloc(10);
964 xbt_dict_set(head,key,key,&free);
966 /*xbt_dict_dump(head,(void (*)(void*))&printf);*/
968 xbt_test_add0("Count the elements (retrieving the key and data for each)");
969 i = countelems(head);
970 xbt_test_log1("There is %d elements",i);
972 xbt_test_add1("Search my %d elements 20 times",NB_ELM);
975 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
976 for (j=0;j<NB_ELM;j++) {
979 data = xbt_dict_get(head,key);
980 xbt_test_assert2(!strcmp(key,(char*)data),
981 "with get, key=%s != data=%s",key,(char*)data);
982 data = xbt_dict_get_ext(head,key,strlen(key));
983 xbt_test_assert2(!strcmp(key,(char*)data),
984 "with get_ext, key=%s != data=%s",key,(char*)data);
989 xbt_test_add1("Remove my %d elements",NB_ELM);
991 for (j=0;j<NB_ELM;j++) {
992 /* if (!(j%10000)) printf("."); fflush(stdout); */
995 xbt_dict_remove(head,key);
1000 xbt_test_add0("Free the structure (twice)");
1001 xbt_dict_free(&head);
1002 xbt_dict_free(&head);
1005 static void str_free(void *s) {
1010 XBT_TEST_UNIT("multicrash",test_dict_multicrash,"Multi-dict crash test"){
1013 #define NB_ELM 100 /*00*/
1015 #define KEY_SIZE 512
1016 #define NB_TEST 20 /*20*/
1019 xbt_dict_t mdict = NULL;
1021 xbt_dynar_t keys = xbt_dynar_new(sizeof(char*),str_free);
1026 xbt_test_add0("Generic multicache CRASH test");
1027 xbt_test_log4(" Fill the struct and frees it %d times, using %d elements, "
1028 "depth of multicache=%d, key size=%d",
1029 NB_TEST,NB_ELM,DEPTH,KEY_SIZE);
1031 for (l=0 ; l<DEPTH ; l++) {
1032 key=xbt_malloc(KEY_SIZE);
1033 xbt_dynar_push(keys,&key);
1036 for (i=0;i<NB_TEST;i++) {
1037 mdict = xbt_dict_new();
1038 VERB1("mdict=%p",mdict);
1040 printf("Test %d\n",i);
1041 /* else if (i%10) printf("."); else printf("%d",i/10);*/
1043 for (j=0;j<NB_ELM;j++) {
1044 if (verbose>0) printf (" Add {");
1046 for (l=0 ; l<DEPTH ; l++) {
1047 key=*(char**)xbt_dynar_get_ptr(keys,l);
1049 for (k=0;k<KEY_SIZE-1;k++)
1050 key[k]=rand() % ('z' - 'a') + 'a';
1054 if (verbose>0) printf("%p=%s %s ",key, key,(l<DEPTH-1?";":"}"));
1056 if (verbose>0) printf("in multitree %p.\n",mdict);
1058 xbt_multidict_set(mdict,keys,xbt_strdup(key),free);
1060 data = xbt_multidict_get(mdict,keys);
1062 xbt_test_assert2(data && !strcmp((char*)data,key),
1063 "Retrieved value (%s) does not match the entrered one (%s)\n",
1066 xbt_dict_free(&mdict);
1069 xbt_dynar_free(&keys);
1072 xbt_dict_dump(mdict,&xbt_dict_print);*/
1074 xbt_dict_free(&mdict);
1075 xbt_dynar_free(&keys);
1078 #endif /* SIMGRID_TEST */