| /fs/ntfs3/ |
| A D | upcase.c | 36 int ntfs_cmp_names(const __le16 *s1, size_t l1, const __le16 *s2, size_t l2, in ntfs_cmp_names() argument
41 size_t len = min(l1, l2); in ntfs_cmp_names()
55 return l1 - l2; in ntfs_cmp_names()
65 diff2 = l1 - l2; in ntfs_cmp_names()
74 size_t l1 = uni1->len; in ntfs_cmp_names_cpu() local
76 size_t len = min(l1, l2); in ntfs_cmp_names_cpu()
92 return l1 - l2; in ntfs_cmp_names_cpu()
102 diff2 = l1 - l2; in ntfs_cmp_names_cpu()
|
| A D | index.c | 34 static int cmp_fnames(const void *key1, size_t l1, const void *key2, size_t l2, in cmp_fnames() argument
51 if (!l1) { in cmp_fnames()
69 static int cmp_uint(const void *key1, size_t l1, const void *key2, size_t l2, in cmp_uint() argument
88 static int cmp_sdh(const void *key1, size_t l1, const void *key2, size_t l2, in cmp_sdh() argument
123 static int cmp_uints(const void *key1, size_t l1, const void *key2, size_t l2, in cmp_uints() argument
142 if (l1 <= sizeof(int)) in cmp_uints()
144 l1 -= sizeof(int); in cmp_uints()
150 for (count = min(l1, l2) >> 2; count > 0; --count, ++k1, ++k2) { in cmp_uints()
160 if (l1 > l2) in cmp_uints()
162 if (l1 < l2) in cmp_uints()
|
| A D | ntfs_fs.h | 861 int ntfs_cmp_names(const __le16 *s1, size_t l1, const __le16 *s2, size_t l2,
|
| /fs/hpfs/ |
| A D | name.c | 76 const unsigned char *n1, unsigned l1, in hpfs_compare_names() argument
79 unsigned l = l1 < l2 ? l1 : l2; in hpfs_compare_names()
88 if (l1 < l2) return -1; in hpfs_compare_names()
89 if (l1 > l2) return 1; in hpfs_compare_names()
|
| /fs/bcachefs/ |
| A D | rcu_pending.c | 131 static void rcu_pending_list_merge(struct rcu_pending_list *l1, in rcu_pending_list_merge() argument
135 if (!l1->head) in rcu_pending_list_merge()
136 l1->head = l2->head; in rcu_pending_list_merge()
138 l1->tail->next = l2->head; in rcu_pending_list_merge()
140 if (!l1->head) in rcu_pending_list_merge()
141 l1->head = l2->head; in rcu_pending_list_merge()
143 l1->tail->next.next = (void *) l2->head; in rcu_pending_list_merge()
146 l1->tail = l2->tail; in rcu_pending_list_merge()
|
| A D | sb-clean.c | 108 unsigned l1 = 0, l2 = 0; in bch2_verify_superblock_clean() local
110 k1 = btree_root_find(c, clean, NULL, i, &l1); in bch2_verify_superblock_clean()
134 l1 != l2, c, in bch2_verify_superblock_clean()
139 l1, buf1.buf, in bch2_verify_superblock_clean()
|
| /fs/xfs/libxfs/ |
| A D | xfs_bmap_btree.c | 83 uint64_t l1 = get_unaligned_be64(&rec->l1); in xfs_bmbt_disk_get_all() local
86 irec->br_startblock = ((l0 & xfs_mask64lo(9)) << 43) | (l1 >> 21); in xfs_bmbt_disk_get_all()
87 irec->br_blockcount = l1 & xfs_mask64lo(21); in xfs_bmbt_disk_get_all()
101 return (xfs_filblks_t)(be64_to_cpu(r->l1) & xfs_mask64lo(21)); in xfs_bmbt_disk_get_blockcount()
137 (xfs_bmbt_rec_base_t)xfs_mask64lo(21)), &r->l1); in xfs_bmbt_disk_set_all()
|
| A D | xfs_format.h | 1872 __be64 l0, l1; member
|
| /fs/smb/client/ |
| A D | dir.c | 878 int i, l1, l2; local
889 for (i = 0; i < len; i += l1) {
891 l1 = codepage->char2uni(&str[i], len - i, &c1);
898 if (unlikely(l1 < 0 && l2 < 0)) {
901 l1 = 1;
909 if (l1 != l2)
|
| A D | dfs_cache.c | 510 int i, l1, l2; in dfs_path_equal() local
516 for (i = 0; i < len1; i += l1) { in dfs_path_equal()
517 l1 = cache_cp->char2uni(&s1[i], len1 - i, &c1); in dfs_path_equal()
519 if (unlikely(l1 < 0 && l2 < 0)) { in dfs_path_equal()
522 l1 = 1; in dfs_path_equal()
525 if (l1 != l2) in dfs_path_equal()
|
| /fs/nfs/ |
| A D | pnfs.h | 672 pnfs_lseg_range_intersecting(const struct pnfs_layout_range *l1, in pnfs_lseg_range_intersecting() argument
675 u64 end1 = pnfs_end_offset(l1->offset, l1->length); in pnfs_lseg_range_intersecting()
678 return pnfs_is_range_intersecting(l1->offset, end1, l2->offset, end2); in pnfs_lseg_range_intersecting()
|
| A D | pnfs.c | 641 pnfs_lseg_range_contained(const struct pnfs_layout_range *l1, in pnfs_lseg_range_contained() argument
644 u64 start1 = l1->offset; in pnfs_lseg_range_contained()
645 u64 end1 = pnfs_end_offset(start1, l1->length); in pnfs_lseg_range_contained()
1757 pnfs_lseg_range_cmp(const struct pnfs_layout_range *l1, in pnfs_lseg_range_cmp() argument
1763 d = l1->offset - l2->offset; in pnfs_lseg_range_cmp()
1768 d = l2->length - l1->length; in pnfs_lseg_range_cmp()
1773 return (int)(l1->iomode == IOMODE_READ) - (int)(l2->iomode == IOMODE_READ); in pnfs_lseg_range_cmp()
1777 pnfs_lseg_range_is_after(const struct pnfs_layout_range *l1, in pnfs_lseg_range_is_after() argument
1780 return pnfs_lseg_range_cmp(l1, l2) > 0; in pnfs_lseg_range_is_after()
|
| A D | pagelist.c | 1039 static bool nfs_match_lock_context(const struct nfs_lock_context *l1, in nfs_match_lock_context() argument
1042 return l1->lockowner == l2->lockowner; in nfs_match_lock_context()
|
| /fs/nfs/flexfilelayout/ |
| A D | flexfilelayout.c | 292 ff_lseg_match_mirrors(struct pnfs_layout_segment *l1, in ff_lseg_match_mirrors() argument
295 const struct nfs4_ff_layout_segment *fl1 = FF_LAYOUT_LSEG(l1); in ff_lseg_match_mirrors()
296 const struct nfs4_ff_layout_segment *fl2 = FF_LAYOUT_LSEG(l1); in ff_lseg_match_mirrors()
309 ff_lseg_range_is_after(const struct pnfs_layout_range *l1, in ff_lseg_range_is_after() argument
314 if (l1->iomode != l2->iomode) in ff_lseg_range_is_after()
315 return l1->iomode != IOMODE_READ; in ff_lseg_range_is_after()
316 end1 = pnfs_calc_offset_end(l1->offset, l1->length); in ff_lseg_range_is_after()
320 if (end2 < l1->offset) in ff_lseg_range_is_after()
322 return l2->offset <= l1->offset; in ff_lseg_range_is_after()
|
| /fs/xfs/ |
| A D | xfs_extent_busy.c | 685 const struct list_head *l1, in xfs_extent_busy_ag_cmp() argument
689 container_of(l1, struct xfs_extent_busy, list); in xfs_extent_busy_ag_cmp()
|
| A D | xfs_log_cil.c | 1202 struct xfs_log_vec *l1 = container_of(a, struct xfs_log_vec, lv_list); in xlog_cil_order_cmp() local
1205 return l1->lv_order_id > l2->lv_order_id; in xlog_cil_order_cmp()
|