2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * @(#)rec_put.c 8.7 (Berkeley) 8/18/94
34 * $FreeBSD: src/lib/libc/db/recno/rec_put.c,v 1.4.6.1 2001/01/02 05:13:25 peter Exp $
35 * $DragonFly: src/lib/libcr/db/recno/Attic/rec_put.c,v 1.2 2003/06/17 04:26:42 dillon Exp $
38 #include <sys/types.h>
49 * __REC_PUT -- Add a recno item to the tree.
52 * dbp: pointer to access method
55 * flag: R_CURSOR, R_IAFTER, R_IBEFORE, R_NOOVERWRITE
58 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is
59 * already in the tree and R_NOOVERWRITE specified.
62 __rec_put(dbp, key, data, flags)
75 /* Toss any page pinned across calls. */
76 if (t->bt_pinned != NULL) {
77 mpool_put(t->bt_mp, t->bt_pinned, 0);
82 * If using fixed-length records, and the record is long, return
83 * EINVAL. If it's short, pad it out. Use the record data return
84 * memory, it's only short-term.
86 if (F_ISSET(t, R_FIXLEN) && data->size != t->bt_reclen) {
87 if (data->size > t->bt_reclen)
90 if (t->bt_rdata.size < t->bt_reclen) {
92 reallocf(t->bt_rdata.data, t->bt_reclen);
93 if (t->bt_rdata.data == NULL)
95 t->bt_rdata.size = t->bt_reclen;
97 memmove(t->bt_rdata.data, data->data, data->size);
98 memset((char *)t->bt_rdata.data + data->size,
99 t->bt_bval, t->bt_reclen - data->size);
100 fdata.data = t->bt_rdata.data;
101 fdata.size = t->bt_reclen;
103 fdata.data = data->data;
104 fdata.size = data->size;
109 if (!F_ISSET(&t->bt_cursor, CURS_INIT))
111 nrec = t->bt_cursor.rcursor;
114 if ((nrec = *(recno_t *)key->data) == 0)
118 if ((nrec = *(recno_t *)key->data) == 0) {
125 if ((nrec = *(recno_t *)key->data) == 0)
129 if ((nrec = *(recno_t *)key->data) == 0)
131 if (nrec <= t->bt_nrecs)
132 return (RET_SPECIAL);
135 einval: errno = EINVAL;
140 * Make sure that records up to and including the put record are
141 * already in the database. If skipping records, create empty ones.
143 if (nrec > t->bt_nrecs) {
144 if (!F_ISSET(t, R_EOF | R_INMEM) &&
145 t->bt_irec(t, nrec) == RET_ERROR)
147 if (nrec > t->bt_nrecs + 1) {
148 if (F_ISSET(t, R_FIXLEN)) {
150 (void *)malloc(t->bt_reclen)) == NULL)
152 tdata.size = t->bt_reclen;
153 memset(tdata.data, t->bt_bval, tdata.size);
158 while (nrec > t->bt_nrecs + 1)
160 t->bt_nrecs, &tdata, 0) != RET_SUCCESS)
162 if (F_ISSET(t, R_FIXLEN))
167 if ((status = __rec_iput(t, nrec - 1, &fdata, flags)) != RET_SUCCESS)
175 t->bt_cursor.rcursor = nrec;
179 F_SET(t, R_MODIFIED);
180 return (__rec_ret(t, NULL, nrec, key, NULL));
184 * __REC_IPUT -- Add a recno item to the tree.
188 * nrec: record number
192 * RET_ERROR, RET_SUCCESS
195 __rec_iput(t, nrec, data, flags)
204 indx_t index, nxtindex;
208 char *dest, db[NOVFLSIZE];
211 * If the data won't fit on a page, store it on indirect pages.
214 * If the insert fails later on, these pages aren't recovered.
216 if (data->size > t->bt_ovflsize) {
217 if (__ovfl_put(t, data, &pg) == RET_ERROR)
220 tdata.size = NOVFLSIZE;
222 *(u_int32_t *)(db + sizeof(pgno_t)) = data->size;
228 /* __rec_search pins the returned page. */
229 if ((e = __rec_search(t, nrec,
230 nrec > t->bt_nrecs || flags == R_IAFTER || flags == R_IBEFORE ?
231 SINSERT : SEARCH)) == NULL)
238 * Add the specified key/data pair to the tree. The R_IAFTER and
239 * R_IBEFORE flags insert the key after/before the specified key.
241 * Pages are split as required.
250 if (nrec < t->bt_nrecs &&
251 __rec_dleaf(t, h, index) == RET_ERROR) {
252 mpool_put(t->bt_mp, h, 0);
259 * If not enough room, split the page. The split code will insert
260 * the key and data and unpin the current page. If inserting into
261 * the offset array, shift the pointers up.
263 nbytes = NRLEAFDBT(data->size);
264 if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
265 status = __bt_split(t, h, NULL, data, dflags, nbytes, index);
266 if (status == RET_SUCCESS)
271 if (index < (nxtindex = NEXTINDEX(h)))
272 memmove(h->linp + index + 1, h->linp + index,
273 (nxtindex - index) * sizeof(indx_t));
274 h->lower += sizeof(indx_t);
276 h->linp[index] = h->upper -= nbytes;
277 dest = (char *)h + h->upper;
278 WR_RLEAF(dest, data, dflags);
281 F_SET(t, B_MODIFIED);
282 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
284 return (RET_SUCCESS);