Home
last modified time | relevance | path

Searched refs:node_off (Results 1 – 2 of 2) sorted by relevance

/linux-6.15/fs/befs/
H A Dbtree.c94 befs_off_t * node_off);
101 befs_off_t node_off);
250 befs_off_t node_off; in befs_btree_find() local
272 node_off = bt_super.root_node_ptr; in befs_btree_find()
275 "node at %llu", node_off); in befs_btree_find()
283 node_off = this_node->head.overflow; in befs_btree_find()
286 "node at %llu", node_off); in befs_btree_find()
417 befs_off_t node_off; in befs_btree_read() local
441 node_off = bt_super.root_node_ptr; in befs_btree_read()
475 node_off = this_node->head.right; in befs_btree_read()
[all …]
/linux-6.15/kernel/bpf/
H A Dverifier.c12781 u32 node_off; in __process_kf_arg_ptr_to_graph_node() local
12799 node_off = reg->off + reg->var_off.value; in __process_kf_arg_ptr_to_graph_node()
12800 field = reg_find_field_offset(reg, node_off, node_field_type); in __process_kf_arg_ptr_to_graph_node()
12802 verbose(env, "%s not found at offset=%u\n", node_type_name, node_off); in __process_kf_arg_ptr_to_graph_node()
12818 node_off, btf_name_by_offset(reg->btf, t->name_off)); in __process_kf_arg_ptr_to_graph_node()
12824 if (node_off != field->graph_root.node_offset) { in __process_kf_arg_ptr_to_graph_node()
12826 node_off, btf_field_type_name(node_field_type), in __process_kf_arg_ptr_to_graph_node()