Deleted Added
sdiff udiff text old ( 1573 ) new ( 14272 )
full compact
rec_utils.c (1573) rec_utils.c (14272)
1/*-
1/*-
2 * Copyright (c) 1990, 1993
2 * Copyright (c) 1990, 1993, 1994
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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

--- 16 unchanged lines hidden (view full) ---

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
31 * SUCH DAMAGE.
32 */
33
34#if defined(LIBC_SCCS) && !defined(lint)
3 * The Regents of the University of California. All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
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

--- 16 unchanged lines hidden (view full) ---

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
31 * SUCH DAMAGE.
32 */
33
34#if defined(LIBC_SCCS) && !defined(lint)
35static char sccsid[] = "@(#)rec_utils.c 8.3 (Berkeley) 2/21/94";
35static char sccsid[] = "@(#)rec_utils.c 8.6 (Berkeley) 7/16/94";
36#endif /* LIBC_SCCS and not lint */
37
38#include <sys/param.h>
39
40#include <stdio.h>
41#include <stdlib.h>
42#include <string.h>
43
44#include <db.h>
45#include "recno.h"
46
47/*
36#endif /* LIBC_SCCS and not lint */
37
38#include <sys/param.h>
39
40#include <stdio.h>
41#include <stdlib.h>
42#include <string.h>
43
44#include <db.h>
45#include "recno.h"
46
47/*
48 * __REC_RET -- Build return data as a result of search or scan.
48 * __rec_ret --
49 * Build return data.
49 *
50 * Parameters:
51 * t: tree
50 *
51 * Parameters:
52 * t: tree
52 * d: LEAF to be returned to the user.
53 * e: key/data pair to be returned
54 * nrec: record number
55 * key: user's key structure
53 * data: user's data structure
54 *
55 * Returns:
56 * RET_SUCCESS, RET_ERROR.
57 */
58int
59__rec_ret(t, e, nrec, key, data)
60 BTREE *t;
61 EPG *e;
62 recno_t nrec;
63 DBT *key, *data;
64{
56 * data: user's data structure
57 *
58 * Returns:
59 * RET_SUCCESS, RET_ERROR.
60 */
61int
62__rec_ret(t, e, nrec, key, data)
63 BTREE *t;
64 EPG *e;
65 recno_t nrec;
66 DBT *key, *data;
67{
65 register RLEAF *rl;
66 register void *p;
68 RLEAF *rl;
69 void *p;
67
70
68 if (data == NULL)
69 goto retkey;
71 if (key == NULL)
72 goto dataonly;
70
73
71 rl = GETRLEAF(e->page, e->index);
74 /* We have to copy the key, it's not on the page. */
75 if (sizeof(recno_t) > t->bt_rkey.size) {
76 p = (void *)(t->bt_rkey.data == NULL ?
77 malloc(sizeof(recno_t)) :
78 realloc(t->bt_rkey.data, sizeof(recno_t)));
79 if (p == NULL)
80 return (RET_ERROR);
81 t->bt_rkey.data = p;
82 t->bt_rkey.size = sizeof(recno_t);
83 }
84 memmove(t->bt_rkey.data, &nrec, sizeof(recno_t));
85 key->size = sizeof(recno_t);
86 key->data = t->bt_rkey.data;
72
87
88dataonly:
89 if (data == NULL)
90 return (RET_SUCCESS);
91
73 /*
92 /*
74 * We always copy big data to make it contigous. Otherwise, we
93 * We must copy big keys/data to make them contigous. Otherwise,
75 * leave the page pinned and don't copy unless the user specified
76 * concurrent access.
77 */
94 * leave the page pinned and don't copy unless the user specified
95 * concurrent access.
96 */
97 rl = GETRLEAF(e->page, e->index);
78 if (rl->flags & P_BIGDATA) {
79 if (__ovfl_get(t, rl->bytes,
98 if (rl->flags & P_BIGDATA) {
99 if (__ovfl_get(t, rl->bytes,
80 &data->size, &t->bt_dbuf, &t->bt_dbufsz))
100 &data->size, &t->bt_rdata.data, &t->bt_rdata.size))
81 return (RET_ERROR);
101 return (RET_ERROR);
82 data->data = t->bt_dbuf;
83 } else if (ISSET(t, B_DB_LOCK)) {
102 data->data = t->bt_rdata.data;
103 } else if (F_ISSET(t, B_DB_LOCK)) {
84 /* Use +1 in case the first record retrieved is 0 length. */
104 /* Use +1 in case the first record retrieved is 0 length. */
85 if (rl->dsize + 1 > t->bt_dbufsz) {
86 if ((p =
87 (void *)realloc(t->bt_dbuf, rl->dsize + 1)) == NULL)
105 if (rl->dsize + 1 > t->bt_rdata.size) {
106 p = (void *)(t->bt_rdata.data == NULL ?
107 malloc(rl->dsize + 1) :
108 realloc(t->bt_rdata.data, rl->dsize + 1));
109 if (p == NULL)
88 return (RET_ERROR);
110 return (RET_ERROR);
89 t->bt_dbuf = p;
90 t->bt_dbufsz = rl->dsize + 1;
111 t->bt_rdata.data = p;
112 t->bt_rdata.size = rl->dsize + 1;
91 }
113 }
92 memmove(t->bt_dbuf, rl->bytes, rl->dsize);
114 memmove(t->bt_rdata.data, rl->bytes, rl->dsize);
93 data->size = rl->dsize;
115 data->size = rl->dsize;
94 data->data = t->bt_dbuf;
116 data->data = t->bt_rdata.data;
95 } else {
96 data->size = rl->dsize;
97 data->data = rl->bytes;
98 }
117 } else {
118 data->size = rl->dsize;
119 data->data = rl->bytes;
120 }
99
100retkey: if (key == NULL)
101 return (RET_SUCCESS);
102
103 /* We have to copy the key, it's not on the page. */
104 if (sizeof(recno_t) > t->bt_kbufsz) {
105 if ((p = (void *)realloc(t->bt_kbuf, sizeof(recno_t))) == NULL)
106 return (RET_ERROR);
107 t->bt_kbuf = p;
108 t->bt_kbufsz = sizeof(recno_t);
109 }
110 memmove(t->bt_kbuf, &nrec, sizeof(recno_t));
111 key->size = sizeof(recno_t);
112 key->data = t->bt_kbuf;
113 return (RET_SUCCESS);
114}
121 return (RET_SUCCESS);
122}