| /linux/Documentation/networking/ |
| 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
49 the number of positions in the child array of a given tnode that are
55 to this tnode's "pos"+"bits").
81 towards the root from a given tnode, doing a resize() at each step
[all …]
|
| /linux/arch/sparc/include/asm/ |
| A 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/net/ipv4/ |
| A D | fib_trie.c | 132 struct tnode { struct
141 #define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n]) argument
309 struct tnode *n = container_of(head, struct tnode, rcu); in __node_free_rcu()
355 struct tnode *kv; in leaf_new()
379 struct tnode *tnode; in tnode_new() local
385 if (!tnode) in tnode_new()
396 tn = tnode->kv; in tnode_new()
2455 iter->tnode = n; in fib_trie_get_next()
2471 iter->tnode = pn; in fib_trie_get_next()
2491 iter->tnode = n; in fib_trie_get_first()
[all …]
|
| /linux/net/bridge/ |
| 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()
82 err = rhashtable_lookup_insert_fast(&vg->tunnel_hash, &vlan->tnode, in __vlan_tunnel_info_add()
|
| A D | br_private.h | 191 struct rhash_head tnode; member
|
| /linux/drivers/of/ |
| A D | irq.c | 115 struct device_node *ipar, *tnode, *old = NULL, *newpar = NULL; in of_irq_parse_raw() local
135 tnode = ipar; in of_irq_parse_raw()
137 of_node_put(tnode); in of_irq_parse_raw()
155 tnode = of_get_parent(old); in of_irq_parse_raw()
157 old = tnode; in of_irq_parse_raw()
|
| /linux/drivers/infiniband/hw/hfi1/ |
| A D | user_exp_rcv.c | 22 struct tid_rb_node *tnode);
891 struct tid_rb_node *tnode) in cacheless_tid_rb_remove() argument
895 fdata->entry_to_rb[tnode->rcventry - base] = NULL; in cacheless_tid_rb_remove()
896 clear_tid_node(fdata, tnode); in cacheless_tid_rb_remove()
|
| A D | tid_rdma.h | 192 struct kern_tid_node tnode[TID_RDMA_MAX_PAGES]; member
|
| 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/kernel/bpf/ |
| A D | core.c | 588 return container_of(n, struct bpf_ksym, tnode)->start; in bpf_get_ksym_start()
602 ksym = container_of(n, struct bpf_ksym, tnode); in bpf_tree_comp()
626 latch_tree_insert(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in bpf_ksym_add()
635 latch_tree_erase(&ksym->tnode, &bpf_tree, &bpf_tree_ops); in __bpf_ksym_del()
683 return n ? container_of(n, struct bpf_ksym, tnode) : NULL; in bpf_ksym_find()
|
| /linux/security/selinux/ss/ |
| A D | services.c | 632 struct ebitmap_node *snode, *tnode; in context_struct_compute_av() local
660 ebitmap_for_each_positive_bit(tattr, tnode, j) { in context_struct_compute_av()
1030 struct ebitmap_node *snode, *tnode; in security_compute_xperms_decision() local
1079 ebitmap_for_each_positive_bit(tattr, tnode, j) { in security_compute_xperms_decision()
2764 struct ebitmap_node *rnode, *tnode; in security_get_user_sids() local
2801 ebitmap_for_each_positive_bit(&role->types, tnode, j) { in security_get_user_sids()
|
| /linux/arch/sparc/mm/ |
| A D | init_64.c | 1372 int tnode; in find_numa_latencies_for_group() local
1378 tnode = find_best_numa_node_for_mlgroup(m); in find_numa_latencies_for_group()
1379 if (tnode == MAX_NUMNODES) in find_numa_latencies_for_group()
1381 numa_latency[index][tnode] = m->latency; in find_numa_latencies_for_group()
|
| /linux/include/linux/ |
| A D | bpf.h | 645 struct latch_tree_node tnode; member
|