Searched defs:key2 (Results 1 - 10 of 10) sorted by relevance

/fs/cifs/
H A Dsmbencrypt.c72 unsigned char key2[8]; local
77 str_to_key(key, key2);
88 crypto_blkcipher_setkey(tfm_des, key2, 8);
/fs/hfs/
H A Dcatalog.c153 * struct hfs_cat_key *key2: pointer to the second key to compare
157 * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
159 * key1 and key2 point to "valid" (struct hfs_cat_key)s.
163 int hfs_cat_keycmp(const btree_key *key1, const btree_key *key2) argument
167 retval = be32_to_cpu(key1->cat.ParID) - be32_to_cpu(key2->cat.ParID);
170 key2->cat.CName.name, key2->cat.CName.len);
H A Dextent.c41 * struct hfs_ext_key *key2: pointer to the second key to compare
45 * int: negative if key1<key2, positive if key1>key2, and 0 if key1==key2
47 * key1 and key2 point to "valid" (struct hfs_ext_key)s.
50 int hfs_ext_keycmp(const btree_key *key1, const btree_key *key2) argument
56 fnum2 = key2->ext.FNum;
59 if (key1->ext.FkType != key2->ext.FkType)
60 return key1->ext.FkType < key2->ext.FkType ? -1 : 1;
63 block2 = key2
[all...]
/fs/ubifs/
H A Dtnc_misc.c366 const union ubifs_key *key1, *key2; local
369 key2 = &znode->zbranch[i + 1].key;
371 cmp = keys_cmp(c, key1, key2);
H A Dkey.h478 * @key2: the second key to compare
481 * @key2, %0 if the keys are equivalent and %1 if @key1 is greater than @key2.
485 const union ubifs_key *key2)
487 if (key1->u32[0] < key2->u32[0])
489 if (key1->u32[0] > key2->u32[0])
491 if (key1->u32[1] < key2->u32[1])
493 if (key1->u32[1] > key2->u32[1])
503 * @key2: the second key to compare
505 * This function compares 2 keys and returns %1 if @key1 is equal to @key2 an
483 keys_cmp(const struct ubifs_info *c, const union ubifs_key *key1, const union ubifs_key *key2) argument
508 keys_eq(const struct ubifs_info *c, const union ubifs_key *key1, const union ubifs_key *key2) argument
[all...]
H A Djournal.c1286 union ubifs_key xent_key, key1, key2; local
1353 highest_ino_key(c, &key2, inode->i_ino);
1354 err = ubifs_tnc_remove_range(c, &key1, &key2);
H A Dtnc.c2671 union ubifs_key key1, key2; local
2707 highest_ino_key(c, &key2, xattr_inum);
2708 err = ubifs_tnc_remove_range(c, &key1, &key2);
2721 highest_ino_key(c, &key2, inum);
2723 return ubifs_tnc_remove_range(c, &key1, &key2);
/fs/befs/
H A Dbtree.c120 const void *key2, int keylen2);
713 * @key2: pointer to the second key to be compared
714 * @keylen2: length in bytes of key2
716 * Returns 0 if @key1 and @key2 are equal.
718 * Returns <0 if @key2 is greater..
722 const void *key2, int keylen2)
725 int result = strncmp(key1, key2, len);
734 btree_compare_int32(cont void *key1, int keylen1, const void *key2, int keylen2)
736 return *(int32_t *) key1 - *(int32_t *) key2;
741 const void *key2, in
721 befs_compare_strings(const void *key1, int keylen1, const void *key2, int keylen2) argument
[all...]
/fs/reiserfs/
H A Dstree.c39 * Returns: -1 if key1 < key2
40 * 0 if key1 == key2
41 * 1 if key1 > key2
64 * Returns: -1 if key1 < key2 0
65 * if key1 = key2 1 if key1 > key2
98 const struct reiserfs_key *key2)
104 k2_u32 = (__u32 *) key2;
97 comp_short_le_keys(const struct reiserfs_key *key1, const struct reiserfs_key *key2) argument
/fs/btrfs/
H A Drelocation.c1745 struct btrfs_disk_key key2; local
1747 btrfs_node_key(path->nodes[level], &key2, path->slots[level]);
1748 return memcmp(&key1, &key2, sizeof(key1));

Completed in 188 milliseconds