1 | #include <machine/rtems-bsd-user-space.h> |
---|
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 | * 4. 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 | #if defined(LIBC_SCCS) && !defined(lint) |
---|
33 | static char sccsid[] = "@(#)rec_close.c 8.6 (Berkeley) 8/18/94"; |
---|
34 | #endif /* LIBC_SCCS and not lint */ |
---|
35 | #include <sys/cdefs.h> |
---|
36 | __FBSDID("$FreeBSD$"); |
---|
37 | |
---|
38 | #include "namespace.h" |
---|
39 | #include <sys/types.h> |
---|
40 | #include <sys/uio.h> |
---|
41 | #include <sys/mman.h> |
---|
42 | |
---|
43 | #include <errno.h> |
---|
44 | #include <limits.h> |
---|
45 | #include <stdio.h> |
---|
46 | #include <unistd.h> |
---|
47 | #include "un-namespace.h" |
---|
48 | |
---|
49 | #include <db.h> |
---|
50 | #include "recno.h" |
---|
51 | |
---|
52 | /* |
---|
53 | * __REC_CLOSE -- Close a recno tree. |
---|
54 | * |
---|
55 | * Parameters: |
---|
56 | * dbp: pointer to access method |
---|
57 | * |
---|
58 | * Returns: |
---|
59 | * RET_ERROR, RET_SUCCESS |
---|
60 | */ |
---|
61 | int |
---|
62 | __rec_close(DB *dbp) |
---|
63 | { |
---|
64 | BTREE *t; |
---|
65 | int status; |
---|
66 | |
---|
67 | t = dbp->internal; |
---|
68 | |
---|
69 | /* Toss any page pinned across calls. */ |
---|
70 | if (t->bt_pinned != NULL) { |
---|
71 | mpool_put(t->bt_mp, t->bt_pinned, 0); |
---|
72 | t->bt_pinned = NULL; |
---|
73 | } |
---|
74 | |
---|
75 | if (__rec_sync(dbp, 0) == RET_ERROR) |
---|
76 | return (RET_ERROR); |
---|
77 | |
---|
78 | /* Committed to closing. */ |
---|
79 | status = RET_SUCCESS; |
---|
80 | #ifndef __rtems__ |
---|
81 | if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize)) |
---|
82 | status = RET_ERROR; |
---|
83 | #endif /* __rtems__ */ |
---|
84 | |
---|
85 | if (!F_ISSET(t, R_INMEM)) { |
---|
86 | if (F_ISSET(t, R_CLOSEFP)) { |
---|
87 | if (fclose(t->bt_rfp)) |
---|
88 | status = RET_ERROR; |
---|
89 | } else { |
---|
90 | if (_close(t->bt_rfd)) |
---|
91 | status = RET_ERROR; |
---|
92 | } |
---|
93 | } |
---|
94 | |
---|
95 | if (__bt_close(dbp) == RET_ERROR) |
---|
96 | status = RET_ERROR; |
---|
97 | |
---|
98 | return (status); |
---|
99 | } |
---|
100 | |
---|
101 | /* |
---|
102 | * __REC_SYNC -- sync the recno tree to disk. |
---|
103 | * |
---|
104 | * Parameters: |
---|
105 | * dbp: pointer to access method |
---|
106 | * |
---|
107 | * Returns: |
---|
108 | * RET_SUCCESS, RET_ERROR. |
---|
109 | */ |
---|
110 | int |
---|
111 | __rec_sync(const DB *dbp, u_int flags) |
---|
112 | { |
---|
113 | struct iovec iov[2]; |
---|
114 | BTREE *t; |
---|
115 | DBT data, key; |
---|
116 | off_t off; |
---|
117 | recno_t scursor, trec; |
---|
118 | int status; |
---|
119 | |
---|
120 | t = dbp->internal; |
---|
121 | |
---|
122 | /* Toss any page pinned across calls. */ |
---|
123 | if (t->bt_pinned != NULL) { |
---|
124 | mpool_put(t->bt_mp, t->bt_pinned, 0); |
---|
125 | t->bt_pinned = NULL; |
---|
126 | } |
---|
127 | |
---|
128 | if (flags == R_RECNOSYNC) |
---|
129 | return (__bt_sync(dbp, 0)); |
---|
130 | |
---|
131 | if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED)) |
---|
132 | return (RET_SUCCESS); |
---|
133 | |
---|
134 | /* Read any remaining records into the tree. */ |
---|
135 | if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR) |
---|
136 | return (RET_ERROR); |
---|
137 | |
---|
138 | /* Rewind the file descriptor. */ |
---|
139 | if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0) |
---|
140 | return (RET_ERROR); |
---|
141 | |
---|
142 | /* Save the cursor. */ |
---|
143 | scursor = t->bt_cursor.rcursor; |
---|
144 | |
---|
145 | key.size = sizeof(recno_t); |
---|
146 | key.data = &trec; |
---|
147 | |
---|
148 | if (F_ISSET(t, R_FIXLEN)) { |
---|
149 | /* |
---|
150 | * We assume that fixed length records are all fixed length. |
---|
151 | * Any that aren't are either EINVAL'd or corrected by the |
---|
152 | * record put code. |
---|
153 | */ |
---|
154 | status = (dbp->seq)(dbp, &key, &data, R_FIRST); |
---|
155 | while (status == RET_SUCCESS) { |
---|
156 | if (_write(t->bt_rfd, data.data, data.size) != |
---|
157 | (ssize_t)data.size) |
---|
158 | return (RET_ERROR); |
---|
159 | status = (dbp->seq)(dbp, &key, &data, R_NEXT); |
---|
160 | } |
---|
161 | } else { |
---|
162 | iov[1].iov_base = &t->bt_bval; |
---|
163 | iov[1].iov_len = 1; |
---|
164 | |
---|
165 | status = (dbp->seq)(dbp, &key, &data, R_FIRST); |
---|
166 | while (status == RET_SUCCESS) { |
---|
167 | iov[0].iov_base = data.data; |
---|
168 | iov[0].iov_len = data.size; |
---|
169 | if (_writev(t->bt_rfd, iov, 2) != (ssize_t)(data.size + 1)) |
---|
170 | return (RET_ERROR); |
---|
171 | status = (dbp->seq)(dbp, &key, &data, R_NEXT); |
---|
172 | } |
---|
173 | } |
---|
174 | |
---|
175 | /* Restore the cursor. */ |
---|
176 | t->bt_cursor.rcursor = scursor; |
---|
177 | |
---|
178 | if (status == RET_ERROR) |
---|
179 | return (RET_ERROR); |
---|
180 | if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1) |
---|
181 | return (RET_ERROR); |
---|
182 | if (ftruncate(t->bt_rfd, off)) |
---|
183 | return (RET_ERROR); |
---|
184 | F_CLR(t, R_MODIFIED); |
---|
185 | return (RET_SUCCESS); |
---|
186 | } |
---|