| /fs/hfsplus/ |
| D | unicode.c | 35 u16 len1, len2, c1, c2; in hfsplus_strcasecmp() local
39 len2 = be16_to_cpu(s2->length); in hfsplus_strcasecmp()
51 while (len2 && !c2) { in hfsplus_strcasecmp()
54 len2--; in hfsplus_strcasecmp()
68 u16 len1, len2, c1, c2; in hfsplus_strcmp() local
73 len2 = be16_to_cpu(s2->length); in hfsplus_strcmp()
77 for (len = min(len1, len2); len > 0; len--) { in hfsplus_strcmp()
86 return len1 < len2 ? -1 : in hfsplus_strcmp()
87 len1 > len2 ? 1 : 0; in hfsplus_strcmp()
441 int dsize1, dsize2, len1, len2; in hfsplus_compare_dentry() local
[all …]
|
| /fs/hfs/ |
| D | string.c | 77 const unsigned char *s2, unsigned int len2) in hfs_strcmp() argument
81 len = (len1 > len2) ? len2 : len1; in hfs_strcmp()
88 return len1 - len2; in hfs_strcmp()
|
| /fs/ntfs3/ |
| D | lznt.c | 51 size_t len1 = 0, len2 = 0; in longest_match_std() local
70 len2 = 3; in longest_match_std()
72 len2 += get_match_len(src + 3, ctx->unc_end, in longest_match_std()
77 if (len1 < len2) { in longest_match_std()
79 len1 = len2; in longest_match_std()
|
| D | run.c | 577 CLST len2 = r->len - len1; in run_insert_range() local
582 if (!run_add_entry(run, vcn + len, lcn2, len2, false)) in run_insert_range()
|
| D | ntfs_fs.h | 171 size_t len2, const void *param);
|
| /fs/nfs/blocklayout/ |
| D | extent_tree.c | 181 sector_t len1 = 0, len2 = 0; in __ext_tree_remove() local
197 len2 = ext_f_end(be) - end; in __ext_tree_remove()
199 if (len2 > 0) { in __ext_tree_remove()
212 orig_v_offset + orig_len - len2; in __ext_tree_remove()
214 new->be_length = len2; in __ext_tree_remove()
224 orig_v_offset + orig_len - len2; in __ext_tree_remove()
226 be->be_length = len2; in __ext_tree_remove()
|
| /fs/ext4/ |
| D | extents_status.c | 1378 ext4_lblk_t len1, len2; in __es_remove_extent() local
1403 len2 = ext4_es_end(es) > end ? ext4_es_end(es) - end : 0; in __es_remove_extent()
1406 if (len2 > 0) { in __es_remove_extent()
1411 newes.es_len = len2; in __es_remove_extent()
1416 orig_es.es_len - len2; in __es_remove_extent()
1430 es->es_len = len2; in __es_remove_extent()
1433 block = orig_es.es_pblk + orig_es.es_len - len2; in __es_remove_extent()
1439 orig_es.es_len - len1 - len2, &orig_es, &rc); in __es_remove_extent()
|
| /fs/xfs/libxfs/ |
| D | xfs_bmap.c | 4726 xfs_filblks_t len2 = *indlen2; in xfs_bmap_split_indlen() local
4727 xfs_filblks_t nres = len1 + len2; /* new total res. */ in xfs_bmap_split_indlen()
4755 len2 *= resfactor; in xfs_bmap_split_indlen()
4756 do_div(len2, 100); in xfs_bmap_split_indlen()
4757 ASSERT(len1 + len2 <= ores); in xfs_bmap_split_indlen()
4758 ASSERT(len1 < *indlen1 && len2 < *indlen2); in xfs_bmap_split_indlen()
4766 ores -= (len1 + len2); in xfs_bmap_split_indlen()
4767 ASSERT((*indlen1 - len1) + (*indlen2 - len2) >= ores); in xfs_bmap_split_indlen()
4768 if (ores && !len2 && *indlen2) { in xfs_bmap_split_indlen()
4769 len2++; in xfs_bmap_split_indlen()
[all …]
|
| /fs/smb/client/ |
| D | dfs_cache.c | 622 static bool dfs_path_equal(const char *s1, int len1, const char *s2, int len2) in dfs_path_equal() argument
627 if (len1 != len2) in dfs_path_equal()
632 l2 = cache_cp->char2uni(&s2[i], len2 - i, &c2); in dfs_path_equal()
|
| /fs/ubifs/ |
| D | journal.c | 1838 int err, len1, len2, aligned_len, aligned_len1, lnum, offs; in ubifs_jnl_change_xattr() local
1851 len2 = UBIFS_INO_NODE_SZ + ubifs_inode(inode)->data_len; in ubifs_jnl_change_xattr()
1853 aligned_len = aligned_len1 + ALIGN(len2, 8); in ubifs_jnl_change_xattr()
1894 err = ubifs_tnc_add(c, &key, lnum, offs + aligned_len1, len2, hash); in ubifs_jnl_change_xattr()
|
| /fs/proc/ |
| D | proc_sysctl.c | 109 static int namecmp(const char *name1, int len1, const char *name2, int len2) in namecmp() argument
113 cmp = memcmp(name1, name2, min(len1, len2)); in namecmp()
115 cmp = len1 - len2; in namecmp()
|
| /fs/udf/ |
| D | namei.c | 35 static inline int udf_match(int len1, const unsigned char *name1, int len2, in udf_match() argument
38 if (len1 != len2) in udf_match()
|
| /fs/btrfs/ |
| D | send.c | 3721 int len1, len2; in wait_for_parent_move() local
3775 len2 = fs_path_len(path_after); in wait_for_parent_move()
3777 (parent_ino_before != parent_ino_after || len1 != len2 || in wait_for_parent_move()
7264 int len1, len2; in tree_compare_item() local
7268 len2 = btrfs_item_size(right_path->nodes[0], right_path->slots[0]); in tree_compare_item()
7269 if (len1 != len2) in tree_compare_item()
|