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