Home
last modified time | relevance | path

Searched refs:edge (Results 1 – 17 of 17) sorted by relevance

/art/test/482-checker-loop-back-edge-use/
DAndroid.bp3 // Build rules for ART run-test `482-checker-loop-back-edge-use`.
16 name: "art-run-test-482-checker-loop-back-edge-use",
21 ":art-run-test-482-checker-loop-back-edge-use-expected-stdout",
22 ":art-run-test-482-checker-loop-back-edge-use-expected-stderr",
31 name: "art-run-test-482-checker-loop-back-edge-use-expected-stdout",
32 out: ["art-run-test-482-checker-loop-back-edge-use-expected-stdout.txt"],
39 name: "art-run-test-482-checker-loop-back-edge-use-expected-stderr",
40 out: ["art-run-test-482-checker-loop-back-edge-use-expected-stderr.txt"],
/art/test/547-regression-trycatch-critic-edge/smali/
DTestCase.smali18 # The following test case would crash liveness analysis because the back edge of
21 # edge between TryBoundary and outer loop header (b/25493695).
39 if-eqz v3, :outer_loop # back edge of outer loop
44 goto :inner_loop # back edge of inner loop
52 goto :inner_loop # back edge of inner loop
/art/test/537-checker-arraycopy/
Dinfo.txt1 Test for edge cases of System.arraycopy.
/art/test/182-method-linking/
Dinfo.txt1 Test some edge cases for method linking.
/art/test/084-class-init/
Dinfo.txt1 Test class initialization edge cases and race conditions.
/art/test/547-regression-trycatch-critic-edge/
Dinfo.txt1 Test a specific SSA building regression a back edge would not be split due to
/art/compiler/optimizing/
Dsuperblock_cloner.h70 inline bool IsEdgeValid(HEdge edge, HGraph* graph) { in IsEdgeValid() argument
71 if (!edge.IsValid()) { in IsEdgeValid()
74 uint32_t from = edge.GetFrom(); in IsEdgeValid()
75 uint32_t to = edge.GetTo(); in IsEdgeValid()
Dsuperblock_cloner.cc746 for (HEdge edge : *remap_orig_internal_) { in CheckRemappingInfoIsValid()
747 if (!IsEdgeValid(edge, graph_) || in CheckRemappingInfoIsValid()
748 !IsInOrigBBSet(edge.GetFrom()) || in CheckRemappingInfoIsValid()
749 !IsInOrigBBSet(edge.GetTo())) { in CheckRemappingInfoIsValid()
754 for (auto edge : *remap_copy_internal_) { in CheckRemappingInfoIsValid()
755 if (!IsEdgeValid(edge, graph_) || in CheckRemappingInfoIsValid()
756 !IsInOrigBBSet(edge.GetFrom()) || in CheckRemappingInfoIsValid()
757 !IsInOrigBBSet(edge.GetTo())) { in CheckRemappingInfoIsValid()
762 for (auto edge : *remap_incoming_) { in CheckRemappingInfoIsValid()
763 if (!IsEdgeValid(edge, graph_) || in CheckRemappingInfoIsValid()
[all …]
/art/test/800-smali/smali/
Db_29778499_2.smali5 # This is testing an edge case (not implementing any interface) for b/18116999.
/art/test/596-checker-dead-phi/smali/
DIrreducibleLoop.smali66 # Add a marker on the outer loop back edge. Here we use p1 because p0 is a
69 # Set a wide register, to have v1 undefined at the back edge.
/art/test/594-checker-irreducible-linorder/smali/
DIrreducibleLoop.smali99 # This constant has a use in a phi in :back_edge2 and a back edge use in
100 # :back_edge1. Because the linear order is wrong, the back edge use has
/art/test/509-pre-header/smali/
DPreHeader.smali21 # edge and not preserving the invariant that the pre header of a loop
/art/runtime/verifier/
Dreg_type_test.cc1024 for (const Edge& edge : edges) { in TEST_F() local
1025 if (&edge.from == cur) { in TEST_F()
1026 work_list.push(&edge.to); in TEST_F()
/art/test/510-checker-try-catch/smali/
DBuilder.smali310 # Test that only one TryBoundary is inserted when an edge connects two different
1309 # the try block so as to not split the ReturnVoid-Exit edge.
1323 # try block so as to not split the Return-Exit edge.
/art/test/559-checker-irreducible-loop/smali/
DIrreducibleLoop.smali500 # back edge, and not the body.
/art/
DTEST_MAPPING743 "name": "art-run-test-482-checker-loop-back-edge-use"
2171 "name": "art-run-test-482-checker-loop-back-edge-use[com.google.android.art.apex]"
3617 "name": "art-run-test-482-checker-loop-back-edge-use"
5053 "name": "art-run-test-482-checker-loop-back-edge-use"
/art/tools/fuzzer/
DAndroid.bp720 "host_482-checker-loop-back-edge-use_classes.dex",