| /fs/hfsplus/ |
| A D | unicode.c | 36 const hfsplus_unichr *p1, *p2; in hfsplus_strcasecmp() local
41 p2 = s2->unicode; in hfsplus_strcasecmp()
52 c2 = case_fold(be16_to_cpu(*p2)); in hfsplus_strcasecmp()
53 p2++; in hfsplus_strcasecmp()
69 const hfsplus_unichr *p1, *p2; in hfsplus_strcmp() local
75 p2 = s2->unicode; in hfsplus_strcmp()
79 c2 = be16_to_cpu(*p2); in hfsplus_strcmp()
83 p2++; in hfsplus_strcmp()
|
| /fs/bcachefs/ |
| A D | extents.c | 158 const struct extent_ptr_decoded p2, in ptr_better() argument
1055 struct extent_ptr_decoded p1, p2; in bch2_extents_match() local
1062 if (p1.ptr.dev == p2.ptr.dev && in bch2_extents_match()
1063 p1.ptr.gen == p2.ptr.gen && in bch2_extents_match()
1072 (s64) p2.ptr.offset + p2.crc.offset - bkey_start_offset(k2.k) && in bch2_extents_match()
1083 ((p1.ptr.offset >= p2.ptr.offset && in bch2_extents_match()
1084 p1.ptr.offset < p2.ptr.offset + p2.crc.compressed_size) || in bch2_extents_match()
1101 struct extent_ptr_decoded p2; in bch2_extent_has_ptr() local
1104 if (p1.ptr.dev == p2.ptr.dev && in bch2_extent_has_ptr()
1105 p1.ptr.gen == p2.ptr.gen && in bch2_extent_has_ptr()
[all …]
|
| /fs/ |
| A D | fs_parser.c | 390 const struct fs_parameter_spec *param, *p2; in fs_validate_description() local
395 for (p2 = desc; p2 < param; p2++) { in fs_validate_description()
396 if (strcmp(param->name, p2->name) == 0) { in fs_validate_description()
397 if (is_flag(param) != is_flag(p2)) in fs_validate_description()
|
| A D | namei.c | 3236 struct dentry *p = p1, *q = p2, *r; in lock_two_directories()
3238 while ((r = p->d_parent) != p2 && r != p) in lock_two_directories()
3240 if (r == p2) { in lock_two_directories()
3271 if (p1 == p2) { in lock_rename()
3277 return lock_two_directories(p1, p2); in lock_rename()
3286 if (READ_ONCE(c1->d_parent) == p2) { in lock_rename_child()
3295 if (likely(c1->d_parent == p2)) in lock_rename_child()
3302 inode_unlock(p2->d_inode); in lock_rename_child()
3309 if (likely(c1->d_parent != p2)) in lock_rename_child()
3326 if (p1 != p2) { in unlock_rename()
[all …]
|
| A D | eventpoll.c | 359 struct epoll_filefd *p2) in ep_cmp_ffd() argument
361 return (p1->file > p2->file ? +1: in ep_cmp_ffd()
362 (p1->file < p2->file ? -1 : p1->fd - p2->fd)); in ep_cmp_ffd()
|
| A D | namespace.c | 3443 static bool mount_is_ancestor(const struct mount *p1, const struct mount *p2) in mount_is_ancestor() argument
3445 while (p2 != p1 && mnt_has_parent(p2)) in mount_is_ancestor()
3446 p2 = p2->mnt_parent; in mount_is_ancestor()
3447 return p2 == p1; in mount_is_ancestor()
|
| A D | dcache.c | 2934 struct dentry *d_ancestor(struct dentry *p1, struct dentry *p2) in d_ancestor() argument
2938 for (p = p2; !IS_ROOT(p); p = p->d_parent) { in d_ancestor()
|
| /fs/ext4/ |
| A D | indirect.c | 1236 Indirect *p = NULL, *p2 = NULL; in ext4_ind_remove_space() local
1307 partial2 = p2 = ext4_find_shared(inode, n2, offsets2, chain2, &nr2); in ext4_ind_remove_space()
1344 partial2 = p2 = ext4_find_shared(inode, n2, offsets2, chain2, &nr2); in ext4_ind_remove_space()
1433 while (p2 && p2 > chain2) { in ext4_ind_remove_space()
1434 BUFFER_TRACE(p2->bh, "call brelse"); in ext4_ind_remove_space()
1435 brelse(p2->bh); in ext4_ind_remove_space()
1436 p2--; in ext4_ind_remove_space()
|
| A D | fsmap.c | 65 static int ext4_getfsmap_dev_compare(const void *p1, const void *p2) in ext4_getfsmap_dev_compare() argument
68 const struct ext4_getfsmap_dev *d2 = p2; in ext4_getfsmap_dev_compare()
|
| /fs/smb/client/ |
| A D | compress.c | 66 size_t i, p, p2, len, sum = 0; in has_low_entropy() local
73 p2 = ilog2(pow4(p)); in has_low_entropy()
74 sum += p * (len - p2); in has_low_entropy()
|
| /fs/crypto/ |
| A D | policy.c | 862 const struct fscrypt_dummy_policy *p2) in fscrypt_dummy_policies_equal() argument
864 if (!p1->policy && !p2->policy) in fscrypt_dummy_policies_equal()
866 if (!p1->policy || !p2->policy) in fscrypt_dummy_policies_equal()
868 return fscrypt_policies_equal(p1->policy, p2->policy); in fscrypt_dummy_policies_equal()
|
| /fs/notify/fanotify/ |
| A D | fanotify.c | 20 static bool fanotify_path_equal(const struct path *p1, const struct path *p2) in fanotify_path_equal() argument
22 return p1->mnt == p2->mnt && p1->dentry == p2->dentry; in fanotify_path_equal()
|
| /fs/ntfs3/ |
| A D | lznt.c | 25 const u8 *p2; member
|
| A D | fslog.c | 3255 void *p2 = kmemdup(attr, le32_to_cpu(attr->size), in do_action() local
3257 if (p2) { in do_action()
3260 oa2->attr = p2; in do_action()
3322 void *p2 = kmemdup(attr, le32_to_cpu(attr->size), in do_action() local
3324 if (p2) { in do_action()
3328 oa2->attr = p2; in do_action()
3381 void *p2 = kmemdup(attr, le32_to_cpu(attr->size), in do_action() local
3383 if (p2) { in do_action()
3385 oa2->attr = p2; in do_action()
|
| /fs/xfs/ |
| A D | xfs_fsmap.c | 197 const void *p2) in xfs_getfsmap_dev_compare() argument
200 const struct xfs_getfsmap_dev *d2 = p2; in xfs_getfsmap_dev_compare()
|
| /fs/hpfs/ |
| A D | dnode.c | 76 loff_t p1, loff_t p2) in for_all_poss() argument
82 for (i = hpfs_inode->i_rddir_off; *i; i++) (*f)(*i, p1, p2); in for_all_poss()
|
| /fs/ocfs2/dlm/ |
| A D | dlmmaster.c | 1166 unsigned long p1, p2; in dlm_bitmap_diff_iter_init() local
1175 p2 = *(iter->cur_bm + i); in dlm_bitmap_diff_iter_init()
1176 iter->diff_bm[i] = (p1 & ~p2) | (p2 & ~p1); in dlm_bitmap_diff_iter_init()
|
| /fs/btrfs/ |
| A D | send.c | 574 static inline int fs_path_add_path(struct fs_path *p, const struct fs_path *p2) in fs_path_add_path() argument
576 return fs_path_add(p, p2->start, fs_path_len(p2)); in fs_path_add_path()
|