Searched refs:OldNode (Results 1 - 5 of 5) sorted by relevance

/external/llvm/lib/Transforms/Utils/
H A DValueMapper.cpp186 /// Insert \c NewNode in the value map, and then remap \c OldNode's operands.
187 /// Assumes that \c NewNode is already a clone of \c OldNode.
189 /// \pre \c NewNode is a clone of \c OldNode.
190 static bool remap(const MDNode *OldNode, MDNode *NewNode, argument
194 assert(OldNode->getNumOperands() == NewNode->getNumOperands() &&
196 assert(OldNode->isResolved() && "Expected resolved node");
200 mapToMetadata(VM, OldNode, NewNode);
202 for (unsigned I = 0, E = OldNode->getNumOperands(); I != E; ++I) {
203 Metadata *Old = OldNode->getOperand(I);
207 Metadata *New = mapMetadataOp(OldNode
[all...]
H A DBasicBlockUtils.cpp295 if (DomTreeNode *OldNode = DT->getNode(Old)) {
297 for (DomTreeNode::iterator I = OldNode->begin(), E = OldNode->end();
721 if (DomTreeNode *OldNode = DT->getNode(Head)) {
722 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end());
H A DCodeExtractor.cpp273 DomTreeNode *OldNode = DT->getNode(*I); local
275 for (DomTreeNode::iterator DI = OldNode->begin(), DE = OldNode->end();
/external/llvm/include/llvm/ADT/
H A DImmutableSet.h580 TreeTy* OldNode;
581 TreeTy* newRight = removeMinBinding(R,OldNode);
582 return balanceTree(L, getValue(OldNode), newRight);
/external/llvm/lib/Transforms/Instrumentation/
H A DDataFlowSanitizer.cpp1109 if (DomTreeNode *OldNode = DT.getNode(Head)) {
1110 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end());

Completed in 153 milliseconds