This is an archive of the discontinued LLVM Phabricator instance.

Differential D135967

[StructurizeCFG][DebugInfo] Maintain DILocations in the branches created by StructurizeCFG
ClosedPublic

Authored by jmmartinez on Oct 14 2022, 9:14 AM.

Details

Reviewers
arsenm
Commits
rG256f8b06c605: [StructurizeCFG][DebugInfo] Maintain DILocations in the branches created by…
Summary

Make StructurizeCFG preserve the debug locations of the branch instructions it introduces.

Diff Detail

Event Timeline

jmmartinez created this revision.Oct 14 2022, 9:14 AM
Herald added a project: Restricted Project. · View Herald TranscriptOct 14 2022, 9:14 AM
Herald added a subscriber: hiraditya. · View Herald Transcript
Harbormaster completed remote builds in B192193: Diff 467795.Oct 14 2022, 9:15 AM
jmmartinez updated this revision to Diff 467797.Oct 14 2022, 9:19 AM

Updated todo comments before the weekend

Harbormaster completed remote builds in B192194: Diff 467797.Oct 14 2022, 9:20 AM
jmmartinez updated this revision to Diff 468573.Oct 18 2022, 8:42 AM

Small update to submit for review.

Check the following recordings to see the differences while debugging

Notice how the behaviour after the patch is applied matches what happens for the cpu case.

jmmartinez published this revision for review.Oct 18 2022, 8:45 AM
jmmartinez edited the summary of this revision. (Show Details)
jmmartinez added a reviewer: arsenm.
Herald added a project: Restricted Project. · View Herald TranscriptOct 18 2022, 8:45 AM
Herald added subscribers: llvm-commits, wdng. · View Herald Transcript
jmmartinez added inline comments.Oct 18 2022, 8:46 AM
llvm/lib/Transforms/Scalar/StructurizeCFG.cpp
966

Fix this: remove empty line

Herald added a subscriber: ormris. · View Herald TranscriptOct 18 2022, 8:46 AM
jmmartinez marked an inline comment as not done.Oct 18 2022, 8:46 AM
arsenm added inline comments.Oct 18 2022, 8:48 AM
llvm/lib/Transforms/Scalar/StructurizeCFG.cpp
869

Why can't you just directly set the debug info when the terminator is created?

jmmartinez added inline comments.Oct 18 2022, 9:02 AM
llvm/lib/Transforms/Scalar/StructurizeCFG.cpp
869

That was my original approach, however I struggled to make it always work.

For example, in the function changeExit when the branch is created and appended to the basic-block, sometimes there is the old terminator that's going to be replaced, but sometims the basic-block is empty (when it's a new flow block created by getNextFlow).

In the end, I picked the current strategy since it was the simpler one.

Harbormaster completed remote builds in B192775: Diff 468573.Oct 18 2022, 10:28 AM
jmmartinez added inline comments.Oct 19 2022, 12:29 AM
llvm/test/Transforms/StructurizeCFG/structurizecfg-debug-loc.ll
41

Remove this comment. This is the good behaviour.

71

Remove this one too. Again, this gives the good behaviour.

jmmartinez updated this revision to Diff 468800.Oct 19 2022, 12:38 AM

Removed useless TODO and empty line

jmmartinez added a project: Restricted Project.Oct 19 2022, 12:39 AM
Harbormaster completed remote builds in B192923: Diff 468800.Oct 19 2022, 1:16 AM
jmmartinez marked an inline comment as done.Oct 25 2022, 2:51 AM
arsenm added inline comments.Oct 25 2022, 2:03 PM
llvm/lib/Transforms/Scalar/StructurizeCFG.cpp
555

I think the current guidance is DebugLocs should be handled by const reference

jmmartinez updated this revision to Diff 470784.Oct 26 2022, 5:00 AM
  • Handle DebugLoc by const-ref instead of by copy
jmmartinez marked an inline comment as done.Oct 26 2022, 5:03 AM
jmmartinez added inline comments.
llvm/lib/Transforms/Scalar/StructurizeCFG.cpp
555

I changed to use a const-ref in here and in the loop in setTerminatorDebugLoc . Indeed, internally it uses a TrackingMDRef so it'd better to avoid constructing a new one. Thanks !

Harbormaster completed remote builds in B194392: Diff 470784.Oct 26 2022, 5:38 AM
jmmartinez marked an inline comment as done.Oct 26 2022, 6:57 AM
arsenm accepted this revision.Oct 27 2022, 8:07 AM

LGTM (although I would be a bit happier if this was setting something at the creation point)

This revision is now accepted and ready to land.Oct 27 2022, 8:07 AM
jmmartinez updated this revision to Diff 471189.Oct 27 2022, 9:19 AM

Set DebugLoc at BranchInst creation

jmmartinez added a comment.Oct 27 2022, 9:20 AM
In D135967#3888601, @arsenm wrote:

LGTM (although I would be a bit happier if this was setting something at the creation point)

I found a way to do it (although I wasn't able to get rid of the map).

Harbormaster completed remote builds in B194677: Diff 471189.Oct 27 2022, 10:57 AM
This revision was landed with ongoing or failed builds.Oct 28 2022, 12:51 AM
Closed by commit rG256f8b06c605: [StructurizeCFG][DebugInfo] Maintain DILocations in the branches created by… (authored by jmmartinez). · Explain Why
This revision was automatically updated to reflect the committed changes.
jmmartinez added a commit: rG256f8b06c605: [StructurizeCFG][DebugInfo] Maintain DILocations in the branches created by….
arsenm added a comment.Nov 1 2022, 1:15 PM

LGTM

Revision Contents

PathSize
llvm/
lib/
Transforms/
Scalar/
26 lines
test/
Transforms/
StructurizeCFG/
202 lines

Diff 470784

llvm/lib/Transforms/Scalar/StructurizeCFG.cpp

Show First 20 Lines • Show All 82 Lines • ▼ Show 20 Lines
using PhiMap = MapVector<PHINode *, BBValueVector>; using PhiMap = MapVector<PHINode *, BBValueVector>;
using BB2BBVecMap = MapVector<BasicBlock *, BBVector>; using BB2BBVecMap = MapVector<BasicBlock *, BBVector>;
using BBPhiMap = DenseMap<BasicBlock *, PhiMap>; using BBPhiMap = DenseMap<BasicBlock *, PhiMap>;
using BBPredicates = DenseMap<BasicBlock *, Value *>; using BBPredicates = DenseMap<BasicBlock *, Value *>;
using PredMap = DenseMap<BasicBlock *, BBPredicates>; using PredMap = DenseMap<BasicBlock *, BBPredicates>;
using BB2BBMap = DenseMap<BasicBlock *, BasicBlock *>; using BB2BBMap = DenseMap<BasicBlock *, BasicBlock *>;
using BranchDebugLocMap = DenseMap<BasicBlock *, DebugLoc>;
// A traits type that is intended to be used in graph algorithms. The graph // A traits type that is intended to be used in graph algorithms. The graph
// traits starts at an entry node, and traverses the RegionNodes that are in // traits starts at an entry node, and traverses the RegionNodes that are in
// the Nodes set. // the Nodes set.
struct SubGraphTraits { struct SubGraphTraits {
using NodeRef = std::pair<RegionNode *, SmallDenseSet<RegionNode *> *>; using NodeRef = std::pair<RegionNode *, SmallDenseSet<RegionNode *> *>;
using BaseSuccIterator = GraphTraits<RegionNode *>::ChildIteratorType; using BaseSuccIterator = GraphTraits<RegionNode *>::ChildIteratorType;
// This wraps a set of Nodes into the iterator, so we know which edges to // This wraps a set of Nodes into the iterator, so we know which edges to
▲ Show 20 Lines • Show All 156 Lines • ▼ Show 20 Linesclass StructurizeCFG {
PredMap Predicates; PredMap Predicates;
BranchVector Conditions; BranchVector Conditions;
BB2BBMap Loops; BB2BBMap Loops;
PredMap LoopPreds; PredMap LoopPreds;
BranchVector LoopConds; BranchVector LoopConds;
BranchDebugLocMap TermDL;
RegionNode *PrevNode; RegionNode *PrevNode;
void orderNodes(); void orderNodes();
void analyzeLoops(RegionNode *N); void analyzeLoops(RegionNode *N);
Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert); Value *buildCondition(BranchInst *Term, unsigned Idx, bool Invert);
void gatherPredicates(RegionNode *N); void gatherPredicates(RegionNode *N);
void collectInfos(); void collectInfos();
void insertConditions(bool Loops); void insertConditions(bool Loops);
void setTerminatorDebugLoc();
void simplifyConditions(); void simplifyConditions();
void delPhiValues(BasicBlock *From, BasicBlock *To); void delPhiValues(BasicBlock *From, BasicBlock *To);
void addPhiValues(BasicBlock *From, BasicBlock *To); void addPhiValues(BasicBlock *From, BasicBlock *To);
void findUndefBlocks(BasicBlock *PHIBlock, void findUndefBlocks(BasicBlock *PHIBlock,
const SmallSet<BasicBlock *, 8> &Incomings, const SmallSet<BasicBlock *, 8> &Incomings,
▲ Show 20 Lines • Show All 251 Lines • ▼ Show 20 Lines for (RegionNode *RN : reverse(Order)) {
gatherPredicates(RN); gatherPredicates(RN);
// Remember that we've seen this node // Remember that we've seen this node
Visited.insert(RN->getEntry()); Visited.insert(RN->getEntry());
// Find the last back edges // Find the last back edges
analyzeLoops(RN); analyzeLoops(RN);
} }
// Reset the collected term debug locations
TermDL.clear();
for (BasicBlock &BB : *Func) {
if (const DebugLoc &DL = BB.getTerminator()->getDebugLoc())
arsenmUnsubmitted
Done
ReplyInline Actions

I think the current guidance is DebugLocs should be handled by const reference

arsenm: I think the current guidance is DebugLocs should be handled by const reference
jmmartinezAuthorUnsubmitted
Done
ReplyInline Actions

I changed to use a const-ref in here and in the loop in setTerminatorDebugLoc . Indeed, internally it uses a TrackingMDRef so it'd better to avoid constructing a new one. Thanks !

jmmartinez: I changed to use a const-ref in here and in the loop in setTerminatorDebugLoc . Indeed…
TermDL[&BB] = DL;
}
} }
/// Insert the missing branch conditions /// Insert the missing branch conditions
void StructurizeCFG::insertConditions(bool Loops) { void StructurizeCFG::insertConditions(bool Loops) {
BranchVector &Conds = Loops ? LoopConds : Conditions; BranchVector &Conds = Loops ? LoopConds : Conditions;
Value *Default = Loops ? BoolTrue : BoolFalse; Value *Default = Loops ? BoolTrue : BoolFalse;
SSAUpdater PhiInserter; SSAUpdater PhiInserter;
Show All 32 Lines if (ParentValue) {
if (!Dominator.resultIsRememberedBlock()) if (!Dominator.resultIsRememberedBlock())
PhiInserter.AddAvailableValue(Dominator.result(), Default); PhiInserter.AddAvailableValue(Dominator.result(), Default);
Term->setCondition(PhiInserter.GetValueInMiddleOfBlock(Parent)); Term->setCondition(PhiInserter.GetValueInMiddleOfBlock(Parent));
} }
} }
} }
void StructurizeCFG::setTerminatorDebugLoc() {
for (auto const &E : TermDL) {
BasicBlock *BB = E.first;
Instruction *Term = BB->getTerminator();
const DebugLoc &DL = E.second;
Term->setDebugLoc(DL);
}
}
/// Simplify any inverted conditions that were built by buildConditions. /// Simplify any inverted conditions that were built by buildConditions.
void StructurizeCFG::simplifyConditions() { void StructurizeCFG::simplifyConditions() {
SmallVector<Instruction *> InstToErase; SmallVector<Instruction *> InstToErase;
for (auto &I : concat<PredMap::value_type>(Predicates, LoopPreds)) { for (auto &I : concat<PredMap::value_type>(Predicates, LoopPreds)) {
auto &Preds = I.second; auto &Preds = I.second;
for (auto &J : Preds) { for (auto &J : Preds) {
auto &Cond = J.second; auto &Cond = J.second;
Instruction *Inverted; Instruction *Inverted;
▲ Show 20 Lines • Show All 238 Lines • ▼ Show 20 Lines
/// Create a new flow node and update dominator tree and region info /// Create a new flow node and update dominator tree and region info
BasicBlock *StructurizeCFG::getNextFlow(BasicBlock *Dominator) { BasicBlock *StructurizeCFG::getNextFlow(BasicBlock *Dominator) {
LLVMContext &Context = Func->getContext(); LLVMContext &Context = Func->getContext();
BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() : BasicBlock *Insert = Order.empty() ? ParentRegion->getExit() :
Order.back()->getEntry(); Order.back()->getEntry();
BasicBlock *Flow = BasicBlock::Create(Context, FlowBlockName, BasicBlock *Flow = BasicBlock::Create(Context, FlowBlockName,
Func, Insert); Func, Insert);
FlowSet.insert(Flow); FlowSet.insert(Flow);
TermDL[Flow] = TermDL[Dominator];
arsenmUnsubmitted
Done
ReplyInline Actions

Why can't you just directly set the debug info when the terminator is created?

arsenm: Why can't you just directly set the debug info when the terminator is created?
jmmartinezAuthorUnsubmitted
Done
ReplyInline Actions

That was my original approach, however I struggled to make it always work.

For example, in the function changeExit when the branch is created and appended to the basic-block, sometimes there is the old terminator that's going to be replaced, but sometims the basic-block is empty (when it's a new flow block created by getNextFlow).

In the end, I picked the current strategy since it was the simpler one.

jmmartinez: That was my original approach, however I struggled to make it always work. For example, in the…
DT->addNewBlock(Flow, Dominator); DT->addNewBlock(Flow, Dominator);
ParentRegion->getRegionInfo()->setRegionFor(Flow, ParentRegion); ParentRegion->getRegionInfo()->setRegionFor(Flow, ParentRegion);
return Flow; return Flow;
} }
/// Create a new or reuse the previous node as flow node /// Create a new or reuse the previous node as flow node
BasicBlock *StructurizeCFG::needPrefix(bool NeedEmpty) { BasicBlock *StructurizeCFG::needPrefix(bool NeedEmpty) {
BasicBlock *Entry = PrevNode->getEntry(); BasicBlock *Entry = PrevNode->getEntry();
▲ Show 20 Lines • Show All 80 Lines • ▼ Show 20 Lines if (isPredictableTrue(Node)) {
BasicBlock *Flow = needPrefix(false); BasicBlock *Flow = needPrefix(false);
// Insert extra postfix node (or use exit instead) // Insert extra postfix node (or use exit instead)
BasicBlock *Entry = Node->getEntry(); BasicBlock *Entry = Node->getEntry();
BasicBlock *Next = needPostfix(Flow, ExitUseAllowed); BasicBlock *Next = needPostfix(Flow, ExitUseAllowed);
// let it point to entry and next block // let it point to entry and next block
Conditions.push_back(BranchInst::Create(Entry, Next, BoolUndef, Flow)); Conditions.push_back(BranchInst::Create(Entry, Next, BoolUndef, Flow));
addPhiValues(Flow, Entry); addPhiValues(Flow, Entry);
jmmartinezAuthorUnsubmitted
Done
ReplyInline Actions

Fix this: remove empty line

jmmartinez: Fix this: remove empty line
DT->changeImmediateDominator(Entry, Flow); DT->changeImmediateDominator(Entry, Flow);
PrevNode = Node; PrevNode = Node;
while (!Order.empty() && !Visited.count(LoopEnd) && while (!Order.empty() && !Visited.count(LoopEnd) &&
dominatesPredicates(Entry, Order.back())) { dominatesPredicates(Entry, Order.back())) {
handleLoops(false, LoopEnd); handleLoops(false, LoopEnd);
} }
▲ Show 20 Lines • Show All 203 Lines • ▼ Show 20 Linesbool StructurizeCFG::run(Region *R, DominatorTree *DT) {
Func = R->getEntry()->getParent(); Func = R->getEntry()->getParent();
ParentRegion = R; ParentRegion = R;
orderNodes(); orderNodes();
collectInfos(); collectInfos();
createFlow(); createFlow();
insertConditions(false); insertConditions(false);
insertConditions(true); insertConditions(true);
setTerminatorDebugLoc();
setPhiValues(); setPhiValues();
simplifyConditions(); simplifyConditions();
simplifyAffectedPhis(); simplifyAffectedPhis();
rebuildSSA(); rebuildSSA();
// Cleanup // Cleanup
Order.clear(); Order.clear();
Visited.clear(); Visited.clear();
DeletedPhis.clear(); DeletedPhis.clear();
AddedPhis.clear(); AddedPhis.clear();
Predicates.clear(); Predicates.clear();
Conditions.clear(); Conditions.clear();
Loops.clear(); Loops.clear();
LoopPreds.clear(); LoopPreds.clear();
LoopConds.clear(); LoopConds.clear();
FlowSet.clear(); FlowSet.clear();
TermDL.clear();
return true; return true;
} }
Pass *llvm::createStructurizeCFGPass(bool SkipUniformRegions) { Pass *llvm::createStructurizeCFGPass(bool SkipUniformRegions) {
return new StructurizeCFGLegacyPass(SkipUniformRegions); return new StructurizeCFGLegacyPass(SkipUniformRegions);
} }
Show All 27 Lines

llvm/test/Transforms/StructurizeCFG/structurizecfg-debug-loc.ll

  • This file was added.
; RUN: opt -S -o - -structurizecfg %s | FileCheck %s
define void @if_then_else(i32 addrspace(1)* %out, i1 %arg) !dbg !7 {
; CHECK: @if_then_else(
; CHECK: entry:
; CHECK: br i1 {{.*}}, label %if.else, label %Flow, !dbg [[ITE_ENTRY_DL:![0-9]+]]
; CHECK: Flow:
; CHECK: br i1 {{.*}}, label %if.then, label %exit, !dbg [[ITE_ENTRY_DL]]
; CHECK: if.then:
; CHECK: br label %exit, !dbg [[ITE_IFTHEN_DL:![0-9]+]]
; CHECK: if.else:
; CHECK: br label %Flow, !dbg [[ITE_IFELSE_DL:![0-9]+]]
; CHECK: exit:
;
entry:
br i1 %arg, label %if.then, label %if.else, !dbg !8
if.then:
store i32 0, i32 addrspace(1)* %out, !dbg !9
br label %exit, !dbg !10
if.else:
store i32 1, i32 addrspace(1)* %out, !dbg !11
br label %exit, !dbg !12
exit:
ret void, !dbg !13
}
define void @while_loop(i32 addrspace(1)* %out) !dbg !14 {
; CHECK: @while_loop(
; CHECK: entry:
; CHECK: br label %while.header, !dbg [[WHILE_ENTRY_DL:![0-9]+]]
; CHECK: while.header:
; CHECK: br i1 {{.*}}, label %while.body, label %Flow, !dbg [[WHILE_HEADER_DL:![0-9]+]]
; CHECK: while.body:
; CHECK: br label %Flow, !dbg [[WHILE_BODY_DL:![0-9]+]]
; CHECK: Flow:
; CHECK: br i1 {{.*}}, label %exit, label %while.header, !dbg [[WHILE_HEADER_DL]]
; CHECK: exit:
;
jmmartinezAuthorUnsubmitted
Done
ReplyInline Actions

Remove this comment. This is the good behaviour.

jmmartinez: Remove this comment. This is the good behaviour.
entry:
br label %while.header, !dbg !15
while.header:
%cond = call i1 @loop_condition(), !dbg !16
br i1 %cond, label %while.body, label %exit, !dbg !17
while.body:
store i32 1, i32 addrspace(1)* %out, !dbg !18
br label %while.header, !dbg !19
exit:
ret void, !dbg !20
}
define void @while_multiple_exits(i32 addrspace(1)* %out) !dbg !21 {
; CHECK: @while_multiple_exits(
; CHECK: entry:
; CHECK: br label %while.header, !dbg [[WHILEME_ENTRY_DL:![0-9]+]]
; CHECK: while.header:
; CHECK: br i1 {{.*}}, label %while.exiting, label %Flow, !dbg [[WHILEME_HEADER_DL:![0-9]+]]
; CHECK: while.exiting:
; CHECK: br label %Flow, !dbg [[WHILEME_EXITING_DL:![0-9]+]]
; CHECK: Flow:
; CHECK: br i1 {{.*}}, label %exit, label %while.header, !dbg [[WHILEME_HEADER_DL]]
; CHECK: exit:
;
entry:
br label %while.header, !dbg !22
jmmartinezAuthorUnsubmitted
Done
ReplyInline Actions

Remove this one too. Again, this gives the good behaviour.

jmmartinez: Remove this one too. Again, this gives the good behaviour.
while.header:
%cond0 = call i1 @loop_condition(), !dbg !23
br i1 %cond0, label %while.exiting, label %exit, !dbg !24
while.exiting:
%cond1 = call i1 @loop_condition(), !dbg !25
br i1 %cond1, label %while.header, label %exit, !dbg !26
exit:
ret void, !dbg !27
}
define void @nested_if_then_else(i32 addrspace(1)* %out, i1 %a, i1 %b) !dbg !28 {
; CHECK: @nested_if_then_else(
; CHECK: entry:
; CHECK: br i1 {{.*}}, label %if.else, label %Flow4, !dbg [[NESTED_ENTRY_DL:![0-9]+]]
; CHECK: Flow4:
; CHECK: br i1 {{.*}}, label %if.then, label %exit, !dbg [[NESTED_ENTRY_DL]]
; CHECK: if.then:
; CHECK: br i1 {{.*}}, label %if.then.else, label %Flow2, !dbg [[NESTED_IFTHEN_DL:![0-9]+]]
; CHECK: Flow2:
; CHECK: br i1 {{.*}}, label %if.then.then, label %Flow3, !dbg [[NESTED_IFTHEN_DL]]
; CHECK: if.then.then:
; CHECK: br label %Flow3, !dbg [[NESTED_IFTHENTHEN_DL:![0-9]+]]
; CHECK: if.then.else:
; CHECK: br label %Flow2, !dbg [[NESTED_IFTHENELSE_DL:![0-9]+]]
; CHECK: if.else:
; CHECK: br i1 {{.*}}, label %if.else.else, label %Flow, !dbg [[NESTED_IFELSE_DL:![0-9]+]]
; CHECK: Flow:
; CHECK: br i1 {{.*}}, label %if.else.then, label %Flow1, !dbg [[NESTED_IFELSE_DL]]
; CHECK: if.else.then:
; CHECK: br label %Flow1, !dbg [[NESTED_IFELSETHEN_DL:![0-9]+]]
; CHECK: if.else.else:
; CHECK: br label %Flow, !dbg [[NESTED_IFELSEELSE_DL:![0-9]+]]
; CHECK: Flow1:
; CHECK: br label %Flow4, !dbg [[NESTED_IFELSE_DL]]
; CHECK: Flow3:
; CHECK: br label %exit, !dbg [[NESTED_IFTHEN_DL]]
; CHECK: exit:
;
entry:
br i1 %a, label %if.then, label %if.else, !dbg !29
if.then:
br i1 %b, label %if.then.then, label %if.then.else, !dbg !30
if.then.then:
store i32 0, i32 addrspace(1)* %out, !dbg !31
br label %exit, !dbg !32
if.then.else:
store i32 1, i32 addrspace(1)* %out, !dbg !33
br label %exit, !dbg !34
if.else:
br i1 %b, label %if.else.then, label %if.else.else, !dbg !35
if.else.then:
store i32 2, i32 addrspace(1)* %out, !dbg !36
br label %exit, !dbg !37
if.else.else:
store i32 3, i32 addrspace(1)* %out, !dbg !38
br label %exit, !dbg !39
exit:
ret void, !dbg !40
}
declare i1 @loop_condition()
!llvm.dbg.cu = !{!2}
!llvm.module.flags = !{!4, !5}
; CHECK: [[ITE_ENTRY_DL]] = !DILocation(line: 2
; CHECK: [[ITE_IFTHEN_DL]] = !DILocation(line: 4
; CHECK: [[ITE_IFELSE_DL]] = !DILocation(line: 6
; CHECK: [[WHILE_ENTRY_DL]] = !DILocation(line: 2
; CHECK: [[WHILE_HEADER_DL]] = !DILocation(line: 4
; CHECK: [[WHILE_BODY_DL]] = !DILocation(line: 6
; CHECK: [[WHILEME_ENTRY_DL]] = !DILocation(line: 2
; CHECK: [[WHILEME_HEADER_DL]] = !DILocation(line: 4
; CHECK: [[WHILEME_EXITING_DL]] = !DILocation(line: 6
; CHECK: [[NESTED_ENTRY_DL]] = !DILocation(line: 2
; CHECK: [[NESTED_IFTHEN_DL]] = !DILocation(line: 3
; CHECK: [[NESTED_IFTHENTHEN_DL]] = !DILocation(line: 5
; CHECK: [[NESTED_IFTHENELSE_DL]] = !DILocation(line: 7
; CHECK: [[NESTED_IFELSE_DL]] = !DILocation(line: 8
; CHECK: [[NESTED_IFELSETHEN_DL]] = !DILocation(line: 10
; CHECK: [[NESTED_IFELSEELSE_DL]] = !DILocation(line: 12
!0 = !{}
!1 = !DIFile(filename: "dummy.ll", directory: "/some/random/directory")
!2 = distinct !DICompileUnit(language: DW_LANG_C99, file: !1, producer: "", isOptimized: false, runtimeVersion: 0, emissionKind: FullDebug, enums: !0)
!4 = !{i32 2, !"Dwarf Version", i32 5}
!5 = !{i32 2, !"Debug Info Version", i32 3}
!6 = !DISubroutineType(types: !0)
!7 = distinct !DISubprogram(name: "dummy", scope: !1, file: !1, line: 1, type: !6, isLocal: false, isDefinition: true, scopeLine: 1, isOptimized: false, unit: !2, retainedNodes: !0)
!8 = !DILocation(line: 2, scope: !7)
!9 = !DILocation(line: 3, scope: !7)
!10 = !DILocation(line: 4, scope: !7)
!11 = !DILocation(line: 5, scope: !7)
!12 = !DILocation(line: 6, scope: !7)
!13 = !DILocation(line: 7, scope: !7)
!14 = distinct !DISubprogram(name: "dummy", scope: !1, file: !1, line: 1, type: !6, isLocal: false, isDefinition: true, scopeLine: 1, isOptimized: false, unit: !2, retainedNodes: !0)
!15 = !DILocation(line: 2, scope: !14)
!16 = !DILocation(line: 3, scope: !14)
!17 = !DILocation(line: 4, scope: !14)
!18 = !DILocation(line: 5, scope: !14)
!19 = !DILocation(line: 6, scope: !14)
!20 = !DILocation(line: 7, scope: !14)
!21 = distinct !DISubprogram(name: "dummy", scope: !1, file: !1, line: 1, type: !6, isLocal: false, isDefinition: true, scopeLine: 1, isOptimized: false, unit: !2, retainedNodes: !0)
!22 = !DILocation(line: 2, scope: !21)
!23 = !DILocation(line: 3, scope: !21)
!24 = !DILocation(line: 4, scope: !21)
!25 = !DILocation(line: 5, scope: !21)
!26 = !DILocation(line: 6, scope: !21)
!27 = !DILocation(line: 7, scope: !21)
!28 = distinct !DISubprogram(name: "dummy", scope: !1, file: !1, line: 1, type: !6, isLocal: false, isDefinition: true, scopeLine: 1, isOptimized: false, unit: !2, retainedNodes: !0)
!29 = !DILocation(line: 2, scope: !28)
!30 = !DILocation(line: 3, scope: !28)
!31 = !DILocation(line: 4, scope: !28)
!32 = !DILocation(line: 5, scope: !28)
!33 = !DILocation(line: 6, scope: !28)
!34 = !DILocation(line: 7, scope: !28)
!35 = !DILocation(line: 8, scope: !28)
!36 = !DILocation(line: 9, scope: !28)
!37 = !DILocation(line: 10, scope: !28)
!38 = !DILocation(line: 11, scope: !28)
!39 = !DILocation(line: 12, scope: !28)
!40 = !DILocation(line: 13, scope: !28)