Lines Matching defs:leaves
159 unsigned int leaves;
1078 * leaves us in position for handling as case 3
1461 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1928 /* update the suffix to address pulled leaves */
1999 /* update the suffix to address pulled leaves */
2493 s->leaves++;
2517 if (stat->leaves)
2518 avdepth = stat->totdepth*100 / stat->leaves;
2526 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
2527 bytes = LEAF_SIZE * stat->leaves;