| /prebuilts/clang/host/darwin-x86/clang-4393122/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-4479392/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...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/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-4479392/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-4579689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Transforms/Utils/ |
| SSAUpdaterImpl.h | 58 BBInfo *IDom = nullptr;
172 Info->IDom = PseudoEntry;
218 Blk1 = Blk1->IDom;
223 Blk2 = Blk2->IDom;
270 // Check if the IDom value has changed.
271 if (NewIDom && NewIDom != Info->IDom) {
272 Info->IDom = NewIDom;
279 /// IsDefInDomFrontier - Search up the dominator tree from Pred to IDom for
283 bool IsDefInDomFrontier(const BBInfo *Pred, const BBInfo *IDom) {
284 for (; Pred != IDom; Pred = Pred->IDom)
[all...] |
| /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)) {
|
| /prebuilts/ndk/r16/sources/third_party/shaderc/third_party/spirv-tools/source/ |
| cfa.h | 203 const BB* idom = *res; local
204 size_t idom_idx = idoms[idom].postorder_index;
208 if (idom == p) continue;
235 for (auto idom : idoms) {
238 out.push_back({ const_cast<BB*>(get<0>(idom)),
239 const_cast<BB*>(postorder[get<1>(idom).dominator]) });
|
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| tighten.go | 59 idom := f.Idom()
114 t = idom[targetloop.header.ID]
|
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| tighten.go | 59 idom := f.Idom()
114 t = idom[targetloop.header.ID]
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 64 NodePtr IDom = nullptr;
170 return InfoIt->second.IDom;
178 NodePtr IDom = getIDom(BB);
180 assert(IDom || DT.DomTreeNodes[nullptr]);
181 TreeNodePtr IDomNode = getNodeForBlock(IDom, DT);
302 VInfo.IDom = NumToNode[VInfo.Parent];
327 // IDom[i] = NCA(SDom[i], SpanningTreeParent(i)).
334 NodePtr WIDomCandidate = WInfo.IDom;
336 WIDomCandidate = NodeToInfo[WIDomCandidate].IDom;
338 WInfo.IDom = WIDomCandidate
[all...] |
