1 | #include <machine/rtems-bsd-user-space.h> |
---|
2 | |
---|
3 | /*- |
---|
4 | * Copyright (c) 1990, 1993, 1994 |
---|
5 | * The Regents of the University of California. All rights reserved. |
---|
6 | * |
---|
7 | * Redistribution and use in source and binary forms, with or without |
---|
8 | * modification, are permitted provided that the following conditions |
---|
9 | * are met: |
---|
10 | * 1. Redistributions of source code must retain the above copyright |
---|
11 | * notice, this list of conditions and the following disclaimer. |
---|
12 | * 2. Redistributions in binary form must reproduce the above copyright |
---|
13 | * notice, this list of conditions and the following disclaimer in the |
---|
14 | * documentation and/or other materials provided with the distribution. |
---|
15 | * 4. Neither the name of the University nor the names of its contributors |
---|
16 | * may be used to endorse or promote products derived from this software |
---|
17 | * without specific prior written permission. |
---|
18 | * |
---|
19 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND |
---|
20 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
---|
21 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
---|
22 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE |
---|
23 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL |
---|
24 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS |
---|
25 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) |
---|
26 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
---|
27 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY |
---|
28 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF |
---|
29 | * SUCH DAMAGE. |
---|
30 | */ |
---|
31 | |
---|
32 | #if defined(LIBC_SCCS) && !defined(lint) |
---|
33 | static char sccsid[] = "@(#)rec_put.c 8.7 (Berkeley) 8/18/94"; |
---|
34 | #endif /* LIBC_SCCS and not lint */ |
---|
35 | #include <sys/cdefs.h> |
---|
36 | __FBSDID("$FreeBSD$"); |
---|
37 | |
---|
38 | #include <rtems/bsd/sys/types.h> |
---|
39 | |
---|
40 | #include <errno.h> |
---|
41 | #include <stdio.h> |
---|
42 | #include <stdlib.h> |
---|
43 | #include <string.h> |
---|
44 | |
---|
45 | #include <db.h> |
---|
46 | #include "recno.h" |
---|
47 | |
---|
48 | /* |
---|
49 | * __REC_PUT -- Add a recno item to the tree. |
---|
50 | * |
---|
51 | * Parameters: |
---|
52 | * dbp: pointer to access method |
---|
53 | * key: key |
---|
54 | * data: data |
---|
55 | * flag: R_CURSOR, R_IAFTER, R_IBEFORE, R_NOOVERWRITE |
---|
56 | * |
---|
57 | * Returns: |
---|
58 | * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is |
---|
59 | * already in the tree and R_NOOVERWRITE specified. |
---|
60 | */ |
---|
61 | int |
---|
62 | __rec_put(const DB *dbp, DBT *key, const DBT *data, u_int flags) |
---|
63 | { |
---|
64 | BTREE *t; |
---|
65 | DBT fdata, tdata; |
---|
66 | recno_t nrec; |
---|
67 | int status; |
---|
68 | |
---|
69 | t = dbp->internal; |
---|
70 | |
---|
71 | /* Toss any page pinned across calls. */ |
---|
72 | if (t->bt_pinned != NULL) { |
---|
73 | mpool_put(t->bt_mp, t->bt_pinned, 0); |
---|
74 | t->bt_pinned = NULL; |
---|
75 | } |
---|
76 | |
---|
77 | /* |
---|
78 | * If using fixed-length records, and the record is long, return |
---|
79 | * EINVAL. If it's short, pad it out. Use the record data return |
---|
80 | * memory, it's only short-term. |
---|
81 | */ |
---|
82 | if (F_ISSET(t, R_FIXLEN) && data->size != t->bt_reclen) { |
---|
83 | if (data->size > t->bt_reclen) |
---|
84 | goto einval; |
---|
85 | |
---|
86 | if (t->bt_rdata.size < t->bt_reclen) { |
---|
87 | t->bt_rdata.data = |
---|
88 | reallocf(t->bt_rdata.data, t->bt_reclen); |
---|
89 | if (t->bt_rdata.data == NULL) |
---|
90 | return (RET_ERROR); |
---|
91 | t->bt_rdata.size = t->bt_reclen; |
---|
92 | } |
---|
93 | memmove(t->bt_rdata.data, data->data, data->size); |
---|
94 | memset((char *)t->bt_rdata.data + data->size, |
---|
95 | t->bt_bval, t->bt_reclen - data->size); |
---|
96 | fdata.data = t->bt_rdata.data; |
---|
97 | fdata.size = t->bt_reclen; |
---|
98 | } else { |
---|
99 | fdata.data = data->data; |
---|
100 | fdata.size = data->size; |
---|
101 | } |
---|
102 | |
---|
103 | switch (flags) { |
---|
104 | case R_CURSOR: |
---|
105 | if (!F_ISSET(&t->bt_cursor, CURS_INIT)) |
---|
106 | goto einval; |
---|
107 | nrec = t->bt_cursor.rcursor; |
---|
108 | break; |
---|
109 | case R_SETCURSOR: |
---|
110 | if ((nrec = *(recno_t *)key->data) == 0) |
---|
111 | goto einval; |
---|
112 | break; |
---|
113 | case R_IAFTER: |
---|
114 | if ((nrec = *(recno_t *)key->data) == 0) { |
---|
115 | nrec = 1; |
---|
116 | flags = R_IBEFORE; |
---|
117 | } |
---|
118 | break; |
---|
119 | case 0: |
---|
120 | case R_IBEFORE: |
---|
121 | if ((nrec = *(recno_t *)key->data) == 0) |
---|
122 | goto einval; |
---|
123 | break; |
---|
124 | case R_NOOVERWRITE: |
---|
125 | if ((nrec = *(recno_t *)key->data) == 0) |
---|
126 | goto einval; |
---|
127 | if (nrec <= t->bt_nrecs) |
---|
128 | return (RET_SPECIAL); |
---|
129 | break; |
---|
130 | default: |
---|
131 | einval: errno = EINVAL; |
---|
132 | return (RET_ERROR); |
---|
133 | } |
---|
134 | |
---|
135 | /* |
---|
136 | * Make sure that records up to and including the put record are |
---|
137 | * already in the database. If skipping records, create empty ones. |
---|
138 | */ |
---|
139 | if (nrec > t->bt_nrecs) { |
---|
140 | if (!F_ISSET(t, R_EOF | R_INMEM) && |
---|
141 | t->bt_irec(t, nrec) == RET_ERROR) |
---|
142 | return (RET_ERROR); |
---|
143 | if (nrec > t->bt_nrecs + 1) { |
---|
144 | if (F_ISSET(t, R_FIXLEN)) { |
---|
145 | if ((tdata.data = |
---|
146 | (void *)malloc(t->bt_reclen)) == NULL) |
---|
147 | return (RET_ERROR); |
---|
148 | tdata.size = t->bt_reclen; |
---|
149 | memset(tdata.data, t->bt_bval, tdata.size); |
---|
150 | } else { |
---|
151 | tdata.data = NULL; |
---|
152 | tdata.size = 0; |
---|
153 | } |
---|
154 | while (nrec > t->bt_nrecs + 1) |
---|
155 | if (__rec_iput(t, |
---|
156 | t->bt_nrecs, &tdata, 0) != RET_SUCCESS) |
---|
157 | return (RET_ERROR); |
---|
158 | if (F_ISSET(t, R_FIXLEN)) |
---|
159 | free(tdata.data); |
---|
160 | } |
---|
161 | } |
---|
162 | |
---|
163 | if ((status = __rec_iput(t, nrec - 1, &fdata, flags)) != RET_SUCCESS) |
---|
164 | return (status); |
---|
165 | |
---|
166 | switch (flags) { |
---|
167 | case R_IAFTER: |
---|
168 | nrec++; |
---|
169 | break; |
---|
170 | case R_SETCURSOR: |
---|
171 | t->bt_cursor.rcursor = nrec; |
---|
172 | break; |
---|
173 | } |
---|
174 | |
---|
175 | F_SET(t, R_MODIFIED); |
---|
176 | return (__rec_ret(t, NULL, nrec, key, NULL)); |
---|
177 | } |
---|
178 | |
---|
179 | /* |
---|
180 | * __REC_IPUT -- Add a recno item to the tree. |
---|
181 | * |
---|
182 | * Parameters: |
---|
183 | * t: tree |
---|
184 | * nrec: record number |
---|
185 | * data: data |
---|
186 | * |
---|
187 | * Returns: |
---|
188 | * RET_ERROR, RET_SUCCESS |
---|
189 | */ |
---|
190 | int |
---|
191 | __rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags) |
---|
192 | { |
---|
193 | DBT tdata; |
---|
194 | EPG *e; |
---|
195 | PAGE *h; |
---|
196 | indx_t idx, nxtindex; |
---|
197 | pgno_t pg; |
---|
198 | u_int32_t nbytes; |
---|
199 | int dflags, status; |
---|
200 | char *dest, db[NOVFLSIZE]; |
---|
201 | |
---|
202 | /* |
---|
203 | * If the data won't fit on a page, store it on indirect pages. |
---|
204 | * |
---|
205 | * XXX |
---|
206 | * If the insert fails later on, these pages aren't recovered. |
---|
207 | */ |
---|
208 | if (data->size > t->bt_ovflsize) { |
---|
209 | if (__ovfl_put(t, data, &pg) == RET_ERROR) |
---|
210 | return (RET_ERROR); |
---|
211 | tdata.data = db; |
---|
212 | tdata.size = NOVFLSIZE; |
---|
213 | *(pgno_t *)db = pg; |
---|
214 | *(u_int32_t *)(db + sizeof(pgno_t)) = data->size; |
---|
215 | dflags = P_BIGDATA; |
---|
216 | data = &tdata; |
---|
217 | } else |
---|
218 | dflags = 0; |
---|
219 | |
---|
220 | /* __rec_search pins the returned page. */ |
---|
221 | if ((e = __rec_search(t, nrec, |
---|
222 | nrec > t->bt_nrecs || flags == R_IAFTER || flags == R_IBEFORE ? |
---|
223 | SINSERT : SEARCH)) == NULL) |
---|
224 | return (RET_ERROR); |
---|
225 | |
---|
226 | h = e->page; |
---|
227 | idx = e->index; |
---|
228 | |
---|
229 | /* |
---|
230 | * Add the specified key/data pair to the tree. The R_IAFTER and |
---|
231 | * R_IBEFORE flags insert the key after/before the specified key. |
---|
232 | * |
---|
233 | * Pages are split as required. |
---|
234 | */ |
---|
235 | switch (flags) { |
---|
236 | case R_IAFTER: |
---|
237 | ++idx; |
---|
238 | break; |
---|
239 | case R_IBEFORE: |
---|
240 | break; |
---|
241 | default: |
---|
242 | if (nrec < t->bt_nrecs && |
---|
243 | __rec_dleaf(t, h, idx) == RET_ERROR) { |
---|
244 | mpool_put(t->bt_mp, h, 0); |
---|
245 | return (RET_ERROR); |
---|
246 | } |
---|
247 | break; |
---|
248 | } |
---|
249 | |
---|
250 | /* |
---|
251 | * If not enough room, split the page. The split code will insert |
---|
252 | * the key and data and unpin the current page. If inserting into |
---|
253 | * the offset array, shift the pointers up. |
---|
254 | */ |
---|
255 | nbytes = NRLEAFDBT(data->size); |
---|
256 | if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) { |
---|
257 | status = __bt_split(t, h, NULL, data, dflags, nbytes, idx); |
---|
258 | if (status == RET_SUCCESS) |
---|
259 | ++t->bt_nrecs; |
---|
260 | return (status); |
---|
261 | } |
---|
262 | |
---|
263 | if (idx < (nxtindex = NEXTINDEX(h))) |
---|
264 | memmove(h->linp + idx + 1, h->linp + idx, |
---|
265 | (nxtindex - idx) * sizeof(indx_t)); |
---|
266 | h->lower += sizeof(indx_t); |
---|
267 | |
---|
268 | h->linp[idx] = h->upper -= nbytes; |
---|
269 | dest = (char *)h + h->upper; |
---|
270 | WR_RLEAF(dest, data, dflags); |
---|
271 | |
---|
272 | ++t->bt_nrecs; |
---|
273 | F_SET(t, B_MODIFIED); |
---|
274 | mpool_put(t->bt_mp, h, MPOOL_DIRTY); |
---|
275 | |
---|
276 | return (RET_SUCCESS); |
---|
277 | } |
---|