rec_close.c revision 1.7 1 1.6 cgd /* $NetBSD: rec_close.c,v 1.7 1996/05/03 21:38:45 cgd 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 * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.1 cgd #if defined(LIBC_SCCS) && !defined(lint)
37 1.6 cgd #if 0
38 1.7 cgd static char sccsid[] = "@(#)rec_close.c 8.6 (Berkeley) 8/18/94";
39 1.6 cgd #else
40 1.6 cgd static char rcsid[] = "$NetBSD: rec_close.c,v 1.7 1996/05/03 21:38:45 cgd Exp $";
41 1.6 cgd #endif
42 1.1 cgd #endif /* LIBC_SCCS and not lint */
43 1.1 cgd
44 1.1 cgd #include <sys/types.h>
45 1.1 cgd #include <sys/uio.h>
46 1.1 cgd #include <sys/mman.h>
47 1.1 cgd
48 1.1 cgd #include <errno.h>
49 1.1 cgd #include <limits.h>
50 1.1 cgd #include <stdio.h>
51 1.1 cgd #include <unistd.h>
52 1.1 cgd
53 1.1 cgd #include <db.h>
54 1.1 cgd #include "recno.h"
55 1.1 cgd
56 1.1 cgd /*
57 1.1 cgd * __REC_CLOSE -- Close a recno tree.
58 1.1 cgd *
59 1.1 cgd * Parameters:
60 1.1 cgd * dbp: pointer to access method
61 1.1 cgd *
62 1.1 cgd * Returns:
63 1.1 cgd * RET_ERROR, RET_SUCCESS
64 1.1 cgd */
65 1.1 cgd int
66 1.1 cgd __rec_close(dbp)
67 1.1 cgd DB *dbp;
68 1.1 cgd {
69 1.1 cgd BTREE *t;
70 1.5 cgd int status;
71 1.1 cgd
72 1.4 cgd t = dbp->internal;
73 1.4 cgd
74 1.4 cgd /* Toss any page pinned across calls. */
75 1.4 cgd if (t->bt_pinned != NULL) {
76 1.4 cgd mpool_put(t->bt_mp, t->bt_pinned, 0);
77 1.4 cgd t->bt_pinned = NULL;
78 1.4 cgd }
79 1.4 cgd
80 1.1 cgd if (__rec_sync(dbp, 0) == RET_ERROR)
81 1.1 cgd return (RET_ERROR);
82 1.1 cgd
83 1.1 cgd /* Committed to closing. */
84 1.5 cgd status = RET_SUCCESS;
85 1.7 cgd if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
86 1.5 cgd status = RET_ERROR;
87 1.1 cgd
88 1.7 cgd if (!F_ISSET(t, R_INMEM))
89 1.7 cgd if (F_ISSET(t, R_CLOSEFP)) {
90 1.1 cgd if (fclose(t->bt_rfp))
91 1.5 cgd status = RET_ERROR;
92 1.1 cgd } else
93 1.1 cgd if (close(t->bt_rfd))
94 1.5 cgd status = RET_ERROR;
95 1.1 cgd
96 1.1 cgd if (__bt_close(dbp) == RET_ERROR)
97 1.5 cgd status = RET_ERROR;
98 1.1 cgd
99 1.5 cgd return (status);
100 1.1 cgd }
101 1.1 cgd
102 1.1 cgd /*
103 1.1 cgd * __REC_SYNC -- sync the recno tree to disk.
104 1.1 cgd *
105 1.1 cgd * Parameters:
106 1.1 cgd * dbp: pointer to access method
107 1.1 cgd *
108 1.1 cgd * Returns:
109 1.1 cgd * RET_SUCCESS, RET_ERROR.
110 1.1 cgd */
111 1.1 cgd int
112 1.1 cgd __rec_sync(dbp, flags)
113 1.1 cgd const DB *dbp;
114 1.1 cgd u_int flags;
115 1.1 cgd {
116 1.1 cgd struct iovec iov[2];
117 1.1 cgd BTREE *t;
118 1.1 cgd DBT data, key;
119 1.1 cgd off_t off;
120 1.1 cgd recno_t scursor, trec;
121 1.1 cgd int status;
122 1.1 cgd
123 1.1 cgd t = dbp->internal;
124 1.4 cgd
125 1.4 cgd /* Toss any page pinned across calls. */
126 1.4 cgd if (t->bt_pinned != NULL) {
127 1.4 cgd mpool_put(t->bt_mp, t->bt_pinned, 0);
128 1.4 cgd t->bt_pinned = NULL;
129 1.4 cgd }
130 1.1 cgd
131 1.1 cgd if (flags == R_RECNOSYNC)
132 1.1 cgd return (__bt_sync(dbp, 0));
133 1.1 cgd
134 1.7 cgd if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
135 1.1 cgd return (RET_SUCCESS);
136 1.1 cgd
137 1.1 cgd /* Read any remaining records into the tree. */
138 1.7 cgd if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
139 1.1 cgd return (RET_ERROR);
140 1.1 cgd
141 1.1 cgd /* Rewind the file descriptor. */
142 1.1 cgd if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
143 1.1 cgd return (RET_ERROR);
144 1.1 cgd
145 1.7 cgd /* Save the cursor. */
146 1.7 cgd scursor = t->bt_cursor.rcursor;
147 1.1 cgd
148 1.1 cgd key.size = sizeof(recno_t);
149 1.1 cgd key.data = &trec;
150 1.1 cgd
151 1.7 cgd if (F_ISSET(t, R_FIXLEN)) {
152 1.7 cgd /*
153 1.7 cgd * We assume that fixed length records are all fixed length.
154 1.7 cgd * Any that aren't are either EINVAL'd or corrected by the
155 1.7 cgd * record put code.
156 1.7 cgd */
157 1.7 cgd status = (dbp->seq)(dbp, &key, &data, R_FIRST);
158 1.7 cgd while (status == RET_SUCCESS) {
159 1.7 cgd if (write(t->bt_rfd, data.data, data.size) != data.size)
160 1.7 cgd return (RET_ERROR);
161 1.7 cgd status = (dbp->seq)(dbp, &key, &data, R_NEXT);
162 1.7 cgd }
163 1.7 cgd } else {
164 1.7 cgd iov[1].iov_base = &t->bt_bval;
165 1.7 cgd iov[1].iov_len = 1;
166 1.7 cgd
167 1.7 cgd status = (dbp->seq)(dbp, &key, &data, R_FIRST);
168 1.7 cgd while (status == RET_SUCCESS) {
169 1.7 cgd iov[0].iov_base = data.data;
170 1.7 cgd iov[0].iov_len = data.size;
171 1.7 cgd if (writev(t->bt_rfd, iov, 2) != data.size + 1)
172 1.7 cgd return (RET_ERROR);
173 1.7 cgd status = (dbp->seq)(dbp, &key, &data, R_NEXT);
174 1.7 cgd }
175 1.7 cgd }
176 1.7 cgd
177 1.7 cgd /* Restore the cursor. */
178 1.7 cgd t->bt_cursor.rcursor = scursor;
179 1.7 cgd
180 1.1 cgd if (status == RET_ERROR)
181 1.1 cgd return (RET_ERROR);
182 1.1 cgd if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
183 1.1 cgd return (RET_ERROR);
184 1.1 cgd if (ftruncate(t->bt_rfd, off))
185 1.1 cgd return (RET_ERROR);
186 1.7 cgd F_CLR(t, R_MODIFIED);
187 1.1 cgd return (RET_SUCCESS);
188 1.1 cgd }
189