static struct f2fs_dir_entry *find_in_block(struct page *dentry_page, struct qstr *name, int *max_slots, f2fs_hash_t namehash, struct page **res_page) { struct f2fs_dir_entry *de; unsigned long bit_pos = 0; struct f2fs_dentry_block *dentry_blk = kmap(dentry_page); const void *dentry_bits = &dentry_blk->dentry_bitmap; int max_len = 0; while (bit_pos < NR_DENTRY_IN_BLOCK) { if (!test_bit_le(bit_pos, dentry_bits)) { if (bit_pos == 0) max_len = 1; else if (!test_bit_le(bit_pos - 1, dentry_bits)) max_len++; bit_pos++; continue; } de = &dentry_blk->dentry[bit_pos]; if (early_match_name(name->len, namehash, de)) { if (!memcmp(dentry_blk->filename[bit_pos], name->name, name->len)) { *res_page = dentry_page; goto found; } } if (max_len > *max_slots) { *max_slots = max_len; max_len = 0; } /* * For the most part, it should be a bug when name_len is zero. * We stop here for figuring out where the bugs are occurred. */ f2fs_bug_on(!de->name_len); bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); } de = NULL; kunmap(dentry_page); found: if (max_len > *max_slots) *max_slots = max_len; return de; }
struct f2fs_dir_entry *find_target_dentry(struct qstr *name, int *max_slots, struct f2fs_dentry_ptr *d, unsigned int flags) { struct f2fs_dir_entry *de; unsigned long bit_pos = 0; f2fs_hash_t namehash = f2fs_dentry_hash(name); int max_len = 0; if (max_slots) *max_slots = 0; while (bit_pos < d->max) { if (!test_bit_le(bit_pos, d->bitmap)) { if (bit_pos == 0) max_len = 1; else if (!test_bit_le(bit_pos - 1, d->bitmap)) max_len++; bit_pos++; continue; } de = &d->dentry[bit_pos]; if (flags & LOOKUP_NOCASE) { if ((le16_to_cpu(de->name_len) == name->len) && !strncasecmp(d->filename[bit_pos], name->name, name->len)) goto found; } else if (early_match_name(name->len, namehash, de) && !memcmp(d->filename[bit_pos], name->name, name->len)) { goto found; } if (max_slots && *max_slots >= 0 && max_len > *max_slots) { *max_slots = max_len; max_len = 0; } /* remain bug on condition */ if (unlikely(!de->name_len)) d->max = -1; bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); } de = NULL; found: if (max_slots && max_len > *max_slots) *max_slots = max_len; return de; }
static struct f2fs_dir_entry *find_in_block(struct page *dentry_page, const char *name, size_t namelen, int *max_slots, f2fs_hash_t namehash, struct page **res_page, bool nocase) { struct f2fs_dir_entry *de; unsigned long bit_pos, end_pos, next_pos; struct f2fs_dentry_block *dentry_blk = kmap(dentry_page); int slots; bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap, NR_DENTRY_IN_BLOCK, 0); while (bit_pos < NR_DENTRY_IN_BLOCK) { de = &dentry_blk->dentry[bit_pos]; slots = GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); if (nocase) { if ((le16_to_cpu(de->name_len) == namelen) && !strncasecmp(dentry_blk->filename[bit_pos], name, namelen)) { *res_page = dentry_page; goto found; } } else if (early_match_name(name, namelen, namehash, de)) { if (!memcmp(dentry_blk->filename[bit_pos], name, namelen)) { *res_page = dentry_page; goto found; } } next_pos = bit_pos + slots; bit_pos = find_next_bit_le(&dentry_blk->dentry_bitmap, NR_DENTRY_IN_BLOCK, next_pos); if (bit_pos >= NR_DENTRY_IN_BLOCK) end_pos = NR_DENTRY_IN_BLOCK; else end_pos = bit_pos; if (*max_slots < end_pos - next_pos) *max_slots = end_pos - next_pos; } de = NULL; kunmap(dentry_page); found: return de; }
static struct f2fs_dir_entry *find_in_block(struct page *dentry_page, const char *name, size_t namelen, int *max_slots, f2fs_hash_t namehash, struct page **res_page) { struct f2fs_dir_entry *de; unsigned long bit_pos = 0; struct f2fs_dentry_block *dentry_blk = kmap(dentry_page); const void *dentry_bits = &dentry_blk->dentry_bitmap; int max_len = 0; while (bit_pos < NR_DENTRY_IN_BLOCK) { if (!test_bit_le(bit_pos, dentry_bits)) { if (bit_pos == 0) max_len = 1; else if (!test_bit_le(bit_pos - 1, dentry_bits)) max_len++; bit_pos++; continue; } de = &dentry_blk->dentry[bit_pos]; if (early_match_name(name, namelen, namehash, de)) { if (!memcmp(dentry_blk->filename[bit_pos], name, namelen)) { *res_page = dentry_page; goto found; } } if (max_len > *max_slots) { *max_slots = max_len; max_len = 0; } bit_pos += GET_DENTRY_SLOTS(le16_to_cpu(de->name_len)); } de = NULL; kunmap(dentry_page); found: if (max_len > *max_slots) *max_slots = max_len; return de; }