1 /* $NetBSD: build.c,v 1.1.1.1 2000/08/07 09:23:40 leo Exp $ */ 2 3 /* 4 * Copyright (c) 1999 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Julian Coleman, Waldi Ravens and Leo Weppelman. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 #include "privahdi.h" 40 #include <strings.h> 41 42 /* 43 * Build AHDI auxillary roots (extended partitions). 44 * Always make first 3 partitions real. 45 */ 46 int 47 ahdi_buildlabel (ptable) 48 struct ahdi_ptable *ptable; 49 { 50 int i, j; 51 struct ahdi_ptable old_table; 52 53 /* Copy original ptable */ 54 bcopy (ptable, &old_table, sizeof (struct ahdi_ptable)); 55 56 /* 57 * Adjust partition starts. Do this first because some 58 * partitioning tools (ICD) change the relative ordering of 59 * auxiliary roots vs. partitions. 60 */ 61 for (i = 0; i < ptable->nparts; i++) 62 for (j = 0; j < ptable->nparts; j++) 63 if (ptable->parts[j].start == 64 ptable->parts[i].root + 1) { 65 if (ptable->parts[j].start) 66 ptable->parts[j].start--; 67 if (ptable->parts[j].size) 68 ptable->parts[j].size++; 69 } 70 for (i = 0; i < ptable->nparts; i++) { 71 /* Remove auxiliary roots for first 3 (or all) partitions */ 72 if (i < 3 || (i < 4 && ptable->nparts < 5)) { 73 ptable->parts[i].root = 0; 74 /* Create auxiliary roots for other partitions */ 75 } else { 76 ptable->parts[i].root = ptable->parts[i].start; 77 if (ptable->parts[i].start) 78 ptable->parts[i].start++; 79 if (ptable->parts[i].size) 80 ptable->parts[i].size--; 81 } 82 } 83 84 /* Compare old and new */ 85 for (i = 0; i < ptable->nparts; i++) 86 if (ptable->parts[i].root != old_table.parts[i].root || 87 ptable->parts[i].start != old_table.parts[i].start || 88 ptable->parts[i].size != old_table.parts[i].size) 89 return (1); 90 91 return (0); 92 } 93