Home
last modified time | relevance | path

Searched refs:latch_tree_node (Results 1 – 5 of 5) sorted by relevance

/Linux-v5.4/include/linux/
Drbtree_latch.h40 struct latch_tree_node { struct
65 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b);
66 int (*comp)(void *key, struct latch_tree_node *b);
69 static __always_inline struct latch_tree_node *
72 return container_of(node, struct latch_tree_node, node[idx]); in __lt_from_rb()
76 __lt_insert(struct latch_tree_node *ltn, struct latch_tree_root *ltr, int idx, in __lt_insert()
77 bool (*less)(struct latch_tree_node *a, struct latch_tree_node *b)) in __lt_insert()
83 struct latch_tree_node *ltp; in __lt_insert()
100 __lt_erase(struct latch_tree_node *ltn, struct latch_tree_root *ltr, int idx) in __lt_erase()
105 static __always_inline struct latch_tree_node *
[all …]
Dmodule.h304 struct latch_tree_node node;
Dbpf.h382 struct latch_tree_node ksym_tnode;
/Linux-v5.4/kernel/bpf/
Dcore.c576 bpf_get_prog_addr_start(struct latch_tree_node *n) in bpf_get_prog_addr_start()
587 static __always_inline bool bpf_tree_less(struct latch_tree_node *a, in bpf_tree_less()
588 struct latch_tree_node *b) in bpf_tree_less()
593 static __always_inline int bpf_tree_comp(void *key, struct latch_tree_node *n) in bpf_tree_comp()
669 struct latch_tree_node *n; in bpf_prog_kallsyms_find()
/Linux-v5.4/kernel/
Dmodule.c105 static __always_inline unsigned long __mod_tree_val(struct latch_tree_node *n) in __mod_tree_val()
112 static __always_inline unsigned long __mod_tree_size(struct latch_tree_node *n) in __mod_tree_size()
120 mod_tree_less(struct latch_tree_node *a, struct latch_tree_node *b) in mod_tree_less()
126 mod_tree_comp(void *key, struct latch_tree_node *n) in mod_tree_comp()
196 struct latch_tree_node *ltn; in mod_find()