1 /*-
2 * SPDX-License-Identifier: BSD-3-Clause
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 * 3. 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 #include <sys/types.h>
37
38 #include <errno.h>
39 #include <stdio.h>
40 #include <stdlib.h>
41 #include <string.h>
42
43 #include <db.h>
44 #include "recno.h"
45
46 /*
47 * __REC_PUT -- Add a recno item to the tree.
48 *
49 * Parameters:
50 * dbp: pointer to access method
51 * key: key
52 * data: data
53 * flag: R_CURSOR, R_IAFTER, R_IBEFORE, R_NOOVERWRITE
54 *
55 * Returns:
56 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is
57 * already in the tree and R_NOOVERWRITE specified.
58 */
59 int
__rec_put(const DB * dbp,DBT * key,const DBT * data,u_int flags)60 __rec_put(const DB *dbp, DBT *key, const DBT *data, u_int flags)
61 {
62 BTREE *t;
63 DBT fdata, tdata;
64 recno_t nrec;
65 int status;
66
67 t = dbp->internal;
68
69 /* Toss any page pinned across calls. */
70 if (t->bt_pinned != NULL) {
71 mpool_put(t->bt_mp, t->bt_pinned, 0);
72 t->bt_pinned = NULL;
73 }
74
75 /*
76 * If using fixed-length records, and the record is long, return
77 * EINVAL. If it's short, pad it out. Use the record data return
78 * memory, it's only short-term.
79 */
80 if (F_ISSET(t, R_FIXLEN) && data->size != t->bt_reclen) {
81 if (data->size > t->bt_reclen)
82 goto einval;
83
84 if (t->bt_rdata.size < t->bt_reclen) {
85 t->bt_rdata.data =
86 reallocf(t->bt_rdata.data, t->bt_reclen);
87 if (t->bt_rdata.data == NULL)
88 return (RET_ERROR);
89 t->bt_rdata.size = t->bt_reclen;
90 }
91 memmove(t->bt_rdata.data, data->data, data->size);
92 memset((char *)t->bt_rdata.data + data->size,
93 t->bt_bval, t->bt_reclen - data->size);
94 fdata.data = t->bt_rdata.data;
95 fdata.size = t->bt_reclen;
96 } else {
97 fdata.data = data->data;
98 fdata.size = data->size;
99 }
100
101 switch (flags) {
102 case R_CURSOR:
103 if (!F_ISSET(&t->bt_cursor, CURS_INIT))
104 goto einval;
105 nrec = t->bt_cursor.rcursor;
106 break;
107 case R_SETCURSOR:
108 if ((nrec = *(recno_t *)key->data) == 0)
109 goto einval;
110 break;
111 case R_IAFTER:
112 if ((nrec = *(recno_t *)key->data) == 0) {
113 nrec = 1;
114 flags = R_IBEFORE;
115 }
116 break;
117 case 0:
118 case R_IBEFORE:
119 if ((nrec = *(recno_t *)key->data) == 0)
120 goto einval;
121 break;
122 case R_NOOVERWRITE:
123 if ((nrec = *(recno_t *)key->data) == 0)
124 goto einval;
125 if (nrec <= t->bt_nrecs)
126 return (RET_SPECIAL);
127 break;
128 default:
129 einval: errno = EINVAL;
130 return (RET_ERROR);
131 }
132
133 /*
134 * Make sure that records up to and including the put record are
135 * already in the database. If skipping records, create empty ones.
136 */
137 if (nrec > t->bt_nrecs) {
138 if (!F_ISSET(t, R_EOF | R_INMEM) &&
139 t->bt_irec(t, nrec) == RET_ERROR)
140 return (RET_ERROR);
141 if (nrec > t->bt_nrecs + 1) {
142 if (F_ISSET(t, R_FIXLEN)) {
143 if ((tdata.data = malloc(t->bt_reclen)) == NULL)
144 return (RET_ERROR);
145 tdata.size = t->bt_reclen;
146 memset(tdata.data, t->bt_bval, tdata.size);
147 } else {
148 tdata.data = NULL;
149 tdata.size = 0;
150 }
151 while (nrec > t->bt_nrecs + 1)
152 if (__rec_iput(t,
153 t->bt_nrecs, &tdata, 0) != RET_SUCCESS)
154 return (RET_ERROR);
155 if (F_ISSET(t, R_FIXLEN))
156 free(tdata.data);
157 }
158 }
159
160 if ((status = __rec_iput(t, nrec - 1, &fdata, flags)) != RET_SUCCESS)
161 return (status);
162
163 switch (flags) {
164 case R_IAFTER:
165 nrec++;
166 break;
167 case R_SETCURSOR:
168 t->bt_cursor.rcursor = nrec;
169 break;
170 }
171
172 F_SET(t, R_MODIFIED);
173 return (__rec_ret(t, NULL, nrec, key, NULL));
174 }
175
176 /*
177 * __REC_IPUT -- Add a recno item to the tree.
178 *
179 * Parameters:
180 * t: tree
181 * nrec: record number
182 * data: data
183 *
184 * Returns:
185 * RET_ERROR, RET_SUCCESS
186 */
187 int
__rec_iput(BTREE * t,recno_t nrec,const DBT * data,u_int flags)188 __rec_iput(BTREE *t, recno_t nrec, const DBT *data, u_int flags)
189 {
190 DBT tdata;
191 EPG *e;
192 PAGE *h;
193 indx_t idx, nxtindex;
194 pgno_t pg;
195 u_int32_t nbytes;
196 int dflags, status;
197 char *dest, db[NOVFLSIZE];
198
199 /*
200 * If the data won't fit on a page, store it on indirect pages.
201 *
202 * XXX
203 * If the insert fails later on, these pages aren't recovered.
204 */
205 if (data->size > t->bt_ovflsize) {
206 if (__ovfl_put(t, data, &pg) == RET_ERROR)
207 return (RET_ERROR);
208 tdata.data = db;
209 tdata.size = NOVFLSIZE;
210 memcpy(db, &pg, sizeof(pg));
211 *(u_int32_t *)(db + sizeof(pgno_t)) = data->size;
212 dflags = P_BIGDATA;
213 data = &tdata;
214 } else
215 dflags = 0;
216
217 /* __rec_search pins the returned page. */
218 if ((e = __rec_search(t, nrec,
219 nrec > t->bt_nrecs || flags == R_IAFTER || flags == R_IBEFORE ?
220 SINSERT : SEARCH)) == NULL)
221 return (RET_ERROR);
222
223 h = e->page;
224 idx = e->index;
225
226 /*
227 * Add the specified key/data pair to the tree. The R_IAFTER and
228 * R_IBEFORE flags insert the key after/before the specified key.
229 *
230 * Pages are split as required.
231 */
232 switch (flags) {
233 case R_IAFTER:
234 ++idx;
235 break;
236 case R_IBEFORE:
237 break;
238 default:
239 if (nrec < t->bt_nrecs &&
240 __rec_dleaf(t, h, idx) == RET_ERROR) {
241 mpool_put(t->bt_mp, h, 0);
242 return (RET_ERROR);
243 }
244 break;
245 }
246
247 /*
248 * If not enough room, split the page. The split code will insert
249 * the key and data and unpin the current page. If inserting into
250 * the offset array, shift the pointers up.
251 */
252 nbytes = NRLEAFDBT(data->size);
253 if ((u_int32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
254 status = __bt_split(t, h, NULL, data, dflags, nbytes, idx);
255 if (status == RET_SUCCESS)
256 ++t->bt_nrecs;
257 return (status);
258 }
259
260 if (idx < (nxtindex = NEXTINDEX(h)))
261 memmove(h->linp + idx + 1, h->linp + idx,
262 (nxtindex - idx) * sizeof(indx_t));
263 h->lower += sizeof(indx_t);
264
265 h->linp[idx] = h->upper -= nbytes;
266 dest = (char *)h + h->upper;
267 WR_RLEAF(dest, data, dflags);
268
269 ++t->bt_nrecs;
270 F_SET(t, B_MODIFIED);
271 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
272
273 return (RET_SUCCESS);
274 }
275