2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 * @(#)bt_put.c 8.8 (Berkeley) 7/26/94
33 * $DragonFly: src/lib/libc/db/btree/bt_put.c,v 1.8 2005/11/12 23:01:54 swildner Exp $
36 #include <sys/types.h>
46 static EPG *bt_fast (BTREE *, const DBT *, const DBT *, int *);
49 * __BT_PUT -- Add a btree item to the tree.
52 * dbp: pointer to access method
58 * RET_ERROR, RET_SUCCESS and RET_SPECIAL if the key is already in the
59 * tree and R_NOOVERWRITE specified.
62 __bt_put(const DB *dbp, DBT *key, const DBT *data, u_int flags)
70 u_int32_t nbytes, tmp;
71 int dflags, exact, status;
72 char *dest, db[NOVFLSIZE], kb[NOVFLSIZE];
76 /* Toss any page pinned across calls. */
77 if (t->bt_pinned != NULL) {
78 mpool_put(t->bt_mp, t->bt_pinned, 0);
82 /* Check for change to a read-only tree. */
83 if (F_ISSET(t, B_RDONLY)) {
94 * If flags is R_CURSOR, put the cursor. Must already
95 * have started a scan and not have already deleted it.
97 if (F_ISSET(&t->bt_cursor, CURS_INIT) &&
98 !F_ISSET(&t->bt_cursor,
99 CURS_ACQUIRE | CURS_AFTER | CURS_BEFORE))
108 * If the key/data pair won't fit on a page, store it on overflow
109 * pages. Only put the key on the overflow page if the pair are
110 * still too big after moving the data to an overflow page.
113 * If the insert fails later on, the overflow pages aren't recovered.
116 if (key->size + data->size > t->bt_ovflsize) {
117 if (key->size > t->bt_ovflsize) {
118 storekey: if (__ovfl_put(t, key, &pg) == RET_ERROR)
121 tkey.size = NOVFLSIZE;
122 memmove(kb, &pg, sizeof(pgno_t));
124 memmove(kb + sizeof(pgno_t),
125 &tmp, sizeof(u_int32_t));
129 if (key->size + data->size > t->bt_ovflsize) {
130 if (__ovfl_put(t, data, &pg) == RET_ERROR)
133 tdata.size = NOVFLSIZE;
134 memmove(db, &pg, sizeof(pgno_t));
136 memmove(db + sizeof(pgno_t),
137 &tmp, sizeof(u_int32_t));
141 if (key->size + data->size > t->bt_ovflsize)
145 /* Replace the cursor. */
146 if (flags == R_CURSOR) {
147 if ((h = mpool_get(t->bt_mp, t->bt_cursor.pg.pgno, 0)) == NULL)
149 idx = t->bt_cursor.pg.index;
154 * Find the key to delete, or, the location at which to insert.
155 * Bt_fast and __bt_search both pin the returned page.
157 if (t->bt_order == NOT || (e = bt_fast(t, key, data, &exact)) == NULL)
158 if ((e = __bt_search(t, key, &exact)) == NULL)
164 * Add the key/data pair to the tree. If an identical key is already
165 * in the tree, and R_NOOVERWRITE is set, an error is returned. If
166 * R_NOOVERWRITE is not set, the key is either added (if duplicates are
167 * permitted) or an error is returned.
173 mpool_put(t->bt_mp, h, 0);
174 return (RET_SPECIAL);
176 if (!exact || !F_ISSET(t, B_NODUPS))
180 * Note, the delete may empty the page, so we need to put a
181 * new entry into the page immediately.
183 delete: if (__bt_dleaf(t, key, h, idx) == RET_ERROR) {
184 mpool_put(t->bt_mp, h, 0);
191 * If not enough room, or the user has put a ceiling on the number of
192 * keys permitted in the page, split the page. The split code will
193 * insert the key and data and unpin the current page. If inserting
194 * into the offset array, shift the pointers up.
196 nbytes = NBLEAFDBT(key->size, data->size);
197 if ((size_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {
198 if ((status = __bt_split(t, h, key,
199 data, dflags, nbytes, idx)) != RET_SUCCESS)
204 if (idx < (nxtindex = NEXTINDEX(h)))
205 memmove(h->linp + idx + 1, h->linp + idx,
206 (nxtindex - idx) * sizeof(indx_t));
207 h->lower += sizeof(indx_t);
209 h->linp[idx] = h->upper -= nbytes;
210 dest = (char *)h + h->upper;
211 WR_BLEAF(dest, key, data, dflags);
213 /* If the cursor is on this page, adjust it as necessary. */
214 if (F_ISSET(&t->bt_cursor, CURS_INIT) &&
215 !F_ISSET(&t->bt_cursor, CURS_ACQUIRE) &&
216 t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index >= idx)
217 ++t->bt_cursor.pg.index;
219 if (t->bt_order == NOT) {
220 if (h->nextpg == P_INVALID) {
221 if (idx == NEXTINDEX(h) - 1) {
222 t->bt_order = FORWARD;
223 t->bt_last.index = idx;
224 t->bt_last.pgno = h->pgno;
226 } else if (h->prevpg == P_INVALID) {
229 t->bt_last.index = 0;
230 t->bt_last.pgno = h->pgno;
235 mpool_put(t->bt_mp, h, MPOOL_DIRTY);
238 if (flags == R_SETCURSOR)
239 __bt_setcur(t, e->page->pgno, e->index);
241 F_SET(t, B_MODIFIED);
242 return (RET_SUCCESS);
246 u_long bt_cache_hit, bt_cache_miss;
250 * BT_FAST -- Do a quick check for sorted data.
257 * EPG for new record or NULL if not found.
260 bt_fast(BTREE *t, const DBT *key, const DBT *data, int *exactp)
266 if ((h = mpool_get(t->bt_mp, t->bt_last.pgno, 0)) == NULL) {
271 t->bt_cur.index = t->bt_last.index;
274 * If won't fit in this page or have too many keys in this page,
275 * have to search to get split stack.
277 nbytes = NBLEAFDBT(key->size, data->size);
278 if ((size_t)(h->upper - h->lower) < nbytes + sizeof(indx_t))
281 if (t->bt_order == FORWARD) {
282 if (t->bt_cur.page->nextpg != P_INVALID)
284 if (t->bt_cur.index != NEXTINDEX(h) - 1)
286 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) < 0)
288 t->bt_last.index = cmp ? ++t->bt_cur.index : t->bt_cur.index;
290 if (t->bt_cur.page->prevpg != P_INVALID)
292 if (t->bt_cur.index != 0)
294 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) > 0)
296 t->bt_last.index = 0;
309 mpool_put(t->bt_mp, h, 0);