Lines Matching defs:leaves
161 unsigned int leaves;
1126 * leaves us in position for handling as case 3
1509 /* Step 2: Sort out leaves and begin backtracing for longest prefix */
1979 /* update the suffix to address pulled leaves */
2050 /* update the suffix to address pulled leaves */
2536 s->leaves++;
2560 if (stat->leaves)
2561 avdepth = stat->totdepth*100 / stat->leaves;
2569 seq_printf(seq, "\tLeaves: %u\n", stat->leaves);
2570 bytes = LEAF_SIZE * stat->leaves;