The abstraction is created similar to CallGraph. It has the concept of LoopNode and InstructionLoopNode and corresponding two different edges. Each edge can be Must or May. The current loop nesting tree edges are must edge and their subedges have null InstructionNode.
The current implementation for creating Loop Nesting Graph is in Noelle_loops.cpp, it can be moved to better place (and remove the createEdge public API current exposed to Noelle).
Need testing
The abstraction is created similar to CallGraph. It has the concept of LoopNode and InstructionLoopNode and corresponding two different edges. Each edge can be Must or May. The current loop nesting tree edges are must edge and their subedges have null InstructionNode.
The current implementation for creating Loop Nesting Graph is in
Noelle_loops.cpp, it can be moved to better place (and remove thecreateEdgepublic API current exposed to Noelle).