Home | History | Annotate | Line # | Download | only in btree
bt_conv.c revision 1.3
      1  1.1  cgd /*-
      2  1.1  cgd  * Copyright (c) 1990, 1993
      3  1.1  cgd  *	The Regents of the University of California.  All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * This code is derived from software contributed to Berkeley by
      6  1.1  cgd  * Mike Olson.
      7  1.1  cgd  *
      8  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      9  1.1  cgd  * modification, are permitted provided that the following conditions
     10  1.1  cgd  * are met:
     11  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     12  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     13  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     14  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     15  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     16  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     17  1.1  cgd  *    must display the following acknowledgement:
     18  1.1  cgd  *	This product includes software developed by the University of
     19  1.1  cgd  *	California, Berkeley and its contributors.
     20  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     21  1.1  cgd  *    may be used to endorse or promote products derived from this software
     22  1.1  cgd  *    without specific prior written permission.
     23  1.1  cgd  *
     24  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     25  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     26  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     27  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     28  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     29  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     30  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     31  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     32  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     33  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     34  1.1  cgd  * SUCH DAMAGE.
     35  1.1  cgd  */
     36  1.1  cgd 
     37  1.1  cgd #if defined(LIBC_SCCS) && !defined(lint)
     38  1.3  jtc /*static char *sccsid = "from: @(#)bt_conv.c	8.1 (Berkeley) 6/4/93";*/
     39  1.3  jtc static char *rcsid = "$Id: bt_conv.c,v 1.3 1993/08/26 00:43:17 jtc Exp $";
     40  1.1  cgd #endif /* LIBC_SCCS and not lint */
     41  1.1  cgd 
     42  1.1  cgd #include <sys/param.h>
     43  1.1  cgd 
     44  1.1  cgd #include <stdio.h>
     45  1.1  cgd 
     46  1.1  cgd #include <db.h>
     47  1.1  cgd #include "btree.h"
     48  1.1  cgd 
     49  1.1  cgd static void mswap __P((PAGE *));
     50  1.1  cgd 
     51  1.1  cgd /*
     52  1.1  cgd  * __BT_BPGIN, __BT_BPGOUT --
     53  1.1  cgd  *	Convert host-specific number layout to/from the host-independent
     54  1.1  cgd  *	format stored on disk.
     55  1.1  cgd  *
     56  1.1  cgd  * Parameters:
     57  1.1  cgd  *	t:	tree
     58  1.1  cgd  *	pg:	page number
     59  1.1  cgd  *	h:	page to convert
     60  1.1  cgd  */
     61  1.1  cgd void
     62  1.1  cgd __bt_pgin(t, pg, pp)
     63  1.1  cgd 	void *t;
     64  1.1  cgd 	pgno_t pg;
     65  1.1  cgd 	void *pp;
     66  1.1  cgd {
     67  1.1  cgd 	PAGE *h;
     68  1.1  cgd 	int i, top;
     69  1.1  cgd 	u_char flags;
     70  1.1  cgd 	char *p;
     71  1.1  cgd 
     72  1.1  cgd 	if (!ISSET(((BTREE *)t), B_NEEDSWAP))
     73  1.1  cgd 		return;
     74  1.1  cgd 	if (pg == P_META) {
     75  1.1  cgd 		mswap(pp);
     76  1.1  cgd 		return;
     77  1.1  cgd 	}
     78  1.1  cgd 
     79  1.1  cgd 	h = pp;
     80  1.1  cgd 	BLSWAP(h->pgno);
     81  1.1  cgd 	BLSWAP(h->prevpg);
     82  1.1  cgd 	BLSWAP(h->nextpg);
     83  1.1  cgd 	BLSWAP(h->flags);
     84  1.1  cgd 	BSSWAP(h->lower);
     85  1.1  cgd 	BSSWAP(h->upper);
     86  1.1  cgd 
     87  1.1  cgd 	top = NEXTINDEX(h);
     88  1.1  cgd 	if ((h->flags & P_TYPE) == P_BINTERNAL)
     89  1.1  cgd 		for (i = 0; i < top; i++) {
     90  1.1  cgd 			BSSWAP(h->linp[i]);
     91  1.1  cgd 			p = (char *)GETBINTERNAL(h, i);
     92  1.1  cgd 			BLPSWAP(p);
     93  1.1  cgd 			p += sizeof(size_t);
     94  1.1  cgd 			BLPSWAP(p);
     95  1.1  cgd 			p += sizeof(pgno_t);
     96  1.1  cgd 			if (*(u_char *)p & P_BIGKEY) {
     97  1.1  cgd 				p += sizeof(u_char);
     98  1.1  cgd 				BLPSWAP(p);
     99  1.1  cgd 				p += sizeof(pgno_t);
    100  1.1  cgd 				BLPSWAP(p);
    101  1.1  cgd 			}
    102  1.1  cgd 		}
    103  1.1  cgd 	else if ((h->flags & P_TYPE) == P_BLEAF)
    104  1.1  cgd 		for (i = 0; i < top; i++) {
    105  1.1  cgd 			BSSWAP(h->linp[i]);
    106  1.1  cgd 			p = (char *)GETBLEAF(h, i);
    107  1.1  cgd 			BLPSWAP(p);
    108  1.1  cgd 			p += sizeof(size_t);
    109  1.1  cgd 			BLPSWAP(p);
    110  1.1  cgd 			p += sizeof(size_t);
    111  1.1  cgd 			flags = *(u_char *)p;
    112  1.1  cgd 			if (flags & (P_BIGKEY | P_BIGDATA)) {
    113  1.1  cgd 				p += sizeof(u_char);
    114  1.1  cgd 				if (flags & P_BIGKEY) {
    115  1.1  cgd 					BLPSWAP(p);
    116  1.1  cgd 					p += sizeof(pgno_t);
    117  1.1  cgd 					BLPSWAP(p);
    118  1.1  cgd 				}
    119  1.1  cgd 				if (flags & P_BIGDATA) {
    120  1.1  cgd 					p += sizeof(size_t);
    121  1.1  cgd 					BLPSWAP(p);
    122  1.1  cgd 					p += sizeof(pgno_t);
    123  1.1  cgd 					BLPSWAP(p);
    124  1.1  cgd 				}
    125  1.1  cgd 			}
    126  1.1  cgd 		}
    127  1.1  cgd }
    128  1.1  cgd 
    129  1.1  cgd void
    130  1.1  cgd __bt_pgout(t, pg, pp)
    131  1.1  cgd 	void *t;
    132  1.1  cgd 	pgno_t pg;
    133  1.1  cgd 	void *pp;
    134  1.1  cgd {
    135  1.1  cgd 	PAGE *h;
    136  1.1  cgd 	int i, top;
    137  1.1  cgd 	u_char flags;
    138  1.1  cgd 	char *p;
    139  1.1  cgd 
    140  1.1  cgd 	if (!ISSET(((BTREE *)t), B_NEEDSWAP))
    141  1.1  cgd 		return;
    142  1.1  cgd 	if (pg == P_META) {
    143  1.1  cgd 		mswap(pp);
    144  1.1  cgd 		return;
    145  1.1  cgd 	}
    146  1.1  cgd 
    147  1.1  cgd 	h = pp;
    148  1.1  cgd 	top = NEXTINDEX(h);
    149  1.1  cgd 	if ((h->flags & P_TYPE) == P_BINTERNAL)
    150  1.1  cgd 		for (i = 0; i < top; i++) {
    151  1.1  cgd 			p = (char *)GETBINTERNAL(h, i);
    152  1.1  cgd 			BLPSWAP(p);
    153  1.1  cgd 			p += sizeof(size_t);
    154  1.1  cgd 			BLPSWAP(p);
    155  1.1  cgd 			p += sizeof(pgno_t);
    156  1.1  cgd 			if (*(u_char *)p & P_BIGKEY) {
    157  1.1  cgd 				p += sizeof(u_char);
    158  1.1  cgd 				BLPSWAP(p);
    159  1.1  cgd 				p += sizeof(pgno_t);
    160  1.1  cgd 				BLPSWAP(p);
    161  1.1  cgd 			}
    162  1.1  cgd 			BSSWAP(h->linp[i]);
    163  1.1  cgd 		}
    164  1.1  cgd 	else if ((h->flags & P_TYPE) == P_BLEAF)
    165  1.1  cgd 		for (i = 0; i < top; i++) {
    166  1.1  cgd 			p = (char *)GETBLEAF(h, i);
    167  1.1  cgd 			BLPSWAP(p);
    168  1.1  cgd 			p += sizeof(size_t);
    169  1.1  cgd 			BLPSWAP(p);
    170  1.1  cgd 			p += sizeof(size_t);
    171  1.1  cgd 			flags = *(u_char *)p;
    172  1.1  cgd 			if (flags & (P_BIGKEY | P_BIGDATA)) {
    173  1.1  cgd 				p += sizeof(u_char);
    174  1.1  cgd 				if (flags & P_BIGKEY) {
    175  1.1  cgd 					BLPSWAP(p);
    176  1.1  cgd 					p += sizeof(pgno_t);
    177  1.1  cgd 					BLPSWAP(p);
    178  1.1  cgd 				}
    179  1.1  cgd 				if (flags & P_BIGDATA) {
    180  1.1  cgd 					p += sizeof(size_t);
    181  1.1  cgd 					BLPSWAP(p);
    182  1.1  cgd 					p += sizeof(pgno_t);
    183  1.1  cgd 					BLPSWAP(p);
    184  1.1  cgd 				}
    185  1.1  cgd 			}
    186  1.1  cgd 			BSSWAP(h->linp[i]);
    187  1.1  cgd 		}
    188  1.1  cgd 
    189  1.1  cgd 	BLSWAP(h->pgno);
    190  1.1  cgd 	BLSWAP(h->prevpg);
    191  1.1  cgd 	BLSWAP(h->nextpg);
    192  1.1  cgd 	BLSWAP(h->flags);
    193  1.1  cgd 	BSSWAP(h->lower);
    194  1.1  cgd 	BSSWAP(h->upper);
    195  1.1  cgd }
    196  1.1  cgd 
    197  1.1  cgd /*
    198  1.1  cgd  * MSWAP -- Actually swap the bytes on the meta page.
    199  1.1  cgd  *
    200  1.1  cgd  * Parameters:
    201  1.1  cgd  *	p:	page to convert
    202  1.1  cgd  */
    203  1.1  cgd static void
    204  1.1  cgd mswap(pg)
    205  1.1  cgd 	PAGE *pg;
    206  1.1  cgd {
    207  1.1  cgd 	char *p;
    208  1.1  cgd 
    209  1.1  cgd 	p = (char *)pg;
    210  1.1  cgd 	BLPSWAP(p);		/* m_magic */
    211  1.1  cgd 	p += sizeof(u_long);
    212  1.1  cgd 	BLPSWAP(p);		/* m_version */
    213  1.1  cgd 	p += sizeof(u_long);
    214  1.1  cgd 	BLPSWAP(p);		/* m_psize */
    215  1.1  cgd 	p += sizeof(u_long);
    216  1.1  cgd 	BLPSWAP(p);		/* m_free */
    217  1.1  cgd 	p += sizeof(u_long);
    218  1.1  cgd 	BLPSWAP(p);		/* m_nrecs */
    219  1.1  cgd 	p += sizeof(u_long);
    220  1.1  cgd 	BLPSWAP(p);		/* m_flags */
    221  1.1  cgd 	p += sizeof(u_long);
    222  1.1  cgd }
    223