Searched refs:tnode (Results 1 – 7 of 7) sorted by relevance
| /linux-4.4.14/Documentation/networking/ |
| D | fib_trie.txt | 10 trie node or tnode
11 An internal node, holding an array of child (leaf or tnode) pointers,
16 Bits (tnode)
20 Pos (tnode)
25 Any given tnode is linked to from the child array of its parent, using
27 In certain cases, this tnode's own "pos" will not be immediately
38 instead of a pure binary tree, each internal node ("tnode") may
40 Conversely, a tnode with a mostly empty child array (see empty_children)
45 the number of positions in the child array of a given tnode that are
49 the number of children of a given tnode that aren't path compressed.
[all …]
|
| /linux-4.4.14/arch/sparc/include/asm/ |
| D | floppy_32.h | 282 phandle tnode; in sun_floppy_init() local
295 tnode = prom_getchild(prom_root_node); in sun_floppy_init()
296 fd_node = prom_searchsiblings(tnode, "obio"); in sun_floppy_init()
298 tnode = prom_getchild(fd_node); in sun_floppy_init()
299 fd_node = prom_searchsiblings(tnode, "SUNW,fdtwo"); in sun_floppy_init()
301 fd_node = prom_searchsiblings(tnode, "fd"); in sun_floppy_init()
|
| /linux-4.4.14/net/ipv4/ |
| D | fib_trie.c | 107 struct key_vector __rcu *tnode[0]; member
111 struct tnode { struct
120 #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n]) argument
164 static inline struct tnode *tn_info(struct key_vector *kv) in tn_info()
166 return container_of(kv, struct tnode, kv[0]); in tn_info()
171 #define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
175 #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
288 struct tnode *n = container_of(head, struct tnode, rcu); in __node_free_rcu()
300 static struct tnode *tnode_alloc(int bits) in tnode_alloc()
330 struct tnode *kv; in leaf_new()
[all …]
|
| /linux-4.4.14/drivers/of/ |
| D | irq.c | 99 struct device_node *ipar, *tnode, *old = NULL, *newpar = NULL; in of_irq_parse_raw() local
122 tnode = ipar; in of_irq_parse_raw()
124 of_node_put(tnode); in of_irq_parse_raw()
142 tnode = of_get_parent(old); in of_irq_parse_raw()
144 old = tnode; in of_irq_parse_raw()
|
| /linux-4.4.14/fs/ |
| D | eventpoll.c | 406 struct nested_call_node tnode; in ep_call_nested() local
428 tnode.ctx = ctx; in ep_call_nested()
429 tnode.cookie = cookie; in ep_call_nested()
430 list_add(&tnode.llink, lsthead); in ep_call_nested()
439 list_del(&tnode.llink); in ep_call_nested()
|
| /linux-4.4.14/security/selinux/ss/ |
| D | services.c | 660 struct ebitmap_node *snode, *tnode; in context_struct_compute_av() local
690 ebitmap_for_each_positive_bit(tattr, tnode, j) { in context_struct_compute_av()
1004 struct ebitmap_node *snode, *tnode; in security_compute_xperms_decision() local
1053 ebitmap_for_each_positive_bit(tattr, tnode, j) { in security_compute_xperms_decision()
2365 struct ebitmap_node *rnode, *tnode; in security_get_user_sids() local
2398 ebitmap_for_each_positive_bit(&role->types, tnode, j) { in security_get_user_sids()
|
| /linux-4.4.14/arch/sparc/mm/ |
| D | init_64.c | 1179 int tnode; in find_numa_latencies_for_group() local
1185 tnode = find_best_numa_node_for_mlgroup(m); in find_numa_latencies_for_group()
1186 if (tnode == MAX_NUMNODES) in find_numa_latencies_for_group()
1188 numa_latency[index][tnode] = m->latency; in find_numa_latencies_for_group()
|