Lines Matching refs:info

60 		    const char *name, struct ext2fs_htree_lookup_info *info);
64 struct ext2fs_htree_lookup_info *info);
71 static void ext2_htree_insert_entry(struct ext2fs_htree_lookup_info *info,
85 static void ext2_htree_release(struct ext2fs_htree_lookup_info *info);
87 static int ext2_htree_writebuf(struct ext2fs_htree_lookup_info *info);
101 struct ext2fs_htree_lookup_info *info)
107 int idx = info->h_levels_num - 1;
111 level = &info->h_levels[idx];
133 level = &info->h_levels[idx + 1];
192 ext2_htree_release(struct ext2fs_htree_lookup_info *info)
196 for (i = 0; i < info->h_levels_num; i++) {
197 struct buf *bp = info->h_levels[i].h_bp;
229 struct ext2fs_htree_lookup_info *info)
242 if (name == NULL || info == NULL)
252 info->h_levels_num = 1;
253 info->h_levels[0].h_bp = bp;
295 level_info = &(info->h_levels[info->h_levels_num - 1]);
307 info->h_levels_num++;
308 info->h_levels[info->h_levels_num - 1].h_bp = bp;
312 ext2_htree_release(info);
326 struct ext2fs_htree_lookup_info info;
343 memset(&info, 0, sizeof(info));
345 &hash_version, &info))
349 leaf_node = info.h_levels[info.h_levels_num - 1].h_entry;
352 ext2_htree_release(&info);
370 ext2_htree_release(&info);
376 ext2_htree_release(&info);
381 search_next = ext2_htree_check_next(ip, dirhash, name, &info);
384 ext2_htree_release(&info);
417 ext2_htree_writebuf(struct ext2fs_htree_lookup_info *info)
421 for (i = 0; i < info->h_levels_num; i++) {
422 struct buf *bp = info->h_levels[i].h_bp;
453 ext2_htree_insert_entry(struct ext2fs_htree_lookup_info *info,
458 level = &info->h_levels[info->h_levels_num - 1];
629 struct ext2fs_htree_lookup_info info;
672 memset(&info, 0, sizeof(info));
673 info.h_levels_num = 1;
674 info.h_levels[0].h_entries = root->h_entries;
675 info.h_levels[0].h_entry = root->h_entries;
682 ext2_htree_insert_entry(&info, split_hash, 2);
729 struct ext2fs_htree_lookup_info info;
756 memset(&info, 0, sizeof(info));
758 &dirhash, &hash_version, &info);
762 entries = info.h_levels[info.h_levels_num - 1].h_entries;
766 root_entires = info.h_levels[0].h_entries;
787 if (info.h_levels_num == 2) {
809 if (info.h_levels[1].h_entry >= entries + src_ent_num) {
810 struct buf *tmp = info.h_levels[1].h_bp;
812 info.h_levels[1].h_bp = dst_bp;
815 info.h_levels[1].h_entry =
816 info.h_levels[1].h_entry -
819 info.h_levels[1].h_entries = dst_entries;
821 ext2_htree_insert_entry_to_level(&info.h_levels[0],
840 info.h_levels[0].h_bp->b_data;
846 info.h_levels_num = 2;
847 info.h_levels[1].h_entries = dst_entries;
848 info.h_levels[1].h_entry = info.h_levels[0].h_entry -
849 info.h_levels[0].h_entries + dst_entries;
850 info.h_levels[1].h_bp = dst_bp;
855 leaf_node = info.h_levels[info.h_levels_num - 1].h_entry;
870 ext2_htree_insert_entry(&info, split_hash, blknum);
885 error = ext2_htree_writebuf(&info);
899 ext2_htree_release(&info);