Lines Matching refs:levels
157 struct block **levels;
235 b->link = levels[level];
236 levels[level] = b;
240 * Level graph. The levels go from 0 at the leaves to
241 * N_LEVELS at the root. The levels[] array points to the
249 memset((char *)levels, 0, n_blocks * sizeof(*levels));
279 for (b = levels[i]; b; b = b->link) {
320 for (b = levels[i]; b != 0; b = b->link) {
349 for (b = levels[i]; b; b = b->link) {
523 for (p = levels[i]; p; p = p->link) {
529 for (p = levels[i]; p; p = p->link) {
1618 for (p = levels[i]; p; p = p->link)
1629 for (p = levels[i]; p; p = p->link) {
1637 for (p = levels[i]; p; p = p->link) {
1668 for (b = levels[i]; b != 0; b = b->link) {
1872 free((void *)levels);
1989 * The number of levels is bounded by the number of nodes.
1991 levels = (struct block **)calloc(n_blocks, sizeof(*levels));
1992 if (levels == NULL)
