rec_seq.c 3.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132
  1. /*-
  2. * Copyright (c) 1991, 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_seq.c 8.3 (Berkeley) 7/14/94";
  35. #endif /* not lint */
  36. #include <sys/types.h>
  37. #include <errno.h>
  38. #include <limits.h>
  39. #include <stdio.h>
  40. #include <string.h>
  41. #include "../include/db.h"
  42. #include "recno.h"
  43. /*
  44. * __REC_SEQ -- Recno sequential scan interface.
  45. *
  46. * Parameters:
  47. * dbp: pointer to access method
  48. * key: key for positioning and return value
  49. * data: data return value
  50. * flags: R_CURSOR, R_FIRST, R_LAST, R_NEXT, R_PREV.
  51. *
  52. * Returns:
  53. * RET_ERROR, RET_SUCCESS or RET_SPECIAL if there's no next key.
  54. */
  55. int
  56. __rec_seq(dbp, key, data, flags)
  57. const DB *dbp;
  58. DBT *key, *data;
  59. u_int flags;
  60. {
  61. BTREE *t;
  62. EPG *e;
  63. recno_t nrec;
  64. int status;
  65. t = dbp->internal;
  66. /* Toss any page pinned across calls. */
  67. if (t->bt_pinned != NULL) {
  68. mpool_put(t->bt_mp, t->bt_pinned, 0);
  69. t->bt_pinned = NULL;
  70. }
  71. switch(flags) {
  72. case R_CURSOR:
  73. if ((nrec = *(recno_t *)key->data) == 0)
  74. goto einval;
  75. break;
  76. case R_NEXT:
  77. if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
  78. nrec = t->bt_cursor.rcursor + 1;
  79. break;
  80. }
  81. /* FALLTHROUGH */
  82. case R_FIRST:
  83. nrec = 1;
  84. break;
  85. case R_PREV:
  86. if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
  87. if ((nrec = t->bt_cursor.rcursor - 1) == 0)
  88. return (RET_SPECIAL);
  89. break;
  90. }
  91. /* FALLTHROUGH */
  92. case R_LAST:
  93. if (!F_ISSET(t, R_EOF | R_INMEM) &&
  94. t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
  95. return (RET_ERROR);
  96. nrec = t->bt_nrecs;
  97. break;
  98. default:
  99. einval: errno = EINVAL;
  100. return (RET_ERROR);
  101. }
  102. if (t->bt_nrecs == 0 || nrec > t->bt_nrecs) {
  103. if (!F_ISSET(t, R_EOF | R_INMEM) &&
  104. (status = t->bt_irec(t, nrec)) != RET_SUCCESS)
  105. return (status);
  106. if (t->bt_nrecs == 0 || nrec > t->bt_nrecs)
  107. return (RET_SPECIAL);
  108. }
  109. if ((e = __rec_search(t, nrec - 1, SEARCH)) == NULL)
  110. return (RET_ERROR);
  111. F_SET(&t->bt_cursor, CURS_INIT);
  112. t->bt_cursor.rcursor = nrec;
  113. status = __rec_ret(t, e, nrec, key, data);
  114. if (F_ISSET(t, B_DB_LOCK))
  115. mpool_put(t->bt_mp, e->page, 0);
  116. else
  117. t->bt_pinned = e->page;
  118. return (status);
  119. }