Lines Matching refs:node

100 			     struct befs_btree_node *node,
103 static int befs_leafnode(struct befs_btree_node *node);
105 static fs16 *befs_bt_keylen_index(struct befs_btree_node *node);
107 static fs64 *befs_bt_valarray(struct befs_btree_node *node);
109 static char *befs_bt_keydata(struct befs_btree_node *node);
112 struct befs_btree_node *node,
116 struct befs_btree_node *node,
197 struct befs_btree_node *node, befs_off_t node_off) in befs_bt_read_node() argument
203 if (node->bh) in befs_bt_read_node()
204 brelse(node->bh); in befs_bt_read_node()
206 node->bh = befs_read_datastream(sb, ds, node_off, &off); in befs_bt_read_node()
207 if (!node->bh) { in befs_bt_read_node()
214 node->od_node = in befs_bt_read_node()
215 (befs_btree_nodehead *) ((void *) node->bh->b_data + off); in befs_bt_read_node()
217 befs_dump_index_node(sb, node->od_node); in befs_bt_read_node()
219 node->head.left = fs64_to_cpu(sb, node->od_node->left); in befs_bt_read_node()
220 node->head.right = fs64_to_cpu(sb, node->od_node->right); in befs_bt_read_node()
221 node->head.overflow = fs64_to_cpu(sb, node->od_node->overflow); in befs_bt_read_node()
222 node->head.all_key_count = in befs_bt_read_node()
223 fs16_to_cpu(sb, node->od_node->all_key_count); in befs_bt_read_node()
224 node->head.all_key_length = in befs_bt_read_node()
225 fs16_to_cpu(sb, node->od_node->all_key_length); in befs_bt_read_node()
339 befs_find_key(struct super_block *sb, struct befs_btree_node *node, in befs_find_key() argument
356 last = node->head.all_key_count - 1; in befs_find_key()
357 thiskey = befs_bt_get_key(sb, node, last, &keylen); in befs_find_key()
365 valarray = befs_bt_valarray(node); in befs_find_key()
374 thiskey = befs_bt_get_key(sb, node, mid, &keylen); in befs_find_key()
608 befs_leafnode(struct befs_btree_node *node) in befs_leafnode() argument
611 if (node->head.overflow == befs_bt_inval) in befs_leafnode()
631 befs_bt_keylen_index(struct befs_btree_node *node) in befs_bt_keylen_index() argument
635 (sizeof (befs_btree_nodehead) + node->head.all_key_length); in befs_bt_keylen_index()
641 return (fs16 *) ((void *) node->od_node + off); in befs_bt_keylen_index()
652 befs_bt_valarray(struct befs_btree_node *node) in befs_bt_valarray() argument
654 void *keylen_index_start = (void *) befs_bt_keylen_index(node); in befs_bt_valarray()
655 size_t keylen_index_size = node->head.all_key_count * sizeof (fs16); in befs_bt_valarray()
668 befs_bt_keydata(struct befs_btree_node *node) in befs_bt_keydata() argument
670 return (char *) ((void *) node->od_node + sizeof (befs_btree_nodehead)); in befs_bt_keydata()
684 befs_bt_get_key(struct super_block *sb, struct befs_btree_node *node, in befs_bt_get_key() argument
691 if (index < 0 || index > node->head.all_key_count) { in befs_bt_get_key()
696 keystart = befs_bt_keydata(node); in befs_bt_get_key()
697 keylen_index = befs_bt_keylen_index(node); in befs_bt_get_key()