Home
last modified time | relevance | path

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

12

/external/v8/src/compiler/
Dgraph.h64 Node* NewNode(const Operator* op) { in NewNode() function
67 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); } in NewNode() function
68 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
80 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
85 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
90 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
95 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
100 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
Dbytecode-graph-builder.h59 Node* NewNode(const Operator* op, Node* n1) { in NewNode() function
64 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
69 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
74 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
Dast-graph-builder.h181 Node* NewNode(const Operator* op, Node* n1) { in NewNode() function
185 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
190 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
195 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
200 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
206 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
Dgraph.cc45 Node* Graph::NewNode(const Operator* op, int input_count, Node* const* inputs, in NewNode() function in v8::internal::compiler::Graph
/external/v8/test/cctest/compiler/
Dgraph-builder-tester.h192 Node* NewNode(const Operator* op) { in NewNode() function
196 Node* NewNode(const Operator* op, Node* n1) { return MakeNode(op, 1, &n1); } in NewNode() function
198 Node* NewNode(const Operator* op, Node* n1, Node* n2) { in NewNode() function
203 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { in NewNode() function
208 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { in NewNode() function
213 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
219 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, in NewNode() function
225 Node* NewNode(const Operator* op, int value_input_count, in NewNode() function
Dtest-instruction.cc72 Node* NewNode(BasicBlock* block) { in NewNode() function in v8::internal::compiler::InstructionTester
/external/pdfium/core/src/fxcrt/
Dfx_basic_list.cpp82 CFX_PtrList::CNode* CFX_PtrList::NewNode(CFX_PtrList::CNode* pPrev, in NewNode() function in CFX_PtrList
/external/v8/test/unittests/compiler/
Dgraph-unittest.cc125 TEST_F(GraphTest, NewNode) { in TEST_F() argument
/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/Analysis/
DCallGraph.cpp249 CallSite NewCS, CallGraphNode *NewNode){ in replaceCallEdge()
DCFLAliasAnalysis.cpp600 auto NewNode = Node(Index); in addNode() local
819 auto NewNode = Graph.addNode(); in addInstructionToGraph() 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
/external/llvm/lib/Transforms/Utils/
DBasicBlockUtils.cpp305 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock() local
731 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen() local
DLowerSwitch.cpp278 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert() local
DCodeExtractor.cpp280 DomTreeNode *NewNode = DT->addNewBlock(New, *I); in splitReturnBlocks() local
/external/llvm/lib/Target/X86/
DX86ISelDAGToDAG.cpp2828 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri, dl, MVT::i32, in Select() local
2865 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST8ri_NOREX, dl, in Select() local
2888 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST16ri, dl, MVT::i32, in Select() local
2911 SDNode *NewNode = CurDAG->getMachineNode(X86::TEST32ri, dl, MVT::i32, in Select() local
/external/llvm/utils/TableGen/
DDAGISelMatcherGen.cpp192 void MatcherGen::AddMatcher(Matcher *NewNode) { in AddMatcher()
/external/llvm/include/llvm/Analysis/
DRegionInfoImpl.h353 RegionNodeT *NewNode = new RegionNodeT(static_cast<RegionT *>(Deconst), BB); in getBBNode() local
/external/llvm/lib/Transforms/Instrumentation/
DDataFlowSanitizer.cpp1128 DomTreeNode *NewNode = DT.addNewBlock(Tail, Head); in loadShadow() local
/external/llvm/include/llvm/ADT/
DIntervalMap.h1983 unsigned NewNode = 0; in overflow() local
/external/llvm/lib/Target/Hexagon/
DHexagonCommonGEP.cpp951 GepNode *C = 0, *NewNode = 0; in separateChainForNode() local
/external/clang/lib/StaticAnalyzer/Core/
DExprEngine.cpp1386 ExplodedNode *NewNode = G.getNode(NewNodeLoc, NewNodeState, false, &IsNew); in replayWithoutInlining() local
DBugReporter.cpp2860 if (const ExplodedNode *NewNode = ForwardMap.lookup(Nodes[i])) { in TrimmedGraph() local

12