1 /* a generic DYNamic ARray implementation. */
3 /* Copyright (c) 2004, 2005, 2006, 2007, 2008, 2009, 2010. 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 #include "portable.h" /* SIZEOF_MAX */
11 #include "xbt/sysdep.h"
14 #include "xbt/dynar.h"
15 #include <sys/types.h>
17 /* IMPLEMENTATION NOTE ON SYNCHRONIZATION: every functions which name is prefixed by _
18 * assumes that the dynar is already locked if we have to.
19 * Other functions (public ones) check for this.
22 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dyn, xbt, "Dynamic arrays");
24 static XBT_INLINE void _dynar_lock(xbt_dynar_t dynar)
27 xbt_mutex_acquire(dynar->mutex);
30 static XBT_INLINE void _dynar_unlock(xbt_dynar_t dynar)
33 xbt_mutex_release(dynar->mutex);
36 static XBT_INLINE void _sanity_check_dynar(xbt_dynar_t dynar)
38 xbt_assert(dynar, "dynar is NULL");
41 static XBT_INLINE void _sanity_check_idx(int idx)
43 xbt_assert(idx >= 0, "dynar idx(=%d) < 0", (int) (idx));
46 static XBT_INLINE void _check_inbound_idx(xbt_dynar_t dynar, int idx)
48 if (idx < 0 || idx >= dynar->used) {
50 THROWF(bound_error, idx,
51 "dynar is not that long. You asked %d, but it's only %lu long",
52 (int) (idx), (unsigned long) dynar->used);
56 static XBT_INLINE void _check_sloppy_inbound_idx(xbt_dynar_t dynar,
59 if (idx > dynar->used) {
61 THROWF(bound_error, idx,
62 "dynar is not that long. You asked %d, but it's only %lu long (could have been equal to it)",
63 (int) (idx), (unsigned long) dynar->used);
67 static XBT_INLINE void _check_populated_dynar(xbt_dynar_t dynar)
69 if (dynar->used == 0) {
71 THROWF(bound_error, 0, "dynar %p is empty", dynar);
75 static void _dynar_map(const xbt_dynar_t dynar, void_f_pvoid_t const op);
78 void _xbt_clear_mem(void *const ptr, const unsigned long length)
80 memset(ptr, 0, length);
84 void _xbt_dynar_expand(xbt_dynar_t const dynar, const unsigned long nb)
86 const unsigned long old_size = dynar->size;
89 void *const old_data = dynar->data;
90 const unsigned long elmsize = dynar->elmsize;
91 const unsigned long old_length = old_size * elmsize;
93 const unsigned long expand = 2 * (old_size + 1);
94 const unsigned long new_size = (nb > expand ? nb : expand);
95 const unsigned long new_length = new_size * elmsize;
96 void *const new_data = xbt_realloc(old_data, new_length);
98 XBT_DEBUG("expand %p from %lu to %lu elements", dynar, old_size, new_size);
100 _xbt_clear_mem((char *)new_data + old_length, new_length - old_length);
102 dynar->size = new_size;
103 dynar->data = new_data;
108 void *_xbt_dynar_elm(const xbt_dynar_t dynar, const unsigned long idx)
110 char *const data = (char *) dynar->data;
111 const unsigned long elmsize = dynar->elmsize;
113 return data + idx * elmsize;
118 _xbt_dynar_get_elm(void *const dst,
119 const xbt_dynar_t dynar, const unsigned long idx)
121 void *const elm = _xbt_dynar_elm(dynar, idx);
123 memcpy(dst, elm, dynar->elmsize);
128 _xbt_dynar_put_elm(const xbt_dynar_t dynar,
129 const unsigned long idx, const void *const src)
131 void *const elm = _xbt_dynar_elm(dynar, idx);
132 const unsigned long elmsize = dynar->elmsize;
134 memcpy(elm, src, elmsize);
139 _xbt_dynar_remove_at(xbt_dynar_t const dynar,
140 const unsigned long idx, void *const object)
143 unsigned long nb_shift;
144 unsigned long offset;
146 _sanity_check_dynar(dynar);
147 _check_inbound_idx(dynar, idx);
150 _xbt_dynar_get_elm(object, dynar, idx);
151 } else if (dynar->free_f) {
152 if (dynar->elmsize <= SIZEOF_MAX) {
153 char elm[SIZEOF_MAX];
154 _xbt_dynar_get_elm(elm, dynar, idx);
157 char *elm = malloc(dynar->elmsize);
158 _xbt_dynar_get_elm(elm, dynar, idx);
164 nb_shift = dynar->used - 1 - idx;
167 offset = nb_shift * dynar->elmsize;
168 memmove(_xbt_dynar_elm(dynar, idx), _xbt_dynar_elm(dynar, idx + 1),
175 void xbt_dynar_dump(xbt_dynar_t dynar)
177 XBT_INFO("Dynar dump: size=%lu; used=%lu; elmsize=%lu; data=%p; free_f=%p",
178 dynar->size, dynar->used, dynar->elmsize, dynar->data,
182 /** @brief Constructor
184 * \param elmsize size of each element in the dynar
185 * \param free_f function to call each time we want to get rid of an element (or NULL if nothing to do).
187 * Creates a new dynar. If a free_func is provided, the elements have to be
188 * pointer of pointer. That is to say that dynars can contain either base
189 * types (int, char, double, etc) or pointer of pointers (struct **).
192 xbt_dynar_new(const unsigned long elmsize, void_f_pvoid_t const free_f)
195 xbt_dynar_t dynar = xbt_new0(s_xbt_dynar_t, 1);
199 dynar->elmsize = elmsize;
201 dynar->free_f = free_f;
207 /** @brief Creates a synchronized dynar.
209 * Just like #xbt_dynar_new, but each access to the structure will be protected by a mutex
213 xbt_dynar_new_sync(const unsigned long elmsize,
214 void_f_pvoid_t const free_f)
216 xbt_dynar_t res = xbt_dynar_new(elmsize, free_f);
217 res->mutex = xbt_mutex_init();
221 /** @brief Destructor of the structure not touching to the content
223 * \param dynar poor victim
225 * kilkil a dynar BUT NOT its content. Ie, the array is freed, but the content
226 * is not touched (the \a free_f function is not used)
228 void xbt_dynar_free_container(xbt_dynar_t * dynar)
230 if (dynar && *dynar) {
231 xbt_dynar_t d = *dynar;
234 xbt_mutex_destroy(d->mutex);
240 /** @brief Frees the content and set the size to 0
242 * \param dynar who to squeeze
244 XBT_INLINE void xbt_dynar_reset(xbt_dynar_t const dynar)
248 _sanity_check_dynar(dynar);
250 XBT_DEBUG("Reset the dynar %p", (void *) dynar);
252 _dynar_map(dynar, dynar->free_f);
261 _dynar_unlock(dynar);
263 /* dynar->data = NULL; */
267 * \brief Shrink the dynar by removing empty slots at the end of the internal array
268 * \param dynar a dynar
269 * \param empty_slots_wanted number of empty slots you want to keep at the end of the
270 * internal array for further insertions
272 * Reduces the internal array size of the dynar to the number of elements plus
273 * \a empty_slots_wanted.
274 * After removing elements from the dynar, you can call this function to make
275 * the dynar use less memory.
276 * Set \a empty_slots_wanted to zero to reduce the dynar internal array as much
278 * Note that if \a empty_slots_wanted is greater than the array size, the internal
279 * array is expanded instead of shriked.
281 void xbt_dynar_shrink(xbt_dynar_t dynar, int empty_slots_wanted)
283 unsigned long size_wanted;
287 size_wanted = dynar->used + empty_slots_wanted;
288 if (size_wanted != dynar->size) {
289 dynar->size = size_wanted;
290 dynar->data = xbt_realloc(dynar->data, dynar->elmsize * dynar->size);
292 _dynar_unlock(dynar);
295 /** @brief Destructor
297 * \param dynar poor victim
299 * kilkil a dynar and its content
302 XBT_INLINE void xbt_dynar_free(xbt_dynar_t * dynar)
304 if (dynar && *dynar) {
305 xbt_dynar_reset(*dynar);
306 xbt_dynar_free_container(dynar);
310 /** \brief free a dynar passed as void* (handy to store dynar in dynars or dict) */
311 void xbt_dynar_free_voidp(void *d)
313 xbt_dynar_t dynar = (xbt_dynar_t)d;
314 xbt_dynar_free(&dynar);
317 /** @brief Count of dynar's elements
319 * \param dynar the dynar we want to mesure
321 XBT_INLINE unsigned long xbt_dynar_length(const xbt_dynar_t dynar)
323 return (dynar ? (unsigned long) dynar->used : (unsigned long) 0);
326 /**@brief check if a dynar is empty
328 *\param dynar the dynat we want to check
331 XBT_INLINE int xbt_dynar_is_empty(const xbt_dynar_t dynar)
333 return (xbt_dynar_length(dynar) == 0);
336 /** @brief Retrieve a copy of the Nth element of a dynar.
338 * \param dynar information dealer
339 * \param idx index of the slot we want to retrieve
340 * \param[out] dst where to put the result to.
343 xbt_dynar_get_cpy(const xbt_dynar_t dynar,
344 const unsigned long idx, void *const dst)
347 _sanity_check_dynar(dynar);
348 _check_inbound_idx(dynar, idx);
350 _xbt_dynar_get_elm(dst, dynar, idx);
351 _dynar_unlock(dynar);
354 /** @brief Retrieve a pointer to the Nth element of a dynar.
356 * \param dynar information dealer
357 * \param idx index of the slot we want to retrieve
358 * \return the \a idx-th element of \a dynar.
360 * \warning The returned value is the actual content of the dynar.
361 * Make a copy before fooling with it.
363 XBT_INLINE void *xbt_dynar_get_ptr(const xbt_dynar_t dynar,
364 const unsigned long idx)
369 _sanity_check_dynar(dynar);
370 _check_inbound_idx(dynar, idx);
372 res = _xbt_dynar_elm(dynar, idx);
373 _dynar_unlock(dynar);
377 XBT_INLINE void *xbt_dynar_set_at_ptr(const xbt_dynar_t dynar,
378 const unsigned long idx)
383 _sanity_check_dynar(dynar);
385 if (idx >= dynar->used) {
386 _xbt_dynar_expand(dynar, idx + 1);
387 _xbt_clear_mem(((char * const)dynar->data) + dynar->used * dynar->elmsize,
388 (idx + 1 - dynar->used)*dynar->elmsize);
389 dynar->used = idx + 1;
391 res = _xbt_dynar_elm(dynar, idx);
393 _dynar_unlock(dynar);
398 static void XBT_INLINE /* not synchronized */
399 _xbt_dynar_set(xbt_dynar_t dynar,
400 const unsigned long idx, const void *const src)
403 _sanity_check_dynar(dynar);
405 if (idx >= dynar->used) {
406 _xbt_dynar_expand(dynar, idx + 1);
407 _xbt_clear_mem(((char * const)dynar->data) + dynar->used * dynar->elmsize,
408 (idx + 1 - dynar->used)*dynar->elmsize);
409 dynar->used = idx + 1;
412 _xbt_dynar_put_elm(dynar, idx, src);
415 /** @brief Set the Nth element of a dynar (expanded if needed). Previous value at this position is NOT freed
417 * \param dynar information dealer
418 * \param idx index of the slot we want to modify
419 * \param src What will be feeded to the dynar
421 * If you want to free the previous content, use xbt_dynar_replace().
423 XBT_INLINE void xbt_dynar_set(xbt_dynar_t dynar, const int idx,
424 const void *const src)
428 _xbt_dynar_set(dynar, idx, src);
429 _dynar_unlock(dynar);
432 /** @brief Set the Nth element of a dynar (expanded if needed). Previous value is freed
438 * Set the Nth element of a dynar, expanding the dynar if needed, AND DO
439 * free the previous value at this position. If you don't want to free the
440 * previous content, use xbt_dynar_set().
443 xbt_dynar_replace(xbt_dynar_t dynar,
444 const unsigned long idx, const void *const object)
447 _sanity_check_dynar(dynar);
449 if (idx < dynar->used && dynar->free_f) {
450 void *const old_object = _xbt_dynar_elm(dynar, idx);
452 dynar->free_f(old_object);
455 _xbt_dynar_set(dynar, idx, object);
456 _dynar_unlock(dynar);
459 static XBT_INLINE void *_xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar,
460 const unsigned long idx)
463 unsigned long old_used;
464 unsigned long new_used;
467 _sanity_check_dynar(dynar);
468 _sanity_check_idx(idx);
470 old_used = dynar->used;
471 new_used = old_used + 1;
473 _xbt_dynar_expand(dynar, new_used);
475 nb_shift = old_used - idx;
478 memmove(_xbt_dynar_elm(dynar, idx + 1),
479 _xbt_dynar_elm(dynar, idx), nb_shift * dynar->elmsize);
482 dynar->used = new_used;
483 res = _xbt_dynar_elm(dynar, idx);
487 /** @brief Make room for a new element, and return a pointer to it
489 * You can then use regular affectation to set its value instead of relying
490 * on the slow memcpy. This is what xbt_dynar_insert_at_as() does.
492 void *xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar, const int idx)
497 res = _xbt_dynar_insert_at_ptr(dynar, idx);
498 _dynar_unlock(dynar);
502 /** @brief Set the Nth dynar's element, expanding the dynar and sliding the previous values to the right
504 * Set the Nth element of a dynar, expanding the dynar if needed, and
505 * moving the previously existing value and all subsequent ones to one
506 * position right in the dynar.
509 xbt_dynar_insert_at(xbt_dynar_t const dynar,
510 const int idx, const void *const src)
514 /* checks done in xbt_dynar_insert_at_ptr */
515 memcpy(_xbt_dynar_insert_at_ptr(dynar, idx), src, dynar->elmsize);
516 _dynar_unlock(dynar);
519 /** @brief Remove the Nth dynar's element, sliding the previous values to the left
521 * Get the Nth element of a dynar, removing it from the dynar and moving
522 * all subsequent values to one position left in the dynar.
524 * If the object argument of this function is a non-null pointer, the removed
525 * element is copied to this address. If not, the element is freed using the
526 * free_f function passed at dynar creation.
529 xbt_dynar_remove_at(xbt_dynar_t const dynar,
530 const int idx, void *const object)
534 _xbt_dynar_remove_at(dynar, idx, object);
535 _dynar_unlock(dynar);
538 /** @brief Returns the position of the element in the dynar
540 * Raises not_found_error if not found.
542 unsigned int xbt_dynar_search(xbt_dynar_t const dynar, void *const elem)
547 for (it = 0; it < dynar->used; it++)
548 if (!memcmp(_xbt_dynar_elm(dynar, it), elem, dynar->elmsize)) {
549 _dynar_unlock(dynar);
553 _dynar_unlock(dynar);
554 THROWF(not_found_error, 0, "Element %p not part of dynar %p", elem,
558 /** @brief Returns a boolean indicating whether the element is part of the dynar */
559 int xbt_dynar_member(xbt_dynar_t const dynar, void *const elem)
565 xbt_dynar_search(dynar, elem);
568 if (e.category == not_found_error) {
577 /** @brief Make room at the end of the dynar for a new element, and return a pointer to it.
579 * You can then use regular affectation to set its value instead of relying
580 * on the slow memcpy. This is what xbt_dynar_push_as() does.
582 XBT_INLINE void *xbt_dynar_push_ptr(xbt_dynar_t const dynar)
586 /* we have to inline xbt_dynar_insert_at_ptr here to make sure that
587 dynar->used don't change between reading it and getting the lock
588 within xbt_dynar_insert_at_ptr */
590 res = _xbt_dynar_insert_at_ptr(dynar, dynar->used);
591 _dynar_unlock(dynar);
595 /** @brief Add an element at the end of the dynar */
596 XBT_INLINE void xbt_dynar_push(xbt_dynar_t const dynar,
597 const void *const src)
600 /* checks done in xbt_dynar_insert_at_ptr */
601 memcpy(_xbt_dynar_insert_at_ptr(dynar, dynar->used), src,
603 _dynar_unlock(dynar);
606 /** @brief Mark the last dynar's element as unused and return a pointer to it.
608 * You can then use regular affectation to set its value instead of relying
609 * on the slow memcpy. This is what xbt_dynar_pop_as() does.
611 XBT_INLINE void *xbt_dynar_pop_ptr(xbt_dynar_t const dynar)
616 _check_populated_dynar(dynar);
617 XBT_DEBUG("Pop %p", (void *) dynar);
619 res = _xbt_dynar_elm(dynar, dynar->used);
620 _dynar_unlock(dynar);
624 /** @brief Get and remove the last element of the dynar */
625 XBT_INLINE void xbt_dynar_pop(xbt_dynar_t const dynar, void *const dst)
628 /* sanity checks done by remove_at */
629 XBT_DEBUG("Pop %p", (void *) dynar);
631 _xbt_dynar_remove_at(dynar, dynar->used - 1, dst);
632 _dynar_unlock(dynar);
635 /** @brief Add an element at the begining of the dynar.
637 * This is less efficient than xbt_dynar_push()
639 XBT_INLINE void xbt_dynar_unshift(xbt_dynar_t const dynar,
640 const void *const src)
643 /* sanity checks done by insert_at */
644 xbt_dynar_insert_at(dynar, 0, src);
647 /** @brief Get and remove the first element of the dynar.
649 * This is less efficient than xbt_dynar_pop()
651 XBT_INLINE void xbt_dynar_shift(xbt_dynar_t const dynar, void *const dst)
654 /* sanity checks done by remove_at */
655 xbt_dynar_remove_at(dynar, 0, dst);
658 static void _dynar_map(const xbt_dynar_t dynar, void_f_pvoid_t const op)
660 char *const data = (char *) dynar->data;
661 const unsigned long elmsize = dynar->elmsize;
662 const unsigned long used = dynar->used;
665 for (i = 0; i < used; i++) {
666 char* elm = (char*) data + i * elmsize;
671 /** @brief Apply a function to each member of a dynar
673 * The mapped function may change the value of the element itself,
674 * but should not mess with the structure of the dynar.
676 * If the dynar is synchronized, it is locked during the whole map
677 * operation, so make sure your function don't call any function
678 * from xbt_dynar_* on it, or you'll get a deadlock.
680 XBT_INLINE void xbt_dynar_map(const xbt_dynar_t dynar,
681 void_f_pvoid_t const op)
684 _sanity_check_dynar(dynar);
687 _dynar_map(dynar, op);
689 _dynar_unlock(dynar);
693 /** @brief Removes and free the entry pointed by the cursor
695 * This function can be used while traversing without problem.
697 XBT_INLINE void xbt_dynar_cursor_rm(xbt_dynar_t dynar,
698 unsigned int *const cursor)
701 _xbt_dynar_remove_at(dynar, (*cursor)--, NULL);
704 /** @brief Unlocks a synchronized dynar when you want to break the traversal
706 * This function must be used if you <tt>break</tt> the
707 * xbt_dynar_foreach loop, but shouldn't be called at the end of a
708 * regular traversal reaching the end of the elements
710 XBT_INLINE void xbt_dynar_cursor_unlock(xbt_dynar_t dynar)
712 _dynar_unlock(dynar);
715 /** @brief Sorts a dynar according to the function <tt>compar_fn</tt>
717 * \param dynar the dynar to sort
718 * \param compar_fn comparison function of type (int (compar_fn*) (void*) (void*)).
720 * Remark: if the elements stored in the dynar are structures, the compar_fn
721 * function has to retrieve the field to sort first.
723 XBT_INLINE void xbt_dynar_sort(xbt_dynar_t dynar,
724 int_f_cpvoid_cpvoid_t compar_fn)
729 #ifdef HAVE_MERGESORT
730 mergesort(dynar->data, dynar->used, dynar->elmsize, compar_fn);
732 qsort(dynar->data, dynar->used, dynar->elmsize, compar_fn);
734 _dynar_unlock(dynar);
737 /** @brief Transform a dynar into a NULL terminated array
739 * \param dynar the dynar to transform
741 XBT_INLINE void * xbt_dynar_to_array (xbt_dynar_t dynar)
744 void * last = xbt_new0(char,dynar->elmsize);
745 xbt_dynar_push(dynar, last);
753 * Return 0 if d1 and d2 are equal and 1 if not equal
755 XBT_INLINE int xbt_dynar_compare(xbt_dynar_t d1, xbt_dynar_t d2,
756 int(*compar)(const void *, const void *))
760 if((!d1) && (!d2)) return 0;
763 XBT_DEBUG("NULL dynar d1=%p d2=%p",d1,d2);
767 if((d1->elmsize)!=(d2->elmsize))
769 XBT_DEBUG("Size of elmsize d1=%ld d2=%ld",d1->elmsize,d2->elmsize);
773 if(xbt_dynar_length(d1) != xbt_dynar_length(d2))
775 XBT_DEBUG("Size of dynar d1=%ld d2=%ld",xbt_dynar_length(d1),xbt_dynar_length(d2));
780 size = xbt_dynar_length(d1);
783 void *data1 = xbt_dynar_get_as(d1, i, void *);
784 void *data2 = xbt_dynar_get_as(d2, i, void *);
785 XBT_DEBUG("link[%d] d1=%p d2=%p",i,data1,data2);
786 if(compar(data1,data2)){
799 XBT_TEST_SUITE("dynar", "Dynar data container");
800 XBT_LOG_EXTERNAL_CATEGORY(xbt_dyn);
801 XBT_LOG_DEFAULT_CATEGORY(xbt_dyn);
803 XBT_TEST_UNIT("int", test_dynar_int, "Dynars of integers")
805 /* Vars_decl [doxygen cruft] */
811 xbt_test_add("==== Traverse the empty dynar");
812 d = xbt_dynar_new(sizeof(int), NULL);
813 xbt_dynar_foreach(d, cursor, i) {
814 xbt_die( "Damnit, there is something in the empty dynar");
816 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
817 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
818 /* in your code is naturally the way to go outside a regression test */
821 ("==== Push %d int, set them again 3 times, traverse them, shift them",
823 /* Populate_ints [doxygen cruft] */
824 /* 1. Populate the dynar */
825 d = xbt_dynar_new(sizeof(int), NULL);
826 for (cpt = 0; cpt < NB_ELEM; cpt++) {
827 xbt_dynar_push_as(d, int, cpt); /* This is faster (and possible only with scalars) */
828 /* xbt_dynar_push(d,&cpt); This would also work */
829 xbt_test_log("Push %d, length=%lu", cpt, xbt_dynar_length(d));
832 /* 2. Traverse manually the dynar */
833 for (cursor = 0; cursor < NB_ELEM; cursor++) {
834 iptr = xbt_dynar_get_ptr(d, cursor);
835 xbt_test_assert(cursor == *iptr,
836 "The retrieved value is not the same than the injected one (%d!=%d)",
840 /* 3. Traverse the dynar using the neat macro to that extend */
841 xbt_dynar_foreach(d, cursor, cpt) {
842 xbt_test_assert(cursor == cpt,
843 "The retrieved value is not the same than the injected one (%d!=%d)",
846 /* end_of_traversal */
848 for (cpt = 0; cpt < NB_ELEM; cpt++)
849 *(int *) xbt_dynar_get_ptr(d, cpt) = cpt;
851 for (cpt = 0; cpt < NB_ELEM; cpt++)
852 *(int *) xbt_dynar_get_ptr(d, cpt) = cpt;
853 /* xbt_dynar_set(d,cpt,&cpt); */
855 for (cpt = 0; cpt < NB_ELEM; cpt++)
856 *(int *) xbt_dynar_get_ptr(d, cpt) = cpt;
859 xbt_dynar_foreach(d, cursor, i) {
860 xbt_test_assert(i == cpt,
861 "The retrieved value is not the same than the injected one (%d!=%d)",
865 xbt_test_assert(cpt == NB_ELEM,
866 "Cannot retrieve my %d values. Last got one is %d",
869 /* shifting [doxygen cruft] */
870 /* 4. Shift all the values */
871 for (cpt = 0; cpt < NB_ELEM; cpt++) {
872 xbt_dynar_shift(d, &i);
873 xbt_test_assert(i == cpt,
874 "The retrieved value is not the same than the injected one (%d!=%d)",
876 xbt_test_log("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
879 /* 5. Free the resources */
880 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
881 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
882 /* in your code is naturally the way to go outside a regression test */
884 xbt_test_add("==== Unshift/pop %d int", NB_ELEM);
885 d = xbt_dynar_new(sizeof(int), NULL);
886 for (cpt = 0; cpt < NB_ELEM; cpt++) {
887 xbt_dynar_unshift(d, &cpt);
888 XBT_DEBUG("Push %d, length=%lu", cpt, xbt_dynar_length(d));
890 for (cpt = 0; cpt < NB_ELEM; cpt++) {
891 i = xbt_dynar_pop_as(d, int);
892 xbt_test_assert(i == cpt,
893 "The retrieved value is not the same than the injected one (%d!=%d)",
895 xbt_test_log("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
897 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
898 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
899 /* in your code is naturally the way to go outside a regression test */
903 ("==== Push %d int, insert 1000 int in the middle, shift everything",
905 d = xbt_dynar_new(sizeof(int), NULL);
906 for (cpt = 0; cpt < NB_ELEM; cpt++) {
907 xbt_dynar_push_as(d, int, cpt);
908 XBT_DEBUG("Push %d, length=%lu", cpt, xbt_dynar_length(d));
910 for (cpt = 0; cpt < NB_ELEM/5; cpt++) {
911 xbt_dynar_insert_at_as(d, NB_ELEM/2, int, cpt);
912 XBT_DEBUG("Push %d, length=%lu", cpt, xbt_dynar_length(d));
915 for (cpt = 0; cpt < NB_ELEM/2; cpt++) {
916 xbt_dynar_shift(d, &i);
917 xbt_test_assert(i == cpt,
918 "The retrieved value is not the same than the injected one at the begining (%d!=%d)",
920 XBT_DEBUG("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
922 for (cpt = 999; cpt >= 0; cpt--) {
923 xbt_dynar_shift(d, &i);
924 xbt_test_assert(i == cpt,
925 "The retrieved value is not the same than the injected one in the middle (%d!=%d)",
928 for (cpt = 2500; cpt < NB_ELEM; cpt++) {
929 xbt_dynar_shift(d, &i);
930 xbt_test_assert(i == cpt,
931 "The retrieved value is not the same than the injected one at the end (%d!=%d)",
934 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
935 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
936 /* in your code is naturally the way to go outside a regression test */
938 xbt_test_add("==== Push %d int, remove 2000-4000. free the rest",
940 d = xbt_dynar_new(sizeof(int), NULL);
941 for (cpt = 0; cpt < NB_ELEM; cpt++)
942 xbt_dynar_push_as(d, int, cpt);
944 for (cpt = 2000; cpt < 4000; cpt++) {
945 xbt_dynar_remove_at(d, 2000, &i);
946 xbt_test_assert(i == cpt,
947 "Remove a bad value. Got %d, expected %d", i, cpt);
948 XBT_DEBUG("remove %d, length=%lu", cpt, xbt_dynar_length(d));
950 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
951 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
952 /* in your code is naturally the way to go outside a regression test */
955 /*******************************************************************************/
956 /*******************************************************************************/
957 /*******************************************************************************/
958 XBT_TEST_UNIT("insert",test_dynar_insert,"Using the xbt_dynar_insert and xbt_dynar_remove functions")
960 xbt_dynar_t d = xbt_dynar_new(sizeof(unsigned int), NULL);
964 xbt_test_add("==== Insert %d int, traverse them, remove them",NB_ELEM);
965 /* Populate_ints [doxygen cruft] */
966 /* 1. Populate the dynar */
967 for (cpt = 0; cpt < NB_ELEM; cpt++) {
968 xbt_dynar_insert_at(d, cpt, &cpt);
969 xbt_test_log("Push %d, length=%lu", cpt, xbt_dynar_length(d));
972 /* 3. Traverse the dynar */
973 xbt_dynar_foreach(d, cursor, cpt) {
974 xbt_test_assert(cursor == cpt,
975 "The retrieved value is not the same than the injected one (%d!=%d)",
978 /* end_of_traversal */
980 /* Re-fill with the same values using set_as (and re-verify) */
981 for (cpt = 0; cpt < NB_ELEM; cpt++)
982 xbt_dynar_set_as(d, cpt, int, cpt);
983 xbt_dynar_foreach(d, cursor, cpt)
984 xbt_test_assert(cursor == cpt,
985 "The retrieved value is not the same than the injected one (%d!=%d)",
988 for (cpt = 0; cpt < NB_ELEM; cpt++) {
990 xbt_dynar_remove_at(d,0,&val);
991 xbt_test_assert(cpt == val,
992 "The retrieved value is not the same than the injected one (%d!=%d)",
995 xbt_test_assert(xbt_dynar_is_empty(d),
996 "There is still %lu elements in the dynar after removing everything",
997 xbt_dynar_length(d));
1000 /* ********************* */
1001 xbt_test_add("==== Insert %d int in reverse order, traverse them, remove them",NB_ELEM);
1002 d = xbt_dynar_new(sizeof(int), NULL);
1003 for (cpt = NB_ELEM-1; cpt >=0; cpt--) {
1004 xbt_dynar_replace(d, cpt, &cpt);
1005 xbt_test_log("Push %d, length=%lu", cpt, xbt_dynar_length(d));
1008 /* 3. Traverse the dynar */
1009 xbt_dynar_foreach(d, cursor, cpt) {
1010 xbt_test_assert(cursor == cpt,
1011 "The retrieved value is not the same than the injected one (%d!=%d)",
1014 /* end_of_traversal */
1016 for (cpt =NB_ELEM-1; cpt >=0; cpt--) {
1018 xbt_dynar_remove_at(d,xbt_dynar_length(d)-1,&val);
1019 xbt_test_assert(cpt == val,
1020 "The retrieved value is not the same than the injected one (%d!=%d)",
1023 xbt_test_assert(xbt_dynar_is_empty(d),
1024 "There is still %lu elements in the dynar after removing everything",
1025 xbt_dynar_length(d));
1029 /*******************************************************************************/
1030 /*******************************************************************************/
1031 /*******************************************************************************/
1032 XBT_TEST_UNIT("double", test_dynar_double, "Dynars of doubles")
1036 unsigned int cursor;
1039 xbt_test_add("==== Traverse the empty dynar");
1040 d = xbt_dynar_new(sizeof(int), NULL);
1041 xbt_dynar_foreach(d, cursor, cpt) {
1042 xbt_test_assert(FALSE,
1043 "Damnit, there is something in the empty dynar");
1045 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1046 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1047 /* in your code is naturally the way to go outside a regression test */
1049 xbt_test_add("==== Push/shift 5000 doubles");
1050 d = xbt_dynar_new(sizeof(double), NULL);
1051 for (cpt = 0; cpt < 5000; cpt++) {
1053 xbt_dynar_push(d, &d1);
1055 xbt_dynar_foreach(d, cursor, d2) {
1056 d1 = (double) cursor;
1057 xbt_test_assert(d1 == d2,
1058 "The retrieved value is not the same than the injected one (%f!=%f)",
1061 for (cpt = 0; cpt < 5000; cpt++) {
1063 xbt_dynar_shift(d, &d2);
1064 xbt_test_assert(d1 == d2,
1065 "The retrieved value is not the same than the injected one (%f!=%f)",
1068 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1069 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1070 /* in your code is naturally the way to go outside a regression test */
1072 xbt_test_add("==== Unshift/pop 5000 doubles");
1073 d = xbt_dynar_new(sizeof(double), NULL);
1074 for (cpt = 0; cpt < 5000; cpt++) {
1076 xbt_dynar_unshift(d, &d1);
1078 for (cpt = 0; cpt < 5000; cpt++) {
1080 xbt_dynar_pop(d, &d2);
1081 xbt_test_assert(d1 == d2,
1082 "The retrieved value is not the same than the injected one (%f!=%f)",
1085 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1086 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1087 /* in your code is naturally the way to go outside a regression test */
1092 ("==== Push 5000 doubles, insert 1000 doubles in the middle, shift everything");
1093 d = xbt_dynar_new(sizeof(double), NULL);
1094 for (cpt = 0; cpt < 5000; cpt++) {
1096 xbt_dynar_push(d, &d1);
1098 for (cpt = 0; cpt < 1000; cpt++) {
1100 xbt_dynar_insert_at(d, 2500, &d1);
1103 for (cpt = 0; cpt < 2500; cpt++) {
1105 xbt_dynar_shift(d, &d2);
1106 xbt_test_assert(d1 == d2,
1107 "The retrieved value is not the same than the injected one at the begining (%f!=%f)",
1109 XBT_DEBUG("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
1111 for (cpt = 999; cpt >= 0; cpt--) {
1113 xbt_dynar_shift(d, &d2);
1114 xbt_test_assert(d1 == d2,
1115 "The retrieved value is not the same than the injected one in the middle (%f!=%f)",
1118 for (cpt = 2500; cpt < 5000; cpt++) {
1120 xbt_dynar_shift(d, &d2);
1121 xbt_test_assert(d1 == d2,
1122 "The retrieved value is not the same than the injected one at the end (%f!=%f)",
1125 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1126 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1127 /* in your code is naturally the way to go outside a regression test */
1130 xbt_test_add("==== Push 5000 double, remove 2000-4000. free the rest");
1131 d = xbt_dynar_new(sizeof(double), NULL);
1132 for (cpt = 0; cpt < 5000; cpt++) {
1134 xbt_dynar_push(d, &d1);
1136 for (cpt = 2000; cpt < 4000; cpt++) {
1138 xbt_dynar_remove_at(d, 2000, &d2);
1139 xbt_test_assert(d1 == d2,
1140 "Remove a bad value. Got %f, expected %f", d2, d1);
1142 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1143 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1144 /* in your code is naturally the way to go outside a regression test */
1148 /* doxygen_string_cruft */
1150 /*******************************************************************************/
1151 /*******************************************************************************/
1152 /*******************************************************************************/
1153 XBT_TEST_UNIT("string", test_dynar_string, "Dynars of strings")
1161 xbt_test_add("==== Traverse the empty dynar");
1162 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
1163 xbt_dynar_foreach(d, iter, s1) {
1164 xbt_test_assert(FALSE,
1165 "Damnit, there is something in the empty dynar");
1167 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1168 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1169 /* in your code is naturally the way to go outside a regression test */
1171 xbt_test_add("==== Push %d strings, set them again 3 times, shift them",
1173 /* Populate_str [doxygen cruft] */
1174 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
1175 /* 1. Populate the dynar */
1176 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1177 sprintf(buf, "%d", cpt);
1179 xbt_dynar_push(d, &s1);
1181 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1182 sprintf(buf, "%d", cpt);
1184 xbt_dynar_replace(d, cpt, &s1);
1186 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1187 sprintf(buf, "%d", cpt);
1189 xbt_dynar_replace(d, cpt, &s1);
1191 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1192 sprintf(buf, "%d", cpt);
1194 xbt_dynar_replace(d, cpt, &s1);
1196 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1197 sprintf(buf, "%d", cpt);
1198 xbt_dynar_shift(d, &s2);
1199 xbt_test_assert(!strcmp(buf, s2),
1200 "The retrieved value is not the same than the injected one (%s!=%s)",
1204 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1205 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1206 /* in your code is naturally the way to go outside a regression test */
1208 xbt_test_add("==== Unshift, traverse and pop %d strings", NB_ELEM);
1209 d = xbt_dynar_new(sizeof(char **), &xbt_free_ref);
1210 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1211 sprintf(buf, "%d", cpt);
1213 xbt_dynar_unshift(d, &s1);
1215 /* 2. Traverse the dynar with the macro */
1216 xbt_dynar_foreach(d, iter, s1) {
1217 sprintf(buf, "%d", NB_ELEM - iter - 1);
1218 xbt_test_assert(!strcmp(buf, s1),
1219 "The retrieved value is not the same than the injected one (%s!=%s)",
1222 /* 3. Traverse the dynar with the macro */
1223 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1224 sprintf(buf, "%d", cpt);
1225 xbt_dynar_pop(d, &s2);
1226 xbt_test_assert(!strcmp(buf, s2),
1227 "The retrieved value is not the same than the injected one (%s!=%s)",
1231 /* 4. Free the resources */
1232 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1233 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1234 /* in your code is naturally the way to go outside a regression test */
1238 ("==== Push %d strings, insert %d strings in the middle, shift everything",
1239 NB_ELEM, NB_ELEM / 5);
1240 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
1241 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1242 sprintf(buf, "%d", cpt);
1244 xbt_dynar_push(d, &s1);
1246 for (cpt = 0; cpt < NB_ELEM / 5; cpt++) {
1247 sprintf(buf, "%d", cpt);
1249 xbt_dynar_insert_at(d, NB_ELEM / 2, &s1);
1252 for (cpt = 0; cpt < NB_ELEM / 2; cpt++) {
1253 sprintf(buf, "%d", cpt);
1254 xbt_dynar_shift(d, &s2);
1255 xbt_test_assert(!strcmp(buf, s2),
1256 "The retrieved value is not the same than the injected one at the begining (%s!=%s)",
1260 for (cpt = (NB_ELEM / 5) - 1; cpt >= 0; cpt--) {
1261 sprintf(buf, "%d", cpt);
1262 xbt_dynar_shift(d, &s2);
1263 xbt_test_assert(!strcmp(buf, s2),
1264 "The retrieved value is not the same than the injected one in the middle (%s!=%s)",
1268 for (cpt = NB_ELEM / 2; cpt < NB_ELEM; cpt++) {
1269 sprintf(buf, "%d", cpt);
1270 xbt_dynar_shift(d, &s2);
1271 xbt_test_assert(!strcmp(buf, s2),
1272 "The retrieved value is not the same than the injected one at the end (%s!=%s)",
1276 xbt_dynar_free(&d); /* This code is used both as example and as regression test, so we try to */
1277 xbt_dynar_free(&d); /* free the struct twice here to check that it's ok, but freeing it only once */
1278 /* in your code is naturally the way to go outside a regression test */
1281 xbt_test_add("==== Push %d strings, remove %d-%d. free the rest",
1282 NB_ELEM, 2 * (NB_ELEM / 5), 4 * (NB_ELEM / 5));
1283 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
1284 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1285 sprintf(buf, "%d", cpt);
1287 xbt_dynar_push(d, &s1);
1289 for (cpt = 2 * (NB_ELEM / 5); cpt < 4 * (NB_ELEM / 5); cpt++) {
1290 sprintf(buf, "%d", cpt);
1291 xbt_dynar_remove_at(d, 2 * (NB_ELEM / 5), &s2);
1292 xbt_test_assert(!strcmp(buf, s2),
1293 "Remove a bad value. Got %s, expected %s", s2, buf);
1296 xbt_dynar_free(&d); /* end_of_doxygen */
1300 /*******************************************************************************/
1301 /*******************************************************************************/
1302 /*******************************************************************************/
1303 #include "xbt/synchro.h"
1304 static void pusher_f(void *a)
1306 xbt_dynar_t d = (xbt_dynar_t) a;
1308 for (i = 0; i < 500; i++) {
1309 xbt_dynar_push(d, &i);
1313 static void poper_f(void *a)
1315 xbt_dynar_t d = (xbt_dynar_t) a;
1320 for (i = 0; i < 500; i++) {
1322 xbt_dynar_pop(d, &data);
1325 if (e.category == bound_error) {
1336 XBT_TEST_UNIT("synchronized int", test_dynar_sync_int, "Synchronized dynars of integers")
1338 /* Vars_decl [doxygen cruft] */
1340 xbt_thread_t pusher, poper;
1342 xbt_test_add("==== Have a pusher and a popper on the dynar");
1343 d = xbt_dynar_new_sync(sizeof(int), NULL);
1344 pusher = xbt_thread_create("pusher", pusher_f, d, 0 /*not joinable */ );
1345 poper = xbt_thread_create("poper", poper_f, d, 0 /*not joinable */ );
1346 xbt_thread_join(pusher);
1347 xbt_thread_join(poper);
1351 #endif /* SIMGRID_TEST */