Asterisk - The Open Source Telephony Project GIT-master-f36a736
rec_close.c
Go to the documentation of this file.
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. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 */
33
34#if defined(LIBC_SCCS) && !defined(lint)
35static char sccsid[] = "@(#)rec_close.c 8.6 (Berkeley) 8/18/94";
36#endif /* LIBC_SCCS and not lint */
37
38#include <sys/types.h>
39#include <sys/uio.h>
40#include <sys/mman.h>
41
42#include <errno.h>
43#include <limits.h>
44#include <stdio.h>
45#include <unistd.h>
46
47#include "../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
61 DB *dbp;
62{
63 BTREE *t;
64 int status;
65
66 t = dbp->internal;
67
68 /* Toss any page pinned across calls. */
69 if (t->bt_pinned != NULL) {
70 mpool_put(t->bt_mp, t->bt_pinned, 0);
71 t->bt_pinned = NULL;
72 }
73
74 if (__rec_sync(dbp, 0) == RET_ERROR)
75 return (RET_ERROR);
76
77 /* Committed to closing. */
79 if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
81
82 if (!F_ISSET(t, R_INMEM)) {
83 if (F_ISSET(t, R_CLOSEFP)) {
84 if (fclose(t->bt_rfp))
86 } else
87 if (close(t->bt_rfd))
89 }
90
91 if (__bt_close(dbp) == 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
108 const DB *dbp;
109 u_int flags;
110{
111 struct iovec iov[2];
112 BTREE *t;
113 DBT data, key;
114 off_t off;
115 recno_t scursor, trec;
116 int status;
117
118 t = dbp->internal;
119
120 /* Toss any page pinned across calls. */
121 if (t->bt_pinned != NULL) {
122 mpool_put(t->bt_mp, t->bt_pinned, 0);
123 t->bt_pinned = NULL;
124 }
125
126 if (flags == R_RECNOSYNC)
127 return (__bt_sync(dbp, 0));
128
129 if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
130 return (RET_SUCCESS);
131
132 /* Read any remaining records into the tree. */
133 if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
134 return (RET_ERROR);
135
136 /* Rewind the file descriptor. */
137 if (lseek(t->bt_rfd, (off_t)0, SEEK_SET) != 0)
138 return (RET_ERROR);
139
140 /* Save the cursor. */
141 scursor = t->bt_cursor.rcursor;
142
143 key.size = sizeof(recno_t);
144 key.data = &trec;
145
146 if (F_ISSET(t, R_FIXLEN)) {
147 /*
148 * We assume that fixed length records are all fixed length.
149 * Any that aren't are either EINVAL'd or corrected by the
150 * record put code.
151 */
152 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
153 while (status == RET_SUCCESS) {
154 if ((size_t) write(t->bt_rfd, data.data, data.size) != data.size)
155 return (RET_ERROR);
156 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
157 }
158 } else {
159 iov[1].iov_base = &t->bt_bval;
160 iov[1].iov_len = 1;
161
162 status = (dbp->seq)(dbp, &key, &data, R_FIRST);
163 while (status == RET_SUCCESS) {
164 iov[0].iov_base = data.data;
165 iov[0].iov_len = data.size;
166 if ((size_t) writev(t->bt_rfd, iov, 2) != data.size + 1)
167 return (RET_ERROR);
168 status = (dbp->seq)(dbp, &key, &data, R_NEXT);
169 }
170 }
171
172 /* Restore the cursor. */
173 t->bt_cursor.rcursor = scursor;
174
175 if (status == RET_ERROR)
176 return (RET_ERROR);
177 if ((off = lseek(t->bt_rfd, (off_t)0, SEEK_CUR)) == -1)
178 return (RET_ERROR);
179 if (ftruncate(t->bt_rfd, off))
180 return (RET_ERROR);
181 F_CLR(t, R_MODIFIED);
182 return (RET_SUCCESS);
183}
jack_status_t status
Definition: app_jack.c:146
int __bt_sync(DB *dbp, u_int flags) const
Definition: bt_close.c:119
int __bt_close(DB *dbp)
Definition: bt_close.c:64
#define F_ISSET(p, f)
Definition: btree.h:42
#define R_CLOSEFP
Definition: btree.h:377
#define R_MEMMAPPED
Definition: btree.h:380
#define R_MODIFIED
Definition: btree.h:382
#define R_RDONLY
Definition: btree.h:383
#define R_INMEM
Definition: btree.h:381
#define F_CLR(p, f)
Definition: btree.h:41
#define R_EOF
Definition: btree.h:378
#define R_FIXLEN
Definition: btree.h:379
#define R_NEXT
Definition: db.h:97
#define R_FIRST
Definition: db.h:93
#define RET_SUCCESS
Definition: db.h:52
#define MAX_REC_NUMBER
Definition: db.h:81
u_int32_t recno_t
Definition: db.h:82
#define RET_ERROR
Definition: db.h:51
#define R_RECNOSYNC
Definition: db.h:101
static DB * dbp
Definition: hsearch.c:49
int mpool_put(MPOOL *mp, void *page, u_int flags)
Definition: mpool.c:251
int __rec_close(DB *dbp)
Definition: rec_close.c:60
int __rec_sync(DB *dbp, u_int flags) const
Definition: rec_close.c:107
#define NULL
Definition: resample.c:96
Definition: db.h:85
void * data
Definition: db.h:86
size_t size
Definition: db.h:87
Definition: db.h:129
void * internal
Definition: db.h:137
Definition: btree.h:312
MPOOL * bt_mp
Definition: btree.h:313
PAGE * bt_pinned
Definition: btree.h:318
size_t bt_msize
Definition: btree.h:358
FILE * bt_rfp
Definition: btree.h:352
caddr_t bt_smap
Definition: btree.h:356
int bt_rfd
Definition: btree.h:353