diff options
Diffstat (limited to 'fs/hfsplus/brec.c')
| -rw-r--r-- | fs/hfsplus/brec.c | 29 |
1 files changed, 22 insertions, 7 deletions
diff --git a/fs/hfsplus/brec.c b/fs/hfsplus/brec.c index c88e5d72a40..2f39d05443e 100644 --- a/fs/hfsplus/brec.c +++ b/fs/hfsplus/brec.c | |||
| @@ -42,10 +42,13 @@ u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) | |||
| 42 | recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); | 42 | recoff = hfs_bnode_read_u16(node, node->tree->node_size - (rec + 1) * 2); |
| 43 | if (!recoff) | 43 | if (!recoff) |
| 44 | return 0; | 44 | return 0; |
| 45 | if (node->tree->attributes & HFS_TREE_BIGKEYS) | 45 | |
| 46 | retval = hfs_bnode_read_u16(node, recoff) + 2; | 46 | retval = hfs_bnode_read_u16(node, recoff) + 2; |
| 47 | else | 47 | if (retval > node->tree->max_key_len + 2) { |
| 48 | retval = (hfs_bnode_read_u8(node, recoff) | 1) + 1; | 48 | printk(KERN_ERR "hfs: keylen %d too large\n", |
| 49 | retval); | ||
| 50 | retval = 0; | ||
| 51 | } | ||
| 49 | } | 52 | } |
| 50 | return retval; | 53 | return retval; |
| 51 | } | 54 | } |
| @@ -216,7 +219,7 @@ skip: | |||
| 216 | static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) | 219 | static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) |
| 217 | { | 220 | { |
| 218 | struct hfs_btree *tree; | 221 | struct hfs_btree *tree; |
| 219 | struct hfs_bnode *node, *new_node; | 222 | struct hfs_bnode *node, *new_node, *next_node; |
| 220 | struct hfs_bnode_desc node_desc; | 223 | struct hfs_bnode_desc node_desc; |
| 221 | int num_recs, new_rec_off, new_off, old_rec_off; | 224 | int num_recs, new_rec_off, new_off, old_rec_off; |
| 222 | int data_start, data_end, size; | 225 | int data_start, data_end, size; |
| @@ -235,6 +238,17 @@ static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) | |||
| 235 | new_node->type = node->type; | 238 | new_node->type = node->type; |
| 236 | new_node->height = node->height; | 239 | new_node->height = node->height; |
| 237 | 240 | ||
| 241 | if (node->next) | ||
| 242 | next_node = hfs_bnode_find(tree, node->next); | ||
| 243 | else | ||
| 244 | next_node = NULL; | ||
| 245 | |||
| 246 | if (IS_ERR(next_node)) { | ||
| 247 | hfs_bnode_put(node); | ||
| 248 | hfs_bnode_put(new_node); | ||
| 249 | return next_node; | ||
| 250 | } | ||
| 251 | |||
| 238 | size = tree->node_size / 2 - node->num_recs * 2 - 14; | 252 | size = tree->node_size / 2 - node->num_recs * 2 - 14; |
| 239 | old_rec_off = tree->node_size - 4; | 253 | old_rec_off = tree->node_size - 4; |
| 240 | num_recs = 1; | 254 | num_recs = 1; |
| @@ -248,6 +262,8 @@ static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) | |||
| 248 | /* panic? */ | 262 | /* panic? */ |
| 249 | hfs_bnode_put(node); | 263 | hfs_bnode_put(node); |
| 250 | hfs_bnode_put(new_node); | 264 | hfs_bnode_put(new_node); |
| 265 | if (next_node) | ||
| 266 | hfs_bnode_put(next_node); | ||
| 251 | return ERR_PTR(-ENOSPC); | 267 | return ERR_PTR(-ENOSPC); |
| 252 | } | 268 | } |
| 253 | 269 | ||
| @@ -302,8 +318,7 @@ static struct hfs_bnode *hfs_bnode_split(struct hfs_find_data *fd) | |||
| 302 | hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc)); | 318 | hfs_bnode_write(node, &node_desc, 0, sizeof(node_desc)); |
| 303 | 319 | ||
| 304 | /* update next bnode header */ | 320 | /* update next bnode header */ |
| 305 | if (new_node->next) { | 321 | if (next_node) { |
| 306 | struct hfs_bnode *next_node = hfs_bnode_find(tree, new_node->next); | ||
| 307 | next_node->prev = new_node->this; | 322 | next_node->prev = new_node->this; |
| 308 | hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc)); | 323 | hfs_bnode_read(next_node, &node_desc, 0, sizeof(node_desc)); |
| 309 | node_desc.prev = cpu_to_be32(next_node->prev); | 324 | node_desc.prev = cpu_to_be32(next_node->prev); |
