260 …u_int n_blocks;		/* number of blocks in the CFG; guaranteed to be > 0, as it's a RET instruction a…  member
408 	memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels));  in find_levels()
432 	i = opt_state->n_blocks * opt_state->nodewords;  in find_dom()
514 	      opt_state->n_blocks * opt_state->nodewords * sizeof(*opt_state->all_closure_sets));  in find_closure()
2140 	for (i = 0; i < opt_state->n_blocks; ++i)  in find_inedges()
2361 	for (i = 0; i < opt_state->n_blocks; ++i)  in intern_blocks()
2366 	for (i = opt_state->n_blocks - 1; i != 0; ) {  in intern_blocks()
2370 		for (j = i + 1; j < opt_state->n_blocks; ++j) {  in intern_blocks()
2380 	for (i = 0; i < opt_state->n_blocks; ++i) {  in intern_blocks()
2466 	n = opt_state->n_blocks++;  in number_blks_r()
2467 	if (opt_state->n_blocks == 0) {  in number_blks_r()
2533 	opt_state->n_blocks = 0;  in opt_init()
2539 	if (opt_state->n_blocks == 0)  in opt_init()
2542 	opt_state->n_edges = 2 * opt_state->n_blocks;  in opt_init()
2543 	if ((opt_state->n_edges / 2) != opt_state->n_blocks) {  in opt_init()
2557 	opt_state->levels = (struct block **)calloc(opt_state->n_blocks, sizeof(*opt_state->levels));  in opt_init()
2563 	opt_state->nodewords = opt_state->n_blocks / BITS_PER_WORD + 1;  in opt_init()
2570 	product = opt_state->n_blocks * opt_state->nodewords;  in opt_init()
2571 	if ((product / opt_state->n_blocks) != opt_state->nodewords) {  in opt_init()
2642 		b->ef.id = opt_state->n_blocks + i;  in opt_init()
2643 		opt_state->edges[opt_state->n_blocks + i] = &b->ef;  in opt_init()