linux/fs/hfsplus/brec.c
<<
v2.6.4v2.3" 0.6.16v2.3" 0.6.16vgg" alt=">>">nux+v3.1 >nx+v3 class="lxr_search > v2.nput typlectext" namlecsearch idecsearch > v2butt typlecsubmit">Searchnx+v3 class="lxr_p s"splus/br <+p s?return=

/*nux+v3.1
* src=
u.tu16/fa s/br <+code=dataoff" class="s ">dataoff/fa ;1
dataoff/fa = nbr <+code=node" class="s ">node/fa ->nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (/br <+code=u.2 class="s ">u.2/fa + 2) * 2;1
pti_bnode_read/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=u.tu.tdataoff/fa , 4);1
off/fa = nbr <+code=be16_to_cpu" class="s ">be16_to_cpu/fa (nbr <+code=u.tu.tbe16_to_cpu/fa (nbr <+code=u.tu.toff/fa ;1
/* Get the length of the key from a keyed u.2ord */nux+v3.1
u16/fa s/br <+code=pti_bu.2_keylen" class="s ">pti_bu.2_keylen/fa (structs/br <+code=pti_bnode" class="s ">pti_bnode/fa *nbr <+code=node" class="s ">node/fa ,s/br <+code=u16 class="s ">u16/fa s/br <+code=u.2 class="s ">u.2/fa )1
u16/fa s/br <+code=u.tu.tu.2off/fa ;1
node/fa ->nbr <+code=type" class="s ">type/fa != nbr <+code=HFS_NODE_INDEX" class="s ">HFS_NODE_INDEX/fa && nbr <+code=node" class="s ">node/fa ->nbr <+code=type" class="s ">type/fa != nbr <+code=HFS_NODE_LEAF" class="s ">HFS_NODE_LEAF/fa )1
node/fa ->nbr <+code=type" class="s ">type/fa == nbr <+code=HFS_NODE_INDEX" class="s ">HFS_NODE_INDEX/fa ) &&1
node/fa ->nbr <+code=tree" class="s ">tree/fa ->nbr <+code=attributes" class="s ">attributes/fa & nbr <+code=HFS_TREE_VARIDXKEYS" class="s ">HFS_TREE_VARIDXKEYS/fa ) &&1
node/fa ->nbr <+code=tree" class="s ">tree/fa ->nbr <+code=cnid" class="s ">cnid/fa != nbr <+code=HFSPLUS_ATTR_CNID" class="s ">HFSPLUS_ATTR_CNID/fa )) {1
u.tnode/fa ->nbr <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa + 2;1
u.2off/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,1
node/fa ->nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (/br <+code=u.2 class="s ">u.2/fa + 1) * 2);1
u.2off/fa )1
u.2off/fa > /br <+code=node" class="s ">node/fa ->nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - 2) {1
pr_err/fa (nx+v3 class="string" "u.2off %d too large\n"nux+v3.,s/br <+code=u.2off" class="s ">u.2off/fa );1
u.tpti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=u.2off" class="s ">u.2off/fa ) + 2;1
u.tnode/fa ->nbr <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa + 2) {1
pr_err/fa (nx+v3 class="string" "keylen %d too large\n"nux+v3.,1
u.tu.tu.tpti_bu.2_insert/fa (structs/br <+code=pti_find_data" class="s ">pti_find_data/fa *nbr <+code=fd" class="s ">fd/fa , void *nbr <+code=entry" class="s ">entry/fa , ints/br <+code=entry_len" class="s ">entry_len/fa )1
pti_btree/fa *nbr <+code=tree" class="s ">tree/fa ;1
pti_bnode/fa *nbr <+code=node" class="s ">node/fa ,s*nbr <+code=new_node" class="s ">new_node/fa ;1
iize/fa ,s/br <+code=key_len" class="s ">key_len/fa ,s/br <+code=u.2 class="s ">u.2/fa ;1
data_off/fa , /br <+code=end_off" class="s ">end_off/fa ;1
idx_u.2_off/fa ,s/br <+code=data_u.2_off" class="s ">data_u.2_off/fa , /br <+code=end_u.2_off" class="s ">end_u.2_off/fa ;1
__be32 >a. /br <+code=cnid" class="s ">cnid/fa ;1
tree/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=tree" class="s ">tree/fa ;1
fd/fa ->nbr <+code=bnode" class="s ">bnode/fa ) {1
tree/fa ->nbr <+code=root" class="s ">root/fa )1
pti_btree_inc_he.6.1/fa (/br <+code=tree" class="s ">tree/fa );1
fd/fa ->nbr <+code=bnode" class="s ">bnode/fa = nbr <+code=pti_bnode_find class="s ">pti_bnode_find/fa (/br <+code=tree" class="s ">tree/fa , /br <+code=tree" class="s ">tree/fa ->nbr <+code=leaf_head" class="s ">leaf_head/fa );1
IS_ERR/fa (/br <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa ))1
PTR_ERR/fa (/br <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa );1
fd/fa ->nbr <+code=u.2ord" class="s ">u.2ord/fa = -1;1
new_node/fa = nbr <+code=NULL" class="s ">NULL/fa ;1
key_len/fa = nbr <+code=be16_to_cpu" class="s ">be16_to_cpu/fa (nbr <+code=fd" class="s ">fd/fa ->nbr <+code=search_key" class="s ">iearch_key/fa ->nbr <+code=key_len" class="s ">key_len/fa ) + 2;1
again/fa :1
/* new u.2ord idx and complete u.2ord iize */nux+v3.1
u.2/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=u.2ord" class="s ">u.2ord/fa + 1;1
iize/fa = nbr <+code=key_len" class="s ">key_len/fa +s/br <+code=entry_len" class="s ">entry_len/fa ;1
node/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa ;1
pti_bnode_dump/fa (nbr <+code=node" class="s ">node/fa );1
/* get last offset */nux+v3.1
end_u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (/br <+code=node" class="s ">node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa + 1) * 2;1
end_off/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=end_u.2_off" class="s ">end_u.2_off/fa );1
end_u.2_off/fa -= 2;1
pti_dbg/fa (nbr <+code=BNODE_MOD" class="s ">BNODE_MOD/fa ,s/x+v3 class="string" "insert_u.2: %d, %d, %d, %d\n"nux+v3.,1
u.2/fa ,s/br <+code=iize" class="s ">iize/fa ,s/br <+code=end_off" class="s ">end_off/fa ,s/br <+code=end_u.2_off" class="s ">end_u.2_off/fa );1
iize/fa > /br <+code=end_u.2_off" class="s ">end_u.2_off/fa -s/br <+code=end_off" class="s ">end_off/fa ) {1
new_node/fa )1
+v3i2/fa (nx+v3 class="string" "not enough room!\n"nux+v3.);1
new_node/fa = nbr <+code=pti_bnode_ionit" class="s ">pti_bnode_ionit/fa (nbr <+code=fd" class="s ">fd/fa );1
IS_ERR/fa (/br <+code=new_node" class="s ">new_node/fa ))1
PTR_ERR/fa (/br <+code=new_node" class="s ">new_node/fa );1
again/fa ;1
node/fa ->nbr <+code=type" class="s ">type/fa == nbr <+code=HFS_NODE_LEAF" class="s ">HFS_NODE_LEAF/fa ) {1
tree/fa ->nbr <+code=leaf_count" class="s ">leaf_count/fa ++;1
mark_inode_dirty/fa (/br <+code=tree" class="s ">tree/fa ->nbr <+code=inode" class="s ">inode/fa );1
node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa ++;1
/* write new last offset */nux+v3.1
pti_bnode_write_u16/fa (nbr <+code=node" class="s ">node/fa ,1
offsetof/fa (structs/br <+code=pti_bnode_des2 class="s ">pti_bnode_des2/fa ,s/br <+code=num_u.2s" class="s ">num_u.2s/fa ),1
node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa );1
pti_bnode_write_u16/fa (nbr <+code=node" class="s ">node/fa , /br <+code=end_u.2_off" class="s ">end_u.2_off/fa ,s/br <+code=end_off" class="s ">end_off/fa +s/br <+code=iize" class="s ">iize/fa );1
data_off/fa = nbr <+code=end_off" class="s ">end_off/fa ;1
data_u.2_off/fa = nbr <+code=end_u.2_off" class="s ">end_u.2_off/fa + 2;1
idx_u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (/br <+code=u.2 class="s ">u.2/fa + 1) * 2;1
idx_u.2_off/fa == nbr <+code=data_u.2_off" class="s ">data_u.2_off/fa )1
skip/fa ;1
/* move all following entries */nux+v3.1
data_off/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=data_u.2_off" class="s ">data_u.2_off/fa + 2);1
pti_bnode_write_u16/fa (nbr <+code=node" class="s ">node/fa , /br <+code=data_u.2_off" class="s ">data_u.2_off/fa , /br <+code=data_off" class="s ">data_off/fa +s/br <+code=iize" class="s ">iize/fa );1
data_u.2_off/fa += 2;1
data_u.2_off/fa < nbr <+code=idx_u.2_off" class="s ">idx_u.2_off/fa );1
/* move data away */nux+v3.1
pti_bnode_move/fa (nbr <+code=node" class="s ">node/fa , /br <+code=data_off" class="s ">data_off/fa +s/br <+code=iize" class="s ">iize/fa , /br <+code=data_off" class="s ">data_off/fa ,1
end_off/fa -s/br <+code=data_off" class="s ">data_off/fa );1
skip/fa :1
pti_bnode_write/fa (nbr <+code=node" class="s ">node/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=search_key" class="s ">iearch_key/fa , /br <+code=data_off" class="s ">data_off/fa , nbr <+code=key_len" class="s ">key_len/fa );1
pti_bnode_write/fa (nbr <+code=node" class="s ">node/fa , /br <+code=entry" class="s ">entry/fa , /br <+code=data_off" class="s ">data_off/fa +s/br <+code=key_len" class="s ">key_len/fa ,s/br <+code=entry_len" class="s ">entry_len/fa );1
pti_bnode_dump/fa (nbr <+code=node" class="s ">node/fa );1
new_node/fa ) {1
/* update parent key if we inserted a keynux+v3.1
* at the start of the first node/fx+v3.1
*/nux+v3.1
u.2/fa && nbr <+code=new_node" class="s ">new_node/fa != nbr <+code=node" class="s ">node/fa )1
pti_bu.2_update_parent/fa (nbr <+code=fd" class="s ">fd/fa );1
pti_bnode_put/fa (nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa );1
new_node/fa ->nbr <+code=parent" class="s ">parent/fa ) {1
pti_btree_inc_he.6.1/fa (/br <+code=tree" class="s ">tree/fa );1
new_node/fa ->nbr <+code=parent" class="s ">parent/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=root" class="s ">root/fa ;1
fd/fa ->nbr <+code=bnode" class="s ">bnode/fa = nbr <+code=pti_bnode_find class="s ">pti_bnode_find/fa (/br <+code=tree" class="s ">tree/fa , /br <+code=new_node" class="s ">new_node/fa ->nbr <+code=parent" class="s ">parent/fa );1
/* create index data entry */nux+v3.1
cnid/fa = nbr <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa );1
entry/fa = &nbr <+code=cnid" class="s ">cnid/fa ;1
entry_len/fa = iizeof(nbr <+code=cnid" class="s ">cnid/fa );1
/* get index key */nux+v3.1
pti_bnode_read_key/fa (nbr <+code=new_node" class="s ">new_node/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=search_key" class="s ">iearch_key/fa , 14);1
__pti_bu.2_find/fa (nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa , /br <+code=fd" class="s ">fd/fa , /br <+code=hti_find_u.2_by_key" class="s ">pti_find_u.2_by_key/fa );1
pti_bnode_put/fa (nbr <+code=new_node" class="s ">new_node/fa );1
new_node/fa = nbr <+code=NULL" class="s ">NULL/fa ;1
tree/fa ->nbr <+code=attributes" class="s ">attributes/fa & nbr <+code=HFS_TREE_VARIDXKEYS" class="s ">HFS_TREE_VARIDXKEYS/fa ) ||1
tree/fa ->nbr <+code=cnid" class="s ">cnid/fa == nbr <+code=HFSPLUS_ATTR_CNID" class="s ">HFSPLUS_ATTR_CNID/fa ))1
key_len/fa = nbr <+code=be16_to_cpu" class="s ">be16_to_cpu/fa (nbr <+code=fd" class="s ">fd/fa ->nbr <+code=search_key" class="s ">iearch_key/fa ->nbr <+code=key_len" class="s ">key_len/fa ) + 2;1
fd/fa ->nbr <+code=search_key" class="s ">iearch_key/fa ->nbr <+code=key_len" class="s ">key_len/fa =1
cpu_to_be16/fa (/br <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa );1
key_len/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa + 2;1
again/fa ;1
u.2/fa )1
pti_bu.2_update_parent/fa (nbr <+code=fd" class="s ">fd/fa );1
pti_bu.2_remove/fa (structs/br <+code=pti_find_data" class="s ">pti_find_data/fa *nbr <+code=fd" class="s ">fd/fa )1
pti_btree/fa *nbr <+code=tree" class="s ">tree/fa ;1
pti_bnode/fa *nbr <+code=node" class="s ">node/fa ,s*nbr <+code=parent" class="s ">parent/fa ;1
end_off/fa ,s/br <+code=u.2_off" class="s ">u.2_off/fa , /br <+code=data_off" class="s ">data_off/fa ,s/br <+code=iize" class="s ">iize/fa ;1
tree/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=tree" class="s ">tree/fa ;1
node/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa ;1
again/fa :1
u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (/br <+code=fd" class="s ">fd/fa ->nbr <+code=u.2ord" class="s ">u.2ord/fa + 2) * 2;1
end_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (/br <+code=node" class="s ">node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa + 1) * 2;1
node/fa ->nbr <+code=type" class="s ">type/fa == nbr <+code=HFS_NODE_LEAF" class="s ">HFS_NODE_LEAF/fa ) {1
tree/fa ->nbr <+code=leaf_count" class="s ">leaf_count/fa --;1
mark_inode_dirty/fa (/br <+code=tree" class="s ">tree/fa ->nbr <+code=inode" class="s ">inode/fa );1
pti_bnode_dump/fa (nbr <+code=node" class="s ">node/fa );1
pti_dbg/fa (nbr <+code=BNODE_MOD" class="s ">BNODE_MOD/fa ,s/x+v3 class="string" "remove_u.2: %d, %d\n"nux+v3.,1
fd/fa ->nbr <+code=u.2ord" class="s ">u.2ord/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=keylength" class="s ">keylength/fa + /br <+code=fd" class="s ">fd/fa ->nbr <+code=entrylength" class="s ">entrylength/fa );1
node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa ) {1pti_bnode_unlink/fa (nbr <+code=node" class="s ">node/fa );1
node/fa ->nbr <+code=parent" class="s ">parent/fa )1
parent/fa = nbr <+code=pti_bnode_find class="s ">pti_bnode_find/fa (/br <+code=tree" class="s ">tree/fa , /br <+code=node" class="s ">node/fa ->nbr <+code=parent" class="s ">parent/fa );1
IS_ERR/fa (/br <+code=parent" class="s ">parent/fa ))1
PTR_ERR/fa (/br <+code=parent" class="s ">parent/fa );1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
node/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa = nbr <+code=parent" class="s ">parent/fa ;1
__pti_bu.2_find/fa (nbr <+code=node" class="s ">node/fa , /br <+code=fd" class="s ">fd/fa , /br <+code=hti_find_u.2_by_key" class="s ">pti_find_u.2_by_key/fa );1
again/fa ;1
pti_bnode_write_u16/fa (nbr <+code=node" class="s ">node/fa ,1
offsetof/fa (structs/br <+code=pti_bnode_des2 class="s ">pti_bnode_des2/fa ,s/br <+code=num_u.2s" class="s ">num_u.2s/fa ),1
node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa );1
u.2_off/fa == nbr <+code=end_off" class="s ">end_off/fa )1
skip/fa ;1
iize/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=keylength" class="s ">keylength/fa + /br <+code=fd" class="s ">fd/fa ->nbr <+code=entrylength" class="s ">entrylength/fa ;1
data_off/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=u.2_off" class="s ">u.2_off/fa );1
pti_bnode_write_u16/fa (nbr <+code=node" class="s ">node/fa , /br <+code=u.2_off" class="s ">u.2_off/fa + 2, /br <+code=data_off" class="s ">data_off/fa -s/br <+code=iize" class="s ">iize/fa );1
u.2_off/fa -= 2;1
u.2_off/fa >= nbr <+code=end_off" class="s ">end_off/fa );1
/* fill hole */nux+v3.1
pti_bnode_move/fa (nbr <+code=node" class="s ">node/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=keyoffset" class="s ">keyoffset/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=keyoffset" class="s ">keyoffset/fa +s/br <+code=iize" class="s ">iize/fa ,1
data_off/fa -s/br <+code=fd" class="s ">fd/fa ->nbr <+code=keyoffset" class="s ">keyoffset/fa -s/br <+code=iize" class="s ">iize/fa );1
skip/fa :1
pti_bnode_dump/fa (nbr <+code=node" class="s ">node/fa );1
fd/fa ->nbr <+code=u.2ord" class="s ">u.2ord/fa )1
pti_bu.2_update_parent/fa (nbr <+code=fd" class="s ">fd/fa );1
pti_bnode/fa *nbr <+code=pti_bnode_sonit" class="s ">pti_bnode_ionit/fa (structs/br <+code=pti_find_data" class="s ">pti_find_data/fa *nbr <+code=fd" class="s ">fd/fa )1
pti_btree/fa *nbr <+code=tree" class="s ">tree/fa ;1
pti_bnode/fa *nbr <+code=node" class="s ">node/fa ,s*nbr <+code=new_node" class="s ">new_node/fa , *nbr <+code=next_node" class="s ">next_node/fa ;1
pti_bnode_des2/fa /br <+code=node_des2 class="s ">node_des2/fa ;1
num_u.2s/fa , /br <+code=new_u.2_off" class="s ">new_u.2_off/fa , /br <+code=new_off" class="s ">new_off/fa , /br <+code=old_u.2_off" class="s ">old_u.2_off/fa ;1
data_start/fa , /br <+code=data_end class="s ">data_end/fa , /br <+code=iize" class="s ">iize/fa ;1
tree/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=tree" class="s ">tree/fa ;1
node/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa ;1
new_node/fa = nbr <+code=pti_bmap_allo2 class="s ">pti_bmap_allo2/fa (nbr <+code=tree" class="s ">tree/fa );1
IS_ERR/fa (/br <+code=new_node" class="s ">new_node/fa ))1
new_node/fa ;1
pti_bnode_get/fa (nbr <+code=node" class="s ">node/fa );1
pti_dbg/fa (nbr <+code=BNODE_MOD" class="s ">BNODE_MOD/fa ,s/x+v3 class="string" "ionit_nodes: %d - %d - %d\n"nux+v3.,1
node/fa ->nbr <+code=this" class="s ">this/fa , /br <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa , /br <+code=node" class="s ">node/fa ->nbr <+code=next" class="s ">next/fa );1
new_node/fa ->nbr <+code=next" class="s ">next/fa = nbr <+code=node" class="s ">node/fa ->nbr <+code=next" class="s ">next/fa ;1
new_node/fa ->nbr <+code=prev" class="s ">prev/fa = nbr <+code=node" class="s ">node/fa ->nbr <+code=this" class="s ">this/fa ;1
new_node/fa ->nbr <+code=parent" class="s ">parent/fa = nbr <+code=node" class="s ">node/fa ->nbr <+code=parent" class="s ">parent/fa ;1
new_node/fa ->nbr <+code=type" class="s ">type/fa = nbr <+code=node" class="s ">node/fa ->nbr <+code=type" class="s ">type/fa ;1
new_node/fa ->nbr <+code=he.6.1" class="s ">pe.6.1/fa = nbr <+code=node" class="s ">node/fa ->nbr <+code=he.6.1" class="s ">pe.6.1/fa ;1
node/fa ->nbr <+code=next" class="s ">next/fa )1
next_node/fa = nbr <+code=pti_bnode_find class="s ">pti_bnode_find/fa (/br <+code=tree" class="s ">tree/fa , /br <+code=node" class="s ">node/fa ->nbr <+code=next" class="s ">next/fa );1
next_node/fa = nbr <+code=NULL" class="s ">NULL/fa ;1
IS_ERR/fa (/br <+code=next_node" class="s ">next_node/fa )) {1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
pti_bnode_put/fa (nbr <+code=new_node" class="s ">new_node/fa );1
next_node/fa ;1
iize/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa / 2 -s/br <+code=node" class="s ">node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa * 2 -s14;1
old_u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - 4;1
num_u.2s/fa = 1;1
data_start/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=old_u.2_off" class="s ">old_u.2_off/fa );1
data_start/fa >s/br <+code=iize" class="s ">iize/fa )1
old_u.2_off/fa -= 2;1
num_u.2s/fa < nbr <+code=node" class="s ">node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa )1
/* +v3ic? */nux+v3.1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
pti_bnode_put/fa (nbr <+code=new_node" class="s ">new_node/fa );1
next_node/fa )1
pti_bnode_put/fa (nbr <+code=next_node" class="s ">next_node/fa );1
ERR_PTR/fa (-/br <+code=ENOSPC" class="s ">ENOSPC/fa );1
fd/fa ->nbr <+code=u.2ord" class="s ">u.2ord/fa + 1 < nbr <+code=num_u.2s" class="s ">num_u.2s/fa ) {1
/* new u.2ord is in the lower half,nux+v3.1
* so leave some more space therenux+v3.1
*/nux+v3.1
old_u.2_off/fa += 2;1
num_u.2s/fa --;1
data_start/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=old_u.2_off" class="s ">old_u.2_off/fa );1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
pti_bnode_get/fa (nbr <+code=new_node" class="s ">new_node/fa );1
fd/fa ->nbr <+code=bnode" class="s ">bnode/fa = nbr <+code=new_node" class="s ">new_node/fa ;1
fd/fa ->nbr <+code=u.2ord" class="s ">u.2ord/fa -= nbr <+code=num_u.2s" class="s ">num_u.2s/fa ;1
fd/fa ->nbr <+code=keyoffset" class="s ">keyoffset/fa -= nbr <+code=data_start" class="s ">data_start/fa -s14;1
fd/fa ->nbr <+code=entryoffset" class="s ">entryoffset/fa -= nbr <+code=data_start" class="s ">data_start/fa -s14;1
new_node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa = /br <+code=node" class="s ">node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa -s/br <+code=num_u.2s" class="s ">num_u.2s/fa ;1
node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa = nbr <+code=num_u.2s" class="s ">num_u.2s/fa ;1
new_u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - 2;1
new_off/fa = 14;1
iize/fa = nbr <+code=data_start" class="s ">data_start/fa -snbr <+code=new_off" class="s ">new_off/fa ;1
num_u.2s/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa ;1
data_end/fa = nbr <+code=data_start" class="s ">data_start/fa ;1
num_u.2s/fa ) {1
pti_bnode_write_u16/fa (nbr <+code=new_node" class="s ">new_node/fa , /br <+code=new_u.2_off" class="s ">new_u.2_off/fa , /br <+code=new_off" class="s ">new_off/fa );1
old_u.2_off/fa -= 2;1
new_u.2_off/fa -= 2;1
data_end/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s/br <+code=old_u.2_off" class="s ">old_u.2_off/fa );1
new_off/fa = /br <+code=data_end class="s ">data_end/fa -s/br <+code=iize" class="s ">iize/fa ;1
num_u.2s/fa --;1
pti_bnode_write_u16/fa (nbr <+code=new_node" class="s ">new_node/fa , /br <+code=new_u.2_off" class="s ">new_u.2_off/fa , /br <+code=new_off" class="s ">new_off/fa );1
pti_bnode_copy/fa (nbr <+code=new_node" class="s ">new_node/fa , 14, /br <+code=node" class="s ">node/fa , /br <+code=data_start" class="s ">data_start/fa , /br <+code=data_end class="s ">data_end/fa -s/br <+code=data_start" class="s ">data_start/fa );1
/* update new bnode header */nux+v3.1
node_des2/fa .nbr <+code=next" class="s ">next/fa = /br <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=next" class="s ">next/fa );1
node_des2/fa .nbr <+code=prev" class="s ">prev/fa = nbr <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=prev" class="s ">prev/fa );1
node_des2/fa .nbr <+code=type" class="s ">type/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=type" class="s ">type/fa ;1
node_des2/fa .nbr <+code=he.6.1" class="s ">pe.6.1/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=he.6.1" class="s ">pe.6.1/fa ;1
node_des2/fa .nbr <+code=num_u.2s" class="s ">num_u.2s/fa = nbr <+code=cpu_to_be16 class="s ">cpu_to_be16/fa (/br <+code=new_node" class="s ">new_node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa );1
node_des2/fa .nbr <+code=reserved" class="s ">u.served/fa = 0;1
pti_bnode_write/fa (nbr <+code=new_node" class="s ">new_node/fa , &nbr <+code=node_des2 class="s ">node_des2/fa , 0, iizeof(nbr <+code=node_des2 class="s ">node_des2/fa ));1
/* update previous bnode header */nux+v3.1
node/fa ->nbr <+code=next" class="s ">next/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa ;1
pti_bnode_read/fa (nbr <+code=node" class="s ">node/fa ,s&nbr <+code=node_des2 class="s ">node_des2/fa , 0, iizeof(nbr <+code=node_des2 class="s ">node_des2/fa ));1
node_des2/fa .nbr <+code=next" class="s ">next/fa = /br <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=node" class="s ">node/fa ->nbr <+code=next" class="s ">next/fa );1
node_des2/fa .nbr <+code=num_u.2s" class="s ">num_u.2s/fa = nbr <+code=cpu_to_be16 class="s ">cpu_to_be16/fa (/br <+code=node" class="s ">node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa );1
pti_bnode_write/fa (nbr <+code=node" class="s ">node/fa ,s&nbr <+code=node_des2 class="s ">node_des2/fa , 0, iizeof(nbr <+code=node_des2 class="s ">node_des2/fa ));1
/* update next bnode header */nux+v3.1
next_node/fa ) {1
next_node/fa ->nbr <+code=prev" class="s ">prev/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa ;1
pti_bnode_read/fa (nbr <+code=next_node" class="s ">next_node/fa ,s&nbr <+code=node_des2 class="s ">node_des2/fa , 0, iizeof(nbr <+code=node_des2 class="s ">node_des2/fa ));1
node_des2/fa .nbr <+code=prev" class="s ">prev/fa = nbr <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=next_node" class="s ">next_node/fa ->nbr <+code=prev" class="s ">prev/fa );1
pti_bnode_write/fa (nbr <+code=next_node" class="s ">next_node/fa ,s&nbr <+code=node_des2 class="s ">node_des2/fa , 0, iizeof(nbr <+code=node_des2 class="s ">node_des2/fa ));1
pti_bnode_put/fa (nbr <+code=next_node" class="s ">next_node/fa );1
node/fa ->nbr <+code=this" class="s ">this/fa == nbr <+code=tree" class="s ">tree/fa ->nbr <+code=leaf_tail" class="s ">leaf_tail/fa ) {1
/* if there is no next node, this m.6.1 be the new tail */nux+v3.1
tree/fa ->nbr <+code=leaf_tail" class="s ">leaf_tail/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa ;1
mark_inode_dirty/fa (/br <+code=tree" class="s ">tree/fa ->nbr <+code=inode" class="s ">inode/fa );1
pti_bnode_dump/fa (nbr <+code=node" class="s ">node/fa );1
pti_bnode_dump/fa (nbr <+code=new_node" class="s ">new_node/fa );1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
new_node/fa ;1
pti_bu.2_update_parent/fa (structs/br <+code=pti_find_data" class="s ">pti_find_data/fa *nbr <+code=fd" class="s ">fd/fa )1
pti_btree/fa *nbr <+code=tree" class="s ">tree/fa ;1
pti_bnode/fa *nbr <+code=node" class="s ">node/fa ,s*nbr <+code=new_node" class="s ">new_node/fa , *nbr <+code=parent" class="s ">parent/fa ;1
newkeylen/fa , /br <+code=diff" class="s ">diff/fa ;1
u.2/fa ,s/br <+code=u.2_off" class="s ">u.2_off/fa , /br <+code=end_u.2_off" class="s ">end_u.2_off/fa ;1
start_off/fa , /br <+code=end_off" class="s ">end_off/fa ;1
tree/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=tree" class="s ">tree/fa ;1
node/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa ;1
new_node/fa = nbr <+code=NULL" class="s ">NULL/fa ;1
node/fa ->nbr <+code=parent" class="s ">parent/fa )1
again/fa :1
parent/fa = nbr <+code=pti_bnode_find class="s ">pti_bnode_find/fa (/br <+code=tree" class="s ">tree/fa , /br <+code=node" class="s ">node/fa ->nbr <+code=parent" class="s ">parent/fa );1
IS_ERR/fa (/br <+code=parent" class="s ">parent/fa ))1
PTR_ERR/fa (/br <+code=parent" class="s ">parent/fa );1
__pti_bu.2_find/fa (/br <+code=parent" class="s ">parent/fa , /br <+code=fd" class="s ">fd/fa , /br <+code=pti_find_u.2_by_key" class="s ">pti_find_u.2_by_key/fa );1
pti_bnode_dump/fa (nbr <+code=parent" class="s ">parent/fa );1
u.2/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=r.2ord" class="s ">u.2ord/fa ;1
/* iize difference between old and new key */nux+v3.1
tree/fa ->nbr <+code=attributes" class="s ">attributes/fa & nbr <+code=HFS_TREE_VARIDXKEYS" class="s ">HFS_TREE_VARIDXKEYS/fa ) ||1
tree/fa ->nbr <+code=cnid" class="s ">cnid/fa == nbr <+code=HFSPLUS_ATTR_CNID" class="s ">HFSPLUS_ATTR_CNID/fa ))1
newkeylen/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s14) + 2;1
fd/fa ->nbr <+code=keylength" class="s ">keylength/fa = nbr <+code=newkeylen" class="s ">newkeylen/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa + 2;1
pti_dbg/fa (nbr <+code=BNODE_MOD" class="s ">BNODE_MOD/fa ,s/x+v3 class="string" "update_u.2: %d, %d, %d\n"nux+v3.,1
u.2/fa ,s/br <+code=fd" class="s ">fd/fa ->nbr <+code=keylength" class="s ">keylength/fa , /br <+code=newkeylen" class="s ">newkeylen/fa );1
u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (nbr <+code=u.2" class="s ">u.2/fa + 2) * 2;1
end_u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (nbr <+code=parent" class="s ">parent/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa + 1) * 2;1
diff/fa = nbr <+code=newkeylen" class="s ">newkeylen/fa -s/br <+code=fd" class="s ">fd/fa ->nbr <+code=keylength" class="s ">keylength/fa ;1
diff/fa )1
skip/fa ;1
diff/fa >s0) {1
end_off/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=parent" class="s ">parent/fa , /br <+code=end_u.2_off" class="s ">end_u.2_off/fa );1
end_u.2_off/fa -s/br <+code=end_off" class="s ">end_off/fa < nbr <+code=diff" class="s ">diff/fa ) {1
pti_dbg/fa (nbr <+code=BNODE_MOD" class="s ">BNODE_MOD/fa ,s/x+v3 class="string" "sonitting index node\n"nux+v3.);1
fd/fa ->nbr <+code=bnode" class="s ">bnode/fa = nbr <+code=parent" class="s ">parent/fa ;1
new_node/fa = nbr <+code=pti_bnode_ionit class="s ">pti_bnode_ionit/fa (nbr <+code=fd" class="s ">fd/fa );1
IS_ERR/fa (/br <+code=new_node" class="s ">new_node/fa ))1
PTR_ERR/fa (/br <+code=new_node" class="s ">new_node/fa );1
parent/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa ;1
u.2/fa = nbr <+code=fd" class="s ">fd/fa ->nbr <+code=r.2ord" class="s ">u.2ord/fa ;1
u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - (nbr <+code=u.2" class="s ">u.2/fa + 2) * 2;1
end_u.2_off/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa -1
parent/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa + 1) * 2;1
end_off/fa = nbr <+code=start_off" class="s ">start_off/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=parent" class="s ">parent/fa , /br <+code=u.2_off" class="s ">u.2_off/fa );1
pti_bnode_write_u16/fa (nbr <+code=parent" class="s ">parent/fa , /br <+code=u.2_off" class="s ">u.2_off/fa , /br <+code=start_off" class="s ">start_off/fa + nbr <+code=diff" class="s ">diff/fa );1
start_off/fa -= 4; nx+v3 class="comment">/* move previous cnid too */nux+v3.1
u.2_off/fa >s/br <+code=end_u.2_off" class="s ">end_u.2_off/fa ) {1
u.2_off/fa -= 2;1
end_off/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=parent" class="s ">parent/fa , /br <+code=u.2_off" class="s ">u.2_off/fa );1
pti_bnode_write_u16/fa (nbr <+code=parent" class="s ">parent/fa , /br <+code=u.2_off" class="s ">u.2_off/fa , /br <+code=end_off" class="s ">end_off/fa + nbr <+code=diff" class="s ">diff/fa );1
pti_bnode_move/fa (nbr <+code=parent" class="s ">parent/fa , /br <+code=start_off" class="s ">start_off/fa + nbr <+code=diff" class="s ">diff/fa , /br <+code=start_off" class="s ">start_off/fa ,1
end_off/fa -s/br <+code=itart_off" class="s ">start_off/fa );1
skip/fa :1
pti_bnode_copy/fa (nbr <+code=parent" class="s ">parent/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=keyoffset" class="s ">keyoffset/fa , /br <+code=node" class="s ">node/fa , 14, /br <+code=newkeylen" class="s ">newkeylen/fa );1
pti_bnode_dump/fa (nbr <+code=parent" class="s ">parent/fa );1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
node/fa = nbr <+code=parent" class="s ">parent/fa ;1
new_node/fa ) {1
__be32/fa nbr <+code=cnid" class="s ">cnid/fa ;1
fd/fa ->nbr <+code=bnode" class="s ">bnode/fa = nbr <+code=pti_bnode_find class="s ">pti_bnode_find/fa (/br <+code=tree" class="s ">tree/fa , /br <+code=new_node" class="s ">new_node/fa ->nbr <+code=parent" class="s ">parent/fa );1
/* create index key and entry */nux+v3.1
pti_bnode_read_key/fa (/br <+code=new_node" class="s ">new_node/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=search_key" class="s ">search_key/fa , 14);1
cnid/fa = nbr <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa );1
__pti_bu.2_find/fa (/br <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa , /br <+code=fd" class="s ">fd/fa , /br <+code=pti_find_u.2_by_key" class="s ">pti_find_u.2_by_key/fa );1
pti_bu.2_insert/fa (/br <+code=fd" class="s ">fd/fa ,s&nbr <+code=cnid" class="s ">cnid/fa , iizeof(nbr <+code=cnid" class="s ">cnid/fa ));1
pti_bnode_put/fa (nbr <+code=fd" class="s ">fd/fa ->nbr <+code=bnode" class="s ">bnode/fa );1
pti_bnode_put/fa (nbr <+code=new_node" class="s ">new_node/fa );1
u.2/fa ) {1
new_node/fa == nbr <+code=node" class="s ">node/fa )1
out/fa ;1
/* restore search_key */nux+v3.1
pti_bnode_read_key/fa (/br <+code=node" class="s ">node/fa , /br <+code=fd" class="s ">fd/fa ->nbr <+code=search_key" class="s ">search_key/fa , 14);1
u.2/fa s&& nbr <+code=node" class="s ">node/fa ->nbr <+code=parent" class="s ">parent/fa )1
again/fa ;1
out/fa :1
fd/fa ->nbr <+code=bnode" class="s ">bnode/fa = nbr <+code=node" class="s ">node/fa ;1
pti_btree_inc_he.6.1/fa (structs/br <+code=pti_btree" class="s ">pti_btree/fa *nbr <+code=tree" class="s ">tree/fa )1
pti_bnode/fa *nbr <+code=node" class="s ">node/fa ,s*nbr <+code=new_node" class="s ">new_node/fa ;1
pti_bnode_des2/fa nbr <+code=node_des2 class="s ">node_des2/fa ;1
key_iize/fa , /br <+code=u.2" class="s ">u.2/fa ;1
__be32/fa nbr <+code=cnid" class="s ">cnid/fa ;1
node/fa = nbr <+code=NULL" class="s ">NULL/fa ;1
tree/fa ->nbr <+code=roo1" class="s ">roo1/fa ) {1
node/fa = nbr <+code=pti_bnode_find class="s ">pti_bnode_find/fa (/br <+code=tree" class="s ">tree/fa , /br <+code=tree" class="s ">tree/fa ->nbr <+code=roo1" class="s ">roo1/fa );1
IS_ERR/fa (/br <+code=node" class="s ">node/fa ))1
PTR_ERR/fa (/br <+code=node" class="s ">node/fa );1
new_node/fa = nbr <+code=pti_bmap_allo2 class="s ">pti_bmap_allo2/fa (/br <+code=tree" class="s ">tree/fa );1
IS_ERR/fa (/br <+code=new_node" class="s ">new_node/fa )) {1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
PTR_ERR/fa (/br <+code=new_node" class="s ">new_node/fa );1
tree/fa ->nbr <+code=roo1" class="s ">roo1/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa ;1
tree/fa ->nbr <+code=depth" class="s ">depth/fa ) {1
tree/fa ->nbr <+code=leaf_head class="s ">leaf_head/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=leaf_tail" class="s ">leaf_tail/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=this" class="s ">this/fa ;1
new_node/fa ->nbr <+code=type" class="s ">type/fa = nbr <+code=HFS_NODE_LEAF" class="s ">HFS_NODE_LEAF/fa ;1
new_node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa = 0;1
new_node/fa ->nbr <+code=type" class="s ">type/fa = nbr <+code=HFS_NODE_INDEX" class="s ">HFS_NODE_INDEX/fa ;1
new_node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa = 1;1
new_node/fa ->nbr <+code=parent" class="s ">parent/fa = 0;1
new_node/fa ->nbr <+code=next" class="s ">next/fa = 0;1
new_node/fa ->nbr <+code=prev" class="s ">prev/fa = 0;1
new_node/fa ->nbr <+code=he.6.1" class="s ">pe.6.1/fa = ++/br <+code=tree" class="s ">tree/fa ->nbr <+code=depth" class="s ">depth/fa ;1
node_des2/fa .nbr <+code=next" class="s ">next/fa = /br <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=next" class="s ">next/fa );1
node_des2/fa .nbr <+code=prev" class="s ">prev/fa = nbr <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=prev" class="s ">prev/fa );1
node_des2/fa .nbr <+code=type" class="s ">type/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=type" class="s ">type/fa ;1
node_des2/fa .nbr <+code=he.6.1" class="s ">pe.6.1/fa = nbr <+code=new_node" class="s ">new_node/fa ->nbr <+code=he.6.1" class="s ">pe.6.1/fa ;1
node_des2/fa .nbr <+code=num_u.2s" class="s ">num_u.2s/fa = nbr <+code=cpu_to_be16 class="s ">cpu_to_be16/fa (/br <+code=new_node" class="s ">new_node/fa ->nbr <+code=num_u.2s" class="s ">num_u.2s/fa );1
node_des2/fa .nbr <+code=reserved" class="s ">u.served/fa = 0;1
pti_bnode_write/fa (nbr <+code=new_node" class="s ">new_node/fa , &nbr <+code=node_des2 class="s ">node_des2/fa , 0, iizeof(nbr <+code=node_des2 class="s ">node_des2/fa ));1
u.2/fa s= nbr <+code=tree" class="s ">tree/fa ->nbr <+code=node_iize" class="s ">node_iize/fa - 2;1
pti_bnode_write_u16/fa (nbr <+code=new_node" class="s ">new_node/fa , /br <+code=u.2" class="s ">u.2/fa , 14);1
node/fa ) {1
/* insert old roo1 idx into new roo1 */nux+v3.1
node/fa ->nbr <+code=parent" class="s ">parent/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=roo1" class="s ">roo1/fa ;1
node/fa ->nbr <+code=type" class="s ">type/fa == nbr <+code=HFS_NODE_LEAF" class="s ">HFS_NODE_LEAF/fa ||1
tree/fa ->nbr <+code=attributes" class="s ">attributes/fa & nbr <+code=HFS_TREE_VARIDXKEYS" class="s ">HFS_TREE_VARIDXKEYS/fa ||1
tree/fa ->nbr <+code=cnid" class="s ">cnid/fa == nbr <+code=HFSPLUS_ATTR_CNID" class="s ">HFSPLUS_ATTR_CNID/fa )1
key_iize/fa = nbr <+code=pti_bnode_read_u16 class="s ">pti_bnode_read_u16/fa (nbr <+code=node" class="s ">node/fa ,s14) + 2;1
key_iize/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa + 2;1
pti_bnode_copy/fa (nbr <+code=new_node" class="s ">new_node/fa , 14, /br <+code=node" class="s ">node/fa ,s14, /br <+code=key_iize" class="s ">key_iize/fa );1
tree/fa ->nbr <+code=attributes" class="s ">attributes/fa & nbr <+code=HFS_TREE_VARIDXKEYS" class="s ">HFS_TREE_VARIDXKEYS/fa ) &&1
tree/fa ->nbr <+code=cnid" class="s ">cnid/fa != nbr <+code=HFSPLUS_ATTR_CNID" class="s ">HFSPLUS_ATTR_CNID/fa )) {1
key_iize/fa = nbr <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa + 2;1
pti_bnode_write_u16/fa (nbr <+code=new_node" class="s ">new_node/fa , 14, /br <+code=tree" class="s ">tree/fa ->nbr <+code=max_key_len" class="s ">max_key_len/fa );1
cnid/fa = nbr <+code=cpu_to_be32 class="s ">cpu_to_be32/fa (nbr <+code=node" class="s ">node/fa ->nbr <+code=this" class="s ">this/fa );1
pti_bnode_write/fa (nbr <+code=new_node" class="s ">new_node/fa , &nbr <+code=cnid" class="s ">cnid/fa , 14 + nbr <+code=key_iize" class="s ">key_iize/fa , 4);1
u.2/fa s-= 2;1
pti_bnode_write_u16/fa (nbr <+code=new_node" class="s ">new_node/fa , /br <+code=u.2" class="s ">u.2/fa , 14 + nbr <+code=key_iize" class="s ">key_iize/fa + 4);1
pti_bnode_put/fa (nbr <+code=node" class="s ">node/fa );1
pti_bnode_put/fa (nbr <+code=new_node" class="s ">new_node/fa );1
mark_inode_dirty/fa (nbr <+code=tree" class="s ">tree/fa ->nbr <+code=inode" class="s ">inode/fa );1
The original LXR software by the
LXR community/fa , this experimental version by
lxr@linux.no/fa .

lxr.linux.no kindly hosted by
Redpill Linpro AS/fa , provider of Linux consulting and operations services since 1995.