/linux-master/tools/perf/util/ |
H A D | rblist.c | 17 bool leftmost = true; local 29 leftmost = false; 40 rb_insert_color_cached(new_node, &rblist->entries, leftmost); 59 bool leftmost = true; local 71 leftmost = false; 82 &rblist->entries, leftmost);
|
H A D | hist.c | 600 bool leftmost = true; local 650 leftmost = false; 663 rb_insert_color_cached(&he->rb_node_in, hists->entries_in, leftmost); 1483 bool leftmost = true; local 1505 leftmost = false; 1540 rb_insert_color_cached(&new->rb_node_in, root, leftmost); 1604 bool leftmost = true; local 1641 leftmost = false; 1647 rb_insert_color_cached(&he->rb_node_in, root, leftmost); 1794 bool leftmost local 1881 bool leftmost = true; local 2205 bool leftmost = true; local 2381 bool leftmost = true; local 2430 bool leftmost = true; local [all...] |
H A D | srcline.c | 922 bool leftmost = true; local 940 leftmost = false; 944 rb_insert_color_cached(&node->rb_node, tree, leftmost); 1015 bool leftmost = true; local 1024 leftmost = false; 1028 rb_insert_color_cached(&inlines->rb_node, tree, leftmost);
|
H A D | symbol.c | 351 bool leftmost = true; local 371 leftmost = false; 375 rb_insert_color_cached(&sym->rb_node, symbols, leftmost);
|
/linux-master/include/linux/ |
H A D | timerqueue.h | 25 struct rb_node *leftmost = rb_first_cached(&head->rb_root); local 27 return rb_entry_safe(leftmost, struct timerqueue_node, node);
|
H A D | interval_tree_generic.h | 44 bool leftmost = true; \ 55 leftmost = false; \ 62 leftmost, &ITPREFIX ## _augment); \ 94 * Iterate to find the leftmost such node N. \ 106 return node; /* node is leftmost match */ \ 122 ITSTRUCT *node, *leftmost; \ 144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \ 145 if (ITSTART(leftmost) > last) \
|
H A D | rbtree.h | 110 bool leftmost) 112 if (leftmost) 121 struct rb_node *leftmost = NULL; local 124 leftmost = root->rb_leftmost = rb_next(node); 128 return leftmost; 157 * rb_add_cached() - insert @node into the leftmost cached tree @tree 159 * @tree: leftmost cached tree to insert @node into 162 * Returns @node when it is the new leftmost, or NULL. 170 bool leftmost = true; local 178 leftmost 108 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) argument [all...] |
H A D | rbtree_augmented.h | 70 bool leftmost = true; local 78 leftmost = false; 84 rb_insert_augmented_cached(node, tree, leftmost, augment); 86 return leftmost ? node : NULL; 276 * Case 3: node's successor is leftmost under
|
/linux-master/tools/include/linux/ |
H A D | interval_tree_generic.h | 44 bool leftmost = true; \ 55 leftmost = false; \ 62 leftmost, &ITPREFIX ## _augment); \ 94 * Iterate to find the leftmost such node N. \ 106 return node; /* node is leftmost match */ \ 122 ITSTRUCT *node, *leftmost; \ 144 leftmost = rb_entry(root->rb_leftmost, ITSTRUCT, ITRB); \ 145 if (ITSTART(leftmost) > last) \
|
H A D | rbtree.h | 131 bool leftmost) 133 if (leftmost) 172 * rb_add_cached() - insert @node into the leftmost cached tree @tree 174 * @tree: leftmost cached tree to insert @node into 183 bool leftmost = true; local 191 leftmost = false; 196 rb_insert_color_cached(node, tree, leftmost); 292 * Returns the leftmost node matching @key, or NULL. 129 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) argument
|
/linux-master/kernel/locking/ |
H A D | rtmutex_common.h | 118 * leftmost entry which might be about to vanish. 123 struct rb_node *leftmost = rb_first_cached(&lock->waiters); local 125 return rb_entry(leftmost, struct rt_mutex_waiter, tree.entry) == waiter; 130 struct rb_node *leftmost = rb_first_cached(&lock->waiters); local 135 if (leftmost) { 136 w = rb_entry(leftmost, struct rt_mutex_waiter, tree.entry);
|
/linux-master/lib/ |
H A D | rbtree_test.c | 53 bool leftmost = true; local 61 leftmost = false; 66 rb_insert_color_cached(&node->rb, root, leftmost); 116 bool leftmost = true; local 127 leftmost = false; 134 leftmost, &augment_callbacks);
|
/linux-master/fs/f2fs/ |
H A D | extent_cache.c | 200 bool *leftmost) 217 *leftmost = true; 227 *leftmost = false; 270 bool leftmost) 284 rb_insert_color_cached(&en->rb_node, &et->root, leftmost); 547 bool leftmost) 560 leftmost = true; 571 leftmost = false; 578 en = __attach_extent_node(sbi, et, ei, parent, p, leftmost); 604 bool leftmost local 193 __lookup_extent_node_ret(struct rb_root_cached *root, struct extent_node *cached_en, unsigned int fofs, struct extent_node **prev_entry, struct extent_node **next_entry, struct rb_node ***insert_p, struct rb_node **insert_parent, bool *leftmost) argument 267 __attach_extent_node(struct f2fs_sb_info *sbi, struct extent_tree *et, struct extent_info *ei, struct rb_node *parent, struct rb_node **p, bool leftmost) argument 543 __insert_extent_tree(struct f2fs_sb_info *sbi, struct extent_tree *et, struct extent_info *ei, struct rb_node **insert_p, struct rb_node *insert_parent, bool leftmost) argument 765 bool leftmost = false; local [all...] |
/linux-master/net/sched/ |
H A D | sch_etf.c | 168 bool leftmost = true; local 183 leftmost = false; 189 rb_insert_color_cached(&nskb->rbnode, &q->head, leftmost);
|
/linux-master/fs/btrfs/ |
H A D | delayed-ref.c | 392 bool leftmost = true; local 405 leftmost = false; 412 rb_insert_color_cached(node, root, leftmost); 423 bool leftmost = true; local 436 leftmost = false; 443 rb_insert_color_cached(node, root, leftmost);
|
H A D | extent_map.c | 86 bool leftmost = true; local 96 leftmost = false; 122 rb_insert_color_cached(&em->rb_node, root, leftmost);
|
H A D | delayed-inode.c | 378 bool leftmost = true; local 395 leftmost = false; 404 rb_insert_color_cached(node, root, leftmost);
|
H A D | extent-tree.c | 2607 struct rb_node *leftmost; local 2612 leftmost = rb_first_cached(&fs_info->block_group_cache_tree); 2613 if (leftmost) { 2616 bg = rb_entry(leftmost, struct btrfs_block_group, cache_node);
|
/linux-master/drivers/gpu/drm/ |
H A D | drm_mm.c | 170 bool leftmost; local 187 leftmost = false; 191 leftmost = true; 203 leftmost = false; 208 rb_insert_augmented_cached(&node->rb, &mm->interval_tree, leftmost,
|
/linux-master/kernel/sched/ |
H A D | deadline.c | 597 struct rb_node *leftmost; local 601 leftmost = rb_add_cached(&p->pushable_dl_tasks, 604 if (leftmost) 617 struct rb_node *leftmost; local 622 leftmost = rb_erase_cached(&p->pushable_dl_tasks, root); 623 if (leftmost) 624 dl_rq->earliest_dl.next = __node_2_pdl(leftmost)->dl.deadline; 1562 struct rb_node *leftmost = rb_first_cached(&dl_rq->root); local 1563 struct sched_dl_entity *entry = __node_2_dle(leftmost); 2161 * not being the leftmost tas [all...] |
/linux-master/fs/ |
H A D | eventpoll.c | 1409 bool leftmost = true; local 1417 leftmost = false; 1422 rb_insert_color_cached(&epi->rbn, &ep->rbr, leftmost);
|
/linux-master/tools/perf/ |
H A D | builtin-sched.c | 998 bool leftmost = true; local 1013 leftmost = false; 1018 rb_insert_color_cached(&data->node, root, leftmost); 3119 bool leftmost = true; local 3133 leftmost = false; 3152 rb_insert_color_cached(&data->node, root, leftmost);
|
H A D | builtin-kwork.c | 337 bool leftmost = true; local 350 leftmost = false; 355 rb_insert_color_cached(&key->node, root, leftmost);
|
/linux-master/block/ |
H A D | blk-throttle.c | 536 bool leftmost = true; local 546 leftmost = false; 552 leftmost);
|
/linux-master/kernel/bpf/ |
H A D | helpers.c | 2091 bool leftmost = true; local 2108 leftmost = false; 2113 rb_insert_color_cached(n, (struct rb_root_cached *)root, leftmost);
|