diff options
| -rw-r--r-- | fs/hfs/bfind.c | 11 | ||||
| -rw-r--r-- | fs/hfs/brec.c | 4 | ||||
| -rw-r--r-- | fs/hfs/btree.c | 26 | ||||
| -rw-r--r-- | fs/hfs/hfs.h | 2 |
4 files changed, 25 insertions, 18 deletions
diff --git a/fs/hfs/bfind.c b/fs/hfs/bfind.c index f8452a0eab56..4129cdb3f0d8 100644 --- a/fs/hfs/bfind.c +++ b/fs/hfs/bfind.c | |||
| @@ -52,9 +52,9 @@ int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd) | |||
| 52 | rec = (e + b) / 2; | 52 | rec = (e + b) / 2; |
| 53 | len = hfs_brec_lenoff(bnode, rec, &off); | 53 | len = hfs_brec_lenoff(bnode, rec, &off); |
| 54 | keylen = hfs_brec_keylen(bnode, rec); | 54 | keylen = hfs_brec_keylen(bnode, rec); |
| 55 | if (keylen == HFS_BAD_KEYLEN) { | 55 | if (keylen == 0) { |
| 56 | res = -EINVAL; | 56 | res = -EINVAL; |
| 57 | goto done; | 57 | goto fail; |
| 58 | } | 58 | } |
| 59 | hfs_bnode_read(bnode, fd->key, off, keylen); | 59 | hfs_bnode_read(bnode, fd->key, off, keylen); |
| 60 | cmpval = bnode->tree->keycmp(fd->key, fd->search_key); | 60 | cmpval = bnode->tree->keycmp(fd->key, fd->search_key); |
| @@ -71,9 +71,9 @@ int __hfs_brec_find(struct hfs_bnode *bnode, struct hfs_find_data *fd) | |||
| 71 | if (rec != e && e >= 0) { | 71 | if (rec != e && e >= 0) { |
| 72 | len = hfs_brec_lenoff(bnode, e, &off); | 72 | len = hfs_brec_lenoff(bnode, e, &off); |
| 73 | keylen = hfs_brec_keylen(bnode, e); | 73 | keylen = hfs_brec_keylen(bnode, e); |
| 74 | if (keylen == HFS_BAD_KEYLEN) { | 74 | if (keylen == 0) { |
| 75 | res = -EINVAL; | 75 | res = -EINVAL; |
| 76 | goto done; | 76 | goto fail; |
| 77 | } | 77 | } |
| 78 | hfs_bnode_read(bnode, fd->key, off, keylen); | 78 | hfs_bnode_read(bnode, fd->key, off, keylen); |
| 79 | } | 79 | } |
| @@ -83,6 +83,7 @@ done: | |||
| 83 | fd->keylength = keylen; | 83 | fd->keylength = keylen; |
| 84 | fd->entryoffset = off + keylen; | 84 | fd->entryoffset = off + keylen; |
| 85 | fd->entrylength = len - keylen; | 85 | fd->entrylength = len - keylen; |
| 86 | fail: | ||
| 86 | return res; | 87 | return res; |
| 87 | } | 88 | } |
| 88 | 89 | ||
| @@ -206,7 +207,7 @@ int hfs_brec_goto(struct hfs_find_data *fd, int cnt) | |||
| 206 | 207 | ||
| 207 | len = hfs_brec_lenoff(bnode, fd->record, &off); | 208 | len = hfs_brec_lenoff(bnode, fd->record, &off); |
| 208 | keylen = hfs_brec_keylen(bnode, fd->record); | 209 | keylen = hfs_brec_keylen(bnode, fd->record); |
| 209 | if (keylen == HFS_BAD_KEYLEN) { | 210 | if (keylen == 0) { |
| 210 | res = -EINVAL; | 211 | res = -EINVAL; |
| 211 | goto out; | 212 | goto out; |
| 212 | } | 213 | } |
diff --git a/fs/hfs/brec.c b/fs/hfs/brec.c index 8626ee375ea8..878bf25dbc6a 100644 --- a/fs/hfs/brec.c +++ b/fs/hfs/brec.c | |||
| @@ -49,14 +49,14 @@ u16 hfs_brec_keylen(struct hfs_bnode *node, u16 rec) | |||
| 49 | if (retval > node->tree->max_key_len + 2) { | 49 | if (retval > node->tree->max_key_len + 2) { |
| 50 | printk(KERN_ERR "hfs: keylen %d too large\n", | 50 | printk(KERN_ERR "hfs: keylen %d too large\n", |
| 51 | retval); | 51 | retval); |
| 52 | retval = HFS_BAD_KEYLEN; | 52 | retval = 0; |
| 53 | } | 53 | } |
| 54 | } else { | 54 | } else { |
| 55 | retval = (hfs_bnode_read_u8(node, recoff) | 1) + 1; | 55 | retval = (hfs_bnode_read_u8(node, recoff) | 1) + 1; |
| 56 | if (retval > node->tree->max_key_len + 1) { | 56 | if (retval > node->tree->max_key_len + 1) { |
| 57 | printk(KERN_ERR "hfs: keylen %d too large\n", | 57 | printk(KERN_ERR "hfs: keylen %d too large\n", |
| 58 | retval); | 58 | retval); |
| 59 | retval = HFS_BAD_KEYLEN; | 59 | retval = 0; |
| 60 | } | 60 | } |
| 61 | } | 61 | } |
| 62 | } | 62 | } |
diff --git a/fs/hfs/btree.c b/fs/hfs/btree.c index 110dd3515dc8..24cf6fc43021 100644 --- a/fs/hfs/btree.c +++ b/fs/hfs/btree.c | |||
| @@ -81,15 +81,23 @@ struct hfs_btree *hfs_btree_open(struct super_block *sb, u32 id, btree_keycmp ke | |||
| 81 | goto fail_page; | 81 | goto fail_page; |
| 82 | if (!tree->node_count) | 82 | if (!tree->node_count) |
| 83 | goto fail_page; | 83 | goto fail_page; |
| 84 | if ((id == HFS_EXT_CNID) && (tree->max_key_len != HFS_MAX_EXT_KEYLEN)) { | 84 | switch (id) { |
| 85 | printk(KERN_ERR "hfs: invalid extent max_key_len %d\n", | 85 | case HFS_EXT_CNID: |
| 86 | tree->max_key_len); | 86 | if (tree->max_key_len != HFS_MAX_EXT_KEYLEN) { |
| 87 | goto fail_page; | 87 | printk(KERN_ERR "hfs: invalid extent max_key_len %d\n", |
| 88 | } | 88 | tree->max_key_len); |
| 89 | if ((id == HFS_CAT_CNID) && (tree->max_key_len != HFS_MAX_CAT_KEYLEN)) { | 89 | goto fail_page; |
| 90 | printk(KERN_ERR "hfs: invalid catalog max_key_len %d\n", | 90 | } |
| 91 | tree->max_key_len); | 91 | break; |
| 92 | goto fail_page; | 92 | case HFS_CAT_CNID: |
| 93 | if (tree->max_key_len != HFS_MAX_CAT_KEYLEN) { | ||
| 94 | printk(KERN_ERR "hfs: invalid catalog max_key_len %d\n", | ||
| 95 | tree->max_key_len); | ||
| 96 | goto fail_page; | ||
| 97 | } | ||
| 98 | break; | ||
| 99 | default: | ||
| 100 | BUG(); | ||
| 93 | } | 101 | } |
| 94 | 102 | ||
| 95 | tree->node_size_shift = ffs(size) - 1; | 103 | tree->node_size_shift = ffs(size) - 1; |
diff --git a/fs/hfs/hfs.h b/fs/hfs/hfs.h index c6aae61adfe6..6f194d0768b6 100644 --- a/fs/hfs/hfs.h +++ b/fs/hfs/hfs.h | |||
| @@ -28,8 +28,6 @@ | |||
| 28 | #define HFS_MAX_NAMELEN 128 | 28 | #define HFS_MAX_NAMELEN 128 |
| 29 | #define HFS_MAX_VALENCE 32767U | 29 | #define HFS_MAX_VALENCE 32767U |
| 30 | 30 | ||
| 31 | #define HFS_BAD_KEYLEN 0xFF | ||
| 32 | |||
| 33 | /* Meanings of the drAtrb field of the MDB, | 31 | /* Meanings of the drAtrb field of the MDB, |
| 34 | * Reference: _Inside Macintosh: Files_ p. 2-61 | 32 | * Reference: _Inside Macintosh: Files_ p. 2-61 |
| 35 | */ | 33 | */ |
