ltn 76 include/linux/rbtree_latch.h __lt_insert(struct latch_tree_node *ltn, struct latch_tree_root *ltr, int idx, ltn 81 include/linux/rbtree_latch.h struct rb_node *node = <n->node[idx]; ltn 89 include/linux/rbtree_latch.h if (less(ltn, ltp)) ltn 100 include/linux/rbtree_latch.h __lt_erase(struct latch_tree_node *ltn, struct latch_tree_root *ltr, int idx) ltn 102 include/linux/rbtree_latch.h rb_erase(<n->node[idx], <r->tree[idx]); ltn 110 include/linux/rbtree_latch.h struct latch_tree_node *ltn; ltn 114 include/linux/rbtree_latch.h ltn = __lt_from_rb(node, idx); ltn 115 include/linux/rbtree_latch.h c = comp(key, ltn); ltn 122 include/linux/rbtree_latch.h return ltn; ltn 196 kernel/module.c struct latch_tree_node *ltn; ltn 198 kernel/module.c ltn = latch_tree_find((void *)addr, &mod_tree.root, &mod_tree_ops); ltn 199 kernel/module.c if (!ltn) ltn 202 kernel/module.c return container_of(ltn, struct mod_tree_node, node)->mod;