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

  /src/lib/libc/db/hash/
hash_page.c 160 if (bp[i + 1] == OVFLPAGE) {
313 if (ino[2] < REAL_KEY && ino[2] != OVFLPAGE) {
331 } else if (ino[n + 1] == OVFLPAGE) {
421 else if (bp[2] < REAL_KEY && bp[bp[0]] != OVFLPAGE) {
427 } else if (bp[bp[0]] != OVFLPAGE) {
521 sp[ndx + 2] = OVFLPAGE;
890 sp[n + 2] = OVFLPAGE;
923 while (bp[0] && ((bp[bp[0]] == OVFLPAGE) ||
hash.h 193 * OVFLPAGE Rather than a key data pair, this pair contains
196 * OVERFLOW_PAGE_NUMBER OVFLPAGE
203 * KEY_OFF PARTIAL_KEY OVFL_PAGENO OVFLPAGE
208 * OVFLPAGE -- 0
224 * OVFLPAGE -- 0
237 * OVFLPAGE -- 0
262 * DATA_OFF FULL_KEY_DATA <OVFL_PAGENO> <OVFLPAGE>
268 * OVFLPAGE -- 0
270 * OVFL_PAGENO and OVFLPAGE are optional (they are
274 #define OVFLPAGE
    [all...]
hash_bigkey.c 270 bp[2] = OVFLPAGE;
359 * either only 2 entries OVFLPAGE marker is explicit there
363 ((n == 2) || (bp[n] == OVFLPAGE) || (FREESPACE(bp))))
633 tp[++n] = OVFLPAGE;
656 * and tp[4] is OVFLPAGE. If there are two, tp[4] contains
hash.c 610 } else if (bp[1] == OVFLPAGE) {
787 while (bp[hashp->cndx + 1] == OVFLPAGE) {

Completed in 13 milliseconds