118 static int n_blocks;  variable
219 	memset((char *)levels, 0, n_blocks * sizeof(*levels));  in find_levels()
239 	i = n_blocks * nodewords;  in find_dom()
311 	      n_blocks * nodewords * sizeof(*all_closure_sets));  in find_closure()
1616 	for (i = 0; i < n_blocks; ++i)  in find_inedges()
1777 	for (i = 0; i < n_blocks; ++i)  in intern_blocks()
1782 	for (i = n_blocks - 1; --i >= 0; ) {  in intern_blocks()
1785 		for (j = i + 1; j < n_blocks; ++j) {  in intern_blocks()
1795 	for (i = 0; i < n_blocks; ++i) {  in intern_blocks()
1863 	n = n_blocks++;  in number_blks_r()
1922 	n_blocks = 0;  in opt_init()
1925 	n_edges = 2 * n_blocks;  in opt_init()
1933 	levels = (struct block **)calloc(n_blocks, sizeof(*levels));  in opt_init()
1938 	nodewords = n_blocks / (8 * sizeof(bpf_u_int32)) + 1;  in opt_init()
1941 	space = (bpf_u_int32 *)malloc(2 * n_blocks * nodewords * sizeof(*space)  in opt_init()
1966 		b->ef.id = n_blocks + i;  in opt_init()
1967 		edges[n_blocks + i] = &b->ef;  in opt_init()