Searched refs:rb_node (Results 201 - 225 of 466) sorted by relevance

1234567891011>>

/linux-master/fs/btrfs/
H A Dtree-mod-log.c16 struct rb_node node;
78 struct rb_node *node;
79 struct rb_node *next;
137 struct rb_node **new;
138 struct rb_node *parent = NULL;
146 new = &tm_root->rb_node;
478 struct rb_node *node;
484 node = tm_root->rb_node;
796 struct rb_node *next;
H A Ddelayed-ref.h34 struct rb_node ref_node;
91 struct rb_node href_node;
H A Dextent-io-tree.h118 struct rb_node rb_node; member in struct:extent_state
/linux-master/fs/ext2/
H A Dballoc.c201 struct rb_node *n;
292 struct rb_node *n = root->rb_node;
332 struct rb_node *node = &rsv->rsv_node;
335 struct rb_node ** p = &root->rb_node;
336 struct rb_node * parent = NULL;
755 struct rb_node *next;
1009 struct rb_node *next;
/linux-master/fs/nilfs2/
H A Dthe_nilfs.c821 struct rb_node *n;
825 n = nilfs->ns_cptree.rb_node;
827 root = rb_entry(n, struct nilfs_root, rb_node);
847 struct rb_node **p, *parent;
861 p = &nilfs->ns_cptree.rb_node;
866 root = rb_entry(parent, struct nilfs_root, rb_node);
887 rb_link_node(&new->rb_node, parent, p);
888 rb_insert_color(&new->rb_node, &nilfs->ns_cptree);
906 rb_erase(&root->rb_node, &nilfs->ns_cptree);
H A Dthe_nilfs.h230 * @rb_node: red-black tree node
241 struct rb_node rb_node; member in struct:nilfs_root
/linux-master/net/tipc/
H A Dname_table.c65 struct rb_node tree_node;
111 for (sr = service_range_match_first((sc)->ranges.rb_node, \
128 static struct service_range *service_range_match_first(struct rb_node *n,
132 struct rb_node *l, *r;
178 static struct service_range *service_range_match_next(struct rb_node *n,
182 struct rb_node *p, *r;
299 struct rb_node **n, *parent = NULL;
304 n = &sc->ranges.rb_node;
647 sr = service_range_match_first(sc->ranges.rb_node, inst, inst);
736 struct rb_node *
[all...]
/linux-master/fs/kernfs/
H A Ddir.c363 struct rb_node **node = &kn->parent->dir.children.rb_node;
364 struct rb_node *parent = NULL;
841 struct rb_node *node = parent->dir.children.rb_node;
1318 struct rb_node *rbn;
1349 struct rb_node *rbn;
1803 struct rb_node *node = parent->dir.children.rb_node;
1817 struct rb_node *nod
[all...]
/linux-master/net/sched/
H A Dsch_htb.c81 struct rb_node *ptr;
137 struct rb_node pq_node; /* node for event queue */
138 struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */
290 struct rb_node **p = &root->rb_node, *parent = NULL;
319 struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL;
349 static inline void htb_next_rb_node(struct rb_node **n)
375 static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root)
410 if (!hprio->row.rb_node)
[all...]
/linux-master/tools/perf/util/intel-pt-decoder/
H A Dintel-pt-decoder.h209 struct rb_node rb_node; member in struct:intel_pt_vmcs_info
/linux-master/drivers/md/
H A Ddm-bio-prison-v2.c121 struct rb_node **new = &prison->cells.rb_node, *parent = NULL;
/linux-master/scripts/gdb/linux/
H A Dtimerlist.py28 def print_timer(rb_node, idx):
29 timerqueue = utils.container_of(rb_node, timerqueue_node_type.pointer(),
/linux-master/tools/perf/util/
H A Dbuild-id.c377 struct rb_node *nd;
385 struct machine *pos = rb_entry(nd, struct machine, rb_node);
410 struct rb_node *nd;
419 struct machine *pos = rb_entry(nd, struct machine, rb_node);
965 struct rb_node *nd;
969 struct machine *pos = rb_entry(nd, struct machine, rb_node);
1000 struct rb_node *nd;
1005 struct machine *pos = rb_entry(nd, struct machine, rb_node);
/linux-master/fs/afs/
H A Dcallback.c115 struct rb_node *p;
126 p = rcu_dereference_raw(cell->volumes.rb_node);
H A Dserver.c68 struct rb_node *p;
84 p = net->fs_servers.rb_node;
120 struct rb_node **pp, *p;
128 pp = &net->fs_servers.rb_node;
533 struct rb_node *cursor;
/linux-master/include/linux/
H A Dvmalloc.h68 struct rb_node rb_node; /* address sorted rbtree */ member in struct:vmap_area
/linux-master/tools/perf/tests/
H A Dvmlinux-kallsyms.c194 struct rb_node *nd;
293 sym = rb_entry(nd, struct symbol, rb_node);
/linux-master/drivers/android/
H A Dbinder.c581 struct rb_node *n;
585 thread = rb_entry(n, struct binder_thread, rb_node);
698 struct rb_node *n = proc->nodes.rb_node;
704 node = rb_entry(n, struct binder_node, rb_node);
739 struct rb_node **p = &proc->nodes.rb_node;
740 struct rb_node *parent = NULL;
751 node = rb_entry(parent, struct binder_node, rb_node);
770 rb_link_node(&node->rb_node, paren
[all...]
/linux-master/arch/x86/events/intel/
H A Duncore_discovery.c52 static inline int __type_cmp(const void *key, const struct rb_node *b)
68 struct rb_node *node = rb_find(&type_id, &discovery_tables, __type_cmp);
73 static inline bool __type_less(struct rb_node *a, const struct rb_node *b)
606 struct rb_node *node;
/linux-master/security/landlock/
H A Druleset.c204 struct rb_node **walker_node;
205 struct rb_node *parent_node = NULL;
221 walker_node = &root->rb_node;
594 const struct rb_node *node;
599 node = root->rb_node;
/linux-master/drivers/mtd/ubi/
H A Dattach.c108 struct rb_node **p = &ai->volumes.rb_node, *parent = NULL;
570 struct rb_node **p, *parent = NULL;
590 p = &av->root.rb_node;
1281 struct rb_node *this = av->root.rb_node;
1315 struct rb_node *rb;
1339 rb = ai->volumes.rb_node;
1378 struct rb_node *rb1, *rb2;
1663 struct rb_node *rb
[all...]
/linux-master/drivers/mtd/
H A Dmtdswap.c70 struct rb_node rb;
161 #define TREE_EMPTY(d, name) (TREE_ROOT(d, name)->rb_node == NULL)
205 struct rb_node **p, *parent = NULL;
208 p = &root->rb_node;
236 static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx)
238 struct rb_node *p;
419 struct rb_node *medrb;
766 if (d->trees[idx].root.rb_node != NULL)
809 if (root->rb_node == NULL)
1186 if (root->rb_node) {
[all...]
/linux-master/ipc/
H A Dmqueue.c62 struct rb_node rb_node; member in struct:posix_msg_tree_node
140 struct rb_node *msg_tree_rightmost;
193 struct rb_node **p, *parent = NULL;
197 p = &info->msg_tree.rb_node;
200 leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node);
222 info->msg_tree_rightmost = &leaf->rb_node;
224 rb_link_node(&leaf->rb_node, parent, p);
225 rb_insert_color(&leaf->rb_node, &info->msg_tree);
236 struct rb_node *nod
[all...]
/linux-master/fs/f2fs/
H A Dsegment.c975 struct rb_node *cur = rb_first_cached(&dcc->root), *next;
983 cur_dc = rb_entry(cur, struct discard_cmd, rb_node);
984 next_dc = rb_entry(next, struct discard_cmd, rb_node);
1003 struct rb_node *node = dcc->root.rb_root.rb_node;
1007 dc = rb_entry(node, struct discard_cmd, rb_node);
1023 struct rb_node ***insert_p,
1024 struct rb_node **insert_parent)
1026 struct rb_node **pnode = &root->rb_root.rb_node;
[all...]
/linux-master/kernel/sched/
H A Ddeadline.c90 return !RB_EMPTY_NODE(&dl_se->rb_node);
512 return rb_first_cached(&dl_rq->root) == &dl_se->rb_node;
581 static inline bool __pushable_less(struct rb_node *a, const struct rb_node *b)
597 struct rb_node *leftmost;
617 struct rb_node *leftmost;
1531 rb_entry((node), struct sched_dl_entity, rb_node)
1562 struct rb_node *leftmost = rb_first_cached(&dl_rq->root);
1598 static inline bool __dl_less(struct rb_node *a, const struct rb_node *
[all...]

Completed in 386 milliseconds

1234567891011>>