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