arch/sparc/include/asm/floppy_32.h

279

phandle tnode;

arch/sparc/include/asm/floppy_32.h

292

tnode = prom_getchild(prom_root_node);

arch/sparc/include/asm/floppy_32.h

293

fd_node = prom_searchsiblings(tnode, "obio");

arch/sparc/include/asm/floppy_32.h

295

tnode = prom_getchild(fd_node);

arch/sparc/include/asm/floppy_32.h

296

fd_node = prom_searchsiblings(tnode, "SUNW,fdtwo");

arch/sparc/include/asm/floppy_32.h

298

fd_node = prom_searchsiblings(tnode, "fd");

arch/sparc/mm/init_64.c

1370

int tnode;

arch/sparc/mm/init_64.c

1376

tnode = find_best_numa_node_for_mlgroup(m);

arch/sparc/mm/init_64.c

1377

if (tnode == MAX_NUMNODES)

arch/sparc/mm/init_64.c

1379

numa_latency[index][tnode] = m->latency;

drivers/counter/stm32-timer-cnt.c

685

struct device_node *tnode = NULL, *pnode = parent->of_node;

drivers/counter/stm32-timer-cnt.c

696

for (i = 0; i < ARRAY_SIZE(stm32_timer_trigger_compat) && !tnode; i++)

drivers/counter/stm32-timer-cnt.c

697

tnode = of_get_compatible_child(pnode, stm32_timer_trigger_compat[i]);

drivers/counter/stm32-timer-cnt.c

698

if (!tnode) {

drivers/counter/stm32-timer-cnt.c

703

ret = of_property_read_u32(tnode, "reg", &idx);

drivers/counter/stm32-timer-cnt.c

704

of_node_put(tnode);

drivers/infiniband/hw/hfi1/tid_rdma.c

1208

struct kern_tid_node *node = &flow->tnode[flow->tnode_cnt++];

drivers/infiniband/hw/hfi1/tid_rdma.c

1305

struct kern_tid_node *node = &flow->tnode[grp_num];

drivers/infiniband/hw/hfi1/tid_rdma.c

1372

struct kern_tid_node *node = &flow->tnode[grp_num];

drivers/infiniband/hw/hfi1/tid_rdma.h

192

struct kern_tid_node tnode[TID_RDMA_MAX_PAGES];

drivers/infiniband/hw/hfi1/user_exp_rcv.c

22

struct tid_rb_node *tnode);

drivers/infiniband/hw/hfi1/user_exp_rcv.c

949

struct tid_rb_node *tnode)

drivers/infiniband/hw/hfi1/user_exp_rcv.c

953

fdata->entry_to_rb[tnode->rcventry - base] = NULL;

drivers/infiniband/hw/hfi1/user_exp_rcv.c

954

clear_tid_node(fdata, tnode);

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

3536

struct npc_defrag_node *node, *tnode = NULL;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

3551

tnode = node;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

3555

return tnode;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

3561

struct npc_defrag_node *node, *tnode = NULL;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

3570

tnode = node;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

3574

return tnode;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4071

struct npc_defrag_node *node, *tnode;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4142

tnode = &node[sb->idx];

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4143

tnode->vidx[tnode->vidx_cnt] = index;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4144

tnode->vidx_cnt++;

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4149

tnode = &node[i];

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4151

if (!tnode->valid)

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4154

tot = (tnode->key_type == NPC_MCAM_KEY_X2) ?

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4157

if (node[i].vidx_cnt != tot - tnode->free_cnt)

drivers/net/ethernet/marvell/octeontx2/af/cn20k/npc.c

4158

tnode->refs = true;

drivers/of/irq.c

248

struct device_node *ipar, *tnode, *old = NULL;

drivers/of/irq.c

268

tnode = ipar;

drivers/of/irq.c

270

of_node_put(tnode);

drivers/of/irq.c

288

tnode = of_get_parent(old);

drivers/of/irq.c

290

old = tnode;

include/linux/bpf.h

1353

struct latch_tree_node tnode;

kernel/bpf/core.c

602

return container_of(n, struct bpf_ksym, tnode)->start;

kernel/bpf/core.c

616

ksym = container_of(n, struct bpf_ksym, tnode);

kernel/bpf/core.c

644

latch_tree_insert(&ksym->tnode, &bpf_tree, &bpf_tree_ops);

kernel/bpf/core.c

653

latch_tree_erase(&ksym->tnode, &bpf_tree, &bpf_tree_ops);

kernel/bpf/core.c

717

return n ? container_of(n, struct bpf_ksym, tnode) : NULL;

lib/lwq.c

104

struct tnode *t;

lib/lwq.c

131

t = lwq_dequeue(&q, struct tnode, n);

lib/lwq.c

149

while ((t = lwq_dequeue(&q, struct tnode, n)) != NULL) {

lib/lwq.c

86

struct tnode *t;

lib/lwq.c

89

wait_var_event(q, (t = lwq_dequeue(q, struct tnode, n)) != NULL);

net/bridge/br_private.h

219

struct rhash_head tnode;

net/bridge/br_vlan_tunnel.c

29

.head_offset = offsetof(struct net_bridge_vlan, tnode),

net/bridge/br_vlan_tunnel.c

58

rhashtable_remove_fast(&vg->tunnel_hash, &vlan->tnode,

net/bridge/br_vlan_tunnel.c

83

err = rhashtable_lookup_insert_fast(&vg->tunnel_hash, &vlan->tnode,

net/ipv4/fib_trie.c

130

DECLARE_FLEX_ARRAY(struct key_vector __rcu *, tnode);

net/ipv4/fib_trie.c

143

#define TNODE_SIZE(n) offsetof(struct tnode, kv[0].tnode[n])

net/ipv4/fib_trie.c

1487

struct key_vector __rcu **cptr = n->tnode;

net/ipv4/fib_trie.c

1540

cptr = &pn->tnode[cindex];

net/ipv4/fib_trie.c

189

static inline struct tnode *tn_info(struct key_vector *kv)

net/ipv4/fib_trie.c

191

return container_of(kv, struct tnode, kv[0]);

net/ipv4/fib_trie.c

196

#define get_child(tn, i) rtnl_dereference((tn)->tnode[i])

net/ipv4/fib_trie.c

200

#define get_child_rcu(tn, i) rcu_dereference_rtnl((tn)->tnode[i])

net/ipv4/fib_trie.c

2421

struct key_vector *tnode;

net/ipv4/fib_trie.c

2429

struct key_vector *pn = iter->tnode;

net/ipv4/fib_trie.c

2433

iter->tnode, iter->index, iter->depth);

net/ipv4/fib_trie.c

2443

iter->tnode = pn;

net/ipv4/fib_trie.c

2447

iter->tnode = n;

net/ipv4/fib_trie.c

2463

iter->tnode = pn;

net/ipv4/fib_trie.c

2478

n = rcu_dereference(pn->tnode[0]);

net/ipv4/fib_trie.c

2483

iter->tnode = n;

net/ipv4/fib_trie.c

2487

iter->tnode = pn;

net/ipv4/fib_trie.c

2822

struct key_vector *tnode;

net/ipv4/fib_trie.c

2830

struct key_vector *l, **tp = &iter->tnode;

net/ipv4/fib_trie.c

2876

iter->tnode = t->kv;

net/ipv4/fib_trie.c

2897

l = leaf_walk_rcu(&iter->tnode, key);

net/ipv4/fib_trie.c

305

struct tnode *n = container_of(head, struct tnode, rcu);

net/ipv4/fib_trie.c

315

static struct tnode *tnode_alloc(int bits)

net/ipv4/fib_trie.c

351

struct tnode *kv;

net/ipv4/fib_trie.c

375

struct tnode *tnode;

net/ipv4/fib_trie.c

380

tnode = tnode_alloc(bits);

net/ipv4/fib_trie.c

381

if (!tnode)

net/ipv4/fib_trie.c

384

pr_debug("AT %p s=%zu %zu\n", tnode, TNODE_SIZE(0),

net/ipv4/fib_trie.c

388

tnode->full_children = 1;

net/ipv4/fib_trie.c

390

tnode->empty_children = 1ul << bits;

net/ipv4/fib_trie.c

392

tn = tnode->kv;

net/ipv4/fib_trie.c

438

rcu_assign_pointer(tn->tnode[i], n);

net/ipv4/fib_trie.c

467

rcu_assign_pointer(tp->tnode[0], n);

net/ipv4/fib_trie.c

493

tn = container_of(head, struct tnode, rcu)->kv;

security/selinux/ss/services.c

1042

struct ebitmap_node *snode, *tnode;

security/selinux/ss/services.c

1092

ebitmap_for_each_positive_bit(tattr, tnode, j) {

security/selinux/ss/services.c

633

struct ebitmap_node *snode, *tnode;

security/selinux/ss/services.c

659

ebitmap_for_each_positive_bit(tattr, tnode, j) {

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

106

if (lookup_key < tnode->key)

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

128

tnode = container_of(rb_n, struct tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

130

node_data = bpf_kptr_xchg(&tnode->node_data, NULL);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

134

bpf_obj_drop(tnode);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

261

struct tree_node *tnode;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

274

tnode = container_of(rb_n, struct tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

275

node_data = bpf_kptr_xchg(&tnode->node_data, NULL);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

283

node_data = bpf_kptr_xchg(&tnode->node_data, node_data);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

50

struct tree_node *tnode;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

58

tnode = bpf_obj_new(typeof(*tnode));

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

59

if (!tnode)

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

64

bpf_obj_drop(tnode);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

68

tnode->key = i;

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

71

node_data = bpf_kptr_xchg(&tnode->node_data, node_data);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

76

bpf_rbtree_add(&root, &tnode->node, less);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

83

tnode = container_of(rb_n, struct tree_node, node);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

84

node_data = bpf_kptr_xchg(&tnode->node_data, NULL);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

91

node_data = bpf_kptr_xchg(&tnode->node_data, node_data);

tools/testing/selftests/bpf/progs/rbtree_search_kptr.c

98

if (lookup_key == tnode->key) {