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 */ 39int 40ahdi_buildlabel (struct ahdi_ptable *ptable) 41{ 42 int i, j; 43 struct ahdi_ptable old_table; 44 45 /* Copy original ptable */ 46 bcopy (ptable, &old_table, sizeof (struct ahdi_ptable)); 47 48 /* 49 * Adjust partition starts. Do this first because some 50 * partitioning tools (ICD) change the relative ordering of 51 * auxiliary roots vs. partitions. 52 */ 53 for (i = 0; i < ptable->nparts; i++) 54 for (j = 0; j < ptable->nparts; j++) 55 if (ptable->parts[j].start == 56 ptable->parts[i].root + 1) { 57 if (ptable->parts[j].start) 58 ptable->parts[j].start--; 59 if (ptable->parts[j].size) 60 ptable->parts[j].size++; 61 } 62 for (i = 0; i < ptable->nparts; i++) { 63 /* Remove auxiliary roots for first 3 (or all) partitions */ 64 if (i < 3 || (i < 4 && ptable->nparts < 5)) { 65 ptable->parts[i].root = 0; 66 /* Create auxiliary roots for other partitions */ 67 } else { 68 ptable->parts[i].root = ptable->parts[i].start; 69 if (ptable->parts[i].start) 70 ptable->parts[i].start++; 71 if (ptable->parts[i].size) 72 ptable->parts[i].size--; 73 } 74 } 75 76 /* Compare old and new */ 77 for (i = 0; i < ptable->nparts; i++) 78 if (ptable->parts[i].root != old_table.parts[i].root || 79 ptable->parts[i].start != old_table.parts[i].start || 80 ptable->parts[i].size != old_table.parts[i].size) 81 return (1); 82 83 return (0); 84} 85