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

  /src/lib/libc/db/btree/
bt_conv.c 88 M_16_SWAP(h->linp[i]);
103 M_16_SWAP(h->linp[i]);
159 M_16_SWAP(h->linp[i]);
184 M_16_SWAP(h->linp[i]);
bt_split.c 115 h->linp[skip] = h->upper;
228 memmove(h->linp + skip + 1, h->linp + skip,
237 h->linp[skip] = h->upper -= nbytes;
238 dest = (char *)(void *)h + h->linp[skip];
243 h->linp[skip] = h->upper -= nbytes;
244 dest = (char *)(void *)h + h->linp[skip];
261 dest = (char *)(void *)h + h->linp[skip - 1];
263 dest = (char *)(void *)l + l->linp[NEXTINDEX(l) - 1];
268 h->linp[skip] = h->upper -= nbytes
    [all...]
btree.h 85 indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */ member in struct:_page
144 ((BINTERNAL *)(void *)((char *)(void *)(pg) + (pg)->linp[indx]))
182 ((RINTERNAL *)(void *)((char *)(void *)(pg) + (pg)->linp[indx]))
205 ((BLEAF *)(void *)((char *)(void *)(pg) + (pg)->linp[indx]))
250 ((RLEAF *)(void *)((char *)(void *)(pg) + (pg)->linp[indx]))
bt_put.c 213 memmove(h->linp + idx + 1, h->linp + idx,
217 h->linp[idx] = h->upper -= nbytes;
bt_delete.c 433 offset = pg->linp[idx];
434 for (cnt = idx, ip = &pg->linp[0]; cnt--; ++ip)
498 offset = h->linp[idx];
499 for (cnt = idx, ip = &h->linp[0]; cnt--; ++ip)
bt_debug.c 236 (void)fprintf(tracefp, "\t[%03d] %4d ", cur, h->linp[cur]);
bt_open.c 360 root->linp[0] == 0) {
  /src/lib/libc/db/recno/
rec_delete.c 184 offset = h->linp[idx];
185 temp = &h->linp[idx] - (ip = &h->linp[0]);
190 temp = &h->linp[NEXTINDEX(h)] - ip;
rec_put.c 269 memmove(h->linp + idx + 1, h->linp + idx,
273 h->linp[idx] = h->upper -= nbytes;

Completed in 15 milliseconds