3 /* a generic DYNamic ARray implementation. */
5 /* Copyright (c) 2003, 2004 Martin Quinson. All rights reserved. */
7 /* This program is free software; you can redistribute it and/or modify it
8 * under the terms of the license (GNU LGPL) which comes with this package. */
10 #include "portable.h" /* SIZEOF_MAX */
12 #include "xbt/sysdep.h"
15 #include "xbt/dynar.h"
16 #include <sys/types.h>
18 /* IMPLEMENTATION NOTE ON SYNCHRONIZATION: every functions which name is prefixed by _
19 * assumes that the dynar is already locked if we have to.
20 * Other functions (public ones) check for this.
23 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dyn, xbt, "Dynamic arrays");
25 static XBT_INLINE void _dynar_lock(xbt_dynar_t dynar)
28 xbt_mutex_acquire(dynar->mutex);
31 static XBT_INLINE void _dynar_unlock(xbt_dynar_t dynar)
34 xbt_mutex_release(dynar->mutex);
37 static XBT_INLINE void _sanity_check_dynar(xbt_dynar_t dynar)
39 xbt_assert0(dynar, "dynar is NULL");
42 static XBT_INLINE void _sanity_check_idx(int idx)
44 xbt_assert1(idx >= 0, "dynar idx(=%d) < 0", (int) (idx));
47 static XBT_INLINE void _check_inbound_idx(xbt_dynar_t dynar, int idx)
49 if (idx < 0 || idx >= dynar->used) {
51 THROW2(bound_error, idx,
52 "dynar is not that long. You asked %d, but it's only %lu long",
53 (int) (idx), (unsigned long) dynar->used);
57 static XBT_INLINE void _check_sloppy_inbound_idx(xbt_dynar_t dynar, int idx)
59 if (idx > dynar->used) {
61 THROW2(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 THROW1(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 char *const old_data = (char *) dynar->data;
91 const unsigned long elmsize = dynar->elmsize;
93 const unsigned long used = dynar->used;
94 const unsigned long used_length = used * elmsize;
96 const unsigned long new_size =
97 nb > (2 * (old_size + 1)) ? nb : (2 * (old_size + 1));
98 const unsigned long new_length = new_size * elmsize;
99 char *const new_data = (char *) xbt_malloc0(elmsize * new_size);
101 DEBUG3("expend %p from %lu to %lu elements", (void *) dynar,
102 (unsigned long) old_size, nb);
105 memcpy(new_data, old_data, used_length);
109 _xbt_clear_mem(new_data + used_length, new_length - used_length);
111 dynar->size = new_size;
112 dynar->data = new_data;
117 void *_xbt_dynar_elm(const xbt_dynar_t dynar, const unsigned long idx)
119 char *const data = (char *) dynar->data;
120 const unsigned long elmsize = dynar->elmsize;
122 return data + idx * elmsize;
127 _xbt_dynar_get_elm(void *const dst,
128 const xbt_dynar_t dynar, const unsigned long idx)
130 void *const elm = _xbt_dynar_elm(dynar, idx);
132 memcpy(dst, elm, dynar->elmsize);
137 _xbt_dynar_put_elm(const xbt_dynar_t dynar,
138 const unsigned long idx, const void *const src)
140 void *const elm = _xbt_dynar_elm(dynar, idx);
141 const unsigned long elmsize = dynar->elmsize;
143 memcpy(elm, src, elmsize);
148 _xbt_dynar_remove_at(xbt_dynar_t const dynar,
149 const unsigned long idx, void *const object)
152 unsigned long nb_shift;
153 unsigned long offset;
155 _sanity_check_dynar(dynar);
156 _check_inbound_idx(dynar, idx);
159 _xbt_dynar_get_elm(object, dynar, idx);
160 } else if (dynar->free_f) {
161 if (dynar->elmsize <= SIZEOF_MAX) {
162 char elm[SIZEOF_MAX];
163 _xbt_dynar_get_elm(elm, dynar, idx);
164 (*dynar->free_f) (elm);
166 char *elm = malloc(dynar->elmsize);
167 _xbt_dynar_get_elm(elm, dynar, idx);
168 (*dynar->free_f) (elm);
173 nb_shift = dynar->used - 1 - idx;
174 offset = nb_shift * dynar->elmsize;
176 memmove(_xbt_dynar_elm(dynar, idx), _xbt_dynar_elm(dynar, idx + 1), offset);
181 void xbt_dynar_dump(xbt_dynar_t dynar)
183 INFO5("Dynar dump: size=%lu; used=%lu; elmsize=%lu; data=%p; free_f=%p",
184 dynar->size, dynar->used, dynar->elmsize, dynar->data, dynar->free_f);
187 /** @brief Constructor
189 * \param elmsize size of each element in the dynar
190 * \param free_f function to call each time we want to get rid of an element (or NULL if nothing to do).
192 * Creates a new dynar. If a free_func is provided, the elements have to be
193 * pointer of pointer. That is to say that dynars can contain either base
194 * types (int, char, double, etc) or pointer of pointers (struct **).
197 xbt_dynar_new(const unsigned long elmsize, void_f_pvoid_t const free_f)
200 xbt_dynar_t dynar = xbt_new0(s_xbt_dynar_t, 1);
204 dynar->elmsize = elmsize;
206 dynar->free_f = free_f;
212 /** @brief Creates a synchronized dynar.
214 * Just like #xbt_dynar_new, but each access to the structure will be protected by a mutex
218 xbt_dynar_new_sync(const unsigned long elmsize, void_f_pvoid_t const free_f)
220 xbt_dynar_t res = xbt_dynar_new(elmsize, free_f);
221 res->mutex = xbt_mutex_init();
225 /** @brief Destructor of the structure not touching to the content
227 * \param dynar poor victim
229 * kilkil a dynar BUT NOT its content. Ie, the array is freed, but the content
230 * is not touched (the \a free_f function is not used)
232 void xbt_dynar_free_container(xbt_dynar_t * dynar)
234 if (dynar && *dynar) {
236 if ((*dynar)->data) {
237 _xbt_clear_mem((*dynar)->data, (*dynar)->size);
238 free((*dynar)->data);
242 xbt_mutex_destroy((*dynar)->mutex);
244 _xbt_clear_mem(*dynar, sizeof(s_xbt_dynar_t));
251 /** @brief Frees the content and set the size to 0
253 * \param dynar who to squeeze
255 XBT_INLINE void xbt_dynar_reset(xbt_dynar_t const dynar)
259 _sanity_check_dynar(dynar);
261 DEBUG1("Reset the dynar %p", (void *) dynar);
263 _dynar_map(dynar, dynar->free_f);
273 _dynar_unlock(dynar);
275 /* dynar->data = NULL; */
279 * \brief Shrink the dynar by removing empty slots at the end of the internal array
280 * \param dynar a dynar
281 * \param empty_slots_wanted number of empty slots you want to keep at the end of the
282 * internal array for further insertions
284 * Reduces the internal array size of the dynar to the number of elements plus
285 * \a empty_slots_wanted.
286 * After removing elements from the dynar, you can call this function to make
287 * the dynar use less memory.
288 * Set \a empty_slots_wanted to zero to reduce the dynar internal array as much
290 * Note that if \a empty_slots_wanted is greater than the array size, the internal
291 * array is not expanded and nothing is done.
293 void xbt_dynar_shrink(xbt_dynar_t dynar, int empty_slots_wanted)
295 unsigned long size_wanted;
299 size_wanted = dynar->used + empty_slots_wanted;
300 if (size_wanted < dynar->size) {
301 dynar->size = size_wanted;
302 dynar->data = xbt_realloc(dynar->data, sizeof(void *) * dynar->size);
304 _dynar_unlock(dynar);
307 /** @brief Destructor
309 * \param dynar poor victim
311 * kilkil a dynar and its content
314 XBT_INLINE void xbt_dynar_free(xbt_dynar_t * dynar)
316 if (dynar && *dynar) {
317 xbt_dynar_reset(*dynar);
318 xbt_dynar_free_container(dynar);
322 /** \brief free a dynar passed as void* (handy to store dynar in dynars or dict) */
323 void xbt_dynar_free_voidp(void *d)
325 xbt_dynar_free((xbt_dynar_t *) d);
328 /** @brief Count of dynar's elements
330 * \param dynar the dynar we want to mesure
332 XBT_INLINE unsigned long xbt_dynar_length(const xbt_dynar_t dynar)
334 return (dynar ? (unsigned long) dynar->used : (unsigned long) 0);
337 /** @brief Retrieve a copy of the Nth element of a dynar.
339 * \param dynar information dealer
340 * \param idx index of the slot we want to retrieve
341 * \param[out] dst where to put the result to.
344 xbt_dynar_get_cpy(const xbt_dynar_t dynar,
345 const unsigned long idx, void *const dst)
348 _sanity_check_dynar(dynar);
349 _check_inbound_idx(dynar, idx);
351 _xbt_dynar_get_elm(dst, dynar, idx);
352 _dynar_unlock(dynar);
355 /** @brief Retrieve a pointer to the Nth element of a dynar.
357 * \param dynar information dealer
358 * \param idx index of the slot we want to retrieve
359 * \return the \a idx-th element of \a dynar.
361 * \warning The returned value is the actual content of the dynar.
362 * Make a copy before fooling with it.
364 XBT_INLINE void *xbt_dynar_get_ptr(const xbt_dynar_t dynar, 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);
378 static void XBT_INLINE /* not synchronized */
379 _xbt_dynar_set(xbt_dynar_t dynar,
380 const unsigned long idx, const void *const src)
383 _sanity_check_dynar(dynar);
384 _sanity_check_idx(idx);
386 _xbt_dynar_expand(dynar, idx + 1);
388 if (idx >= dynar->used) {
389 dynar->used = idx + 1;
392 _xbt_dynar_put_elm(dynar, idx, src);
395 /** @brief Set the Nth element of a dynar (expended if needed). Previous value at this position is NOT freed
397 * \param dynar information dealer
398 * \param idx index of the slot we want to modify
399 * \param src What will be feeded to the dynar
401 * If you want to free the previous content, use xbt_dynar_replace().
403 XBT_INLINE void xbt_dynar_set(xbt_dynar_t dynar, const int idx, const void *const src)
407 _xbt_dynar_set(dynar, idx, src);
408 _dynar_unlock(dynar);
411 /** @brief Set the Nth element of a dynar (expended if needed). Previous value is freed
417 * Set the Nth element of a dynar, expanding the dynar if needed, AND DO
418 * free the previous value at this position. If you don't want to free the
419 * previous content, use xbt_dynar_set().
422 xbt_dynar_replace(xbt_dynar_t dynar,
423 const unsigned long idx, const void *const object)
426 _sanity_check_dynar(dynar);
427 _sanity_check_idx(idx);
429 if (idx < dynar->used && dynar->free_f) {
430 void *const old_object = _xbt_dynar_elm(dynar, idx);
432 (*(dynar->free_f)) (old_object);
435 _xbt_dynar_set(dynar, idx, object);
436 _dynar_unlock(dynar);
439 static XBT_INLINE void *_xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar,
440 const unsigned long idx)
443 unsigned long old_used;
444 unsigned long new_used;
445 unsigned long nb_shift;
447 _sanity_check_dynar(dynar);
448 _sanity_check_idx(idx);
449 _check_sloppy_inbound_idx(dynar, idx);
451 old_used = dynar->used;
452 new_used = old_used + 1;
454 _xbt_dynar_expand(dynar, new_used);
456 nb_shift = old_used - idx;
459 memmove(_xbt_dynar_elm(dynar, idx + 1),
460 _xbt_dynar_elm(dynar, idx), nb_shift * dynar->elmsize);
462 dynar->used = new_used;
463 res = _xbt_dynar_elm(dynar, idx);
467 /** @brief Make room for a new element, and return a pointer to it
469 * You can then use regular affectation to set its value instead of relying
470 * on the slow memcpy. This is what xbt_dynar_insert_at_as() does.
472 void *xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar, const int idx)
477 res = _xbt_dynar_insert_at_ptr(dynar, idx);
478 _dynar_unlock(dynar);
482 /** @brief Set the Nth dynar's element, expending the dynar and sliding the previous values to the right
484 * Set the Nth element of a dynar, expanding the dynar if needed, and
485 * moving the previously existing value and all subsequent ones to one
486 * position right in the dynar.
489 xbt_dynar_insert_at(xbt_dynar_t const dynar,
490 const int idx, const void *const src)
494 /* checks done in xbt_dynar_insert_at_ptr */
495 memcpy(_xbt_dynar_insert_at_ptr(dynar, idx), src, dynar->elmsize);
496 _dynar_unlock(dynar);
499 /** @brief Remove the Nth dynar's element, sliding the previous values to the left
501 * Get the Nth element of a dynar, removing it from the dynar and moving
502 * all subsequent values to one position left in the dynar.
504 * If the object argument of this function is a non-null pointer, the removed
505 * element is copied to this address. If not, the element is freed using the
506 * free_f function passed at dynar creation.
509 xbt_dynar_remove_at(xbt_dynar_t const dynar,
510 const int idx, void *const object)
514 _xbt_dynar_remove_at(dynar, idx, object);
515 _dynar_unlock(dynar);
518 /** @brief Returns the position of the element in the dynar
520 * Raises not_found_error if not found.
522 int xbt_dynar_search(xbt_dynar_t const dynar, void *const elem)
527 for (it = 0; it < dynar->used; it++)
528 if (!memcmp(_xbt_dynar_elm(dynar, it), elem, dynar->elmsize)) {
529 _dynar_unlock(dynar);
533 _dynar_unlock(dynar);
534 THROW2(not_found_error, 0, "Element %p not part of dynar %p", elem, dynar);
537 /** @brief Returns a boolean indicating whether the element is part of the dynar */
538 int xbt_dynar_member(xbt_dynar_t const dynar, void *const elem)
544 xbt_dynar_search(dynar, elem);
546 if (e.category == not_found_error) {
555 /** @brief Make room at the end of the dynar for a new element, and return a pointer to it.
557 * You can then use regular affectation to set its value instead of relying
558 * on the slow memcpy. This is what xbt_dynar_push_as() does.
560 XBT_INLINE void *xbt_dynar_push_ptr(xbt_dynar_t const dynar)
564 /* we have to inline xbt_dynar_insert_at_ptr here to make sure that
565 dynar->used don't change between reading it and getting the lock
566 within xbt_dynar_insert_at_ptr */
568 res = _xbt_dynar_insert_at_ptr(dynar, dynar->used);
569 _dynar_unlock(dynar);
573 /** @brief Add an element at the end of the dynar */
574 XBT_INLINE void xbt_dynar_push(xbt_dynar_t const dynar, const void *const src)
577 /* checks done in xbt_dynar_insert_at_ptr */
578 memcpy(_xbt_dynar_insert_at_ptr(dynar, dynar->used), src, dynar->elmsize);
579 _dynar_unlock(dynar);
582 /** @brief Mark the last dynar's element as unused and return a pointer to it.
584 * You can then use regular affectation to set its value instead of relying
585 * on the slow memcpy. This is what xbt_dynar_pop_as() does.
587 XBT_INLINE void *xbt_dynar_pop_ptr(xbt_dynar_t const dynar)
592 _check_populated_dynar(dynar);
593 DEBUG1("Pop %p", (void *) dynar);
595 res = _xbt_dynar_elm(dynar, dynar->used);
596 _dynar_unlock(dynar);
600 /** @brief Get and remove the last element of the dynar */
601 XBT_INLINE void xbt_dynar_pop(xbt_dynar_t const dynar, void *const dst)
604 /* sanity checks done by remove_at */
605 DEBUG1("Pop %p", (void *) dynar);
607 _xbt_dynar_remove_at(dynar, dynar->used - 1, dst);
608 _dynar_unlock(dynar);
611 /** @brief Add an element at the begining of the dynar.
613 * This is less efficient than xbt_dynar_push()
615 XBT_INLINE void xbt_dynar_unshift(xbt_dynar_t const dynar, const void *const src)
618 /* sanity checks done by insert_at */
619 xbt_dynar_insert_at(dynar, 0, src);
622 /** @brief Get and remove the first element of the dynar.
624 * This is less efficient than xbt_dynar_pop()
626 XBT_INLINE void xbt_dynar_shift(xbt_dynar_t const dynar, void *const dst)
629 /* sanity checks done by remove_at */
630 xbt_dynar_remove_at(dynar, 0, dst);
633 static void _dynar_map(const xbt_dynar_t dynar, void_f_pvoid_t const op)
635 char elm[SIZEOF_MAX];
636 const unsigned long used = dynar->used;
639 for (i = 0; i < used; i++) {
640 _xbt_dynar_get_elm(elm, dynar, i);
645 /** @brief Apply a function to each member of a dynar
647 * The mapped function may change the value of the element itself,
648 * but should not mess with the structure of the dynar.
650 * If the dynar is synchronized, it is locked during the whole map
651 * operation, so make sure your function don't call any function
652 * from xbt_dynar_* on it, or you'll get a deadlock.
654 XBT_INLINE void xbt_dynar_map(const xbt_dynar_t dynar, void_f_pvoid_t const op)
657 _sanity_check_dynar(dynar);
660 _dynar_map(dynar, op);
662 _dynar_unlock(dynar);
666 /** @brief Removes and free the entry pointed by the cursor
668 * This function can be used while traversing without problem.
670 XBT_INLINE void xbt_dynar_cursor_rm(xbt_dynar_t dynar, unsigned int *const cursor)
673 _xbt_dynar_remove_at(dynar, (*cursor)--, NULL);
676 /** @brief Unlocks a synchronized dynar when you want to break the traversal
678 * This function must be used if you <tt>break</tt> the
679 * xbt_dynar_foreach loop, but shouldn't be called at the end of a
680 * regular traversal reaching the end of the elements
682 XBT_INLINE void xbt_dynar_cursor_unlock(xbt_dynar_t dynar)
684 _dynar_unlock(dynar);
691 XBT_TEST_SUITE("dynar", "Dynar data container");
692 XBT_LOG_EXTERNAL_CATEGORY(xbt_dyn);
693 XBT_LOG_DEFAULT_CATEGORY(xbt_dyn);
695 XBT_TEST_UNIT("int", test_dynar_int, "Dynars of integers")
697 /* Vars_decl [doxygen cruft] */
703 xbt_test_add0("==== Traverse the empty dynar");
704 d = xbt_dynar_new(sizeof(int), NULL);
705 xbt_dynar_foreach(d, cursor, i) {
706 xbt_assert0(0, "Damnit, there is something in the empty dynar");
712 ("==== Push %d int, set them again 3 times, traverse them, shift them",
714 /* Populate_ints [doxygen cruft] */
715 /* 1. Populate the dynar */
716 d = xbt_dynar_new(sizeof(int), NULL);
717 for (cpt = 0; cpt < NB_ELEM; cpt++) {
718 xbt_dynar_push_as(d, int, cpt); /* This is faster (and possible only with scalars) */
719 /* xbt_dynar_push(d,&cpt); This would also work */
720 xbt_test_log2("Push %d, length=%lu", cpt, xbt_dynar_length(d));
723 /* 2. Traverse manually the dynar */
724 for (cursor = 0; cursor < NB_ELEM; cursor++) {
725 iptr = xbt_dynar_get_ptr(d, cursor);
726 xbt_test_assert2(cursor == *iptr,
727 "The retrieved value is not the same than the injected one (%d!=%d)",
731 /* 3. Traverse the dynar using the neat macro to that extend */
732 xbt_dynar_foreach(d, cursor, cpt) {
733 xbt_test_assert2(cursor == cpt,
734 "The retrieved value is not the same than the injected one (%d!=%d)",
737 /* end_of_traversal */
739 for (cpt = 0; cpt < NB_ELEM; cpt++)
740 *(int *) xbt_dynar_get_ptr(d, cpt) = cpt;
742 for (cpt = 0; cpt < NB_ELEM; cpt++)
743 *(int *) xbt_dynar_get_ptr(d, cpt) = cpt;
744 /* xbt_dynar_set(d,cpt,&cpt); */
746 for (cpt = 0; cpt < NB_ELEM; cpt++)
747 *(int *) xbt_dynar_get_ptr(d, cpt) = cpt;
750 xbt_dynar_foreach(d, cursor, i) {
751 xbt_test_assert2(i == cpt,
752 "The retrieved value is not the same than the injected one (%d!=%d)",
756 xbt_test_assert2(cpt == NB_ELEM,
757 "Cannot retrieve my %d values. Last got one is %d",
760 /* shifting [doxygen cruft] */
761 /* 4. Shift all the values */
762 for (cpt = 0; cpt < NB_ELEM; cpt++) {
763 xbt_dynar_shift(d, &i);
764 xbt_test_assert2(i == cpt,
765 "The retrieved value is not the same than the injected one (%d!=%d)",
767 xbt_test_log2("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
770 /* 5. Free the resources */
775 xbt_test_add1("==== Unshift/pop %d int", NB_ELEM);
776 d = xbt_dynar_new(sizeof(int), NULL);
777 for (cpt = 0; cpt < NB_ELEM; cpt++) {
778 xbt_dynar_unshift(d, &cpt);
779 DEBUG2("Push %d, length=%lu", cpt, xbt_dynar_length(d));
781 for (cpt = 0; cpt < NB_ELEM; cpt++) {
782 i = xbt_dynar_pop_as(d, int);
783 xbt_test_assert2(i == cpt,
784 "The retrieved value is not the same than the injected one (%d!=%d)",
786 xbt_test_log2("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
793 ("==== Push %d int, insert 1000 int in the middle, shift everything",
795 d = xbt_dynar_new(sizeof(int), NULL);
796 for (cpt = 0; cpt < NB_ELEM; cpt++) {
797 xbt_dynar_push_as(d, int, cpt);
798 DEBUG2("Push %d, length=%lu", cpt, xbt_dynar_length(d));
800 for (cpt = 0; cpt < 1000; cpt++) {
801 xbt_dynar_insert_at_as(d, 2500, int, cpt);
802 DEBUG2("Push %d, length=%lu", cpt, xbt_dynar_length(d));
805 for (cpt = 0; cpt < 2500; cpt++) {
806 xbt_dynar_shift(d, &i);
807 xbt_test_assert2(i == cpt,
808 "The retrieved value is not the same than the injected one at the begining (%d!=%d)",
810 DEBUG2("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
812 for (cpt = 999; cpt >= 0; cpt--) {
813 xbt_dynar_shift(d, &i);
814 xbt_test_assert2(i == cpt,
815 "The retrieved value is not the same than the injected one in the middle (%d!=%d)",
818 for (cpt = 2500; cpt < NB_ELEM; cpt++) {
819 xbt_dynar_shift(d, &i);
820 xbt_test_assert2(i == cpt,
821 "The retrieved value is not the same than the injected one at the end (%d!=%d)",
828 xbt_test_add1("==== Push %d int, remove 2000-4000. free the rest", NB_ELEM);
829 d = xbt_dynar_new(sizeof(int), NULL);
830 for (cpt = 0; cpt < NB_ELEM; cpt++)
831 xbt_dynar_push_as(d, int, cpt);
833 for (cpt = 2000; cpt < 4000; cpt++) {
834 xbt_dynar_remove_at(d, 2000, &i);
835 xbt_test_assert2(i == cpt,
836 "Remove a bad value. Got %d, expected %d", i, cpt);
837 DEBUG2("remove %d, length=%lu", cpt, xbt_dynar_length(d));
843 /*******************************************************************************/
844 /*******************************************************************************/
845 /*******************************************************************************/
846 XBT_TEST_UNIT("double", test_dynar_double, "Dynars of doubles")
853 xbt_test_add0("==== Traverse the empty dynar");
854 d = xbt_dynar_new(sizeof(int), NULL);
855 xbt_dynar_foreach(d, cursor, cpt) {
856 xbt_test_assert0(FALSE, "Damnit, there is something in the empty dynar");
861 xbt_test_add0("==== Push/shift 5000 doubles");
862 d = xbt_dynar_new(sizeof(double), NULL);
863 for (cpt = 0; cpt < 5000; cpt++) {
865 xbt_dynar_push(d, &d1);
867 xbt_dynar_foreach(d, cursor, d2) {
868 d1 = (double) cursor;
869 xbt_test_assert2(d1 == d2,
870 "The retrieved value is not the same than the injected one (%f!=%f)",
873 for (cpt = 0; cpt < 5000; cpt++) {
875 xbt_dynar_shift(d, &d2);
876 xbt_test_assert2(d1 == d2,
877 "The retrieved value is not the same than the injected one (%f!=%f)",
884 xbt_test_add0("==== Unshift/pop 5000 doubles");
885 d = xbt_dynar_new(sizeof(double), NULL);
886 for (cpt = 0; cpt < 5000; cpt++) {
888 xbt_dynar_unshift(d, &d1);
890 for (cpt = 0; cpt < 5000; cpt++) {
892 xbt_dynar_pop(d, &d2);
893 xbt_test_assert2(d1 == d2,
894 "The retrieved value is not the same than the injected one (%f!=%f)",
903 ("==== Push 5000 doubles, insert 1000 doubles in the middle, shift everything");
904 d = xbt_dynar_new(sizeof(double), NULL);
905 for (cpt = 0; cpt < 5000; cpt++) {
907 xbt_dynar_push(d, &d1);
909 for (cpt = 0; cpt < 1000; cpt++) {
911 xbt_dynar_insert_at(d, 2500, &d1);
914 for (cpt = 0; cpt < 2500; cpt++) {
916 xbt_dynar_shift(d, &d2);
917 xbt_test_assert2(d1 == d2,
918 "The retrieved value is not the same than the injected one at the begining (%f!=%f)",
920 DEBUG2("Pop %d, length=%lu", cpt, xbt_dynar_length(d));
922 for (cpt = 999; cpt >= 0; cpt--) {
924 xbt_dynar_shift(d, &d2);
925 xbt_test_assert2(d1 == d2,
926 "The retrieved value is not the same than the injected one in the middle (%f!=%f)",
929 for (cpt = 2500; cpt < 5000; cpt++) {
931 xbt_dynar_shift(d, &d2);
932 xbt_test_assert2(d1 == d2,
933 "The retrieved value is not the same than the injected one at the end (%f!=%f)",
940 xbt_test_add0("==== Push 5000 double, remove 2000-4000. free the rest");
941 d = xbt_dynar_new(sizeof(double), NULL);
942 for (cpt = 0; cpt < 5000; cpt++) {
944 xbt_dynar_push(d, &d1);
946 for (cpt = 2000; cpt < 4000; cpt++) {
948 xbt_dynar_remove_at(d, 2000, &d2);
949 xbt_test_assert2(d1 == d2,
950 "Remove a bad value. Got %f, expected %f", d2, d1);
957 /* doxygen_string_cruft */
959 /*******************************************************************************/
960 /*******************************************************************************/
961 /*******************************************************************************/
962 XBT_TEST_UNIT("string", test_dynar_string, "Dynars of strings")
970 xbt_test_add0("==== Traverse the empty dynar");
971 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
972 xbt_dynar_foreach(d, iter, s1) {
973 xbt_test_assert0(FALSE, "Damnit, there is something in the empty dynar");
978 xbt_test_add1("==== Push %d strings, set them again 3 times, shift them",
980 /* Populate_str [doxygen cruft] */
981 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
982 /* 1. Populate the dynar */
983 for (cpt = 0; cpt < NB_ELEM; cpt++) {
984 sprintf(buf, "%d", cpt);
986 xbt_dynar_push(d, &s1);
988 for (cpt = 0; cpt < NB_ELEM; cpt++) {
989 sprintf(buf, "%d", cpt);
991 xbt_dynar_replace(d, cpt, &s1);
993 for (cpt = 0; cpt < NB_ELEM; cpt++) {
994 sprintf(buf, "%d", cpt);
996 xbt_dynar_replace(d, cpt, &s1);
998 for (cpt = 0; cpt < NB_ELEM; cpt++) {
999 sprintf(buf, "%d", cpt);
1001 xbt_dynar_replace(d, cpt, &s1);
1003 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1004 sprintf(buf, "%d", cpt);
1005 xbt_dynar_shift(d, &s2);
1006 xbt_test_assert2(!strcmp(buf, s2),
1007 "The retrieved value is not the same than the injected one (%s!=%s)",
1015 xbt_test_add1("==== Unshift, traverse and pop %d strings", NB_ELEM);
1016 d = xbt_dynar_new(sizeof(char **), &xbt_free_ref);
1017 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1018 sprintf(buf, "%d", cpt);
1020 xbt_dynar_unshift(d, &s1);
1022 /* 2. Traverse the dynar with the macro */
1023 xbt_dynar_foreach(d, iter, s1) {
1024 sprintf(buf, "%d", NB_ELEM - iter - 1);
1025 xbt_test_assert2(!strcmp(buf, s1),
1026 "The retrieved value is not the same than the injected one (%s!=%s)",
1029 /* 3. Traverse the dynar with the macro */
1030 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1031 sprintf(buf, "%d", cpt);
1032 xbt_dynar_pop(d, &s2);
1033 xbt_test_assert2(!strcmp(buf, s2),
1034 "The retrieved value is not the same than the injected one (%s!=%s)",
1038 /* 4. Free the resources */
1044 ("==== Push %d strings, insert %d strings in the middle, shift everything",
1045 NB_ELEM, NB_ELEM / 5);
1046 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
1047 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1048 sprintf(buf, "%d", cpt);
1050 xbt_dynar_push(d, &s1);
1052 for (cpt = 0; cpt < NB_ELEM / 5; cpt++) {
1053 sprintf(buf, "%d", cpt);
1055 xbt_dynar_insert_at(d, NB_ELEM / 2, &s1);
1058 for (cpt = 0; cpt < NB_ELEM / 2; cpt++) {
1059 sprintf(buf, "%d", cpt);
1060 xbt_dynar_shift(d, &s2);
1061 xbt_test_assert2(!strcmp(buf, s2),
1062 "The retrieved value is not the same than the injected one at the begining (%s!=%s)",
1066 for (cpt = (NB_ELEM / 5) - 1; cpt >= 0; cpt--) {
1067 sprintf(buf, "%d", cpt);
1068 xbt_dynar_shift(d, &s2);
1069 xbt_test_assert2(!strcmp(buf, s2),
1070 "The retrieved value is not the same than the injected one in the middle (%s!=%s)",
1074 for (cpt = NB_ELEM / 2; cpt < NB_ELEM; cpt++) {
1075 sprintf(buf, "%d", cpt);
1076 xbt_dynar_shift(d, &s2);
1077 xbt_test_assert2(!strcmp(buf, s2),
1078 "The retrieved value is not the same than the injected one at the end (%s!=%s)",
1086 xbt_test_add3("==== Push %d strings, remove %d-%d. free the rest", NB_ELEM,
1087 2 * (NB_ELEM / 5), 4 * (NB_ELEM / 5));
1088 d = xbt_dynar_new(sizeof(char *), &xbt_free_ref);
1089 for (cpt = 0; cpt < NB_ELEM; cpt++) {
1090 sprintf(buf, "%d", cpt);
1092 xbt_dynar_push(d, &s1);
1094 for (cpt = 2 * (NB_ELEM / 5); cpt < 4 * (NB_ELEM / 5); cpt++) {
1095 sprintf(buf, "%d", cpt);
1096 xbt_dynar_remove_at(d, 2 * (NB_ELEM / 5), &s2);
1097 xbt_test_assert2(!strcmp(buf, s2),
1098 "Remove a bad value. Got %s, expected %s", s2, buf);
1101 xbt_dynar_free(&d); /* end_of_doxygen */
1105 /*******************************************************************************/
1106 /*******************************************************************************/
1107 /*******************************************************************************/
1108 #include "xbt/synchro.h"
1109 static void pusher_f(void *a)
1111 xbt_dynar_t d = (xbt_dynar_t) a;
1113 for (i = 0; i < 500; i++) {
1114 xbt_dynar_push(d, &i);
1118 static void poper_f(void *a)
1120 xbt_dynar_t d = (xbt_dynar_t) a;
1125 for (i = 0; i < 500; i++) {
1127 xbt_dynar_pop(d, &data);
1130 if (e.category == bound_error) {
1141 XBT_TEST_UNIT("synchronized int", test_dynar_sync_int,"Synchronized dynars of integers")
1143 /* Vars_decl [doxygen cruft] */
1145 xbt_thread_t pusher, poper;
1147 xbt_test_add0("==== Have a pusher and a popper on the dynar");
1148 d = xbt_dynar_new_sync(sizeof(int), NULL);
1149 pusher = xbt_thread_create("pusher", pusher_f, d,0/*not joinable*/);
1150 poper = xbt_thread_create("poper", poper_f, d,0/*not joinable*/);
1151 xbt_thread_join(pusher);
1152 xbt_thread_join(poper);
1156 #endif /* SIMGRID_TEST */