rec_open.c revision 1.16 1 1.16 joerg /* $NetBSD: rec_open.c,v 1.16 2008/09/10 17:52:36 joerg 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.16 joerg __RCSID("$NetBSD: rec_open.c,v 1.16 2008/09/10 17:52:36 joerg Exp $");
37 1.1 cgd
38 1.9 jtc #include "namespace.h"
39 1.1 cgd #include <sys/types.h>
40 1.1 cgd #include <sys/mman.h>
41 1.1 cgd #include <sys/stat.h>
42 1.1 cgd
43 1.15 christos #include <assert.h>
44 1.1 cgd #include <errno.h>
45 1.1 cgd #include <fcntl.h>
46 1.1 cgd #include <limits.h>
47 1.1 cgd #include <stddef.h>
48 1.1 cgd #include <stdio.h>
49 1.1 cgd #include <unistd.h>
50 1.1 cgd
51 1.1 cgd #include <db.h>
52 1.1 cgd #include "recno.h"
53 1.1 cgd
54 1.1 cgd DB *
55 1.15 christos __rec_open(const char *fname, int flags, mode_t mode, const RECNOINFO *openinfo,
56 1.15 christos int dflags)
57 1.1 cgd {
58 1.1 cgd BTREE *t;
59 1.1 cgd BTREEINFO btopeninfo;
60 1.1 cgd DB *dbp;
61 1.1 cgd PAGE *h;
62 1.1 cgd struct stat sb;
63 1.8 christos int rfd = -1; /* pacify gcc */
64 1.8 christos int sverrno;
65 1.1 cgd
66 1.14 lukem dbp = NULL;
67 1.1 cgd /* Open the user's file -- if this fails, we're done. */
68 1.13 mycroft if (fname != NULL) {
69 1.13 mycroft if ((rfd = open(fname, flags, mode)) == -1)
70 1.13 mycroft return (NULL);
71 1.13 mycroft if (fcntl(rfd, F_SETFD, FD_CLOEXEC) == -1)
72 1.13 mycroft goto err;
73 1.13 mycroft }
74 1.1 cgd
75 1.1 cgd /* Create a btree in memory (backed by disk). */
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.7 cgd F_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.7 cgd F_SET(t, R_RECNO);
113 1.1 cgd if (fname == NULL)
114 1.7 cgd F_SET(t, R_EOF | R_INMEM);
115 1.1 cgd else
116 1.1 cgd t->bt_rfd = rfd;
117 1.1 cgd
118 1.1 cgd if (fname != NULL) {
119 1.5 cgd /*
120 1.5 cgd * In 4.4BSD, stat(2) returns true for ISSOCK on pipes.
121 1.5 cgd * Unfortunately, that's not portable, so we use lseek
122 1.5 cgd * and check the errno values.
123 1.5 cgd */
124 1.5 cgd errno = 0;
125 1.1 cgd if (lseek(rfd, (off_t)0, SEEK_CUR) == -1 && errno == ESPIPE) {
126 1.1 cgd switch (flags & O_ACCMODE) {
127 1.1 cgd case O_RDONLY:
128 1.7 cgd F_SET(t, R_RDONLY);
129 1.1 cgd break;
130 1.1 cgd default:
131 1.1 cgd goto einval;
132 1.1 cgd }
133 1.1 cgd slow: if ((t->bt_rfp = fdopen(rfd, "r")) == NULL)
134 1.1 cgd goto err;
135 1.7 cgd F_SET(t, R_CLOSEFP);
136 1.1 cgd t->bt_irec =
137 1.7 cgd F_ISSET(t, R_FIXLEN) ? __rec_fpipe : __rec_vpipe;
138 1.1 cgd } else {
139 1.1 cgd switch (flags & O_ACCMODE) {
140 1.1 cgd case O_RDONLY:
141 1.7 cgd F_SET(t, R_RDONLY);
142 1.1 cgd break;
143 1.1 cgd case O_RDWR:
144 1.1 cgd break;
145 1.1 cgd default:
146 1.1 cgd goto einval;
147 1.1 cgd }
148 1.1 cgd
149 1.1 cgd if (fstat(rfd, &sb))
150 1.1 cgd goto err;
151 1.1 cgd /*
152 1.1 cgd * Kluge -- we'd like to test to see if the file is too
153 1.1 cgd * big to mmap. Since, we don't know what size or type
154 1.1 cgd * off_t's or size_t's are, what the largest unsigned
155 1.1 cgd * integral type is, or what random insanity the local
156 1.1 cgd * C compiler will perpetrate, doing the comparison in
157 1.1 cgd * a portable way is flatly impossible. Hope that mmap
158 1.1 cgd * fails if the file is too large.
159 1.1 cgd */
160 1.1 cgd if (sb.st_size == 0)
161 1.7 cgd F_SET(t, R_EOF);
162 1.1 cgd else {
163 1.7 cgd #ifdef MMAP_NOT_AVAILABLE
164 1.7 cgd /*
165 1.7 cgd * XXX
166 1.7 cgd * Mmap doesn't work correctly on many current
167 1.7 cgd * systems. In particular, it can fail subtly,
168 1.7 cgd * with cache coherency problems. Don't use it
169 1.7 cgd * for now.
170 1.7 cgd */
171 1.1 cgd t->bt_msize = sb.st_size;
172 1.4 cgd if ((t->bt_smap = mmap(NULL, t->bt_msize,
173 1.10 mycroft PROT_READ, MAP_FILE | MAP_PRIVATE, rfd,
174 1.1 cgd (off_t)0)) == (caddr_t)-1)
175 1.1 cgd goto slow;
176 1.1 cgd t->bt_cmap = t->bt_smap;
177 1.1 cgd t->bt_emap = t->bt_smap + sb.st_size;
178 1.7 cgd t->bt_irec = F_ISSET(t, R_FIXLEN) ?
179 1.1 cgd __rec_fmap : __rec_vmap;
180 1.7 cgd F_SET(t, R_MEMMAPPED);
181 1.7 cgd #else
182 1.7 cgd goto slow;
183 1.7 cgd #endif
184 1.1 cgd }
185 1.1 cgd }
186 1.1 cgd }
187 1.1 cgd
188 1.1 cgd /* Use the recno routines. */
189 1.1 cgd dbp->close = __rec_close;
190 1.1 cgd dbp->del = __rec_delete;
191 1.1 cgd dbp->fd = __rec_fd;
192 1.1 cgd dbp->get = __rec_get;
193 1.1 cgd dbp->put = __rec_put;
194 1.1 cgd dbp->seq = __rec_seq;
195 1.1 cgd dbp->sync = __rec_sync;
196 1.1 cgd
197 1.1 cgd /* If the root page was created, reset the flags. */
198 1.1 cgd if ((h = mpool_get(t->bt_mp, P_ROOT, 0)) == NULL)
199 1.1 cgd goto err;
200 1.1 cgd if ((h->flags & P_TYPE) == P_BLEAF) {
201 1.7 cgd F_CLR(h, P_TYPE);
202 1.7 cgd F_SET(h, P_RLEAF);
203 1.1 cgd mpool_put(t->bt_mp, h, MPOOL_DIRTY);
204 1.1 cgd } else
205 1.1 cgd mpool_put(t->bt_mp, h, 0);
206 1.1 cgd
207 1.1 cgd if (openinfo && openinfo->flags & R_SNAPSHOT &&
208 1.7 cgd !F_ISSET(t, R_EOF | R_INMEM) &&
209 1.1 cgd t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
210 1.1 cgd goto err;
211 1.1 cgd return (dbp);
212 1.1 cgd
213 1.1 cgd einval: errno = EINVAL;
214 1.1 cgd err: sverrno = errno;
215 1.1 cgd if (dbp != NULL)
216 1.1 cgd (void)__bt_close(dbp);
217 1.1 cgd if (fname != NULL)
218 1.1 cgd (void)close(rfd);
219 1.1 cgd errno = sverrno;
220 1.1 cgd return (NULL);
221 1.1 cgd }
222 1.1 cgd
223 1.1 cgd int
224 1.15 christos __rec_fd(const DB *dbp)
225 1.1 cgd {
226 1.1 cgd BTREE *t;
227 1.1 cgd
228 1.1 cgd t = dbp->internal;
229 1.1 cgd
230 1.4 cgd /* Toss any page pinned across calls. */
231 1.4 cgd if (t->bt_pinned != NULL) {
232 1.4 cgd mpool_put(t->bt_mp, t->bt_pinned, 0);
233 1.4 cgd t->bt_pinned = NULL;
234 1.4 cgd }
235 1.4 cgd
236 1.4 cgd /* In-memory database can't have a file descriptor. */
237 1.7 cgd if (F_ISSET(t, R_INMEM)) {
238 1.1 cgd errno = ENOENT;
239 1.1 cgd return (-1);
240 1.1 cgd }
241 1.1 cgd return (t->bt_rfd);
242 1.1 cgd }
243