Searched refs:n1 (Results 1 – 6 of 6) sorted by relevance
| /fs/hfs/ |
| A D | string.c | 98 const unsigned char *n1, *n2; in hfs_compare_dentry() local
107 n1 = str; in hfs_compare_dentry()
110 if (caseorder[*n1++] != caseorder[*n2++]) in hfs_compare_dentry()
|
| /fs/xfs/libxfs/ |
| A D | xfs_dir2.h | 29 const struct xfs_name *n1, in xfs_dir2_samename() argument
32 if (n1 == n2) in xfs_dir2_samename()
34 if (n1->len != n2->len) in xfs_dir2_samename()
36 return !memcmp(n1->name, n2->name, n1->len); in xfs_dir2_samename()
|
| /fs/bcachefs/ |
| A D | btree_update_interior.c | 1637 struct btree *n1, *n2 = NULL, *n3 = NULL; in btree_split() local
1669 bch2_btree_build_aux_trees(n1); in btree_split()
1671 bch2_btree_update_add_new_node(as, n1); in btree_split()
1674 six_unlock_write(&n1->c.lock); in btree_split()
1676 path1 = bch2_path_get_unlocked_mut(trans, as->btree_id, n1->c.level, n1->key.k.p); in btree_split()
1726 bch2_btree_build_aux_trees(n1); in btree_split()
1727 bch2_btree_update_add_new_node(as, n1); in btree_split()
1728 six_unlock_write(&n1->c.lock); in btree_split()
1730 path1 = bch2_path_get_unlocked_mut(trans, as->btree_id, n1->c.level, n1->key.k.p); in btree_split()
1764 bch2_btree_update_get_open_buckets(as, n1); in btree_split()
[all …]
|
| /fs/hpfs/ |
| A D | name.c | 76 const unsigned char *n1, unsigned l1, in hpfs_compare_names() argument
83 unsigned char c1 = upcase(hpfs_sb(s)->sb_cp_table,n1[i]); in hpfs_compare_names()
|
| /fs/ntfs3/ |
| A D | namei.c | 444 const char *n1 = str; in ntfs_d_compare() local
457 if ((c1 = *n1++) == (c2 = *n2++)) in ntfs_d_compare()
|
| A D | index.c | 1794 struct indx_node *n1 = fnd->nodes[level]; in indx_insert_into_buffer() local
1795 struct INDEX_HDR *hdr1 = &n1->index->ihdr; in indx_insert_into_buffer()
1809 indx_write(indx, ni, n1, 0); in indx_insert_into_buffer()
1891 indx_write(indx, ni, n1, 0); in indx_insert_into_buffer()
1918 indx_write(indx, ni, n1, 0); in indx_insert_into_buffer()
|
Completed in 20 milliseconds