Home
last modified time | relevance | path

Searched defs:graph (Results 1 – 25 of 134) sorted by relevance

123456

/aosp12/art/tools/ahat/src/test/com/android/ahat/
H A DDominatorsTest.java75 Graph graph = new Graph(); in singleNode() local
84 Graph graph = new Graph(); in parentWithChild() local
98 Graph graph = new Graph(); in reachableTwoWays() local
115 Graph graph = new Graph(); in reachableDirectAndIndirect() local
129 Graph graph = new Graph(); in subDominator() local
144 Graph graph = new Graph(); in childSelfLoop() local
157 Graph graph = new Graph(); in singleEntryLoop() local
176 Graph graph = new Graph(); in multiEntryLoop() local
201 Graph graph = new Graph(); in dominatorOverwrite() local
217 Graph graph = new Graph(); in stackOverflow() local
[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()
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 Dgraph_test.cc36 HBasicBlock* GraphTest::CreateIfBlock(HGraph* graph) { in CreateIfBlock()
47 HBasicBlock* GraphTest::CreateGotoBlock(HGraph* graph) { in CreateGotoBlock()
55 HBasicBlock* GraphTest::CreateEntryBlock(HGraph* graph) { in CreateEntryBlock()
69 HBasicBlock* GraphTest::CreateExitBlock(HGraph* graph) { in CreateExitBlock()
81 HGraph* graph = CreateGraph(); in TEST_F() local
113 HGraph* graph = CreateGraph(); in TEST_F() local
145 HGraph* graph = CreateGraph(); in TEST_F() local
177 HGraph* graph = CreateGraph(); in TEST_F() local
209 HGraph* graph = CreateGraph(); in TEST_F() local
245 HGraph* graph = CreateGraph(); in TEST_F() local
[all …]
H A Dcodegen_test_utils.h56 CodeGenerator* CreateCodeGenerator(HGraph* graph, const CompilerOptions& compiler_options) { in CreateCodeGenerator()
88 TestCodeGeneratorARMVIXL(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARMVIXL()
130 TestCodeGeneratorARM64(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorARM64()
148 TestCodeGeneratorX86(HGraph* graph, const CompilerOptions& compiler_options) in TestCodeGeneratorX86()
269 static void ValidateGraph(HGraph* graph) { in ValidateGraph()
282 HGraph* graph, in RunCodeNoCheck()
303 HGraph* graph, in RunCode()
314 HGraph* graph, in RunCode()
330 inline CodeGenerator* create_codegen_arm64(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_arm64()
336 inline CodeGenerator* create_codegen_x86(HGraph* graph, const CompilerOptions& compiler_options) { in create_codegen_x86()
[all …]
H A Dregister_allocator_test.cc91 HGraph* graph = CreateCFG(data); in Check() local
106 HGraph* graph = CreateGraph(); in TEST_F() local
330 HGraph* graph = CreateCFG(data); in Loop3() local
363 HGraph* graph = CreateCFG(data); in TEST_F() local
413 HGraph* graph = CreateCFG(data); in DeadPhi() local
437 HGraph* graph = CreateCFG(data); in TEST_F() local
491 HGraph* graph = CreateGraph(); in BuildIfElseWithPhi() local
641 HGraph* graph = CreateGraph(); in BuildFieldReturn() local
717 HGraph* graph = CreateGraph(); in BuildTwoSubs() local
789 HGraph* graph = CreateGraph(); in BuildDiv() local
[all …]
H A Dlive_ranges_test.cc38 HGraph* graph = CreateCFG(data); in BuildGraph() local
65 HGraph* graph = BuildGraph(data); in TEST_F() local
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
307 HGraph* graph = BuildGraph(data); in TEST_F() local
381 HGraph* graph = BuildGraph(data); in TEST_F() local
H A Dssa_phi_elimination.h31 explicit SsaDeadPhiElimination(HGraph* graph) in SsaDeadPhiElimination()
53 explicit SsaRedundantPhiElimination(HGraph* graph) in SsaRedundantPhiElimination()
H A Dgraph_checker_test.cc37 HGraph* graph = CreateGraph(); in CreateSimpleCFG() local
52 HGraph* graph = CreateCFG(data); in TestCode() local
98 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
113 HGraph* graph = CreateSimpleCFG(); in TEST_F() local
H A Dconstant_folding_test.cc124 auto check_after_cf = [](HGraph* graph) { in TEST_F()
185 auto check_after_cf = [](HGraph* graph) { in TEST_F()
246 auto check_after_cf = [](HGraph* graph) { in TEST_F()
325 auto check_after_cf = [](HGraph* graph) { in TEST_F()
396 auto check_after_cf = [](HGraph* graph) { in TEST_F()
459 auto check_after_cf = [](HGraph* graph) { in TEST_F()
523 auto check_after_cf = [](HGraph* graph) { in TEST_F()
623 auto check_after_cf = [](HGraph* graph) { in TEST_F()
708 auto check_after_cf = [](HGraph* graph) { in TEST_F()
840 auto check_after_cf = [](HGraph* graph) { in TEST_F()
H A Dgvn_test.cc30 HGraph* graph = CreateGraph(); in TEST_F() local
111 HGraph* graph = CreateGraph(); in TEST_F() local
190 HGraph* graph = CreateGraph(); in TEST_F() local
311 HGraph* graph = CreateGraph(); in TEST_F() local
H A Dx86_memory_gen.cc29 MemoryOperandVisitor(HGraph* graph, bool do_implicit_null_checks) in MemoryOperandVisitor()
72 X86MemoryOperandGeneration::X86MemoryOperandGeneration(HGraph* graph, in X86MemoryOperandGeneration()
H A Dnodes_test.cc145 HGraph* graph = CreateGraph(); in TEST_F() local
185 HGraph* graph = CreateGraph(); in TEST_F() local
210 HGraph* graph = CreateGraph(); in TEST_F() local
228 HGraph* graph = CreateGraph(); in TEST_F() local
H A Dcodegen_test.cc81 HGraph* graph = CreateCFG(data); in TestCode() local
415 HGraph* graph = CreateGraph(); in TEST_F() local
477 HGraph* graph = CreateGraph(); in TEST_F() local
608 HGraph* graph = CreateGraph(); in TestComparison() local
722 HGraph* graph = CreateGraph(); in TEST_F() local
746 HGraph* graph = CreateGraph(); in TEST_F() local
796 HGraph* graph = CreateGraph(); in TEST_F() local
832 HGraph* graph = CreateGraph(); in TEST_F() local
847 HGraph* graph = CreateGraph(); in TEST_F() local
866 HGraph* graph = CreateGraph(); in TEST_F() local
[all …]
H A Dlinear_order.h40 void LinearizeGraph(const HGraph* graph, Vector* linear_order) { in LinearizeGraph()
H A Dlinear_order.cc58 static bool IsLinearOrderWellFormed(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in IsLinearOrderWellFormed()
86 void LinearizeGraphInternal(const HGraph* graph, ArrayRef<HBasicBlock*> linear_order) { in LinearizeGraphInternal()
H A Dpretty_printer.h28 explicit HPrettyPrinter(HGraph* graph) : HGraphVisitor(graph) { } in HPrettyPrinter()
108 explicit StringPrettyPrinter(HGraph* graph) in StringPrettyPrinter()
H A Dconstant_folding.h42 HConstantFolding(HGraph* graph, const char* name) : HOptimization(graph, name) {} in HConstantFolding()
H A Dcritical_native_abi_fixup_arm.h28 CriticalNativeAbiFixupArm(HGraph* graph, OptimizingCompilerStats* stats) in CriticalNativeAbiFixupArm()
H A Dinstruction_simplifier_arm.h28 InstructionSimplifierArm(HGraph* graph, OptimizingCompilerStats* stats) in InstructionSimplifierArm()
/aosp12/frameworks/compile/mclinker/unittests/
H A DGraphTest.cpp37 ListDigraph graph; in TEST_F() local
84 ListDigraph graph; in TEST_F() local
131 ListDigraph graph; in TEST_F() local
178 ListDigraph graph; in TEST_F() local
198 ListDigraph graph; in TEST_F() local
218 ListDigraph graph; in TEST_F() local
244 ListDigraph graph; in TEST_F() local
270 ListDigraph graph; in TEST_F() local
296 ListDigraph graph; in TEST_F() local
314 Digraph graph; in TEST_F() local
/aosp12/packages/services/Car/cpp/computepipe/tests/runner/graph/
H A DLocalPrebuiltGraphTest.cpp37 namespace graph { namespace
56 PrebuiltGraph* graph = GetLocalGraphFromLibrary("libstubgraphimpl.so", engineInterface); in TEST() local
68 PrebuiltGraph* graph = GetLocalGraphFromLibrary("libstubgraphimpl.so", engineInterface); in TEST() local
114 PrebuiltGraph* graph = GetLocalGraphFromLibrary("libstubgraphimpl.so", engineInterface); in TEST() local
/aosp12/packages/services/Telecomm/tests/src/com/android/server/telecom/tests/
H A DIncomingCallFilterGraphTest.java117 IncomingCallFilterGraph graph = new IncomingCallFilterGraph(mCall, listener, mContext, in testEmptyGraph() local
130 IncomingCallFilterGraph graph = new IncomingCallFilterGraph(mCall, listener, mContext, in testFiltersPerformOrder() local
148 IncomingCallFilterGraph graph = new IncomingCallFilterGraph(mCall, listener, mContext, in testFiltersPerformInParallel() local
167 IncomingCallFilterGraph graph = new IncomingCallFilterGraph(mCall, listener, mContext, in testFiltersTimeout() local
/aosp12/system/memory/libmemunreachable/
H A DTarjan.h84 void TarjanAlgorithm<T>::Execute(Graph<T>& graph, SCCList<T>& out) { in Execute()
102 void TarjanAlgorithm<T>::Tarjan(Node<T>* vertex, Graph<T>& graph) { in Tarjan()
131 void Tarjan(Graph<T>& graph, SCCList<T>& out) { in Tarjan()
/aosp12/frameworks/base/media/mca/filterfw/java/android/filterfw/
H A DGraphEnvironment.java60 public GraphHandle(FilterGraph graph) { in GraphHandle()
137 FilterGraph graph = null; in loadGraph() local
155 public int addGraph(FilterGraph graph) { in addGraph()
/aosp12/frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/
H A DGraphRunner.java197 public void enterSubGraph(FilterGraph graph, SubListener listener) { in enterSubGraph()
289 private void onPrepare(FilterGraph graph) { in onPrepare()
297 private void onOpenGraph(FilterGraph graph) { in onOpenGraph()
386 private void onTearDown(FilterGraph graph) { in onTearDown()
393 private void loadFilters(FilterGraph graph) { in loadFilters()
404 private void closeFilters(FilterGraph graph) { in closeFilters()
668 public synchronized void start(FilterGraph graph) { in start()
681 public void enterSubGraph(FilterGraph graph, SubListener listener) { in enterSubGraph()
918 void attachGraph(FilterGraph graph) { in attachGraph()
947 void tearDownGraph(FilterGraph graph) { in tearDownGraph()

123456