Home
last modified time | relevance | path

Searched refs:max_key_len (Results 1 – 11 of 11) sorted by relevance

/fs/hfs/
Dbrec.c40 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
42 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
49 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
56 if (retval > node->tree->max_key_len + 1) { in hfs_brec_keylen()
164 fd->search_key->key_len = tree->max_key_len; in hfs_brec_insert()
165 key_len = tree->max_key_len + 1; in hfs_brec_insert()
376 fd->keylength = newkeylen = tree->max_key_len + 1; in hfs_brec_update_parent()
499 key_size = tree->max_key_len + 1; in hfs_btree_inc_height()
503 key_size = tree->max_key_len + 1; in hfs_btree_inc_height()
504 hfs_bnode_write_u8(new_node, 14, tree->max_key_len); in hfs_btree_inc_height()
Dbtree.c92 tree->max_key_len = be16_to_cpu(head->max_key_len); in hfs_btree_open()
102 if (tree->max_key_len != HFS_MAX_EXT_KEYLEN) { in hfs_btree_open()
104 tree->max_key_len); in hfs_btree_open()
109 if (tree->max_key_len != HFS_MAX_CAT_KEYLEN) { in hfs_btree_open()
111 tree->max_key_len); in hfs_btree_open()
Dbtree.h32 unsigned int max_key_len; member
145 __be16 max_key_len; /* (F) The length of a key in an index node */ member
Dbfind.c20 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
24 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
Dbnode.c55 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
157 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()
/fs/hfsplus/
Dbrec.c40 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
52 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
163 cpu_to_be16(tree->max_key_len); in hfs_brec_insert()
164 key_len = tree->max_key_len + 2; in hfs_brec_insert()
378 fd->keylength = newkeylen = tree->max_key_len + 2; in hfs_brec_update_parent()
501 key_size = tree->max_key_len + 2; in hfs_btree_inc_height()
505 key_size = tree->max_key_len + 2; in hfs_btree_inc_height()
506 hfs_bnode_write_u16(new_node, 14, tree->max_key_len); in hfs_btree_inc_height()
Dbtree.c64 tree->max_key_len = be16_to_cpu(head->max_key_len); in hfs_btree_open()
70 if (tree->max_key_len != HFSPLUS_EXT_KEYLEN - sizeof(u16)) { in hfs_btree_open()
72 tree->max_key_len); in hfs_btree_open()
83 if (tree->max_key_len != HFSPLUS_CAT_KEYLEN - sizeof(u16)) { in hfs_btree_open()
85 tree->max_key_len); in hfs_btree_open()
Dbfind.c20 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
24 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
Dhfsplus_raw.h162 __be16 max_key_len; member
Dbnode.c68 key_len = tree->max_key_len + 2; in hfs_bnode_read_key()
320 tmp = node->tree->max_key_len + 2; in hfs_bnode_dump()
Dhfsplus_fs.h66 unsigned int max_key_len; member