Home
last modified time | relevance | path

Searched defs:NewNode (Results 1 – 25 of 28) sorted by relevance

12

/external/v8/src/compiler/
Dgraph.h31 Node* NewNode(const Operator* op) { in NewNode() function
34 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } in NewNode() function
35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
Dgraph-builder.h27 Node* NewNode(const Operator* op) { in NewNode() function
31 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); } in NewNode() function
33 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
38 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
48 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
54 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
60 Node* NewNode(const Operator* op, int value_input_count, in NewNode() function
Dgraph.cc24 Node* Graph::NewNode(const Operator* op, int input_count, Node** inputs) { in NewNode() function in v8::internal::compiler::Graph
Djs-graph.cc19 Node* JSGraph::NewNode(const Operator* op) { in NewNode() function in v8::internal::compiler::JSGraph
/external/pdfium/core/src/fxcrt/
Dfx_basic_list.cpp90 CFX_PtrList::NewNode(CFX_PtrList::CNode* pPrev, CFX_PtrList::CNode* pNext) in NewNode() function in CFX_PtrList
/external/clang/lib/Rewrite/
DRewriteRope.cpp308 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf(); in insert() local
541 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior(); in HandleChildPiece() local
DDeltaTree.cpp302 DeltaTreeNode *NewNode; in DoSplit() local
/external/llvm/lib/CodeGen/SelectionDAG/
DLegalizeTypes.h47 NewNode = -1, enumerator
DScheduleDAGRRList.cpp245 SUnit *NewNode = newSUnit(N); in CreateNewSUnit() local
256 SUnit *NewNode = Clone(N); in CreateClone() local
DDAGCombiner.cpp2663 SDValue NewNode = DAG.getNode(N->getOpcode(), SDLoc(N), VT, in SimplifyBinOpWithSameOpcodeHands() local
2684 SDValue NewNode = DAG.getNode(N->getOpcode(), SDLoc(N), VT, in SimplifyBinOpWithSameOpcodeHands() local
7837 SDValue NewNode = DAG.getNode(ISD::FMUL, SDLoc(*I), VT, in visitFDIV() local
/external/llvm/lib/Analysis/IPA/
DCallGraph.cpp226 CallSite NewCS, CallGraphNode *NewNode){ in replaceCallEdge()
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp301 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock() local
724 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen() local
DValueMapper.cpp190 static bool remap(const MDNode *OldNode, MDNode *NewNode, in remap()
DLowerSwitch.cpp269 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert() local
DCodeExtractor.cpp279 DomTreeNode *NewNode = DT->addNewBlock(New, *I); in splitReturnBlocks() local
/external/v8/test/cctest/compiler/
Dtest-instruction.cc78 Node* NewNode(BasicBlock* block) { in NewNode() function in InstructionTester
/external/llvm/lib/Target/X86/
DX86ISelDAGToDAG.cpp2666 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri, dl, MVT::i32, in Select() local
2703 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri_NOREX, dl, in Select() local
2725 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST16ri, dl, MVT::i32, in Select() local
2747 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST32ri, dl, MVT::i32, in Select() local
DX86InstrInfo.cpp5588 SDNode *NewNode= DAG.getMachineNode(Opc, dl, VTs, BeforeOps); in unfoldMemoryOperand() local
/external/llvm/utils/TableGen/
DDAGISelMatcherGen.cpp192 void MatcherGen::AddMatcher(Matcher *NewNode) { in AddMatcher()
/external/llvm/lib/Analysis/
DCFLAliasAnalysis.cpp683 auto NewNode = Node(Index); in addNode() local
901 auto NewNode = Graph.addNode(); in addInstructionToGraph() local
/external/llvm/include/llvm/Analysis/
DRegionInfoImpl.h351 RegionNodeT *NewNode = new RegionNodeT(static_cast<RegionT *>(Deconst), BB); in getBBNode() local
/external/llvm/include/llvm/ADT/
DIntervalMap.h1983 unsigned NewNode = 0; in overflow() local
/external/llvm/lib/Transforms/Instrumentation/
DDataFlowSanitizer.cpp1112 DomTreeNode *NewNode = DT.addNewBlock(Tail, Head); in loadShadow() local
/external/clang/lib/StaticAnalyzer/Core/
DExprEngine.cpp1356 ExplodedNode *NewNode = G.getNode(NewNodeLoc, NewNodeState, false, &IsNew); in replayWithoutInlining() local
DBugReporter.cpp2865 if (const ExplodedNode *NewNode = ForwardMap.lookup(Nodes[i])) { in TrimmedGraph() local

12