Go to the documentation of this file.
126#ifndef __PRIO_LIST_H__
127#define __PRIO_LIST_H__
131#ifndef PRIO_LIST_INLINE
132#define PRIO_LIST_INLINE static inline
135#define PRIO_LIST_TYPE(ENAME, PRIOFIELD) \
136 PRIO_LIST_CREATE_TYPE(ENAME, PRIOFIELD)
140#define PRIO_LIST_CREATE_TYPE(ENAME, PRIOFIELD) \
142 struct ENAME##_prio_list { \
143 struct starpu_rbtree tree; \
147 struct ENAME##_prio_list_stage { \
148 struct starpu_rbtree_node node; \
150 struct ENAME##_list list; \
152 PRIO_LIST_INLINE struct ENAME##_prio_list_stage *ENAME##_node_to_list_stage(struct starpu_rbtree_node *node) \
155 return (struct ENAME##_prio_list_stage *) node; \
157 PRIO_LIST_INLINE const struct ENAME##_prio_list_stage *ENAME##_node_to_list_stage_const(const struct starpu_rbtree_node *node) \
160 return (struct ENAME##_prio_list_stage *) node; \
162 PRIO_LIST_INLINE void ENAME##_prio_list_init(struct ENAME##_prio_list *priolist) \
164 starpu_rbtree_init(&priolist->tree); \
165 priolist->empty = 1; \
167 PRIO_LIST_INLINE void ENAME##_prio_list_init0(struct ENAME##_prio_list *priolist) \
169 starpu_rbtree_init0(&priolist->tree); \
170 priolist->empty = 1; \
172 PRIO_LIST_INLINE void ENAME##_prio_list_deinit(struct ENAME##_prio_list *priolist) \
174 if (starpu_rbtree_empty(&priolist->tree)) \
176 struct starpu_rbtree_node *root = priolist->tree.root; \
177 struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage(root); \
178 assert(ENAME##_list_empty(&stage->list)); \
179 assert(!root->children[0] && !root->children[1]); \
180 starpu_rbtree_remove(&priolist->tree, root); \
183 PRIO_LIST_INLINE int ENAME##_prio_list_cmp_fn(int prio, const struct starpu_rbtree_node *node) \
186 const struct ENAME##_prio_list_stage *e2 = ENAME##_node_to_list_stage_const(node); \
187 if (e2->prio < prio) \
189 if (e2->prio == prio) \
194 PRIO_LIST_INLINE struct ENAME##_prio_list_stage *ENAME##_prio_list_add(struct ENAME##_prio_list *priolist, int prio) \
197 struct starpu_rbtree_node *node; \
198 struct ENAME##_prio_list_stage *stage; \
199 node = starpu_rbtree_lookup_slot(&priolist->tree, prio, ENAME##_prio_list_cmp_fn, slot); \
201 stage = ENAME##_node_to_list_stage(node); \
203 _STARPU_CALLOC(stage, 1, sizeof(*stage)); \
204 starpu_rbtree_node_init0(&stage->node); \
205 stage->prio = prio; \
206 ENAME##_list_init0(&stage->list); \
207 starpu_rbtree_insert_slot(&priolist->tree, slot, &stage->node); \
211 PRIO_LIST_INLINE void ENAME##_prio_list_push_back(struct ENAME##_prio_list *priolist, struct ENAME *e) \
213 struct ENAME##_prio_list_stage *stage = ENAME##_prio_list_add(priolist, e->PRIOFIELD); \
214 ENAME##_list_push_back(&stage->list, e); \
215 priolist->empty = 0; \
217 PRIO_LIST_INLINE void ENAME##_prio_list_push_front(struct ENAME##_prio_list *priolist, struct ENAME *e) \
219 struct ENAME##_prio_list_stage *stage = ENAME##_prio_list_add(priolist, e->PRIOFIELD); \
220 ENAME##_list_push_front(&stage->list, e); \
221 priolist->empty = 0; \
223 PRIO_LIST_INLINE int ENAME##_prio_list_empty(const struct ENAME##_prio_list *priolist) \
225 return priolist->empty; \
229 PRIO_LIST_INLINE int ENAME##_prio_list_empty_slow(const struct ENAME##_prio_list *priolist) \
231 if (starpu_rbtree_empty(&priolist->tree)) \
233 struct starpu_rbtree_node *root = priolist->tree.root; \
234 const struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage_const(root); \
235 if (ENAME##_list_empty(&stage->list) && !root->children[0] && !root->children[1]) \
241 PRIO_LIST_INLINE void ENAME##_prio_list_check_empty_stage(struct ENAME##_prio_list *priolist, struct ENAME##_prio_list_stage *stage) \
243 if (ENAME##_list_empty(&stage->list)) { \
244 if (stage->prio != 0) \
247 starpu_rbtree_remove(&priolist->tree, &stage->node); \
250 priolist->empty = ENAME##_prio_list_empty_slow(priolist); \
253 PRIO_LIST_INLINE void ENAME##_prio_list_erase(struct ENAME##_prio_list *priolist, struct ENAME *e) \
255 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, e->PRIOFIELD, ENAME##_prio_list_cmp_fn); \
257 struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage(node); \
258 ENAME##_list_erase(&stage->list, e); \
259 ENAME##_prio_list_check_empty_stage(priolist, stage); \
261 PRIO_LIST_INLINE int ENAME##_prio_list_get_next_nonempty_stage(struct ENAME##_prio_list *priolist, struct starpu_rbtree_node *node, struct starpu_rbtree_node **pnode, struct ENAME##_prio_list_stage **pstage) \
263 struct ENAME##_prio_list_stage *stage; \
265 struct starpu_rbtree_node *next; \
269 stage = ENAME##_node_to_list_stage(node); \
270 if (!ENAME##_list_empty(&stage->list)) \
273 next = starpu_rbtree_next(node); \
275 if (stage->prio != 0) \
277 starpu_rbtree_remove(&priolist->tree, node); \
286 PRIO_LIST_INLINE int ENAME##_prio_list_get_prev_nonempty_stage(struct ENAME##_prio_list *priolist, struct starpu_rbtree_node *node, struct starpu_rbtree_node **pnode, struct ENAME##_prio_list_stage **pstage) \
288 struct ENAME##_prio_list_stage *stage; \
290 struct starpu_rbtree_node *prev; \
294 stage = ENAME##_node_to_list_stage(node); \
295 if (!ENAME##_list_empty(&stage->list)) \
298 prev = starpu_rbtree_prev(node); \
300 if (stage->prio != 0) \
302 starpu_rbtree_remove(&priolist->tree, node); \
311 PRIO_LIST_INLINE int ENAME##_prio_list_get_first_nonempty_stage(struct ENAME##_prio_list *priolist, struct starpu_rbtree_node **pnode, struct ENAME##_prio_list_stage **pstage) \
313 struct starpu_rbtree_node *node = starpu_rbtree_first(&priolist->tree); \
314 return ENAME##_prio_list_get_next_nonempty_stage(priolist, node, pnode, pstage); \
316 PRIO_LIST_INLINE int ENAME##_prio_list_get_last_nonempty_stage(struct ENAME##_prio_list *priolist, struct starpu_rbtree_node **pnode, struct ENAME##_prio_list_stage **pstage) \
318 struct starpu_rbtree_node *node = starpu_rbtree_last(&priolist->tree); \
319 return ENAME##_prio_list_get_prev_nonempty_stage(priolist, node, pnode, pstage); \
321 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_highest(struct ENAME##_prio_list *priolist) \
323 struct starpu_rbtree_node *node; \
324 struct ENAME##_prio_list_stage *stage; \
326 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \
328 ret = ENAME##_list_pop_front(&stage->list); \
329 ENAME##_prio_list_check_empty_stage(priolist, stage); \
332 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_lowest(struct ENAME##_prio_list *priolist) \
334 struct starpu_rbtree_node *node; \
335 struct ENAME##_prio_list_stage *stage; \
337 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \
339 ret = ENAME##_list_pop_front(&stage->list); \
340 ENAME##_prio_list_check_empty_stage(priolist, stage); \
343 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_highest(struct ENAME##_prio_list *priolist) \
345 struct starpu_rbtree_node *node; \
346 struct ENAME##_prio_list_stage *stage; \
347 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \
349 return ENAME##_list_front(&stage->list); \
351 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_lowest(struct ENAME##_prio_list *priolist) \
353 struct starpu_rbtree_node *node; \
354 struct ENAME##_prio_list_stage *stage; \
355 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \
357 return ENAME##_list_front(&stage->list); \
359 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_highest(struct ENAME##_prio_list *priolist) \
361 struct starpu_rbtree_node *node; \
362 struct ENAME##_prio_list_stage *stage; \
364 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \
366 ret = ENAME##_list_pop_back(&stage->list); \
367 ENAME##_prio_list_check_empty_stage(priolist, stage); \
370 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_lowest(struct ENAME##_prio_list *priolist) \
372 struct starpu_rbtree_node *node; \
373 struct ENAME##_prio_list_stage *stage; \
375 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \
377 ret = ENAME##_list_pop_back(&stage->list); \
378 ENAME##_prio_list_check_empty_stage(priolist, stage); \
381 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_highest(struct ENAME##_prio_list *priolist) \
383 struct starpu_rbtree_node *node; \
384 struct ENAME##_prio_list_stage *stage; \
385 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \
387 return ENAME##_list_back(&stage->list); \
389 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_lowest(struct ENAME##_prio_list *priolist) \
391 struct starpu_rbtree_node *node; \
392 struct ENAME##_prio_list_stage *stage; \
393 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \
395 return ENAME##_list_back(&stage->list); \
397 PRIO_LIST_INLINE void ENAME##_prio_list_push_prio_list_back(struct ENAME##_prio_list *priolist, struct ENAME##_prio_list *priolist_toadd) \
399 struct starpu_rbtree_node *node_toadd, *tmp; \
400 starpu_rbtree_for_each_remove(&priolist_toadd->tree, node_toadd, tmp) { \
401 struct ENAME##_prio_list_stage *stage_toadd = ENAME##_node_to_list_stage(node_toadd); \
403 struct starpu_rbtree_node *node = starpu_rbtree_lookup_slot(&priolist->tree, stage_toadd->prio, ENAME##_prio_list_cmp_fn, slot); \
407 if (!ENAME##_list_empty(&stage_toadd->list)) { \
408 struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage(node); \
409 ENAME##_list_push_list_back(&stage->list, &stage_toadd->list); \
411 priolist->empty = 0; \
416 if (!ENAME##_list_empty(&stage_toadd->list)) { \
418 starpu_rbtree_insert_slot(&priolist->tree, slot, node_toadd); \
419 priolist->empty = 0; \
429 PRIO_LIST_INLINE int ENAME##_prio_list_ismember(const struct ENAME##_prio_list *priolist, const struct ENAME *e) \
431 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, e->PRIOFIELD, ENAME##_prio_list_cmp_fn); \
433 const struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage_const(node); \
434 return ENAME##_list_ismember(&stage->list, e); \
438 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_begin(struct ENAME##_prio_list *priolist) \
440 struct starpu_rbtree_node *node; \
441 struct ENAME##_prio_list_stage *stage; \
442 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \
444 return ENAME##_list_begin(&stage->list); \
446 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_end(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED) \
448 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_next(struct ENAME##_prio_list *priolist, const struct ENAME *i) \
450 struct ENAME *next = ENAME##_list_next(i); \
451 if (next != ENAME##_list_end(NULL)) \
453 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, i->PRIOFIELD, ENAME##_prio_list_cmp_fn); \
455 struct ENAME##_prio_list_stage *stage; \
456 node = starpu_rbtree_next(node); \
457 if (!ENAME##_prio_list_get_next_nonempty_stage(priolist, node, &node, &stage)) \
459 return ENAME##_list_begin(&stage->list); \
461 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_last(struct ENAME##_prio_list *priolist) \
463 struct starpu_rbtree_node *node; \
464 struct ENAME##_prio_list_stage *stage; \
465 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \
467 return ENAME##_list_last(&stage->list); \
469 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_alpha(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED) \
471 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_prev(struct ENAME##_prio_list *priolist, const struct ENAME *i) \
473 struct ENAME *next = ENAME##_list_prev(i); \
474 if (next != ENAME##_list_alpha(NULL)) \
476 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, i->PRIOFIELD, ENAME##_prio_list_cmp_fn); \
478 struct ENAME##_prio_list_stage *stage; \
479 node = starpu_rbtree_prev(node); \
480 if (!ENAME##_prio_list_get_prev_nonempty_stage(priolist, node, &node, &stage)) \
482 return ENAME##_list_last(&stage->list); \
484 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_prev_highest(struct ENAME##_prio_list *priolist, const struct ENAME *i) \
486 struct ENAME *next = ENAME##_list_prev(i); \
487 if (next != ENAME##_list_alpha(NULL)) \
489 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, i->PRIOFIELD, ENAME##_prio_list_cmp_fn); \
491 struct ENAME##_prio_list_stage *stage; \
492 node = starpu_rbtree_next(node); \
493 if (!ENAME##_prio_list_get_next_nonempty_stage(priolist, node, &node, &stage)) \
495 return ENAME##_list_last(&stage->list); \
497 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_next_lowest(struct ENAME##_prio_list *priolist, const struct ENAME *i) \
499 struct ENAME *next = ENAME##_list_next(i); \
500 if (next != ENAME##_list_end(NULL)) \
502 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, i->PRIOFIELD, ENAME##_prio_list_cmp_fn); \
504 struct ENAME##_prio_list_stage *stage; \
505 node = starpu_rbtree_prev(node); \
506 if (!ENAME##_prio_list_get_prev_nonempty_stage(priolist, node, &node, &stage)) \
508 return ENAME##_list_begin(&stage->list); \
514#define PRIO_LIST_CREATE_TYPE(ENAME, PRIOFIELD) \
515 struct ENAME##_prio_list { struct ENAME##_list list; }; \
516 PRIO_LIST_INLINE void ENAME##_prio_list_init(struct ENAME##_prio_list *priolist) \
517 { ENAME##_list_init(&(priolist)->list); } \
518 PRIO_LIST_INLINE void ENAME##_prio_list_init0(struct ENAME##_prio_list *priolist) \
519 { ENAME##_list_init0(&(priolist)->list); } \
520 PRIO_LIST_INLINE void ENAME##_prio_list_deinit(struct ENAME##_prio_list *priolist) \
521 { (void) (priolist); } \
522 PRIO_LIST_INLINE void ENAME##_prio_list_push_back(struct ENAME##_prio_list *priolist, struct ENAME *e) \
525 for (cur = ENAME##_list_begin(&(priolist)->list); \
526 cur != ENAME##_list_end(&(priolist)->list); \
527 cur = ENAME##_list_next(cur)) \
528 if ((e)->PRIOFIELD > cur->PRIOFIELD) \
530 if (cur == ENAME##_list_end(&(priolist)->list)) \
531 ENAME##_list_push_back(&(priolist)->list, (e)); \
533 ENAME##_list_insert_before(&(priolist)->list, (e), cur); \
535 PRIO_LIST_INLINE void ENAME##_prio_list_push_front(struct ENAME##_prio_list *priolist, struct ENAME *e) \
538 for (cur = ENAME##_list_begin(&(priolist)->list); \
539 cur != ENAME##_list_end(&(priolist)->list); \
540 cur = ENAME##_list_next(cur)) \
541 if ((e)->PRIOFIELD >= cur->PRIOFIELD) \
543 if (cur == ENAME##_list_end(&(priolist)->list)) \
544 ENAME##_list_push_back(&(priolist)->list, (e)); \
546 ENAME##_list_insert_before(&(priolist)->list, (e), cur); \
548 PRIO_LIST_INLINE int ENAME##_prio_list_empty(const struct ENAME##_prio_list *priolist) \
549 { return ENAME##_list_empty(&(priolist)->list); } \
550 PRIO_LIST_INLINE void ENAME##_prio_list_erase(struct ENAME##_prio_list *priolist, struct ENAME *e) \
551 { ENAME##_list_erase(&(priolist)->list, (e)); } \
552 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_highest(struct ENAME##_prio_list *priolist) \
553 { return ENAME##_list_pop_front(&(priolist)->list); } \
554 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_lowest(struct ENAME##_prio_list *priolist) \
555 { return ENAME##_list_pop_front(&(priolist)->list); } \
556 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_highest(struct ENAME##_prio_list *priolist) \
557 { return ENAME##_list_pop_back(&(priolist)->list); } \
558 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_lowest(struct ENAME##_prio_list *priolist) \
559 { return ENAME##_list_pop_back(&(priolist)->list); } \
560 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_highest(struct ENAME##_prio_list *priolist) \
561 { return ENAME##_list_front(&(priolist)->list); } \
562 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_lowest(struct ENAME##_prio_list *priolist) \
563 { return ENAME##_list_front(&(priolist)->list); } \
564 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_highest(struct ENAME##_prio_list *priolist) \
565 { return ENAME##_list_back(&(priolist)->list); } \
566 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_lowest(struct ENAME##_prio_list *priolist) \
567 { return ENAME##_list_back(&(priolist)->list); } \
568 PRIO_LIST_INLINE void ENAME##_prio_list_push_prio_list_back(struct ENAME##_prio_list *priolist, struct ENAME##_prio_list *priolist_toadd) \
569 { ENAME##_list_push_list_back(&(priolist)->list, &(priolist_toadd)->list); } \
570 PRIO_LIST_INLINE int ENAME##_prio_list_ismember(const struct ENAME##_prio_list *priolist, const struct ENAME *e) \
571 { return ENAME##_list_ismember(&(priolist)->list, (e)); } \
572 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_begin(struct ENAME##_prio_list *priolist) \
573 { return ENAME##_list_begin(&(priolist)->list); } \
574 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_end(struct ENAME##_prio_list *priolist) \
575 { return ENAME##_list_end(&(priolist)->list); } \
576 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_next(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED, const struct ENAME *i) \
577 { return ENAME##_list_next(i); } \
578 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_last(struct ENAME##_prio_list *priolist) \
579 { return ENAME##_list_last(&(priolist)->list); } \
580 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_alpha(struct ENAME##_prio_list *priolist) \
581 { return ENAME##_list_alpha(&(priolist)->list); } \
582 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_prev(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED, const struct ENAME *i) \
583 { return ENAME##_list_prev(i); } \
584 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_prev_highest(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED, const struct ENAME *i) \
585 { return ENAME##_list_prev(i); } \
586 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_next_lowest(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED, const struct ENAME *i) \
587 { return ENAME##_list_next(i); } \