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()
34 XBT_WARN("Function xbt_dict_new() will soon be dropped. Please switch to xbt_dict_new_homogeneous()");
35 xbt_dict_t dict = xbt_dict_new_homogeneous(nullptr);
36 dict->homogeneous = 0;
43 * \param free_ctn function to call with (\a data as argument) when \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)
52 if (dict_elm_mallocator == nullptr)
57 dict = xbt_new(s_xbt_dict_t, 1);
58 dict->free_f = free_ctn;
59 dict->table_size = 127;
60 dict->table = xbt_new0(xbt_dictelm_t, dict->table_size + 1);
63 dict->homogeneous = 1;
70 * \param dict the dictionary to be freed
72 * Frees a dictionary with all the data
74 void xbt_dict_free(xbt_dict_t * dict)
77 xbt_dictelm_t current, previous;
81 // if ( *dict ) xbt_dict_dump_sizes(*dict);
83 if (dict != nullptr && *dict != nullptr) {
84 table_size = (*dict)->table_size;
85 table = (*dict)->table;
86 /* Warning: the size of the table is 'table_size+1'...
87 * This is because table_size is used as a binary mask in xbt_dict_rehash */
88 for (i = 0; (*dict)->count && i <= table_size; i++) {
90 while (current != nullptr) {
92 current = current->next;
93 xbt_dictelm_free(*dict, previous);
103 /** Returns the amount of elements in the dict */
104 unsigned int xbt_dict_size(xbt_dict_t dict)
106 return (dict ? (unsigned int) dict->count : (unsigned int) 0);
109 /* Expend the size of the dict */
110 static void xbt_dict_rehash(xbt_dict_t dict)
112 const unsigned oldsize = dict->table_size + 1;
113 unsigned newsize = oldsize * 2;
115 xbt_dictelm_t *currcell = (xbt_dictelm_t *) xbt_realloc((char *) dict->table, newsize * sizeof(xbt_dictelm_t));
116 memset(&currcell[oldsize], 0, oldsize * sizeof(xbt_dictelm_t)); /* zero second half */
117 dict->table_size = --newsize;
118 dict->table = currcell;
119 XBT_DEBUG("REHASH (%d->%d)", oldsize, newsize);
121 for (unsigned i = 0; i < oldsize; i++, currcell++) {
122 if (!*currcell) /* empty cell */
125 xbt_dictelm_t *twincell = currcell + oldsize;
126 xbt_dictelm_t *pprev = currcell;
127 xbt_dictelm_t bucklet = *currcell;
128 for (; bucklet != nullptr; bucklet = *pprev) {
129 /* Since we use "& size" instead of "%size" and since the size was doubled, each bucklet of this cell must either:
130 - stay in cell i (ie, currcell)
131 - go to the cell i+oldsize (ie, twincell) */
132 if ((bucklet->hash_code & newsize) != i) { /* Move to b */
133 *pprev = bucklet->next;
134 bucklet->next = *twincell;
140 pprev = &bucklet->next;
144 if (!*currcell) /* everything moved */
150 * \brief Add data to the dict (arbitrary key)
151 * \param dict the container
152 * \param key the key to set the new data
153 * \param key_len the size of the \a key
154 * \param data the data to add in the dict
155 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
156 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
158 * 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
161 void xbt_dict_set_ext(xbt_dict_t dict, const char *key, int key_len, void *data, void_f_pvoid_t free_ctn)
163 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
165 xbt_dictelm_t current, previous = nullptr;
167 XBT_CDEBUG(xbt_dict, "ADD %.*s hash = %u, size = %d, & = %u", key_len, key, hash_code,
168 dict->table_size, hash_code & dict->table_size);
169 current = dict->table[hash_code & dict->table_size];
170 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
171 || memcmp(key, current->key, key_len))) {
173 current = current->next;
176 if (current == nullptr) {
177 /* this key doesn't exist yet */
178 current = xbt_dictelm_new(dict, key, key_len, hash_code, data, free_ctn);
180 if (previous == nullptr) {
181 dict->table[hash_code & dict->table_size] = current;
183 if ((dict->fill * 100) / (dict->table_size + 1) > MAX_FILL_PERCENT)
184 xbt_dict_rehash(dict);
186 previous->next = current;
189 XBT_CDEBUG(xbt_dict, "Replace %.*s by %.*s under key %.*s",
190 key_len, (char *) current->content, key_len, (char *) data, key_len, (char *) key);
191 /* there is already an element with the same key: overwrite it */
192 xbt_dictelm_set_data(dict, current, data, free_ctn);
197 * \brief Add data to the dict (null-terminated key)
199 * \param dict the dict
200 * \param key the key to set the new data
201 * \param data the data to add in the dict
202 * \param free_ctn function to call with (\a data as argument) when \a data is removed from the dictionary. This param
203 * will only be considered when the dict was instantiated with xbt_dict_new() and not xbt_dict_new_homogeneous()
205 * set the \a data in the structure under the \a key, which is anull terminated string.
207 void xbt_dict_set(xbt_dict_t dict, const char *key, void *data, void_f_pvoid_t free_ctn)
209 xbt_dict_set_ext(dict, key, strlen(key), data, free_ctn);
213 * \brief Retrieve data from the dict (arbitrary key)
215 * \param dict the dealer of data
216 * \param key the key to find data
217 * \param key_len the size of the \a key
218 * \return the data that we are looking for
220 * Search the given \a key. Throws not_found_error when not found.
222 void *xbt_dict_get_ext(xbt_dict_t dict, const char *key, int key_len)
224 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
225 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
227 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
228 || memcmp(key, current->key, key_len))) {
229 current = current->next;
232 if (current == nullptr)
233 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
235 return current->content;
238 /** @brief like xbt_dict_get_ext(), but returning nullptr when not found */
239 void *xbt_dict_get_or_null_ext(xbt_dict_t dict, const char *key, int key_len)
241 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
242 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
244 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
245 || memcmp(key, current->key, key_len))) {
246 current = current->next;
249 if (current == nullptr)
252 return current->content;
256 * @brief retrieve the key associated to that object. Warning, that's a linear search
258 * Returns nullptr if the object cannot be found
260 char *xbt_dict_get_key(xbt_dict_t dict, const void *data)
262 for (int i = 0; i <= dict->table_size; i++) {
263 xbt_dictelm_t current = dict->table[i];
264 while (current != nullptr) {
265 if (current->content == data)
267 current = current->next;
273 /** @brief retrieve the key associated to that xbt_dictelm_t. */
274 char *xbt_dict_get_elm_key(xbt_dictelm_t elm)
280 * \brief Retrieve data from the dict (null-terminated key)
282 * \param dict the dealer of data
283 * \param key the key to find data
284 * \return the data that we are looking for
286 * Search the given \a key. Throws not_found_error when not found.
287 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
289 void *xbt_dict_get(xbt_dict_t dict, const char *key)
291 return xbt_dict_get_elm(dict, key)->content;
295 * \brief Retrieve element from the dict (null-terminated key)
297 * \param dict the dealer of data
298 * \param key the key to find data
299 * \return the s_xbt_dictelm_t that we are looking for
301 * Search the given \a key. Throws not_found_error when not found.
302 * Check xbt_dict_get_or_null() for a version returning nullptr without exception when not found.
304 xbt_dictelm_t xbt_dict_get_elm(xbt_dict_t dict, const char *key)
306 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
308 if (current == nullptr)
309 THROWF(not_found_error, 0, "key %s not found", key);
315 * \brief like xbt_dict_get(), but returning nullptr when not found
317 void *xbt_dict_get_or_null(xbt_dict_t dict, const char *key)
319 xbt_dictelm_t current = xbt_dict_get_elm_or_null(dict, key);
321 if (current == nullptr)
324 return current->content;
328 * \brief like xbt_dict_get_elm(), but returning nullptr when not found
330 xbt_dictelm_t xbt_dict_get_elm_or_null(xbt_dict_t dict, const char *key)
332 unsigned int hash_code = xbt_str_hash(key);
333 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
335 while (current != nullptr && (hash_code != current->hash_code || strcmp(key, current->key)))
336 current = current->next;
341 * \brief Remove data from the dict (arbitrary key)
343 * \param dict the trash can
344 * \param key the key of the data to be removed
345 * \param key_len the size of the \a key
347 * Remove the entry associated with the given \a key (throws not_found)
349 void xbt_dict_remove_ext(xbt_dict_t dict, const char *key, int key_len)
351 unsigned int hash_code = xbt_str_hash_ext(key, key_len);
352 xbt_dictelm_t previous = nullptr;
353 xbt_dictelm_t current = dict->table[hash_code & dict->table_size];
355 while (current != nullptr && (hash_code != current->hash_code || key_len != current->key_len
356 || strncmp(key, current->key, key_len))) {
357 previous = current; /* save the previous node */
358 current = current->next;
361 if (current == nullptr)
362 THROWF(not_found_error, 0, "key %.*s not found", key_len, key);
364 if (previous != nullptr) {
365 previous->next = current->next;
367 dict->table[hash_code & dict->table_size] = current->next;
370 if (!dict->table[hash_code & dict->table_size])
373 xbt_dictelm_free(dict, current);
378 * \brief Remove data from the dict (null-terminated key)
380 * \param dict the dict
381 * \param key the key of the data to be removed
383 * Remove the entry associated with the given \a key
385 void xbt_dict_remove(xbt_dict_t dict, const char *key)
387 xbt_dict_remove_ext(dict, key, strlen(key));
390 /** @brief Remove all data from the dict */
391 void xbt_dict_reset(xbt_dict_t dict)
393 if (dict->count == 0)
396 for (int i = 0; i <= dict->table_size; i++) {
397 xbt_dictelm_t previous = nullptr;
398 xbt_dictelm_t current = dict->table[i];
399 while (current != nullptr) {
401 current = current->next;
402 xbt_dictelm_free(dict, previous);
404 dict->table[i] = nullptr;
412 * \brief Return the number of elements in the dict.
413 * \param dict a dictionary
415 int xbt_dict_length(xbt_dict_t dict)
420 /** @brief function to be used in xbt_dict_dump as long as the stored values are strings */
421 void xbt_dict_dump_output_string(void *s)
423 fputs((char*) s, stdout);
427 * \brief test if the dict is empty or not
429 int xbt_dict_is_empty(xbt_dict_t dict)
431 return !dict || (xbt_dict_length(dict) == 0);
435 * \brief Outputs the content of the structure (debugging purpose)
437 * \param dict the exibitionist
438 * \param output a function to dump each data in the tree (check @ref xbt_dict_dump_output_string)
440 * Outputs the content of the structure. (for debugging purpose). \a output is a function to output the data. If nullptr,
441 * data won't be displayed.
443 void xbt_dict_dump(xbt_dict_t dict, void_f_pvoid_t output)
446 xbt_dictelm_t element;
447 printf("Dict %p:\n", dict);
448 if (dict != nullptr) {
449 for (i = 0; i < dict->table_size; i++) {
450 element = dict->table[i];
453 while (element != nullptr) {
454 printf(" %s -> '", element->key);
455 if (output != nullptr) {
456 output(element->content);
459 element = element->next;
469 xbt_dynar_t all_sizes = nullptr;
470 /** @brief shows some debugging info about the bucklet repartition */
471 void xbt_dict_dump_sizes(xbt_dict_t dict)
476 printf("Dict %p: %d bucklets, %d used cells (of %d) ", dict, dict->count, dict->fill, dict->table_size);
482 xbt_dynar_t sizes = xbt_dynar_new(sizeof(int), nullptr);
484 for (int i = 0; i < dict->table_size; i++) {
485 xbt_dictelm_t element = dict->table[i];
488 while (element != nullptr) {
490 element = element->next;
493 if (xbt_dynar_length(sizes) <= size) {
495 xbt_dynar_set(sizes, size, &prevsize);
498 xbt_dynar_get_cpy(sizes, size, &prevsize);
500 xbt_dynar_set(sizes, size, &prevsize);
504 all_sizes = xbt_dynar_new(sizeof(int), nullptr);
506 xbt_dynar_foreach(sizes, count, size) {
507 /* Copy values of this one into all_sizes */
509 if (xbt_dynar_length(all_sizes) <= count) {
511 xbt_dynar_set(all_sizes, count, &prevcount);
513 xbt_dynar_get_cpy(all_sizes, count, &prevcount);
515 xbt_dynar_set(all_sizes, count, &prevcount);
518 /* Report current sizes */
523 printf("%uelm x %u cells; ", count, size);
526 xbt_dynar_free(&sizes);
530 * Create the dict mallocators.
531 * This is an internal XBT function called during the lib initialization.
532 * It can be used several times to recreate the mallocator, for example when you switch to MC mode
534 void xbt_dict_preinit()
536 if (dict_elm_mallocator == nullptr)
537 dict_elm_mallocator = xbt_mallocator_new(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(256, dict_het_elm_mallocator_new_f, dict_het_elm_mallocator_free_f,
541 dict_het_elm_mallocator_reset_f);
545 * Destroy the dict mallocators.
546 * This is an internal XBT function during the lib initialization
548 void xbt_dict_postexit()
550 if (dict_elm_mallocator != nullptr) {
551 xbt_mallocator_free(dict_elm_mallocator);
552 dict_elm_mallocator = nullptr;
553 xbt_mallocator_free(dict_het_elm_mallocator);
554 dict_het_elm_mallocator = nullptr;
561 printf("Overall stats:");
562 xbt_dynar_foreach(all_sizes, count, size) {
567 printf("%uelm x %d cells; ", count, size);
571 printf("; %f elm per cell\n", avg / (double) total_count);
579 #include <xbt/ex.hpp>
580 #include "src/internal_config.h"
582 XBT_LOG_EXTERNAL_DEFAULT_CATEGORY(xbt_dict);
584 XBT_TEST_SUITE("dict", "Dict data container");
586 static void debugged_add_ext(xbt_dict_t head, const char* key, const char* data_to_fill)
588 char *data = xbt_strdup(data_to_fill);
590 xbt_test_log("Add %s under %s", data_to_fill, key);
592 xbt_dict_set(head, key, data, nullptr);
593 if (XBT_LOG_ISENABLED(xbt_dict, xbt_log_priority_debug)) {
594 xbt_dict_dump(head, (void (*)(void *)) &printf);
599 static void debugged_add(xbt_dict_t head, const char* key)
601 debugged_add_ext(head, key, key);
604 static xbt_dict_t new_fixture(void)
606 xbt_test_add("Fill in the dictionnary");
608 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
609 debugged_add(head, "12");
610 debugged_add(head, "12a");
611 debugged_add(head, "12b");
612 debugged_add(head, "123");
613 debugged_add(head, "123456");
614 debugged_add(head, "1234");
615 debugged_add(head, "123457");
620 static void search_ext(xbt_dict_t head, const char *key, const char *data)
622 xbt_test_add("Search %s", key);
623 char *found = (char*) xbt_dict_get(head, key);
624 xbt_test_log("Found %s", found);
626 xbt_test_assert(found, "data do not match expectations: found nullptr while searching for %s", data);
628 xbt_test_assert(!strcmp(data, found), "data do not match expectations: found %s while searching for %s",
631 xbt_test_assert(!found, "data do not match expectations: found %s while searching for nullptr", found);
635 static void search(xbt_dict_t head, const char *key)
637 search_ext(head, key, key);
640 static void debugged_remove(xbt_dict_t head, const char* key)
642 xbt_test_add("Remove '%s'", key);
643 xbt_dict_remove(head, key);
644 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
647 static void traverse(xbt_dict_t head)
649 xbt_dict_cursor_t cursor = nullptr;
654 xbt_dict_foreach(head, cursor, key, data) {
655 if (!key || !data || strcmp(key, data)) {
656 xbt_test_log("Seen #%d: %s->%s", ++i, key, data);
658 xbt_test_log("Seen #%d: %s", ++i, key);
660 xbt_test_assert(!data || !strcmp(key, data), "Key(%s) != value(%s). Aborting", key, data);
664 static void search_not_found(xbt_dict_t head, const char *data)
667 xbt_test_add("Search %s (expected not to be found)", data);
670 data = (const char*) xbt_dict_get(head, data);
671 THROWF(unknown_error, 0, "Found something which shouldn't be there (%s)", data);
674 if (e.category != not_found_error)
675 xbt_test_exception(e);
678 xbt_test_assert(ok, "Exception not raised");
681 static void count(xbt_dict_t dict, int length)
683 xbt_test_add("Count elements (expecting %d)", length);
684 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
686 xbt_dict_cursor_t cursor;
690 xbt_dict_foreach(dict, cursor, key, data)
693 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
696 static void count_check_get_key(xbt_dict_t dict, int length)
698 xbt_dict_cursor_t cursor;
703 xbt_test_add("Count elements (expecting %d), and test the getkey function", length);
704 xbt_test_assert(xbt_dict_length(dict) == length, "Announced length(%d) != %d.", xbt_dict_length(dict), length);
706 xbt_dict_foreach(dict, cursor, key, data) {
708 char* key2 = xbt_dict_get_key(dict, data);
709 xbt_assert(!strcmp(key, key2), "The data was registered under %s instead of %s as expected", key2, key);
712 xbt_test_assert(effective == length, "Effective length(%d) != %d.", effective, length);
715 XBT_TEST_UNIT("basic", test_dict_basic, "Basic usage: change, retrieve and traverse homogeneous dicts")
717 xbt_test_add("Traversal the null dictionary");
720 xbt_test_add("Traversal and search the empty dictionary");
721 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
724 debugged_remove(head, "12346");
727 if (e.category != not_found_error)
728 xbt_test_exception(e);
730 xbt_dict_free(&head);
732 xbt_test_add("Traverse the full dictionary");
733 head = new_fixture();
734 count_check_get_key(head, 7);
736 debugged_add_ext(head, "toto", "tutu");
737 search_ext(head, "toto", "tutu");
738 debugged_remove(head, "toto");
743 xbt_test_add("Free the dictionary (twice)");
744 xbt_dict_free(&head);
745 xbt_dict_free(&head);
748 head = new_fixture();
749 count_check_get_key(head, 7);
750 xbt_test_add("Change 123 to 'Changed 123'");
751 xbt_dict_set(head, "123", xbt_strdup("Changed 123"), nullptr);
752 count_check_get_key(head, 7);
754 xbt_test_add("Change 123 back to '123'");
755 xbt_dict_set(head, "123", xbt_strdup("123"), nullptr);
756 count_check_get_key(head, 7);
758 xbt_test_add("Change 12a to 'Dummy 12a'");
759 xbt_dict_set(head, "12a", xbt_strdup("Dummy 12a"), nullptr);
760 count_check_get_key(head, 7);
762 xbt_test_add("Change 12a to '12a'");
763 xbt_dict_set(head, "12a", xbt_strdup("12a"), nullptr);
764 count_check_get_key(head, 7);
766 xbt_test_add("Traverse the resulting dictionary");
770 xbt_test_add("Search 123");
771 char* data = (char*)xbt_dict_get(head, "123");
772 xbt_test_assert(data);
773 xbt_test_assert(!strcmp("123", data));
775 search_not_found(head, "Can't be found");
776 search_not_found(head, "123 Can't be found");
777 search_not_found(head, "12345678 NOT");
782 search(head, "123456");
783 search(head, "1234");
784 search(head, "123457");
786 xbt_test_add("Traverse the resulting dictionary");
789 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
791 xbt_test_add("Free the dictionary twice");
792 xbt_dict_free(&head);
793 xbt_dict_free(&head);
795 xbt_test_add("Traverse the resulting dictionary");
799 XBT_TEST_UNIT("remove_homogeneous", test_dict_remove, "Removing some values from homogeneous dicts")
801 xbt_dict_t head = new_fixture();
803 xbt_test_add("Remove non existing data");
805 debugged_remove(head, "Does not exist");
808 if (e.category != not_found_error)
809 xbt_test_exception(e);
813 xbt_dict_free(&head);
815 xbt_test_add("Remove each data manually (traversing the resulting dictionary each time)");
816 head = new_fixture();
817 debugged_remove(head, "12a");
820 debugged_remove(head, "12b");
823 debugged_remove(head, "12");
826 debugged_remove(head, "123456");
830 debugged_remove(head, "12346");
833 if (e.category != not_found_error)
834 xbt_test_exception(e);
837 debugged_remove(head, "1234");
839 debugged_remove(head, "123457");
841 debugged_remove(head, "123");
844 debugged_remove(head, "12346");
847 if (e.category != not_found_error)
848 xbt_test_exception(e);
852 xbt_test_add("Free dict, create new fresh one, and then reset the dict");
853 xbt_dict_free(&head);
854 head = new_fixture();
855 xbt_dict_reset(head);
859 xbt_test_add("Free the dictionary twice");
860 xbt_dict_free(&head);
861 xbt_dict_free(&head);
864 XBT_TEST_UNIT("nulldata", test_dict_nulldata, "nullptr data management")
866 xbt_dict_t head = new_fixture();
868 xbt_test_add("Store nullptr under 'null'");
869 xbt_dict_set(head, "null", nullptr, nullptr);
870 search_ext(head, "null", nullptr);
872 xbt_test_add("Check whether I see it while traversing...");
874 xbt_dict_cursor_t cursor = nullptr;
879 xbt_dict_foreach(head, cursor, key, data) {
880 if (!key || !data || strcmp(key, data)) {
881 xbt_test_log("Seen: %s->%s", key, data);
883 xbt_test_log("Seen: %s", key);
886 if (!strcmp(key, "null"))
889 xbt_test_assert(found, "the key 'null', associated to nullptr is not found");
891 xbt_dict_free(&head);
895 #define SIZEOFKEY 1024
896 static int countelems(xbt_dict_t head)
898 xbt_dict_cursor_t cursor;
903 xbt_dict_foreach(head, cursor, key, data) {
909 XBT_TEST_UNIT("crash", test_dict_crash, "Crash test")
911 srand((unsigned int) time(nullptr));
913 for (int i = 0; i < 10; i++) {
914 xbt_test_add("CRASH test number %d (%d to go)", i + 1, 10 - i - 1);
915 xbt_test_log("Fill the struct, count its elems and frees the structure");
916 xbt_test_log("using 1000 elements with %d chars long randomized keys.", SIZEOFKEY);
917 xbt_dict_t head = xbt_dict_new_homogeneous(free);
918 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
919 for (int j = 0; j < 1000; j++) {
920 char* data = nullptr;
921 char* key = (char*)xbt_malloc(SIZEOFKEY);
924 for (int k = 0; k < SIZEOFKEY - 1; k++)
925 key[k] = rand() % ('z' - 'a') + 'a';
926 key[SIZEOFKEY - 1] = '\0';
927 /* printf("[%d %s]\n",j,key); */
928 data = (char*) xbt_dict_get_or_null(head, key);
929 } while (data != nullptr);
931 xbt_dict_set(head, key, key, nullptr);
932 data = (char*) xbt_dict_get(head, key);
933 xbt_test_assert(!strcmp(key, data), "Retrieved value (%s) != Injected value (%s)", key, data);
937 /* xbt_dict_dump(head,(void (*)(void*))&printf); */
939 xbt_dict_free(&head);
940 xbt_dict_free(&head);
943 xbt_dict_t head = xbt_dict_new_homogeneous(&free);
944 xbt_test_add("Fill %d elements, with keys being the number of element", NB_ELM);
945 for (int j = 0; j < NB_ELM; j++) {
946 /* if (!(j%1000)) { printf("."); fflush(stdout); } */
947 char* key = (char*)xbt_malloc(10);
949 snprintf(key,10, "%d", j);
950 xbt_dict_set(head, key, key, nullptr);
952 /*xbt_dict_dump(head,(void (*)(void*))&printf); */
954 xbt_test_add("Count the elements (retrieving the key and data for each)");
955 xbt_test_log("There is %d elements", countelems(head));
957 xbt_test_add("Search my %d elements 20 times", NB_ELM);
958 char* key = (char*)xbt_malloc(10);
959 for (int i = 0; i < 20; i++) {
960 /* if (i%10) printf("."); else printf("%d",i/10); fflush(stdout); */
961 for (int j = 0; j < NB_ELM; j++) {
962 snprintf(key,10, "%d", j);
963 void* data = xbt_dict_get(head, key);
964 xbt_test_assert(!strcmp(key, (char *) data), "with get, key=%s != data=%s", key, (char *) data);
965 data = xbt_dict_get_ext(head, key, strlen(key));
966 xbt_test_assert(!strcmp(key, (char *) data), "with get_ext, key=%s != data=%s", key, (char *) data);
971 xbt_test_add("Remove my %d elements", NB_ELM);
972 key = (char*) xbt_malloc(10);
973 for (int j = 0; j < NB_ELM; j++) {
974 /* if (!(j%10000)) printf("."); fflush(stdout); */
975 snprintf(key,10, "%d", j);
976 xbt_dict_remove(head, key);
980 xbt_test_add("Free the object (twice)");
981 xbt_dict_free(&head);
982 xbt_dict_free(&head);
985 XBT_TEST_UNIT("ext", test_dict_int, "Test dictionnary with int keys")
987 xbt_dict_t dict = xbt_dict_new_homogeneous(nullptr);
990 xbt_test_add("Insert elements");
991 for (int i = 0; i < count; ++i)
992 xbt_dict_set_ext(dict, (char*) &i, sizeof(i), (void*) (intptr_t) i, nullptr);
993 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Bad number of elements in the dictionnary");
995 xbt_test_add("Check elements");
996 for (int i = 0; i < count; ++i) {
997 int res = (int) (intptr_t) xbt_dict_get_ext(dict, (char*) &i, sizeof(i));
998 xbt_test_assert(xbt_dict_size(dict) == (unsigned) count, "Unexpected value at index %i, expected %i but was %i", i, i, res);
1001 xbt_test_add("Free the array");
1002 xbt_dict_free(&dict);
1004 #endif /* SIMGRID_TEST */