1 /* dict - a generic dictionary, variation over hash table */
3 /* Copyright (c) 2004-2015. 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. */
17 #include "xbt/mallocator.h"
18 #include "src/xbt_modinter.h"
20 #include "dict_private.h"
22 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dict, xbt, "Dictionaries provide the same functionalities as hash tables");
26 * \return pointer to the destination
27 * \see xbt_dict_new_homogenous(), xbt_dict_free()
29 * Creates and initialize a new dictionary with a default hashtable size.
30 * The dictionary is heterogeneous: each element can have a different free function.
32 xbt_dict_t xbt_dict_new(void)
34 xbt_dict_t dict = xbt_dict_new_homogeneous(nullptr);
35 dict->homogeneous = 0;
42 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary
43 * \return pointer to the destination
44 * \see xbt_dict_new(), xbt_dict_free()
46 * Creates and initialize a new dictionary with a default hashtable size.
47 * The dictionary is homogeneous: each element share the same free function.
49 xbt_dict_t xbt_dict_new_homogeneous(void_f_pvoid_t free_ctn)
51 if (dict_elm_mallocator == nullptr)
56 dict = xbt_new(s_xbt_dict_t, 1);
57 dict->free_f = free_ctn;
58 dict->table_size = 127;
59 dict->table = xbt_new0(xbt_dictelm_t, dict->table_size + 1);
62 dict->homogeneous = 1;
69 * \param dict the dictionary to be freed
71 * Frees a dictionary with all the data
73 void xbt_dict_free(xbt_dict_t * dict)
76 xbt_dictelm_t current, previous;
80 // if ( *dict ) xbt_dict_dump_sizes(*dict);
82 if (dict != nullptr && *dict != nullptr) {
83 table_size = (*dict)->table_size;
84 table = (*dict)->table;
85 /* Warning: the size of the table is 'table_size+1'...
86 * This is because table_size is used as a binary mask in xbt_dict_rehash */
87 for (i = 0; (*dict)->count && i <= table_size; i++) {
89 while (current != nullptr) {
91 current = current->next;
92 xbt_dictelm_free(*dict, previous);
102 /** Returns the amount of elements in the dict */
103 unsigned int xbt_dict_size(xbt_dict_t dict)
105 return (dict ? (unsigned int) dict->count : (unsigned int) 0);
108 /* Expend the size of the dict */
109 static void xbt_dict_rehash(xbt_dict_t dict)
111 const unsigned oldsize = dict->table_size + 1;
112 unsigned newsize = oldsize * 2;
114 xbt_dictelm_t *currcell = (xbt_dictelm_t *) xbt_realloc((char *) dict->table, newsize * sizeof(xbt_dictelm_t));
115 memset(&currcell[oldsize], 0, oldsize * sizeof(xbt_dictelm_t)); /* zero second half */
116 dict->table_size = --newsize;
117 dict->table = currcell;
118 XBT_DEBUG("REHASH (%d->%d)", oldsize, newsize);
120 for (unsigned i = 0; i < oldsize; i++, currcell++) {
121 if (!*currcell) /* empty cell */
124 xbt_dictelm_t *twincell = currcell + oldsize;
125 xbt_dictelm_t *pprev = currcell;
126 xbt_dictelm_t bucklet = *currcell;
127 for (; bucklet != nullptr; bucklet = *pprev) {
128 /* Since we use "& size" instead of "%size" and since the size was doubled, each bucklet of this cell must either:
129 - stay in cell i (ie, currcell)
130 - go to the cell i+oldsize (ie, twincell) */
131 if ((bucklet->hash_code & newsize) != i) { /* Move to b */
132 *pprev = bucklet->next;
133 bucklet->next = *twincell;
139 pprev = &bucklet->next;
143 if (!*currcell) /* everything moved */
149 * \brief Add data to the dict (arbitrary key)
150 * \param dict the container
151 * \param key the key to set the new data
152 * \param key_len the size of the \a key
153 * \param data the data to add in the dict
154 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
155 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
157 * Set the \a data in the structure under the \a key, which can be any kind of data, as long as its length is provided
160 void xbt_dict_set_ext(xbt_dict_t dict, const char *key, int key_len, void *data, void_f_pvoid_t free_ctn)
162 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
164 xbt_dictelm_t current, previous = nullptr;
166 XBT_CDEBUG(xbt_dict, "ADD %.*s hash = %u, size = %d, & = %u", key_len, key, hash_code,
167 dict->table_size, hash_code & dict->table_size);
168 current = dict->table[hash_code & dict->table_size];
169 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
170 || memcmp(key, current->key, key_len))) {
172 current = current->next;
175 if (current == nullptr) {
176 /* this key doesn't exist yet */
177 current = xbt_dictelm_new(dict, key, key_len, hash_code, data, free_ctn);
179 if (previous == nullptr) {
180 dict->table[hash_code & dict->table_size] = current;
182 if ((dict->fill * 100) / (dict->table_size + 1) > MAX_FILL_PERCENT)
183 xbt_dict_rehash(dict);
185 previous->next = current;
188 XBT_CDEBUG(xbt_dict, "Replace %.*s by %.*s under key %.*s",
189 key_len, (char *) current->content, key_len, (char *) data, key_len, (char *) key);
190 /* there is already an element with the same key: overwrite it */
191 xbt_dictelm_set_data(dict, current, data, free_ctn);
196 * \brief Add data to the dict (null-terminated key)
198 * \param dict the dict
199 * \param key the key to set the new data
200 * \param data the data to add in the dict
201 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
202 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
204 * set the \a data in the structure under the \a key, which is anull terminated string.
206 void xbt_dict_set(xbt_dict_t dict, const char *key, void *data, void_f_pvoid_t free_ctn)
208 xbt_dict_set_ext(dict, key, strlen(key), data, free_ctn);
212 * \brief Retrieve data from the dict (arbitrary key)
214 * \param dict the dealer of data
215 * \param key the key to find data
216 * \param key_len the size of the \a key
217 * \return the data that we are looking for
219 * Search the given \a key. Throws not_found_error when not found.
221 void *xbt_dict_get_ext(xbt_dict_t dict, const char *key, int key_len)
223 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
224 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
226 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
227 || memcmp(key, current->key, key_len))) {
228 current = current->next;
231 if (current == nullptr)
232 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
234 return current->content;
237 /** @brief like xbt_dict_get_ext(), but returning nullptr when not found */
238 void *xbt_dict_get_or_null_ext(xbt_dict_t dict, const char *key, int key_len)
240 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
241 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
243 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
244 || memcmp(key, current->key, key_len))) {
245 current = current->next;
248 if (current == nullptr)
251 return current->content;
255 * @brief retrieve the key associated to that object. Warning, that's a linear search
257 * Returns nullptr if the object cannot be found
259 char *xbt_dict_get_key(xbt_dict_t dict, const void *data)
261 for (int i = 0; i <= dict->table_size; i++) {
262 xbt_dictelm_t current = dict->table[i];
263 while (current != nullptr) {
264 if (current->content == data)
266 current = current->next;
272 /** @brief retrieve the key associated to that xbt_dictelm_t. */
273 char *xbt_dict_get_elm_key(xbt_dictelm_t elm)
279 * \brief Retrieve data from the dict (null-terminated key)
281 * \param dict the dealer of data
282 * \param key the key to find data
283 * \return the data that we are looking for
285 * Search the given \a key. Throws not_found_error when not found.
286 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
288 void *xbt_dict_get(xbt_dict_t dict, const char *key)
290 return xbt_dict_get_elm(dict, key)->content;
294 * \brief Retrieve element from the dict (null-terminated key)
296 * \param dict the dealer of data
297 * \param key the key to find data
298 * \return the s_xbt_dictelm_t that we are looking for
300 * Search the given \a key. Throws not_found_error when not found.
301 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
303 xbt_dictelm_t xbt_dict_get_elm(xbt_dict_t dict, const char *key)
305 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
307 if (current == nullptr)
308 THROWF(not_found_error, 0, "key %s not found", key);
314 * \brief like xbt_dict_get(), but returning nullptr when not found
316 void *xbt_dict_get_or_null(xbt_dict_t dict, const char *key)
318 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
320 if (current == nullptr)
323 return current->content;
327 * \brief like xbt_dict_get_elm(), but returning nullptr when not found
329 xbt_dictelm_t xbt_dict_get_elm_or_null(xbt_dict_t dict, const char *key)
331 unsigned int hash_code = xbt_str_hash(key);
332 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
334 while (current != nullptr && (hash_code != current->hash_code || strcmp(key, current->key)))
335 current = current->next;
340 * \brief Remove data from the dict (arbitrary key)
342 * \param dict the trash can
343 * \param key the key of the data to be removed
344 * \param key_len the size of the \a key
346 * Remove the entry associated with the given \a key (throws not_found)
348 void xbt_dict_remove_ext(xbt_dict_t dict, const char *key, int key_len)
350 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
351 xbt_dictelm_t previous = nullptr;
352 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
354 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
355 || strncmp(key, current->key, key_len))) {
356 previous = current; /* save the previous node */
357 current = current->next;
360 if (current == nullptr)
361 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
363 if (previous != nullptr) {
364 previous->next = current->next;
366 dict->table[hash_code & dict->table_size] = current->next;
369 if (!dict->table[hash_code & dict->table_size])
372 xbt_dictelm_free(dict, current);
377 * \brief Remove data from the dict (null-terminated key)
379 * \param dict the dict
380 * \param key the key of the data to be removed
382 * Remove the entry associated with the given \a key
384 void xbt_dict_remove(xbt_dict_t dict, const char *key)
386 xbt_dict_remove_ext(dict, key, strlen(key));
389 /** @brief Remove all data from the dict */
390 void xbt_dict_reset(xbt_dict_t dict)
392 if (dict->count == 0)
395 for (int i = 0; i <= dict->table_size; i++) {
396 xbt_dictelm_t previous = nullptr;
397 xbt_dictelm_t current = dict->table[i];
398 while (current != nullptr) {
400 current = current->next;
401 xbt_dictelm_free(dict, previous);
403 dict->table[i] = nullptr;
411 * \brief Return the number of elements in the dict.
412 * \param dict a dictionary
414 int xbt_dict_length(xbt_dict_t dict)
419 /** @brief function to be used in xbt_dict_dump as long as the stored values are strings */
420 void xbt_dict_dump_output_string(void *s)
422 fputs((char*) s, stdout);
426 * \brief test if the dict is empty or not
428 int xbt_dict_is_empty(xbt_dict_t dict)
430 return !dict || (xbt_dict_length(dict) == 0);
434 * \brief Outputs the content of the structure (debugging purpose)
436 * \param dict the exibitionist
437 * \param output a function to dump each data in the tree (check @ref xbt_dict_dump_output_string)
439 * Outputs the content of the structure. (for debugging purpose). \a output is a function to output the data. If nullptr,
440 * data won't be displayed.
442 void xbt_dict_dump(xbt_dict_t dict, void_f_pvoid_t output)
445 xbt_dictelm_t element;
446 printf("Dict %p:\n", dict);
447 if (dict != nullptr) {
448 for (i = 0; i < dict->table_size; i++) {
449 element = dict->table[i];
452 while (element != nullptr) {
453 printf(" %s -> '", element->key);
454 if (output != nullptr) {
455 output(element->content);
458 element = element->next;
468 xbt_dynar_t all_sizes = nullptr;
469 /** @brief shows some debugging info about the bucklet repartition */
470 void xbt_dict_dump_sizes(xbt_dict_t dict)
475 printf("Dict %p: %d bucklets, %d used cells (of %d) ", dict, dict->count, dict->fill, dict->table_size);
481 xbt_dynar_t sizes = xbt_dynar_new(sizeof(int), nullptr);
483 for (int i = 0; i < dict->table_size; i++) {
484 xbt_dictelm_t element = dict->table[i];
487 while (element != nullptr) {
489 element = element->next;
492 if (xbt_dynar_length(sizes) <= size) {
494 xbt_dynar_set(sizes, size, &prevsize);
497 xbt_dynar_get_cpy(sizes, size, &prevsize);
499 xbt_dynar_set(sizes, size, &prevsize);
503 all_sizes = xbt_dynar_new(sizeof(int), nullptr);
505 xbt_dynar_foreach(sizes, count, size) {
506 /* Copy values of this one into all_sizes */
508 if (xbt_dynar_length(all_sizes) <= count) {
510 xbt_dynar_set(all_sizes, count, &prevcount);
512 xbt_dynar_get_cpy(all_sizes, count, &prevcount);
514 xbt_dynar_set(all_sizes, count, &prevcount);
517 /* Report current sizes */
522 printf("%uelm x %u cells; ", count, size);
525 xbt_dynar_free(&sizes);
529 * Create the dict mallocators.
530 * This is an internal XBT function called during the lib initialization.
531 * It can be used several times to recreate the mallocator, for example when you switch to MC mode
533 void xbt_dict_preinit(void)
535 if (dict_elm_mallocator == nullptr)
536 dict_elm_mallocator = xbt_mallocator_new(
537 256, dict_elm_mallocator_new_f, dict_elm_mallocator_free_f,
538 dict_elm_mallocator_reset_f);
539 if (dict_het_elm_mallocator == nullptr)
540 dict_het_elm_mallocator = xbt_mallocator_new(
541 256, dict_het_elm_mallocator_new_f, dict_het_elm_mallocator_free_f,
542 dict_het_elm_mallocator_reset_f);
546 * Destroy the dict mallocators.
547 * This is an internal XBT function during the lib initialization
549 void xbt_dict_postexit(void)
551 if (dict_elm_mallocator != nullptr) {
552 xbt_mallocator_free(dict_elm_mallocator);
553 dict_elm_mallocator = nullptr;
554 xbt_mallocator_free(dict_het_elm_mallocator);
555 dict_het_elm_mallocator = nullptr;
562 printf("Overall stats:");
563 xbt_dynar_foreach(all_sizes, count, size) {
568 printf("%uelm x %d cells; ", count, size);
572 printf("; %f elm per cell\n", avg / (double) total_count);
580 #include <xbt/ex.hpp>
581 #include "src/internal_config.h"
583 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(xbt_dict);
585 XBT_TEST_SUITE("dict", "Dict data container");
587 static void debuged_add_ext(xbt_dict_t head, const char *key, const char *data_to_fill, void_f_pvoid_t free_f)
589 char *data = xbt_strdup(data_to_fill);
591 xbt_test_log("Add %s under %s", data_to_fill, key);
593 xbt_dict_set(head, key, data, free_f);
594 if (XBT_LOG_ISENABLED(xbt_dict, xbt_log_priority_debug)) {
595 xbt_dict_dump(head, (void (*)(void *)) &printf);
600 static void debuged_add(xbt_dict_t head, const char *key, void_f_pvoid_t free_f)
602 debuged_add_ext(head, key, key, free_f);
605 static void fill(xbt_dict_t * head, int homogeneous)
607 void_f_pvoid_t free_f = homogeneous ? nullptr : &free;
609 xbt_test_add("Fill in the dictionnary");
611 *head = homogeneous ? xbt_dict_new_homogeneous(&free) : xbt_dict_new();
612 debuged_add(*head, "12", free_f);
613 debuged_add(*head, "12a", free_f);
614 debuged_add(*head, "12b", free_f);
615 debuged_add(*head, "123", free_f);
616 debuged_add(*head, "123456", free_f);
617 /* Child becomes child of what to add */
618 debuged_add(*head, "1234", free_f);
619 /* Need of common ancestor */
620 debuged_add(*head, "123457", free_f);
623 static void search_ext(xbt_dict_t head, const char *key, const char *data)
625 xbt_test_add("Search %s", key);
626 char *found = (char*) xbt_dict_get(head, key);
627 xbt_test_log("Found %s", found);
629 xbt_test_assert(found, "data do not match expectations: found nullptr while searching for %s", data);
631 xbt_test_assert(!strcmp(data, found), "data do not match expectations: found %s while searching for %s",
634 xbt_test_assert(!found, "data do not match expectations: found %s while searching for nullptr", found);
638 static void search(xbt_dict_t head, const char *key)
640 search_ext(head, key, key);
643 static void debuged_remove(xbt_dict_t head, const char *key)
645 xbt_test_add("Remove '%s'", key);
646 xbt_dict_remove(head, key);
647 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
650 static void traverse(xbt_dict_t head)
652 xbt_dict_cursor_t cursor = nullptr;
657 xbt_dict_foreach(head, cursor, key, data) {
658 if (!key || !data || strcmp(key, data)) {
659 xbt_test_log("Seen #%d: %s->%s", ++i, key, data);
661 xbt_test_log("Seen #%d: %s", ++i, key);
663 xbt_test_assert(!data || !strcmp(key, data), "Key(%s) != value(%s). Aborting", key, data);
667 static void search_not_found(xbt_dict_t head, const char *data)
670 xbt_test_add("Search %s (expected not to be found)", data);
673 data = (const char*) xbt_dict_get(head, data);
674 THROWF(unknown_error, 0, "Found something which shouldn't be there (%s)", data);
677 if (e.category != not_found_error)
678 xbt_test_exception(e);
681 xbt_test_assert(ok, "Exception not raised");
684 static void count(xbt_dict_t dict, int length)
686 xbt_dict_cursor_t cursor;
691 xbt_test_add("Count elements (expecting %d)", length);
692 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
694 xbt_dict_foreach(dict, cursor, key, data)
697 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
700 static void count_check_get_key(xbt_dict_t dict, int length)
702 xbt_dict_cursor_t cursor;
704 XBT_ATTRIB_UNUSED char *key2;
708 xbt_test_add("Count elements (expecting %d), and test the getkey function", length);
709 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
711 xbt_dict_foreach(dict, cursor, key, data) {
713 key2 = xbt_dict_get_key(dict, data);
714 xbt_assert(!strcmp(key, key2), "The data was registered under %s instead of %s as expected", key2, key);
717 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
721 xbt_dict_t head = nullptr;
724 static void basic_test(int homogeneous)
726 void_f_pvoid_t free_f;
728 xbt_test_add("Traversal the null dictionary");
731 xbt_test_add("Traversal and search the empty dictionary");
732 head = homogeneous ? xbt_dict_new_homogeneous(&free) : xbt_dict_new();
735 debuged_remove(head, "12346");
738 if (e.category != not_found_error)
739 xbt_test_exception(e);
741 xbt_dict_free(&head);
743 free_f = homogeneous ? nullptr : &free;
745 xbt_test_add("Traverse the full dictionary");
746 fill(&head, homogeneous);
747 count_check_get_key(head, 7);
749 debuged_add_ext(head, "toto", "tutu", free_f);
750 search_ext(head, "toto", "tutu");
751 debuged_remove(head, "toto");
756 xbt_test_add("Free the dictionary (twice)");
757 xbt_dict_free(&head);
758 xbt_dict_free(&head);
761 fill(&head, homogeneous);
762 count_check_get_key(head, 7);
763 xbt_test_add("Change 123 to 'Changed 123'");
764 xbt_dict_set(head, "123", xbt_strdup("Changed 123"), free_f);
765 count_check_get_key(head, 7);
767 xbt_test_add("Change 123 back to '123'");
768 xbt_dict_set(head, "123", xbt_strdup("123"), free_f);
769 count_check_get_key(head, 7);
771 xbt_test_add("Change 12a to 'Dummy 12a'");
772 xbt_dict_set(head, "12a", xbt_strdup("Dummy 12a"), free_f);
773 count_check_get_key(head, 7);
775 xbt_test_add("Change 12a to '12a'");
776 xbt_dict_set(head, "12a", xbt_strdup("12a"), free_f);
777 count_check_get_key(head, 7);
779 xbt_test_add("Traverse the resulting dictionary");
783 xbt_test_add("Search 123");
784 data = (char*) xbt_dict_get(head, "123");
785 xbt_test_assert(data);
786 xbt_test_assert(!strcmp("123", data));
788 search_not_found(head, "Can't be found");
789 search_not_found(head, "123 Can't be found");
790 search_not_found(head, "12345678 NOT");
795 search(head, "123456");
796 search(head, "1234");
797 search(head, "123457");
799 xbt_test_add("Traverse the resulting dictionary");
802 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
804 xbt_test_add("Free the dictionary twice");
805 xbt_dict_free(&head);
806 xbt_dict_free(&head);
808 xbt_test_add("Traverse the resulting dictionary");
812 XBT_TEST_UNIT("basic_heterogeneous", test_dict_basic_heterogeneous, "Basic usage: change, retrieve, traverse: heterogeneous dict")
817 XBT_TEST_UNIT("basic_homogeneous", test_dict_basic_homogeneous, "Basic usage: change, retrieve, traverse: homogeneous dict")
822 static void remove_test(int homogeneous)
824 fill(&head, homogeneous);
826 xbt_test_add("Remove non existing data");
828 debuged_remove(head, "Does not exist");
831 if (e.category != not_found_error)
832 xbt_test_exception(e);
836 xbt_dict_free(&head);
838 xbt_test_add("Remove each data manually (traversing the resulting dictionary each time)");
839 fill(&head, homogeneous);
840 debuged_remove(head, "12a");
843 debuged_remove(head, "12b");
846 debuged_remove(head, "12");
849 debuged_remove(head, "123456");
853 debuged_remove(head, "12346");
856 if (e.category != not_found_error)
857 xbt_test_exception(e);
860 debuged_remove(head, "1234");
862 debuged_remove(head, "123457");
864 debuged_remove(head, "123");
867 debuged_remove(head, "12346");
870 if (e.category != not_found_error)
871 xbt_test_exception(e);
875 xbt_test_add("Free dict, create new fresh one, and then reset the dict");
876 xbt_dict_free(&head);
877 fill(&head, homogeneous);
878 xbt_dict_reset(head);
882 xbt_test_add("Free the dictionary twice");
883 xbt_dict_free(&head);
884 xbt_dict_free(&head);
887 XBT_TEST_UNIT("remove_heterogeneous", test_dict_remove_heterogeneous, "Removing some values: heterogeneous dict")
892 XBT_TEST_UNIT("remove_homogeneous", test_dict_remove_homogeneous, "Removing some values: homogeneous dict")
897 XBT_TEST_UNIT("nulldata", test_dict_nulldata, "nullptr data management")
901 xbt_test_add("Store nullptr under 'null'");
902 xbt_dict_set(head, "null", nullptr, nullptr);
903 search_ext(head, "null", nullptr);
905 xbt_test_add("Check whether I see it while traversing...");
907 xbt_dict_cursor_t cursor = nullptr;
911 xbt_dict_foreach(head, cursor, key, data) {
912 if (!key || !data || strcmp(key, data)) {
913 xbt_test_log("Seen: %s->%s", key, data);
915 xbt_test_log("Seen: %s", key);
918 if (!strcmp(key, "null"))
921 xbt_test_assert(found, "the key 'null', associated to nullptr is not found");
923 xbt_dict_free(&head);
927 #define SIZEOFKEY 1024
928 static int countelems(xbt_dict_t head)
930 xbt_dict_cursor_t cursor;
935 xbt_dict_foreach(head, cursor, key, data) {
941 XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
943 xbt_dict_t head = nullptr;
947 srand((unsigned int) time(nullptr));
949 for (i = 0; i < 10; i++) {
950 xbt_test_add("CRASH test number %d (%d to go)", i + 1, 10 - i - 1);
951 xbt_test_log("Fill the struct, count its elems and frees the structure");
952 xbt_test_log("using 1000 elements with %d chars long randomized keys.", SIZEOFKEY);
953 head = xbt_dict_new();
954 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
955 for (j = 0; j < 1000; j++) {
956 char *data = nullptr;
957 key = (char*) xbt_malloc(SIZEOFKEY);
960 for (k = 0; k < SIZEOFKEY - 1; k++)
961 key[k] = rand() % ('z' - 'a') + 'a';
963 /* printf("[%d %s]\n",j,key); */
964 data = (char*) xbt_dict_get_or_null(head, key);
965 } while (data != nullptr);
967 xbt_dict_set(head, key, key, &free);
968 data = (char*) xbt_dict_get(head, key);
969 xbt_test_assert(!strcmp(key, data), "Retrieved value (%s) != Injected value (%s)", key, data);
973 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
975 xbt_dict_free(&head);
976 xbt_dict_free(&head);
979 head = xbt_dict_new();
980 xbt_test_add("Fill %d elements, with keys being the number of element", NB_ELM);
981 for (j = 0; j < NB_ELM; j++) {
982 /* if (!(j%1000)) { printf("."); fflush(stdout); } */
983 key = (char*) xbt_malloc(10);
985 snprintf(key,10, "%d", j);
986 xbt_dict_set(head, key, key, &free);
988 /*xbt_dict_dump(head,(void (*)(void*))&printf); */
990 xbt_test_add("Count the elements (retrieving the key and data for each)");
991 i = countelems(head);
992 xbt_test_log("There is %d elements", i);
994 xbt_test_add("Search my %d elements 20 times", NB_ELM);
995 key = (char*) xbt_malloc(10);
996 for (i = 0; i < 20; i++) {
998 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
999 for (j = 0; j < NB_ELM; j++) {
1000 snprintf(key,10, "%d", j);
1001 data = xbt_dict_get(head, key);
1002 xbt_test_assert(!strcmp(key, (char *) data), "with get, key=%s != data=%s", key, (char *) data);
1003 data = xbt_dict_get_ext(head, key, strlen(key));
1004 xbt_test_assert(!strcmp(key, (char *) data), "with get_ext, key=%s != data=%s", key, (char *) data);
1009 xbt_test_add("Remove my %d elements", NB_ELM);
1010 key = (char*) xbt_malloc(10);
1011 for (j = 0; j < NB_ELM; j++) {
1012 /* if (!(j%10000)) printf("."); fflush(stdout); */
1013 snprintf(key,10, "%d", j);
1014 xbt_dict_remove(head, key);
1018 xbt_test_add("Free the structure (twice)");
1019 xbt_dict_free(&head);
1020 xbt_dict_free(&head);
1023 XBT_TEST_UNIT("ext", test_dict_int, "Test dictionnary with int keys")
1025 xbt_dict_t dict = xbt_dict_new();
1028 xbt_test_add("Insert elements");
1030 for (i = 0; i < count; ++i)
1031 xbt_dict_set_ext(dict, (char*) &i, sizeof(i), (void*) (intptr_t) i, nullptr);
1032 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Bad number of elements in the dictionnary");
1034 xbt_test_add("Check elements");
1035 for (i = 0; i < count; ++i) {
1036 int res = (int) (intptr_t) xbt_dict_get_ext(dict, (char*) &i, sizeof(i));
1037 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Unexpected value at index %i, expected %i but was %i", i, i, res);
1040 xbt_test_add("Free the array");
1041 xbt_dict_free(&dict);
1043 #endif /* SIMGRID_TEST */