Lines Matching defs:leaves
160 unsigned int leaves;
1125 * leaves us in position for handling as case 3
1508 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1978 /* update the suffix to address pulled leaves */
2049 /* update the suffix to address pulled leaves */
2535 s->leaves++;
2559 if (stat->leaves)
2560 avdepth = stat->totdepth*100 / stat->leaves;
2568 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
2569 bytes = LEAF_SIZE * stat->leaves;