Go to the documentation of this file. 114 #ifndef __PRIO_LIST_H__ 115 #define __PRIO_LIST_H__ 119 #ifndef PRIO_LIST_INLINE 120 #define PRIO_LIST_INLINE static inline 123 #define PRIO_LIST_TYPE(ENAME, PRIOFIELD) \ 124 PRIO_LIST_CREATE_TYPE(ENAME, PRIOFIELD) 128 #define PRIO_LIST_CREATE_TYPE(ENAME, PRIOFIELD) \ 130 struct ENAME##_prio_list { \ 131 struct starpu_rbtree tree; \ 135 struct ENAME##_prio_list_stage { \ 136 struct starpu_rbtree_node node; \ 138 struct ENAME##_list list; \ 140 PRIO_LIST_INLINE struct ENAME##_prio_list_stage *ENAME##_node_to_list_stage(struct starpu_rbtree_node *node) \ 143 return (struct ENAME##_prio_list_stage *) node; \ 145 PRIO_LIST_INLINE const struct ENAME##_prio_list_stage *ENAME##_node_to_list_stage_const(const struct starpu_rbtree_node *node) \ 148 return (struct ENAME##_prio_list_stage *) node; \ 150 PRIO_LIST_INLINE void ENAME##_prio_list_init(struct ENAME##_prio_list *priolist) \ 152 starpu_rbtree_init(&priolist->tree); \ 153 priolist->empty = 1; \ 155 PRIO_LIST_INLINE void ENAME##_prio_list_deinit(struct ENAME##_prio_list *priolist) \ 157 if (starpu_rbtree_empty(&priolist->tree)) \ 159 struct starpu_rbtree_node *root = priolist->tree.root; \ 160 struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage(root); \ 161 assert(ENAME##_list_empty(&stage->list)); \ 162 assert(!root->children[0] && !root->children[1]); \ 163 starpu_rbtree_remove(&priolist->tree, root); \ 166 PRIO_LIST_INLINE int ENAME##_prio_list_cmp_fn(int prio, const struct starpu_rbtree_node *node) \ 169 const struct ENAME##_prio_list_stage *e2 = ENAME##_node_to_list_stage_const(node); \ 170 if (e2->prio < prio) \ 172 if (e2->prio == prio) \ 177 PRIO_LIST_INLINE struct ENAME##_prio_list_stage *ENAME##_prio_list_add(struct ENAME##_prio_list *priolist, int prio) \ 180 struct starpu_rbtree_node *node; \ 181 struct ENAME##_prio_list_stage *stage; \ 182 node = starpu_rbtree_lookup_slot(&priolist->tree, prio, ENAME##_prio_list_cmp_fn, slot); \ 184 stage = ENAME##_node_to_list_stage(node); \ 186 _STARPU_MALLOC(stage, sizeof(*stage)); \ 187 starpu_rbtree_node_init(&stage->node); \ 188 stage->prio = prio; \ 189 ENAME##_list_init(&stage->list); \ 190 starpu_rbtree_insert_slot(&priolist->tree, slot, &stage->node); \ 194 PRIO_LIST_INLINE void ENAME##_prio_list_push_back(struct ENAME##_prio_list *priolist, struct ENAME *e) \ 196 struct ENAME##_prio_list_stage *stage = ENAME##_prio_list_add(priolist, e->PRIOFIELD); \ 197 ENAME##_list_push_back(&stage->list, e); \ 198 priolist->empty = 0; \ 200 PRIO_LIST_INLINE void ENAME##_prio_list_push_front(struct ENAME##_prio_list *priolist, struct ENAME *e) \ 202 struct ENAME##_prio_list_stage *stage = ENAME##_prio_list_add(priolist, e->PRIOFIELD); \ 203 ENAME##_list_push_front(&stage->list, e); \ 204 priolist->empty = 0; \ 206 PRIO_LIST_INLINE int ENAME##_prio_list_empty(const struct ENAME##_prio_list *priolist) \ 208 return priolist->empty; \ 212 PRIO_LIST_INLINE int ENAME##_prio_list_empty_slow(const struct ENAME##_prio_list *priolist) \ 214 if (starpu_rbtree_empty(&priolist->tree)) \ 216 struct starpu_rbtree_node *root = priolist->tree.root; \ 217 const struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage_const(root); \ 218 if (ENAME##_list_empty(&stage->list) && !root->children[0] && !root->children[1]) \ 224 PRIO_LIST_INLINE void ENAME##_prio_list_check_empty_stage(struct ENAME##_prio_list *priolist, struct ENAME##_prio_list_stage *stage) \ 226 if (ENAME##_list_empty(&stage->list)) { \ 227 if (stage->prio != 0) \ 230 starpu_rbtree_remove(&priolist->tree, &stage->node); \ 233 priolist->empty = ENAME##_prio_list_empty_slow(priolist); \ 236 PRIO_LIST_INLINE void ENAME##_prio_list_erase(struct ENAME##_prio_list *priolist, struct ENAME *e) \ 238 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, e->PRIOFIELD, ENAME##_prio_list_cmp_fn); \ 239 struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage(node); \ 240 ENAME##_list_erase(&stage->list, e); \ 241 ENAME##_prio_list_check_empty_stage(priolist, stage); \ 243 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) \ 245 struct ENAME##_prio_list_stage *stage; \ 247 struct starpu_rbtree_node *next; \ 251 stage = ENAME##_node_to_list_stage(node); \ 252 if (!ENAME##_list_empty(&stage->list)) \ 255 next = starpu_rbtree_next(node); \ 257 if (stage->prio != 0) \ 259 starpu_rbtree_remove(&priolist->tree, node); \ 268 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) \ 270 struct ENAME##_prio_list_stage *stage; \ 272 struct starpu_rbtree_node *prev; \ 276 stage = ENAME##_node_to_list_stage(node); \ 277 if (!ENAME##_list_empty(&stage->list)) \ 280 prev = starpu_rbtree_prev(node); \ 282 if (stage->prio != 0) \ 284 starpu_rbtree_remove(&priolist->tree, node); \ 293 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) \ 295 struct starpu_rbtree_node *node = starpu_rbtree_first(&priolist->tree); \ 296 return ENAME##_prio_list_get_next_nonempty_stage(priolist, node, pnode, pstage); \ 298 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) \ 300 struct starpu_rbtree_node *node = starpu_rbtree_last(&priolist->tree); \ 301 return ENAME##_prio_list_get_prev_nonempty_stage(priolist, node, pnode, pstage); \ 303 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_highest(struct ENAME##_prio_list *priolist) \ 305 struct starpu_rbtree_node *node; \ 306 struct ENAME##_prio_list_stage *stage; \ 308 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \ 310 ret = ENAME##_list_pop_front(&stage->list); \ 311 ENAME##_prio_list_check_empty_stage(priolist, stage); \ 314 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_lowest(struct ENAME##_prio_list *priolist) \ 316 struct starpu_rbtree_node *node; \ 317 struct ENAME##_prio_list_stage *stage; \ 319 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \ 321 ret = ENAME##_list_pop_front(&stage->list); \ 322 ENAME##_prio_list_check_empty_stage(priolist, stage); \ 325 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_highest(struct ENAME##_prio_list *priolist) \ 327 struct starpu_rbtree_node *node; \ 328 struct ENAME##_prio_list_stage *stage; \ 329 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \ 331 return ENAME##_list_front(&stage->list); \ 333 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_lowest(struct ENAME##_prio_list *priolist) \ 335 struct starpu_rbtree_node *node; \ 336 struct ENAME##_prio_list_stage *stage; \ 337 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \ 339 return ENAME##_list_front(&stage->list); \ 341 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_highest(struct ENAME##_prio_list *priolist) \ 343 struct starpu_rbtree_node *node; \ 344 struct ENAME##_prio_list_stage *stage; \ 346 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \ 348 ret = ENAME##_list_pop_back(&stage->list); \ 349 ENAME##_prio_list_check_empty_stage(priolist, stage); \ 352 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_lowest(struct ENAME##_prio_list *priolist) \ 354 struct starpu_rbtree_node *node; \ 355 struct ENAME##_prio_list_stage *stage; \ 357 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \ 359 ret = ENAME##_list_pop_back(&stage->list); \ 360 ENAME##_prio_list_check_empty_stage(priolist, stage); \ 363 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_highest(struct ENAME##_prio_list *priolist) \ 365 struct starpu_rbtree_node *node; \ 366 struct ENAME##_prio_list_stage *stage; \ 367 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \ 369 return ENAME##_list_back(&stage->list); \ 371 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_lowest(struct ENAME##_prio_list *priolist) \ 373 struct starpu_rbtree_node *node; \ 374 struct ENAME##_prio_list_stage *stage; \ 375 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \ 377 return ENAME##_list_back(&stage->list); \ 379 PRIO_LIST_INLINE void ENAME##_prio_list_push_prio_list_back(struct ENAME##_prio_list *priolist, struct ENAME##_prio_list *priolist_toadd) \ 381 struct starpu_rbtree_node *node_toadd, *tmp; \ 382 starpu_rbtree_for_each_remove(&priolist_toadd->tree, node_toadd, tmp) { \ 383 struct ENAME##_prio_list_stage *stage_toadd = ENAME##_node_to_list_stage(node_toadd); \ 385 struct starpu_rbtree_node *node = starpu_rbtree_lookup_slot(&priolist->tree, stage_toadd->prio, ENAME##_prio_list_cmp_fn, slot); \ 389 if (!ENAME##_list_empty(&stage_toadd->list)) { \ 390 struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage(node); \ 391 ENAME##_list_push_list_back(&stage->list, &stage_toadd->list); \ 393 priolist->empty = 0; \ 398 if (!ENAME##_list_empty(&stage_toadd->list)) { \ 400 starpu_rbtree_insert_slot(&priolist->tree, slot, node_toadd); \ 401 priolist->empty = 0; \ 411 PRIO_LIST_INLINE int ENAME##_prio_list_ismember(const struct ENAME##_prio_list *priolist, const struct ENAME *e) \ 413 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, e->PRIOFIELD, ENAME##_prio_list_cmp_fn); \ 415 const struct ENAME##_prio_list_stage *stage = ENAME##_node_to_list_stage_const(node); \ 416 return ENAME##_list_ismember(&stage->list, e); \ 420 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_begin(struct ENAME##_prio_list *priolist) \ 422 struct starpu_rbtree_node *node; \ 423 struct ENAME##_prio_list_stage *stage; \ 424 if (!ENAME##_prio_list_get_first_nonempty_stage(priolist, &node, &stage)) \ 426 return ENAME##_list_begin(&stage->list); \ 428 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_end(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED) \ 430 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_next(struct ENAME##_prio_list *priolist, const struct ENAME *i) \ 432 struct ENAME *next = ENAME##_list_next(i); \ 433 if (next != ENAME##_list_end(NULL)) \ 435 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, i->PRIOFIELD, ENAME##_prio_list_cmp_fn); \ 436 struct ENAME##_prio_list_stage *stage; \ 437 node = starpu_rbtree_next(node); \ 438 if (!ENAME##_prio_list_get_next_nonempty_stage(priolist, node, &node, &stage)) \ 440 return ENAME##_list_begin(&stage->list); \ 442 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_last(struct ENAME##_prio_list *priolist) \ 444 struct starpu_rbtree_node *node; \ 445 struct ENAME##_prio_list_stage *stage; \ 446 if (!ENAME##_prio_list_get_last_nonempty_stage(priolist, &node, &stage)) \ 448 return ENAME##_list_last(&stage->list); \ 450 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_alpha(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED) \ 452 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_prev(struct ENAME##_prio_list *priolist, const struct ENAME *i) \ 454 struct ENAME *next = ENAME##_list_prev(i); \ 455 if (next != ENAME##_list_alpha(NULL)) \ 457 struct starpu_rbtree_node *node = starpu_rbtree_lookup(&priolist->tree, i->PRIOFIELD, ENAME##_prio_list_cmp_fn); \ 458 struct ENAME##_prio_list_stage *stage; \ 459 node = starpu_rbtree_prev(node); \ 460 if (!ENAME##_prio_list_get_prev_nonempty_stage(priolist, node, &node, &stage)) \ 462 return ENAME##_list_last(&stage->list); \ 468 #define PRIO_LIST_CREATE_TYPE(ENAME, PRIOFIELD) \ 469 struct ENAME##_prio_list { struct ENAME##_list list; }; \ 470 PRIO_LIST_INLINE void ENAME##_prio_list_init(struct ENAME##_prio_list *priolist) \ 471 { ENAME##_list_init(&(priolist)->list); } \ 472 PRIO_LIST_INLINE void ENAME##_prio_list_deinit(struct ENAME##_prio_list *priolist) \ 473 { (void) (priolist); } \ 474 PRIO_LIST_INLINE void ENAME##_prio_list_push_back(struct ENAME##_prio_list *priolist, struct ENAME *e) \ 477 for (cur = ENAME##_list_begin(&(priolist)->list); \ 478 cur != ENAME##_list_end(&(priolist)->list); \ 479 cur = ENAME##_list_next(cur)) \ 480 if ((e)->PRIOFIELD > cur->PRIOFIELD) \ 482 if (cur == ENAME##_list_end(&(priolist)->list)) \ 483 ENAME##_list_push_back(&(priolist)->list, (e)); \ 485 ENAME##_list_insert_before(&(priolist)->list, (e), cur); \ 487 PRIO_LIST_INLINE void ENAME##_prio_list_push_front(struct ENAME##_prio_list *priolist, struct ENAME *e) \ 490 for (cur = ENAME##_list_begin(&(priolist)->list); \ 491 cur != ENAME##_list_end(&(priolist)->list); \ 492 cur = ENAME##_list_next(cur)) \ 493 if ((e)->PRIOFIELD >= cur->PRIOFIELD) \ 495 if (cur == ENAME##_list_end(&(priolist)->list)) \ 496 ENAME##_list_push_back(&(priolist)->list, (e)); \ 498 ENAME##_list_insert_before(&(priolist)->list, (e), cur); \ 500 PRIO_LIST_INLINE int ENAME##_prio_list_empty(const struct ENAME##_prio_list *priolist) \ 501 { return ENAME##_list_empty(&(priolist)->list); } \ 502 PRIO_LIST_INLINE void ENAME##_prio_list_erase(struct ENAME##_prio_list *priolist, struct ENAME *e) \ 503 { ENAME##_list_erase(&(priolist)->list, (e)); } \ 504 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_highest(struct ENAME##_prio_list *priolist) \ 505 { return ENAME##_list_pop_front(&(priolist)->list); } \ 506 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_front_lowest(struct ENAME##_prio_list *priolist) \ 507 { return ENAME##_list_pop_front(&(priolist)->list); } \ 508 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_highest(struct ENAME##_prio_list *priolist) \ 509 { return ENAME##_list_pop_back(&(priolist)->list); } \ 510 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_pop_back_lowest(struct ENAME##_prio_list *priolist) \ 511 { return ENAME##_list_pop_back(&(priolist)->list); } \ 512 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_highest(struct ENAME##_prio_list *priolist) \ 513 { return ENAME##_list_front(&(priolist)->list); } \ 514 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_front_lowest(struct ENAME##_prio_list *priolist) \ 515 { return ENAME##_list_front(&(priolist)->list); } \ 516 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_highest(struct ENAME##_prio_list *priolist) \ 517 { return ENAME##_list_back(&(priolist)->list); } \ 518 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_back_lowest(struct ENAME##_prio_list *priolist) \ 519 { return ENAME##_list_back(&(priolist)->list); } \ 520 PRIO_LIST_INLINE void ENAME##_prio_list_push_prio_list_back(struct ENAME##_prio_list *priolist, struct ENAME##_prio_list *priolist_toadd) \ 521 { ENAME##_list_push_list_back(&(priolist)->list, &(priolist_toadd)->list); } \ 522 PRIO_LIST_INLINE int ENAME##_prio_list_ismember(const struct ENAME##_prio_list *priolist, const struct ENAME *e) \ 523 { return ENAME##_list_ismember(&(priolist)->list, (e)); } \ 524 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_begin(struct ENAME##_prio_list *priolist) \ 525 { return ENAME##_list_begin(&(priolist)->list); } \ 526 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_end(struct ENAME##_prio_list *priolist) \ 527 { return ENAME##_list_end(&(priolist)->list); } \ 528 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_next(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED, const struct ENAME *i) \ 529 { return ENAME##_list_next(i); } \ 530 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_last(struct ENAME##_prio_list *priolist) \ 531 { return ENAME##_list_last(&(priolist)->list); } \ 532 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_alpha(struct ENAME##_prio_list *priolist) \ 533 { return ENAME##_list_alpha(&(priolist)->list); } \ 534 PRIO_LIST_INLINE struct ENAME *ENAME##_prio_list_prev(struct ENAME##_prio_list *priolist STARPU_ATTRIBUTE_UNUSED, const struct ENAME *i) \ 535 { return ENAME##_list_prev(i); } \ 539 #endif // __PRIO_LIST_H__