rec_open.c revision 1.4 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1990, 1993
3 1.1 cgd * The Regents of the University of California. All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * Mike Olson.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd */
36 1.1 cgd
37 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
38 1.4 cgd /* from: static char sccsid[] = "@(#)rec_open.c 8.4 (Berkeley) 9/7/93"; */
39 1.4 cgd static char *rcsid = "$Id: rec_open.c,v 1.4 1993/09/09 02:42:25 cgd Exp $";
40 1.1 cgd #endif /* LIBC_SCCS and not lint */
41 1.1 cgd
42 1.1 cgd #include <sys/types.h>
43 1.1 cgd #include <sys/mman.h>
44 1.1 cgd #include <sys/stat.h>
45 1.1 cgd
46 1.1 cgd #include <errno.h>
47 1.1 cgd #include <fcntl.h>
48 1.1 cgd #include <limits.h>
49 1.1 cgd #include <stddef.h>
50 1.1 cgd #include <stdio.h>
51 1.1 cgd #include <unistd.h>
52 1.1 cgd
53 1.4 cgd #define __DBINTERFACE_PRIVATE
54 1.1 cgd #include <db.h>
55 1.1 cgd #include "recno.h"
56 1.1 cgd
57 1.1 cgd DB *
58 1.4 cgd __rec_open(fname, flags, mode, openinfo, dflags)
59 1.1 cgd const char *fname;
60 1.4 cgd int flags, mode, dflags;
61 1.1 cgd const RECNOINFO *openinfo;
62 1.1 cgd {
63 1.1 cgd BTREE *t;
64 1.1 cgd BTREEINFO btopeninfo;
65 1.1 cgd DB *dbp;
66 1.1 cgd PAGE *h;
67 1.1 cgd struct stat sb;
68 1.1 cgd int rfd, sverrno;
69 1.1 cgd
70 1.1 cgd /* Open the user's file -- if this fails, we're done. */
71 1.1 cgd if (fname != NULL && (rfd = open(fname, flags, mode)) < 0)
72 1.1 cgd return (NULL);
73 1.1 cgd
74 1.1 cgd /* Create a btree in memory (backed by disk). */
75 1.1 cgd dbp = NULL;
76 1.1 cgd if (openinfo) {
77 1.1 cgd if (openinfo->flags & ~(R_FIXEDLEN | R_NOKEY | R_SNAPSHOT))
78 1.1 cgd goto einval;
79 1.1 cgd btopeninfo.flags = 0;
80 1.1 cgd btopeninfo.cachesize = openinfo->cachesize;
81 1.1 cgd btopeninfo.maxkeypage = 0;
82 1.1 cgd btopeninfo.minkeypage = 0;
83 1.1 cgd btopeninfo.psize = openinfo->psize;
84 1.1 cgd btopeninfo.compare = NULL;
85 1.1 cgd btopeninfo.prefix = NULL;
86 1.1 cgd btopeninfo.lorder = openinfo->lorder;
87 1.1 cgd dbp = __bt_open(openinfo->bfname,
88 1.4 cgd O_RDWR, S_IRUSR | S_IWUSR, &btopeninfo, dflags);
89 1.1 cgd } else
90 1.4 cgd dbp = __bt_open(NULL, O_RDWR, S_IRUSR | S_IWUSR, NULL, dflags);
91 1.1 cgd if (dbp == NULL)
92 1.1 cgd goto err;
93 1.1 cgd
94 1.1 cgd /*
95 1.1 cgd * Some fields in the tree structure are recno specific. Fill them
96 1.1 cgd * in and make the btree structure look like a recno structure. We
97 1.1 cgd * don't change the bt_ovflsize value, it's close enough and slightly
98 1.1 cgd * bigger.
99 1.1 cgd */
100 1.1 cgd t = dbp->internal;
101 1.1 cgd if (openinfo) {
102 1.1 cgd if (openinfo->flags & R_FIXEDLEN) {
103 1.1 cgd SET(t, R_FIXLEN);
104 1.1 cgd t->bt_reclen = openinfo->reclen;
105 1.1 cgd if (t->bt_reclen == 0)
106 1.1 cgd goto einval;
107 1.1 cgd }
108 1.1 cgd t->bt_bval = openinfo->bval;
109 1.1 cgd } else
110 1.1 cgd t->bt_bval = '\n';
111 1.1 cgd
112 1.1 cgd SET(t, R_RECNO);
113 1.1 cgd if (fname == NULL)
114 1.1 cgd SET(t, R_EOF | R_INMEM);
115 1.1 cgd else
116 1.1 cgd t->bt_rfd = rfd;
117 1.1 cgd t->bt_rcursor = 0;
118 1.1 cgd
119 1.1 cgd /*
120 1.1 cgd * In 4.4BSD stat(2) returns true for ISSOCK on pipes. Until
121 1.1 cgd * then, this is fairly close. Pipes are read-only.
122 1.1 cgd */
123 1.1 cgd if (fname != NULL) {
124 1.1 cgd if (lseek(rfd, (off_t)0, SEEK_CUR) == -1 && errno == ESPIPE) {
125 1.1 cgd switch (flags & O_ACCMODE) {
126 1.1 cgd case O_RDONLY:
127 1.1 cgd SET(t, R_RDONLY);
128 1.1 cgd break;
129 1.1 cgd default:
130 1.1 cgd goto einval;
131 1.1 cgd }
132 1.1 cgd slow: if ((t->bt_rfp = fdopen(rfd, "r")) == NULL)
133 1.1 cgd goto err;
134 1.1 cgd SET(t, R_CLOSEFP);
135 1.1 cgd t->bt_irec =
136 1.1 cgd ISSET(t, R_FIXLEN) ? __rec_fpipe : __rec_vpipe;
137 1.1 cgd } else {
138 1.1 cgd switch (flags & O_ACCMODE) {
139 1.1 cgd case O_RDONLY:
140 1.1 cgd SET(t, R_RDONLY);
141 1.1 cgd break;
142 1.1 cgd case O_RDWR:
143 1.1 cgd break;
144 1.1 cgd default:
145 1.1 cgd goto einval;
146 1.1 cgd }
147 1.1 cgd
148 1.1 cgd if (fstat(rfd, &sb))
149 1.1 cgd goto err;
150 1.1 cgd /*
151 1.1 cgd * Kluge -- we'd like to test to see if the file is too
152 1.1 cgd * big to mmap. Since, we don't know what size or type
153 1.1 cgd * off_t's or size_t's are, what the largest unsigned
154 1.1 cgd * integral type is, or what random insanity the local
155 1.1 cgd * C compiler will perpetrate, doing the comparison in
156 1.1 cgd * a portable way is flatly impossible. Hope that mmap
157 1.1 cgd * fails if the file is too large.
158 1.1 cgd */
159 1.1 cgd if (sb.st_size == 0)
160 1.1 cgd SET(t, R_EOF);
161 1.1 cgd else {
162 1.1 cgd t->bt_msize = sb.st_size;
163 1.4 cgd if ((t->bt_smap = mmap(NULL, t->bt_msize,
164 1.4 cgd PROT_READ, MAP_PRIVATE, rfd,
165 1.1 cgd (off_t)0)) == (caddr_t)-1)
166 1.1 cgd goto slow;
167 1.1 cgd t->bt_cmap = t->bt_smap;
168 1.1 cgd t->bt_emap = t->bt_smap + sb.st_size;
169 1.1 cgd t->bt_irec = ISSET(t, R_FIXLEN) ?
170 1.1 cgd __rec_fmap : __rec_vmap;
171 1.1 cgd SET(t, R_MEMMAPPED);
172 1.1 cgd }
173 1.1 cgd }
174 1.1 cgd }
175 1.1 cgd
176 1.1 cgd /* Use the recno routines. */
177 1.1 cgd dbp->close = __rec_close;
178 1.1 cgd dbp->del = __rec_delete;
179 1.1 cgd dbp->fd = __rec_fd;
180 1.1 cgd dbp->get = __rec_get;
181 1.1 cgd dbp->put = __rec_put;
182 1.1 cgd dbp->seq = __rec_seq;
183 1.1 cgd dbp->sync = __rec_sync;
184 1.1 cgd
185 1.1 cgd /* If the root page was created, reset the flags. */
186 1.1 cgd if ((h = mpool_get(t->bt_mp, P_ROOT, 0)) == NULL)
187 1.1 cgd goto err;
188 1.1 cgd if ((h->flags & P_TYPE) == P_BLEAF) {
189 1.1 cgd h->flags = h->flags & ~P_TYPE | P_RLEAF;
190 1.1 cgd mpool_put(t->bt_mp, h, MPOOL_DIRTY);
191 1.1 cgd } else
192 1.1 cgd mpool_put(t->bt_mp, h, 0);
193 1.1 cgd
194 1.1 cgd if (openinfo && openinfo->flags & R_SNAPSHOT &&
195 1.1 cgd !ISSET(t, R_EOF | R_INMEM) &&
196 1.1 cgd t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
197 1.1 cgd goto err;
198 1.1 cgd return (dbp);
199 1.1 cgd
200 1.1 cgd einval: errno = EINVAL;
201 1.1 cgd err: sverrno = errno;
202 1.1 cgd if (dbp != NULL)
203 1.1 cgd (void)__bt_close(dbp);
204 1.1 cgd if (fname != NULL)
205 1.1 cgd (void)close(rfd);
206 1.1 cgd errno = sverrno;
207 1.1 cgd return (NULL);
208 1.1 cgd }
209 1.1 cgd
210 1.1 cgd int
211 1.1 cgd __rec_fd(dbp)
212 1.1 cgd const DB *dbp;
213 1.1 cgd {
214 1.1 cgd BTREE *t;
215 1.1 cgd
216 1.1 cgd t = dbp->internal;
217 1.1 cgd
218 1.4 cgd /* Toss any page pinned across calls. */
219 1.4 cgd if (t->bt_pinned != NULL) {
220 1.4 cgd mpool_put(t->bt_mp, t->bt_pinned, 0);
221 1.4 cgd t->bt_pinned = NULL;
222 1.4 cgd }
223 1.4 cgd
224 1.4 cgd /* In-memory database can't have a file descriptor. */
225 1.1 cgd if (ISSET(t, R_INMEM)) {
226 1.1 cgd errno = ENOENT;
227 1.1 cgd return (-1);
228 1.1 cgd }
229 1.1 cgd return (t->bt_rfd);
230 1.1 cgd }
231