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

  /src/external/mpl/bind/dist/fuzz/
dns_qp.c 174 ASSERT(qp->leaf_count == count);
179 ASSERT(qp->leaf_count == count);
194 ASSERT(qp->leaf_count == count);
199 ASSERT(qp->leaf_count == count);
  /src/external/mpl/bind/dist/tests/libtest/
qp.c 135 qp->leaf_count, qp->used_count - qp->free_count, qp->used_count,
207 dns_qpcell_t leaf_count = 0; local
258 leaf_count++;
263 printf("LEAVES %d\n", leaf_count);
  /src/external/mpl/bind/dist/lib/dns/
qp.c 747 qp->leaf_count, qp->used_count - qp->free_count,
794 qp->leaf_count, qp->used_count - qp->free_count,
898 qpw->leaf_count, qpw->used_count - qpw->free_count,
1006 qp->leaf_count, qp->used_count - qp->free_count,
1015 if (qp->leaf_count > 0) {
1025 time, qp->leaf_count, qp->used_count - qp->free_count,
1099 .leaves = qp->leaf_count,
1678 if (qp->leaf_count == 0) {
1683 qp->leaf_count++;
1748 qp->leaf_count++
    [all...]
qp_p.h 491 dns_qpcell_t leaf_count; member in struct:dns_qp
  /src/usr.sbin/fstyp/
hammer2_disk.h 607 * leaf_count - Helps manage leaf collapse calculations when indirect
632 uint16_t leaf_count; /* leaf aggregation count */ member in struct:hammer2_blockref

Completed in 27 milliseconds