277     int i;  local
285     i = n_blocks * nodewords;
286     while (--i >= 0)
289     for (i = nodewords; --i >= 0;)
290         root->dom[i] = 0;
293     for (i = root->level; i >= 0; --i)
295         for (b = levels[i]; b; b = b->link)
324     int i;  local
329     for (i = n_edges * edgewords; --i >= 0;)
330         x[i] = ~0;
335     for (i = root->level; i >= 0; --i)
337         for (b = levels[i]; b != 0; b = b->link)
355     int i;  local
364     for (i = root->level; i >= 0; --i)
366         for (b = levels[i]; b; b = b->link)
537     int i, maxlevel;  local
545     for (i = maxlevel; i >= 0; --i)
546         for (p = levels[i]; p; p = p->link)
552     for (i = 1; i <= maxlevel; ++i)
554         for (p = levels[i]; p; p = p->link)
582 #define K(i) F(BPF_LD|BPF_IMM|BPF_W, i, 0L)  argument
1248     int i;  local
1291             for (i = 0; i < N_ATOMS; ++i)
1292                 if (b->val[i] != p->pred->val[i])
1293                     b->val[i] = 0;
1429     register int i, k;  local
1455     for (i = 0; i < edgewords; ++i)
1457         register bpf_u_int32 x = ep->edom[i];
1463             k += i * BITS_PER_WORD;
1552     for (i = 0; i < N_ATOMS; ++i)
1553         if ((*samep)->val[i] != pred->val[i])
1647     for (i = 0; i < N_ATOMS; ++i)
1648         if ((*samep)->val[i] != pred->val[i])
1681     int i, maxlevel;  local
1688     for (i = maxlevel; i >= 0; --i)
1689         for (p = levels[i]; p; p = p->link)
1699     for (i = 1; i <= maxlevel; ++i)
1701         for (p = levels[i]; p; p = p->link)
1709     for (i = 1; i <= maxlevel; ++i)
1711         for (p = levels[i]; p; p = p->link)
1730     int i;  local
1733     for (i = 0; i < n_blocks; ++i)
1734         blocks[i]->in_edges = 0;
1740     for (i = root->level; i > 0; --i)
1742         for (b = levels[i]; b != 0; b = b->link)
1899     int i, j;  local
1903     for (i = 0; i < n_blocks; ++i)
1904         blocks[i]->link = 0;
1908     for (i = n_blocks - 1; --i >= 0;)
1910         if (!isMarked(blocks[i]))
1912         for (j = i + 1; j < n_blocks; ++j)
1916             if (eq_blk(blocks[i], blocks[j]))
1918                 blocks[i]->link = blocks[j]->link ? blocks[j]->link : blocks[j];
1923     for (i = 0; i < n_blocks; ++i)
1925         p = blocks[i];
2040     int i, n, max_stmts;  local
2077     for (i = 0; i < n; ++i)
2079         blocks[i]->dom = p;
2083     for (i = 0; i < n; ++i)
2085         blocks[i]->closure = p;
2089     for (i = 0; i < n; ++i)
2091         register struct block *b = blocks[i];
2097         b->et.id = i;
2098         edges[i] = &b->et;
2099         b->ef.id = n_blocks + i;
2100         edges[n_blocks + i] = &b->ef;
2105     for (i = 0; i < n; ++i)
2106         max_stmts += slength(blocks[i]->stmts) + 1;
2204             int i;  local
2218             for (i = 0; i < slen; i++)
2220                 if (offset[i] == src->s.jt)
2227                     dst->jt = i - off - 1;
2230                 if (offset[i] == src->s.jf)
2236                     dst->jf = i - off - 1;