HomeSort by: relevance | last modified time | path
    Searched refs:bblocks (Results 1 - 5 of 5) sorted by relevancy

  /src/external/bsd/pcc/dist/pcc/mip/
optim2.c 83 /* create "proper" basic blocks, add labels where needed (so bblocks have labels) */
147 computeDF(p2e, DLIST_NEXT(&p2e->bblocks, bbelem));
159 renamevar(p2e,DLIST_NEXT(&p2e->bblocks, bbelem));
704 * Also fills the labelinfo struct with information about which bblocks
727 DLIST_INIT(&p2e->bblocks, bbelem);
748 DLIST_INSERT_BEFORE(&p2e->bblocks, bb, bbelem);
763 DLIST_FOREACH(bb, &p2e->bblocks, bbelem) {
783 DLIST_FOREACH(bb, &p2e->bblocks, bbelem) {
789 DLIST_FOREACH(bb, &p2e->bblocks, bbelem) {
820 DLIST_FOREACH(bb, &p2e->bblocks, bbelem)
    [all...]
pass2.h 528 struct basicblock bblocks; member in struct:p2env
regs.c 1433 DLIST_FOREACH(bb, &p2e->bblocks, bbelem) {
1564 DLIST_FOREACH(bb, &p2e->bblocks, bbelem) {
1622 DLIST_INIT(&p2e->bblocks, bbelem);
1623 DLIST_INSERT_AFTER(&p2e->bblocks, &bbfake, bbelem);
1661 DLIST_FOREACH_REVERSE(bb, &p2e->bblocks, bbelem) {
1678 DLIST_FOREACH(bb, &p2e->bblocks, bbelem) {
1713 DLIST_FOREACH(bb, &p2e->bblocks, bbelem) {
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-threadupdate.cc 1641 basic_block *bblocks; local
1672 bblocks = XCNEWVEC (basic_block, loop->num_nodes);
1675 bblocks, loop->num_nodes, bb);
1677 FOR_EACH_EDGE (e, ei, bblocks[i]->preds)
1681 free (bblocks);
1688 free (bblocks);
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-threadupdate.cc 1648 basic_block *bblocks; local
1679 bblocks = XCNEWVEC (basic_block, loop->num_nodes);
1682 bblocks, loop->num_nodes, bb);
1684 FOR_EACH_EDGE (e, ei, bblocks[i]->preds)
1688 free (bblocks);
1695 free (bblocks);

Completed in 27 milliseconds