| /linux/Documentation/networking/ |
| H A D | fib_trie.rst | 14 trie node or tnode
15 An internal node, holding an array of child (leaf or tnode) pointers,
20 Bits (tnode)
24 Pos (tnode)
29 Any given tnode is linked to from the child array of its parent, using
31 In certain cases, this tnode's own "pos" will not be immediately
42 instead of a pure binary tree, each internal node ("tnode") may
44 Conversely, a tnode with a mostly empty child array (see empty_children)
49 the number of positions in the child array of a given tnode that are
53 the number of children of a given tnode that aren't path compressed.
[all …]
|
| /linux/lib/ |
| H A D | lwq.c | 76 struct tnode { struct
86 struct tnode *t; in lwq_exercise() argument
89 wait_var_event(q, (t = lwq_dequeue(q, struct tnode, n)) != NULL); in lwq_exercise()
104 struct tnode *t; in lwq_test()
131 t = lwq_dequeue(&q, struct tnode, n); in lwq_test()
149 while ((t = lwq_dequeue(&q, struct tnode, n)) != NULL) { in lwq_test()
|
| /linux/net/ipv4/ |
| H A D | fib_trie.c | 130 DECLARE_FLEX_ARRAY(struct key_vector __rcu *, tnode);
134 struct tnode { struct
143 #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n]) argument
189 static inline struct tnode *tn_info(struct key_vector *kv) in tn_info()
191 return container_of(kv, struct tnode, kv[0]); in tn_info()
196 #define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
200 #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
305 struct tnode *n = container_of(head, struct tnode, rcu); in __node_free_rcu()
315 static struct tnode *tnode_alloc(int bits) in tnode_alloc()
351 struct tnode *kv; in leaf_new()
[all …]
|
| /linux/net/bridge/ |
| H A D | br_vlan_tunnel.c | 29 .head_offset = offsetof(struct net_bridge_vlan, tnode),
58 rhashtable_remove_fast(&vg->tunnel_hash, &vlan->tnode, in vlan_tunnel_info_del()
83 err = rhashtable_lookup_insert_fast(&vg->tunnel_hash, &vlan->tnode, in __vlan_tunnel_info_add()
|
| H A D | br_private.h | 217 struct rhash_head tnode; member
|
| /linux/drivers/of/ |
| H A D | irq.c | 178 struct device_node *ipar, *tnode, *old = NULL; in of_irq_parse_raw() local
198 tnode = ipar; in of_irq_parse_raw()
200 of_node_put(tnode); in of_irq_parse_raw()
218 tnode = of_get_parent(old); in of_irq_parse_raw()
220 old = tnode; in of_irq_parse_raw()
|
| /linux/drivers/counter/ |
| H A D | stm32-timer-cnt.c | 686 struct device_node *tnode = NULL, *pnode = parent->of_node; in stm32_timer_cnt_probe_encoder() local
697 for (i = 0; i < ARRAY_SIZE(stm32_timer_trigger_compat) && !tnode; i++) in stm32_timer_cnt_probe_encoder()
698 tnode = of_get_compatible_child(pnode, stm32_timer_trigger_compat[i]); in stm32_timer_cnt_probe_encoder()
699 if (!tnode) { in stm32_timer_cnt_probe_encoder()
704 ret = of_property_read_u32(tnode, "reg", &idx); in stm32_timer_cnt_probe_encoder()
705 of_node_put(tnode); in stm32_timer_cnt_probe_encoder()
|
| /linux/drivers/infiniband/hw/hfi1/ |
| H A D | user_exp_rcv.c | 22 struct tid_rb_node *tnode);
960 struct tid_rb_node *tnode) in cacheless_tid_rb_remove() argument
964 fdata->entry_to_rb[tnode->rcventry - base] = NULL; in cacheless_tid_rb_remove()
965 clear_tid_node(fdata, tnode); in cacheless_tid_rb_remove()
|
| H A D | tid_rdma.h | 192 struct kern_tid_node tnode[TID_RDMA_MAX_PAGES]; member
|
| H A D | tid_rdma.c | 1208 struct kern_tid_node *node = &flow->tnode[flow->tnode_cnt++]; in kern_add_tid_node()
1305 struct kern_tid_node *node = &flow->tnode[grp_num]; in kern_program_rcv_group()
1372 struct kern_tid_node *node = &flow->tnode[grp_num]; in kern_unprogram_rcv_group()
|
| /linux/security/selinux/ss/ |
| H A D | services.c | 635 struct ebitmap_node *snode, *tnode; in context_struct_compute_av() local
661 ebitmap_for_each_positive_bit(tattr, tnode, j) { in context_struct_compute_av()
1041 struct ebitmap_node *snode, *tnode; in security_compute_xperms_decision() local
1091 ebitmap_for_each_positive_bit(tattr, tnode, j) { in security_compute_xperms_decision()
2778 struct ebitmap_node *rnode, *tnode; in security_get_user_sids() local
2815 ebitmap_for_each_positive_bit(&role->types, tnode, j) { in security_get_user_sids()
|
| /linux/kernel/bpf/ |
| H A D | core.c | 598 return container_of(n, struct bpf_ksym, tnode)->start; in bpf_get_ksym_start()
612 ksym = container_of(n, struct bpf_ksym, tnode); in bpf_tree_comp()
640 latch_tree_insert(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in bpf_ksym_add()
649 latch_tree_erase(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in __bpf_ksym_del()
713 return n ? container_of(n, struct bpf_ksym, tnode) : NULL; in bpf_ksym_find()
|
| /linux/arch/sparc/mm/ |
| H A D | init_64.c | 1380 int tnode; in find_numa_latencies_for_group() local
1386 tnode = find_best_numa_node_for_mlgroup(m); in find_numa_latencies_for_group()
1387 if (tnode == MAX_NUMNODES) in find_numa_latencies_for_group()
1389 numa_latency[index][tnode] = m->latency; in find_numa_latencies_for_group()
|