HomeSort by: relevance | last modified time | path
    Searched refs:F_ISSET (Results 1 - 19 of 19) sorted by relevancy

  /src/lib/libc/db/recno/
rec_seq.c 85 if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
94 if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
101 if (!F_ISSET(t, R_EOF | R_INMEM) &&
112 if (!F_ISSET(t, R_EOF | R_INMEM) &&
126 if (F_ISSET(t, B_DB_LOCK))
rec_close.c 81 if (F_ISSET(t, R_MEMMAPPED) && munmap(t->bt_smap, t->bt_msize))
84 if (!F_ISSET(t, R_INMEM)) {
85 if (F_ISSET(t, R_CLOSEFP)) {
130 if (F_ISSET(t, R_RDONLY | R_INMEM) || !F_ISSET(t, R_MODIFIED))
134 if (!F_ISSET(t, R_EOF) && t->bt_irec(t, MAX_REC_NUMBER) == RET_ERROR)
147 if (F_ISSET(t, R_FIXLEN)) {
rec_put.c 85 if (F_ISSET(t, R_FIXLEN) && data->size != t->bt_reclen) {
108 if (!F_ISSET(&t->bt_cursor, CURS_INIT))
143 if (!F_ISSET(t, R_EOF | R_INMEM) &&
147 if (F_ISSET(t, R_FIXLEN)) {
160 if (F_ISSET(t, R_FIXLEN))
rec_open.c 139 F_ISSET(t, R_FIXLEN) ? __rec_fpipe : __rec_vpipe;
180 t->bt_irec = F_ISSET(t, R_FIXLEN) ?
210 !F_ISSET(t, R_EOF | R_INMEM) &&
239 if (F_ISSET(t, R_INMEM)) {
rec_utils.c 99 } else if (F_ISSET(t, B_DB_LOCK)) {
rec_get.c 92 if (F_ISSET(t, R_EOF | R_INMEM))
103 if (F_ISSET(t, B_DB_LOCK))
rec_delete.c 91 if (!F_ISSET(&t->bt_cursor, CURS_INIT))
  /src/lib/libc/db/btree/
bt_close.c 139 if (F_ISSET(t, B_INMEM | B_RDONLY)
140 || !F_ISSET(t, B_MODIFIED | B_METADIRTY))
143 if (F_ISSET(t, B_METADIRTY) && bt_meta(t) == RET_ERROR)
176 m.flags = F_ISSET(t, SAVEMETA);
bt_put.c 91 if (F_ISSET(t, B_RDONLY)) {
105 if (F_ISSET(&t->bt_cursor, CURS_INIT) &&
106 !F_ISSET(&t->bt_cursor,
184 if (!exact || !F_ISSET(t, B_NODUPS))
222 if (F_ISSET(&t->bt_cursor, CURS_INIT) &&
223 !F_ISSET(&t->bt_cursor, CURS_ACQUIRE) &&
bt_get.c 99 if (F_ISSET(t, B_DB_LOCK))
bt_debug.c 92 F_ISSET(t, B_INMEM) ? "memory" : "disk", t->bt_psize);
93 if (F_ISSET(t, R_RECNO))
97 if (F_ISSET(t, flag)) { \
344 i = F_ISSET(t, R_RECNO) ?
352 if (F_ISSET(t, R_RECNO))
bt_delete.c 81 if (F_ISSET(t, B_RDONLY)) {
96 if (F_ISSET(c, CURS_INIT)) {
97 if (F_ISSET(c, CURS_ACQUIRE | CURS_AFTER | CURS_BEFORE))
316 if (F_ISSET(t, B_NODUPS)) {
477 if (F_ISSET(&t->bt_cursor, CURS_INIT) &&
478 !F_ISSET(&t->bt_cursor, CURS_ACQUIRE) &&
507 if (F_ISSET(&t->bt_cursor, CURS_INIT) &&
508 !F_ISSET(&t->bt_cursor, CURS_ACQUIRE) &&
544 if (!F_ISSET(t, B_NODUPS)) {
bt_seq.c 106 if (F_ISSET(&t->bt_cursor, CURS_INIT)) {
131 if (F_ISSET(t, B_DB_LOCK))
287 if (F_ISSET(c, CURS_ACQUIRE)) {
317 if (F_ISSET(c, CURS_AFTER))
342 if (F_ISSET(c, CURS_BEFORE)) {
481 if (F_ISSET(t, B_NODUPS)) {
bt_conv.c 70 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
137 if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))
bt_utils.c 89 } else if (copy || F_ISSET(t, B_DB_LOCK)) {
114 } else if (copy || F_ISSET(t, B_DB_LOCK)) {
bt_open.c 309 if (!F_ISSET(t, B_INMEM))
423 if (F_ISSET(t, B_INMEM)) {
bt_search.c 107 if (!F_ISSET(t, B_NODUPS)) {
bt_split.c 117 if (F_ISSET(t, R_RECNO))
124 (F_ISSET(t, R_RECNO) ?
303 (F_ISSET(t, R_RECNO) ?
718 if (F_ISSET(c, CURS_INIT) && c->pg.pgno == h->pgno) {
btree.h 44 #define F_ISSET(p, f) ((p)->flags & (f))

Completed in 20 milliseconds