138 	int n_blocks;  member
271 	memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels));  in find_levels()
291 	i = opt_state->n_blocks * opt_state->nodewords;  in find_dom()
363 	      opt_state->n_blocks * opt_state->nodewords * sizeof(*opt_state->all_closure_sets));  in find_closure()
1641 	for (i = 0; i < opt_state->n_blocks; ++i)  in find_inedges()
1801 	for (i = 0; i < opt_state->n_blocks; ++i)  in intern_blocks()
1806 	for (i = opt_state->n_blocks - 1; --i >= 0; ) {  in intern_blocks()
1809 		for (j = i + 1; j < opt_state->n_blocks; ++j) {  in intern_blocks()
1819 	for (i = 0; i < opt_state->n_blocks; ++i) {  in intern_blocks()
1887 	n = opt_state->n_blocks++;  in number_blks_r()
1946 	opt_state->n_blocks = 0;  in opt_init()
1949 	opt_state->n_edges = 2 * opt_state->n_blocks;  in opt_init()
1957 	opt_state->levels = (struct block **)calloc(opt_state->n_blocks, sizeof(*opt_state->levels));  in opt_init()
1962 	opt_state->nodewords = opt_state->n_blocks / (8 * sizeof(bpf_u_int32)) + 1;  in opt_init()
1965 …opt_state->space = (bpf_u_int32 *)malloc(2 * opt_state->n_blocks * opt_state->nodewords * sizeof(*…  in opt_init()
1990 		b->ef.id = opt_state->n_blocks + i;  in opt_init()
1991 		opt_state->edges[opt_state->n_blocks + i] = &b->ef;  in opt_init()