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