Lines Matching full:levels
149 struct block **levels;
258 b->link = opt_state->levels[level];
259 opt_state->levels[level] = b;
263 * Level graph. The levels go from 0 at the leaves to
264 * N_LEVELS at the root. The opt_state->levels[] array points to the
271 memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels));
300 for (b = opt_state->levels[i]; b; b = b->link) {
339 for (b = opt_state->levels[i]; b != 0; b = b->link) {
367 for (b = opt_state->levels[i]; b; b = b->link) {
537 for (p = opt_state->levels[i]; p; p = p->link) {
543 for (p = opt_state->levels[i]; p; p = p->link) {
1602 for (p = opt_state->levels[i]; p; p = p->link)
1613 for (p = opt_state->levels[i]; p; p = p->link) {
1621 for (p = opt_state->levels[i]; p; p = p->link) {
1649 for (b = opt_state->levels[i]; b != 0; b = b->link) {
1843 free((void *)opt_state->levels);
1955 * The number of levels is bounded by the number of nodes.
1957 opt_state->levels = (struct block **)calloc(opt_state->n_blocks, sizeof(*opt_state->levels));
1958 if (opt_state->levels == NULL)
