/external/v8/src/compiler/ |
D | graph.h | 64 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
|
D | bytecode-graph-builder.h | 59 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
|
D | ast-graph-builder.h | 181 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
|
D | graph.cc | 45 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/ |
D | graph-builder-tester.h | 192 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
|
D | test-instruction.cc | 72 Node* NewNode(BasicBlock* block) { in NewNode() function in v8::internal::compiler::InstructionTester
|
/external/pdfium/core/src/fxcrt/ |
D | fx_basic_list.cpp | 82 CFX_PtrList::CNode* CFX_PtrList::NewNode(CFX_PtrList::CNode* pPrev, in NewNode() function in CFX_PtrList
|
/external/v8/test/unittests/compiler/ |
D | graph-unittest.cc | 125 TEST_F(GraphTest, NewNode) { in TEST_F() argument
|
/external/clang/lib/Rewrite/ |
D | RewriteRope.cpp | 308 RopePieceBTreeLeaf *NewNode = new RopePieceBTreeLeaf(); in insert() local 541 RopePieceBTreeInterior *NewNode = new RopePieceBTreeInterior(); in HandleChildPiece() local
|
D | DeltaTree.cpp | 302 DeltaTreeNode *NewNode; in DoSplit() local
|
/external/llvm/lib/Analysis/ |
D | CallGraph.cpp | 249 CallSite NewCS, CallGraphNode *NewNode){ in replaceCallEdge()
|
D | CFLAliasAnalysis.cpp | 600 auto NewNode = Node(Index); in addNode() local 819 auto NewNode = Graph.addNode(); in addInstructionToGraph() local
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
D | LegalizeTypes.h | 47 NewNode = -1, enumerator
|
D | ScheduleDAGRRList.cpp | 245 SUnit *NewNode = newSUnit(N); in CreateNewSUnit() local 256 SUnit *NewNode = Clone(N); in CreateClone() local
|
/external/llvm/lib/Transforms/Utils/ |
D | BasicBlockUtils.cpp | 305 DomTreeNode *NewNode = DT->addNewBlock(New, Old); in SplitBlock() local 731 DomTreeNode *NewNode = DT->addNewBlock(Tail, Head); in SplitBlockAndInsertIfThen() local
|
D | LowerSwitch.cpp | 278 BasicBlock* NewNode = BasicBlock::Create(Val->getContext(), "NodeBlock"); in switchConvert() local
|
D | CodeExtractor.cpp | 280 DomTreeNode *NewNode = DT->addNewBlock(New, *I); in splitReturnBlocks() local
|
/external/llvm/lib/Target/X86/ |
D | X86ISelDAGToDAG.cpp | 2828 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/ |
D | DAGISelMatcherGen.cpp | 192 void MatcherGen::AddMatcher(Matcher *NewNode) { in AddMatcher()
|
/external/llvm/include/llvm/Analysis/ |
D | RegionInfoImpl.h | 353 RegionNodeT *NewNode = new RegionNodeT(static_cast<RegionT *>(Deconst), BB); in getBBNode() local
|
/external/llvm/lib/Transforms/Instrumentation/ |
D | DataFlowSanitizer.cpp | 1128 DomTreeNode *NewNode = DT.addNewBlock(Tail, Head); in loadShadow() local
|
/external/llvm/include/llvm/ADT/ |
D | IntervalMap.h | 1983 unsigned NewNode = 0; in overflow() local
|
/external/llvm/lib/Target/Hexagon/ |
D | HexagonCommonGEP.cpp | 951 GepNode *C = 0, *NewNode = 0; in separateChainForNode() local
|
/external/clang/lib/StaticAnalyzer/Core/ |
D | ExprEngine.cpp | 1386 ExplodedNode *NewNode = G.getNode(NewNodeLoc, NewNodeState, false, &IsNew); in replayWithoutInlining() local
|
D | BugReporter.cpp | 2860 if (const ExplodedNode *NewNode = ForwardMap.lookup(Nodes[i])) { in TrimmedGraph() local
|