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