Home | History | Annotate | Line # | Download | only in ahdilabel
check.c revision 1.4.74.1
      1  1.4.74.1     mjf /*	$NetBSD: check.c,v 1.4.74.1 2008/06/02 13:21:57 mjf Exp $	*/
      2       1.1     leo 
      3       1.1     leo /*
      4       1.1     leo  * Copyright (c) 1999 The NetBSD Foundation, Inc.
      5       1.1     leo  * All rights reserved.
      6       1.1     leo  *
      7       1.1     leo  * This code is derived from software contributed to The NetBSD Foundation
      8       1.1     leo  * by Julian Coleman, Waldi Ravens and Leo Weppelman.
      9       1.1     leo  *
     10       1.1     leo  * Redistribution and use in source and binary forms, with or without
     11       1.1     leo  * modification, are permitted provided that the following conditions
     12       1.1     leo  * are met:
     13       1.1     leo  * 1. Redistributions of source code must retain the above copyright
     14       1.1     leo  *    notice, this list of conditions and the following disclaimer.
     15       1.1     leo  * 2. Redistributions in binary form must reproduce the above copyright
     16       1.1     leo  *    notice, this list of conditions and the following disclaimer in the
     17       1.1     leo  *    documentation and/or other materials provided with the distribution.
     18       1.1     leo  *
     19       1.1     leo  * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
     20       1.1     leo  * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
     21       1.1     leo  * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
     22       1.1     leo  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
     23       1.1     leo  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
     24       1.1     leo  * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
     25       1.1     leo  * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
     26       1.1     leo  * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
     27       1.1     leo  * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
     28       1.1     leo  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
     29       1.1     leo  * POSSIBILITY OF SUCH DAMAGE.
     30       1.1     leo  */
     31       1.1     leo 
     32       1.1     leo #include "privahdi.h"
     33       1.1     leo 
     34       1.1     leo /* Partitions which have errors */
     35       1.1     leo int	ahdi_errp1;
     36       1.1     leo int	ahdi_errp2;
     37       1.1     leo 
     38       1.1     leo /*
     39       1.1     leo  * Check partitions for consistency :
     40       1.1     leo  *	GEM vs BGM
     41       1.1     leo  *	Start sector > 2
     42       1.1     leo  *	End sector < secperunit
     43       1.1     leo  *	other partition overlap
     44       1.1     leo  *	auxiliary root overlap
     45       1.1     leo  *	Number of partitions in root/auxiliary root
     46       1.1     leo  */
     47       1.1     leo int
     48       1.1     leo ahdi_checklabel (ptable)
     49       1.1     leo 	struct ahdi_ptable	*ptable;
     50       1.1     leo {
     51       1.1     leo 	int		i, j, rcount, acount;
     52       1.1     leo 	u_int32_t	i_end, j_end;
     53       1.1     leo 
     54       1.1     leo 	ahdi_errp1 = -1;
     55       1.1     leo 	ahdi_errp2 = -1;
     56       1.1     leo 
     57       1.1     leo 	if (ptable->nparts < 1 || ptable->nparts > MAXPARTITIONS)
     58       1.1     leo 		return (-2);
     59       1.1     leo 
     60       1.1     leo 	rcount = 0;
     61       1.1     leo 	acount = 0;
     62       1.1     leo 
     63       1.1     leo 	for (i = 0; i < ptable->nparts; i++) {
     64       1.1     leo 
     65       1.1     leo 		/* GEM vs BGM */
     66       1.1     leo 		if (ptable->parts[i].size > 32768) {
     67       1.1     leo 			if (AHDI_MKPID (ptable->parts[i].id[0],
     68       1.1     leo 			    ptable->parts[i].id[1], ptable->parts[i].id[2])
     69       1.1     leo 			    == AHDI_PID_GEM) {
     70       1.1     leo 				ahdi_errp1 = i;
     71       1.1     leo 				return (-3);
     72       1.1     leo 			}
     73       1.1     leo 		} else {
     74       1.1     leo 			if (AHDI_MKPID (ptable->parts[i].id[0],
     75       1.1     leo 			    ptable->parts[i].id[1], ptable->parts[i].id[2])
     76       1.1     leo 			    == AHDI_PID_BGM) {
     77       1.1     leo 				ahdi_errp1 = i;
     78       1.1     leo 				return (-3);
     79       1.1     leo 			}
     80       1.1     leo 		}
     81       1.1     leo 
     82       1.1     leo 		/* Need 2 free sectors at start for root and bad sector list */
     83       1.1     leo 		if (ptable->parts[i].start < 2) {
     84       1.1     leo 			ahdi_errp1 = i;
     85       1.1     leo 			return (-4);
     86       1.1     leo 		}
     87       1.1     leo 
     88       1.1     leo 		i_end = ptable->parts[i].start + ptable->parts[i].size - 1;
     89       1.1     leo 
     90       1.1     leo 		/* Check partition does not extend past end of disk */
     91       1.2     jdc 		if (i_end >= ptable->secperunit) {
     92       1.1     leo 			ahdi_errp1 = i;
     93       1.1     leo 			return (-5);
     94       1.1     leo 		}
     95       1.1     leo 
     96       1.1     leo 		for (j = i + 1; j < ptable->nparts; j++) {
     97       1.1     leo 			/* Check for overlap with other partitions */
     98       1.1     leo 			j_end = ptable->parts[j].start + ptable->parts[j].size
     99       1.1     leo 			    - 1;
    100       1.1     leo 			if ((ptable->parts[j].start >= ptable->parts[i].start
    101       1.1     leo 			    && ptable->parts[j].start <= i_end) ||
    102       1.1     leo 			    (j_end >= ptable->parts[i].start &&
    103       1.1     leo 			     j_end <= i_end)) {
    104       1.1     leo 				ahdi_errp1 = i;
    105       1.1     leo 				ahdi_errp2 = j;
    106       1.1     leo 				return (-6);
    107       1.1     leo 			}
    108       1.1     leo 			/* Check number of partitions in auxiliary root */
    109       1.1     leo 			if (ptable->parts[i].root &&
    110       1.1     leo 			    ptable->parts[i].root == ptable->parts[j].root) {
    111       1.1     leo 				ahdi_errp1 = i;
    112       1.1     leo 				ahdi_errp2 = j;
    113       1.1     leo 				return (-9);
    114       1.1     leo 			}
    115       1.1     leo 		}
    116       1.1     leo 
    117       1.1     leo 		for (j = i; j < ptable->nparts; j++)
    118       1.1     leo 			/* Check for overlap with auxiliary root(s) */
    119       1.1     leo 			if (ptable->parts[j].root >= ptable->parts[i].start &&
    120       1.1     leo 			    ptable->parts[j].root <= i_end) {
    121       1.1     leo 				ahdi_errp1 = i;
    122       1.1     leo 				return (-7);
    123       1.1     leo 			}
    124       1.1     leo 
    125       1.1     leo 		/* Count partitions in root/auxiliary roots */
    126       1.1     leo 		if (ptable->parts[i].root)
    127       1.3  simonb 			acount++;
    128       1.1     leo 		else
    129       1.3  simonb 			rcount++;
    130       1.1     leo 
    131       1.1     leo 	}
    132       1.1     leo 	/* Check number of partitions in root sector */
    133       1.1     leo 	if (acount)
    134       1.1     leo 		rcount++;
    135       1.1     leo 	if (rcount > 4)
    136       1.1     leo 		return (-8);
    137       1.1     leo 	else
    138       1.1     leo 		return (1);
    139       1.1     leo }
    140