search for: insersion

...block->succ_size() == 1 && (*block->succ_begin())->pred_size() == 1 ) { block = *block->succ_begin(); seen[block->getNumber()] = true; blocks.push_back( block ); } // TODO: // For each basic block bb in blocks in order of insersion: // 1. Remove basic blocks in the block vector from the machine function. // 2. Remove the jump from the start block if it exists. // 3. Add the instruction from bb into the start block. } Thanks, Jeff Kunkel On Wed, Oct 6, 2010 at 7:49 PM, Bob Wilson <bob.wilson...

Has anyone written a pass at the MachineFunction level which combines machine basic blocks which is guaranteed to be the single predecessor to another block? Or is there a reason not to combine them? - Thanks Jeff Kunkel

On Oct 6, 2010, at 4:31 PM, Jeff Kunkel wrote: > Has anyone written a pass at the MachineFunction level which combines > machine basic blocks which is guaranteed to be the single predecessor > to another block? Or is there a reason not to combine them? I'm not sure exactly what transformation you're referring to, but BranchFolder::OptimizeBranches does a lot of things like that.

...t;>>          block = *block->succ_begin(); >>>>          seen[block->getNumber()] = true; >>>>          blocks.push_back( block ); >>>>        } >>>>        // TODO: >>>>        // For each basic block bb in blocks in order of insersion: >>>>        // 1. Remove basic blocks in the block vector from the machine function. >>>>        // 2. Remove the jump from the start block if it exists. >>>>        // 3. Add the instruction from bb into the start block. >>>>      } >>>>...