Searched refs:bt_cursor (Results 1 – 10 of 10) sorted by relevance
| /netbsd-src/lib/libc/db/recno/ |
| H A D | rec_seq.c | 85 if (F_ISSET(&t->bt_cursor, CURS_INIT)) { in __rec_seq()
86 nrec = t->bt_cursor.rcursor + 1; in __rec_seq()
94 if (F_ISSET(&t->bt_cursor, CURS_INIT)) { in __rec_seq()
95 if ((nrec = t->bt_cursor.rcursor - 1) == 0) in __rec_seq()
122 F_SET(&t->bt_cursor, CURS_INIT); in __rec_seq()
123 t->bt_cursor.rcursor = nrec; in __rec_seq()
|
| H A D | rec_delete.c | 91 if (!F_ISSET(&t->bt_cursor, CURS_INIT)) in __rec_delete()
95 status = rec_rdelete(t, t->bt_cursor.rcursor - 1); in __rec_delete()
97 --t->bt_cursor.rcursor; in __rec_delete()
|
| H A D | rec_put.c | 108 if (!F_ISSET(&t->bt_cursor, CURS_INIT)) in __rec_put()
110 nrec = t->bt_cursor.rcursor; in __rec_put()
173 t->bt_cursor.rcursor = nrec; in __rec_put()
|
| H A D | rec_close.c | 142 scursor = t->bt_cursor.rcursor; in __rec_sync()
176 t->bt_cursor.rcursor = scursor; in __rec_sync()
|
| /netbsd-src/lib/libc/db/btree/ |
| H A D | bt_put.c | 105 if (F_ISSET(&t->bt_cursor, CURS_INIT) && in __bt_put()
106 !F_ISSET(&t->bt_cursor, in __bt_put()
155 if ((h = mpool_get(t->bt_mp, t->bt_cursor.pg.pgno, 0)) == NULL) in __bt_put()
157 idx = t->bt_cursor.pg.index; in __bt_put()
222 if (F_ISSET(&t->bt_cursor, CURS_INIT) && in __bt_put()
223 !F_ISSET(&t->bt_cursor, CURS_ACQUIRE) && in __bt_put()
224 t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index >= idx) in __bt_put()
225 ++t->bt_cursor.pg.index; in __bt_put()
|
| H A D | bt_delete.c | 95 c = &t->bt_cursor; in __bt_delete()
107 if (__bt_stkacq(t, &h, &t->bt_cursor)) in __bt_delete()
477 if (F_ISSET(&t->bt_cursor, CURS_INIT) && in __bt_dleaf()
478 !F_ISSET(&t->bt_cursor, CURS_ACQUIRE) && in __bt_dleaf()
479 t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index == idx && in __bt_dleaf()
507 if (F_ISSET(&t->bt_cursor, CURS_INIT) && in __bt_dleaf()
508 !F_ISSET(&t->bt_cursor, CURS_ACQUIRE) && in __bt_dleaf()
509 t->bt_cursor.pg.pgno == h->pgno && t->bt_cursor.pg.index > idx) in __bt_dleaf()
510 --t->bt_cursor.pg.index; in __bt_dleaf()
540 c = &t->bt_cursor; in __bt_curdel()
|
| H A D | bt_seq.c | 106 if (F_ISSET(&t->bt_cursor, CURS_INIT)) { in __bt_seq()
258 c = &t->bt_cursor; in __bt_seqadv()
564 if (t->bt_cursor.key.data != NULL) { in __bt_setcur()
565 free(t->bt_cursor.key.data); in __bt_setcur()
566 t->bt_cursor.key.size = 0; in __bt_setcur()
567 t->bt_cursor.key.data = NULL; in __bt_setcur()
569 F_CLR(&t->bt_cursor, CURS_ACQUIRE | CURS_AFTER | CURS_BEFORE); in __bt_setcur()
572 t->bt_cursor.pg.pgno = pgno; in __bt_setcur()
573 t->bt_cursor.pg.index = idx; in __bt_setcur()
574 F_SET(&t->bt_cursor, CURS_INIT); in __bt_setcur()
|
| H A D | bt_close.c | 88 if (t->bt_cursor.key.data != NULL) { in __bt_close()
89 free(t->bt_cursor.key.data); in __bt_close()
90 t->bt_cursor.key.size = 0; in __bt_close()
91 t->bt_cursor.key.data = NULL; in __bt_close()
|
| H A D | btree.h | 362 CURSOR bt_cursor; /* cursor */ member
|
| H A D | bt_split.c | 717 c = &t->bt_cursor; in bt_psplit()
|