OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:IDoms
(Results
1 - 16
of
16
) sorted by null
/external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
199
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
222
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
233
DT.
IDoms
[V] = Root;
240
typename GraphT::NodeType*& WIDom = DT.
IDoms
[W];
242
WIDom = DT.
IDoms
[WIDom];
282
DT.
IDoms
.clear();
GenericDomTree.h
209
IDoms
.clear();
233
DenseMap<NodeT *, NodeT *>
IDoms
;
238
// Info - Collection of information used during the computation of
idoms
.
243
IDoms
.clear();
326
SlowQueries(std::move(Arg.SlowQueries)),
IDoms
(std::move(Arg.
IDoms
)),
337
IDoms
= std::move(RHS.
IDoms
);
660
NodeT *getIDom(NodeT *BB) const { return
IDoms
.lookup(BB); }
/external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DominatorInternals.h
200
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
223
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
234
DT.
IDoms
[V] = Root;
241
typename GraphT::NodeType*& WIDom = DT.
IDoms
[W];
243
WIDom = DT.
IDoms
[WIDom];
280
DT.
IDoms
.clear();
Dominators.h
205
DenseMap<NodeT*, NodeT*>
IDoms
;
210
// Info - Collection of information used during the computation of
idoms
.
218
IDoms
.clear();
644
typename DenseMap<NodeT*, NodeT*>::const_iterator I =
IDoms
.find(BB);
645
return I !=
IDoms
.end() ? I->second : 0;
662
this->
IDoms
[&F.front()] = 0;
674
this->
IDoms
[I] = 0;
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
196
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
214
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
225
DT.
IDoms
[V] = Root;
232
typename GraphT::NodeRef &WIDom = DT.
IDoms
[W];
234
WIDom = DT.
IDoms
[WIDom];
272
DT.
IDoms
.clear();
GenericDomTree.h
235
IDoms
.clear();
259
DenseMap<NodeT *, NodeT *>
IDoms
;
264
// Info - Collection of information used during the computation of
idoms
.
269
IDoms
.clear();
352
SlowQueries(std::move(Arg.SlowQueries)),
IDoms
(std::move(Arg.
IDoms
)),
364
IDoms
= std::move(RHS.
IDoms
);
724
NodeT *getIDom(NodeT *BB) const { return
IDoms
.lookup(BB); }
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/
GenericDomTreeConstruction.h
196
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
214
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
225
DT.
IDoms
[V] = Root;
232
typename GraphT::NodeRef &WIDom = DT.
IDoms
[W];
234
WIDom = DT.
IDoms
[WIDom];
272
DT.
IDoms
.clear();
GenericDomTree.h
235
IDoms
.clear();
259
DenseMap<NodeT *, NodeT *>
IDoms
;
264
// Info - Collection of information used during the computation of
idoms
.
269
IDoms
.clear();
345
SlowQueries(std::move(Arg.SlowQueries)),
IDoms
(std::move(Arg.
IDoms
)),
357
IDoms
= std::move(RHS.
IDoms
);
716
NodeT *getIDom(NodeT *BB) const { return
IDoms
.lookup(BB); }
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/
GenericDomTreeConstruction.h
196
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
214
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
225
DT.
IDoms
[V] = Root;
232
typename GraphT::NodeRef &WIDom = DT.
IDoms
[W];
234
WIDom = DT.
IDoms
[WIDom];
272
DT.
IDoms
.clear();
GenericDomTree.h
235
IDoms
.clear();
259
DenseMap<NodeT *, NodeT *>
IDoms
;
264
// Info - Collection of information used during the computation of
idoms
.
269
IDoms
.clear();
345
SlowQueries(std::move(Arg.SlowQueries)),
IDoms
(std::move(Arg.
IDoms
)),
357
IDoms
= std::move(RHS.
IDoms
);
716
NodeT *getIDom(NodeT *BB) const { return
IDoms
.lookup(BB); }
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
GenericDomTreeConstruction.h
196
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
214
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
225
DT.
IDoms
[V] = Root;
232
typename GraphT::NodeRef &WIDom = DT.
IDoms
[W];
234
WIDom = DT.
IDoms
[WIDom];
272
DT.
IDoms
.clear();
GenericDomTree.h
235
IDoms
.clear();
259
DenseMap<NodeT *, NodeT *>
IDoms
;
264
// Info - Collection of information used during the computation of
idoms
.
269
IDoms
.clear();
352
SlowQueries(std::move(Arg.SlowQueries)),
IDoms
(std::move(Arg.
IDoms
)),
364
IDoms
= std::move(RHS.
IDoms
);
724
NodeT *getIDom(NodeT *BB) const { return
IDoms
.lookup(BB); }
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/
GenericDomTreeConstruction.h
196
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
214
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
225
DT.
IDoms
[V] = Root;
232
typename GraphT::NodeRef &WIDom = DT.
IDoms
[W];
234
WIDom = DT.
IDoms
[WIDom];
272
DT.
IDoms
.clear();
GenericDomTree.h
235
IDoms
.clear();
259
DenseMap<NodeT *, NodeT *>
IDoms
;
264
// Info - Collection of information used during the computation of
idoms
.
269
IDoms
.clear();
345
SlowQueries(std::move(Arg.SlowQueries)),
IDoms
(std::move(Arg.
IDoms
)),
357
IDoms
= std::move(RHS.
IDoms
);
716
NodeT *getIDom(NodeT *BB) const { return
IDoms
.lookup(BB); }
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/
GenericDomTreeConstruction.h
196
DT.
IDoms
[V] = DT.Info[U].Semi < i ? U : W;
214
DT.
IDoms
[W] = DT.Vertex[WInfo.Parent];
225
DT.
IDoms
[V] = Root;
232
typename GraphT::NodeRef &WIDom = DT.
IDoms
[W];
234
WIDom = DT.
IDoms
[WIDom];
272
DT.
IDoms
.clear();
GenericDomTree.h
235
IDoms
.clear();
259
DenseMap<NodeT *, NodeT *>
IDoms
;
264
// Info - Collection of information used during the computation of
idoms
.
269
IDoms
.clear();
345
SlowQueries(std::move(Arg.SlowQueries)),
IDoms
(std::move(Arg.
IDoms
)),
357
IDoms
= std::move(RHS.
IDoms
);
716
NodeT *getIDom(NodeT *BB) const { return
IDoms
.lookup(BB); }
Completed in 469 milliseconds