Lines Matching full:levels
133 struct block **levels;
210 b->link = levels[level];
211 levels[level] = b;
215 * Level graph. The levels go from 0 at the leaves to
216 * N_LEVELS at the root. The levels[] array points to the
223 memset((char *)levels, 0, n_blocks * sizeof(*levels));
252 for (b = levels[i]; b; b = b->link) {
291 for (b = levels[i]; b != 0; b = b->link) {
319 for (b = levels[i]; b; b = b->link) {
489 for (p = levels[i]; p; p = p->link) {
495 for (p = levels[i]; p; p = p->link) {
1567 for (p = levels[i]; p; p = p->link)
1578 for (p = levels[i]; p; p = p->link) {
1586 for (p = levels[i]; p; p = p->link) {
1614 for (b = levels[i]; b != 0; b = b->link) {
1809 free((void *)levels);
1921 * The number of levels is bounded by the number of nodes.
1923 levels = (struct block **)calloc(n_blocks, sizeof(*levels));
1924 if (levels == NULL)
