141 struct block **levels;  variable
219 	b->link = levels[level];  in find_levels_r()
220 	levels[level] = b;  in find_levels_r()
232 	memset((char *)levels, 0, n_blocks * sizeof(*levels));  in find_levels()
261 		for (b = levels[i]; b; b = b->link) {  in find_dom()
300 		for (b = levels[i]; b != 0; b = b->link) {  in find_edom()
328 		for (b = levels[i]; b; b = b->link) {  in find_closure()
469 		for (p = levels[i]; p; p = p->link) {  in find_ud()
475 		for (p = levels[i]; p; p = p->link) {  in find_ud()
1448 		for (p = levels[i]; p; p = p->link)  in opt_blks()
1459 		for (p = levels[i]; p; p = p->link) {  in opt_blks()
1465 		for (p = levels[i]; p; p = p->link) {  in opt_blks()
1493 		for (b = levels[i]; b != 0; b = b->link) {  in find_inedges()
1674 	free((void *)levels);  in opt_cleanup()
1776 	levels = reallocarray(NULL, n_blocks, sizeof(*levels));  in opt_init()
1777 	if (levels == NULL)  in opt_init()