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,
429 unsigned long old_used;
430 unsigned long new_used;
431 unsigned long nb_shift;
433 _sanity_check_dynar(dynar);
434 _sanity_check_idx(idx);
435 _check_sloppy_inbound_idx(dynar, idx);
437 old_used = dynar->used;
438 new_used = old_used + 1;
440 _xbt_dynar_expand(dynar, new_used);
442 nb_shift = old_used - idx;
445 memmove(_xbt_dynar_elm(dynar, idx+1),
446 _xbt_dynar_elm(dynar, idx),
447 nb_shift * dynar->elmsize);
449 dynar->used = new_used;
450 res = _xbt_dynar_elm(dynar,idx);
454 /** @brief Make room for a new element, and return a pointer to it
456 * You can then use regular affectation to set its value instead of relying
457 * on the slow memcpy. This is what xbt_dynar_insert_at_as() does.
460 xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar,
465 res = _xbt_dynar_insert_at_ptr(dynar,idx);
466 _dynar_unlock(dynar);
470 /** @brief Set the Nth dynar's element, expending the dynar and sliding the previous values to the right
472 * Set the Nth element of a dynar, expanding the dynar if needed, and
473 * moving the previously existing value and all subsequent ones to one
474 * position right in the dynar.
477 xbt_dynar_insert_at(xbt_dynar_t const dynar,
479 const void * const src) {
482 /* checks done in xbt_dynar_insert_at_ptr */
483 memcpy(_xbt_dynar_insert_at_ptr(dynar,idx),
486 _dynar_unlock(dynar);
489 /** @brief Remove the Nth dynar's element, sliding the previous values to the left
491 * Get the Nth element of a dynar, removing it from the dynar and moving
492 * all subsequent values to one position left in the dynar.
494 * If the object argument of this function is a non-null pointer, the removed
495 * element is copied to this address. If not, the element is freed using the
496 * free_f function passed at dynar creation.
499 xbt_dynar_remove_at(xbt_dynar_t const dynar,
501 void * const object) {
504 _xbt_dynar_remove_at(dynar, idx, object);
505 _dynar_unlock(dynar);
508 /** @brief Returns the position of the element in the dynar
510 * Raises not_found_error if not found.
513 xbt_dynar_search(xbt_dynar_t const dynar,
518 for (it=0; it< dynar->used; it++)
519 if (!memcmp(_xbt_dynar_elm(dynar, it),elem,dynar->elmsize)) {
520 _dynar_unlock(dynar);
524 _dynar_unlock(dynar);
525 THROW2(not_found_error,0,"Element %p not part of dynar %p",elem,dynar);
528 /** @brief Returns a boolean indicating whether the element is part of the dynar */
530 xbt_dynar_member(xbt_dynar_t const dynar,
536 xbt_dynar_search(dynar,elem);
538 if (e.category == not_found_error) {
547 /** @brief Make room at the end of the dynar for a new element, and return a pointer to it.
549 * You can then use regular affectation to set its value instead of relying
550 * on the slow memcpy. This is what xbt_dynar_push_as() does.
553 xbt_dynar_push_ptr(xbt_dynar_t const dynar) {
554 return xbt_dynar_insert_at_ptr(dynar, dynar->used);
557 /** @brief Add an element at the end of the dynar */
559 xbt_dynar_push(xbt_dynar_t const dynar,
560 const void * const src) {
561 /* sanity checks done by insert_at */
562 xbt_dynar_insert_at(dynar, dynar->used, src);
565 /** @brief Mark the last dynar's element as unused and return a pointer to it.
567 * You can then use regular affectation to set its value instead of relying
568 * on the slow memcpy. This is what xbt_dynar_pop_as() does.
571 xbt_dynar_pop_ptr(xbt_dynar_t const dynar) {
575 _check_populated_dynar(dynar);
576 DEBUG1("Pop %p",(void*)dynar);
578 res = _xbt_dynar_elm(dynar,dynar->used);
579 _dynar_unlock(dynar);
583 /** @brief Get and remove the last element of the dynar */
585 xbt_dynar_pop(xbt_dynar_t const dynar,
588 /* sanity checks done by remove_at */
589 DEBUG1("Pop %p",(void*)dynar);
590 xbt_dynar_remove_at(dynar, dynar->used-1, dst);
593 /** @brief Add an element at the begining of the dynar.
595 * This is less efficient than xbt_dynar_push()
598 xbt_dynar_unshift(xbt_dynar_t const dynar,
599 const void * const src) {
601 /* sanity checks done by insert_at */
602 xbt_dynar_insert_at(dynar, 0, src);
605 /** @brief Get and remove the first element of the dynar.
607 * This is less efficient than xbt_dynar_pop()
610 xbt_dynar_shift(xbt_dynar_t const dynar,
613 /* sanity checks done by remove_at */
614 xbt_dynar_remove_at(dynar, 0, dst);
617 /** @brief Apply a function to each member of a dynar
619 * The mapped function may change the value of the element itself,
620 * but should not mess with the structure of the dynar.
622 * If the dynar is synchronized, it is locked during the whole map
623 * operation, so make sure your function don't call any function
624 * from xbt_dynar_* on it, or you'll get a deadlock.
627 xbt_dynar_map(const xbt_dynar_t dynar,
628 void_f_pvoid_t * const op) {
631 _sanity_check_dynar(dynar);
634 char elm[SIZEOF_MAX];
635 const unsigned long used = dynar->used;
638 for (i = 0; i < used; i++) {
639 _xbt_dynar_get_elm(elm, dynar, i);
643 _dynar_unlock(dynar);
646 /** @brief Put the cursor at the begining of the dynar.
648 * Actually, the cursor is set one step before the begining, so that you
649 * can iterate over the dynar with a for loop.
651 * @warning Do not call this function directly, but only through xbt_dynar_foreach.
654 _xbt_dynar_cursor_first(const xbt_dynar_t dynar,
655 int * const cursor) {
658 DEBUG1("Set cursor on %p to the first position",(void*)dynar);
662 /** @brief Move the cursor to the next value
664 * @warning Do not call this function directly, but only through xbt_dynar_foreach.
667 _xbt_dynar_cursor_step(const xbt_dynar_t dynar,
668 int * const cursor) {
673 /** @brief Get the data currently pointed by the cursor
675 * @warning Do not call this function directly, but only through xbt_dynar_foreach.
678 _xbt_dynar_cursor_get(const xbt_dynar_t dynar,
682 _sanity_check_dynar(dynar);
685 const int idx = *cursor;
687 if (idx >= dynar->used) {
688 DEBUG1("Cursor on %p already on last elem",(void*)dynar);
689 _dynar_unlock(dynar);
692 DEBUG2("Cash out cursor on %p at %d",(void*)dynar,idx);
694 _xbt_dynar_get_elm(dst, dynar, idx);
700 /** @brief Removes and free the entry pointed by the cursor
702 * This function can be used while traversing without problem.
704 void xbt_dynar_cursor_rm(xbt_dynar_t dynar,
705 int * const cursor) {
707 _xbt_dynar_remove_at(dynar,(*cursor)--,NULL);
710 /** @brief Unlocks a synchronized dynar when you want to break the traversal
712 * This function must be used if you <tt>break</tt> the
713 * xbt_dynar_foreach loop, but shouldn't be called at the end of a
714 * regular traversal reaching the end of the elements
716 void xbt_dynar_cursor_unlock(xbt_dynar_t dynar) {
717 _dynar_unlock(dynar);
724 XBT_TEST_SUITE("dynar","Dynar data container");
725 XBT_LOG_EXTERNAL_CATEGORY(xbt_dyn);
726 XBT_LOG_DEFAULT_CATEGORY(xbt_dyn);
728 XBT_TEST_UNIT("int",test_dynar_int,"Dynars of integers") {
729 /* Vars_decl [doxygen cruft] */
734 xbt_test_add0("==== Traverse the empty dynar");
735 d=xbt_dynar_new(sizeof(int),NULL);
736 xbt_dynar_foreach(d,cursor,i){
737 xbt_assert0(0,"Damnit, there is something in the empty dynar");
742 xbt_test_add1("==== Push %d int, set them again 3 times, traverse them, shift them",
744 /* Populate_ints [doxygen cruft] */
745 /* 1. Populate the dynar */
746 d=xbt_dynar_new(sizeof(int),NULL);
747 for (cpt=0; cpt< NB_ELEM; cpt++) {
748 xbt_dynar_push_as(d,int,cpt); /* This is faster (and possible only with scalars) */
749 /* xbt_dynar_push(d,&cpt); This would also work */
750 xbt_test_log2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
753 /* 2. Traverse manually the dynar */
754 for (cursor=0; cursor< NB_ELEM; cursor++) {
755 iptr=xbt_dynar_get_ptr(d,cursor);
756 xbt_test_assert2(cursor == *iptr,
757 "The retrieved value is not the same than the injected one (%d!=%d)",
761 /* 3. Traverse the dynar using the neat macro to that extend */
762 xbt_dynar_foreach(d,cursor,cpt){
763 xbt_test_assert2(cursor == cpt,
764 "The retrieved value is not the same than the injected one (%d!=%d)",
767 /* end_of_traversal */
769 for (cpt=0; cpt< NB_ELEM; cpt++)
770 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
772 for (cpt=0; cpt< NB_ELEM; cpt++)
773 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
774 /* xbt_dynar_set(d,cpt,&cpt);*/
776 for (cpt=0; cpt< NB_ELEM; cpt++)
777 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
780 xbt_dynar_foreach(d,cursor,i){
781 xbt_test_assert2(i == cpt,
782 "The retrieved value is not the same than the injected one (%d!=%d)",
786 xbt_test_assert2(cpt == NB_ELEM,
787 "Cannot retrieve my %d values. Last got one is %d",
790 /* shifting [doxygen cruft] */
791 /* 4. Shift all the values */
792 for (cpt=0; cpt< NB_ELEM; cpt++) {
793 xbt_dynar_shift(d,&i);
794 xbt_test_assert2(i == cpt,
795 "The retrieved value is not the same than the injected one (%d!=%d)",
797 xbt_test_log2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
800 /* 5. Free the resources */
805 xbt_test_add1("==== Unshift/pop %d int",NB_ELEM);
806 d=xbt_dynar_new(sizeof(int),NULL);
807 for (cpt=0; cpt< NB_ELEM; cpt++) {
808 xbt_dynar_unshift(d,&cpt);
809 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
811 for (cpt=0; cpt< NB_ELEM; cpt++) {
812 i=xbt_dynar_pop_as(d,int);
813 xbt_test_assert2(i == cpt,
814 "The retrieved value is not the same than the injected one (%d!=%d)",
816 xbt_test_log2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
822 xbt_test_add1("==== Push %d int, insert 1000 int in the middle, shift everything",NB_ELEM);
823 d=xbt_dynar_new(sizeof(int),NULL);
824 for (cpt=0; cpt< NB_ELEM; cpt++) {
825 xbt_dynar_push_as(d,int,cpt);
826 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
828 for (cpt=0; cpt< 1000; cpt++) {
829 xbt_dynar_insert_at_as(d,2500,int,cpt);
830 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
833 for (cpt=0; cpt< 2500; cpt++) {
834 xbt_dynar_shift(d,&i);
835 xbt_test_assert2(i == cpt,
836 "The retrieved value is not the same than the injected one at the begining (%d!=%d)",
838 DEBUG2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
840 for (cpt=999; cpt>=0; cpt--) {
841 xbt_dynar_shift(d,&i);
842 xbt_test_assert2(i == cpt,
843 "The retrieved value is not the same than the injected one in the middle (%d!=%d)",
846 for (cpt=2500; cpt< NB_ELEM; cpt++) {
847 xbt_dynar_shift(d,&i);
848 xbt_test_assert2(i == cpt,
849 "The retrieved value is not the same than the injected one at the end (%d!=%d)",
856 xbt_test_add1("==== Push %d int, remove 2000-4000. free the rest",NB_ELEM);
857 d=xbt_dynar_new(sizeof(int),NULL);
858 for (cpt=0; cpt< NB_ELEM; cpt++)
859 xbt_dynar_push_as(d,int,cpt);
861 for (cpt=2000; cpt< 4000; cpt++) {
862 xbt_dynar_remove_at(d,2000,&i);
863 xbt_test_assert2(i == cpt,
864 "Remove a bad value. Got %d, expected %d",
866 DEBUG2("remove %d, length=%lu",cpt, xbt_dynar_length(d));
871 /*******************************************************************************/
872 /*******************************************************************************/
873 /*******************************************************************************/
874 XBT_TEST_UNIT("double",test_dynar_double,"Dynars of doubles") {
879 xbt_test_add0("==== Traverse the empty dynar");
880 d=xbt_dynar_new(sizeof(int),NULL);
881 xbt_dynar_foreach(d,cursor,cpt){
882 xbt_test_assert0(FALSE,
883 "Damnit, there is something in the empty dynar");
888 xbt_test_add0("==== Push/shift 5000 doubles");
889 d=xbt_dynar_new(sizeof(double),NULL);
890 for (cpt=0; cpt< 5000; cpt++) {
892 xbt_dynar_push(d,&d1);
894 xbt_dynar_foreach(d,cursor,d2){
896 xbt_test_assert2(d1 == d2,
897 "The retrieved value is not the same than the injected one (%f!=%f)",
900 for (cpt=0; cpt< 5000; cpt++) {
902 xbt_dynar_shift(d,&d2);
903 xbt_test_assert2(d1 == d2,
904 "The retrieved value is not the same than the injected one (%f!=%f)",
911 xbt_test_add0("==== Unshift/pop 5000 doubles");
912 d=xbt_dynar_new(sizeof(double),NULL);
913 for (cpt=0; cpt< 5000; cpt++) {
915 xbt_dynar_unshift(d,&d1);
917 for (cpt=0; cpt< 5000; cpt++) {
919 xbt_dynar_pop(d,&d2);
920 xbt_test_assert2 (d1 == d2,
921 "The retrieved value is not the same than the injected one (%f!=%f)",
929 xbt_test_add0("==== Push 5000 doubles, insert 1000 doubles in the middle, shift everything");
930 d=xbt_dynar_new(sizeof(double),NULL);
931 for (cpt=0; cpt< 5000; cpt++) {
933 xbt_dynar_push(d,&d1);
935 for (cpt=0; cpt< 1000; cpt++) {
937 xbt_dynar_insert_at(d,2500,&d1);
940 for (cpt=0; cpt< 2500; cpt++) {
942 xbt_dynar_shift(d,&d2);
943 xbt_test_assert2(d1 == d2,
944 "The retrieved value is not the same than the injected one at the begining (%f!=%f)",
946 DEBUG2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
948 for (cpt=999; cpt>=0; cpt--) {
950 xbt_dynar_shift(d,&d2);
951 xbt_test_assert2 (d1 == d2,
952 "The retrieved value is not the same than the injected one in the middle (%f!=%f)",
955 for (cpt=2500; cpt< 5000; cpt++) {
957 xbt_dynar_shift(d,&d2);
958 xbt_test_assert2 (d1 == d2,
959 "The retrieved value is not the same than the injected one at the end (%f!=%f)",
966 xbt_test_add0("==== Push 5000 double, remove 2000-4000. free the rest");
967 d=xbt_dynar_new(sizeof(double),NULL);
968 for (cpt=0; cpt< 5000; cpt++) {
970 xbt_dynar_push(d,&d1);
972 for (cpt=2000; cpt< 4000; cpt++) {
974 xbt_dynar_remove_at(d,2000,&d2);
975 xbt_test_assert2 (d1 == d2,
976 "Remove a bad value. Got %f, expected %f",
984 /* doxygen_string_cruft */
986 /* The function we will use to free the data */
987 static void free_string(void *d){
991 /*******************************************************************************/
992 /*******************************************************************************/
993 /*******************************************************************************/
994 XBT_TEST_UNIT("string",test_dynar_string,"Dyars of strings") {
1000 xbt_test_add0("==== Traverse the empty dynar");
1001 d=xbt_dynar_new(sizeof(char *),&free_string);
1002 xbt_dynar_foreach(d,cpt,s1){
1003 xbt_test_assert0(FALSE,
1004 "Damnit, there is something in the empty dynar");
1009 xbt_test_add1("==== Push %d strings, set them again 3 times, shift them",NB_ELEM);
1010 /* Populate_str [doxygen cruft] */
1011 d=xbt_dynar_new(sizeof(char*),&free_string);
1012 /* 1. Populate the dynar */
1013 for (cpt=0; cpt< NB_ELEM; cpt++) {
1014 sprintf(buf,"%d",cpt);
1016 xbt_dynar_push(d,&s1);
1018 for (cpt=0; cpt< NB_ELEM; cpt++) {
1019 sprintf(buf,"%d",cpt);
1021 xbt_dynar_replace(d,cpt,&s1);
1023 for (cpt=0; cpt< NB_ELEM; cpt++) {
1024 sprintf(buf,"%d",cpt);
1026 xbt_dynar_replace(d,cpt,&s1);
1028 for (cpt=0; cpt< NB_ELEM; cpt++) {
1029 sprintf(buf,"%d",cpt);
1031 xbt_dynar_replace(d,cpt,&s1);
1033 for (cpt=0; cpt< NB_ELEM; cpt++) {
1034 sprintf(buf,"%d",cpt);
1035 xbt_dynar_shift(d,&s2);
1036 xbt_test_assert2 (!strcmp(buf,s2),
1037 "The retrieved value is not the same than the injected one (%s!=%s)",
1045 xbt_test_add1("==== Unshift, traverse and pop %d strings",NB_ELEM);
1046 d=xbt_dynar_new(sizeof(char**),&free_string);
1047 for (cpt=0; cpt< NB_ELEM; cpt++) {
1048 sprintf(buf,"%d",cpt);
1050 xbt_dynar_unshift(d,&s1);
1052 /* 2. Traverse the dynar with the macro */
1053 xbt_dynar_foreach(d,cpt,s1) {
1054 sprintf(buf,"%d",NB_ELEM - cpt -1);
1055 xbt_test_assert2 (!strcmp(buf,s1),
1056 "The retrieved value is not the same than the injected one (%s!=%s)",
1059 /* 3. Traverse the dynar with the macro */
1060 for (cpt=0; cpt< NB_ELEM; cpt++) {
1061 sprintf(buf,"%d",cpt);
1062 xbt_dynar_pop(d,&s2);
1063 xbt_test_assert2 (!strcmp(buf,s2),
1064 "The retrieved value is not the same than the injected one (%s!=%s)",
1068 /* 4. Free the resources */
1073 xbt_test_add2("==== Push %d strings, insert %d strings in the middle, shift everything",NB_ELEM,NB_ELEM/5);
1074 d=xbt_dynar_new(sizeof(char*),&free_string);
1075 for (cpt=0; cpt< NB_ELEM; cpt++) {
1076 sprintf(buf,"%d",cpt);
1078 xbt_dynar_push(d,&s1);
1080 for (cpt=0; cpt< NB_ELEM/5; cpt++) {
1081 sprintf(buf,"%d",cpt);
1083 xbt_dynar_insert_at(d,NB_ELEM/2,&s1);
1086 for (cpt=0; cpt< NB_ELEM/2; cpt++) {
1087 sprintf(buf,"%d",cpt);
1088 xbt_dynar_shift(d,&s2);
1089 xbt_test_assert2(!strcmp(buf,s2),
1090 "The retrieved value is not the same than the injected one at the begining (%s!=%s)",
1094 for (cpt=(NB_ELEM/5)-1; cpt>=0; cpt--) {
1095 sprintf(buf,"%d",cpt);
1096 xbt_dynar_shift(d,&s2);
1097 xbt_test_assert2 (!strcmp(buf,s2),
1098 "The retrieved value is not the same than the injected one in the middle (%s!=%s)",
1102 for (cpt=NB_ELEM/2; cpt< NB_ELEM; cpt++) {
1103 sprintf(buf,"%d",cpt);
1104 xbt_dynar_shift(d,&s2);
1105 xbt_test_assert2 (!strcmp(buf,s2),
1106 "The retrieved value is not the same than the injected one at the end (%s!=%s)",
1114 xbt_test_add3("==== Push %d strings, remove %d-%d. free the rest",NB_ELEM,2*(NB_ELEM/5),4*(NB_ELEM/5));
1115 d=xbt_dynar_new(sizeof(char*),&free_string);
1116 for (cpt=0; cpt< NB_ELEM; cpt++) {
1117 sprintf(buf,"%d",cpt);
1119 xbt_dynar_push(d,&s1);
1121 for (cpt=2*(NB_ELEM/5); cpt< 4*(NB_ELEM/5); cpt++) {
1122 sprintf(buf,"%d",cpt);
1123 xbt_dynar_remove_at(d,2*(NB_ELEM/5),&s2);
1124 xbt_test_assert2(!strcmp(buf,s2),
1125 "Remove a bad value. Got %s, expected %s",
1129 xbt_dynar_free(&d); /* end_of_doxygen */
1133 /*******************************************************************************/
1134 /*******************************************************************************/
1135 /*******************************************************************************/
1136 #include "xbt/synchro.h"
1137 static void pusher_f(void *a) {
1138 xbt_dynar_t d=(xbt_dynar_t)a;
1140 for (i=0; i<500; i++) {
1141 xbt_dynar_push(d,&i);
1144 static void poper_f(void *a) {
1145 xbt_dynar_t d=(xbt_dynar_t)a;
1150 for (i=0; i<500; i++) {
1152 xbt_dynar_pop(d,&data);
1154 if (e.category == bound_error) {
1165 XBT_TEST_UNIT("synchronized int",test_dynar_sync_int,"Synchronized dynars of integers") {
1166 /* Vars_decl [doxygen cruft] */
1168 xbt_thread_t pusher,poper;
1170 xbt_test_add0("==== Have a pusher and a popper on the dynar");
1171 d=xbt_dynar_new_sync(sizeof(int),NULL);
1172 pusher = xbt_thread_create("pusher",pusher_f,d);
1173 poper = xbt_thread_create("poper",poper_f,d);
1174 xbt_thread_join(pusher);
1175 xbt_thread_join(poper);
1179 #endif /* SIMGRID_TEST */