1 /* dict - a generic dictionary, variation over hash table */
3 /* Copyright (c) 2004-2011. The SimGrid Team.
4 * All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
9 #define DJB2_HASH_FUNCTION
10 //#define FNV_HASH_FUNCTION
16 #include "xbt/mallocator.h"
17 #include "xbt_modinter.h"
18 #include "dict_private.h"
20 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dict, xbt,
21 "Dictionaries provide the same functionalities than hash tables");
25 * \return pointer to the destination
26 * \see xbt_dict_free()
28 * Creates and initialize a new dictionary with a default hashtable size.
29 * The dictionary is heterogeneous: each element can have a different free
32 xbt_dict_t xbt_dict_new(void)
34 xbt_dict_t dict = xbt_dict_new_homogeneous(NULL);
35 dict->homogeneous = 0;
42 * \param free_ctn function to call with (\a data as argument) when
43 * \a data is removed from the dictionary
44 * \return pointer to the destination
45 * \see xbt_dict_new(), xbt_dict_free()
47 * Creates and initialize a new dictionary with a default hashtable size.
48 * The dictionary is homogeneous: each element share the same free function.
50 xbt_dict_t xbt_dict_new_homogeneous(void_f_pvoid_t free_ctn)
54 dict = xbt_new(s_xbt_dict_t, 1);
55 dict->free_f = free_ctn;
56 dict->table_size = 127;
57 dict->table = xbt_new0(xbt_dictelm_t, dict->table_size + 1);
60 dict->homogeneous = 1;
67 * \param dict the dictionary to be freed
69 * Frees a dictionary with all the data
71 void xbt_dict_free(xbt_dict_t * dict)
74 xbt_dictelm_t current, previous;
78 // if ( *dict ) xbt_dict_dump_sizes(*dict);
80 if (dict != NULL && *dict != NULL) {
81 table_size = (*dict)->table_size;
82 table = (*dict)->table;
83 /* Warning: the size of the table is 'table_size+1'...
84 * This is because table_size is used as a binary mask in xbt_dict_rehash */
85 for (i = 0; (*dict)->count && i <= table_size; i++) {
87 while (current != NULL) {
89 current = current->next;
90 xbt_dictelm_free(*dict, previous);
101 * Returns the amount of elements in the dict
103 XBT_INLINE unsigned int xbt_dict_size(xbt_dict_t dict)
105 return (dict ? (unsigned int) dict->count : (unsigned int) 0);
109 * Returns the hash code of a string.
111 static XBT_INLINE unsigned int xbt_dict_hash_ext(const char *str,
116 #ifdef DJB2_HASH_FUNCTION
117 /* fast implementation of djb2 algorithm */
119 register unsigned int hash = 5381;
123 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
125 # elif defined(FNV_HASH_FUNCTION)
126 register unsigned int hash = 0x811c9dc5;
127 unsigned char *bp = (unsigned char *) str; /* start of buffer */
128 unsigned char *be = bp + str_len; /* beyond end of buffer */
131 /* multiply by the 32 bit FNV magic prime mod 2^32 */
133 (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) +
136 /* xor the bottom with the current octet */
137 hash ^= (unsigned int) *bp++;
141 register unsigned int hash = 0;
144 hash += (*str) * (*str);
152 static XBT_INLINE unsigned int xbt_dict_hash(const char *str)
154 #ifdef DJB2_HASH_FUNCTION
155 /* fast implementation of djb2 algorithm */
157 register unsigned int hash = 5381;
159 while ((c = *str++)) {
160 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
163 # elif defined(FNV_HASH_FUNCTION)
164 register unsigned int hash = 0x811c9dc5;
167 /* multiply by the 32 bit FNV magic prime mod 2^32 */
169 (hash << 1) + (hash << 4) + (hash << 7) + (hash << 8) +
172 /* xor the bottom with the current byte */
173 hash ^= (unsigned int) *str++;
177 register unsigned int hash = 0;
180 hash += (*str) * (*str);
187 /* Expend the size of the dict */
188 static void xbt_dict_rehash(xbt_dict_t dict)
190 const int oldsize = dict->table_size + 1;
191 register int newsize = oldsize * 2;
193 register xbt_dictelm_t *currcell;
194 register xbt_dictelm_t *twincell;
195 register xbt_dictelm_t bucklet;
196 register xbt_dictelm_t *pprev;
199 (xbt_dictelm_t *) xbt_realloc((char *) dict->table,
200 newsize * sizeof(xbt_dictelm_t));
201 memset(&currcell[oldsize], 0, oldsize * sizeof(xbt_dictelm_t)); /* zero second half */
202 dict->table_size = --newsize;
203 dict->table = currcell;
204 XBT_DEBUG("REHASH (%d->%d)", oldsize, newsize);
206 for (i = 0; i < oldsize; i++, currcell++) {
207 if (!*currcell) /* empty cell */
209 twincell = currcell + oldsize;
210 for (pprev = currcell, bucklet = *currcell; bucklet; bucklet = *pprev) {
211 /* Since we use "& size" instead of "%size" and since the size was doubled,
212 each bucklet of this cell must either :
213 - stay in cell i (ie, currcell)
214 - go to the cell i+oldsize (ie, twincell) */
215 if ((bucklet->hash_code & newsize) != i) { /* Move to b */
216 *pprev = bucklet->next;
217 bucklet->next = *twincell;
223 pprev = &bucklet->next;
228 if (!*currcell) /* everything moved */
234 * \brief Add data to the dict (arbitrary key)
235 * \param dict the container
236 * \param key the key to set the new data
237 * \param key_len the size of the \a key
238 * \param data the data to add in the dict
239 * \param free_ctn function to call with (\a data as argument) when
240 * \a data is removed from the dictionary
242 * Set the \a data in the structure under the \a key, which can be any kind
243 * of data, as long as its length is provided in \a key_len.
245 XBT_INLINE void xbt_dict_set_ext(xbt_dict_t dict,
246 const char *key, int key_len,
247 void *data, void_f_pvoid_t free_ctn)
250 unsigned int hash_code = xbt_dict_hash_ext(key, key_len);
252 xbt_dictelm_t current, previous = NULL;
255 XBT_DEBUG("ADD %.*s hash = %d, size = %d, & = %d", key_len, key, hash_code,
256 dict->table_size, hash_code & dict->table_size);
257 current = dict->table[hash_code & dict->table_size];
258 while (current != NULL &&
259 (hash_code != current->hash_code || key_len != current->key_len
260 || memcmp(key, current->key, key_len))) {
262 current = current->next;
265 if (current == NULL) {
266 /* this key doesn't exist yet */
267 current = xbt_dictelm_new(dict, key, key_len, hash_code, data, free_ctn);
269 if (previous == NULL) {
270 dict->table[hash_code & dict->table_size] = current;
272 if ((dict->fill * 100) / (dict->table_size + 1) > MAX_FILL_PERCENT)
273 xbt_dict_rehash(dict);
275 previous->next = current;
278 XBT_DEBUG("Replace %.*s by %.*s under key %.*s",
279 key_len, (char *) current->content,
280 key_len, (char *) data, key_len, (char *) key);
281 /* there is already an element with the same key: overwrite it */
282 xbt_dictelm_set_data(dict, current, data, free_ctn);
287 * \brief Add data to the dict (null-terminated key)
289 * \param dict the dict
290 * \param key the key to set the new data
291 * \param data the data to add in the dict
292 * \param free_ctn function to call with (\a data as argument) when
293 * \a data is removed from the dictionary
295 * set the \a data in the structure under the \a key, which is a
296 * null terminated string.
298 XBT_INLINE void xbt_dict_set(xbt_dict_t dict,
299 const char *key, void *data,
300 void_f_pvoid_t free_ctn)
303 xbt_dict_set_ext(dict, key, strlen(key), data, free_ctn);
307 * \brief Retrieve data from the dict (arbitrary key)
309 * \param dict the dealer of data
310 * \param key the key to find data
311 * \param key_len the size of the \a key
312 * \return the data that we are looking for
314 * Search the given \a key. Throws not_found_error when not found.
316 XBT_INLINE void *xbt_dict_get_ext(xbt_dict_t dict, const char *key,
321 unsigned int hash_code = xbt_dict_hash_ext(key, key_len);
322 xbt_dictelm_t current;
326 current = dict->table[hash_code & dict->table_size];
327 while (current != NULL &&
328 (hash_code != current->hash_code || key_len != current->key_len
329 || memcmp(key, current->key, key_len))) {
330 current = current->next;
334 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
336 return current->content;
340 * \brief like xbt_dict_get_ext(), but returning NULL when not found
342 void *xbt_dict_get_or_null_ext(xbt_dict_t dict, const char *key,
346 unsigned int hash_code = xbt_dict_hash_ext(key, key_len);
347 xbt_dictelm_t current;
351 current = dict->table[hash_code & dict->table_size];
352 while (current != NULL &&
353 (hash_code != current->hash_code || key_len != current->key_len
354 || memcmp(key, current->key, key_len))) {
355 current = current->next;
361 return current->content;
365 * @brief retrieve the key associated to that object. Warning, that's a linear search
367 * Returns NULL if the object cannot be found
369 char *xbt_dict_get_key(xbt_dict_t dict, const void *data)
372 xbt_dictelm_t current;
375 for (i = 0; i <= dict->table_size; i++) {
376 current = dict->table[i];
377 while (current != NULL) {
378 if (current->content == data)
380 current = current->next;
388 * \brief Retrieve data from the dict (null-terminated key)
390 * \param dict the dealer of data
391 * \param key the key to find data
392 * \return the data that we are looking for
394 * Search the given \a key. Throws not_found_error when not found.
395 * Check xbt_dict_get_or_null() for a version returning NULL without exception when
398 XBT_INLINE void *xbt_dict_get(xbt_dict_t dict, const char *key)
401 unsigned int hash_code = xbt_dict_hash(key);
402 xbt_dictelm_t current;
406 current = dict->table[hash_code & dict->table_size];
407 while (current != NULL
408 && (hash_code != current->hash_code || strcmp(key, current->key)))
409 current = current->next;
412 THROWF(not_found_error, 0, "key %s not found", key);
414 return current->content;
418 * \brief like xbt_dict_get(), but returning NULL when not found
420 XBT_INLINE void *xbt_dict_get_or_null(xbt_dict_t dict, const char *key)
422 unsigned int hash_code = xbt_dict_hash(key);
423 xbt_dictelm_t current;
427 current = dict->table[hash_code & dict->table_size];
428 while (current != NULL &&
429 (hash_code != current->hash_code || strcmp(key, current->key)))
430 current = current->next;
435 return current->content;
440 * \brief Remove data from the dict (arbitrary key)
442 * \param dict the trash can
443 * \param key the key of the data to be removed
444 * \param key_len the size of the \a key
446 * Remove the entry associated with the given \a key (throws not_found)
448 XBT_INLINE void xbt_dict_remove_ext(xbt_dict_t dict, const char *key,
453 unsigned int hash_code = xbt_dict_hash_ext(key, key_len);
454 xbt_dictelm_t current, previous = NULL;
458 // fprintf(stderr,"RM %.*s hash = %d, size = %d, & = %d\n",key_len,key,hash_code, dict->table_size, hash_code & dict->table_size);
459 current = dict->table[hash_code & dict->table_size];
460 while (current != NULL &&
461 (hash_code != current->hash_code || key_len != current->key_len
462 || strncmp(key, current->key, key_len))) {
463 previous = current; /* save the previous node */
464 current = current->next;
468 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
470 if (previous != NULL) {
471 previous->next = current->next;
473 dict->table[hash_code & dict->table_size] = current->next;
476 if (!dict->table[hash_code & dict->table_size])
479 xbt_dictelm_free(dict, current);
486 * \brief Remove data from the dict (null-terminated key)
488 * \param dict the dict
489 * \param key the key of the data to be removed
491 * Remove the entry associated with the given \a key
493 XBT_INLINE void xbt_dict_remove(xbt_dict_t dict, const char *key)
495 xbt_dict_remove_ext(dict, key, strlen(key));
499 * \brief Add data to the dict (arbitrary key)
500 * \param dict the container
501 * \param key the key to set the new data
502 * \param data the data to add in the dict
504 * Set the \a data in the structure under the \a key.
505 * Both \a data and \a key are considered as uintptr_t.
507 XBT_INLINE void xbt_dicti_set(xbt_dict_t dict,
508 uintptr_t key, uintptr_t data)
510 xbt_dict_set_ext(dict, (void *)&key, sizeof key, (void*)data, NULL);
514 * \brief Retrieve data from the dict (key considered as a uintptr_t)
516 * \param dict the dealer of data
517 * \param key the key to find data
518 * \return the data that we are looking for (or 0 if not found)
520 * Mixing uintptr_t keys with regular keys in the same dict is discouraged
522 XBT_INLINE uintptr_t xbt_dicti_get(xbt_dict_t dict, uintptr_t key)
524 return (uintptr_t)xbt_dict_get_or_null_ext(dict, (void *)&key, sizeof key);
527 /** Remove a uintptr_t key from the dict */
528 XBT_INLINE void xbt_dicti_remove(xbt_dict_t dict, uintptr_t key)
530 xbt_dict_remove_ext(dict, (void *)&key, sizeof key);
535 * \brief Remove all data from the dict
536 * \param dict the dict
538 void xbt_dict_reset(xbt_dict_t dict)
542 xbt_dictelm_t current, previous = NULL;
546 if (dict->count == 0)
549 for (i = 0; i <= dict->table_size; i++) {
550 current = dict->table[i];
551 while (current != NULL) {
553 current = current->next;
554 xbt_dictelm_free(dict, previous);
556 dict->table[i] = NULL;
564 * \brief Return the number of elements in the dict.
565 * \param dict a dictionary
567 XBT_INLINE int xbt_dict_length(xbt_dict_t dict)
574 /** @brief function to be used in xbt_dict_dump as long as the stored values are strings */
575 void xbt_dict_dump_output_string(void *s)
581 * \brief test if the dict is empty or not
583 XBT_INLINE int xbt_dict_is_empty(xbt_dict_t dict)
585 return !dict || (xbt_dict_length(dict) == 0);
589 * \brief Outputs the content of the structure (debugging purpose)
591 * \param dict the exibitionist
592 * \param output a function to dump each data in the tree (check @ref xbt_dict_dump_output_string)
594 * Outputs the content of the structure. (for debugging purpose). \a output is a
595 * function to output the data. If NULL, data won't be displayed.
598 void xbt_dict_dump(xbt_dict_t dict, void_f_pvoid_t output)
601 xbt_dictelm_t element;
602 printf("Dict %p:\n", dict);
604 for (i = 0; i < dict->table_size; i++) {
605 element = dict->table[i];
608 while (element != NULL) {
609 printf(" %s -> '", element->key);
610 if (output != NULL) {
611 output(element->content);
614 element = element->next;
624 xbt_dynar_t all_sizes = NULL;
625 /** @brief shows some debugging info about the bucklet repartition */
626 void xbt_dict_dump_sizes(xbt_dict_t dict)
632 xbt_dictelm_t element;
633 xbt_dynar_t sizes = xbt_dynar_new(sizeof(int), NULL);
635 printf("Dict %p: %d bucklets, %d used cells (of %d) ", dict, dict->count,
636 dict->fill, dict->table_size);
638 for (i = 0; i < dict->table_size; i++) {
639 element = dict->table[i];
642 while (element != NULL) {
644 element = element->next;
647 if (xbt_dynar_length(sizes) <= size) {
649 xbt_dynar_set(sizes, size, &prevsize);
652 xbt_dynar_get_cpy(sizes, size, &prevsize);
654 xbt_dynar_set(sizes, size, &prevsize);
658 all_sizes = xbt_dynar_new(sizeof(int), NULL);
660 xbt_dynar_foreach(sizes, count, size) {
661 /* Copy values of this one into all_sizes */
663 if (xbt_dynar_length(all_sizes) <= count) {
665 xbt_dynar_set(all_sizes, count, &prevcount);
667 xbt_dynar_get_cpy(all_sizes, count, &prevcount);
669 xbt_dynar_set(all_sizes, count, &prevcount);
672 /* Report current sizes */
677 printf("%delm x %u cells; ", count, size);
681 xbt_dynar_free(&sizes);
685 * Create the dict mallocators.
686 * This is an internal XBT function called during the lib initialization.
687 * It can be used several times to recreate the mallocator, for example when you switch to MC mode
689 void xbt_dict_preinit(void)
691 if (dict_elm_mallocator != NULL) {
692 /* Already created. I guess we want to switch to MC mode, so kill the previously created mallocator */
693 xbt_mallocator_free(dict_elm_mallocator);
694 xbt_mallocator_free(dict_het_elm_mallocator);
697 dict_elm_mallocator = xbt_mallocator_new(256,
698 dict_elm_mallocator_new_f,
699 dict_elm_mallocator_free_f,
700 dict_elm_mallocator_reset_f);
701 dict_het_elm_mallocator = xbt_mallocator_new(256,
702 dict_het_elm_mallocator_new_f,
703 dict_het_elm_mallocator_free_f,
704 dict_het_elm_mallocator_reset_f);
708 * Destroy the dict mallocators.
709 * This is an internal XBT function during the lib initialization
711 void xbt_dict_postexit(void)
713 if (dict_elm_mallocator != NULL) {
714 xbt_mallocator_free(dict_elm_mallocator);
715 dict_elm_mallocator = NULL;
716 xbt_mallocator_free(dict_het_elm_mallocator);
717 dict_het_elm_mallocator = NULL;
724 printf("Overall stats:");
725 xbt_dynar_foreach(all_sizes, count, size) {
730 printf("%delm x %d cells; ", count, size);
734 printf("; %f elm per cell\n", avg / (double) total_count);
741 #include "portable.h"
743 XBT_LOG_EXTERNAL_CATEGORY(xbt_dict);
744 XBT_LOG_DEFAULT_CATEGORY(xbt_dict);
746 XBT_TEST_SUITE("dict", "Dict data container");
748 static void print_str(void *str)
750 printf("%s", (char *) PRINTF_STR(str));
753 static void debuged_add_ext(xbt_dict_t head, const char *key,
754 const char *data_to_fill, void_f_pvoid_t free_f)
756 char *data = xbt_strdup(data_to_fill);
758 xbt_test_log("Add %s under %s", PRINTF_STR(data_to_fill),
761 xbt_dict_set(head, key, data, free_f);
762 if (XBT_LOG_ISENABLED(xbt_dict, xbt_log_priority_debug)) {
763 xbt_dict_dump(head, (void (*)(void *)) &printf);
768 static void debuged_add(xbt_dict_t head, const char *key, void_f_pvoid_t free_f)
770 debuged_add_ext(head, key, key, free_f);
773 static void fill(xbt_dict_t * head, int homogeneous)
775 void_f_pvoid_t free_f = homogeneous ? NULL : &free;
777 xbt_test_add("Fill in the dictionnary");
779 *head = homogeneous ? xbt_dict_new_homogeneous(&free) : xbt_dict_new();
780 debuged_add(*head, "12", free_f);
781 debuged_add(*head, "12a", free_f);
782 debuged_add(*head, "12b", free_f);
783 debuged_add(*head, "123", free_f);
784 debuged_add(*head, "123456", free_f);
785 /* Child becomes child of what to add */
786 debuged_add(*head, "1234", free_f);
787 /* Need of common ancestor */
788 debuged_add(*head, "123457", free_f);
792 static void search_ext(xbt_dict_t head, const char *key, const char *data)
796 xbt_test_add("Search %s", key);
797 found = xbt_dict_get(head, key);
798 xbt_test_log("Found %s", (char *) found);
800 xbt_test_assert(found,
801 "data do not match expectations: found NULL while searching for %s",
804 xbt_test_assert(!strcmp((char *) data, found),
805 "data do not match expectations: found %s while searching for %s",
806 (char *) found, data);
809 static void search(xbt_dict_t head, const char *key)
811 search_ext(head, key, key);
814 static void debuged_remove(xbt_dict_t head, const char *key)
817 xbt_test_add("Remove '%s'", PRINTF_STR(key));
818 xbt_dict_remove(head, key);
819 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
823 static void traverse(xbt_dict_t head)
825 xbt_dict_cursor_t cursor = NULL;
830 xbt_dict_foreach(head, cursor, key, data) {
831 if (!key || !data || strcmp(key, data)) {
832 xbt_test_log("Seen #%d: %s->%s", ++i, PRINTF_STR(key),
835 xbt_test_log("Seen #%d: %s", ++i, PRINTF_STR(key));
837 xbt_test_assert(!data || !strcmp(key, data),
838 "Key(%s) != value(%s). Aborting", key, data);
842 static void search_not_found(xbt_dict_t head, const char *data)
847 xbt_test_add("Search %s (expected not to be found)", data);
850 data = xbt_dict_get(head, data);
851 THROWF(unknown_error, 0,
852 "Found something which shouldn't be there (%s)", data);
855 if (e.category != not_found_error)
856 xbt_test_exception(e);
860 xbt_test_assert(ok, "Exception not raised");
863 static void count(xbt_dict_t dict, int length)
865 xbt_dict_cursor_t cursor;
871 xbt_test_add("Count elements (expecting %d)", length);
872 xbt_test_assert(xbt_dict_length(dict) == length,
873 "Announced length(%d) != %d.", xbt_dict_length(dict),
876 xbt_dict_foreach(dict, cursor, key, data)
879 xbt_test_assert(effective == length, "Effective length(%d) != %d.",
884 static void count_check_get_key(xbt_dict_t dict, int length)
886 xbt_dict_cursor_t cursor;
888 _XBT_GNUC_UNUSED char *key2;
894 ("Count elements (expecting %d), and test the getkey function",
896 xbt_test_assert(xbt_dict_length(dict) == length,
897 "Announced length(%d) != %d.", xbt_dict_length(dict),
900 xbt_dict_foreach(dict, cursor, key, data) {
902 key2 = xbt_dict_get_key(dict, data);
903 xbt_assert(!strcmp(key, key2),
904 "The data was registered under %s instead of %s as expected",
908 xbt_test_assert(effective == length, "Effective length(%d) != %d.",
914 xbt_dict_t head = NULL;
917 static void basic_test(int homogeneous)
919 void_f_pvoid_t free_f;
921 xbt_test_add("Traversal the null dictionary");
924 xbt_test_add("Traversal and search the empty dictionary");
925 head = homogeneous ? xbt_dict_new_homogeneous(&free) : xbt_dict_new();
928 debuged_remove(head, "12346");
931 if (e.category != not_found_error)
932 xbt_test_exception(e);
935 xbt_dict_free(&head);
937 free_f = homogeneous ? NULL : &free;
939 xbt_test_add("Traverse the full dictionary");
940 fill(&head, homogeneous);
941 count_check_get_key(head, 7);
943 debuged_add_ext(head, "toto", "tutu", free_f);
944 search_ext(head, "toto", "tutu");
945 debuged_remove(head, "toto");
950 xbt_test_add("Free the dictionary (twice)");
951 xbt_dict_free(&head);
952 xbt_dict_free(&head);
955 fill(&head, homogeneous);
956 count_check_get_key(head, 7);
957 xbt_test_add("Change 123 to 'Changed 123'");
958 xbt_dict_set(head, "123", strdup("Changed 123"), free_f);
959 count_check_get_key(head, 7);
961 xbt_test_add("Change 123 back to '123'");
962 xbt_dict_set(head, "123", strdup("123"), free_f);
963 count_check_get_key(head, 7);
965 xbt_test_add("Change 12a to 'Dummy 12a'");
966 xbt_dict_set(head, "12a", strdup("Dummy 12a"), free_f);
967 count_check_get_key(head, 7);
969 xbt_test_add("Change 12a to '12a'");
970 xbt_dict_set(head, "12a", strdup("12a"), free_f);
971 count_check_get_key(head, 7);
973 xbt_test_add("Traverse the resulting dictionary");
977 xbt_test_add("Search 123");
978 data = xbt_dict_get(head, "123");
979 xbt_test_assert(data);
980 xbt_test_assert(!strcmp("123", data));
982 search_not_found(head, "Can't be found");
983 search_not_found(head, "123 Can't be found");
984 search_not_found(head, "12345678 NOT");
989 search(head, "123456");
990 search(head, "1234");
991 search(head, "123457");
993 xbt_test_add("Traverse the resulting dictionary");
996 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
998 xbt_test_add("Free the dictionary twice");
999 xbt_dict_free(&head);
1000 xbt_dict_free(&head);
1002 xbt_test_add("Traverse the resulting dictionary");
1006 XBT_TEST_UNIT("basic (heterogeneous)", test_dict_basic_heterogeneous, "Basic usage: change, retrieve, traverse: heterogeneous dictionary")
1011 XBT_TEST_UNIT("basic (homogeneous)", test_dict_basic_homogeneous, "Basic usage: change, retrieve, traverse: homogeneous dictionary")
1016 static void remove_test(int homogeneous)
1018 fill(&head, homogeneous);
1020 xbt_test_add("Remove non existing data");
1022 debuged_remove(head, "Does not exist");
1025 if (e.category != not_found_error)
1026 xbt_test_exception(e);
1031 xbt_dict_free(&head);
1034 ("Remove each data manually (traversing the resulting dictionary each time)");
1035 fill(&head, homogeneous);
1036 debuged_remove(head, "12a");
1039 debuged_remove(head, "12b");
1042 debuged_remove(head, "12");
1045 debuged_remove(head, "123456");
1049 debuged_remove(head, "12346");
1052 if (e.category != not_found_error)
1053 xbt_test_exception(e);
1057 debuged_remove(head, "1234");
1059 debuged_remove(head, "123457");
1061 debuged_remove(head, "123");
1064 debuged_remove(head, "12346");
1067 if (e.category != not_found_error)
1068 xbt_test_exception(e);
1074 ("Free dict, create new fresh one, and then reset the dict");
1075 xbt_dict_free(&head);
1076 fill(&head, homogeneous);
1077 xbt_dict_reset(head);
1081 xbt_test_add("Free the dictionary twice");
1082 xbt_dict_free(&head);
1083 xbt_dict_free(&head);
1086 XBT_TEST_UNIT("remove (heterogeneous)", test_dict_remove_heterogeneous, "Removing some values: heterogeneous dictionary")
1091 XBT_TEST_UNIT("remove (homogeneous)", test_dict_remove_homogeneous, "Removing some values: homogeneous dictionary")
1096 XBT_TEST_UNIT("nulldata", test_dict_nulldata, "NULL data management")
1100 xbt_test_add("Store NULL under 'null'");
1101 xbt_dict_set(head, "null", NULL, NULL);
1102 search_ext(head, "null", NULL);
1104 xbt_test_add("Check whether I see it while traversing...");
1106 xbt_dict_cursor_t cursor = NULL;
1110 xbt_dict_foreach(head, cursor, key, data) {
1111 if (!key || !data || strcmp(key, data)) {
1112 xbt_test_log("Seen: %s->%s", PRINTF_STR(key), PRINTF_STR(data));
1114 xbt_test_log("Seen: %s", PRINTF_STR(key));
1117 if (!strcmp(key, "null"))
1120 xbt_test_assert(found,
1121 "the key 'null', associated to NULL is not found");
1123 xbt_dict_free(&head);
1126 static void debuged_addi(xbt_dict_t head, uintptr_t key, uintptr_t data)
1128 uintptr_t stored_data = 0;
1129 xbt_test_log("Add %zu under %zu", data, key);
1131 xbt_dicti_set(head, key, data);
1132 if (XBT_LOG_ISENABLED(xbt_dict, xbt_log_priority_debug)) {
1133 xbt_dict_dump(head, (void (*)(void *)) &printf);
1136 stored_data = xbt_dicti_get(head, key);
1137 xbt_test_assert(stored_data == data,
1138 "Retrieved data (%zu) is not what I just stored (%zu) under key %zu",
1139 stored_data, data, key);
1142 XBT_TEST_UNIT("dicti", test_dict_scalar, "Scalar data and key management")
1144 xbt_test_add("Fill in the dictionnary");
1146 head = xbt_dict_new();
1147 debuged_addi(head, 12, 12);
1148 debuged_addi(head, 13, 13);
1149 debuged_addi(head, 14, 14);
1150 debuged_addi(head, 15, 15);
1152 debuged_addi(head, 12, 15);
1153 debuged_addi(head, 15, 2000);
1154 debuged_addi(head, 15, 3000);
1156 debuged_addi(head, 0, 1000);
1157 debuged_addi(head, 0, 2000);
1158 debuged_addi(head, 0, 3000);
1160 debuged_addi(head, 12, 0);
1161 debuged_addi(head, 13, 0);
1162 debuged_addi(head, 12, 0);
1163 debuged_addi(head, 0, 0);
1165 xbt_dict_free(&head);
1168 #define NB_ELM 20000
1169 #define SIZEOFKEY 1024
1170 static int countelems(xbt_dict_t head)
1172 xbt_dict_cursor_t cursor;
1177 xbt_dict_foreach(head, cursor, key, data) {
1183 XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
1185 xbt_dict_t head = NULL;
1190 srand((unsigned int) time(NULL));
1192 for (i = 0; i < 10; i++) {
1193 xbt_test_add("CRASH test number %d (%d to go)", i + 1, 10 - i - 1);
1195 ("Fill the struct, count its elems and frees the structure");
1197 ("using 1000 elements with %d chars long randomized keys.",
1199 head = xbt_dict_new();
1200 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
1201 for (j = 0; j < 1000; j++) {
1203 key = xbt_malloc(SIZEOFKEY);
1206 for (k = 0; k < SIZEOFKEY - 1; k++)
1207 key[k] = rand() % ('z' - 'a') + 'a';
1209 /* printf("[%d %s]\n",j,key); */
1210 data = xbt_dict_get_or_null(head, key);
1211 } while (data != NULL);
1213 xbt_dict_set(head, key, key, &free);
1214 data = xbt_dict_get(head, key);
1215 xbt_test_assert(!strcmp(key, data),
1216 "Retrieved value (%s) != Injected value (%s)", key,
1221 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
1223 xbt_dict_free(&head);
1224 xbt_dict_free(&head);
1228 head = xbt_dict_new();
1229 xbt_test_add("Fill %d elements, with keys being the number of element",
1231 for (j = 0; j < NB_ELM; j++) {
1232 /* if (!(j%1000)) { printf("."); fflush(stdout); } */
1234 key = xbt_malloc(10);
1236 sprintf(key, "%d", j);
1237 xbt_dict_set(head, key, key, &free);
1239 /*xbt_dict_dump(head,(void (*)(void*))&printf); */
1242 ("Count the elements (retrieving the key and data for each)");
1243 i = countelems(head);
1244 xbt_test_log("There is %d elements", i);
1246 xbt_test_add("Search my %d elements 20 times", NB_ELM);
1247 key = xbt_malloc(10);
1248 for (i = 0; i < 20; i++) {
1249 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
1250 for (j = 0; j < NB_ELM; j++) {
1252 sprintf(key, "%d", j);
1253 data = xbt_dict_get(head, key);
1254 xbt_test_assert(!strcmp(key, (char *) data),
1255 "with get, key=%s != data=%s", key, (char *) data);
1256 data = xbt_dict_get_ext(head, key, strlen(key));
1257 xbt_test_assert(!strcmp(key, (char *) data),
1258 "with get_ext, key=%s != data=%s", key,
1264 xbt_test_add("Remove my %d elements", NB_ELM);
1265 key = xbt_malloc(10);
1266 for (j = 0; j < NB_ELM; j++) {
1267 /* if (!(j%10000)) printf("."); fflush(stdout); */
1269 sprintf(key, "%d", j);
1270 xbt_dict_remove(head, key);
1275 xbt_test_add("Free the structure (twice)");
1276 xbt_dict_free(&head);
1277 xbt_dict_free(&head);
1280 static void str_free(void *s)
1282 char *c = *(char **) s;
1286 XBT_TEST_UNIT("multicrash", test_dict_multicrash, "Multi-dict crash test")
1290 #define NB_ELM 100 /*00 */
1292 #define KEY_SIZE 512
1293 #define NB_TEST 20 /*20 */
1296 xbt_dict_t mdict = NULL;
1298 xbt_dynar_t keys = xbt_dynar_new(sizeof(char *), str_free);
1303 xbt_test_add("Generic multicache CRASH test");
1305 (" Fill the struct and frees it %d times, using %d elements, "
1306 "depth of multicache=%d, key size=%d", NB_TEST, NB_ELM, DEPTH,
1309 for (l = 0; l < DEPTH; l++) {
1310 key = xbt_malloc(KEY_SIZE);
1311 xbt_dynar_push(keys, &key);
1314 for (i = 0; i < NB_TEST; i++) {
1315 mdict = xbt_dict_new();
1316 XBT_VERB("mdict=%p", mdict);
1318 printf("Test %d\n", i);
1319 /* else if (i%10) printf("."); else printf("%d",i/10); */
1321 for (j = 0; j < NB_ELM; j++) {
1325 for (l = 0; l < DEPTH; l++) {
1326 key = *(char **) xbt_dynar_get_ptr(keys, l);
1328 for (k = 0; k < KEY_SIZE - 1; k++)
1329 key[k] = rand() % ('z' - 'a') + 'a';
1334 printf("%p=%s %s ", key, key, (l < DEPTH - 1 ? ";" : "}"));
1337 printf("in multitree %p.\n", mdict);
1339 xbt_multidict_set(mdict, keys, xbt_strdup(key), free);
1341 data = xbt_multidict_get(mdict, keys);
1343 xbt_test_assert(data && !strcmp((char *) data, key),
1344 "Retrieved value (%s) does not match the given one (%s)\n",
1345 (char *) data, key);
1347 xbt_dict_free(&mdict);
1350 xbt_dynar_free(&keys);
1353 xbt_dict_dump(mdict,&xbt_dict_print); */
1355 xbt_dict_free(&mdict);
1356 xbt_dynar_free(&keys);
1359 #endif /* SIMGRID_TEST */