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 *
|
82{ 83 struct g_slicer *gsp; 84 struct g_sunlabel_softc *ms; 85 86 gsp = gp->softc; 87 ms = gsp->softc; 88 g_slice_dumpconf(sb, indent, gp, cp, pp); 89 if (indent == NULL) { 90 sbuf_printf(sb, " sc %u hd %u alt %u", 91 ms->nsects, ms->nheads, ms->nalt); 92 } 93} 94 95static struct g_geom * 96g_sunlabel_taste(struct g_class *mp, struct g_provider *pp, int flags) 97{ 98 struct g_geom *gp; 99 struct g_consumer *cp; 100 struct g_provider *pp2; 101 int error, i, npart; 102 u_char *buf; 103 struct g_sunlabel_softc *ms; 104 u_int sectorsize, u, v, csize; 105 off_t mediasize; 106 struct g_slicer *gsp; 107 108 g_trace(G_T_TOPOLOGY, "g_sunlabel_taste(%s,%s)", mp->name, pp->name); 109 g_topology_assert(); 110 if (flags == G_TF_NORMAL && 111 !strcmp(pp->geom->class->name, SUNLABEL_CLASS_NAME)) 112 return (NULL); 113 gp = g_slice_new(mp, 8, pp, &cp, &ms, sizeof *ms, g_sunlabel_start); 114 if (gp == NULL) 115 return (NULL); 116 gsp = gp->softc; 117 g_topology_unlock(); 118 gp->dumpconf = g_sunlabel_dumpconf; 119 npart = 0; 120 while (1) { /* a trick to allow us to use break */ 121 if (gp->rank != 2 && flags == G_TF_NORMAL) 122 break; 123 sectorsize = cp->provider->sectorsize; 124 if (sectorsize < 512) 125 break; 126 gsp->frontstuff = 16 * sectorsize; 127 mediasize = cp->provider->mediasize; 128 buf = g_read_data(cp, 0, sectorsize, &error); 129 if (buf == NULL || error != 0) 130 break; 131 132 /* The second last short is a magic number */ 133 if (g_dec_be2(buf + 508) != 0xdabe) 134 break; 135 /* The shortword parity of the entire thing must be even */ 136 u = 0; 137 for (i = 0; i < 512; i += 2) 138 u ^= g_dec_be2(buf + i); 139 if (u != 0) 140 break; 141 if (bootverbose) { 142 g_hexdump(buf, 128); 143 for (i = 0; i < 8; i++) { 144 printf("part %d %u %u\n", i, 145 g_dec_be4(buf + 444 + i * 8), 146 g_dec_be4(buf + 448 + i * 8)); 147 } 148 printf("v_version = %d\n", g_dec_be4(buf + 128)); 149 printf("v_nparts = %d\n", g_dec_be2(buf + 140)); 150 for (i = 0; i < 8; i++) { 151 printf("v_part[%d] = %d %d\n", 152 i, g_dec_be2(buf + 142 + i * 4), 153 g_dec_be2(buf + 144 + i * 4)); 154 } 155 printf("v_sanity %x\n", g_dec_be4(buf + 186)); 156 printf("v_version = %d\n", g_dec_be4(buf + 128)); 157 printf("v_rpm %d\n", g_dec_be2(buf + 420)); 158 printf("v_totalcyl %d\n", g_dec_be2(buf + 422)); 159 printf("v_cyl %d\n", g_dec_be2(buf + 432)); 160 printf("v_alt %d\n", g_dec_be2(buf + 434)); 161 printf("v_head %d\n", g_dec_be2(buf + 436)); 162 printf("v_sec %d\n", g_dec_be2(buf + 438)); 163 } 164 ms->nalt = g_dec_be2(buf + 434); 165 ms->nheads = g_dec_be2(buf + 436); 166 ms->nsects = g_dec_be2(buf + 438); 167 168 csize = ms->nheads * ms->nsects; 169 170 for (i = 0; i < 8; i++) { 171 v = g_dec_be4(buf + 444 + i * 8); 172 u = g_dec_be4(buf + 448 + i * 8); 173 if (u == 0) 174 continue; 175 npart++; 176 g_topology_lock(); 177 pp2 = g_slice_addslice(gp, i, 178 ((off_t)v * csize) << 9ULL, 179 ((off_t)u) << 9ULL, 180 sectorsize, 181 "%s%c", pp->name, 'a' + i); 182 g_topology_unlock(); 183 g_error_provider(pp2, 0); 184 } 185 break; 186 } 187 g_topology_lock(); 188 error = g_access_rel(cp, -1, 0, 0); 189 if (npart > 0) 190 return (gp); 191 g_std_spoiled(cp); 192 return (NULL); 193} 194 195static struct g_class g_sunlabel_class = { 196 SUNLABEL_CLASS_NAME, 197 g_sunlabel_taste, 198 NULL, 199 G_CLASS_INITIALIZER 200}; 201 202DECLARE_GEOM_CLASS(g_sunlabel_class, g_sunlabel);
|