| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| LiveRangeCalc.cpp | 190 MachineDomTreeNode *IDom = Node->getIDom();
195 bool needPHI = !IDom || !Seen.test(IDom->getBlock()->getNumber());
197 // IDom dominates all of our predecessors, but it may not be their
199 // properly dominated by IDom. If so, we need a phi-def here.
201 IDomValue = LiveOut[IDom->getBlock()];
205 LiveOut[IDom->getBlock()].second = IDomValue.second =
222 if (DomTree->dominates(IDom, Value.second)) {
|
| SplitKit.cpp | 694 MachineDomTreeNode *IDom = MDT[Loop->getHeader()]->getIDom();
697 if (!IDom || !MDT.dominates(DefDomNode, IDom))
700 MBB = IDom->getBlock();
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
160 Info->IDom = PseudoEntry;
206 Blk1 = Blk1->IDom;
211 Blk2 = Blk2->IDom;
258 // Check if the IDom value has changed.
259 if (NewIDom && NewIDom != Info->IDom) {
260 Info->IDom = NewIDom;
267 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
271 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveRangeCalc.cpp | 404 MachineDomTreeNode *IDom = Node->getIDom();
409 bool needPHI = !IDom || !Seen.test(IDom->getBlock()->getNumber());
411 // IDom dominates all of our predecessors, but it may not be their
413 // properly dominated by IDom. If so, we need a phi-def here.
415 IDomValue = Map[IDom->getBlock()];
419 Map[IDom->getBlock()].second = IDomValue.second =
436 if (DomTree->dominates(IDom, Value.second)) {
|
| ShrinkWrap.cpp | 261 MachineBasicBlock *IDom = &Block;
263 IDom = Dom.findNearestCommonDominator(IDom, BB);
264 if (!IDom)
267 if (IDom == &Block)
269 return IDom;
|
| SplitKit.cpp | 736 MachineDomTreeNode *IDom = MDT[Loop->getHeader()]->getIDom();
739 if (!IDom || !MDT.dominates(DefDomNode, IDom))
742 MBB = IDom->getBlock();
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 41 BBInfo *IDom; // Immediate dominator.
47 : BB(ThisBB), AvailableVal(V), DefBB(V ? this : 0), BlkNum(0), IDom(0),
149 Info->IDom = PseudoEntry;
195 Blk1 = Blk1->IDom;
200 Blk2 = Blk2->IDom;
247 // Check if the IDom value has changed.
248 if (NewIDom && NewIDom != Info->IDom) {
249 Info->IDom = NewIDom;
256 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
260 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 52 BBInfo *IDom; // Immediate dominator.
59 IDom(nullptr), NumPreds(0), Preds(nullptr), PHITag(nullptr) {}
159 Info->IDom = PseudoEntry;
205 Blk1 = Blk1->IDom;
210 Blk2 = Blk2->IDom;
257 // Check if the IDom value has changed.
258 if (NewIDom && NewIDom != Info->IDom) {
259 Info->IDom = NewIDom;
266 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
270 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
[all...] |
| /external/llvm/lib/Target/AMDGPU/ |
| SIAnnotateControlFlow.cpp | 192 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
194 if (Phi->getIncomingBlock(i) == IDom) {
264 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock();
273 if (From == IDom) {
275 // IDom/From
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 71 DomTreeNodeBase<NodeT> *IDom;
89 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
94 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
95 : TheBB(BB), IDom(iDom), DFSNumIn(-1), DFSNumOut(-1) {}
126 assert(IDom && "No immediate dominator?");
127 if (IDom != NewIDom) {
129 std::find(IDom->Children.begin(), IDom->Children.end(), this);
130 assert(I != IDom->Children.end() &
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
| GenericDomTree.h | 102 DomTreeNodeBase<NodeT> *IDom;
108 DomTreeNodeBase(NodeT *BB, DomTreeNodeBase<NodeT> *iDom)
109 : TheBB(BB), IDom(iDom) {}
121 DomTreeNodeBase<NodeT> *getIDom() const { return IDom; }
156 assert(IDom && "No immediate dominator?");
157 if (IDom != NewIDom) {
159 find(IDom->Children, this);
160 assert(I != IDom->Children.end() &&
163 IDom->Children.erase(I)
[all...] |
