Lines Matching defs:n_blocks
259 u_int n_blocks; /* number of blocks in the CFG; guaranteed to be > 0, as it's a RET instruction at a minimum */
261 u_int n_edges; /* twice n_blocks, so guaranteed to be > 0 */
407 memset((char *)opt_state->levels, 0, opt_state->n_blocks * sizeof(*opt_state->levels));
431 i = opt_state->n_blocks * opt_state->nodewords;
513 opt_state->n_blocks * opt_state->nodewords * sizeof(*opt_state->all_closure_sets));
2155 for (i = 0; i < opt_state->n_blocks; ++i)
2376 for (i = 0; i < opt_state->n_blocks; ++i)
2381 for (i = opt_state->n_blocks - 1; i != 0; ) {
2385 for (j = i + 1; j < opt_state->n_blocks; ++j) {
2395 for (i = 0; i < opt_state->n_blocks; ++i) {
2484 n = opt_state->n_blocks++;
2485 if (opt_state->n_blocks == 0) {
2551 opt_state->n_blocks = 0;
2557 if (opt_state->n_blocks == 0)
2560 opt_state->n_edges = 2 * opt_state->n_blocks;
2561 if ((opt_state->n_edges / 2) != opt_state->n_blocks) {
2575 opt_state->levels = (struct block **)calloc(opt_state->n_blocks, sizeof(*opt_state->levels));
2581 opt_state->nodewords = opt_state->n_blocks / BITS_PER_WORD + 1;
2584 * Make sure opt_state->n_blocks * opt_state->nodewords fits
2588 product = opt_state->n_blocks * opt_state->nodewords;
2589 if ((product / opt_state->n_blocks) != opt_state->nodewords) {
2660 b->ef.id = opt_state->n_blocks + i;
2661 opt_state->edges[opt_state->n_blocks + i] = &b->ef;