Home
last modified time | relevance | path

Searched refs:graph (Results 1 – 25 of 276) sorted by relevance

12345678910>>...12

/aosp12/art/tools/ahat/src/test/com/android/ahat/
H A DDominatorsTest.java76 graph.node("n"); in singleNode()
86 graph.node("child"); in parentWithChild()
102 graph.node("child"); in reachableTwoWays()
118 graph.node("child"); in reachableDirectAndIndirect()
132 graph.node("child"); in subDominator()
159 graph.node("a", "b"); in singleEntryLoop()
205 graph.node("child"); in dominatorOverwrite()
219 graph.node(root); in stackOverflow()
246 graph.node("c"); in hiddenRevisit()
273 graph.node("e"); in preUndominatedUpdate()
[all …]
/aosp12/art/compiler/optimizing/
H A Dfind_loops_test.cc38 HGraph* graph = CreateCFG(data); in TEST_F() local
49 HGraph* graph = CreateCFG(data); in TEST_F() local
63 HGraph* graph = CreateCFG(data); in TEST_F() local
78 HGraph* graph = CreateCFG(data); in TEST_F() local
91 HGraph* graph = CreateCFG(data); in TEST_F() local
97 static void TestBlock(HGraph* graph, in TestBlock() argument
135 HGraph* graph = CreateCFG(data); in TEST_F() local
161 HGraph* graph = CreateCFG(data); in TEST_F() local
184 HGraph* graph = CreateCFG(data); in TEST_F() local
208 HGraph* graph = CreateCFG(data); in TEST_F() local
[all …]
H A Dgvn_test.cc32 graph->AddBlock(entry); in TEST_F()
33 graph->SetEntryBlock(entry); in TEST_F()
41 graph->AddBlock(block); in TEST_F()
113 graph->AddBlock(entry); in TEST_F()
122 graph->AddBlock(block); in TEST_F()
138 graph->AddBlock(then); in TEST_F()
139 graph->AddBlock(else_); in TEST_F()
140 graph->AddBlock(join); in TEST_F()
192 graph->AddBlock(entry); in TEST_F()
202 graph->AddBlock(block); in TEST_F()
[all …]
H A Dgraph_test.cc38 graph->AddBlock(if_block); in CreateIfBlock()
49 graph->AddBlock(block); in CreateGotoBlock()
57 graph->SetEntryBlock(block); in CreateEntryBlock()
63 graph->AddBlock(block); in CreateReturnBlock()
71 graph->AddBlock(block); in CreateExitBlock()
81 HGraph* graph = CreateGraph(); in TEST_F() local
97 graph->SimplifyCFG(); in TEST_F()
129 graph->SimplifyCFG(); in TEST_F()
159 graph->BuildDominatorTree(); in TEST_F()
191 graph->BuildDominatorTree(); in TEST_F()
[all …]
H A Dregister_allocator_test.cc493 graph->AddBlock(entry); in BuildIfElseWithPhi()
500 graph->AddBlock(block); in BuildIfElseWithPhi()
517 graph->AddBlock(then); in BuildIfElseWithPhi()
518 graph->AddBlock(else_); in BuildIfElseWithPhi()
519 graph->AddBlock(join); in BuildIfElseWithPhi()
555 graph->AnalyzeLoops(); in BuildIfElseWithPhi()
556 return graph; in BuildIfElseWithPhi()
667 graph->AddBlock(exit); in BuildFieldReturn()
672 return graph; in BuildFieldReturn()
740 return graph; in BuildTwoSubs()
[all …]
H A Dcodegen_test.cc83 RemoveSuspendChecks(graph); in TestCode()
96 RemoveSuspendChecks(graph); in TestCodeLong()
418 graph->AddBlock(entry); in TEST_F()
616 graph->AddBlock(block); in TestComparison()
619 graph->AddBlock(exit_block); in TestComparison()
731 HParallelMove* move = new (graph->GetAllocator()) HParallelMove(graph->GetAllocator()); in TEST_F()
777 HParallelMove* move = new (graph->GetAllocator()) HParallelMove(graph->GetAllocator()); in TEST_F()
801 graph->SetHasSIMD(true); in TEST_F()
821 graph->SetHasSIMD(false); in TEST_F()
870 graph->SetHasSIMD(true); in TEST_F()
[all …]
H A Dcodegen_test_utils.h269 static void ValidateGraph(HGraph* graph) { in ValidateGraph() argument
270 GraphChecker graph_checker(graph); in ValidateGraph()
282 HGraph* graph, in RunCodeNoCheck() argument
295 hook_before_codegen(graph); in RunCodeNoCheck()
303 HGraph* graph, in RunCode() argument
307 ValidateGraph(graph); in RunCode()
314 HGraph* graph, in RunCode() argument
325 return new (graph->GetAllocator()) TestCodeGeneratorARMVIXL(graph, compiler_options); in create_codegen_arm_vixl32()
331 return new (graph->GetAllocator()) TestCodeGeneratorARM64(graph, compiler_options); in create_codegen_arm64()
337 return new (graph->GetAllocator()) TestCodeGeneratorX86(graph, compiler_options); in create_codegen_x86()
[all …]
H A Dgraph_checker_test.cc37 HGraph* graph = CreateGraph(); in CreateSimpleCFG() local
40 graph->AddBlock(entry_block); in CreateSimpleCFG()
41 graph->SetEntryBlock(entry_block); in CreateSimpleCFG()
44 graph->AddBlock(exit_block); in CreateSimpleCFG()
45 graph->SetExitBlock(exit_block); in CreateSimpleCFG()
47 graph->BuildDominatorTree(); in CreateSimpleCFG()
48 return graph; in CreateSimpleCFG()
52 HGraph* graph = CreateCFG(data); in TestCode() local
53 ASSERT_NE(graph, nullptr); in TestCode()
55 GraphChecker graph_checker(graph); in TestCode()
[all …]
H A Dnodes_test.cc145 HGraph* graph = CreateGraph(); in TEST_F() local
147 graph->AddBlock(entry); in TEST_F()
148 graph->SetEntryBlock(entry); in TEST_F()
155 graph->AddBlock(first_block); in TEST_F()
162 graph->AddBlock(exit_block); in TEST_F()
187 graph->AddBlock(entry); in TEST_F()
188 graph->SetEntryBlock(entry); in TEST_F()
212 graph->AddBlock(entry); in TEST_F()
213 graph->SetEntryBlock(entry); in TEST_F()
230 graph->AddBlock(entry); in TEST_F()
[all …]
H A Doptimization.cc168 HGraph* graph, in ConstructOptimizations() argument
213 graph, *codegen, most_recent_induction, stats, pass_name); in ConstructOptimizations()
224 opt = new (allocator) HConstantFolding(graph, pass_name); in ConstructOptimizations()
227 opt = new (allocator) HDeadCodeElimination(graph, stats, pass_name); in ConstructOptimizations()
246 opt = new (allocator) HSelectGenerator(graph, stats, pass_name); in ConstructOptimizations()
252 opt = new (allocator) InstructionSimplifier(graph, in ConstructOptimizations()
259 opt = new (allocator) CHAGuardOptimization(graph, pass_name); in ConstructOptimizations()
262 opt = new (allocator) CodeSinking(graph, stats, pass_name); in ConstructOptimizations()
280 opt = new (allocator) arm::InstructionSimplifierArm(graph, stats); in ConstructOptimizations()
284 opt = new (allocator) arm::CriticalNativeAbiFixupArm(graph, stats); in ConstructOptimizations()
[all …]
H A Dlive_ranges_test.cc38 HGraph* graph = CreateCFG(data); in BuildGraph() local
42 RemoveSuspendChecks(graph); in BuildGraph()
45 return graph; in BuildGraph()
65 HGraph* graph = BuildGraph(data); in TEST_F() local
76 HBasicBlock* block = graph->GetBlocks()[1]; in TEST_F()
110 HGraph* graph = BuildGraph(data); in TEST_F() local
157 HGraph* graph = BuildGraph(data); in TEST_F() local
231 HGraph* graph = BuildGraph(data); in TEST_F() local
232 RemoveSuspendChecks(graph); in TEST_F()
307 HGraph* graph = BuildGraph(data); in TEST_F() local
[all …]
H A Dinduction_var_range.cc1033 if (GenerateCode(info->op_b, nullptr, graph, block, graph ? &c : nullptr, false, false)) { in GenerateLastValuePolynomial()
1034 if (graph != nullptr) { in GenerateLastValuePolynomial()
1041 Insert(block, new (graph->GetAllocator()) HAdd(type, graph->GetConstant(type, sum), c)); in GenerateLastValuePolynomial()
1064 if (graph != nullptr) { in GenerateLastValueGeometric()
1167 GenerateCode(info->op_a, nullptr, graph, block, graph ? &x : nullptr, false, false) && in GenerateLastValuePeriodic()
1168 GenerateCode(info->op_b, nullptr, graph, block, graph ? &y : nullptr, false, false) && in GenerateLastValuePeriodic()
1169 GenerateCode(trip->op_a, nullptr, graph, block, graph ? &t : nullptr, false, false)) { in GenerateLastValuePeriodic()
1171 if (graph != nullptr) { in GenerateLastValuePeriodic()
1184 if (graph != nullptr) { in GenerateLastValuePeriodic()
1271 if (graph != nullptr) { in GenerateCode()
[all …]
H A Dlinear_order.cc58 static bool IsLinearOrderWellFormed(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in IsLinearOrderWellFormed() argument
59 for (HBasicBlock* header : graph->GetBlocks()) { in IsLinearOrderWellFormed()
86 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in LinearizeGraphInternal() argument
87 DCHECK_EQ(linear_order.size(), graph->GetReversePostOrder().size()); in LinearizeGraphInternal()
97 ScopedArenaAllocator allocator(graph->GetArenaStack()); in LinearizeGraphInternal()
98 ScopedArenaVector<uint32_t> forward_predecessors(graph->GetBlocks().size(), in LinearizeGraphInternal()
100 for (HBasicBlock* block : graph->GetReversePostOrder()) { in LinearizeGraphInternal()
112 worklist.push_back(graph->GetEntryBlock()); in LinearizeGraphInternal()
130 DCHECK(graph->HasIrreducibleLoops() || IsLinearOrderWellFormed(graph, linear_order)); in LinearizeGraphInternal()
H A Dside_effects_analysis.h28 explicit SideEffectsAnalysis(HGraph* graph, const char* pass_name = kSideEffectsAnalysisPassName)
29 : HOptimization(graph, pass_name),
30 graph_(graph),
31 block_effects_(graph->GetBlocks().size(),
32 graph->GetAllocator()->Adapter(kArenaAllocSideEffectsAnalysis)),
33 loop_effects_(graph->GetBlocks().size(),
34 graph->GetAllocator()->Adapter(kArenaAllocSideEffectsAnalysis)) {}
H A Dbounds_check_elimination_test.cc364 graph->AddBlock(entry); in BuildSSAGraph1()
375 graph->AddBlock(block); in BuildSSAGraph1()
385 graph->AddBlock(exit); in BuildSSAGraph1()
479 graph->AddBlock(entry); in BuildSSAGraph2()
491 graph->AddBlock(block); in BuildSSAGraph2()
505 graph->AddBlock(exit); in BuildSSAGraph2()
589 graph->AddBlock(entry); in BuildSSAGraph3()
597 graph->AddBlock(block); in BuildSSAGraph3()
614 graph->AddBlock(exit); in BuildSSAGraph3()
691 graph->AddBlock(entry); in BuildSSAGraph4()
[all …]
H A Dconstant_folding_test.cc124 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
185 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
246 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
325 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
396 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
459 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
523 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
623 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
708 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
840 auto check_after_cf = [](HGraph* graph) { in TEST_F() argument
[all …]
/aosp12/frameworks/compile/mclinker/unittests/
H A DGraphTest.cpp37 ListDigraph graph; in TEST_F() local
62 graph.erase(*u2); in TEST_F()
84 ListDigraph graph; in TEST_F() local
109 graph.erase(*u1); in TEST_F()
131 ListDigraph graph; in TEST_F() local
156 graph.erase(*u3); in TEST_F()
228 graph.erase(*a2); in TEST_F()
314 Digraph graph; in TEST_F() local
317 graph.addNode(); in TEST_F()
318 graph.addNode(); in TEST_F()
[all …]
/aosp12/packages/services/Car/cpp/computepipe/tests/runner/graph/
H A DLocalPrebuiltGraphTest.cpp37 namespace graph { namespace
57 ASSERT_TRUE(graph); in TEST()
69 ASSERT_TRUE(graph); in TEST()
73 graph->GetSupportedGraphConfigs(); in TEST()
81 functionVisited = graph->GetErrorMessage(); in TEST()
119 graph->GetSupportedGraphConfigs(); in TEST()
134 EXPECT_EQ(graph->SetInputStreamPixelData( in TEST()
137 EXPECT_EQ(graph->SetInputStreamPixelData( in TEST()
140 EXPECT_EQ(graph->SetInputStreamPixelData( in TEST()
143 EXPECT_EQ(graph->SetInputStreamPixelData( in TEST()
[all …]
/aosp12/packages/services/Car/cpp/computepipe/tests/fuzz/
H A DGrpcGraphFuzzer.cpp30 namespace graph { namespace
68 graph->GetGraphType(); in LLVMFuzzerTestOneInput()
72 graph->GetGraphState(); in LLVMFuzzerTestOneInput()
76 graph->GetStatus(); in LLVMFuzzerTestOneInput()
80 graph->GetErrorMessage(); in LLVMFuzzerTestOneInput()
84 graph->GetSupportedGraphConfigs(); in LLVMFuzzerTestOneInput()
98 graph->StartGraphProfiling(); in LLVMFuzzerTestOneInput()
102 graph->StopGraphProfiling(); in LLVMFuzzerTestOneInput()
109 graph->handleConfigPhase(e); in LLVMFuzzerTestOneInput()
116 graph->handleExecutionPhase(e); in LLVMFuzzerTestOneInput()
[all …]
H A DLocalPrebuildGraphFuzzer.cpp30 namespace graph { namespace
69 graph->GetGraphType(); in LLVMFuzzerTestOneInput()
73 graph->GetGraphState(); in LLVMFuzzerTestOneInput()
77 graph->GetStatus(); in LLVMFuzzerTestOneInput()
81 graph->GetErrorMessage(); in LLVMFuzzerTestOneInput()
85 graph->GetSupportedGraphConfigs(); in LLVMFuzzerTestOneInput()
99 graph->StartGraphProfiling(); in LLVMFuzzerTestOneInput()
103 graph->StopGraphProfiling(); in LLVMFuzzerTestOneInput()
110 graph->handleConfigPhase(e); in LLVMFuzzerTestOneInput()
117 graph->handleExecutionPhase(e); in LLVMFuzzerTestOneInput()
[all …]
/aosp12/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/
H A DGraphRunner.java199 onOpenGraph(graph); in enterSubGraph()
293 onOpenGraph(graph); in onPrepare()
298 loadFilters(graph); in onOpenGraph()
299 mOpenedGraphs.add(graph); in onOpenGraph()
381 graph.flushFrames(); in onFlush()
390 graph.wipe(); in onTearDown()
400 closeFilters(graph); in closeAllFilters()
669 if (graph.mRunner != this) { in start()
672 mRunningGraph = graph; in start()
920 mGraphs.add(graph); in attachGraph()
[all …]
/aosp12/packages/services/Telecomm/tests/src/com/android/server/telecom/tests/
H A DIncomingCallFilterGraphTest.java119 graph.performFiltering(); in testEmptyGraph()
134 graph.addFilter(allowFilter); in testFiltersPerformOrder()
135 graph.addFilter(disallowFilter); in testFiltersPerformOrder()
137 graph.performFiltering(); in testFiltersPerformOrder()
153 graph.addFilter(allowFilter1); in testFiltersPerformInParallel()
154 graph.addFilter(allowFilter2); in testFiltersPerformInParallel()
155 graph.addFilter(disallowFilter); in testFiltersPerformInParallel()
156 graph.performFiltering(); in testFiltersPerformInParallel()
171 graph.addFilter(disallowFilter); in testFiltersTimeout()
172 graph.addFilter(timeoutFilter); in testFiltersTimeout()
[all …]
/aosp12/build/make/tools/product_config/
H A Dinherit_tree.py11 def PrintNodes(graph, node, prefix): argument
13 children = graph.get(node, [])
16 for child in sorted(graph.get(node, [])):
17 PrintNodes(graph, child, prefix + " ")
28 graph = {}
40 graph.setdefault(line[1], list()).append(line[2])
42 PrintNodes(graph, root, "")
/aosp12/system/memory/libmemunreachable/
H A DTarjan.h72 void Execute(Graph<T>& graph, SCCList<T>& out);
76 void Tarjan(Node<T>* vertex, Graph<T>& graph);
84 void TarjanAlgorithm<T>::Execute(Graph<T>& graph, SCCList<T>& out) { in Execute() argument
88 for (auto& it : graph) { in Execute()
93 for (auto& it : graph) { in Execute()
95 Tarjan(it, graph); in Execute()
102 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) { in Tarjan() argument
111 Tarjan(vertex_next, graph); in Tarjan()
131 void Tarjan(Graph<T>& graph, SCCList<T>& out) { in Tarjan() argument
132 TarjanAlgorithm<T> tarjan{graph.get_allocator()}; in Tarjan()
[all …]
/aosp12/system/extras/simpleperf/scripts/purgatorio/
H A DREADME.md8 [Bokeh](https://bokeh.org/) and [D3 flamegraphs](https://github.com/spiermar/d3-flame-graph).
10 …ce, and allow the user to interact with the graph by zooming, hovering on samples and visualize a …
31 …$ adb shell simpleperf record --trace-offcpu --call-graph fp -o /data/local/camera_warm_launch.dat…
47 … the graph. When selecting a et of samples, their aggregated data will be visualized in the other …
49 The toolbox to the right can be used to configure interactions with the graph:
53 ## Flame graph
54 The flame graph is located in the upper right portion. Once samples are selected in the main graph,…
56 ![flame graph](images/flame_graph.png)
60 ![flame graph](images/flame_graph_zoomed.png)
62 …can be done by clicking the related check box. The graph below is the same as in the first flame g…
[all …]

12345678910>>...12