Bug Summary

File:lib/CodeGen/MachineLoopInfo.cpp
Warning:line 115, column 31
Called C++ object pointer is null

Annotated Source Code

1//===- MachineLoopInfo.cpp - Natural Loop Calculator ----------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file defines the MachineLoopInfo class that is used to identify natural
11// loops and determine the loop depth of various nodes of the CFG. Note that
12// the loops identified may actually be several natural loops that share the
13// same header node... not just a single natural loop.
14//
15//===----------------------------------------------------------------------===//
16
17#include "llvm/CodeGen/MachineLoopInfo.h"
18#include "llvm/Analysis/LoopInfoImpl.h"
19#include "llvm/CodeGen/MachineDominators.h"
20#include "llvm/CodeGen/Passes.h"
21#include "llvm/Support/Debug.h"
22#include "llvm/Support/raw_ostream.h"
23using namespace llvm;
24
25// Explicitly instantiate methods in LoopInfoImpl.h for MI-level Loops.
26template class llvm::LoopBase<MachineBasicBlock, MachineLoop>;
27template class llvm::LoopInfoBase<MachineBasicBlock, MachineLoop>;
28
29char MachineLoopInfo::ID = 0;
30INITIALIZE_PASS_BEGIN(MachineLoopInfo, "machine-loops",static void *initializeMachineLoopInfoPassOnce(PassRegistry &
Registry) {
31 "Machine Natural Loop Construction", true, true)static void *initializeMachineLoopInfoPassOnce(PassRegistry &
Registry) {
32INITIALIZE_PASS_DEPENDENCY(MachineDominatorTree)initializeMachineDominatorTreePass(Registry);
33INITIALIZE_PASS_END(MachineLoopInfo, "machine-loops",PassInfo *PI = new PassInfo( "Machine Natural Loop Construction"
, "machine-loops", &MachineLoopInfo::ID, PassInfo::NormalCtor_t
(callDefaultCtor<MachineLoopInfo>), true, true); Registry
.registerPass(*PI, true); return PI; } static once_flag InitializeMachineLoopInfoPassFlag
; void llvm::initializeMachineLoopInfoPass(PassRegistry &
Registry) { llvm::call_once(InitializeMachineLoopInfoPassFlag
, initializeMachineLoopInfoPassOnce, std::ref(Registry)); }
34 "Machine Natural Loop Construction", true, true)PassInfo *PI = new PassInfo( "Machine Natural Loop Construction"
, "machine-loops", &MachineLoopInfo::ID, PassInfo::NormalCtor_t
(callDefaultCtor<MachineLoopInfo>), true, true); Registry
.registerPass(*PI, true); return PI; } static once_flag InitializeMachineLoopInfoPassFlag
; void llvm::initializeMachineLoopInfoPass(PassRegistry &
Registry) { llvm::call_once(InitializeMachineLoopInfoPassFlag
, initializeMachineLoopInfoPassOnce, std::ref(Registry)); }
35
36char &llvm::MachineLoopInfoID = MachineLoopInfo::ID;
37
38bool MachineLoopInfo::runOnMachineFunction(MachineFunction &) {
39 releaseMemory();
40 LI.analyze(getAnalysis<MachineDominatorTree>().getBase());
41 return false;
42}
43
44void MachineLoopInfo::getAnalysisUsage(AnalysisUsage &AU) const {
45 AU.setPreservesAll();
46 AU.addRequired<MachineDominatorTree>();
47 MachineFunctionPass::getAnalysisUsage(AU);
48}
49
50MachineBasicBlock *MachineLoop::getTopBlock() {
51 MachineBasicBlock *TopMBB = getHeader();
52 MachineFunction::iterator Begin = TopMBB->getParent()->begin();
53 if (TopMBB->getIterator() != Begin) {
54 MachineBasicBlock *PriorMBB = &*std::prev(TopMBB->getIterator());
55 while (contains(PriorMBB)) {
56 TopMBB = PriorMBB;
57 if (TopMBB->getIterator() == Begin)
58 break;
59 PriorMBB = &*std::prev(TopMBB->getIterator());
60 }
61 }
62 return TopMBB;
63}
64
65MachineBasicBlock *MachineLoop::getBottomBlock() {
66 MachineBasicBlock *BotMBB = getHeader();
67 MachineFunction::iterator End = BotMBB->getParent()->end();
68 if (BotMBB->getIterator() != std::prev(End)) {
69 MachineBasicBlock *NextMBB = &*std::next(BotMBB->getIterator());
70 while (contains(NextMBB)) {
71 BotMBB = NextMBB;
72 if (BotMBB == &*std::next(BotMBB->getIterator()))
73 break;
74 NextMBB = &*std::next(BotMBB->getIterator());
75 }
76 }
77 return BotMBB;
78}
79
80MachineBasicBlock *MachineLoop::findLoopControlBlock() {
81 if (MachineBasicBlock *Latch = getLoopLatch()) {
82 if (isLoopExiting(Latch))
83 return Latch;
84 else
85 return getExitingBlock();
86 }
87 return nullptr;
88}
89
90MachineBasicBlock *
91MachineLoopInfo::findLoopPreheader(MachineLoop *L,
92 bool SpeculativePreheader) const {
93 if (MachineBasicBlock *PB = L->getLoopPreheader())
1
Assuming 'PB' is null
2
Taking false branch
94 return PB;
95
96 if (!SpeculativePreheader)
3
Assuming 'SpeculativePreheader' is not equal to 0
4
Taking false branch
97 return nullptr;
98
99 MachineBasicBlock *HB = L->getHeader(), *LB = L->getLoopLatch();
100 if (HB->pred_size() != 2 || HB->hasAddressTaken())
5
Assuming the condition is false
6
Assuming the condition is false
7
Taking false branch
101 return nullptr;
102 // Find the predecessor of the header that is not the latch block.
103 MachineBasicBlock *Preheader = nullptr;
8
'Preheader' initialized to a null pointer value
104 for (MachineBasicBlock *P : HB->predecessors()) {
105 if (P == LB)
106 continue;
107 // Sanity.
108 if (Preheader)
109 return nullptr;
110 Preheader = P;
111 }
112
113 // Check if the preheader candidate is a successor of any other loop
114 // headers. We want to avoid having two loop setups in the same block.
115 for (MachineBasicBlock *S : Preheader->successors()) {
9
Called C++ object pointer is null
116 if (S == HB)
117 continue;
118 MachineLoop *T = getLoopFor(S);
119 if (T && T->getHeader() == S)
120 return nullptr;
121 }
122 return Preheader;
123}
124
125#if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
126LLVM_DUMP_METHOD__attribute__((noinline)) __attribute__((__used__)) void MachineLoop::dump() const {
127 print(dbgs());
128}
129#endif