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