| /linux-6.12.1/Documentation/networking/ |
| 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-6.12.1/lib/ |
| 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-6.12.1/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-6.12.1/net/ipv4/ |
| 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])
311 struct tnode *n = container_of(head, struct tnode, rcu); in __node_free_rcu()
321 static struct tnode *tnode_alloc(int bits) in tnode_alloc()
357 struct tnode *kv; in leaf_new()
[all …]
|
| /linux-6.12.1/net/bridge/ |
| 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()
|
| D | br_private.h | 215 struct rhash_head tnode; member
|
| /linux-6.12.1/drivers/of/ |
| D | irq.c | 170 struct device_node *ipar, *tnode, *old = NULL; in of_irq_parse_raw() local
190 tnode = ipar; in of_irq_parse_raw()
192 of_node_put(tnode); in of_irq_parse_raw()
210 tnode = of_get_parent(old); in of_irq_parse_raw()
212 old = tnode; in of_irq_parse_raw()
|
| /linux-6.12.1/drivers/counter/ |
| D | stm32-timer-cnt.c | 678 struct device_node *tnode = NULL, *pnode = parent->of_node; in stm32_timer_cnt_probe_encoder() local
689 for (i = 0; i < ARRAY_SIZE(stm32_timer_trigger_compat) && !tnode; i++) in stm32_timer_cnt_probe_encoder()
690 tnode = of_get_compatible_child(pnode, stm32_timer_trigger_compat[i]); in stm32_timer_cnt_probe_encoder()
691 if (!tnode) { in stm32_timer_cnt_probe_encoder()
696 ret = of_property_read_u32(tnode, "reg", &idx); in stm32_timer_cnt_probe_encoder()
|
| /linux-6.12.1/drivers/infiniband/hw/hfi1/ |
| 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()
|
| D | tid_rdma.h | 192 struct kern_tid_node tnode[TID_RDMA_MAX_PAGES]; member
|
| 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-6.12.1/security/selinux/ss/ |
| D | services.c | 624 struct ebitmap_node *snode, *tnode; in context_struct_compute_av() local
651 ebitmap_for_each_positive_bit(tattr, tnode, j) { in context_struct_compute_av()
1013 struct ebitmap_node *snode, *tnode; in security_compute_xperms_decision() local
1062 ebitmap_for_each_positive_bit(tattr, tnode, j) { in security_compute_xperms_decision()
2717 struct ebitmap_node *rnode, *tnode; in security_get_user_sids() local
2754 ebitmap_for_each_positive_bit(&role->types, tnode, j) { in security_get_user_sids()
|
| /linux-6.12.1/kernel/bpf/ |
| D | core.c | 621 return container_of(n, struct bpf_ksym, tnode)->start; in bpf_get_ksym_start()
635 ksym = container_of(n, struct bpf_ksym, tnode); in bpf_tree_comp()
663 latch_tree_insert(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in bpf_ksym_add()
672 latch_tree_erase(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in __bpf_ksym_del()
736 return n ? container_of(n, struct bpf_ksym, tnode) : NULL; in bpf_ksym_find()
|
| /linux-6.12.1/arch/sparc/mm/ |
| 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()
|
| /linux-6.12.1/include/linux/ |
| D | bpf.h | 1173 struct latch_tree_node tnode; member
|