Home
last modified time | relevance | path

Searched refs:tnode (Results 1 – 14 of 14) sorted by relevance

/Linux-v5.10/Documentation/networking/
Dfib_trie.rst14 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-v5.10/arch/sparc/include/asm/
Dfloppy_32.h282 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-v5.10/net/ipv4/
Dfib_trie.c128 struct key_vector __rcu *tnode[0]; member
132 struct tnode { struct
141 #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n]) argument
187 static inline struct tnode *tn_info(struct key_vector *kv) in tn_info()
189 return container_of(kv, struct tnode, kv[0]); in tn_info()
194 #define get_child(tn, i) rtnl_dereference((tn)->tnode[i])
198 #define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])
309 struct tnode *n = container_of(head, struct tnode, rcu); in __node_free_rcu()
319 static struct tnode *tnode_alloc(int bits) in tnode_alloc()
355 struct tnode *kv; in leaf_new()
[all …]
/Linux-v5.10/net/bridge/
Dbr_vlan_tunnel.c29 .head_offset = offsetof(struct net_bridge_vlan, tnode),
49 rhashtable_remove_fast(&vg->tunnel_hash, &vlan->tnode, in vlan_tunnel_info_del()
75 err = rhashtable_lookup_insert_fast(&vg->tunnel_hash, &vlan->tnode, in __vlan_tunnel_info_add()
Dbr_private.h135 struct rhash_head tnode; member
/Linux-v5.10/drivers/of/
Dirq.c95 struct device_node *ipar, *tnode, *old = NULL, *newpar = NULL; in of_irq_parse_raw() local
115 tnode = ipar; in of_irq_parse_raw()
117 of_node_put(tnode); in of_irq_parse_raw()
135 tnode = of_get_parent(old); in of_irq_parse_raw()
137 old = tnode; in of_irq_parse_raw()
/Linux-v5.10/drivers/infiniband/hw/hfi1/
Duser_exp_rcv.c64 struct tid_rb_node *tnode);
935 struct tid_rb_node *tnode) in cacheless_tid_rb_remove() argument
939 fdata->entry_to_rb[tnode->rcventry - base] = NULL; in cacheless_tid_rb_remove()
940 clear_tid_node(fdata, tnode); in cacheless_tid_rb_remove()
Dtid_rdma.h192 struct kern_tid_node tnode[TID_RDMA_MAX_PAGES]; member
Dtid_rdma.c1201 struct kern_tid_node *node = &flow->tnode[flow->tnode_cnt++]; in kern_add_tid_node()
1298 struct kern_tid_node *node = &flow->tnode[grp_num]; in kern_program_rcv_group()
1365 struct kern_tid_node *node = &flow->tnode[grp_num]; in kern_unprogram_rcv_group()
/Linux-v5.10/fs/
Deventpoll.c484 struct nested_call_node tnode; in ep_call_nested() local
506 tnode.ctx = ctx; in ep_call_nested()
507 tnode.cookie = cookie; in ep_call_nested()
508 list_add(&tnode.llink, lsthead); in ep_call_nested()
517 list_del(&tnode.llink); in ep_call_nested()
/Linux-v5.10/kernel/bpf/
Dcore.c581 return container_of(n, struct bpf_ksym, tnode)->start; in bpf_get_ksym_start()
595 ksym = container_of(n, struct bpf_ksym, tnode); in bpf_tree_comp()
619 latch_tree_insert(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in bpf_ksym_add()
628 latch_tree_erase(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in __bpf_ksym_del()
676 return n ? container_of(n, struct bpf_ksym, tnode) : NULL; in bpf_ksym_find()
/Linux-v5.10/security/selinux/ss/
Dservices.c621 struct ebitmap_node *snode, *tnode; in context_struct_compute_av() local
649 ebitmap_for_each_positive_bit(tattr, tnode, j) { in context_struct_compute_av()
1018 struct ebitmap_node *snode, *tnode; in security_compute_xperms_decision() local
1067 ebitmap_for_each_positive_bit(tattr, tnode, j) { in security_compute_xperms_decision()
2667 struct ebitmap_node *rnode, *tnode; in security_get_user_sids() local
2703 ebitmap_for_each_positive_bit(&role->types, tnode, j) { in security_get_user_sids()
/Linux-v5.10/arch/sparc/mm/
Dinit_64.c1371 int tnode; in find_numa_latencies_for_group() local
1377 tnode = find_best_numa_node_for_mlgroup(m); in find_numa_latencies_for_group()
1378 if (tnode == MAX_NUMNODES) in find_numa_latencies_for_group()
1380 numa_latency[index][tnode] = m->latency; in find_numa_latencies_for_group()
/Linux-v5.10/include/linux/
Dbpf.h574 struct latch_tree_node tnode; member