1 |
dpavlin |
36 |
/* |
2 |
|
|
* Copyright (C) 2006-2007 Anders Gavare. All rights reserved. |
3 |
|
|
* |
4 |
|
|
* Redistribution and use in source and binary forms, with or without |
5 |
|
|
* modification, are permitted provided that the following conditions are met: |
6 |
|
|
* |
7 |
|
|
* 1. Redistributions of source code must retain the above copyright |
8 |
|
|
* notice, this list of conditions and the following disclaimer. |
9 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright |
10 |
|
|
* notice, this list of conditions and the following disclaimer in the |
11 |
|
|
* documentation and/or other materials provided with the distribution. |
12 |
|
|
* 3. The name of the author may not be used to endorse or promote products |
13 |
|
|
* derived from this software without specific prior written permission. |
14 |
|
|
* |
15 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND |
16 |
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
17 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
18 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE |
19 |
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
20 |
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
21 |
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
22 |
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
23 |
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
24 |
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
25 |
|
|
* SUCH DAMAGE. |
26 |
|
|
* |
27 |
|
|
* |
28 |
|
|
* $Id: bootblock_apple.c,v 1.1 2007/03/16 14:45:30 debug Exp $ |
29 |
|
|
* |
30 |
|
|
* Apple bootblock handling. |
31 |
|
|
* |
32 |
|
|
* TODO: This is just a quick hack skeleton. Doesn't really work yet. |
33 |
|
|
*/ |
34 |
|
|
|
35 |
|
|
#include <stdio.h> |
36 |
|
|
#include <stdlib.h> |
37 |
|
|
#include <string.h> |
38 |
|
|
|
39 |
|
|
#include "diskimage.h" |
40 |
|
|
#include "misc.h" |
41 |
|
|
|
42 |
|
|
|
43 |
|
|
/* |
44 |
|
|
* apple_load_bootblock(): |
45 |
|
|
* |
46 |
|
|
* Try to load a kernel from a disk image with an Apple Partition Table. |
47 |
|
|
* |
48 |
|
|
* TODO: This function uses too many magic offsets and so on; it should be |
49 |
|
|
* cleaned up some day. See http://www.awprofessional.com/articles/ |
50 |
|
|
* article.asp?p=376123&seqNum=3&rl=1 for some info on the Apple |
51 |
|
|
* partition format. |
52 |
|
|
* |
53 |
|
|
* Returns 1 on success, 0 on failure. |
54 |
|
|
*/ |
55 |
|
|
int apple_load_bootblock(struct machine *m, struct cpu *cpu, |
56 |
|
|
int disk_id, int disk_type, int *n_loadp, char ***load_namesp) |
57 |
|
|
{ |
58 |
|
|
unsigned char buf[0x8000]; |
59 |
|
|
int res, partnr, n_partitions = 0, n_hfs_partitions = 0; |
60 |
|
|
uint64_t hfs_start, hfs_length; |
61 |
|
|
|
62 |
|
|
res = diskimage_access(m, disk_id, disk_type, 0, 0x0, buf, sizeof(buf)); |
63 |
|
|
if (!res) { |
64 |
|
|
fatal("apple_load_bootblock: couldn't read the disk " |
65 |
|
|
"image. Aborting.\n"); |
66 |
|
|
return 0; |
67 |
|
|
} |
68 |
|
|
|
69 |
|
|
partnr = 0; |
70 |
|
|
do { |
71 |
|
|
int start, length; |
72 |
|
|
int ofs = 0x200 * (partnr + 1); |
73 |
|
|
if (partnr == 0) |
74 |
|
|
n_partitions = buf[ofs + 7]; |
75 |
|
|
start = ((uint64_t)buf[ofs + 8] << 24) + (buf[ofs + 9] << 16) + |
76 |
|
|
(buf[ofs + 10] << 8) + buf[ofs + 11]; |
77 |
|
|
length = ((uint64_t)buf[ofs+12] << 24) + (buf[ofs + 13] << 16) + |
78 |
|
|
(buf[ofs + 14] << 8) + buf[ofs + 15]; |
79 |
|
|
|
80 |
|
|
debug("partition %i: '%s', type '%s', start %i, length %i\n", |
81 |
|
|
partnr, buf + ofs + 0x10, buf + ofs + 0x30, |
82 |
|
|
start, length); |
83 |
|
|
|
84 |
|
|
if (strcmp((char *)buf + ofs + 0x30, "Apple_HFS") == 0) { |
85 |
|
|
n_hfs_partitions ++; |
86 |
|
|
hfs_start = 512 * start; |
87 |
|
|
hfs_length = 512 * length; |
88 |
|
|
} |
89 |
|
|
|
90 |
|
|
/* Any more partitions? */ |
91 |
|
|
partnr ++; |
92 |
|
|
} while (partnr < n_partitions); |
93 |
|
|
|
94 |
|
|
if (n_hfs_partitions == 0) { |
95 |
|
|
fatal("Error: No HFS partition found! TODO\n"); |
96 |
|
|
return 0; |
97 |
|
|
} |
98 |
|
|
if (n_hfs_partitions >= 2) { |
99 |
|
|
fatal("Error: Too many HFS partitions found! TODO\n"); |
100 |
|
|
return 0; |
101 |
|
|
} |
102 |
|
|
|
103 |
|
|
return 0; |
104 |
|
|
} |
105 |
|
|
|
106 |
|
|
|