| Index: src/IceCfg.cpp
|
| diff --git a/src/IceCfg.cpp b/src/IceCfg.cpp
|
| index bb738a78c7d541b152ada34ace53659b65f3feb1..db2904d1f724ef4bb595487a122fe845a6024ccc 100644
|
| --- a/src/IceCfg.cpp
|
| +++ b/src/IceCfg.cpp
|
| @@ -261,8 +261,9 @@ void Cfg::fixPhiNodes() {
|
|
|
| void Cfg::computeInOutEdges() {
|
| // Compute the out-edges.
|
| - for (CfgNode *Node : Nodes)
|
| + for (CfgNode *Node : Nodes) {
|
| Node->computeSuccessors();
|
| + }
|
|
|
| // Prune any unreachable nodes before computing in-edges.
|
| SizeT NumNodes = getNumNodes();
|
| @@ -599,6 +600,7 @@ void Cfg::processAllocas(bool SortAndCombine) {
|
| TimerMarker _(TimerStack::TT_alloca, this);
|
| const uint32_t StackAlignment = getTarget()->getStackAlignment();
|
| CfgNode *EntryNode = getEntryNode();
|
| + assert(EntryNode);
|
| // LLVM enforces power of 2 alignment.
|
| assert(llvm::isPowerOf2_32(StackAlignment));
|
| // Determine if there are large alignment allocations in the entry block or
|
|
|