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