Home
last modified time | relevance | path

Searched defs:graph (Results 101 - 125 of 478) sorted by relevance

12345678910>>...20

/third_party/node/deps/v8/src/compiler/
H A Dwasm-loop-peeling.cc17 void PeelWasmLoop(Node* loop_node, ZoneUnorderedSet<Node*>* loop, Graph* graph, in PeelWasmLoop() argument
/third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/
H A DNfaBuilder.java31 private final MutableValueGraph<Node, SimpleEdge> graph = field in NfaBuilder
47 public ValueGraph<Node, SimpleEdge> graph() { in graph() method in NfaBuilder
[all...]
/third_party/skia/third_party/externals/spirv-tools/test/fuzz/
H A Dcall_graph_test.cpp284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); TEST() local
365 const auto graph = CallGraph(context.get()); TEST() local
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/fuzz/
H A Dcall_graph_test.cpp284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); TEST() local
365 const auto graph = CallGraph(context.get()); TEST() local
[all...]
/third_party/skia/tests/
H A DTopoSortTest.cpp25 static void create_graph0(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) { in create_graph0() argument
46 create_graph1(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph1() argument
61 create_graph2(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph2() argument
84 create_graph3(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph3() argument
107 create_graph4(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph4() argument
130 create_graph5(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph5() argument
150 create_graph6(SkTArray<sk_sp<ToolUtils::TopoTestNode>>* graph) create_graph6() argument
179 SkTArray<sk_sp<ToolUtils::TopoTestNode>> graph; DEF_TEST() local
[all...]
/third_party/spirv-tools/test/fuzz/
H A Dcall_graph_test.cpp284 const auto graph = CallGraph(context.get()); in TEST() local
304 const auto graph = CallGraph(context.get()); in TEST() local
323 const auto graph = CallGraph(context.get()); in TEST() local
342 const auto graph = CallGraph(context.get()); TEST() local
365 const auto graph = CallGraph(context.get()); TEST() local
[all...]
/arkcompiler/runtime_core/compiler/optimizer/optimizations/
H A Dvn.cpp90 ValNum::ValNum(Graph *graph) : Optimization(graph), map_insts_(GetGraph()->GetLocalAllocator()->Adapter()) {} in ValNum() argument
/arkcompiler/runtime_core/compiler/optimizer/
H A Dpass.h27 explicit Pass(Graph *graph) : graph_(graph) {} in Pass() argument
109 explicit Analysis(Graph *graph) : Pass(graph) in Analysis() argument
/arkcompiler/runtime_core/compiler/tests/
H A Dreg_alloc_resolver_test.cpp56 static void ForEachInst(Graph *graph, Callback cb) in ForEachInst() argument
71 static void InitUsedRegs(Graph *graph, size_t count) in InitUsedRegs() argument
[all...]
/arkcompiler/runtime_core/libark_defect_scan_aux/include/
H A Dfunction.h33 Function(std::string_view record_name, std::string_view func_name, panda_file::File::EntityId m_id, uint32_t arg_count, const Graph &graph, const AbcFile *abc_file) Function() argument
/arkcompiler/runtime_core/static_core/compiler/optimizer/optimizations/
H A Dinline_intrinsics.cpp35 InlineIntrinsics::InlineIntrinsics(Graph *graph) in InlineIntrinsics() argument
H A Dchecks_elimination.h50 explicit ChecksElimination(Graph *graph) in ChecksElimination() argument
H A Dphi_type_resolving.cpp29 PhiTypeResolving::PhiTypeResolving(Graph *graph) : Optimization(graph), phis_ {graph->GetLocalAllocator()->Adapter()} {} in PhiTypeResolving() argument
H A Dlocations_builder.cpp27 bool RunLocationsBuilder(Graph *graph) in RunLocationsBuilder() argument
242 auto graph = static_cast<LocationsBuilder *>(visitor)->GetGraph(); LOCATIONS_BUILDER() local
312 auto graph = static_cast<LocationsBuilder *>(visitor)->GetGraph(); LOCATIONS_BUILDER() local
327 auto graph = static_cast<LocationsBuilder *>(visitor)->GetGraph(); LOCATIONS_BUILDER() local
343 auto graph = static_cast<LocationsBuilder *>(visitor)->GetGraph(); LOCATIONS_BUILDER() local
361 auto graph = static_cast<LocationsBuilder *>(visitor)->GetGraph(); LOCATIONS_BUILDER() local
379 auto graph = static_cast<LocationsBuilder *>(visitor)->GetGraph(); LOCATIONS_BUILDER() local
[all...]
H A Dinlining.h50 explicit Inlining(Graph *graph) : Inlining(graph, 0, 0, nullptr) {} in Inlining() argument
51 Inlining(Graph *graph, bool resolveWoInline) : Inlining(graph) in Inlining() argument
/arkcompiler/runtime_core/static_core/compiler/tests/
H A Dif_merging_test.cpp73 auto graph = CreateEmptyGraph(); in TEST_F() local
196 auto graph = CreateEmptyGraph(); in CreateExpectedCheckInstsSplit() local
270 auto graph = CreateExpectedCheckInstsSplit(); in TEST_F() local
271 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); in TEST_F() local
302 auto graph = CreateEmptyGraph(); TEST_F() local
505 auto graph = CreateEmptyGraph(); CreateExpectedConstPhiIf() local
573 auto graph = CreateExpectedConstPhiIf(); TEST_F() local
574 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
579 auto graph = CreateEmptyGraph(); CreateExpConstantEqualToAllPhiInputs() local
649 auto graph = CreateExpConstantEqualToAllPhiInputs(); TEST_F() local
650 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
655 auto graph = CreateEmptyGraph(); CreateExpConstantNotEqualToPhiInputs() local
726 auto graph = CreateExpConstantNotEqualToPhiInputs(); TEST_F() local
727 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
869 auto graph = CreateEmptyGraph(); TEST_F() local
905 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
965 auto graph = CreateEmptyGraph(); TEST_F() local
1003 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1008 auto graph = CreateEmptyGraph(); CreateExpectedSplitPhiIntoTwo() local
1124 auto graph = CreateExpectedSplitPhiIntoTwo(); TEST_F() local
1125 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1182 auto graph = CreateEmptyGraph(); TEST_F() local
1258 auto graph = CreateEmptyGraph(); TEST_F() local
1268 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1318 auto graph = CreateEmptyGraph(); TEST_F() local
1329 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1373 auto graph = CreateEmptyGraph(); TEST_F() local
1381 ASSERT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
1400 auto graph = CreateEmptyGraph(); TEST_F() local
[all...]
H A Dloop_peeling_test.cpp26 void BuildGraphTwoBackEdges(Graph *graph) in BuildGraphTwoBackEdges() argument
53 void BuildGraphNotHeaderExit(Graph *graph) in BuildGraphNotHeaderExit() argument
90 void BuildGraphHeaderAndBackEdgeExit(Graph *graph) in BuildGraphHeaderAndBackEdgeExit() argument
119 void BuildGraphMultiExit(Graph *graph) in BuildGraphMultiExit() argument
593 auto graph = CreateEmptyGraph(); in TEST_F() local
597 EXPECT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
616 auto graph = CreateEmptyGraph(); TEST_F() local
620 EXPECT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
640 auto graph = CreateEmptyGraph(); TEST_F() local
644 EXPECT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
663 auto graph = CreateEmptyGraph(); TEST_F() local
667 EXPECT_TRUE(GraphComparator().Compare(GetGraph(), graph)); TEST_F() local
824 auto graph = CreateEmptyGraph(); TEST_F() local
[all...]
H A Dlive_registers_test.cpp244 auto graph = GetGraph(); in TEST_F() local
H A Dintrinsic_codegen_test.cpp42 auto graph = graph_creator_.GenerateGraph(inst); in TryEncode() local
H A Dadjust_arefs_test.cpp36 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); in BuildGraphOneBlockContinuousChain() local
72 auto *graph = BuildGraphOneBlockContinuousChain(); in TEST_F() local
112 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); BuildGraphOneBlockBrokenChain() local
149 auto *graph = BuildGraphOneBlockBrokenChain(); TEST_F() local
193 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); BuildGraphMultipleBlockContinuousChain() local
239 auto *graph = BuildGraphMultipleBlockContinuousChain(); TEST_F() local
287 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); BuildGraphMultipleBlockBrokenChain() local
335 auto *graph = BuildGraphMultipleBlockBrokenChain(); TEST_F() local
384 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); BuildGraphProcessIndex() local
414 auto *graph = BuildGraphProcessIndex(offset1, offset2, offset3); TEST_F() local
450 auto graph = CreateEmptyFastpathGraph(RUNTIME_ARCH); TEST_F() local
[all...]
H A Dreg_alloc_common_test.cpp25 void RunRegAllocatorsAndCheck(Graph *graph, Checker checker) const in RunRegAllocatorsAndCheck() argument
31 void RunRegAllocatorsAndCheck(Graph *graph, RegMask mask, Checker checker) const in RunRegAllocatorsAndCheck() argument
59 SRC_GRAPH(TestParametersLocationsUINT64, Graph *graph) SRC_GRAPH() argument
91 SRC_GRAPH(TestParametersLocationsUINT32, Graph *graph) SRC_GRAPH() argument
127 auto graph = CreateEmptyGraph(); TestParametersLocations() local
203 auto graph = CreateEmptyGraph(); TEST_F() local
234 auto graph = CreateEmptyGraph(); TEST_F() local
277 auto graph = GetGraph(); TEST_F() local
315 auto graph = CreateEmptyGraph(); TEST_F() local
[all...]
/arkcompiler/runtime_core/static_core/libllvmbackend/tests/
H A Dinst_generator_test.cpp46 auto graph = graphCreator_.GenerateGraph(i); in GenerateOp() local
88 auto graph = graphCreator_.GenerateGraph(i); GenerateIntrinsic() local
[all...]
/arkcompiler/runtime_core/static_core/compiler/optimizer/
H A Dpass.h27 explicit Pass(Graph *graph) : graph_(graph) {} in Pass() argument
109 explicit Analysis(Graph *graph) : Pass(graph) in Analysis() argument
/kernel/linux/linux-5.10/arch/csky/kernel/
H A Dperf_callchain.c27 int graph = 0; in unwind_frame_kernel() local
/kernel/linux/linux-6.6/arch/csky/kernel/
H A Dperf_callchain.c27 int graph = 0; in unwind_frame_kernel() local

Completed in 11 milliseconds

12345678910>>...20