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 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_dyn,xbt,"Dynamic arrays");
24 #define __sanity_check_dynar(dynar) \
27 #define __sanity_check_idx(idx) \
28 xbt_assert1(idx >= 0, \
29 "dynar idx(=%d) < 0", \
31 #define __check_inbound_idx(dynar, idx) \
32 xbt_assert2(idx < dynar->used, \
33 "dynar is not that long. You asked %d, but it's only %lu long", \
34 (int) (idx), (unsigned long) dynar->used)
35 #define __check_sloppy_inbound_idx(dynar, idx) \
36 xbt_assert2(idx <= dynar->used, \
37 "dynar is not that long. You asked %d, but it's only %lu long (could have been equal to it)", \
38 (int) (idx), (unsigned long) dynar->used)
39 #define __check_populated_dynar(dynar) \
40 xbt_assert1(dynar->used, \
41 "dynar %p contains nothing",(void*)dynar)
44 void _xbt_clear_mem(void * const ptr,
45 const unsigned long length) {
46 memset(ptr, 0, length);
51 _xbt_dynar_expand(xbt_dynar_t const dynar,
53 const unsigned long old_size = dynar->size;
56 char * const old_data = (char *) dynar->data;
58 const unsigned long elmsize = dynar->elmsize;
59 const unsigned long old_length = old_size*elmsize;
61 const unsigned long used = dynar->used;
62 const unsigned long used_length = used*elmsize;
64 const unsigned long new_size = nb > (2*(old_size+1)) ? nb : (2*(old_size+1));
65 const unsigned long new_length = new_size*elmsize;
66 char * const new_data = (char *) xbt_malloc0(elmsize*new_size);
68 DEBUG3("expend %p from %lu to %d elements", (void*)dynar, (unsigned long)old_size, nb);
71 memcpy(new_data, old_data, used_length);
72 _xbt_clear_mem(old_data, old_length);
76 _xbt_clear_mem(new_data + used_length, new_length - used_length);
78 dynar->size = new_size;
79 dynar->data = new_data;
85 _xbt_dynar_elm(const xbt_dynar_t dynar,
86 const unsigned long idx) {
87 char * const data = (char*) dynar->data;
88 const unsigned long elmsize = dynar->elmsize;
90 return data + idx*elmsize;
95 _xbt_dynar_get_elm(void * const dst,
96 const xbt_dynar_t dynar,
97 const unsigned long idx) {
98 void * const elm = _xbt_dynar_elm(dynar, idx);
100 memcpy(dst, elm, dynar->elmsize);
105 _xbt_dynar_put_elm(const xbt_dynar_t dynar,
106 const unsigned long idx,
107 const void * const src) {
108 void * const elm = _xbt_dynar_elm(dynar, idx);
109 const unsigned long elmsize = dynar->elmsize;
111 memcpy(elm, src, elmsize);
115 xbt_dynar_dump(xbt_dynar_t dynar) {
116 INFO5("Dynar dump: size=%lu; used=%lu; elmsize=%lu; data=%p; free_f=%p",
117 dynar->size, dynar->used, dynar->elmsize, dynar->data, dynar->free_f);
120 /** @brief Constructor
122 * \param elmsize size of each element in the dynar
123 * \param free_f function to call each time we want to get rid of an element (or NULL if nothing to do).
125 * Creates a new dynar. If a free_func is provided, the elements have to be
126 * pointer of pointer. That is to say that dynars can contain either base
127 * types (int, char, double, etc) or pointer of pointers (struct **).
130 xbt_dynar_new(const unsigned long elmsize,
131 void_f_pvoid_t * const free_f) {
133 xbt_dynar_t dynar = xbt_new0(s_xbt_dynar_t,1);
137 dynar->elmsize = elmsize;
139 dynar->free_f = free_f;
144 /** @brief Destructor of the structure not touching to the content
146 * \param dynar poor victim
148 * kilkil a dynar BUT NOT its content. Ie, the array is freed, but the content
149 * is not touched (the \a free_f function is not used)
152 xbt_dynar_free_container(xbt_dynar_t *dynar) {
153 if (dynar && *dynar) {
155 if ((*dynar)->data) {
156 _xbt_clear_mem((*dynar)->data, (*dynar)->size);
157 free((*dynar)->data);
160 _xbt_clear_mem(*dynar, sizeof(s_xbt_dynar_t));
167 /** @brief Frees the content and set the size to 0
169 * \param dynar who to squeeze
172 xbt_dynar_reset(xbt_dynar_t const dynar) {
174 __sanity_check_dynar(dynar);
176 DEBUG1("Reset the dynar %p",(void*)dynar);
178 xbt_dynar_map(dynar, dynar->free_f);
187 /* dynar->data = NULL;*/
191 * \brief Shrink the dynar by removing empty slots at the end of the internal array
192 * \param dynar a dynar
193 * \param empty_slots_wanted number of empty slots you want to keep at the end of the
194 * internal array for further insertions
196 * Reduces the internal array size of the dynar to the number of elements plus
197 * \a empty_slots_wanted.
198 * After removing elements from the dynar, you can call this function to make
199 * the dynar use less memory.
200 * Set \a empty_slots_wanted to zero to reduce the dynar internal array as much
202 * Note that if \a empty_slots_wanted is greater than the array size, the internal
203 * array is not expanded and nothing is done.
205 void xbt_dynar_shrink(xbt_dynar_t dynar, int empty_slots_wanted) {
206 int size_wanted = dynar->used + empty_slots_wanted;
207 if (size_wanted < dynar->size) {
208 dynar->size = size_wanted;
209 dynar->data = xbt_realloc(dynar->data, sizeof(void*) * dynar->size);
213 /** @brief Destructor
215 * \param dynar poor victim
217 * kilkil a dynar and its content
221 xbt_dynar_free(xbt_dynar_t * dynar) {
222 if (dynar && *dynar) {
223 xbt_dynar_reset(*dynar);
224 xbt_dynar_free_container(dynar);
227 /** \brief free a dynar passed as void* (handy to store dynar in dynars or dict) */
228 void xbt_dynar_free_voidp(void *d) {
229 xbt_dynar_free( (xbt_dynar_t*) d);
232 /** @brief Count of dynar's elements
234 * \param dynar the dynar we want to mesure
237 xbt_dynar_length(const xbt_dynar_t dynar) {
238 return (dynar ? (unsigned long) dynar->used : (unsigned long)0);
241 /** @brief Retrieve a copy of the Nth element of a dynar.
243 * \param dynar information dealer
244 * \param idx index of the slot we want to retrieve
245 * \param[out] dst where to put the result to.
248 xbt_dynar_get_cpy(const xbt_dynar_t dynar,
252 __sanity_check_dynar(dynar);
253 __sanity_check_idx(idx);
254 __check_inbound_idx(dynar, idx);
256 _xbt_dynar_get_elm(dst, dynar, idx);
259 /** @brief Retrieve a pointer to the Nth element of a dynar.
261 * \param dynar information dealer
262 * \param idx index of the slot we want to retrieve
263 * \return the \a idx-th element of \a dynar.
265 * \warning The returned value is the actual content of the dynar.
266 * Make a copy before fooling with it.
269 xbt_dynar_get_ptr(const xbt_dynar_t dynar, const int idx) {
271 __sanity_check_dynar(dynar);
272 __sanity_check_idx(idx);
273 __check_inbound_idx(dynar, idx);
275 return _xbt_dynar_elm(dynar, idx);
278 /** @brief Set the Nth element of a dynar (expended if needed). Previous value at this position is NOT freed
280 * \param dynar information dealer
281 * \param idx index of the slot we want to modify
282 * \param src What will be feeded to the dynar
284 * If you want to free the previous content, use xbt_dynar_replace().
287 xbt_dynar_set(xbt_dynar_t dynar,
289 const void * const src) {
291 __sanity_check_dynar(dynar);
292 __sanity_check_idx(idx);
294 _xbt_dynar_expand(dynar, idx+1);
296 if (idx >= dynar->used) {
300 _xbt_dynar_put_elm(dynar, idx, src);
303 /** @brief Set the Nth element of a dynar (expended if needed). Previous value is freed
309 * Set the Nth element of a dynar, expanding the dynar if needed, AND DO
310 * free the previous value at this position. If you don't want to free the
311 * previous content, use xbt_dynar_set().
314 xbt_dynar_replace(xbt_dynar_t dynar,
316 const void * const object) {
318 __sanity_check_dynar(dynar);
319 __sanity_check_idx(idx);
321 if (idx < dynar->used && dynar->free_f) {
322 void * const old_object = _xbt_dynar_elm(dynar, idx);
324 dynar->free_f(old_object);
327 xbt_dynar_set(dynar, idx, object);
330 /** @brief Make room for a new element, and return a pointer to it
332 * You can then use regular affectation to set its value instead of relying
333 * on the slow memcpy. This is what xbt_dynar_insert_at_as() does.
336 xbt_dynar_insert_at_ptr(xbt_dynar_t const dynar,
339 __sanity_check_dynar(dynar);
340 __sanity_check_idx(idx);
341 __check_sloppy_inbound_idx(dynar, idx);
344 const unsigned long old_used = dynar->used;
345 const unsigned long new_used = old_used + 1;
347 _xbt_dynar_expand(dynar, new_used);
350 const unsigned long nb_shift = old_used - idx;
353 memmove(_xbt_dynar_elm(dynar, idx+1),
354 _xbt_dynar_elm(dynar, idx),
355 nb_shift * dynar->elmsize);
358 dynar->used = new_used;
359 return _xbt_dynar_elm(dynar,idx);
363 /** @brief Set the Nth dynar's element, expending the dynar and sliding the previous values to the right
365 * Set the Nth element of a dynar, expanding the dynar if needed, and
366 * moving the previously existing value and all subsequent ones to one
367 * position right in the dynar.
370 xbt_dynar_insert_at(xbt_dynar_t const dynar,
372 const void * const src) {
374 /* checks done in xbt_dynar_insert_at_ptr */
375 memcpy(xbt_dynar_insert_at_ptr(dynar,idx),
380 /** @brief Remove the Nth dynar's element, sliding the previous values to the left
382 * Get the Nth element of a dynar, removing it from the dynar and moving
383 * all subsequent values to one position left in the dynar.
385 * If the object argument of this function is a non-null pointer, the removed
386 * element is copied to this address. If not, the element is freed using the
387 * free_f function passed at dynar creation.
390 xbt_dynar_remove_at(xbt_dynar_t const dynar,
392 void * const object) {
394 unsigned long nb_shift;
395 unsigned long offset;
397 __sanity_check_dynar(dynar);
398 __sanity_check_idx(idx);
399 __check_inbound_idx(dynar, idx);
402 _xbt_dynar_get_elm(object, dynar, idx);
403 } else if (dynar->free_f) {
404 if (dynar->elmsize <= SIZEOF_MAX) {
405 char elm[SIZEOF_MAX];
406 _xbt_dynar_get_elm(elm, dynar, idx);
407 (*dynar->free_f)(elm);
409 char *elm=malloc(dynar->elmsize);
410 _xbt_dynar_get_elm(elm, dynar, idx);
411 (*dynar->free_f)(elm);
416 nb_shift = dynar->used-1 - idx;
417 offset = nb_shift * dynar->elmsize;
419 memmove(_xbt_dynar_elm(dynar, idx),
420 _xbt_dynar_elm(dynar, idx+1),
426 /** @brief Returns the position of the element in the dynar
428 * Raises not_found_error if not found.
431 xbt_dynar_search(xbt_dynar_t const dynar,
435 for (it=0; it< dynar->used; it++)
436 if (!memcmp(_xbt_dynar_elm(dynar, it),elem,dynar->elmsize))
439 THROW2(not_found_error,0,"Element %p not part of dynar %p",elem,dynar);
442 /** @brief Returns a boolean indicating whether the element is part of the dynar */
444 xbt_dynar_member(xbt_dynar_t const dynar,
450 xbt_dynar_search(dynar,elem);
452 if (e.category == not_found_error) {
461 /** @brief Make room at the end of the dynar for a new element, and return a pointer to it.
463 * You can then use regular affectation to set its value instead of relying
464 * on the slow memcpy. This is what xbt_dynar_push_as() does.
467 xbt_dynar_push_ptr(xbt_dynar_t const dynar) {
468 return xbt_dynar_insert_at_ptr(dynar, dynar->used);
471 /** @brief Add an element at the end of the dynar */
473 xbt_dynar_push(xbt_dynar_t const dynar,
474 const void * const src) {
475 /* sanity checks done by insert_at */
476 xbt_dynar_insert_at(dynar, dynar->used, src);
479 /** @brief Mark the last dynar's element as unused and return a pointer to it.
481 * You can then use regular affectation to set its value instead of relying
482 * on the slow memcpy. This is what xbt_dynar_pop_as() does.
485 xbt_dynar_pop_ptr(xbt_dynar_t const dynar) {
487 __check_populated_dynar(dynar);
488 DEBUG1("Pop %p",(void*)dynar);
490 return _xbt_dynar_elm(dynar,dynar->used);
493 /** @brief Get and remove the last element of the dynar */
495 xbt_dynar_pop(xbt_dynar_t const dynar,
498 /* sanity checks done by remove_at */
499 DEBUG1("Pop %p",(void*)dynar);
500 xbt_dynar_remove_at(dynar, dynar->used-1, dst);
503 /** @brief Add an element at the begining of the dynar.
505 * This is less efficient than xbt_dynar_push()
508 xbt_dynar_unshift(xbt_dynar_t const dynar,
509 const void * const src) {
511 /* sanity checks done by insert_at */
512 xbt_dynar_insert_at(dynar, 0, src);
515 /** @brief Get and remove the first element of the dynar.
517 * This is less efficient than xbt_dynar_pop()
520 xbt_dynar_shift(xbt_dynar_t const dynar,
523 /* sanity checks done by remove_at */
524 xbt_dynar_remove_at(dynar, 0, dst);
527 /** @brief Apply a function to each member of a dynar
529 * The mapped function may change the value of the element itself,
530 * but should not mess with the structure of the dynar.
533 xbt_dynar_map(const xbt_dynar_t dynar,
534 void_f_pvoid_t * const op) {
536 __sanity_check_dynar(dynar);
539 char elm[SIZEOF_MAX];
540 const unsigned long used = dynar->used;
543 for (i = 0; i < used; i++) {
544 _xbt_dynar_get_elm(elm, dynar, i);
550 /** @brief Put the cursor at the begining of the dynar.
552 * Actually, the cursor is set one step before the begining, so that you
553 * can iterate over the dynar with a for loop.
556 xbt_dynar_cursor_first(const xbt_dynar_t dynar,
557 int * const cursor) {
559 DEBUG1("Set cursor on %p to the first position",(void*)dynar);
563 /** @brief Move the cursor to the next value */
565 xbt_dynar_cursor_step(const xbt_dynar_t dynar,
566 int * const cursor) {
571 /** @brief Get the data currently pointed by the cursor */
573 xbt_dynar_cursor_get(const xbt_dynar_t dynar,
577 __sanity_check_dynar(dynar);
580 const int idx = *cursor;
582 if (idx >= dynar->used) {
583 DEBUG1("Cursor on %p already on last elem",(void*)dynar);
586 DEBUG2("Cash out cursor on %p at %d",(void*)dynar,idx);
588 _xbt_dynar_get_elm(dst, dynar, idx);
594 /** @brief Removes and free the entry pointed by the cursor
596 * This function can be used while traversing without problem.
598 void xbt_dynar_cursor_rm(xbt_dynar_t dynar,
599 int * const cursor) {
601 xbt_dynar_remove_at(dynar,(*cursor)--,NULL);
608 XBT_TEST_SUITE("dynar","Dynar data container");
609 XBT_LOG_EXTERNAL_CATEGORY(xbt_dyn);
610 XBT_LOG_DEFAULT_CATEGORY(xbt_dyn);
612 XBT_TEST_UNIT("int",test_dynar_int,"Dyars of integers") {
613 /* Vars_decl [doxygen cruft] */
618 xbt_test_add0("==== Traverse the empty dynar");
619 d=xbt_dynar_new(sizeof(int),NULL);
620 xbt_dynar_foreach(d,cursor,i){
621 xbt_assert0(0,"Damnit, there is something in the empty dynar");
626 xbt_test_add1("==== Push %d int, set them again 3 times, traverse them, shift them",
628 /* Populate_ints [doxygen cruft] */
629 /* 1. Populate the dynar */
630 d=xbt_dynar_new(sizeof(int),NULL);
631 for (cpt=0; cpt< NB_ELEM; cpt++) {
632 xbt_dynar_push_as(d,int,cpt); /* This is faster (and possible only with scalars) */
633 /* xbt_dynar_push(d,&cpt); This would also work */
634 xbt_test_log2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
637 /* 2. Traverse manually the dynar */
638 for (cursor=0; cursor< NB_ELEM; cursor++) {
639 iptr=xbt_dynar_get_ptr(d,cursor);
640 xbt_test_assert2(cursor == *iptr,
641 "The retrieved value is not the same than the injected one (%d!=%d)",
645 /* 3. Traverse the dynar using the neat macro to that extend */
646 xbt_dynar_foreach(d,cursor,cpt){
647 xbt_test_assert2(cursor == cpt,
648 "The retrieved value is not the same than the injected one (%d!=%d)",
651 /* end_of_traversal */
653 for (cpt=0; cpt< NB_ELEM; cpt++)
654 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
656 for (cpt=0; cpt< NB_ELEM; cpt++)
657 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
658 /* xbt_dynar_set(d,cpt,&cpt);*/
660 for (cpt=0; cpt< NB_ELEM; cpt++)
661 *(int*)xbt_dynar_get_ptr(d,cpt) = cpt;
664 xbt_dynar_foreach(d,cursor,i){
665 xbt_test_assert2(i == cpt,
666 "The retrieved value is not the same than the injected one (%d!=%d)",
670 xbt_test_assert2(cpt == NB_ELEM,
671 "Cannot retrieve my %d values. Last got one is %d",
674 /* shifting [doxygen cruft] */
675 /* 4. Shift all the values */
676 for (cpt=0; cpt< NB_ELEM; cpt++) {
677 xbt_dynar_shift(d,&i);
678 xbt_test_assert2(i == cpt,
679 "The retrieved value is not the same than the injected one (%d!=%d)",
681 xbt_test_log2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
684 /* 5. Free the resources */
689 xbt_test_add1("==== Unshift/pop %d int",NB_ELEM);
690 d=xbt_dynar_new(sizeof(int),NULL);
691 for (cpt=0; cpt< NB_ELEM; cpt++) {
692 xbt_dynar_unshift(d,&cpt);
693 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
695 for (cpt=0; cpt< NB_ELEM; cpt++) {
696 i=xbt_dynar_pop_as(d,int);
697 xbt_test_assert2(i == cpt,
698 "The retrieved value is not the same than the injected one (%d!=%d)",
700 xbt_test_log2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
706 xbt_test_add1("==== Push %d int, insert 1000 int in the middle, shift everything",NB_ELEM);
707 d=xbt_dynar_new(sizeof(int),NULL);
708 for (cpt=0; cpt< NB_ELEM; cpt++) {
709 xbt_dynar_push_as(d,int,cpt);
710 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
712 for (cpt=0; cpt< 1000; cpt++) {
713 xbt_dynar_insert_at_as(d,2500,int,cpt);
714 DEBUG2("Push %d, length=%lu",cpt, xbt_dynar_length(d));
717 for (cpt=0; cpt< 2500; cpt++) {
718 xbt_dynar_shift(d,&i);
719 xbt_test_assert2(i == cpt,
720 "The retrieved value is not the same than the injected one at the begining (%d!=%d)",
722 DEBUG2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
724 for (cpt=999; cpt>=0; cpt--) {
725 xbt_dynar_shift(d,&i);
726 xbt_test_assert2(i == cpt,
727 "The retrieved value is not the same than the injected one in the middle (%d!=%d)",
730 for (cpt=2500; cpt< NB_ELEM; cpt++) {
731 xbt_dynar_shift(d,&i);
732 xbt_test_assert2(i == cpt,
733 "The retrieved value is not the same than the injected one at the end (%d!=%d)",
740 xbt_test_add1("==== Push %d int, remove 2000-4000. free the rest",NB_ELEM);
741 d=xbt_dynar_new(sizeof(int),NULL);
742 for (cpt=0; cpt< NB_ELEM; cpt++)
743 xbt_dynar_push_as(d,int,cpt);
745 for (cpt=2000; cpt< 4000; cpt++) {
746 xbt_dynar_remove_at(d,2000,&i);
747 xbt_test_assert2(i == cpt,
748 "Remove a bad value. Got %d, expected %d",
750 DEBUG2("remove %d, length=%lu",cpt, xbt_dynar_length(d));
756 XBT_TEST_UNIT("double",test_dynar_double,"Dyars of doubles") {
761 xbt_test_add0("==== Traverse the empty dynar");
762 d=xbt_dynar_new(sizeof(int),NULL);
763 xbt_dynar_foreach(d,cursor,cpt){
764 xbt_test_assert0(FALSE,
765 "Damnit, there is something in the empty dynar");
770 xbt_test_add0("==== Push/shift 5000 doubles");
771 d=xbt_dynar_new(sizeof(double),NULL);
772 for (cpt=0; cpt< 5000; cpt++) {
774 xbt_dynar_push(d,&d1);
776 xbt_dynar_foreach(d,cursor,d2){
778 xbt_test_assert2(d1 == d2,
779 "The retrieved value is not the same than the injected one (%f!=%f)",
782 for (cpt=0; cpt< 5000; cpt++) {
784 xbt_dynar_shift(d,&d2);
785 xbt_test_assert2(d1 == d2,
786 "The retrieved value is not the same than the injected one (%f!=%f)",
793 xbt_test_add0("==== Unshift/pop 5000 doubles");
794 d=xbt_dynar_new(sizeof(double),NULL);
795 for (cpt=0; cpt< 5000; cpt++) {
797 xbt_dynar_unshift(d,&d1);
799 for (cpt=0; cpt< 5000; cpt++) {
801 xbt_dynar_pop(d,&d2);
802 xbt_test_assert2 (d1 == d2,
803 "The retrieved value is not the same than the injected one (%f!=%f)",
811 xbt_test_add0("==== Push 5000 doubles, insert 1000 doubles in the middle, shift everything");
812 d=xbt_dynar_new(sizeof(double),NULL);
813 for (cpt=0; cpt< 5000; cpt++) {
815 xbt_dynar_push(d,&d1);
817 for (cpt=0; cpt< 1000; cpt++) {
819 xbt_dynar_insert_at(d,2500,&d1);
822 for (cpt=0; cpt< 2500; cpt++) {
824 xbt_dynar_shift(d,&d2);
825 xbt_test_assert2(d1 == d2,
826 "The retrieved value is not the same than the injected one at the begining (%f!=%f)",
828 DEBUG2("Pop %d, length=%lu",cpt, xbt_dynar_length(d));
830 for (cpt=999; cpt>=0; cpt--) {
832 xbt_dynar_shift(d,&d2);
833 xbt_test_assert2 (d1 == d2,
834 "The retrieved value is not the same than the injected one in the middle (%f!=%f)",
837 for (cpt=2500; cpt< 5000; cpt++) {
839 xbt_dynar_shift(d,&d2);
840 xbt_test_assert2 (d1 == d2,
841 "The retrieved value is not the same than the injected one at the end (%f!=%f)",
848 xbt_test_add0("==== Push 5000 double, remove 2000-4000. free the rest");
849 d=xbt_dynar_new(sizeof(double),NULL);
850 for (cpt=0; cpt< 5000; cpt++) {
852 xbt_dynar_push(d,&d1);
854 for (cpt=2000; cpt< 4000; cpt++) {
856 xbt_dynar_remove_at(d,2000,&d2);
857 xbt_test_assert2 (d1 == d2,
858 "Remove a bad value. Got %f, expected %f",
866 /* doxygen_string_cruft */
868 /* The function we will use to free the data */
869 static void free_string(void *d){
873 XBT_TEST_UNIT("string",test_dynar_string,"Dyars of strings") {
879 xbt_test_add0("==== Traverse the empty dynar");
880 d=xbt_dynar_new(sizeof(char *),&free_string);
881 xbt_dynar_foreach(d,cpt,s1){
882 xbt_test_assert0(FALSE,
883 "Damnit, there is something in the empty dynar");
888 xbt_test_add1("==== Push %d strings, set them again 3 times, shift them",NB_ELEM);
889 /* Populate_str [doxygen cruft] */
890 d=xbt_dynar_new(sizeof(char*),&free_string);
891 /* 1. Populate the dynar */
892 for (cpt=0; cpt< NB_ELEM; cpt++) {
893 sprintf(buf,"%d",cpt);
895 xbt_dynar_push(d,&s1);
897 for (cpt=0; cpt< NB_ELEM; cpt++) {
898 sprintf(buf,"%d",cpt);
900 xbt_dynar_replace(d,cpt,&s1);
902 for (cpt=0; cpt< NB_ELEM; cpt++) {
903 sprintf(buf,"%d",cpt);
905 xbt_dynar_replace(d,cpt,&s1);
907 for (cpt=0; cpt< NB_ELEM; cpt++) {
908 sprintf(buf,"%d",cpt);
910 xbt_dynar_replace(d,cpt,&s1);
912 for (cpt=0; cpt< NB_ELEM; cpt++) {
913 sprintf(buf,"%d",cpt);
914 xbt_dynar_shift(d,&s2);
915 xbt_test_assert2 (!strcmp(buf,s2),
916 "The retrieved value is not the same than the injected one (%s!=%s)",
924 xbt_test_add1("==== Unshift, traverse and pop %d strings",NB_ELEM);
925 d=xbt_dynar_new(sizeof(char**),&free_string);
926 for (cpt=0; cpt< NB_ELEM; cpt++) {
927 sprintf(buf,"%d",cpt);
929 xbt_dynar_unshift(d,&s1);
931 /* 2. Traverse the dynar with the macro */
932 xbt_dynar_foreach(d,cpt,s1) {
933 sprintf(buf,"%d",NB_ELEM - cpt -1);
934 xbt_test_assert2 (!strcmp(buf,s1),
935 "The retrieved value is not the same than the injected one (%s!=%s)",
938 /* 3. Traverse the dynar with the macro */
939 for (cpt=0; cpt< NB_ELEM; cpt++) {
940 sprintf(buf,"%d",cpt);
941 xbt_dynar_pop(d,&s2);
942 xbt_test_assert2 (!strcmp(buf,s2),
943 "The retrieved value is not the same than the injected one (%s!=%s)",
947 /* 4. Free the resources */
952 xbt_test_add2("==== Push %d strings, insert %d strings in the middle, shift everything",NB_ELEM,NB_ELEM/5);
953 d=xbt_dynar_new(sizeof(char*),&free_string);
954 for (cpt=0; cpt< NB_ELEM; cpt++) {
955 sprintf(buf,"%d",cpt);
957 xbt_dynar_push(d,&s1);
959 for (cpt=0; cpt< NB_ELEM/5; cpt++) {
960 sprintf(buf,"%d",cpt);
962 xbt_dynar_insert_at(d,NB_ELEM/2,&s1);
965 for (cpt=0; cpt< NB_ELEM/2; cpt++) {
966 sprintf(buf,"%d",cpt);
967 xbt_dynar_shift(d,&s2);
968 xbt_test_assert2(!strcmp(buf,s2),
969 "The retrieved value is not the same than the injected one at the begining (%s!=%s)",
973 for (cpt=(NB_ELEM/5)-1; cpt>=0; cpt--) {
974 sprintf(buf,"%d",cpt);
975 xbt_dynar_shift(d,&s2);
976 xbt_test_assert2 (!strcmp(buf,s2),
977 "The retrieved value is not the same than the injected one in the middle (%s!=%s)",
981 for (cpt=NB_ELEM/2; cpt< NB_ELEM; cpt++) {
982 sprintf(buf,"%d",cpt);
983 xbt_dynar_shift(d,&s2);
984 xbt_test_assert2 (!strcmp(buf,s2),
985 "The retrieved value is not the same than the injected one at the end (%s!=%s)",
993 xbt_test_add3("==== Push %d strings, remove %d-%d. free the rest",NB_ELEM,2*(NB_ELEM/5),4*(NB_ELEM/5));
994 d=xbt_dynar_new(sizeof(char*),&free_string);
995 for (cpt=0; cpt< NB_ELEM; cpt++) {
996 sprintf(buf,"%d",cpt);
998 xbt_dynar_push(d,&s1);
1000 for (cpt=2*(NB_ELEM/5); cpt< 4*(NB_ELEM/5); cpt++) {
1001 sprintf(buf,"%d",cpt);
1002 xbt_dynar_remove_at(d,2*(NB_ELEM/5),&s2);
1003 xbt_test_assert2(!strcmp(buf,s2),
1004 "Remove a bad value. Got %s, expected %s",
1008 xbt_dynar_free(&d); /* end_of_doxygen */
1010 #endif /* SIMGRID_TEST */