search for: memorydepanalysi

I have checked in 3 new analyses: 1. IPModRef (analyze -ipmodref): This is a Module pass that computes flow-insensitive context-sensitive interprocedural Mod/Ref information for a program. It uses DS Graphs to track mod/ref info for distinct data structures. 2. MemoryDepAnalysis (analyze -memdep): This is a Module pass (but will eventually be a Function pass) that computes a DependenceGraph for all data-dependences on memory locations within each function (i.e., the nodes are Instructions; the edges are data dependences). This pass uses the IPModRef pass to f...

Here's what I've got so far - it seems to work, aside from the fact that DeleteDeadPHIs is not removing at least one dead PHI in my test program. --------------------- static bool mergeBlockIntoSuccessor(BasicBlock *pred, BasicBlock *succ) { if (succ == pred) return false; if (pred->getFirstNonPHI() != pred->getTerminator()) return false; //

On Feb 1, 2011, at 1:34 PM, Andrew Trick wrote: > On Feb 1, 2011, at 1:08 PM, Andrew Clinton wrote: > >> I have a (non-entry) basic block that contains only PHI nodes and an >> unconditional branch (that does not branch to itself). Is it always >> possible to merge this block with it's successor and produce a >> semantically equivalent program? I'm