Home
last modified time | relevance | path

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

/fs/hfsplus/
Dbtree.c176 tree->max_key_len = be16_to_cpu(head->max_key_len); in hfs_btree_open()
182 if (tree->max_key_len != HFSPLUS_EXT_KEYLEN - sizeof(u16)) { in hfs_btree_open()
184 tree->max_key_len); in hfs_btree_open()
195 if (tree->max_key_len != HFSPLUS_CAT_KEYLEN - sizeof(u16)) { in hfs_btree_open()
197 tree->max_key_len); in hfs_btree_open()
214 if (tree->max_key_len != HFSPLUS_ATTR_KEYLEN - sizeof(u16)) { in hfs_btree_open()
216 tree->max_key_len); in hfs_btree_open()
Dbrec.c42 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
54 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
170 cpu_to_be16(tree->max_key_len); in hfs_brec_insert()
171 key_len = tree->max_key_len + 2; in hfs_brec_insert()
385 fd->keylength = newkeylen = tree->max_key_len + 2; in hfs_brec_update_parent()
514 key_size = tree->max_key_len + 2; in hfs_btree_inc_height()
519 key_size = tree->max_key_len + 2; in hfs_btree_inc_height()
520 hfs_bnode_write_u16(new_node, 14, tree->max_key_len); in hfs_btree_inc_height()
Dbfind.c21 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
25 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
Dhfsplus_raw.h174 __be16 max_key_len; member
Dbnode.c70 key_len = tree->max_key_len + 2; in hfs_bnode_read_key()
321 tmp = node->tree->max_key_len + 2; in hfs_bnode_dump()
Dxattr.c87 head->max_key_len = cpu_to_be16(HFSPLUS_ATTR_KEYLEN - sizeof(u16)); in hfsplus_init_header_node()
723 if (key_len == 0 || key_len > fd.tree->max_key_len) { in hfsplus_listxattr()
Dhfsplus_fs.h89 unsigned int max_key_len; member
/fs/hfs/
Dbrec.c41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
43 retval = node->tree->max_key_len + 1; in hfs_brec_keylen()
50 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()
168 fd->search_key->key_len = tree->max_key_len; in hfs_brec_insert()
169 key_len = tree->max_key_len + 1; in hfs_brec_insert()
380 fd->keylength = newkeylen = tree->max_key_len + 1; in hfs_brec_update_parent()
509 key_size = tree->max_key_len + 1; in hfs_btree_inc_height()
513 key_size = tree->max_key_len + 1; in hfs_btree_inc_height()
514 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.h40 unsigned int max_key_len; member
154 __be16 max_key_len; /* (F) The length of a key in an index node */ member
Dbfind.c21 ptr = kmalloc(tree->max_key_len * 2 + 4, GFP_KERNEL); in hfs_find_init()
25 fd->key = ptr + tree->max_key_len + 2; in hfs_find_init()
Dbnode.c71 key_len = tree->max_key_len + 1; in hfs_bnode_read_key()
171 tmp = node->tree->max_key_len + 1; in hfs_bnode_dump()