1 /* Copyright (c) 2004-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. */
7 #include "xbt/sysdep.h"
9 #include "xbt/mallocator.h"
10 #include "fifo_private.h"
11 #include "src/xbt_modinter.h"
13 XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_fifo, xbt, "FIFO");
15 static void *fifo_item_mallocator_new_f(void);
16 #define fifo_item_mallocator_free_f xbt_free_f
17 static void fifo_item_mallocator_reset_f(void *item);
19 static xbt_mallocator_t item_mallocator = NULL;
24 xbt_fifo_t xbt_fifo_new(void)
27 fifo = xbt_new0(struct xbt_fifo, 1);
33 * \param l poor victim
35 * Free the fifo structure. None of the objects that was in the fifo is however modified.
37 void xbt_fifo_free(xbt_fifo_t l)
44 * \brief Makes a fifo empty.
47 * None of the objects that was in the fifo is however modified.
49 void xbt_fifo_reset(xbt_fifo_t l)
51 xbt_fifo_item_t b = xbt_fifo_get_first_item(l);
54 xbt_fifo_item_t tmp = b;
56 xbt_fifo_free_item(tmp);
65 * \return the bucket that was just added
67 * Add an object at the tail of the list
69 xbt_fifo_item_t xbt_fifo_push(xbt_fifo_t l, void *t)
73 new = xbt_fifo_new_item();
76 xbt_fifo_push_item(l, new);
82 * \returns the object stored at the tail of the list.
84 * Removes and returns the object stored at the tail of the list.
85 * Returns NULL if the list is empty.
87 void *xbt_fifo_pop(xbt_fifo_t l)
93 xbt_fifo_item_t item = xbt_fifo_pop_item(l);
97 content = item->content;
98 xbt_fifo_free_item(item);
105 * \return the bucket that was just added
107 * Add an object at the head of the list
109 xbt_fifo_item_t xbt_fifo_unshift(xbt_fifo_t l, void *t)
113 new = xbt_fifo_new_item();
115 xbt_fifo_unshift_item(l, new);
121 * \returns the object stored at the head of the list.
123 * Removes and returns the object stored at the head of the list.
124 * Returns NULL if the list is empty.
126 void *xbt_fifo_shift(xbt_fifo_t l)
132 xbt_fifo_item_t item = xbt_fifo_shift_item(l);
136 content = item->content;
137 xbt_fifo_free_item(item);
145 * Hook up this bucket at the tail of the list
147 void xbt_fifo_push_item(xbt_fifo_t l, xbt_fifo_item_t new)
149 xbt_assert((new->next == NULL) && (new->prev == NULL), "Invalid item!");
151 if (l->head == NULL) {
157 new->prev->next = new;
163 * \returns the bucket that was at the tail of the list.
165 * Returns NULL if the list was empty.
167 xbt_fifo_item_t xbt_fifo_pop_item(xbt_fifo_t l)
169 xbt_fifo_item_t item;
176 l->tail = item->prev;
180 l->tail->next = NULL;
193 * Hook up this bucket at the head of the list
195 void xbt_fifo_unshift_item(xbt_fifo_t l, xbt_fifo_item_t new)
197 xbt_assert((new->next == NULL) && (new->prev == NULL), "Invalid item!");
199 if (l->head == NULL) {
205 new->next->prev = new;
212 * \returns the bucket that was at the head of the list.
214 * Returns NULL if the list was empty.
216 xbt_fifo_item_t xbt_fifo_shift_item(xbt_fifo_t l)
218 xbt_fifo_item_t item;
225 l->head = item->next;
229 l->head->prev = NULL;
242 * removes the first occurrence of \a t from \a l.
243 * \warning it will not remove duplicates
244 * \return 1 if an item was removed and 0 otherwise.
246 int xbt_fifo_remove(xbt_fifo_t l, void *t)
248 xbt_fifo_item_t current, current_next;
250 for (current = l->head; current; current = current_next) {
251 current_next = current->next;
252 if (current->content == t) {
253 /* remove the item */
254 xbt_fifo_remove_item(l, current);
255 xbt_fifo_free_item(current);
256 /* WILL NOT REMOVE DUPLICATES */
267 * removes all occurrences of \a t from \a l.
268 * \return 1 if an item was removed and 0 otherwise.
270 int xbt_fifo_remove_all(xbt_fifo_t l, void *t)
272 xbt_fifo_item_t current, current_next;
275 for (current = l->head; current; current = current_next) {
276 current_next = current->next;
277 if (current->content == t){
278 /* remove the item */
279 xbt_fifo_remove_item(l, current);
280 xbt_fifo_free_item(current);
289 * \param current a bucket
291 * removes a bucket \a current from the list \a l. This function implicitly
292 * assumes (and doesn't check!) that this item belongs to this list...
294 void xbt_fifo_remove_item(xbt_fifo_t l, xbt_fifo_item_t current)
296 if (l->head == l->tail) { /* special case */
297 xbt_assert((current == l->head), "This item is not in the list!");
301 current->prev = NULL;
302 current->next = NULL;
306 if (current == l->head) { /* It's the head */
307 l->head = current->next;
308 l->head->prev = NULL;
309 } else if (current == l->tail) { /* It's the tail */
310 l->tail = current->prev;
311 l->tail->next = NULL;
312 } else { /* It's in the middle */
313 current->prev->next = current->next;
314 current->next->prev = current->prev;
317 current->prev = NULL;
318 current->next = NULL;
323 * \param content an object
324 * \return 1 if \a content is in \a f.
326 int xbt_fifo_is_in(xbt_fifo_t f, void *content)
328 xbt_fifo_item_t item = xbt_fifo_get_first_item(f);
330 if (item->content == content)
338 * @brief Search the given element in the fifo using a comparison function
340 * This function allows to search an item with a user provided function instead
341 * of the pointer comparison used elsewhere in this module. Assume for example that you have a fifo of
342 * strings. You cannot use xbt_fifo_remove() to remove, say, "TOTO" from it because internally, xbt_fifo_remove()
343 * will do something like "if (item->content == "toto"), then remove it". And the pointer to the item content and the
344 * pointer to "toto" will never match. As a solution, the current function provides a way to search elements that are
345 * semantically equivalent instead of only syntactically. So, removing "Toto" from a fifo can be achieved this way:
348 int my_comparison_function(void *searched, void *seen) {
349 return !strcmp(searched, seen);
352 xbt_fifo_remove_item(fifo, xbt_fifo_search_item(fifo, my_comparison_function, "Toto"));
355 * \param f a fifo list
356 * \param cmp_fun the comparison function. Prototype: void *a,void *b -> int. Semantic: returns true iff a=b
357 * @param closure the element to search. It will be provided as first argument to each call of cmp_fun
358 * \return the first item matching the comparison function, or NULL if no such item exists
360 xbt_fifo_item_t xbt_fifo_search_item(xbt_fifo_t f, int_f_pvoid_pvoid_t cmp_fun, void *closure) {
361 xbt_fifo_item_t item = xbt_fifo_get_first_item(f);
363 if (cmp_fun(closure, item->content))
372 * \return a table with the objects stored in \a f.
374 void **xbt_fifo_to_array(xbt_fifo_t f)
383 array = xbt_new0(void *, f->count);
385 for (i = 0, b = xbt_fifo_get_first_item(f); b; i++, b = b->next) {
386 array[i] = b->content;
393 * \return a copy of \a f.
395 xbt_fifo_t xbt_fifo_copy(xbt_fifo_t f)
397 xbt_fifo_t copy = NULL;
400 copy = xbt_fifo_new();
402 for (b = xbt_fifo_get_first_item(f); b; b = b->next) {
403 xbt_fifo_push(copy, b->content);
408 /* Functions passed to the mallocator constructor */
409 static void *fifo_item_mallocator_new_f(void)
411 return xbt_new(s_xbt_fifo_item_t, 1);
414 static void fifo_item_mallocator_reset_f(void *item)
416 /* memset to zero like calloc */
417 memset(item, 0, sizeof(s_xbt_fifo_item_t));
421 * \return a new bucket
423 inline xbt_fifo_item_t xbt_fifo_new_item(void)
425 return xbt_mallocator_get(item_mallocator);
428 /** \deprecated Use #xbt_fifo_new_item instead.
430 inline xbt_fifo_item_t xbt_fifo_newitem(void)
432 XBT_CWARN(xbt_fifo, "This function is deprecated. Use xbt_fifo_new_item.");
433 return xbt_fifo_new_item();
440 * stores \a v in \a i.
442 inline void xbt_fifo_set_item_content(xbt_fifo_item_t i, void *v)
444 xbt_fifo_setItemcontent(i, v);
449 * \return the object stored \a i.
451 inline void *xbt_fifo_get_item_content(xbt_fifo_item_t i)
453 return xbt_fifo_getItemcontent(i);
457 * \param b poor victim
459 * Free the bucket but does not modifies the object (if any) that was stored in it.
461 inline void xbt_fifo_free_item(xbt_fifo_item_t b)
463 xbt_mallocator_release(item_mallocator, b);
468 * \deprecated Use #xbt_fifo_free_item instead.
470 inline void xbt_fifo_freeitem(xbt_fifo_item_t b)
472 XBT_CWARN(xbt_fifo, "This function is deprecated. Use xbt_fifo_free_item.");
473 xbt_fifo_free_item(b);
479 * \return the number of buckets in \a f.
481 inline int xbt_fifo_size(xbt_fifo_t f)
488 * \return the head of \a l.
490 * Returns NULL if the list is empty.
492 inline xbt_fifo_item_t xbt_fifo_get_first_item(xbt_fifo_t l)
499 * \return the tail of \a l.
501 * Returns NULL if the list is empty.
503 inline xbt_fifo_item_t xbt_fifo_get_last_item(xbt_fifo_t l)
508 /** \deprecated Use #xbt_fifo_get_first_item instead.
510 inline xbt_fifo_item_t xbt_fifo_getFirstItem(xbt_fifo_t l)
512 XBT_CWARN(xbt_fifo, "This function is deprecated. Use xbt_fifo_get_first_item.");
513 return xbt_fifo_get_first_item(l);
518 * \return the bucket that comes next
520 * Returns NULL if \a i is the tail of the list.
522 inline xbt_fifo_item_t xbt_fifo_get_next_item(xbt_fifo_item_t i)
529 /** \deprecated Use #xbt_fifo_get_next_item instead.
531 xbt_fifo_item_t xbt_fifo_getNextItem(xbt_fifo_item_t i)
533 XBT_CWARN(xbt_fifo, "This function is deprecated. Use xbt_fifo_get_next_item.");
534 return xbt_fifo_get_next_item(i);
539 * \return the bucket that is just before \a i.
541 * Returns NULL if \a i is the head of the list.
543 inline xbt_fifo_item_t xbt_fifo_get_prev_item(xbt_fifo_item_t i)
550 /** \deprecated Use #xbt_fifo_get_prev_item instead.
552 xbt_fifo_item_t xbt_fifo_getPrevItem(xbt_fifo_item_t i)
554 XBT_WARN("This function is deprecated. Use xbt_fifo_get_prev_item.");
555 return xbt_fifo_get_prev_item(i);
558 /* Module init/exit handling the fifo item mallocator
559 * These are internal XBT functions called by xbt_preinit/postexit().
560 * It can be used several times to recreate the mallocator, for example when you switch to MC mode
562 void xbt_fifo_preinit()
564 item_mallocator = xbt_mallocator_new(65536, fifo_item_mallocator_new_f,
565 fifo_item_mallocator_free_f, fifo_item_mallocator_reset_f);
568 void xbt_fifo_postexit()
570 if (item_mallocator != NULL) {
571 xbt_mallocator_free(item_mallocator);
572 item_mallocator = NULL;