1/*- 2 * Copyright (c) 2002 Poul-Henning Kamp 3 * Copyright (c) 2002 Networks Associates Technology, Inc. 4 * All rights reserved. 5 * 6 * This software was developed for the FreeBSD Project by Poul-Henning Kamp 7 * and NAI Labs, the Security Research Division of Network Associates, Inc. 8 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the 9 * DARPA CHATS research program. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33#include <sys/cdefs.h>
| 1/*- 2 * Copyright (c) 2002 Poul-Henning Kamp 3 * Copyright (c) 2002 Networks Associates Technology, Inc. 4 * All rights reserved. 5 * 6 * This software was developed for the FreeBSD Project by Poul-Henning Kamp 7 * and NAI Labs, the Security Research Division of Network Associates, Inc. 8 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the 9 * DARPA CHATS research program. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33#include <sys/cdefs.h>
|
35 36#include <sys/param.h> 37#include <sys/endian.h> 38#include <sys/systm.h> 39#include <sys/kernel.h> 40#include <sys/malloc.h> 41#include <sys/bio.h> 42#include <sys/lock.h> 43#include <sys/mutex.h> 44 45#include <sys/diskpc98.h> 46#include <geom/geom.h> 47#include <geom/geom_slice.h> 48 49#define PC98_CLASS_NAME "PC98" 50 51struct g_pc98_softc { 52 u_int fwsectors, fwheads, sectorsize; 53 int type[NDOSPART]; 54 u_char sec[8192]; 55}; 56 57static void 58g_pc98_print(int i, struct pc98_partition *dp) 59{ 60 char sname[17]; 61 62 strncpy(sname, dp->dp_name, 16); 63 sname[16] = '\0'; 64 65 hexdump(dp, sizeof(dp[0]), NULL, 0); 66 printf("[%d] mid:%d(0x%x) sid:%d(0x%x)", 67 i, dp->dp_mid, dp->dp_mid, dp->dp_sid, dp->dp_sid); 68 printf(" s:%d/%d/%d", dp->dp_scyl, dp->dp_shd, dp->dp_ssect); 69 printf(" e:%d/%d/%d", dp->dp_ecyl, dp->dp_ehd, dp->dp_esect); 70 printf(" sname:%s\n", sname); 71} 72 73static int 74g_pc98_modify(struct g_geom *gp, struct g_pc98_softc *ms, u_char *sec) 75{ 76 int i, error; 77 off_t s[NDOSPART], l[NDOSPART]; 78 struct pc98_partition dp[NDOSPART]; 79 80 g_topology_assert(); 81 82 if (sec[0x1fe] != 0x55 || sec[0x1ff] != 0xaa) 83 return (EBUSY); 84 85#if 0 86 /* 87 * XXX: Some sources indicate this is a magic sequence, but appearantly 88 * XXX: it is not universal. Documentation would be wonderful to have. 89 */ 90 if (sec[4] != 'I' || sec[5] != 'P' || sec[6] != 'L' || sec[7] != '1') 91 return (EBUSY); 92#endif 93 94 for (i = 0; i < NDOSPART; i++) 95 pc98_partition_dec( 96 sec + 512 + i * sizeof(struct pc98_partition), &dp[i]); 97 98 for (i = 0; i < NDOSPART; i++) { 99 /* If start and end are identical it's bogus */ 100 if (dp[i].dp_ssect == dp[i].dp_esect && 101 dp[i].dp_shd == dp[i].dp_ehd && 102 dp[i].dp_scyl == dp[i].dp_ecyl) 103 s[i] = l[i] = 0; 104 else if (dp[i].dp_ecyl == 0) 105 s[i] = l[i] = 0; 106 else { 107 s[i] = (off_t)dp[i].dp_scyl * 108 ms->fwsectors * ms->fwheads * ms->sectorsize; 109 l[i] = (off_t)(dp[i].dp_ecyl - dp[i].dp_scyl + 1) * 110 ms->fwsectors * ms->fwheads * ms->sectorsize; 111 } 112 if (bootverbose) { 113 printf("PC98 Slice %d on %s:\n", i + 1, gp->name); 114 g_pc98_print(i, dp + i); 115 } 116 if (s[i] < 0 || l[i] < 0) 117 error = EBUSY; 118 else 119 error = g_slice_config(gp, i, G_SLICE_CONFIG_CHECK, 120 s[i], l[i], ms->sectorsize, 121 "%ss%d", gp->name, i + 1); 122 if (error) 123 return (error); 124 } 125 126 for (i = 0; i < NDOSPART; i++) { 127 ms->type[i] = (dp[i].dp_sid << 8) | dp[i].dp_mid; 128 g_slice_config(gp, i, G_SLICE_CONFIG_SET, s[i], l[i], 129 ms->sectorsize, "%ss%d", gp->name, i + 1); 130 } 131 132 bcopy(sec, ms->sec, sizeof (ms->sec)); 133 134 return (0); 135} 136 137static int 138g_pc98_ioctl(struct g_provider *pp, u_long cmd, void *data, struct thread *td) 139{ 140 struct g_geom *gp; 141 struct g_pc98_softc *ms; 142 struct g_slicer *gsp; 143 struct g_consumer *cp; 144 int error; 145 146 gp = pp->geom; 147 gsp = gp->softc; 148 ms = gsp->softc; 149 150 switch(cmd) { 151 case DIOCSPC98: { 152 DROP_GIANT(); 153 g_topology_lock(); 154 /* Validate and modify our slicer instance to match. */ 155 error = g_pc98_modify(gp, ms, data); 156 cp = LIST_FIRST(&gp->consumer); 157 error = g_write_data(cp, 0, data, 8192); 158 g_topology_unlock(); 159 PICKUP_GIANT(); 160 return(error); 161 } 162 default: 163 return (ENOIOCTL); 164 } 165} 166 167static int 168g_pc98_start(struct bio *bp) 169{ 170 struct g_provider *pp; 171 struct g_geom *gp; 172 struct g_pc98_softc *mp; 173 struct g_slicer *gsp; 174 int idx; 175 176 pp = bp->bio_to; 177 idx = pp->index; 178 gp = pp->geom; 179 gsp = gp->softc; 180 mp = gsp->softc; 181 if (bp->bio_cmd == BIO_GETATTR) { 182 if (g_handleattr_int(bp, "PC98::type", mp->type[idx])) 183 return (1); 184 if (g_handleattr_off_t(bp, "PC98::offset", 185 gsp->slices[idx].offset)) 186 return (1); 187 } 188 189 return (0); 190} 191 192static void 193g_pc98_dumpconf(struct sbuf *sb, const char *indent, struct g_geom *gp, 194 struct g_consumer *cp __unused, struct g_provider *pp) 195{ 196 struct g_pc98_softc *mp; 197 struct g_slicer *gsp; 198 struct pc98_partition dp; 199 char sname[17]; 200 201 gsp = gp->softc; 202 mp = gsp->softc; 203 g_slice_dumpconf(sb, indent, gp, cp, pp); 204 if (pp != NULL) { 205 pc98_partition_dec( 206 mp->sec + 512 + 207 pp->index * sizeof(struct pc98_partition), &dp); 208 strncpy(sname, dp.dp_name, 16); 209 sname[16] = '\0'; 210 if (indent == NULL) { 211 sbuf_printf(sb, " ty %d", mp->type[pp->index]); 212 sbuf_printf(sb, " sn %s", sname); 213 } else { 214 sbuf_printf(sb, "%s<type>%d</type>\n", indent, 215 mp->type[pp->index]); 216 sbuf_printf(sb, "%s<sname>%s</sname>\n", indent, 217 sname); 218 } 219 } 220} 221 222static struct g_geom * 223g_pc98_taste(struct g_class *mp, struct g_provider *pp, int flags) 224{ 225 struct g_geom *gp; 226 struct g_consumer *cp; 227 int error; 228 struct g_pc98_softc *ms; 229 u_int fwsectors, fwheads, sectorsize; 230 u_char *buf; 231 232 g_trace(G_T_TOPOLOGY, "g_pc98_taste(%s,%s)", mp->name, pp->name); 233 g_topology_assert(); 234 if (flags == G_TF_NORMAL && 235 !strcmp(pp->geom->class->name, PC98_CLASS_NAME)) 236 return (NULL); 237 gp = g_slice_new(mp, NDOSPART, pp, &cp, &ms, sizeof *ms, g_pc98_start); 238 if (gp == NULL) 239 return (NULL); 240 g_topology_unlock();
| 35 36#include <sys/param.h> 37#include <sys/endian.h> 38#include <sys/systm.h> 39#include <sys/kernel.h> 40#include <sys/malloc.h> 41#include <sys/bio.h> 42#include <sys/lock.h> 43#include <sys/mutex.h> 44 45#include <sys/diskpc98.h> 46#include <geom/geom.h> 47#include <geom/geom_slice.h> 48 49#define PC98_CLASS_NAME "PC98" 50 51struct g_pc98_softc { 52 u_int fwsectors, fwheads, sectorsize; 53 int type[NDOSPART]; 54 u_char sec[8192]; 55}; 56 57static void 58g_pc98_print(int i, struct pc98_partition *dp) 59{ 60 char sname[17]; 61 62 strncpy(sname, dp->dp_name, 16); 63 sname[16] = '\0'; 64 65 hexdump(dp, sizeof(dp[0]), NULL, 0); 66 printf("[%d] mid:%d(0x%x) sid:%d(0x%x)", 67 i, dp->dp_mid, dp->dp_mid, dp->dp_sid, dp->dp_sid); 68 printf(" s:%d/%d/%d", dp->dp_scyl, dp->dp_shd, dp->dp_ssect); 69 printf(" e:%d/%d/%d", dp->dp_ecyl, dp->dp_ehd, dp->dp_esect); 70 printf(" sname:%s\n", sname); 71} 72 73static int 74g_pc98_modify(struct g_geom *gp, struct g_pc98_softc *ms, u_char *sec) 75{ 76 int i, error; 77 off_t s[NDOSPART], l[NDOSPART]; 78 struct pc98_partition dp[NDOSPART]; 79 80 g_topology_assert(); 81 82 if (sec[0x1fe] != 0x55 || sec[0x1ff] != 0xaa) 83 return (EBUSY); 84 85#if 0 86 /* 87 * XXX: Some sources indicate this is a magic sequence, but appearantly 88 * XXX: it is not universal. Documentation would be wonderful to have. 89 */ 90 if (sec[4] != 'I' || sec[5] != 'P' || sec[6] != 'L' || sec[7] != '1') 91 return (EBUSY); 92#endif 93 94 for (i = 0; i < NDOSPART; i++) 95 pc98_partition_dec( 96 sec + 512 + i * sizeof(struct pc98_partition), &dp[i]); 97 98 for (i = 0; i < NDOSPART; i++) { 99 /* If start and end are identical it's bogus */ 100 if (dp[i].dp_ssect == dp[i].dp_esect && 101 dp[i].dp_shd == dp[i].dp_ehd && 102 dp[i].dp_scyl == dp[i].dp_ecyl) 103 s[i] = l[i] = 0; 104 else if (dp[i].dp_ecyl == 0) 105 s[i] = l[i] = 0; 106 else { 107 s[i] = (off_t)dp[i].dp_scyl * 108 ms->fwsectors * ms->fwheads * ms->sectorsize; 109 l[i] = (off_t)(dp[i].dp_ecyl - dp[i].dp_scyl + 1) * 110 ms->fwsectors * ms->fwheads * ms->sectorsize; 111 } 112 if (bootverbose) { 113 printf("PC98 Slice %d on %s:\n", i + 1, gp->name); 114 g_pc98_print(i, dp + i); 115 } 116 if (s[i] < 0 || l[i] < 0) 117 error = EBUSY; 118 else 119 error = g_slice_config(gp, i, G_SLICE_CONFIG_CHECK, 120 s[i], l[i], ms->sectorsize, 121 "%ss%d", gp->name, i + 1); 122 if (error) 123 return (error); 124 } 125 126 for (i = 0; i < NDOSPART; i++) { 127 ms->type[i] = (dp[i].dp_sid << 8) | dp[i].dp_mid; 128 g_slice_config(gp, i, G_SLICE_CONFIG_SET, s[i], l[i], 129 ms->sectorsize, "%ss%d", gp->name, i + 1); 130 } 131 132 bcopy(sec, ms->sec, sizeof (ms->sec)); 133 134 return (0); 135} 136 137static int 138g_pc98_ioctl(struct g_provider *pp, u_long cmd, void *data, struct thread *td) 139{ 140 struct g_geom *gp; 141 struct g_pc98_softc *ms; 142 struct g_slicer *gsp; 143 struct g_consumer *cp; 144 int error; 145 146 gp = pp->geom; 147 gsp = gp->softc; 148 ms = gsp->softc; 149 150 switch(cmd) { 151 case DIOCSPC98: { 152 DROP_GIANT(); 153 g_topology_lock(); 154 /* Validate and modify our slicer instance to match. */ 155 error = g_pc98_modify(gp, ms, data); 156 cp = LIST_FIRST(&gp->consumer); 157 error = g_write_data(cp, 0, data, 8192); 158 g_topology_unlock(); 159 PICKUP_GIANT(); 160 return(error); 161 } 162 default: 163 return (ENOIOCTL); 164 } 165} 166 167static int 168g_pc98_start(struct bio *bp) 169{ 170 struct g_provider *pp; 171 struct g_geom *gp; 172 struct g_pc98_softc *mp; 173 struct g_slicer *gsp; 174 int idx; 175 176 pp = bp->bio_to; 177 idx = pp->index; 178 gp = pp->geom; 179 gsp = gp->softc; 180 mp = gsp->softc; 181 if (bp->bio_cmd == BIO_GETATTR) { 182 if (g_handleattr_int(bp, "PC98::type", mp->type[idx])) 183 return (1); 184 if (g_handleattr_off_t(bp, "PC98::offset", 185 gsp->slices[idx].offset)) 186 return (1); 187 } 188 189 return (0); 190} 191 192static void 193g_pc98_dumpconf(struct sbuf *sb, const char *indent, struct g_geom *gp, 194 struct g_consumer *cp __unused, struct g_provider *pp) 195{ 196 struct g_pc98_softc *mp; 197 struct g_slicer *gsp; 198 struct pc98_partition dp; 199 char sname[17]; 200 201 gsp = gp->softc; 202 mp = gsp->softc; 203 g_slice_dumpconf(sb, indent, gp, cp, pp); 204 if (pp != NULL) { 205 pc98_partition_dec( 206 mp->sec + 512 + 207 pp->index * sizeof(struct pc98_partition), &dp); 208 strncpy(sname, dp.dp_name, 16); 209 sname[16] = '\0'; 210 if (indent == NULL) { 211 sbuf_printf(sb, " ty %d", mp->type[pp->index]); 212 sbuf_printf(sb, " sn %s", sname); 213 } else { 214 sbuf_printf(sb, "%s<type>%d</type>\n", indent, 215 mp->type[pp->index]); 216 sbuf_printf(sb, "%s<sname>%s</sname>\n", indent, 217 sname); 218 } 219 } 220} 221 222static struct g_geom * 223g_pc98_taste(struct g_class *mp, struct g_provider *pp, int flags) 224{ 225 struct g_geom *gp; 226 struct g_consumer *cp; 227 int error; 228 struct g_pc98_softc *ms; 229 u_int fwsectors, fwheads, sectorsize; 230 u_char *buf; 231 232 g_trace(G_T_TOPOLOGY, "g_pc98_taste(%s,%s)", mp->name, pp->name); 233 g_topology_assert(); 234 if (flags == G_TF_NORMAL && 235 !strcmp(pp->geom->class->name, PC98_CLASS_NAME)) 236 return (NULL); 237 gp = g_slice_new(mp, NDOSPART, pp, &cp, &ms, sizeof *ms, g_pc98_start); 238 if (gp == NULL) 239 return (NULL); 240 g_topology_unlock();
|
243 do { 244 if (gp->rank != 2 && flags == G_TF_NORMAL) 245 break; 246 error = g_getattr("GEOM::fwsectors", cp, &fwsectors); 247 if (error || fwsectors == 0) { 248 fwsectors = 17; 249 if (bootverbose) 250 printf("g_pc98_taste: guessing %d sectors\n", 251 fwsectors); 252 } 253 error = g_getattr("GEOM::fwheads", cp, &fwheads); 254 if (error || fwheads == 0) { 255 fwheads = 8; 256 if (bootverbose) 257 printf("g_pc98_taste: guessing %d heads\n", 258 fwheads); 259 } 260 sectorsize = cp->provider->sectorsize; 261 if (sectorsize < 512) 262 break; 263 buf = g_read_data(cp, 0, 8192, &error); 264 if (buf == NULL || error != 0) 265 break; 266 ms->fwsectors = fwsectors; 267 ms->fwheads = fwheads; 268 ms->sectorsize = sectorsize; 269 g_topology_lock(); 270 g_pc98_modify(gp, ms, buf); 271 g_topology_unlock(); 272 g_free(buf); 273 break; 274 } while (0); 275 g_topology_lock(); 276 g_access(cp, -1, 0, 0); 277 if (LIST_EMPTY(&gp->provider)) { 278 g_slice_spoiled(cp); 279 return (NULL); 280 } 281 return (gp); 282} 283 284static struct g_class g_pc98_class = { 285 .name = PC98_CLASS_NAME, 286 .taste = g_pc98_taste,
| 241 do { 242 if (gp->rank != 2 && flags == G_TF_NORMAL) 243 break; 244 error = g_getattr("GEOM::fwsectors", cp, &fwsectors); 245 if (error || fwsectors == 0) { 246 fwsectors = 17; 247 if (bootverbose) 248 printf("g_pc98_taste: guessing %d sectors\n", 249 fwsectors); 250 } 251 error = g_getattr("GEOM::fwheads", cp, &fwheads); 252 if (error || fwheads == 0) { 253 fwheads = 8; 254 if (bootverbose) 255 printf("g_pc98_taste: guessing %d heads\n", 256 fwheads); 257 } 258 sectorsize = cp->provider->sectorsize; 259 if (sectorsize < 512) 260 break; 261 buf = g_read_data(cp, 0, 8192, &error); 262 if (buf == NULL || error != 0) 263 break; 264 ms->fwsectors = fwsectors; 265 ms->fwheads = fwheads; 266 ms->sectorsize = sectorsize; 267 g_topology_lock(); 268 g_pc98_modify(gp, ms, buf); 269 g_topology_unlock(); 270 g_free(buf); 271 break; 272 } while (0); 273 g_topology_lock(); 274 g_access(cp, -1, 0, 0); 275 if (LIST_EMPTY(&gp->provider)) { 276 g_slice_spoiled(cp); 277 return (NULL); 278 } 279 return (gp); 280} 281 282static struct g_class g_pc98_class = { 283 .name = PC98_CLASS_NAME, 284 .taste = g_pc98_taste,
|