Home
last modified time | relevance | path

Searched refs:keylen (Results 1 – 7 of 7) sorted by relevance

/fs/hfs/
A Dbfind.c61 u16 off, len, keylen; in __hfs_brec_find() local
73 if (keylen == 0) { in __hfs_brec_find()
92 if (keylen == 0) { in __hfs_brec_find()
101 fd->keylength = keylen; in __hfs_brec_find()
102 fd->entryoffset = off + keylen; in __hfs_brec_find()
103 fd->entrylength = len - keylen; in __hfs_brec_find()
182 u16 off, len, keylen; in hfs_brec_goto() local
228 if (keylen == 0) { in hfs_brec_goto()
233 fd->keylength = keylen; in hfs_brec_goto()
234 fd->entryoffset = off + keylen; in hfs_brec_goto()
[all …]
/fs/cachefiles/
A Dkey.c41 unsigned int acc, i, n, nle, nbe, keylen = object->cookie->key_len; in cachefiles_cook_key() local
45 _enter(",%u,%*phN", keylen, keylen, key); in cachefiles_cook_key()
47 BUG_ON(keylen > NAME_MAX - 3); in cachefiles_cook_key()
50 for (i = 0; i < keylen; i++) { in cachefiles_cook_key()
57 len = 1 + keylen; in cachefiles_cook_key()
63 memcpy(name + 1, key, keylen); in cachefiles_cook_key()
71 n = round_up(keylen, 4); in cachefiles_cook_key()
81 b64len = DIV_ROUND_UP(keylen, 3); in cachefiles_cook_key()
82 pad = b64len * 3 - keylen; in cachefiles_cook_key()
84 _debug("len=%u nbe=%u nle=%u b64=%u", keylen, nbe, nle, b64len); in cachefiles_cook_key()
[all …]
/fs/hfsplus/
A Dbfind.c106 u16 off, len, keylen; in __hfs_brec_find() local
119 if (keylen == 0) { in __hfs_brec_find()
133 if (keylen == 0) { in __hfs_brec_find()
143 fd->keylength = keylen; in __hfs_brec_find()
144 fd->entryoffset = off + keylen; in __hfs_brec_find()
145 fd->entrylength = len - keylen; in __hfs_brec_find()
225 u16 off, len, keylen; in hfs_brec_goto() local
271 if (keylen == 0) { in hfs_brec_goto()
276 fd->keylength = keylen; in hfs_brec_goto()
277 fd->entryoffset = off + keylen; in hfs_brec_goto()
[all …]
/fs/befs/
A Dbtree.c117 int index, u16 * keylen);
335 u16 keylen; in befs_find_key() local
346 thiskey = befs_bt_get_key(sb, node, last, &keylen); in befs_find_key()
421 u16 keylen; in befs_btree_read() local
494 (int)keylen); in befs_btree_read()
496 if (bufsize < keylen + 1) { in befs_btree_read()
503 strscpy(keybuf, keystart, keylen + 1); in befs_btree_read()
505 *keysize = keylen; in befs_btree_read()
508 cur_key, keylen, keybuf, *value); in befs_btree_read()
676 int index, u16 * keylen) in befs_bt_get_key() argument
[all …]
/fs/netfs/
A Dfscache_cookie.c1114 unsigned int keylen = 0, auxlen = 0; in fscache_cookies_seq_show() local
1137 keylen = cookie->key_len; in fscache_cookies_seq_show()
1140 if (keylen > 0 || auxlen > 0) { in fscache_cookies_seq_show()
1142 p = keylen <= sizeof(cookie->inline_key) ? in fscache_cookies_seq_show()
1144 for (; keylen > 0; keylen--) in fscache_cookies_seq_show()
/fs/orangefs/
A Ddowncall.h71 __s32 keylen; member
/fs/unicode/
A Dmkutf8data.c533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert() argument
540 assert(keylen >= 1 && keylen <= 4); in insert()
544 keybits = 8 * keylen; in insert()
1687 int keylen; in trees_populate() local
1698 keylen = utf8encode(keyval, unichar); in trees_populate()
1702 insert(&trees[i], keyval, keylen, data); in trees_populate()

Completed in 18 milliseconds