4 #include "setset_private.h"
5 #include "xbt/sysdep.h"
8 * \brief Create a new setset data structure
9 * \param size The initial size of the setset (in number of elements)
10 * \return The created setset
12 xbt_setset_t xbt_setset_new(unsigned int size)
14 xbt_setset_elm_entry_t first_elm = NULL;
15 xbt_setset_t setset = xbt_new0(s_xbt_setset_t, 1);
16 setset->elm_array = xbt_dynar_new(sizeof(u_xbt_setset_elm_entry_t), NULL);
17 setset->sets = xbt_fifo_new();
18 /* Expand the elements dynar to the size indicated by the user, */
19 /* then create the first element, get a pointer to it and add it to the */
20 /* free elements list */
21 xbt_dynar_shrink(setset->elm_array, size);
22 first_elm = (xbt_setset_elm_entry_t)xbt_dynar_push_ptr(setset->elm_array);
23 first_elm->free.next = 0;
28 * \brief Destroy a setset and free all it's resources
29 * \param The setset to destroy
31 void xbt_setset_destroy(xbt_setset_t setset)
35 xbt_dynar_free(&setset->elm_array);
36 xbt_fifo_foreach(setset->sets, item, set, xbt_setset_set_t){
37 xbt_setset_destroy_set(set);
39 xbt_fifo_free(setset->sets);
43 /* Add an element to the setset, this will assign to it an index */
44 xbt_setset_elm_entry_t _xbt_setset_elm_add(xbt_setset_t setset, void *obj)
46 xbt_setset_elm_entry_t new_entry = NULL;
47 xbt_setset_elm_t e = (xbt_setset_elm_t)obj;
48 xbt_assert0(e->ID == 0, "Adding element with non NULL ID");
49 xbt_setset_elm_entry_t first_elm =
50 (xbt_setset_elm_entry_t)xbt_dynar_get_ptr(setset->elm_array, 0);
52 /* Before create a new elm entry check if there is one in the free elm list. */
53 /* If there is not free elm entries, then create a new one */
54 if(first_elm->free.next != 0){
55 e->ID = first_elm->free.next;
56 new_entry = (xbt_setset_elm_entry_t)xbt_dynar_get_ptr(setset->elm_array, first_elm->free.next);
57 first_elm->free.next = new_entry->free.next;
59 new_entry = (xbt_setset_elm_entry_t)xbt_dynar_push_ptr(setset->elm_array);
60 e->ID = xbt_dynar_length(setset->elm_array) - 1;
62 /* Initialize the new element data structure and add it to the hash */
63 new_entry->info.refcount = 0;
64 new_entry->info.obj = e;
68 /* Remove from the setset the object stored at idx */
69 void _xbt_setset_elm_remove(xbt_setset_t setset, unsigned long idx)
71 xbt_setset_elm_entry_t e_entry = xbt_dynar_get_ptr(setset->elm_array, idx);
72 xbt_setset_elm_entry_t first_free = NULL;
74 /* Decrease the refcount and proceed only if it is 0 */
75 if(--e_entry->info.refcount > 0)
79 /* FIXME: do not assume that the object still exists, it might be deallocated */
80 /*e_entry->info.obj->ID = 0;*/
82 /* Link the elm entry to the list of free ones */
83 first_free = xbt_dynar_get_ptr(setset->elm_array, 0);
84 e_entry->free.next = first_free->free.next;
85 first_free->free.next = idx;
88 /* Get the object associated to a given index */
89 /* WARNING: it must be a valid index! */
90 void *_xbt_setset_idx_to_obj(xbt_setset_t setset, unsigned long idx)
92 xbt_setset_elm_entry_t e_entry = xbt_dynar_get_ptr(setset->elm_array, idx);
93 return e_entry->info.obj;
96 /* Increase the refcount of an element */
97 void _xbt_setset_elm_use(xbt_setset_t setset, unsigned long idx)
99 xbt_setset_elm_entry_t e_entry = xbt_dynar_get_ptr(setset->elm_array, idx);
100 e_entry->info.refcount++;
104 * \brief Add a new set to the setset
105 * \param setset The setset that will contain the created set
106 * \returns The created set
108 xbt_setset_set_t xbt_setset_new_set(xbt_setset_t setset)
110 xbt_setset_set_t newset = xbt_new0(s_xbt_setset_set_t, 1);
111 newset->setset = setset;
112 newset->elmcount = 0;
113 newset->size = xbt_dynar_length(setset->elm_array) / BITS_INT + 1;
114 newset->bitmap = xbt_new0(unsigned int, newset->size);
115 xbt_fifo_unshift(setset->sets, newset);
120 * \brief Destroy a set in the setset
121 * \param set The set to destroy
123 void xbt_setset_destroy_set(xbt_setset_set_t set)
125 xbt_setset_set_reset(set);
126 xbt_free(set->bitmap);
127 xbt_fifo_remove(set->setset->sets, set);
134 * \brief Insert an element into a set
135 * \param set The set where the element is going to be added
136 * \param obj The element to add
138 void xbt_setset_set_insert(xbt_setset_set_t set, void* obj)
140 xbt_setset_elm_t e = (xbt_setset_elm_t)obj;
143 _xbt_setset_elm_add(set->setset, e);
145 /* Check if we need to expand the bitmap */
146 if(set->size * BITS_INT - 1 < e->ID){
147 set->bitmap = xbt_realloc(set->bitmap, (e->ID / BITS_INT + 1) * sizeof(int));
148 memset(&set->bitmap[set->size], 0, ((e->ID / BITS_INT + 1) - set->size) * sizeof(int));
149 set->size = (e->ID / BITS_INT + 1);
152 if(!_is_bit_set(e->ID % BITS_INT, set->bitmap[e->ID / BITS_INT])){
154 _xbt_setset_elm_use(set->setset, e->ID);
155 _set_bit(e->ID, set->bitmap);
162 * \brief Remove an element from a set
163 * \param set The set from which the element is going to be removed
164 * \param obj The element to remove
166 void xbt_setset_set_remove(xbt_setset_set_t set, void* obj)
168 xbt_setset_elm_t e = (xbt_setset_elm_t)obj;
170 /* If the index of the object is between the bitmap then unset it, otherwise
171 do not do anything, because we already know it is not in the set */
172 if(set->size * BITS_INT >= e->ID){
173 if(_is_bit_set(e->ID % BITS_INT, set->bitmap[e->ID / BITS_INT])){
175 _unset_bit(e->ID, set->bitmap);
176 _xbt_setset_elm_remove(set->setset, e->ID);
184 * \brief Remove all the elements of a set
185 * \param set The set to empty
187 void xbt_setset_set_reset(xbt_setset_set_t set)
190 /* Traverse the set and remove every element */
191 for(i=0; i < set->size; i++){
192 if(set->bitmap[i] != 0){
193 for(k=0; k < BITS_INT; k++){
194 if(_is_bit_set(k,set->bitmap[i])){
195 _xbt_setset_elm_remove(set->setset, i * BITS_INT + k);
204 * \brief Choose one element of a set (but do not remove it)
206 * \return An element that belongs to set \a set
208 void *xbt_setset_set_choose(xbt_setset_set_t set)
211 /* Traverse the set and return the first element */
212 for(i=0; i < set->size; i++){
213 if(set->bitmap[i] != 0){
214 for(k=0; k < BITS_INT; k++){
215 if(_is_bit_set(k,set->bitmap[i])){
216 return _xbt_setset_idx_to_obj(set->setset, i * BITS_INT + k);
225 * \brief Extract one element of a set (it removes it)
227 * \return An element that belonged to set \a set
229 void *xbt_setset_set_extract(xbt_setset_set_t set)
231 void *obj = xbt_setset_set_choose(set);
233 xbt_setset_set_remove(set, obj);
240 * \brief Test if an element belongs to a set
242 * \param obj The element
243 * \return TRUE if the element \a obj belongs to set \a set
245 int xbt_setset_set_belongs(xbt_setset_set_t set, void* obj)
247 xbt_setset_elm_t e = (xbt_setset_elm_t)obj;
248 if(e->ID != 0 && e->ID <= set->size * BITS_INT){
249 return _is_bit_set(e->ID % BITS_INT, set->bitmap[e->ID / BITS_INT]);
254 int xbt_setset_set_size(xbt_setset_set_t set)
256 return set->elmcount;
261 * \brief Add two sets
262 * Add two sets storing the result in the first one
263 * \param set1 The first set
264 * \param set2 The second set
266 void xbt_setset_add(xbt_setset_set_t set1, xbt_setset_set_t set2)
268 if(set1->size < set2->size){
269 xbt_realloc(set1->bitmap, set2->size * sizeof(unsigned int));
270 set1->size = set2->size;
274 /* Traverse the second set and add every element that is not member of the
276 for(i=0; i < set2->size; i++){
277 if(set2->bitmap[i] != 0){
278 for(k=0; k < BITS_INT; k++){
279 if(_is_bit_set(k,set2->bitmap[i]) && !_is_bit_set(k, set1->bitmap[i])){
281 _xbt_setset_elm_use(set1->setset, i * BITS_INT + k);
282 _set_bit(i * BITS_INT + k, set1->bitmap);
291 * \brief Substract two sets
292 * Substract two sets storing the result in the first one
293 * \param set1 The first set
294 * \param set2 The second set
296 void xbt_setset_substract(xbt_setset_set_t set1, xbt_setset_set_t set2)
299 /* Traverse the second set and remove every element that is member of it to
301 for(i=0; i < min(set1->size,set2->size); i++){
302 if(set2->bitmap[i] != 0){
303 for(k=0; k < BITS_INT; k++){
304 if(_is_bit_set(k,set2->bitmap[i]) && _is_bit_set(k, set1->bitmap[i])){
306 _xbt_setset_elm_remove(set1->setset, i * BITS_INT + k);
307 _unset_bit(i * BITS_INT + k, set1->bitmap);
316 * \brief Intersect two sets
317 * Intersect two sets storing the result in the first one
318 * \param set1 The first set
319 * \param set2 The second set
321 void xbt_setset_intersect(xbt_setset_set_t set1, xbt_setset_set_t set2)
324 /* Traverse the first set and remove every element that is not member of the second set */
325 for(i=0; i < set1->size; i++){
326 if(set1->bitmap[i] != 0){
327 for(k=0; k < BITS_INT; k++){
328 if(_is_bit_set(k, set1->bitmap[i]) &&
329 (i >= set2->size || !_is_bit_set(k,set2->bitmap[i]))){
331 _xbt_setset_elm_remove(set1->setset, i * BITS_INT + k);
332 _unset_bit(i * BITS_INT + k, set1->bitmap);
340 void xbt_setset_cursor_first(xbt_setset_set_t set, xbt_setset_cursor_t *cursor)
343 (*cursor) = xbt_new0(s_xbt_setset_cursor_t, 1);
344 (*cursor)->set = set;
346 for(i = 0; i < set->size; i++){
347 if(set->bitmap[i] != 0){
348 (*cursor)->idx = i * BITS_INT + ffs(set->bitmap[i]) - 1;
354 /* Get the data pointed by a cursor */
355 int xbt_setset_cursor_get_data(xbt_setset_cursor_t cursor, void **data)
357 if(cursor->idx == 0){
362 *data = _xbt_setset_idx_to_obj(cursor->set->setset, cursor->idx);
367 /* Advance a cursor to the next element */
368 void xbt_setset_cursor_next(xbt_setset_cursor_t cursor)
373 while(cursor->idx < cursor->set->size * BITS_INT)
375 if((data = cursor->set->bitmap[cursor->idx / BITS_INT])){
376 mask = 1 << cursor->idx % BITS_INT;
386 cursor->idx += BITS_INT;
392 /* Check if the nth bit of an integer is set or not*/
393 unsigned int _is_bit_set(unsigned int bit, unsigned int integer)
395 return (0x1 << bit) & integer ? TRUE : FALSE;
398 /* Set the nth bit of an array of integers */
399 void _set_bit(unsigned int bit, unsigned int *bitmap)
401 bitmap[bit / BITS_INT] |= 0x1 << (bit % BITS_INT);
404 /* Unset the nth bit of an array of integers */
405 void _unset_bit(unsigned int bit, unsigned int *bitmap)
407 bitmap[bit / BITS_INT] &= ~(0x1 << (bit % BITS_INT));