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 * 3. The names of the authors may not be used to endorse or promote 20 * products derived from this software without specific prior written 21 * permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 *
| 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 * 3. The names of the authors may not be used to endorse or promote 20 * products derived from this software without specific prior written 21 * permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 *
|
35 * $FreeBSD: head/sys/geom/geom_sunlabel.c 93090 2002-03-24 11:21:41Z phk $
| 35 * $FreeBSD: head/sys/geom/geom_sunlabel.c 93248 2002-03-26 21:40:06Z phk $
|
36 */ 37 38 39#include <sys/param.h> 40#ifndef _KERNEL 41#include <stdio.h> 42#include <string.h> 43#include <stdlib.h> 44#include <signal.h> 45#include <err.h> 46#else 47#include <sys/systm.h> 48#include <sys/kernel.h> 49#include <sys/conf.h> 50#include <sys/bio.h> 51#include <sys/malloc.h> 52#include <sys/lock.h> 53#include <sys/mutex.h> 54#endif 55#include <sys/errno.h> 56#include <geom/geom.h> 57#include <geom/geom_slice.h> 58#include <machine/endian.h> 59
| 36 */ 37 38 39#include <sys/param.h> 40#ifndef _KERNEL 41#include <stdio.h> 42#include <string.h> 43#include <stdlib.h> 44#include <signal.h> 45#include <err.h> 46#else 47#include <sys/systm.h> 48#include <sys/kernel.h> 49#include <sys/conf.h> 50#include <sys/bio.h> 51#include <sys/malloc.h> 52#include <sys/lock.h> 53#include <sys/mutex.h> 54#endif 55#include <sys/errno.h> 56#include <geom/geom.h> 57#include <geom/geom_slice.h> 58#include <machine/endian.h> 59
|
60#define BSD_METHOD_NAME "SUNLABEL-method"
| 60#define BSD_CLASS_NAME "SUNLABEL-class"
|
61 62struct g_sunlabel_softc { 63 int foo; 64}; 65 66static int 67g_sunlabel_start(struct bio *bp) 68{ 69 struct g_geom *gp; 70 struct g_sunlabel_softc *ms; 71 struct g_slicer *gsp; 72 73 gp = bp->bio_to->geom; 74 gsp = gp->softc; 75 ms = gsp->softc; 76 return (0); 77} 78 79static void 80g_sunlabel_dumpconf(struct sbuf *sb, char *indent, struct g_geom *gp, struct g_consumer *cp __unused, struct g_provider *pp) 81{ 82 83 g_slice_dumpconf(sb, indent, gp, cp, pp); 84} 85 86static struct g_geom *
| 61 62struct g_sunlabel_softc { 63 int foo; 64}; 65 66static int 67g_sunlabel_start(struct bio *bp) 68{ 69 struct g_geom *gp; 70 struct g_sunlabel_softc *ms; 71 struct g_slicer *gsp; 72 73 gp = bp->bio_to->geom; 74 gsp = gp->softc; 75 ms = gsp->softc; 76 return (0); 77} 78 79static void 80g_sunlabel_dumpconf(struct sbuf *sb, char *indent, struct g_geom *gp, struct g_consumer *cp __unused, struct g_provider *pp) 81{ 82 83 g_slice_dumpconf(sb, indent, gp, cp, pp); 84} 85 86static struct g_geom *
|
87g_sunlabel_taste(struct g_method *mp, struct g_provider *pp, struct thread *tp, int flags)
| 87g_sunlabel_taste(struct g_class *mp, struct g_provider *pp, struct thread *tp, int flags)
|
88{ 89 struct g_geom *gp; 90 struct g_consumer *cp; 91 struct g_provider *pp2; 92 int error, i, j, npart; 93 u_char *buf; 94 struct g_sunlabel_softc *ms; 95 u_int secsize, u, v, csize; 96 off_t mediasize; 97 98 g_trace(G_T_TOPOLOGY, "g_sunlabel_taste(%s,%s)", mp->name, pp->name); 99 g_topology_assert(); 100 if (flags == G_TF_NORMAL &&
| 88{ 89 struct g_geom *gp; 90 struct g_consumer *cp; 91 struct g_provider *pp2; 92 int error, i, j, npart; 93 u_char *buf; 94 struct g_sunlabel_softc *ms; 95 u_int secsize, u, v, csize; 96 off_t mediasize; 97 98 g_trace(G_T_TOPOLOGY, "g_sunlabel_taste(%s,%s)", mp->name, pp->name); 99 g_topology_assert(); 100 if (flags == G_TF_NORMAL &&
|
101 !strcmp(pp->geom->method->name, BSD_METHOD_NAME))
| 101 !strcmp(pp->geom->class->name, BSD_CLASS_NAME))
|
102 return (NULL); 103 gp = g_slice_new(mp, 8, pp, &cp, &ms, sizeof *ms, g_sunlabel_start); 104 if (gp == NULL) 105 return (NULL); 106 g_topology_unlock(); 107 gp->dumpconf = g_sunlabel_dumpconf; 108 npart = 0; 109 while (1) { /* a trick to allow us to use break */ 110 if (gp->rank != 2 && flags == G_TF_NORMAL) 111 break; 112 j = sizeof secsize; 113 error = g_io_getattr("GEOM::sectorsize", cp, &j, &secsize, tp); 114 if (error) { 115 secsize = 512; 116 printf("g_sunlabel_taste: error %d Sectors are %d bytes\n", 117 error, secsize); 118 } 119 j = sizeof mediasize; 120 error = g_io_getattr("GEOM::mediasize", cp, &j, &mediasize, tp); 121 if (error) { 122 mediasize = 0; 123 printf("g_error %d Mediasize is %lld bytes\n", 124 error, (long long)mediasize); 125 } 126 buf = g_read_data(cp, 0, secsize, &error); 127 if (buf == NULL || error != 0) 128 break; 129 130 /* The second last short is a magic number */ 131 if (g_dec_be2(buf + 508) != 0xdabe) 132 break; 133 /* The shortword parity of the entire thing must be even */ 134 u = 0; 135 for (i = 0; i < 512; i += 2) 136 u ^= g_dec_be2(buf + i); 137 if (u != 0) 138 break; 139 if (bootverbose) { 140 g_hexdump(buf, 128); 141 for (i = 0; i < 8; i++) { 142 printf("part %d %u %u\n", i, 143 g_dec_be4(buf + 444 + i * 8), 144 g_dec_be4(buf + 448 + i * 8)); 145 } 146 printf("v_version = %d\n", g_dec_be4(buf + 128)); 147 printf("v_nparts = %d\n", g_dec_be2(buf + 140)); 148 for (i = 0; i < 8; i++) { 149 printf("v_part[%d] = %d %d\n", 150 i, g_dec_be2(buf + 142 + i * 4), 151 g_dec_be2(buf + 144 + i * 4)); 152 } 153 printf("v_sanity %x\n", g_dec_be4(buf + 186)); 154 printf("v_version = %d\n", g_dec_be4(buf + 128)); 155 printf("v_rpm %d\n", g_dec_be2(buf + 420)); 156 printf("v_totalcyl %d\n", g_dec_be2(buf + 422)); 157 printf("v_cyl %d\n", g_dec_be2(buf + 432)); 158 printf("v_alt %d\n", g_dec_be2(buf + 434)); 159 printf("v_head %d\n", g_dec_be2(buf + 436)); 160 printf("v_sec %d\n", g_dec_be2(buf + 438)); 161 } 162 163 csize = g_dec_be2(buf + 436) * g_dec_be2(buf + 438); 164 165 for (i = 0; i < 8; i++) { 166 v = g_dec_be4(buf + 444 + i * 8); 167 u = g_dec_be4(buf + 448 + i * 8); 168 if (u == 0) 169 continue; 170 npart++; 171 pp2 = g_slice_addslice(gp, i, 172 ((off_t)v * csize) << 9ULL, 173 ((off_t)u) << 9ULL, 174 "%s%c", pp->name, 'a' + i); 175 g_error_provider(pp2, 0); 176 } 177 break; 178 } 179 g_topology_lock(); 180 error = g_access_rel(cp, -1, 0, 0); 181 if (npart > 0) 182 return (gp); 183 g_std_spoiled(cp); 184 return (NULL); 185} 186
| 102 return (NULL); 103 gp = g_slice_new(mp, 8, pp, &cp, &ms, sizeof *ms, g_sunlabel_start); 104 if (gp == NULL) 105 return (NULL); 106 g_topology_unlock(); 107 gp->dumpconf = g_sunlabel_dumpconf; 108 npart = 0; 109 while (1) { /* a trick to allow us to use break */ 110 if (gp->rank != 2 && flags == G_TF_NORMAL) 111 break; 112 j = sizeof secsize; 113 error = g_io_getattr("GEOM::sectorsize", cp, &j, &secsize, tp); 114 if (error) { 115 secsize = 512; 116 printf("g_sunlabel_taste: error %d Sectors are %d bytes\n", 117 error, secsize); 118 } 119 j = sizeof mediasize; 120 error = g_io_getattr("GEOM::mediasize", cp, &j, &mediasize, tp); 121 if (error) { 122 mediasize = 0; 123 printf("g_error %d Mediasize is %lld bytes\n", 124 error, (long long)mediasize); 125 } 126 buf = g_read_data(cp, 0, secsize, &error); 127 if (buf == NULL || error != 0) 128 break; 129 130 /* The second last short is a magic number */ 131 if (g_dec_be2(buf + 508) != 0xdabe) 132 break; 133 /* The shortword parity of the entire thing must be even */ 134 u = 0; 135 for (i = 0; i < 512; i += 2) 136 u ^= g_dec_be2(buf + i); 137 if (u != 0) 138 break; 139 if (bootverbose) { 140 g_hexdump(buf, 128); 141 for (i = 0; i < 8; i++) { 142 printf("part %d %u %u\n", i, 143 g_dec_be4(buf + 444 + i * 8), 144 g_dec_be4(buf + 448 + i * 8)); 145 } 146 printf("v_version = %d\n", g_dec_be4(buf + 128)); 147 printf("v_nparts = %d\n", g_dec_be2(buf + 140)); 148 for (i = 0; i < 8; i++) { 149 printf("v_part[%d] = %d %d\n", 150 i, g_dec_be2(buf + 142 + i * 4), 151 g_dec_be2(buf + 144 + i * 4)); 152 } 153 printf("v_sanity %x\n", g_dec_be4(buf + 186)); 154 printf("v_version = %d\n", g_dec_be4(buf + 128)); 155 printf("v_rpm %d\n", g_dec_be2(buf + 420)); 156 printf("v_totalcyl %d\n", g_dec_be2(buf + 422)); 157 printf("v_cyl %d\n", g_dec_be2(buf + 432)); 158 printf("v_alt %d\n", g_dec_be2(buf + 434)); 159 printf("v_head %d\n", g_dec_be2(buf + 436)); 160 printf("v_sec %d\n", g_dec_be2(buf + 438)); 161 } 162 163 csize = g_dec_be2(buf + 436) * g_dec_be2(buf + 438); 164 165 for (i = 0; i < 8; i++) { 166 v = g_dec_be4(buf + 444 + i * 8); 167 u = g_dec_be4(buf + 448 + i * 8); 168 if (u == 0) 169 continue; 170 npart++; 171 pp2 = g_slice_addslice(gp, i, 172 ((off_t)v * csize) << 9ULL, 173 ((off_t)u) << 9ULL, 174 "%s%c", pp->name, 'a' + i); 175 g_error_provider(pp2, 0); 176 } 177 break; 178 } 179 g_topology_lock(); 180 error = g_access_rel(cp, -1, 0, 0); 181 if (npart > 0) 182 return (gp); 183 g_std_spoiled(cp); 184 return (NULL); 185} 186
|
187static struct g_method g_sunlabel_method = { 188 BSD_METHOD_NAME,
| 187static struct g_class g_sunlabel_class = { 188 BSD_CLASS_NAME,
|
189 g_sunlabel_taste, 190 g_slice_access, 191 g_slice_orphan, 192 NULL,
| 189 g_sunlabel_taste, 190 g_slice_access, 191 g_slice_orphan, 192 NULL,
|
193 G_METHOD_INITSTUFF
| 193 G_CLASS_INITSTUFF
|
194}; 195
| 194}; 195
|
196DECLARE_GEOM_METHOD(g_sunlabel_method, g_sunlabel);
| 196DECLARE_GEOM_CLASS(g_sunlabel_class, g_sunlabel);
|
| |