if (MachineLoop *Loop = MLI.getLoopFor(&MBB)) {
// Assert that loops are contiguous.
assert(Loop->getHeader() == Loop->getTopBlock());
- assert(Loop->getHeader() == &MBB ||
- MLI.getLoopFor(prev(MachineFunction::iterator(&MBB))) == Loop);
+ assert((Loop->getHeader() == &MBB ||
+ Loop->contains(
+ MLI.getLoopFor(prev(MachineFunction::iterator(&MBB))))) &&
+ "Loop isn't contiguous");
} else {
// Assert that non-loops have no backedge predecessors.
for (auto Pred : MBB.predecessors())
for (auto &MBB : MF) {
// Place the LOOP for loops.
if (MachineLoop *Loop = MLI.getLoopFor(&MBB))
- if (Loop->getHeader() == &MBB)
+ if (Loop->getHeader() == &MBB) {
+ // The operand of a LOOP is the first block after the loop. If the loop
+ // is the bottom of the function, insert a dummy block at the end.
+ MachineBasicBlock *Bottom = Loop->getBottomBlock();
+ auto Iter = next(MachineFunction::iterator(Bottom));
+ if (Iter == MF.end()) {
+ MF.push_back(MF.CreateMachineBasicBlock());
+ Iter = next(MachineFunction::iterator(Bottom));
+ }
BuildMI(MBB, MBB.begin(), DebugLoc(), TII.get(WebAssembly::LOOP))
- .addMBB(Loop->getBottomBlock());
+ .addMBB(Iter);
+ }
// Check for forward branches and switches that need BLOCKS placed.
for (auto &Term : MBB.terminators())
store volatile i32 4, i32* %p
ret i32 0
}
+
+; Test that nested loops are handled.
+
+declare void @bar()
+
+define void @test3(i32 %w) {
+entry:
+ br i1 undef, label %outer.ph, label %exit
+
+outer.ph:
+ br label %outer
+
+outer:
+ %tobool = icmp eq i32 undef, 0
+ br i1 %tobool, label %inner, label %unreachable
+
+unreachable:
+ unreachable
+
+inner:
+ %c = icmp eq i32 undef, %w
+ br i1 %c, label %if.end, label %inner
+
+exit:
+ ret void
+
+if.end:
+ call void @bar()
+ br label %outer
+}