| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/regalloc/ |
| H A D | reg_alloc_resolver.h | 27 explicit RegAllocResolver(Graph *graph) in RegAllocResolver() argument
73 static inline void AddLocationToRoots(Location location, SaveStateInst *saveState, const Graph *graph) in AddLocationToRoots() argument
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/ |
| H A D | pipeline.cpp | 71 std::unique_ptr<Pipeline> Pipeline::Create(Graph *graph) in Create() argument
81 static inline bool RunCodegenPass(Graph *graph) in RunCodegenPass() argument
94 auto *graph = pipeline->GetGraph(); in Run() local
134 auto *graph = taskRunner.GetContext().GetPipeline()->GetGraph(); RunRegAllocAndCodeGenPass() local
167 auto graph = GetGraph(); RunOptimizations() local
[all...] |
| /arkcompiler/runtime_core/static_core/compiler/tests/ |
| H A D | if_conversion_test.cpp | 76 auto graph = CreateEmptyGraph(); in TEST_F() local
90 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
117 auto graph = CreateEmptyGraph(); in TEST_F() local
130 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
170 auto graph = CreateEmptyGraph(); in TEST_F() local
184 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
211 auto graph in TEST_F() local
224 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
229 auto graph = CreateEmptyGraph(); CreateExpectedJointTriangleImm() local
301 auto graph = CreateExpectedJointTriangleImm(); TEST_F() local
302 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
334 auto graph = CreateEmptyGraph(); TEST_F() local
349 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
354 auto graph = CreateEmptyGraph(); CreateExpJointTriangleWithTrickFloatPhi() local
418 auto graph = CreateExpJointTriangleWithTrickFloatPhi(); TEST_F() local
419 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
463 auto graph = CreateEmptyGraph(); TEST_F() local
478 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
483 auto graph = CreateEmptyGraph(); CreateExpectedJointDiamondImm() local
558 auto graph = CreateExpectedJointDiamondImm(); TEST_F() local
559 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
564 auto graph = CreateEmptyGraph(); CreateExpectedJointDiamond() local
621 auto graph = CreateExpectedJointDiamond(); TEST_F() local
622 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
627 auto graph = CreateEmptyGraph(); CreateExpJointDiamondWithDroppedSelect() local
689 auto graph = CreateExpJointDiamondWithDroppedSelect(); TEST_F() local
690 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
721 auto graph = CreateEmptyGraph(); TEST_F() local
733 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1142 auto graph = CreateEmptyGraph(); TEST_F() local
1205 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
[all...] |
| H A D | graph_comparator_test.cpp | 25 auto graph = CreateEmptyGraph(); in CreateGraph() local
|
| H A D | savestate_optimization_tests.cpp | 66 auto graph = CreateEmptyGraph(); in TEST_F() local
77 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
153 auto graph = CreateEmptyGraph(); in TEST_F() local
167 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
|
| H A D | rpo_test.cpp | 80 SRC_GRAPH(GraphNoCyclesRPO, Graph *graph) in SRC_GRAPH() argument
197 SRC_GRAPH(GraphWithCyclesRPO, Graph *graph) in SRC_GRAPH() argument
|
| H A D | alias_analysis_test.cpp | 1497 void AliasAnalysisTest::BuildGraphDynamicMethods(Graph *graph) in BuildGraphDynamicMethods() argument
1564 auto graph = CreateDynEmptyGraph(); in TEST_F() local
[all...] |
| H A D | analysis_test.cpp | 48 auto graph = CreateEmptyGraph(); in TEST_F() local
69 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
97 auto graph = CreateEmptyGraph(); in TEST_F() local
118 ASSERT(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
136 auto graph = CreateEmptyGraph(); in TEST_F() local
148 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
170 auto graph in TEST_F() local
187 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
[all...] |
| H A D | lse_test.cpp | 118 SRC_GRAPH(PreviousBlocks, Graph *graph) in SRC_GRAPH() argument
146 OUT_GRAPH(PreviousBlocks, Graph *graph) in OUT_GRAPH() argument
519 SRC_GRAPH(LoopElimination, Graph *graph) in SRC_GRAPH() argument
558 OUT_GRAPH(LoopElimination, Graph *graph) in OUT_GRAPH() argument
606 SRC_GRAPH(LoopBranches, Graph *graph) in SRC_GRAPH() argument
662 OUT_GRAPH(LoopBranches, Graph *graph) OUT_GRAPH() argument
728 SRC_GRAPH(NestedLoopElimination, Graph *graph) SRC_GRAPH() argument
789 OUT_GRAPH(NestedLoopElimination, Graph *graph) OUT_GRAPH() argument
859 SRC_GRAPH(LoopWithMayAliases, Graph *graph) SRC_GRAPH() argument
898 OUT_GRAPH(LoopWithMayAliases, Graph *graph) OUT_GRAPH() argument
948 SRC_GRAPH(CombinedWithLoop, Graph *graph) SRC_GRAPH() argument
986 OUT_GRAPH(CombinedWithLoop, Graph *graph) OUT_GRAPH() argument
1032 SRC_GRAPH(OverwrittenPhiCandidates, Graph *graph) SRC_GRAPH() argument
1072 OUT_GRAPH(OverwrittenPhiCandidates, Graph *graph) OUT_GRAPH() argument
1130 SRC_GRAPH(DeletedPhiCandidate, Graph *graph) SRC_GRAPH() argument
1168 OUT_GRAPH(DeletedPhiCandidate, Graph *graph) OUT_GRAPH() argument
1252 SRC_GRAPH(PrimitiveInt8TypeCasting, Graph *graph) SRC_GRAPH() argument
1279 OUT_GRAPH(PrimitiveInt8TypeCasting, Graph *graph) OUT_GRAPH() argument
1311 auto graph = CreateEmptyBytecodeGraph(); TEST_F() local
1321 SRC_GRAPH(LoopWithOverwrite, Graph *graph) SRC_GRAPH() argument
1360 OUT_GRAPH(LoopWithOverwrite, Graph *graph) OUT_GRAPH() argument
1536 SRC_GRAPH(ReplaceByDominated, Graph *graph) SRC_GRAPH() argument
1582 OUT_GRAPH(ReplaceByDominated, Graph *graph) OUT_GRAPH() argument
1716 SRC_GRAPH(PhiCandidatesWithUpdatedAA, Graph *graph) SRC_GRAPH() argument
1751 OUT_GRAPH(PhiCandidatesWithUpdatedAA, Graph *graph) OUT_GRAPH() argument
1852 SRC_GRAPH(EliminationOrderMattersLoops, Graph *graph) SRC_GRAPH() argument
1889 OUT_GRAPH(EliminationOrderMattersLoops, Graph *graph) OUT_GRAPH() argument
2041 SRC_GRAPH(SameArrayAccesses, Graph *graph) SRC_GRAPH() argument
2079 OUT_GRAPH(SameArrayAccesses, Graph *graph) OUT_GRAPH() argument
2122 SRC_GRAPH(OverInlinedVirtualCall, Graph *graph) SRC_GRAPH() argument
2155 OUT_GRAPH(OverInlinedVirtualCall, Graph *graph) OUT_GRAPH() argument
2296 SRC_GRAPH(EliminateMonitoredStores, Graph *graph) SRC_GRAPH() argument
2323 OUT_GRAPH(EliminateMonitoredStores, Graph *graph) OUT_GRAPH() argument
2456 SRC_GRAPH(InnerOverwrite, Graph *graph) SRC_GRAPH() argument
2525 SRC_GRAPH(OuterOverwrite, Graph *graph) SRC_GRAPH() argument
2583 OUT_GRAPH(OuterOverwrite, Graph *graph) OUT_GRAPH() argument
2918 SRC_GRAPH(RemoveShadowedStore, Graph *graph) SRC_GRAPH() argument
2949 OUT_GRAPH(RemoveShadowedStore, Graph *graph) OUT_GRAPH() argument
3020 SRC_GRAPH(DISABLED_ShadowInInnerLoop, Graph *graph) SRC_GRAPH() argument
3054 OUT_GRAPH(DISABLED_ShadowInInnerLoop, Graph *graph) OUT_GRAPH() argument
3098 SRC_GRAPH(ShadowedStoresInLoop, Graph *graph) SRC_GRAPH() argument
3141 OUT_GRAPH(ShadowedStoresInLoop, Graph *graph) OUT_GRAPH() argument
3465 SRC_GRAPH(HoistInnerLoop, Graph *graph) SRC_GRAPH() argument
3499 OUT_GRAPH(HoistInnerLoop, Graph *graph) OUT_GRAPH() argument
3544 SRC_GRAPH(HoistInnerLoop2, Graph *graph) SRC_GRAPH() argument
3582 OUT_GRAPH(HoistInnerLoop2, Graph *graph) OUT_GRAPH() argument
3707 SRC_GRAPH(AliveLoadInBackedge, Graph *graph) SRC_GRAPH() argument
3750 OUT_GRAPH(AliveLoadInBackedge, Graph *graph) OUT_GRAPH() argument
3803 SRC_GRAPH(AliveLoadInBackedgeInnerLoop, Graph *graph) SRC_GRAPH() argument
3843 OUT_GRAPH(AliveLoadInBackedgeInnerLoop, Graph *graph) OUT_GRAPH() argument
3893 SRC_GRAPH(PhiOverSaveStates, Graph *graph) SRC_GRAPH() argument
3924 OUT_GRAPH(PhiOverSaveStates, Graph *graph) OUT_GRAPH() argument
3967 SRC_GRAPH(SimpleConditionPhi, Graph *graph) SRC_GRAPH() argument
3994 OUT_GRAPH(SimpleConditionPhi, Graph *graph) OUT_GRAPH() argument
4032 SRC_GRAPH(SimpleConditionPhi2, Graph *graph) SRC_GRAPH() argument
4064 OUT_GRAPH(SimpleConditionPhi2, Graph *graph) OUT_GRAPH() argument
4139 SRC_GRAPH(SimpleConditionPhiWithRefInputs, Graph *graph) SRC_GRAPH() argument
4170 OUT_GRAPH(SimpleConditionPhiWithRefInputs, Graph *graph) OUT_GRAPH() argument
4212 SRC_GRAPH(EliminateOverSaveStateDeoptimize, Graph *graph) SRC_GRAPH() argument
4239 OUT_GRAPH(EliminateOverSaveStateDeoptimize, Graph *graph) OUT_GRAPH() argument
[all...] |
| H A D | cleanup_test.cpp | 49 auto graph = CreateEmptyGraph(); in TEST_F() local
57 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
60 SRC_GRAPH(BothHasPhi, Graph *graph) in SRC_GRAPH() argument
90 OUT_GRAPH(BothHasPhi, Graph *graph) in OUT_GRAPH() argument
122 auto graph = CreateEmptyGraph(); in TEST_F() local
124 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
153 auto graph = CreateEmptyGraph(); TEST_F() local
172 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
202 auto graph = CreateEmptyGraph(); TEST_F() local
210 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
234 auto graph = CreateEmptyGraph(); TEST_F() local
247 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
250 SRC_GRAPH(TwoPredecessors, Graph *graph) SRC_GRAPH() argument
279 OUT_GRAPH(TwoPredecessors, Graph *graph) OUT_GRAPH() argument
313 auto graph = CreateEmptyGraph(); TEST_F() local
315 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
318 SRC_GRAPH(TwoPredecessorsPhi, Graph *graph) SRC_GRAPH() argument
354 OUT_GRAPH(TwoPredecessorsPhi, Graph *graph) OUT_GRAPH() argument
395 auto graph = CreateEmptyGraph(); TEST_F() local
397 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
420 auto graph = CreateEmptyGraph(); TEST_F() local
428 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
453 auto graph = CreateEmptyGraph(); TEST_F() local
462 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
491 auto graph = CreateEmptyGraph(); TEST_F() local
508 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
532 auto graph = CreateEmptyGraph(); TEST_F() local
549 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
572 auto graph = CreateEmptyGraph(); TEST_F() local
588 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
591 SRC_GRAPH(JointDiamond, Graph *graph) SRC_GRAPH() argument
622 OUT_GRAPH(JointDiamond, Graph *graph) OUT_GRAPH() argument
655 auto graph = CreateEmptyGraph(); TEST_F() local
657 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
724 auto graph = CreateEmptyGraph(); TEST_F() local
732 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
754 auto graph = CreateEmptyGraph(); TEST_F() local
764 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
793 auto graph = CreateEmptyGraph(); TEST_F() local
801 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
964 SRC_GRAPH(PhiInputs1, Graph *graph) SRC_GRAPH() argument
1045 SRC_GRAPH(PhiInputs2, Graph *graph) SRC_GRAPH() argument
1083 OUT_GRAPH(PhiInputs2, Graph *graph) OUT_GRAPH() argument
1127 auto graph = CreateEmptyGraph(); TEST_F() local
1129 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1177 auto graph = CreateEmptyGraph(); TEST_F() local
1186 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1191 auto graph = CreateEmptyGraph(); TEST_F() local
1279 auto graph = CreateEmptyGraph(); TEST_F() local
1287 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1312 auto graph = CreateEmptyGraph(); TEST_F() local
1326 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1329 SRC_GRAPH(SameBlockPhiTwice, Graph *graph) SRC_GRAPH() argument
1372 OUT_GRAPH(SameBlockPhiTwice, Graph *graph) OUT_GRAPH() argument
1394 auto graph = CreateEmptyGraph(); TEST_F() local
1396 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1399 SRC_GRAPH(TwoBlocksLoop, Graph *graph) SRC_GRAPH() argument
1442 OUT_GRAPH(TwoBlocksLoop, Graph *graph) OUT_GRAPH() argument
1492 auto graph = CreateEmptyGraph(); TEST_F() local
1494 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1497 SRC_GRAPH(TwoLoopsPreHeaders, Graph *graph) SRC_GRAPH() argument
1532 OUT_GRAPH(TwoLoopsPreHeaders, Graph *graph) OUT_GRAPH() argument
1576 auto graph = CreateEmptyGraph(); TEST_F() local
1578 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1612 auto graph = CreateEmptyGraph(); TEST_F() local
1625 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1660 auto graph = CreateEmptyGraph(); TEST_F() local
1674 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1708 auto graph = CreateEmptyGraph(); TEST_F() local
1724 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1727 SRC_GRAPH(TwoBlocksAndPhi, Graph *graph) SRC_GRAPH() argument
1782 OUT_GRAPH(TwoBlocksAndPhi, Graph *graph) OUT_GRAPH() argument
1839 auto graph = CreateEmptyGraph(); TEST_F() local
1841 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1865 auto graph = CreateEmptyGraph(); TEST_F() local
1876 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1908 auto graph = CreateEmptyGraph(); TEST_F() local
1926 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1929 SRC_GRAPH(InlinedCallsWithCommonSaveState, Graph *graph) SRC_GRAPH() argument
1961 OUT_GRAPH(InlinedCallsWithCommonSaveState, Graph *graph) OUT_GRAPH() argument
1997 auto graph = CreateEmptyGraph(); TEST_F() local
1999 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
[all...] |
| H A D | code_sink_test.cpp | 80 SRC_GRAPH(DISABLED_LoadWithOperationPropagation, Graph *graph) in SRC_GRAPH() argument
207 SRC_GRAPH(LoopSinking, Graph *graph) in SRC_GRAPH() argument
280 SRC_GRAPH(CriticalEdgeSinking, Graph *graph) in SRC_GRAPH() argument
341 SRC_GRAPH(LoadOverMonitor, Graph *graph) SRC_GRAPH() argument
419 SRC_GRAPH(DISABLED_LoadOverVolatileLoad, Graph *graph) SRC_GRAPH() argument
490 SRC_GRAPH(IntermediateSinking, Graph *graph) SRC_GRAPH() argument
[all...] |
| H A D | redundant_loop_elimination_test.cpp | 60 auto graph = CreateEmptyGraph(); in TEST_F() local
72 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
99 auto graph = CreateEmptyGraph(); in TEST_F() local
120 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
123 SRC_GRAPH(SimpleLoopTest3, Graph *graph) in SRC_GRAPH() argument
149 OUT_GRAPH(SimpleLoopTest3, Graph *graph) in OUT_GRAPH() argument
180 auto graph = CreateEmptyGraph(); TEST_F() local
182 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
220 auto graph = CreateEmptyGraph(); TEST_F() local
233 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
236 SRC_GRAPH(InnerLoopsTest2, Graph *graph) SRC_GRAPH() argument
273 OUT_GRAPH(InnerLoopsTest2, Graph *graph) OUT_GRAPH() argument
315 auto graph = CreateEmptyGraph(); TEST_F() local
317 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
320 SRC_GRAPH(InnerLoopsTest3, Graph *graph) SRC_GRAPH() argument
357 OUT_GRAPH(InnerLoopsTest3, Graph *graph) OUT_GRAPH() argument
390 auto graph = CreateEmptyGraph(); TEST_F() local
392 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
395 SRC_GRAPH(InnerLoopsTestPhiInOuterBlock, Graph *graph) SRC_GRAPH() argument
432 OUT_GRAPH(InnerLoopsTestPhiInOuterBlock, Graph *graph) OUT_GRAPH() argument
465 auto graph = CreateEmptyGraph(); TEST_F() local
467 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
497 auto graph = CreateEmptyGraph(); TEST_F() local
516 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
519 SRC_GRAPH(TestLoopWithPhiInOuterBlock, Graph *graph) SRC_GRAPH() argument
549 OUT_GRAPH(TestLoopWithPhiInOuterBlock, Graph *graph) OUT_GRAPH() argument
576 auto graph = CreateEmptyGraph(); TEST_F() local
578 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
[all...] |
| H A D | reg_alloc_graph_coloring_test.cpp | 89 SRC_GRAPH(AffineComponent, Graph *graph) in SRC_GRAPH() argument
160 SRC_GRAPH(SimpleCall, Graph *graph) in SRC_GRAPH() argument
|
| /arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/ |
| H A D | memory_coalescing.h | 33 explicit MemoryCoalescing(Graph *graph, bool aligned = true) : Optimization(graph), alignedOnly_(aligned) {} in MemoryCoalescing() argument
|
| H A D | object_type_check_elimination.h | 32 explicit ObjectTypeCheckElimination(Graph *graph) in ObjectTypeCheckElimination() argument
|
| H A D | scheduler.h | 25 explicit Scheduler(Graph *graph) in Scheduler() argument
[all...] |
| /arkcompiler/runtime_core/static_core/compiler/optimizer/ir/ |
| H A D | basicblock.cpp | 24 BasicBlock::BasicBlock(Graph *graph, uint32_t guestPc) in BasicBlock() argument
|
| /arkcompiler/runtime_core/static_core/compiler/tests/codegen/ |
| H A D | codegen_test.h | 90 inline bool RunCodegen(Graph *graph) in RunCodegen() argument
96 void CodegenTest::CheckReturnValue(Graph *graph, [[maybe_unused]] T expectedValue) in CheckReturnValue() argument
|
| /kernel/linux/linux-5.10/arch/sparc/kernel/ |
| H A D | stacktrace.c | 20 int graph = 0; in __save_stack_trace() local
|
| /kernel/linux/linux-6.6/arch/sparc/kernel/ |
| H A D | stacktrace.c | 20 int graph = 0; in __save_stack_trace() local
|
| /third_party/node/deps/v8/src/compiler/ |
| H A D | graph-trimmer.h | 50 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
|
| H A D | node-marker.h | 63 V8_INLINE NodeMarker(Graph* graph, uint32_t num_states) in NodeMarker() argument
|
| H A D | dead-code-elimination.h | 73 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
|
| H A D | diamond.h | 18 Graph* graph; member
[all...] |
| H A D | select-lowering.cc | 18 SelectLowering::SelectLowering(JSGraphAssembler* graph_assembler, Graph* graph) in SelectLowering() argument
|