bt_conv.c revision 1.5 1 1.5 cgd /* $NetBSD: bt_conv.c,v 1.5 1995/02/27 13:20:04 cgd 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.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
40 1.5 cgd #if 0
41 1.4 cgd static char sccsid[] = "@(#)bt_conv.c 8.3 (Berkeley) 5/31/94";
42 1.5 cgd #else
43 1.5 cgd static char rcsid[] = "$NetBSD: bt_conv.c,v 1.5 1995/02/27 13:20:04 cgd Exp $";
44 1.5 cgd #endif
45 1.1 cgd #endif /* LIBC_SCCS and not lint */
46 1.1 cgd
47 1.1 cgd #include <sys/param.h>
48 1.1 cgd
49 1.1 cgd #include <stdio.h>
50 1.1 cgd
51 1.1 cgd #include <db.h>
52 1.1 cgd #include "btree.h"
53 1.1 cgd
54 1.1 cgd static void mswap __P((PAGE *));
55 1.1 cgd
56 1.1 cgd /*
57 1.1 cgd * __BT_BPGIN, __BT_BPGOUT --
58 1.1 cgd * Convert host-specific number layout to/from the host-independent
59 1.1 cgd * format stored on disk.
60 1.1 cgd *
61 1.1 cgd * Parameters:
62 1.1 cgd * t: tree
63 1.1 cgd * pg: page number
64 1.1 cgd * h: page to convert
65 1.1 cgd */
66 1.1 cgd void
67 1.1 cgd __bt_pgin(t, pg, pp)
68 1.1 cgd void *t;
69 1.1 cgd pgno_t pg;
70 1.1 cgd void *pp;
71 1.1 cgd {
72 1.1 cgd PAGE *h;
73 1.4 cgd indx_t i, top;
74 1.1 cgd u_char flags;
75 1.1 cgd char *p;
76 1.1 cgd
77 1.1 cgd if (!ISSET(((BTREE *)t), B_NEEDSWAP))
78 1.1 cgd return;
79 1.1 cgd if (pg == P_META) {
80 1.1 cgd mswap(pp);
81 1.1 cgd return;
82 1.1 cgd }
83 1.1 cgd
84 1.1 cgd h = pp;
85 1.4 cgd M_32_SWAP(h->pgno);
86 1.4 cgd M_32_SWAP(h->prevpg);
87 1.4 cgd M_32_SWAP(h->nextpg);
88 1.4 cgd M_32_SWAP(h->flags);
89 1.4 cgd M_16_SWAP(h->lower);
90 1.4 cgd M_16_SWAP(h->upper);
91 1.1 cgd
92 1.1 cgd top = NEXTINDEX(h);
93 1.1 cgd if ((h->flags & P_TYPE) == P_BINTERNAL)
94 1.1 cgd for (i = 0; i < top; i++) {
95 1.4 cgd M_16_SWAP(h->linp[i]);
96 1.1 cgd p = (char *)GETBINTERNAL(h, i);
97 1.4 cgd P_32_SWAP(p);
98 1.4 cgd p += sizeof(u_int32_t);
99 1.4 cgd P_32_SWAP(p);
100 1.1 cgd p += sizeof(pgno_t);
101 1.1 cgd if (*(u_char *)p & P_BIGKEY) {
102 1.1 cgd p += sizeof(u_char);
103 1.4 cgd P_32_SWAP(p);
104 1.1 cgd p += sizeof(pgno_t);
105 1.4 cgd P_32_SWAP(p);
106 1.1 cgd }
107 1.1 cgd }
108 1.1 cgd else if ((h->flags & P_TYPE) == P_BLEAF)
109 1.1 cgd for (i = 0; i < top; i++) {
110 1.4 cgd M_16_SWAP(h->linp[i]);
111 1.1 cgd p = (char *)GETBLEAF(h, i);
112 1.4 cgd P_32_SWAP(p);
113 1.4 cgd p += sizeof(u_int32_t);
114 1.4 cgd P_32_SWAP(p);
115 1.4 cgd p += sizeof(u_int32_t);
116 1.1 cgd flags = *(u_char *)p;
117 1.1 cgd if (flags & (P_BIGKEY | P_BIGDATA)) {
118 1.1 cgd p += sizeof(u_char);
119 1.1 cgd if (flags & P_BIGKEY) {
120 1.4 cgd P_32_SWAP(p);
121 1.1 cgd p += sizeof(pgno_t);
122 1.4 cgd P_32_SWAP(p);
123 1.1 cgd }
124 1.1 cgd if (flags & P_BIGDATA) {
125 1.4 cgd p += sizeof(u_int32_t);
126 1.4 cgd P_32_SWAP(p);
127 1.1 cgd p += sizeof(pgno_t);
128 1.4 cgd P_32_SWAP(p);
129 1.1 cgd }
130 1.1 cgd }
131 1.1 cgd }
132 1.1 cgd }
133 1.1 cgd
134 1.1 cgd void
135 1.1 cgd __bt_pgout(t, pg, pp)
136 1.1 cgd void *t;
137 1.1 cgd pgno_t pg;
138 1.1 cgd void *pp;
139 1.1 cgd {
140 1.1 cgd PAGE *h;
141 1.4 cgd indx_t i, top;
142 1.1 cgd u_char flags;
143 1.1 cgd char *p;
144 1.1 cgd
145 1.1 cgd if (!ISSET(((BTREE *)t), B_NEEDSWAP))
146 1.1 cgd return;
147 1.1 cgd if (pg == P_META) {
148 1.1 cgd mswap(pp);
149 1.1 cgd return;
150 1.1 cgd }
151 1.1 cgd
152 1.1 cgd h = pp;
153 1.1 cgd top = NEXTINDEX(h);
154 1.1 cgd if ((h->flags & P_TYPE) == P_BINTERNAL)
155 1.1 cgd for (i = 0; i < top; i++) {
156 1.1 cgd p = (char *)GETBINTERNAL(h, i);
157 1.4 cgd P_32_SWAP(p);
158 1.4 cgd p += sizeof(u_int32_t);
159 1.4 cgd P_32_SWAP(p);
160 1.1 cgd p += sizeof(pgno_t);
161 1.1 cgd if (*(u_char *)p & P_BIGKEY) {
162 1.1 cgd p += sizeof(u_char);
163 1.4 cgd P_32_SWAP(p);
164 1.1 cgd p += sizeof(pgno_t);
165 1.4 cgd P_32_SWAP(p);
166 1.1 cgd }
167 1.4 cgd M_16_SWAP(h->linp[i]);
168 1.1 cgd }
169 1.1 cgd else if ((h->flags & P_TYPE) == P_BLEAF)
170 1.1 cgd for (i = 0; i < top; i++) {
171 1.1 cgd p = (char *)GETBLEAF(h, i);
172 1.4 cgd P_32_SWAP(p);
173 1.4 cgd p += sizeof(u_int32_t);
174 1.4 cgd P_32_SWAP(p);
175 1.4 cgd p += sizeof(u_int32_t);
176 1.1 cgd flags = *(u_char *)p;
177 1.1 cgd if (flags & (P_BIGKEY | P_BIGDATA)) {
178 1.1 cgd p += sizeof(u_char);
179 1.1 cgd if (flags & P_BIGKEY) {
180 1.4 cgd P_32_SWAP(p);
181 1.1 cgd p += sizeof(pgno_t);
182 1.4 cgd P_32_SWAP(p);
183 1.1 cgd }
184 1.1 cgd if (flags & P_BIGDATA) {
185 1.4 cgd p += sizeof(u_int32_t);
186 1.4 cgd P_32_SWAP(p);
187 1.1 cgd p += sizeof(pgno_t);
188 1.4 cgd P_32_SWAP(p);
189 1.1 cgd }
190 1.1 cgd }
191 1.4 cgd M_16_SWAP(h->linp[i]);
192 1.1 cgd }
193 1.1 cgd
194 1.4 cgd M_32_SWAP(h->pgno);
195 1.4 cgd M_32_SWAP(h->prevpg);
196 1.4 cgd M_32_SWAP(h->nextpg);
197 1.4 cgd M_32_SWAP(h->flags);
198 1.4 cgd M_16_SWAP(h->lower);
199 1.4 cgd M_16_SWAP(h->upper);
200 1.1 cgd }
201 1.1 cgd
202 1.1 cgd /*
203 1.1 cgd * MSWAP -- Actually swap the bytes on the meta page.
204 1.1 cgd *
205 1.1 cgd * Parameters:
206 1.1 cgd * p: page to convert
207 1.1 cgd */
208 1.1 cgd static void
209 1.1 cgd mswap(pg)
210 1.1 cgd PAGE *pg;
211 1.1 cgd {
212 1.1 cgd char *p;
213 1.1 cgd
214 1.1 cgd p = (char *)pg;
215 1.4 cgd P_32_SWAP(p); /* m_magic */
216 1.4 cgd p += sizeof(u_int32_t);
217 1.4 cgd P_32_SWAP(p); /* m_version */
218 1.4 cgd p += sizeof(u_int32_t);
219 1.4 cgd P_32_SWAP(p); /* m_psize */
220 1.4 cgd p += sizeof(u_int32_t);
221 1.4 cgd P_32_SWAP(p); /* m_free */
222 1.4 cgd p += sizeof(u_int32_t);
223 1.4 cgd P_32_SWAP(p); /* m_nrecs */
224 1.4 cgd p += sizeof(u_int32_t);
225 1.4 cgd P_32_SWAP(p); /* m_flags */
226 1.4 cgd p += sizeof(u_int32_t);
227 1.1 cgd }
228