Home
last modified time | relevance | path

Searched refs:len2 (Results 1 – 16 of 16) sorted by relevance

/fs/hfsplus/
A Dunicode.c35 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
86 return len1 < len2 ? -1 : in hfsplus_strcmp()
87 len1 > len2 ? 1 : 0; in hfsplus_strcmp()
460 len2 = name->len; in hfsplus_compare_dentry()
483 len2 -= size; in hfsplus_compare_dentry()
522 if (len1 < len2) in hfsplus_compare_dentry()
[all …]
/fs/udf/
A Ddirectory.c330 static void udf_copy_to_bufs(void *buf1, int len1, void *buf2, int len2, in udf_copy_to_bufs() argument
345 if (WARN_ON_ONCE(off + len > len2 || !buf2)) in udf_copy_to_bufs()
366 if (WARN_ON_ONCE(off + len > len2 || !buf2)) in udf_crc_fi_bufs()
384 udf_copy_to_bufs(buf1, len1, buf2, len2, off, fi, in udf_copy_fi_to_bufs()
388 udf_copy_to_bufs(buf1, len1, buf2, len2, off, impuse, in udf_copy_fi_to_bufs()
392 udf_copy_to_bufs(buf1, len1, buf2, len2, off, name, in udf_copy_fi_to_bufs()
395 udf_copy_to_bufs(buf1, len1, buf2, len2, off, zeros, in udf_copy_fi_to_bufs()
399 crc = udf_crc_fi_bufs(buf1, len1, buf2, len2, crcoff, crclen); in udf_copy_fi_to_bufs()
411 int len1, len2 = 0, off; in udf_fiiter_write_fi() local
423 len2 = blksize; in udf_fiiter_write_fi()
[all …]
A Dnamei.c31 static inline int udf_match(int len1, const unsigned char *name1, int len2, in udf_match() argument
34 if (len1 != len2) in udf_match()
/fs/hfs/
A Dstring.c77 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/btrfs/tests/
A Draid-stripe-tree-tests.c47 u64 len2 = SZ_1M; in test_punch_hole_3extents() local
48 u64 logical3 = logical2 + len2; in test_punch_hole_3extents()
87 bioc->size = len2; in test_punch_hole_3extents()
168 logical2, logical2 + len2); in test_punch_hole_3extents()
225 u64 len2 = SZ_1M; in test_delete_two_extents() local
226 u64 logical3 = logical2 + len2; in test_delete_two_extents()
263 bioc->size = len2; in test_delete_two_extents()
327 logical2, len2); in test_delete_two_extents()
372 u64 len2 = len - len1 - hole_len; in test_punch_hole() local
460 logical2 + len2); in test_punch_hole()
[all …]
/fs/ntfs3/
A Dlznt.c51 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()
A Dnamei.c446 unsigned int len2 = name->len; in ntfs_d_compare() local
447 unsigned int lm = min(len1, len2); in ntfs_d_compare()
455 return len1 != len2; in ntfs_d_compare()
A Drun.c577 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()
A Dntfs_fs.h176 size_t len2, const void *param);
/fs/nfs/blocklayout/
A Dextent_tree.c182 sector_t len1 = 0, len2 = 0; in __ext_tree_remove() local
198 len2 = ext_f_end(be) - end; in __ext_tree_remove()
200 if (len2 > 0) { in __ext_tree_remove()
213 orig_v_offset + orig_len - len2; in __ext_tree_remove()
215 new->be_length = len2; in __ext_tree_remove()
225 orig_v_offset + orig_len - len2; in __ext_tree_remove()
227 be->be_length = len2; in __ext_tree_remove()
/fs/ext4/
A Dextents_status.c1421 ext4_lblk_t len1, len2; in __es_remove_extent() local
1446 len2 = ext4_es_end(es) > end ? ext4_es_end(es) - end : 0; in __es_remove_extent()
1449 if (len2 > 0) { in __es_remove_extent()
1454 newes.es_len = len2; in __es_remove_extent()
1459 orig_es.es_len - len2; in __es_remove_extent()
1473 es->es_len = len2; in __es_remove_extent()
1476 block = orig_es.es_pblk + orig_es.es_len - len2; in __es_remove_extent()
1482 orig_es.es_len - len1 - len2, &orig_es, &rc); in __es_remove_extent()
/fs/smb/client/
A Ddfs_cache.c508 static bool dfs_path_equal(const char *s1, int len1, const char *s2, int len2) in dfs_path_equal() argument
513 if (len1 != len2) in dfs_path_equal()
518 l2 = cache_cp->char2uni(&s2[i], len2 - i, &c2); in dfs_path_equal()
/fs/xfs/libxfs/
A Dxfs_bmap.c4620 xfs_filblks_t len2 = *indlen2; in xfs_bmap_split_indlen() local
4636 len2 *= resfactor; in xfs_bmap_split_indlen()
4637 do_div(len2, 100); in xfs_bmap_split_indlen()
4638 ASSERT(len1 + len2 <= ores); in xfs_bmap_split_indlen()
4639 ASSERT(len1 < *indlen1 && len2 < *indlen2); in xfs_bmap_split_indlen()
4647 ores -= (len1 + len2); in xfs_bmap_split_indlen()
4649 if (ores && !len2 && *indlen2) { in xfs_bmap_split_indlen()
4650 len2++; in xfs_bmap_split_indlen()
4660 if (len2 < *indlen2) { in xfs_bmap_split_indlen()
4661 len2++; in xfs_bmap_split_indlen()
[all …]
/fs/ubifs/
A Djournal.c1982 int err, len1, len2, aligned_len, aligned_len1, lnum, offs; in ubifs_jnl_change_xattr() local
1995 len2 = UBIFS_INO_NODE_SZ + ubifs_inode(inode)->data_len; in ubifs_jnl_change_xattr()
1997 aligned_len = aligned_len1 + ALIGN(len2, 8); in ubifs_jnl_change_xattr()
2038 err = ubifs_tnc_add(c, &key, lnum, offs + aligned_len1, len2, hash); in ubifs_jnl_change_xattr()
/fs/proc/
A Dproc_sysctl.c103 static int namecmp(const char *name1, int len1, const char *name2, int len2) in namecmp() argument
107 cmp = memcmp(name1, name2, min(len1, len2)); in namecmp()
109 cmp = len1 - len2; in namecmp()
/fs/btrfs/
A Dsend.c3964 int len1, len2; in wait_for_parent_move() local
4018 len2 = fs_path_len(path_after); in wait_for_parent_move()
4020 (parent_ino_before != parent_ino_after || len1 != len2 || in wait_for_parent_move()
7517 int len1, len2; in tree_compare_item() local
7521 len2 = btrfs_item_size(right_path->nodes[0], right_path->slots[0]); in tree_compare_item()
7522 if (len1 != len2) in tree_compare_item()

Completed in 59 milliseconds