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
34 #if defined(LIBC_SCCS) && !defined(lint)
35 static char sccsid
[] = "@(#)rec_put.c 8.7 (Berkeley) 8/18/94";
36 #endif /* LIBC_SCCS and not lint */
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
) {
91 t
->bt_rdata
.data
= t
->bt_rdata
.data
== NULL
?
92 malloc(t
->bt_reclen
) :
93 realloc(t
->bt_rdata
.data
, t
->bt_reclen
);
94 if (t
->bt_rdata
.data
== NULL
)
96 t
->bt_rdata
.size
= t
->bt_reclen
;
98 memmove(t
->bt_rdata
.data
, data
->data
, data
->size
);
99 memset((char *)t
->bt_rdata
.data
+ data
->size
,
100 t
->bt_bval
, t
->bt_reclen
- data
->size
);
101 fdata
.data
= t
->bt_rdata
.data
;
102 fdata
.size
= t
->bt_reclen
;
104 fdata
.data
= data
->data
;
105 fdata
.size
= data
->size
;
110 if (!F_ISSET(&t
->bt_cursor
, CURS_INIT
))
112 nrec
= t
->bt_cursor
.rcursor
;
115 if ((nrec
= *(recno_t
*)key
->data
) == 0)
119 if ((nrec
= *(recno_t
*)key
->data
) == 0) {
126 if ((nrec
= *(recno_t
*)key
->data
) == 0)
130 if ((nrec
= *(recno_t
*)key
->data
) == 0)
132 if (nrec
<= t
->bt_nrecs
)
133 return (RET_SPECIAL
);
136 einval
: errno
= EINVAL
;
141 * Make sure that records up to and including the put record are
142 * already in the database. If skipping records, create empty ones.
144 if (nrec
> t
->bt_nrecs
) {
145 if (!F_ISSET(t
, R_EOF
| R_INMEM
) &&
146 t
->bt_irec(t
, nrec
) == RET_ERROR
)
148 if (nrec
> t
->bt_nrecs
+ 1) {
149 if (F_ISSET(t
, R_FIXLEN
)) {
151 (void *)malloc(t
->bt_reclen
)) == NULL
)
153 tdata
.size
= t
->bt_reclen
;
154 memset(tdata
.data
, t
->bt_bval
, tdata
.size
);
159 while (nrec
> t
->bt_nrecs
+ 1)
161 t
->bt_nrecs
, &tdata
, 0) != RET_SUCCESS
)
163 if (F_ISSET(t
, R_FIXLEN
))
168 if ((status
= __rec_iput(t
, nrec
- 1, &fdata
, flags
)) != RET_SUCCESS
)
171 if (flags
== R_SETCURSOR
)
172 t
->bt_cursor
.rcursor
= nrec
;
174 F_SET(t
, R_MODIFIED
);
175 return (__rec_ret(t
, NULL
, nrec
, key
, NULL
));
179 * __REC_IPUT -- Add a recno item to the tree.
183 * nrec: record number
187 * RET_ERROR, RET_SUCCESS
190 __rec_iput(t
, nrec
, data
, flags
)
199 indx_t index
, nxtindex
;
203 char *dest
, db
[NOVFLSIZE
];
206 * If the data won't fit on a page, store it on indirect pages.
209 * If the insert fails later on, these pages aren't recovered.
211 if (data
->size
> t
->bt_ovflsize
) {
212 if (__ovfl_put(t
, data
, &pg
) == RET_ERROR
)
215 tdata
.size
= NOVFLSIZE
;
217 *(u_int32_t
*)(db
+ sizeof(pgno_t
)) = data
->size
;
223 /* __rec_search pins the returned page. */
224 if ((e
= __rec_search(t
, nrec
,
225 nrec
> t
->bt_nrecs
|| flags
== R_IAFTER
|| flags
== R_IBEFORE
?
226 SINSERT
: SEARCH
)) == NULL
)
233 * Add the specified key/data pair to the tree. The R_IAFTER and
234 * R_IBEFORE flags insert the key after/before the specified key.
236 * Pages are split as required.
245 if (nrec
< t
->bt_nrecs
&&
246 __rec_dleaf(t
, h
, index
) == RET_ERROR
) {
247 mpool_put(t
->bt_mp
, h
, 0);
254 * If not enough room, split the page. The split code will insert
255 * the key and data and unpin the current page. If inserting into
256 * the offset array, shift the pointers up.
258 nbytes
= NRLEAFDBT(data
->size
);
259 if (h
->upper
- h
->lower
< nbytes
+ sizeof(indx_t
)) {
260 status
= __bt_split(t
, h
, NULL
, data
, dflags
, nbytes
, index
);
261 if (status
== RET_SUCCESS
)
266 if (index
< (nxtindex
= NEXTINDEX(h
)))
267 memmove(h
->linp
+ index
+ 1, h
->linp
+ index
,
268 (nxtindex
- index
) * sizeof(indx_t
));
269 h
->lower
+= sizeof(indx_t
);
271 h
->linp
[index
] = h
->upper
-= nbytes
;
272 dest
= (char *)h
+ h
->upper
;
273 WR_RLEAF(dest
, data
, dflags
);
276 F_SET(t
, B_MODIFIED
);
277 mpool_put(t
->bt_mp
, h
, MPOOL_DIRTY
);
279 return (RET_SUCCESS
);