1 /* Copyright (c) 2010-2012, 2014. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
10 #include "setset_private.h"
11 #include "xbt/sysdep.h"
12 #include "internal_config.h" /*_XBT_WIN32*/
14 /*The function ffs doesn't exist for windows*/
21 for (i = 1;; i++, bits >>= 1) {
30 * \brief Create a new setset data structure
31 * \param size The initial size of the setset (in number of elements)
32 * \return The created setset
34 xbt_setset_t xbt_setset_new(unsigned int size)
36 xbt_setset_elm_entry_t first_elm = NULL;
37 xbt_setset_t setset = xbt_new0(s_xbt_setset_t, 1);
39 xbt_dynar_new(sizeof(u_xbt_setset_elm_entry_t), NULL);
40 setset->sets = xbt_fifo_new();
41 /* Expand the elements dynar to the size indicated by the user, */
42 /* then create the first element, get a pointer to it and add it to the */
43 /* free elements list */
44 xbt_dynar_shrink(setset->elm_array, size);
46 (xbt_setset_elm_entry_t) xbt_dynar_push_ptr(setset->elm_array);
47 first_elm->free.next = 0;
52 * \brief Destroy a setset and free all it's resources
53 * \param The setset to destroy
55 void xbt_setset_destroy(xbt_setset_t setset)
59 xbt_dynar_free(&setset->elm_array);
60 xbt_fifo_foreach(setset->sets, item, set, xbt_setset_set_t) {
61 xbt_setset_destroy_set(set);
63 xbt_fifo_free(setset->sets);
67 /* Add an object to the setset, this will calculate its ID */
68 void xbt_setset_elm_add(xbt_setset_t setset, void *obj)
70 xbt_setset_elm_entry_t new_entry = NULL;
71 xbt_setset_elm_entry_t first_elm = NULL;
72 xbt_setset_elm_t e = (xbt_setset_elm_t) obj;
73 xbt_assert(e->ID == 0, "Adding element with non NULL ID");
75 (xbt_setset_elm_entry_t) xbt_dynar_get_ptr(setset->elm_array, 0);
77 /* Before create a new elm entry check if there is one in the free elm list. */
78 /* If there is not free elm entries, then create a new one */
79 if (first_elm->free.next != 0) {
80 e->ID = first_elm->free.next;
82 (xbt_setset_elm_entry_t) xbt_dynar_get_ptr(setset->elm_array,
83 first_elm->free.next);
84 first_elm->free.next = new_entry->free.next;
87 (xbt_setset_elm_entry_t) xbt_dynar_push_ptr(setset->elm_array);
88 e->ID = xbt_dynar_length(setset->elm_array) - 1;
91 new_entry->info.obj = e;
95 /* Remove an object from the setset */
96 void xbt_setset_elm_remove(xbt_setset_t setset, void *obj)
98 xbt_setset_elm_t e = (xbt_setset_elm_t) obj;
99 xbt_setset_elm_entry_t e_entry =
100 xbt_dynar_get_ptr(setset->elm_array, e->ID);
101 xbt_setset_elm_entry_t first_free = NULL;
103 /* Link the elm entry to the list of free ones */
104 first_free = xbt_dynar_get_ptr(setset->elm_array, 0);
105 e_entry->free.next = first_free->free.next;
106 first_free->free.next = e->ID;
109 /* Get the object associated to a given index */
110 /* WARNING: it must be a valid index! */
111 void *_xbt_setset_idx_to_obj(xbt_setset_t setset, unsigned long idx)
113 xbt_setset_elm_entry_t e_entry =
114 xbt_dynar_get_ptr(setset->elm_array, idx);
115 return e_entry->info.obj;
119 * \brief Add a new set to the setset
120 * \param setset The setset that will contain the created set
121 * \returns The created set
123 xbt_setset_set_t xbt_setset_new_set(xbt_setset_t setset)
125 xbt_setset_set_t newset = xbt_new0(s_xbt_setset_set_t, 1);
126 newset->setset = setset;
127 newset->size = xbt_dynar_length(setset->elm_array) / BITS_INT + 1;
128 newset->bitmap = xbt_new0(unsigned int, newset->size);
129 xbt_fifo_unshift(setset->sets, newset);
134 * \brief Destroy a set in the setset
135 * \param set The set to destroy
137 void xbt_setset_destroy_set(xbt_setset_set_t set)
139 xbt_free(set->bitmap);
140 xbt_fifo_remove(set->setset->sets, set);
147 * \brief Insert an element into a set
148 * \param set The set where the element is going to be added
149 * \param obj The element to add
151 void xbt_setset_set_insert(xbt_setset_set_t set, void *obj)
153 xbt_setset_elm_t e = (xbt_setset_elm_t) obj;
156 xbt_setset_elm_add(set->setset, e);
158 /* Check if we need to expand the bitmap */
159 if (set->size * BITS_INT - 1 < e->ID) {
161 xbt_realloc(set->bitmap, (e->ID / BITS_INT + 1) * sizeof(int));
162 memset(&set->bitmap[set->size], 0,
163 ((e->ID / BITS_INT + 1) - set->size) * sizeof(int));
164 set->size = (e->ID / BITS_INT + 1);
167 _set_bit(e->ID, set->bitmap);
173 * \brief Remove an element from a set
174 * \param set The set from which the element is going to be removed
175 * \param obj The element to remove
177 void xbt_setset_set_remove(xbt_setset_set_t set, void *obj)
179 xbt_setset_elm_t e = (xbt_setset_elm_t) obj;
180 /* If the index of the object is between the bitmap then unset it, otherwise
181 do not do anything, because we already know it is not in the set */
182 if (e->ID != 0 && e->ID <= set->size * BITS_INT)
183 _unset_bit(e->ID, set->bitmap);
189 * \brief Remove all the elements of a set
190 * \param set The set to empty
192 void xbt_setset_set_reset(xbt_setset_set_t set)
194 memset(set->bitmap, 0, set->size * sizeof(int));
198 * \brief Choose one element of a set (but do not remove it)
200 * \return An element that belongs to set \a set
202 void *xbt_setset_set_choose(xbt_setset_set_t set)
205 /* Traverse the set and return the first element */
206 for (i = 0; i < set->size; i++)
207 if (set->bitmap[i] != 0)
208 return _xbt_setset_idx_to_obj(set->setset,
209 i * BITS_INT + ffs(set->bitmap[i]) -
215 * \brief Extract one element of a set (it removes it)
217 * \return An element that belonged to set \a set
219 void *xbt_setset_set_extract(xbt_setset_set_t set)
221 void *obj = xbt_setset_set_choose(set);
223 xbt_setset_set_remove(set, obj);
230 * \brief Test if an element belongs to a set
232 * \param obj The element
233 * \return TRUE if the element \a obj belongs to set \a set
235 int xbt_setset_set_belongs(xbt_setset_set_t set, void *obj)
237 xbt_setset_elm_t e = (xbt_setset_elm_t) obj;
238 if (e->ID != 0 && e->ID <= set->size * BITS_INT) {
239 return _is_bit_set(e->ID % BITS_INT, set->bitmap[e->ID / BITS_INT]);
244 int xbt_setset_set_size(xbt_setset_set_t set)
248 for (i = 0; i < set->size; i++)
249 count += bitcount(set->bitmap[i]);
256 * \brief Add two sets
257 * Add two sets storing the result in the first one
258 * \param set1 The first set
259 * \param set2 The second set
261 void xbt_setset_add(xbt_setset_set_t set1, xbt_setset_set_t set2)
265 /* Increase the size of set1 if necessary */
266 if (set1->size < set2->size) {
267 xbt_realloc(set1->bitmap, set2->size * sizeof(unsigned int));
268 set1->size = set2->size;
271 for (i = 0; i < set1->size; i++)
272 if (set2->bitmap[i] != 0)
273 set1->bitmap[i] |= set2->bitmap[i];
279 * \brief Substract two sets
280 * Substract two sets storing the result in the first one
281 * \param set1 The first set
282 * \param set2 The second set
284 void xbt_setset_substract(xbt_setset_set_t set1, xbt_setset_set_t set2)
288 for (i = 0; i < MIN(set1->size, set2->size); i++)
289 if (set2->bitmap[i] != 0)
290 set1->bitmap[i] ^= set2->bitmap[i];
296 * \brief Intersect two sets
297 * Intersect two sets storing the result in the first one
298 * \param set1 The first set
299 * \param set2 The second set
301 void xbt_setset_intersect(xbt_setset_set_t set1, xbt_setset_set_t set2)
305 for (i = 0; i < MIN(set1->size, set2->size); i++)
306 if (set1->bitmap[i] && set2->bitmap[i])
307 set1->bitmap[i] &= set2->bitmap[i];
312 /* Get a cursor pointing to the first element of the set */
313 void xbt_setset_cursor_first(xbt_setset_set_t set,
314 xbt_setset_cursor_t * cursor)
317 (*cursor) = xbt_new0(s_xbt_setset_cursor_t, 1);
318 (*cursor)->set = set;
320 for (i = 0; i < set->size; i++) {
321 if (set->bitmap[i] != 0) {
322 (*cursor)->idx = i * BITS_INT + ffs(set->bitmap[i]) - 1;
328 /* Get the data pointed by a cursor */
329 int xbt_setset_cursor_get_data(xbt_setset_cursor_t cursor, void **data)
331 if (cursor->idx == 0) {
336 *data = _xbt_setset_idx_to_obj(cursor->set->setset, cursor->idx);
341 /* Advance a cursor to the next element */
342 void xbt_setset_cursor_next(xbt_setset_cursor_t cursor)
347 while (cursor->idx < cursor->set->size * BITS_INT) {
348 if ((data = cursor->set->bitmap[cursor->idx / BITS_INT])) {
349 mask = 1 << cursor->idx % BITS_INT;
350 while (mask) { /* FIXME: mask will never be 0! */
359 cursor->idx += BITS_INT;
365 /* Check if the nth bit of an integer is set or not*/
366 unsigned int _is_bit_set(unsigned int bit, unsigned int integer)
368 return (0x1 << bit) & integer ? TRUE : FALSE;
371 /* Set the nth bit of an array of integers */
372 void _set_bit(unsigned int bit, unsigned int *bitmap)
374 bitmap[bit / BITS_INT] |= 0x1 << (bit % BITS_INT);
377 /* Unset the nth bit of an array of integers */
378 void _unset_bit(unsigned int bit, unsigned int *bitmap)
380 bitmap[bit / BITS_INT] &= ~(0x1 << (bit % BITS_INT));
385 * taken from http://graphics.stanford.edu/~seander/bithacks.html
386 * Note: it assumes 4 byte integers
390 v = v - ((v >> 1) & 0x55555555); // reuse input as temporary
391 v = (v & 0x33333333) + ((v >> 2) & 0x33333333); // temp
392 return (((v + (v >> 4)) & 0xF0F0F0F) * 0x1010101) >> 24; // count