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