rec_close.c 4.9 KB

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