| /fs/befs/ |
| D | btree.c | 116 static int befs_compare_strings(const void *key1, int keylen1,
715 befs_compare_strings(const void *key1, int keylen1, in befs_compare_strings() argument
719 int result = strncmp(key1, key2, len); in befs_compare_strings()
728 btree_compare_int32(cont void *key1, int keylen1, const void *key2, int keylen2)
730 return *(int32_t *) key1 - *(int32_t *) key2;
734 btree_compare_uint32(cont void *key1, int keylen1,
737 if (*(u_int32_t *) key1 == *(u_int32_t *) key2)
739 else if (*(u_int32_t *) key1 > *(u_int32_t *) key2)
745 btree_compare_int64(cont void *key1, int keylen1, const void *key2, int keylen2)
747 if (*(int64_t *) key1 == *(int64_t *) key2)
[all …]
|
| /fs/ubifs/ |
| D | key.h | 484 const union ubifs_key *key1, in keys_cmp() argument
487 if (key1->u32[0] < key2->u32[0]) in keys_cmp()
489 if (key1->u32[0] > key2->u32[0]) in keys_cmp()
491 if (key1->u32[1] < key2->u32[1]) in keys_cmp()
493 if (key1->u32[1] > key2->u32[1]) in keys_cmp()
509 const union ubifs_key *key1, in keys_eq() argument
512 if (key1->u32[0] != key2->u32[0]) in keys_eq()
514 if (key1->u32[1] != key2->u32[1]) in keys_eq()
|
| D | tnc_misc.c | 366 const union ubifs_key *key1, *key2; in read_znode() local
368 key1 = &znode->zbranch[i].key; in read_znode()
371 cmp = keys_cmp(c, key1, key2); in read_znode()
376 } else if (cmp == 0 && !is_hash_key(c, key1)) { in read_znode()
461 union ubifs_key key1, *key = &zbr->key; in ubifs_tnc_read_node() local
483 key_read(c, node + UBIFS_KEY_OFFSET, &key1); in ubifs_tnc_read_node()
484 if (!keys_eq(c, key, &key1)) { in ubifs_tnc_read_node()
488 dbg_tnck(&key1, "but found node's key "); in ubifs_tnc_read_node()
|
| D | tnc.c | 1698 union ubifs_key key1; in validate_data_node() local
1721 key_read(c, buf + UBIFS_KEY_OFFSET, &key1); in validate_data_node()
1722 if (!keys_eq(c, &zbr->key, &key1)) { in validate_data_node()
1726 dbg_tnck(&key1, "found node's key "); in validate_data_node()
1893 union ubifs_key *key, *key1; in correct_parent_keys() local
1899 key1 = &znode->parent->zbranch[0].key; in correct_parent_keys()
1901 while (keys_cmp(c, key, key1) < 0) { in correct_parent_keys()
1902 key_copy(c, key, key1); in correct_parent_keys()
1907 key1 = &znode->parent->zbranch[0].key; in correct_parent_keys()
1979 union ubifs_key *key = &zbr->key, *key1; in tnc_insert() local
[all …]
|
| D | journal.c | 1290 union ubifs_key xent_key, key1, key2; in ubifs_jnl_delete_xattr() local
1356 lowest_ino_key(c, &key1, inode->i_ino); in ubifs_jnl_delete_xattr()
1358 err = ubifs_tnc_remove_range(c, &key1, &key2); in ubifs_jnl_delete_xattr()
1366 ino_key_init(c, &key1, host->i_ino); in ubifs_jnl_delete_xattr()
1367 err = ubifs_tnc_add(c, &key1, lnum, xent_offs + len - hlen, hlen); in ubifs_jnl_delete_xattr()
|
| /fs/hfs/ |
| D | catalog.c | 160 int hfs_cat_keycmp(const btree_key *key1, const btree_key *key2) in hfs_cat_keycmp() argument
164 retval = be32_to_cpu(key1->cat.ParID) - be32_to_cpu(key2->cat.ParID); in hfs_cat_keycmp()
166 retval = hfs_strcmp(key1->cat.CName.name, key1->cat.CName.len, in hfs_cat_keycmp()
|
| D | extent.c | 50 int hfs_ext_keycmp(const btree_key *key1, const btree_key *key2) in hfs_ext_keycmp() argument
55 fnum1 = key1->ext.FNum; in hfs_ext_keycmp()
59 if (key1->ext.FkType != key2->ext.FkType) in hfs_ext_keycmp()
60 return key1->ext.FkType < key2->ext.FkType ? -1 : 1; in hfs_ext_keycmp()
62 block1 = key1->ext.FABN; in hfs_ext_keycmp()
|
| /fs/reiserfs/ |
| D | stree.c | 135 inline int comp_short_le_keys(const struct reiserfs_key *key1, in comp_short_le_keys() argument
141 k1_u32 = (__u32 *) key1; in comp_short_le_keys()
|
| /fs/btrfs/ |
| D | relocation.c | 1654 struct btrfs_disk_key key1; local
1656 btrfs_node_key(eb, &key1, slot);
1658 return memcmp(&key1, &key2, sizeof(key1));
|