1 /* $NetBSD: build.c,v 1.2 2008/04/28 20:23:15 martin 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 * 19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 29 * POSSIBILITY OF SUCH DAMAGE. 30 */ 31 32 #include "privahdi.h" 33 #include <strings.h> 34 35 /* 36 * Build AHDI auxillary roots (extended partitions). 37 * Always make first 3 partitions real. 38 */ 39 int 40 ahdi_buildlabel (ptable) 41 struct ahdi_ptable *ptable; 42 { 43 int i, j; 44 struct ahdi_ptable old_table; 45 46 /* Copy original ptable */ 47 bcopy (ptable, &old_table, sizeof (struct ahdi_ptable)); 48 49 /* 50 * Adjust partition starts. Do this first because some 51 * partitioning tools (ICD) change the relative ordering of 52 * auxiliary roots vs. partitions. 53 */ 54 for (i = 0; i < ptable->nparts; i++) 55 for (j = 0; j < ptable->nparts; j++) 56 if (ptable->parts[j].start == 57 ptable->parts[i].root + 1) { 58 if (ptable->parts[j].start) 59 ptable->parts[j].start--; 60 if (ptable->parts[j].size) 61 ptable->parts[j].size++; 62 } 63 for (i = 0; i < ptable->nparts; i++) { 64 /* Remove auxiliary roots for first 3 (or all) partitions */ 65 if (i < 3 || (i < 4 && ptable->nparts < 5)) { 66 ptable->parts[i].root = 0; 67 /* Create auxiliary roots for other partitions */ 68 } else { 69 ptable->parts[i].root = ptable->parts[i].start; 70 if (ptable->parts[i].start) 71 ptable->parts[i].start++; 72 if (ptable->parts[i].size) 73 ptable->parts[i].size--; 74 } 75 } 76 77 /* Compare old and new */ 78 for (i = 0; i < ptable->nparts; i++) 79 if (ptable->parts[i].root != old_table.parts[i].root || 80 ptable->parts[i].start != old_table.parts[i].start || 81 ptable->parts[i].size != old_table.parts[i].size) 82 return (1); 83 84 return (0); 85 } 86