Lines Matching defs:inp
225 * Verify inp[]. Return immediately if it returns DB_VERIFY_BAD;
240 * Walk through inp and see if the lengths of all the records are the
242 * save off this value. We know inp to be safe if we've gotten this
342 * Verify inp[].
361 * We know that the elements of inp are reasonable.
378 * Verify that all entries in a P_IRECNO inp[] array are reasonable,
398 db_indx_t *inp;
419 inp = P_INP(dbp, h);
421 if ((u_int8_t *)inp + i >= (u_int8_t *)h + himark) {
428 offset = inp[i];
431 * somewhere after the inp array and before the end of the
434 if (offset <= (u_int32_t)((u_int8_t *)inp + i -
497 * Verify that all entries in inp[] array are reasonable;
548 * Loop through inp[], the array of items, until we either
552 * For each element in inp[i], make sure it references a region
553 * that starts after the end of the inp array (as defined by
590 * Having two inp entries that point at the same patch
835 * Assumes that NUM_ENT(h) and inp[0]..inp[NUM_ENT(h) - 1] are
865 db_indx_t i, *inp;
927 inp = P_INP(dbp, h);
1032 cmp = inp[i] == inp[i - adj] ? 0 : func(dbp, p1, p2);
1042 if (inp[i] != inp[i - adj]) {
2051 db_indx_t i, last, beg, end, *inp;
2059 inp = P_INP(dbp, h);
2080 * Loop through the inp array, spitting out key/data pairs.
2163 beg = end = inp[i];
2238 inp[i] == inp[i - adj]) {
2309 * the gaps in case we had any bogus inp elements and thereby