HomeSort by relevance Sort by last modified time
    Searched refs:DT (Results 51 - 75 of 115) sorted by null

1 23 4 5

  /external/llvm/lib/Transforms/Scalar/
DeadStoreElimination.cpp 48 DominatorTree *DT;
52 DSE() : FunctionPass(ID), AA(0), MD(0), DT(0) {
59 DT = &getAnalysis<DominatorTree>();
66 if (DT->isReachableFromEntry(I))
69 AA = 0; MD = 0; DT = 0;
642 BasicBlock *BB, DominatorTree *DT) {
650 if (DT->isReachableFromEntry(Pred))
698 FindUnconditionalPreds(Blocks, BB, DT);
LoopInstSimplify.cpp 68 DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>();
112 Value *V = SimplifyInstruction(I, TD, TLI, DT);
LICM.cpp 104 DominatorTree *DT; // Dominator Tree for the current Loop.
211 DT = &getAnalysis<DominatorTree>();
269 SinkRegion(DT->getNode(L->getHeader()));
271 HoistRegion(DT->getNode(L->getHeader()));
494 if (!DT->dominates(I.getParent(), ExitBlocks[0])) {
545 if (!DT->dominates(InstOrigBB, ExitBlock))
648 if (!DT->dominates(Inst.getParent(), ExitBlocks[i]))
    [all...]
EarlyCSE.cpp 277 DominatorTree *DT;
445 if (Value *V = SimplifyInstruction(Inst, TD, TLI, DT)) {
569 DT = &getAnalysis<DominatorTree>();
585 CurrentGeneration, DT->getRootNode(),
586 DT->getRootNode()->begin(),
587 DT->getRootNode()->end()));
GVN.cpp 107 DominatorTree *DT;
129 void setDomTree(DominatorTree* D) { DT = D; }
346 if (NonLocalDepCall && DT->properlyDominates(I->getBB(), C->getParent())){
505 DominatorTree *DT;
539 DominatorTree &getDominatorTree() const { return *DT; }
    [all...]
LoopUnswitch.cpp 139 DominatorTree *DT;
154 currentLoop(NULL), DT(NULL), loopHeader(NULL),
389 DT = getAnalysisIfAvailable<DominatorTree>();
394 assert(currentLoop->isLCSSAForm(*DT));
401 if (DT)
402 DT->runOnFunction(*F);
    [all...]
  /external/llvm/include/llvm/Support/
CommandLine.h 341 template<class DT>
342 void setValue(const DT& /*V*/) {}
393 template<class DT>
394 OptionValue<DataType> &operator=(const DT& V) {
642 template <class DT>
643 void addLiteralOption(const char *Name, const DT &V, const char *HelpStr) {
925 template<class ParserClass, class DT>
926 void printOptionDiff(const Option &O, const generic_parser_base &P, const DT &V,
927 const OptionValue<DT> &Default, size_t GlobalWidth) {
928 OptionValue<DT> OV = V
    [all...]
  /external/llvm/lib/Target/R600/
SIAnnotateControlFlow.cpp 62 DominatorTree *DT;
166 BasicBlock *IDom = DT->getNode(Phi->getParent())->getIDom()->getBlock();
217 BasicBlock *IDom = DT->getNode(Parent)->getIDom()->getBlock();
290 DT = &getAnalysis<DominatorTree>();
  /external/webkit/LayoutTests/dom/html/level2/html/
HTMLElement141.js 80 Retrieve the class attribute of the DT element and examine its value.
99 nodeList = doc.getElementsByTagName("dt");
104 assertEquals("classNameLink","DT-class",vclassname);
HTMLElement25.js 80 Retrieve the id attribute of the DT element and examine its value.
99 nodeList = doc.getElementsByTagName("dt");
104 assertEquals("idLink","Test-DT",vid);
HTMLElement54.js 80 Retrieve the title attribute of the DT element and examine its value.
99 nodeList = doc.getElementsByTagName("dt");
104 assertEquals("titleLink","DT Element",vtitle);
  /external/webkit/LayoutTests/dom/xhtml/level2/html/
HTMLElement141.js 80 Retrieve the class attribute of the DT element and examine its value.
99 nodeList = doc.getElementsByTagName("dt");
104 assertEquals("classNameLink","DT-class",vclassname);
HTMLElement25.js 80 Retrieve the id attribute of the DT element and examine its value.
99 nodeList = doc.getElementsByTagName("dt");
104 assertEquals("idLink","Test-DT",vid);
HTMLElement54.js 80 Retrieve the title attribute of the DT element and examine its value.
99 nodeList = doc.getElementsByTagName("dt");
104 assertEquals("titleLink","DT Element",vtitle);
  /frameworks/compile/slang/
slang_rs_export_type.cpp 707 RSExportPrimitiveType::DataType dt = local
709 switch (dt) {
890 bool RSExportPrimitiveType::IsRSMatrixType(DataType DT) {
891 return ((DT >= FirstRSMatrixType) && (DT <= LastRSMatrixType));
894 bool RSExportPrimitiveType::IsRSObjectType(DataType DT) {
895 return ((DT >= FirstRSObjectType) && (DT <= LastRSObjectType));
929 RSExportPrimitiveType::DataType DT = GetRSSpecificType(FT);
930 if (IsRSObjectType(DT)) {
    [all...]
  /external/llvm/lib/IR/
DebugInfo.cpp 895 void DebugInfoFinder::processType(DIType DT) {
896 if (!addType(DT))
898 if (DT.isCompositeType()) {
899 DICompositeType DCT(DT);
909 } else if (DT.isDerivedType()) {
910 DIDerivedType DDT(DT);
950 bool DebugInfoFinder::addType(DIType DT) {
951 if (!DT.isValid())
954 if (!NodesSeen.insert(DT))
957 TYs.push_back(DT);
    [all...]
Dominators.cpp 72 DT->recalculate(F);
93 DT->print(OS);
  /external/llvm/lib/Transforms/Utils/
PromoteMemoryToRegister.cpp 204 DominatorTree &DT;
252 PromoteMem2Reg(const std::vector<AllocaInst*> &A, DominatorTree &dt,
254 : Allocas(A), DT(dt), DIB(0), AST(ast) {}
264 return DT.dominates(BB1, BB2);
392 Function &F = *DT.getRoot()->getParent();
498 DomTreeNode *Root = DT.getRootNode();
604 if (Value *V = SimplifyInstruction(PN, 0, 0, &DT)) {
773 if (DomTreeNode *Node = DT.getNode(*I))
800 DomTreeNode *SuccNode = DT.getNode(*SI)
    [all...]
  /external/llvm/include/llvm/Analysis/
RegionInfo.h 209 DominatorTree *DT;
244 /// @param DT The dominator tree of the current function.
248 DominatorTree *DT, Region *Parent = 0);
567 DominatorTree *DT;
IVUsers.h 123 DominatorTree *DT;
AliasAnalysis.h 482 DominatorTree *DT);
486 uint64_t Size, DominatorTree *DT) {
487 return callCapturesBefore(I, Location(P, Size), DT);
  /external/clang/include/clang/AST/
Mangle.h 128 void mangleDtorBlock(const CXXDestructorDecl *CD, CXXDtorType DT,
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCContract.cpp 53 DominatorTree *DT;
357 DT = &getAnalysis<DominatorTree>();
482 if (DT->isReachableFromEntry(U) && DT->dominates(Inst, U)) {
  /external/llvm/lib/Transforms/IPO/
LoopExtractor.cpp 90 DominatorTree &DT = getAnalysis<DominatorTree>();
135 CodeExtractor Extractor(DT, *L);
  /external/mksh/src/
tree.c 894 #define DT(x) case x: shf_puts(#x, shf); break;
899 DT(IOREAD)
900 DT(IOWRITE)
901 DT(IORDWR)
902 DT(IOHERE)
903 DT(IOCAT)
904 DT(IODUP)
936 #undef DT

Completed in 1214 milliseconds

1 23 4 5