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