Home
last modified time | relevance | path

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

/fs/hfsplus/
Dbtree.c63 tree->max_key_len = be16_to_cpu(head->max_key_len); in hfs_btree_open()
69 if (tree->max_key_len != HFSPLUS_EXT_KEYLEN - sizeof(u16)) { in hfs_btree_open()
71 tree->max_key_len); in hfs_btree_open()
82 if (tree->max_key_len != HFSPLUS_CAT_KEYLEN - sizeof(u16)) { in hfs_btree_open()
84 tree->max_key_len); in hfs_btree_open()
101 if (tree->max_key_len != HFSPLUS_ATTR_KEYLEN - sizeof(u16)) { in hfs_btree_open()
103 tree->max_key_len); in hfs_btree_open()
Dbrec.c41 retval = node->tree->max_key_len + 2; in hfs_brec_keylen()
53 if (retval > node->tree->max_key_len + 2) { in hfs_brec_keylen()
165 cpu_to_be16(tree->max_key_len); in hfs_brec_insert()
166 key_len = tree->max_key_len + 2; in hfs_brec_insert()
381 fd->keylength = newkeylen = tree->max_key_len + 2; in hfs_brec_update_parent()
505 key_size = tree->max_key_len + 2; in hfs_btree_inc_height()
510 key_size = tree->max_key_len + 2; in hfs_btree_inc_height()
511 hfs_bnode_write_u16(new_node, 14, tree->max_key_len); in hfs_btree_inc_height()
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.h172 __be16 max_key_len; member
Dbnode.c69 key_len = tree->max_key_len + 2; in hfs_bnode_read_key()
322 tmp = node->tree->max_key_len + 2; in hfs_bnode_dump()
Dhfsplus_fs.h88 unsigned int max_key_len; member
Dxattr.c527 if (key_len == 0 || key_len > fd.tree->max_key_len) { in hfsplus_listxattr()
/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()
55 if (retval > node->tree->max_key_len + 1) { in hfs_brec_keylen()
163 fd->search_key->key_len = tree->max_key_len; in hfs_brec_insert()
164 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()
500 key_size = tree->max_key_len + 1; in hfs_btree_inc_height()
504 key_size = tree->max_key_len + 1; in hfs_btree_inc_height()
505 hfs_bnode_write_u8(new_node, 14, tree->max_key_len); in hfs_btree_inc_height()
Dbtree.c91 tree->max_key_len = be16_to_cpu(head->max_key_len); in hfs_btree_open()
101 if (tree->max_key_len != HFS_MAX_EXT_KEYLEN) { in hfs_btree_open()
103 tree->max_key_len); in hfs_btree_open()
108 if (tree->max_key_len != HFS_MAX_CAT_KEYLEN) { in hfs_btree_open()
110 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()