Home
last modified time | relevance | path

Searched defs:graph (Results 126 - 150 of 417) sorted by relevance

12345678910>>...17

/third_party/node/deps/v8/src/compiler/
H A Dtype-narrowing-reducer.cc80 Graph* TypeNarrowingReducer::graph() const { return jsgraph()->graph(); } in graph() function in v8::internal::compiler::TypeNarrowingReducer
H A Dtyper.h47 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::Typer
H A Dcontrol-flow-optimizer.h43 Graph* graph() const { return graph_; } in graph() function in v8::internal::compiler::final
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-vreg-allocator.h29 void PreProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PreProcessGraph() argument
30 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) { in PostProcessGraph() argument
H A Dmaglev-graph-printer.h32 void PostProcessGraph(MaglevCompilationUnit*, Graph* graph) {} in PostProcessGraph() argument
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DRangeTreeConverter.java58 private final MutableValueGraph<Node, SimpleEdge> graph field in RangeTreeConverter.NfaVisitor
[all...]
H A DTrailingPathOptimizer.java51 public static ValueGraph<Node, SimpleEdge> optimize(ValueGraph<Node, SimpleEdge> graph) { in optimize() argument
[all...]
/third_party/skia/tests/
H A DGrRenderTaskClusterTest.cpp35 static void create_graph0(SkTArray<sk_sp<GrMockRenderTask>>* graph, in create_graph0() argument
55 create_graph1(SkTArray<sk_sp<GrMockRenderTask>>* graph, SkTArray<sk_sp<GrMockRenderTask>>* expected) create_graph1() argument
79 create_graph2(SkTArray<sk_sp<GrMockRenderTask>>* graph, SkTArray<sk_sp<GrMockRenderTask>>* expected) create_graph2() argument
102 create_graph3(SkTArray<sk_sp<GrMockRenderTask>>* graph, SkTArray<sk_sp<GrMockRenderTask>>* expected) create_graph3() argument
131 SkTArray<sk_sp<GrMockRenderTask>> graph; DEF_TEST() local
[all...]
/arkcompiler/runtime_core/bytecode_optimizer/
H A Dcodegen.h41 explicit BytecodeGen(compiler::Graph *graph, pandasm::Function *function, in BytecodeGen() argument
/arkcompiler/runtime_core/compiler/optimizer/ir_builder/
H A Dir_builder.h69 explicit IrBuilder(Graph *graph) : IrBuilder(graph, graph argument
71 IrBuilder(Graph *graph, RuntimeInterface::MethodPtr method) IrBuilder() argument
[all...]
H A Dphi_resolver.h30 explicit PhiResolver(Graph *graph) in PhiResolver() argument
/arkcompiler/runtime_core/compiler/optimizer/
H A Dpass_manager.cpp30 PassManager::PassManager(Graph *graph, PassManager *parent_pm) in PassManager() argument
H A Dpass_manager_statistics.cpp22 PassManagerStatistics::PassManagerStatistics(Graph *graph) in PassManagerStatistics() argument
/arkcompiler/runtime_core/compiler/tests/
H A Dbranch_elimination_new_test.cpp108 static void CollectDominatedDeadBlocks(Graph *graph, std::set<uint32_t> &dead_blocks, IfImmInst *dead_if_inst) in CollectDominatedDeadBlocks() argument
125 static void CollectDeadBlocksWithIfInst(Graph *graph, std::set<uint32_t> &dead_if_insts, in CollectDeadBlocksWithIfInst() argument
[all...]
H A Dgraph_cloner_new_test.cpp86 static void ForEachNonRootLoop(Graph *graph, Callback cb) in ForEachNonRootLoop() argument
109 static Graph* CloneGraph(Graph *graph) in CloneGraph() argument
120 static Loop* CloneFirstLoopAndUnroll(Graph *graph, size_ argument
[all...]
/arkcompiler/runtime_core/compiler/optimizer/optimizations/
H A Dbranch_elimination.cpp28 BranchElimination::BranchElimination(Graph *graph) in BranchElimination() argument
H A Dlowering.cpp77 auto graph = inst->GetBasicBlock()->GetGraph(); in LowerIf() local
H A Dmove_constants.cpp22 MoveConstants::MoveConstants(Graph *graph) in MoveConstants() argument
53 auto graph = GetGraph(); in MoveFromStartBlock() local
/arkcompiler/runtime_core/static_core/bytecode_optimizer/
H A Dbytecodeopt_peepholes.cpp29 auto *graph = newObject->GetBasicBlock()->GetGraph(); in FindCtorCall() local
57 auto *graph = static_cast<BytecodeOptPeepholes *>(v)->GetGraph(); in CreateInitObject() local
87 auto graph = newObject->GetBasicBlock()->GetGraph(); in ReplaceNewObjectUsers() local
108 const auto graph in VisitNewObject() local
[all...]
H A Dcodegen.h49 explicit BytecodeGen(compiler::Graph *graph, pandasm::Function *function, const BytecodeOptIrInterface *iface) in BytecodeGen() argument
/arkcompiler/runtime_core/static_core/bytecode_optimizer/tests/
H A Dcodegen_test.cpp91 auto graph = CreateEmptyGraph(); in TEST_F() local
117 auto graph = CreateEmptyGraph(); in TEST_F() local
183 auto graph = CreateEmptyGraph(); TEST_F() local
216 auto graph = CreateEmptyGraph(); TEST_F() local
251 auto graph = CreateEmptyGraph(); TEST_F() local
284 auto graph = CreateEmptyGraph(); TEST_F() local
319 auto graph = CreateEmptyGraph(); TEST_F() local
352 auto graph = CreateEmptyGraph(); TEST_F() local
386 auto graph = CreateEmptyGraph(); TEST_F() local
419 auto graph = CreateEmptyGraph(); TEST_F() local
455 auto graph = CreateEmptyGraph(); TEST_F() local
492 auto graph = CreateEmptyGraph(); TEST_F() local
528 auto graph = CreateEmptyGraph(); TEST_F() local
565 auto graph = CreateEmptyGraph(); TEST_F() local
601 auto graph = CreateEmptyGraph(); TEST_F() local
637 auto graph = CreateEmptyGraph(); TEST_F() local
672 auto graph = CreateEmptyGraph(); TEST_F() local
709 auto graph = CreateEmptyGraph(); TEST_F() local
745 auto graph = CreateEmptyGraph(); TEST_F() local
781 auto graph = CreateEmptyGraph(); TEST_F() local
813 auto graph = CreateEmptyGraph(); TEST_F() local
833 auto graph = CreateEmptyGraph(); TEST_F() local
851 auto graph = CreateEmptyGraph(); TEST_F() local
871 auto graph = CreateEmptyGraph(); TEST_F() local
891 auto graph = CreateEmptyGraph(); TEST_F() local
910 auto graph = CreateEmptyGraph(); TEST_F() local
929 auto graph = CreateEmptyGraph(); TEST_F() local
948 auto graph = CreateEmptyGraph(); TEST_F() local
967 auto graph = CreateEmptyGraph(); TEST_F() local
986 auto graph = CreateEmptyGraph(); TEST_F() local
1005 auto graph = CreateEmptyGraph(); TEST_F() local
1024 auto graph = CreateEmptyGraph(); TEST_F() local
1043 auto graph = CreateEmptyGraph(); TEST_F() local
1062 auto graph = CreateEmptyGraph(); TEST_F() local
1081 auto graph = CreateEmptyGraph(); TEST_F() local
1100 auto graph = CreateEmptyGraph(); TEST_F() local
1119 auto graph = CreateEmptyGraph(); TEST_F() local
1138 auto graph = CreateEmptyGraph(); TEST_F() local
1157 auto graph = CreateEmptyGraph(); TEST_F() local
1176 auto graph = CreateEmptyGraph(); TEST_F() local
1195 auto graph = CreateEmptyGraph(); TEST_F() local
1225 auto graph = CreateEmptyGraph(); TEST_F() local
1258 auto graph = CreateEmptyGraph(); TEST_F() local
1291 auto graph = CreateEmptyGraph(); TEST_F() local
1313 auto graph = CreateEmptyGraph(); TEST_F() local
1335 auto graph = CreateEmptyGraph(); TEST_F() local
1357 auto graph = CreateEmptyGraph(); TEST_F() local
1381 auto graph = CreateEmptyGraph(); TEST_F() local
1415 auto graph = CreateEmptyGraph(); TEST_F() local
1465 auto graph = CreateEmptyGraph(); TEST_F() local
1486 auto graph = CreateEmptyGraph(); TEST_F() local
1601 auto *graph = GetGraph(); TEST_F() local
1622 auto graph = CreateEmptyGraph(); TEST_F() local
[all...]
H A Dreg_acc_alloc_test.cpp60 auto graph = CreateEmptyGraph(); in TEST_F() local
91 auto graph = CreateEmptyGraph(); in TEST_F() local
122 auto graph = CreateEmptyGraph(); in TEST_F() local
154 auto graph in TEST_F() local
200 auto graph = CreateEmptyGraph(); TEST_F() local
244 auto graph = CreateEmptyGraph(); TEST_F() local
270 auto graph = CreateEmptyGraph(); TEST_F() local
297 auto graph = CreateEmptyGraph(); TEST_F() local
328 auto graph = CreateEmptyGraph(); TEST_F() local
368 auto graph = CreateEmptyGraph(); TEST_F() local
416 auto graph = CreateEmptyGraph(); TEST_F() local
470 auto graph = CreateEmptyGraph(); TEST_F() local
513 auto graph = CreateEmptyGraph(); TEST_F() local
558 auto graph = CreateEmptyGraph(); TEST_F() local
625 auto graph = CreateEmptyGraph(); TEST_F() local
666 auto graph = CreateEmptyGraph(); TEST_F() local
694 auto graph = CreateEmptyGraph(); TEST_F() local
723 auto graph = CreateEmptyGraph(); TEST_F() local
802 auto graph = CreateEmptyGraph(); TEST_F() local
846 auto graph = CreateEmptyGraph(); TEST_F() local
884 auto graph = CreateEmptyGraph(); TEST_F() local
920 auto graph = CreateEmptyGraph(); TEST_F() local
947 auto graph = CreateEmptyGraph(); TEST_F() local
975 auto graph = CreateEmptyGraph(); TEST_F() local
1003 auto graph = CreateEmptyGraph(); TEST_F() local
1024 auto graph = CreateEmptyGraph(); TEST_F() local
1174 auto graph = GetAllocator()->New<compiler::Graph>(GetAllocator(), GetLocalAllocator(), Arch::X86_64, false, true); TEST_F() local
[all...]
/arkcompiler/runtime_core/static_core/compiler/optimizer/analysis/
H A Dlive_registers.cpp93 BuildIntervalsTree(const ArenaVector<LifeIntervals *> &lifeIntervals, const Graph *graph) BuildIntervalsTree() argument
H A Dobject_type_propagation.cpp124 auto graph = i->GetBasicBlock()->GetGraph(); in VisitParameter() local
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Ddeoptimize_elimination.h32 explicit DeoptimizeElimination(Graph *graph) in DeoptimizeElimination() argument

Completed in 15 milliseconds

12345678910>>...17