brec.c (1da177e4c3f41524e886b7f1b8a0c1fc7321cac2) brec.c (634725a92938b0f282b17cec0b007dca77adebd2)
1/*
2 * linux/fs/hfsplus/brec.c
3 *
4 * Copyright (C) 2001
5 * Brad Boyer (flar@allandria.com)
6 * (C) 2003 Ardis Technologies <roman@ardistech.com>
7 *
8 * Handle individual btree records

--- 346 unchanged lines hidden (view full) ---

355 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
356 diff = newkeylen - fd->keylength;
357 if (!diff)
358 goto skip;
359 if (diff > 0) {
360 end_off = hfs_bnode_read_u16(parent, end_rec_off);
361 if (end_rec_off - end_off < diff) {
362
1/*
2 * linux/fs/hfsplus/brec.c
3 *
4 * Copyright (C) 2001
5 * Brad Boyer (flar@allandria.com)
6 * (C) 2003 Ardis Technologies <roman@ardistech.com>
7 *
8 * Handle individual btree records

--- 346 unchanged lines hidden (view full) ---

355 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;
356 diff = newkeylen - fd->keylength;
357 if (!diff)
358 goto skip;
359 if (diff > 0) {
360 end_off = hfs_bnode_read_u16(parent, end_rec_off);
361 if (end_rec_off - end_off < diff) {
362
363 printk("splitting index node...\n");
363 printk(KERN_DEBUG "hfs: splitting index node...\n");
364 fd->bnode = parent;
365 new_node = hfs_bnode_split(fd);
366 if (IS_ERR(new_node))
367 return PTR_ERR(new_node);
368 parent = fd->bnode;
369 rec = fd->record;
370 rec_off = tree->node_size - (rec + 2) * 2;
371 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;

--- 120 unchanged lines hidden --- 		364 fd->bnode = parent;
365 new_node = hfs_bnode_split(fd);
366 if (IS_ERR(new_node))
367 return PTR_ERR(new_node);
368 parent = fd->bnode;
369 rec = fd->record;
370 rec_off = tree->node_size - (rec + 2) * 2;
371 end_rec_off = tree->node_size - (parent->num_recs + 1) * 2;

--- 120 unchanged lines hidden ---