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

  /src/lib/libc/db/btree/
bt_put.c 278 t->bt_cur.page = h;
279 t->bt_cur.index = t->bt_last.index;
290 if (t->bt_cur.page->nextpg != P_INVALID)
292 if (t->bt_cur.index != NEXTINDEX(h) - 1)
294 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) < 0)
296 t->bt_last.index = cmp ? ++t->bt_cur.index : t->bt_cur.index;
298 if (t->bt_cur.page->prevpg != P_INVALID)
300 if (t->bt_cur.index != 0)
302 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) > 0
    [all...]
bt_search.c 66 * the bt_cur field of the tree. A pointer to the field is returned.
82 t->bt_cur.page = h;
84 t->bt_cur.index = idx = base + ((uint32_t)lim >> 1);
85 if ((cmp = __bt_cmp(t, key, &t->bt_cur)) == 0) {
88 return (&t->bt_cur);
111 return (&t->bt_cur);
115 return (&t->bt_cur);
118 t->bt_cur.index = base;
119 return (&t->bt_cur);
172 t->bt_cur = e
    [all...]
btree.h 359 EPG bt_cur; /* current (pinned) page */ member in struct:_btree
  /src/lib/libc/db/recno/
rec_search.c 64 * the bt_cur field of the tree. A pointer to the field is returned.
83 t->bt_cur.page = h;
84 t->bt_cur.index = recno - total;
85 return (&t->bt_cur);

Completed in 13 milliseconds