Lines Matching refs:entries
229 vdp, h, pgno, &pip->entries, flags)) != 0)
346 vdp, h, pgno, &pip->entries, flags)) != 0)
349 vdp, h, pgno, &pip->entries, flags)) != 0) {
378 * Verify that all entries in a P_IRECNO inp[] array are reasonable,
423 "Page %lu: entries listing %lu overlaps data",
497 * Verify that all entries in inp[] array are reasonable;
549 * run out of entries or collide with the data. Keep track
590 * Having two inp entries that point at the same patch
638 * Overflow entries on internal pages are stored
639 * as the _data_ of a BINTERNAL; overflow entries
879 nentries = pip->entries;
918 * Loop through the entries. nentries ought to contain the
922 * and LDUP pages, we want to check the order of all entries.
1357 * must verify that for each pair of BINTERNAL entries
1498 /* Skip any overflow entries. */
1693 * itself, which must sort lower than all entries on its child;
1699 for (i = 0; i < pip->entries; i += O_INDX) {
1701 ri = (i + O_INDX < pip->entries) ?
1705 * The leftmost key is forcibly sorted less than all entries,
2246 * as seen. P_IBTREE entries will