Home
last modified time | relevance | path

Searched refs:TargetNode (Results 1 – 4 of 4) sorted by relevance

/external/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp119 assert(OtherW.TargetNode.isValid()); in combineWeight()
125 assert(W.TargetNode == OtherW.TargetNode); in combineWeight()
137 const Weight &R) { return L.TargetNode < R.TargetNode; }); in combineWeightsBySorting()
146 for (++L; L != E && I->TargetNode == L->TargetNode; ++L) in combineWeightsBySorting()
159 combineWeight(Combined[W.TargetNode.Index], W); in combineWeightsByHashing()
233 assert(W.TargetNode.isValid()); in normalize()
404 Working[W.TargetNode.Index].getMass() += Taken; in distributeMass()
405 DEBUG(debugAssign(W.TargetNode, Taken, nullptr)); in distributeMass()
421 OuterLoop->Exits.push_back(std::make_pair(W.TargetNode, Taken)); in distributeMass()
422 DEBUG(debugAssign(W.TargetNode, Taken, "exit")); in distributeMass()
/external/llvm/include/llvm/Support/
DGraphWriter.h239 if (NodeType *TargetNode = *EI) { in writeEdge() local
246 (unsigned)std::distance(GTraits::child_begin(TargetNode), TargetIt); in writeEdge()
254 static_cast<const void*>(TargetNode), DestPort, in writeEdge()
/external/llvm/lib/CodeGen/SelectionDAG/
DSelectionDAGPrinter.cpp69 SDNode *TargetNode = *I; in getEdgeTarget() local
70 SDNodeIterator NI = SDNodeIterator::begin(TargetNode); in getEdgeTarget()
/external/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h322 BlockNode TargetNode;
325 Weight(DistType Type, BlockNode TargetNode, uint64_t Amount)
326 : Type(Type), TargetNode(TargetNode), Amount(Amount) {}