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 #include "xbt/dynar_private.h" /* type definition, which we share with the
19 code in charge of sending this across the net */
21 /* IMPLEMENTATION NOTE ON SYNCHRONIZATION: every functions which name is prefixed by _
22 * assumes that the dynar is already locked if we have to.
23 * Other functions (public ones) check for this.
26 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dyn,xbt,"Dynamic arrays");
28 #define _dynar_lock(dynar) \
30 xbt_mutex_lock(dynar->mutex)
31 #define _dynar_unlock(dynar) \
33 xbt_mutex_unlock(dynar->mutex)
34 #define _sanity_check_dynar(dynar) \
37 #define _sanity_check_idx(idx) \
38 xbt_assert1(idx >= 0, \
39 "dynar idx(=%d) < 0", \
41 #define _check_inbound_idx(dynar, idx) \
42 if (idx>=dynar->used) \
43 THROW2(bound_error,idx, \
44 "dynar is not that long. You asked %d, but it's only %lu long", \
45 (int) (idx), (unsigned long) dynar->used)
46 #define _check_sloppy_inbound_idx(dynar, idx) \
47 if (idx>dynar->used) \
48 THROW2(bound_error,idx, \
49 "dynar is not that long. You asked %d, but it's only %lu long (could have been equal to it)", \
50 (int) (idx), (unsigned long) dynar->used)
51 #define _check_populated_dynar(dynar) \
52 if (dynar->used == 0) \
53 THROW1(bound_error,0, \
54 "dynar %p is empty", dynar)
58 void _xbt_clear_mem(void * const ptr,
59 const unsigned long length) {
60 memset(ptr, 0, length);
65 _xbt_dynar_expand(xbt_dynar_t const dynar,
67 const unsigned long old_size = dynar->size;
70 char * const old_data = (char *) dynar->data;
72 const unsigned long elmsize = dynar->elmsize;
73 const unsigned long old_length = old_size*elmsize;
75 const unsigned long used = dynar->used;
76 const unsigned long used_length = used*elmsize;
78 const unsigned long new_size = nb > (2*(old_size+1)) ? nb : (2*(old_size+1));
79 const unsigned long new_length = new_size*elmsize;
80 char * const new_data = (char *) xbt_malloc0(elmsize*new_size);
82 DEBUG3("expend %p from %lu to %d elements", (void*)dynar, (unsigned long)old_size, nb);
85 memcpy(new_data, old_data, used_length);
86 _xbt_clear_mem(old_data, old_length);
90 _xbt_clear_mem(new_data + used_length, new_length - used_length);
92 dynar->size = new_size;
93 dynar->data = new_data;
99 _xbt_dynar_elm(const xbt_dynar_t dynar,
100 const unsigned long idx) {
101 char * const data = (char*) dynar->data;
102 const unsigned long elmsize = dynar->elmsize;
104 return data + idx*elmsize;
109 _xbt_dynar_get_elm(void * const dst,
110 const xbt_dynar_t dynar,
111 const unsigned long idx) {
112 void * const elm = _xbt_dynar_elm(dynar, idx);
114 memcpy(dst, elm, dynar->elmsize);
119 _xbt_dynar_put_elm(const xbt_dynar_t dynar,
120 const unsigned long idx,
121 const void * const src) {
122 void * const elm = _xbt_dynar_elm(dynar, idx);
123 const unsigned long elmsize = dynar->elmsize;
125 memcpy(elm, src, elmsize);
130 _xbt_dynar_remove_at(xbt_dynar_t const dynar,
132 void * const object) {
134 unsigned long nb_shift;
135 unsigned long offset;
137 _sanity_check_dynar(dynar);
138 _sanity_check_idx(idx);
139 _check_inbound_idx(dynar, idx);
142 _xbt_dynar_get_elm(object, dynar, idx);
143 } else if (dynar->free_f) {
144 if (dynar->elmsize <= SIZEOF_MAX) {
145 char elm[SIZEOF_MAX];
146 _xbt_dynar_get_elm(elm, dynar, idx);
147 (*dynar->free_f)(elm);
149 char *elm=malloc(dynar->elmsize);
150 _xbt_dynar_get_elm(elm, dynar, idx);
151 (*dynar->free_f)(elm);
156 nb_shift = dynar->used-1 - idx;
157 offset = nb_shift * dynar->elmsize;
159 memmove(_xbt_dynar_elm(dynar, idx),
160 _xbt_dynar_elm(dynar, idx+1),
167 xbt_dynar_dump(xbt_dynar_t dynar) {
168 INFO5("Dynar dump: size=%lu; used=%lu; elmsize=%lu; data=%p; free_f=%p",
169 dynar->size, dynar->used, dynar->elmsize, dynar->data, dynar->free_f);
172 /** @brief Constructor
174 * \param elmsize size of each element in the dynar
175 * \param free_f function to call each time we want to get rid of an element (or NULL if nothing to do).
177 * Creates a new dynar. If a free_func is provided, the elements have to be
178 * pointer of pointer. That is to say that dynars can contain either base
179 * types (int, char, double, etc) or pointer of pointers (struct **).
182 xbt_dynar_new(const unsigned long elmsize,
183 void_f_pvoid_t * const free_f) {
185 xbt_dynar_t dynar = xbt_new0(s_xbt_dynar_t,1);
189 dynar->elmsize = elmsize;
191 dynar->free_f = free_f;
197 /** @brief Creates a synchronized dynar.
199 * Just like #xbt_dynar_new, but each access to the structure will be protected by a mutex
203 xbt_dynar_new_sync(const unsigned long elmsize,
204 void_f_pvoid_t * const free_f) {
205 xbt_dynar_t res = xbt_dynar_new(elmsize,free_f);
206 res->mutex = xbt_mutex_init();
210 /** @brief Destructor of the structure not touching to the content
212 * \param dynar poor victim
214 * kilkil a dynar BUT NOT its content. Ie, the array is freed, but the content
215 * is not touched (the \a free_f function is not used)
218 xbt_dynar_free_container(xbt_dynar_t *dynar) {
219 if (dynar && *dynar) {
221 if ((*dynar)->data) {
222 _xbt_clear_mem((*dynar)->data, (*dynar)->size);
223 free((*dynar)->data);
227 xbt_mutex_destroy((*dynar)->mutex);
229 _xbt_clear_mem(*dynar, sizeof(s_xbt_dynar_t));
236 /** @brief Frees the content and set the size to 0
238 * \param dynar who to squeeze
241 xbt_dynar_reset(xbt_dynar_t const dynar) {
244 _sanity_check_dynar(dynar);
246 DEBUG1("Reset the dynar %p",(void*)dynar);
248 xbt_dynar_map(dynar, dynar->free_f);
258 _dynar_unlock(dynar);
260 /* dynar->data = NULL;*/
264 * \brief Shrink the dynar by removing empty slots at the end of the internal array
265 * \param dynar a dynar
266 * \param empty_slots_wanted number of empty slots you want to keep at the end of the
267 * internal array for further insertions
269 * Reduces the internal array size of the dynar to the number of elements plus
270 * \a empty_slots_wanted.
271 * After removing elements from the dynar, you can call this function to make
272 * the dynar use less memory.
273 * Set \a empty_slots_wanted to zero to reduce the dynar internal array as much
275 * Note that if \a empty_slots_wanted is greater than the array size, the internal
276 * array is not expanded and nothing is done.
278 void xbt_dynar_shrink(xbt_dynar_t dynar, int empty_slots_wanted) {
283 size_wanted = dynar->used + empty_slots_wanted;
284 if (size_wanted < dynar->size) {
285 dynar->size = size_wanted;
286 dynar->data = xbt_realloc(dynar->data, sizeof(void*) * dynar->size);
288 _dynar_unlock(dynar);
291 /** @brief Destructor
293 * \param dynar poor victim
295 * kilkil a dynar and its content
299 xbt_dynar_free(xbt_dynar_t * dynar) {
300 if (dynar && *dynar) {
301 xbt_dynar_reset(*dynar);
302 xbt_dynar_free_container(dynar);
305 /** \brief free a dynar passed as void* (handy to store dynar in dynars or dict) */
306 void xbt_dynar_free_voidp(void *d) {
307 xbt_dynar_free( (xbt_dynar_t*) d);
310 /** @brief Count of dynar's elements
312 * \param dynar the dynar we want to mesure
315 xbt_dynar_length(const xbt_dynar_t dynar) {
316 return (dynar ? (unsigned long) dynar->used : (unsigned long)0);
319 /** @brief Retrieve a copy of the Nth element of a dynar.
321 * \param dynar information dealer
322 * \param idx index of the slot we want to retrieve
323 * \param[out] dst where to put the result to.
326 xbt_dynar_get_cpy(const xbt_dynar_t dynar,
330 _sanity_check_dynar(dynar);
331 _sanity_check_idx(idx);
332 _check_inbound_idx(dynar, idx);
334 _xbt_dynar_get_elm(dst, dynar, idx);
335 _dynar_unlock(dynar);
338 /** @brief Retrieve a pointer to the Nth element of a dynar.
340 * \param dynar information dealer
341 * \param idx index of the slot we want to retrieve
342 * \return the \a idx-th element of \a dynar.
344 * \warning The returned value is the actual content of the dynar.
345 * Make a copy before fooling with it.
348 xbt_dynar_get_ptr(const xbt_dynar_t dynar, const int idx) {
352 _sanity_check_dynar(dynar);
353 _sanity_check_idx(idx);
354 _check_inbound_idx(dynar, idx);
356 res = _xbt_dynar_elm(dynar, idx);
357 _dynar_unlock(dynar);
362 static void XBT_INLINE /* not synchronized */
363 _xbt_dynar_set(xbt_dynar_t dynar,
365 const void * const src) {
367 _sanity_check_dynar(dynar);
368 _sanity_check_idx(idx);
370 _xbt_dynar_expand(dynar, idx+1);
372 if (idx >= dynar->used) {
376 _xbt_dynar_put_elm(dynar, idx, src);
379 /** @brief Set the Nth element of a dynar (expended if needed). Previous value at this position is NOT freed
381 * \param dynar information dealer
382 * \param idx index of the slot we want to modify
383 * \param src What will be feeded to the dynar
385 * If you want to free the previous content, use xbt_dynar_replace().
388 xbt_dynar_set(xbt_dynar_t dynar,
390 const void * const src) {
393 _xbt_dynar_set(dynar,idx,src);
394 _dynar_unlock(dynar);
397 /** @brief Set the Nth element of a dynar (expended if needed). Previous value is freed
403 * Set the Nth element of a dynar, expanding the dynar if needed, AND DO
404 * free the previous value at this position. If you don't want to free the
405 * previous content, use xbt_dynar_set().
408 xbt_dynar_replace(xbt_dynar_t dynar,
410 const void * const object) {
412 _sanity_check_dynar(dynar);
413 _sanity_check_idx(idx);
415 if (idx < dynar->used && dynar->free_f) {
416 void * const old_object = _xbt_dynar_elm(dynar, idx);
418 dynar->free_f(old_object);
421 _xbt_dynar_set(dynar, idx, object);
422 _dynar_unlock(dynar);
425 static XBT_INLINE void *
426 _xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar,
430 _sanity_check_dynar(dynar);
431 _sanity_check_idx(idx);
432 _check_sloppy_inbound_idx(dynar, idx);
434 const unsigned long old_used = dynar->used;
435 const unsigned long new_used = old_used + 1;
437 _xbt_dynar_expand(dynar, new_used);
439 const unsigned long nb_shift = old_used - idx;
442 memmove(_xbt_dynar_elm(dynar, idx+1),
443 _xbt_dynar_elm(dynar, idx),
444 nb_shift * dynar->elmsize);
446 dynar->used = new_used;
447 res = _xbt_dynar_elm(dynar,idx);
451 /** @brief Make room for a new element, and return a pointer to it
453 * You can then use regular affectation to set its value instead of relying
454 * on the slow memcpy. This is what xbt_dynar_insert_at_as() does.
457 xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar,
462 res = _xbt_dynar_insert_at_ptr(dynar,idx);
463 _dynar_unlock(dynar);
467 /** @brief Set the Nth dynar's element, expending the dynar and sliding the previous values to the right
469 * Set the Nth element of a dynar, expanding the dynar if needed, and
470 * moving the previously existing value and all subsequent ones to one
471 * position right in the dynar.
474 xbt_dynar_insert_at(xbt_dynar_t const dynar,
476 const void * const src) {
479 /* checks done in xbt_dynar_insert_at_ptr */
480 memcpy(_xbt_dynar_insert_at_ptr(dynar,idx),
483 _dynar_unlock(dynar);
486 /** @brief Remove the Nth dynar's element, sliding the previous values to the left
488 * Get the Nth element of a dynar, removing it from the dynar and moving
489 * all subsequent values to one position left in the dynar.
491 * If the object argument of this function is a non-null pointer, the removed
492 * element is copied to this address. If not, the element is freed using the
493 * free_f function passed at dynar creation.
496 xbt_dynar_remove_at(xbt_dynar_t const dynar,
498 void * const object) {
501 _xbt_dynar_remove_at(dynar, idx, object);
502 _dynar_unlock(dynar);
505 /** @brief Returns the position of the element in the dynar
507 * Raises not_found_error if not found.
510 xbt_dynar_search(xbt_dynar_t const dynar,
515 for (it=0; it< dynar->used; it++)
516 if (!memcmp(_xbt_dynar_elm(dynar, it),elem,dynar->elmsize)) {
517 _dynar_unlock(dynar);
521 _dynar_unlock(dynar);
522 THROW2(not_found_error,0,"Element %p not part of dynar %p",elem,dynar);
525 /** @brief Returns a boolean indicating whether the element is part of the dynar */
527 xbt_dynar_member(xbt_dynar_t const dynar,
533 xbt_dynar_search(dynar,elem);
535 if (e.category == not_found_error) {
544 /** @brief Make room at the end of the dynar for a new element, and return a pointer to it.
546 * You can then use regular affectation to set its value instead of relying
547 * on the slow memcpy. This is what xbt_dynar_push_as() does.
550 xbt_dynar_push_ptr(xbt_dynar_t const dynar) {
551 return xbt_dynar_insert_at_ptr(dynar, dynar->used);
554 /** @brief Add an element at the end of the dynar */
556 xbt_dynar_push(xbt_dynar_t const dynar,
557 const void * const src) {
558 /* sanity checks done by insert_at */
559 xbt_dynar_insert_at(dynar, dynar->used, src);
562 /** @brief Mark the last dynar's element as unused and return a pointer to it.
564 * You can then use regular affectation to set its value instead of relying
565 * on the slow memcpy. This is what xbt_dynar_pop_as() does.
568 xbt_dynar_pop_ptr(xbt_dynar_t const dynar) {
572 _check_populated_dynar(dynar);
573 DEBUG1("Pop %p",(void*)dynar);
575 res = _xbt_dynar_elm(dynar,dynar->used);
576 _dynar_unlock(dynar);
580 /** @brief Get and remove the last element of the dynar */
582 xbt_dynar_pop(xbt_dynar_t const dynar,
585 /* sanity checks done by remove_at */
586 DEBUG1("Pop %p",(void*)dynar);
587 xbt_dynar_remove_at(dynar, dynar->used-1, dst);
590 /** @brief Add an element at the begining of the dynar.
592 * This is less efficient than xbt_dynar_push()
595 xbt_dynar_unshift(xbt_dynar_t const dynar,
596 const void * const src) {
598 /* sanity checks done by insert_at */
599 xbt_dynar_insert_at(dynar, 0, src);
602 /** @brief Get and remove the first element of the dynar.
604 * This is less efficient than xbt_dynar_pop()
607 xbt_dynar_shift(xbt_dynar_t const dynar,
610 /* sanity checks done by remove_at */
611 xbt_dynar_remove_at(dynar, 0, dst);
614 /** @brief Apply a function to each member of a dynar
616 * The mapped function may change the value of the element itself,
617 * but should not mess with the structure of the dynar.
619 * If the dynar is synchronized, it is locked during the whole map
620 * operation, so make sure your function don't call any function
621 * from xbt_dynar_* on it, or you'll get a deadlock.
624 xbt_dynar_map(const xbt_dynar_t dynar,
625 void_f_pvoid_t * const op) {
628 _sanity_check_dynar(dynar);
631 char elm[SIZEOF_MAX];
632 const unsigned long used = dynar->used;
635 for (i = 0; i < used; i++) {
636 _xbt_dynar_get_elm(elm, dynar, i);
640 _dynar_unlock(dynar);
643 /** @brief Put the cursor at the begining of the dynar.
645 * Actually, the cursor is set one step before the begining, so that you
646 * can iterate over the dynar with a for loop.
648 * @warning Do not call this function directly, but only through xbt_dynar_foreach.
651 _xbt_dynar_cursor_first(const xbt_dynar_t dynar,
652 int * const cursor) {
655 DEBUG1("Set cursor on %p to the first position",(void*)dynar);
659 /** @brief Move the cursor to the next value
661 * @warning Do not call this function directly, but only through xbt_dynar_foreach.
664 _xbt_dynar_cursor_step(const xbt_dynar_t dynar,
665 int * const cursor) {
670 /** @brief Get the data currently pointed by the cursor
672 * @warning Do not call this function directly, but only through xbt_dynar_foreach.
675 _xbt_dynar_cursor_get(const xbt_dynar_t dynar,
679 _sanity_check_dynar(dynar);
682 const int idx = *cursor;
684 if (idx >= dynar->used) {
685 DEBUG1("Cursor on %p already on last elem",(void*)dynar);
686 _dynar_unlock(dynar);
689 DEBUG2("Cash out cursor on %p at %d",(void*)dynar,idx);
691 _xbt_dynar_get_elm(dst, dynar, idx);
697 /** @brief Removes and free the entry pointed by the cursor
699 * This function can be used while traversing without problem.
701 void xbt_dynar_cursor_rm(xbt_dynar_t dynar,
702 int * const cursor) {
704 _xbt_dynar_remove_at(dynar,(*cursor)--,NULL);
707 /** @brief Unlocks a synchronized dynar when you want to break the traversal
709 * This function must be used if you <tt>break</tt> the
710 * xbt_dynar_foreach loop, but shouldn't be called at the end of a
711 * regular traversal reaching the end of the elements
713 void xbt_dynar_cursor_unlock(xbt_dynar_t dynar) {
714 _dynar_unlock(dynar);
721 XBT_TEST_SUITE("dynar","Dynar data container");
722 XBT_LOG_EXTERNAL_CATEGORY(xbt_dyn);
723 XBT_LOG_DEFAULT_CATEGORY(xbt_dyn);
725 XBT_TEST_UNIT("int",test_dynar_int,"Dynars of integers") {
726 /* Vars_decl [doxygen cruft] */
731 xbt_test_add0("==== Traverse the empty dynar");
732 d=xbt_dynar_new(sizeof(int),NULL);
733 xbt_dynar_foreach(d,cursor,i){
734 xbt_assert0(0,"Damnit, there is something in the empty dynar");
739 xbt_test_add1("==== Push %d int, set them again 3 times, traverse them, shift them",
741 /* Populate_ints [doxygen cruft] */
742 /* 1. Populate the dynar */
743 d=xbt_dynar_new(sizeof(int),NULL);
744 for (cpt=0; cpt< NB_ELEM; cpt++) {
745 xbt_dynar_push_as(d,int,cpt); /* This is faster (and possible only with scalars) */
746 /* xbt_dynar_push(d,&cpt); This would also work */
747 xbt_test_log2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
750 /* 2. Traverse manually the dynar */
751 for (cursor=0; cursor< NB_ELEM; cursor++) {
752 iptr=xbt_dynar_get_ptr(d,cursor);
753 xbt_test_assert2(cursor == *iptr,
754 "The retrieved value is not the same than the injected one (%d!=%d)",
758 /* 3. Traverse the dynar using the neat macro to that extend */
759 xbt_dynar_foreach(d,cursor,cpt){
760 xbt_test_assert2(cursor == cpt,
761 "The retrieved value is not the same than the injected one (%d!=%d)",
764 /* end_of_traversal */
766 for (cpt=0; cpt< NB_ELEM; cpt++)
767 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
769 for (cpt=0; cpt< NB_ELEM; cpt++)
770 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
771 /* xbt_dynar_set(d,cpt,&cpt);*/
773 for (cpt=0; cpt< NB_ELEM; cpt++)
774 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
777 xbt_dynar_foreach(d,cursor,i){
778 xbt_test_assert2(i == cpt,
779 "The retrieved value is not the same than the injected one (%d!=%d)",
783 xbt_test_assert2(cpt == NB_ELEM,
784 "Cannot retrieve my %d values. Last got one is %d",
787 /* shifting [doxygen cruft] */
788 /* 4. Shift all the values */
789 for (cpt=0; cpt< NB_ELEM; cpt++) {
790 xbt_dynar_shift(d,&i);
791 xbt_test_assert2(i == cpt,
792 "The retrieved value is not the same than the injected one (%d!=%d)",
794 xbt_test_log2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
797 /* 5. Free the resources */
802 xbt_test_add1("==== Unshift/pop %d int",NB_ELEM);
803 d=xbt_dynar_new(sizeof(int),NULL);
804 for (cpt=0; cpt< NB_ELEM; cpt++) {
805 xbt_dynar_unshift(d,&cpt);
806 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
808 for (cpt=0; cpt< NB_ELEM; cpt++) {
809 i=xbt_dynar_pop_as(d,int);
810 xbt_test_assert2(i == cpt,
811 "The retrieved value is not the same than the injected one (%d!=%d)",
813 xbt_test_log2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
819 xbt_test_add1("==== Push %d int, insert 1000 int in the middle, shift everything",NB_ELEM);
820 d=xbt_dynar_new(sizeof(int),NULL);
821 for (cpt=0; cpt< NB_ELEM; cpt++) {
822 xbt_dynar_push_as(d,int,cpt);
823 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
825 for (cpt=0; cpt< 1000; cpt++) {
826 xbt_dynar_insert_at_as(d,2500,int,cpt);
827 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
830 for (cpt=0; cpt< 2500; cpt++) {
831 xbt_dynar_shift(d,&i);
832 xbt_test_assert2(i == cpt,
833 "The retrieved value is not the same than the injected one at the begining (%d!=%d)",
835 DEBUG2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
837 for (cpt=999; cpt>=0; cpt--) {
838 xbt_dynar_shift(d,&i);
839 xbt_test_assert2(i == cpt,
840 "The retrieved value is not the same than the injected one in the middle (%d!=%d)",
843 for (cpt=2500; cpt< NB_ELEM; cpt++) {
844 xbt_dynar_shift(d,&i);
845 xbt_test_assert2(i == cpt,
846 "The retrieved value is not the same than the injected one at the end (%d!=%d)",
853 xbt_test_add1("==== Push %d int, remove 2000-4000. free the rest",NB_ELEM);
854 d=xbt_dynar_new(sizeof(int),NULL);
855 for (cpt=0; cpt< NB_ELEM; cpt++)
856 xbt_dynar_push_as(d,int,cpt);
858 for (cpt=2000; cpt< 4000; cpt++) {
859 xbt_dynar_remove_at(d,2000,&i);
860 xbt_test_assert2(i == cpt,
861 "Remove a bad value. Got %d, expected %d",
863 DEBUG2("remove %d, length=%lu",cpt, xbt_dynar_length(d));
868 /*******************************************************************************/
869 /*******************************************************************************/
870 /*******************************************************************************/
871 XBT_TEST_UNIT("double",test_dynar_double,"Dynars of doubles") {
876 xbt_test_add0("==== Traverse the empty dynar");
877 d=xbt_dynar_new(sizeof(int),NULL);
878 xbt_dynar_foreach(d,cursor,cpt){
879 xbt_test_assert0(FALSE,
880 "Damnit, there is something in the empty dynar");
885 xbt_test_add0("==== Push/shift 5000 doubles");
886 d=xbt_dynar_new(sizeof(double),NULL);
887 for (cpt=0; cpt< 5000; cpt++) {
889 xbt_dynar_push(d,&d1);
891 xbt_dynar_foreach(d,cursor,d2){
893 xbt_test_assert2(d1 == d2,
894 "The retrieved value is not the same than the injected one (%f!=%f)",
897 for (cpt=0; cpt< 5000; cpt++) {
899 xbt_dynar_shift(d,&d2);
900 xbt_test_assert2(d1 == d2,
901 "The retrieved value is not the same than the injected one (%f!=%f)",
908 xbt_test_add0("==== Unshift/pop 5000 doubles");
909 d=xbt_dynar_new(sizeof(double),NULL);
910 for (cpt=0; cpt< 5000; cpt++) {
912 xbt_dynar_unshift(d,&d1);
914 for (cpt=0; cpt< 5000; cpt++) {
916 xbt_dynar_pop(d,&d2);
917 xbt_test_assert2 (d1 == d2,
918 "The retrieved value is not the same than the injected one (%f!=%f)",
926 xbt_test_add0("==== Push 5000 doubles, insert 1000 doubles in the middle, shift everything");
927 d=xbt_dynar_new(sizeof(double),NULL);
928 for (cpt=0; cpt< 5000; cpt++) {
930 xbt_dynar_push(d,&d1);
932 for (cpt=0; cpt< 1000; cpt++) {
934 xbt_dynar_insert_at(d,2500,&d1);
937 for (cpt=0; cpt< 2500; cpt++) {
939 xbt_dynar_shift(d,&d2);
940 xbt_test_assert2(d1 == d2,
941 "The retrieved value is not the same than the injected one at the begining (%f!=%f)",
943 DEBUG2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
945 for (cpt=999; cpt>=0; cpt--) {
947 xbt_dynar_shift(d,&d2);
948 xbt_test_assert2 (d1 == d2,
949 "The retrieved value is not the same than the injected one in the middle (%f!=%f)",
952 for (cpt=2500; cpt< 5000; cpt++) {
954 xbt_dynar_shift(d,&d2);
955 xbt_test_assert2 (d1 == d2,
956 "The retrieved value is not the same than the injected one at the end (%f!=%f)",
963 xbt_test_add0("==== Push 5000 double, remove 2000-4000. free the rest");
964 d=xbt_dynar_new(sizeof(double),NULL);
965 for (cpt=0; cpt< 5000; cpt++) {
967 xbt_dynar_push(d,&d1);
969 for (cpt=2000; cpt< 4000; cpt++) {
971 xbt_dynar_remove_at(d,2000,&d2);
972 xbt_test_assert2 (d1 == d2,
973 "Remove a bad value. Got %f, expected %f",
981 /* doxygen_string_cruft */
983 /* The function we will use to free the data */
984 static void free_string(void *d){
988 /*******************************************************************************/
989 /*******************************************************************************/
990 /*******************************************************************************/
991 XBT_TEST_UNIT("string",test_dynar_string,"Dyars of strings") {
997 xbt_test_add0("==== Traverse the empty dynar");
998 d=xbt_dynar_new(sizeof(char *),&free_string);
999 xbt_dynar_foreach(d,cpt,s1){
1000 xbt_test_assert0(FALSE,
1001 "Damnit, there is something in the empty dynar");
1006 xbt_test_add1("==== Push %d strings, set them again 3 times, shift them",NB_ELEM);
1007 /* Populate_str [doxygen cruft] */
1008 d=xbt_dynar_new(sizeof(char*),&free_string);
1009 /* 1. Populate the dynar */
1010 for (cpt=0; cpt< NB_ELEM; cpt++) {
1011 sprintf(buf,"%d",cpt);
1013 xbt_dynar_push(d,&s1);
1015 for (cpt=0; cpt< NB_ELEM; cpt++) {
1016 sprintf(buf,"%d",cpt);
1018 xbt_dynar_replace(d,cpt,&s1);
1020 for (cpt=0; cpt< NB_ELEM; cpt++) {
1021 sprintf(buf,"%d",cpt);
1023 xbt_dynar_replace(d,cpt,&s1);
1025 for (cpt=0; cpt< NB_ELEM; cpt++) {
1026 sprintf(buf,"%d",cpt);
1028 xbt_dynar_replace(d,cpt,&s1);
1030 for (cpt=0; cpt< NB_ELEM; cpt++) {
1031 sprintf(buf,"%d",cpt);
1032 xbt_dynar_shift(d,&s2);
1033 xbt_test_assert2 (!strcmp(buf,s2),
1034 "The retrieved value is not the same than the injected one (%s!=%s)",
1042 xbt_test_add1("==== Unshift, traverse and pop %d strings",NB_ELEM);
1043 d=xbt_dynar_new(sizeof(char**),&free_string);
1044 for (cpt=0; cpt< NB_ELEM; cpt++) {
1045 sprintf(buf,"%d",cpt);
1047 xbt_dynar_unshift(d,&s1);
1049 /* 2. Traverse the dynar with the macro */
1050 xbt_dynar_foreach(d,cpt,s1) {
1051 sprintf(buf,"%d",NB_ELEM - cpt -1);
1052 xbt_test_assert2 (!strcmp(buf,s1),
1053 "The retrieved value is not the same than the injected one (%s!=%s)",
1056 /* 3. Traverse the dynar with the macro */
1057 for (cpt=0; cpt< NB_ELEM; cpt++) {
1058 sprintf(buf,"%d",cpt);
1059 xbt_dynar_pop(d,&s2);
1060 xbt_test_assert2 (!strcmp(buf,s2),
1061 "The retrieved value is not the same than the injected one (%s!=%s)",
1065 /* 4. Free the resources */
1070 xbt_test_add2("==== Push %d strings, insert %d strings in the middle, shift everything",NB_ELEM,NB_ELEM/5);
1071 d=xbt_dynar_new(sizeof(char*),&free_string);
1072 for (cpt=0; cpt< NB_ELEM; cpt++) {
1073 sprintf(buf,"%d",cpt);
1075 xbt_dynar_push(d,&s1);
1077 for (cpt=0; cpt< NB_ELEM/5; cpt++) {
1078 sprintf(buf,"%d",cpt);
1080 xbt_dynar_insert_at(d,NB_ELEM/2,&s1);
1083 for (cpt=0; cpt< NB_ELEM/2; cpt++) {
1084 sprintf(buf,"%d",cpt);
1085 xbt_dynar_shift(d,&s2);
1086 xbt_test_assert2(!strcmp(buf,s2),
1087 "The retrieved value is not the same than the injected one at the begining (%s!=%s)",
1091 for (cpt=(NB_ELEM/5)-1; cpt>=0; cpt--) {
1092 sprintf(buf,"%d",cpt);
1093 xbt_dynar_shift(d,&s2);
1094 xbt_test_assert2 (!strcmp(buf,s2),
1095 "The retrieved value is not the same than the injected one in the middle (%s!=%s)",
1099 for (cpt=NB_ELEM/2; cpt< NB_ELEM; cpt++) {
1100 sprintf(buf,"%d",cpt);
1101 xbt_dynar_shift(d,&s2);
1102 xbt_test_assert2 (!strcmp(buf,s2),
1103 "The retrieved value is not the same than the injected one at the end (%s!=%s)",
1111 xbt_test_add3("==== Push %d strings, remove %d-%d. free the rest",NB_ELEM,2*(NB_ELEM/5),4*(NB_ELEM/5));
1112 d=xbt_dynar_new(sizeof(char*),&free_string);
1113 for (cpt=0; cpt< NB_ELEM; cpt++) {
1114 sprintf(buf,"%d",cpt);
1116 xbt_dynar_push(d,&s1);
1118 for (cpt=2*(NB_ELEM/5); cpt< 4*(NB_ELEM/5); cpt++) {
1119 sprintf(buf,"%d",cpt);
1120 xbt_dynar_remove_at(d,2*(NB_ELEM/5),&s2);
1121 xbt_test_assert2(!strcmp(buf,s2),
1122 "Remove a bad value. Got %s, expected %s",
1126 xbt_dynar_free(&d); /* end_of_doxygen */
1130 /*******************************************************************************/
1131 /*******************************************************************************/
1132 /*******************************************************************************/
1133 #include "xbt/synchro.h"
1134 static void pusher_f(void *a) {
1135 xbt_dynar_t d=(xbt_dynar_t)a;
1137 for (i=0; i<500; i++) {
1138 xbt_dynar_push(d,&i);
1141 static void poper_f(void *a) {
1142 xbt_dynar_t d=(xbt_dynar_t)a;
1147 for (i=0; i<500; i++) {
1149 xbt_dynar_pop(d,&data);
1151 if (e.category == bound_error) {
1162 XBT_TEST_UNIT("synchronized int",test_dynar_sync_int,"Synchronized dynars of integers") {
1163 /* Vars_decl [doxygen cruft] */
1165 xbt_thread_t pusher,poper;
1167 xbt_test_add0("==== Have a pusher and a popper on the dynar");
1168 d=xbt_dynar_new_sync(sizeof(int),NULL);
1169 pusher = xbt_thread_create(pusher_f,d);
1170 poper = xbt_thread_create(poper_f,d);
1171 xbt_thread_join(pusher);
1172 xbt_thread_join(poper);
1176 #endif /* SIMGRID_TEST */