#3057. Add more try-catch-finally tests

TypeSystem/flow-analysis/reachability_try_catch_A03_t01.dart

@@ -0,0 +1,62 @@
+// Copyright (c) 2025, the Dart project authors.  Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+/// @assertion try catch: If `N` is a try/catch statement of the form
+/// `try B alternatives` then:
+/// - Let `before(B) = before(N)`
+/// - For each catch block on `Ti Si` in alternatives:
+///   - Let
+///     `before(Si) = conservativeJoin(before(N), assignedIn(B), capturedIn(B))`
+/// - Let `after(N) = join(after(B), after(C0), ..., after(Ck))`
+///
+/// @description Checks that if a type `T` is made a type of interest in
+/// `before(N)` then it can be promoted in `B`, `alternatives` and `after(N)`.
+/// @author [email protected]
+
+class S {}
+
+class T extends S {
+  int answer() => 42;
+}
+
+class C {
+  T v;
+  C(this.v);
+}
+
+test1() {
+  S s = S();
+  if (s is T) {}  // make `T` a type of interest
+  try {
+    s = T();
+    s.answer();
+  } catch (_) {
+  }
+}
+
+test2() {
+  S s = S();
+  if (s is T) {}
+  try {
+  } catch (_) {
+    (s,) = (T(),);
+    s.answer();
+  }
+}
+
+test3() {
+  S s = S();
+  if (s is T) {}
+  try {
+  } catch (_) {
+  }
+  C(v: s) = C(T());
+  s.answer();
+}
+
+main() {
+  print(test1);
+  print(test2);
+  print(test3);
+}

TypeSystem/flow-analysis/reachability_try_catch_A03_t02.dart

@@ -0,0 +1,63 @@
+// Copyright (c) 2025, the Dart project authors.  Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+/// @assertion try catch: If `N` is a try/catch statement of the form
+/// `try B alternatives` then:
+/// - Let `before(B) = before(N)`
+/// - For each catch block on `Ti Si` in alternatives:
+///   - Let
+///     `before(Si) = conservativeJoin(before(N), assignedIn(B), capturedIn(B))`
+/// - Let `after(N) = join(after(B), after(C0), ..., after(Ck))`
+///
+/// @description Checks that if a type `T` is made a type of interest in `B`
+/// then it can be promoted in `B`, `alternatives` and `after(N)`.
+/// @author [email protected]
+/// @issue 60519
+
+class S {}
+
+class T extends S {
+  int answer() => 42;
+}
+
+class C {
+  T v;
+  C(this.v);
+}
+
+test1() {
+  S s = S();
+  try {
+    if (s is T) {}  // make `T` a type of interest
+    s = T();
+    s.answer();
+  } catch (_) {
+  }
+}
+
+test2() {
+  S s = S();
+  try {
+    if (s is T) {}
+  } catch (_) {
+    (s,) = (T(),);
+    s.answer();
+  }
+}
+
+test3() {
+  S s = S();
+  try {
+    if (s is T) {}
+  } catch (_) {
+  }
+  C(v: s) = C(T());
+  s.answer();
+}
+
+main() {
+  print(test1);
+  print(test2);
+  print(test3);
+}

TypeSystem/flow-analysis/reachability_try_catch_A03_t03.dart

@@ -0,0 +1,63 @@
+// Copyright (c) 2025, the Dart project authors.  Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+/// @assertion try catch: If `N` is a try/catch statement of the form
+/// `try B alternatives` then:
+/// - Let `before(B) = before(N)`
+/// - For each catch block on `Ti Si` in alternatives:
+///   - Let
+///     `before(Si) = conservativeJoin(before(N), assignedIn(B), capturedIn(B))`
+/// - Let `after(N) = join(after(B), after(C0), ..., after(Ck))`
+///
+/// @description Checks that if a type `T` is made a type of interest in
+/// `alternatives` then it can be promoted in `alternatives` and `after(N)`.
+/// @author [email protected]
+/// @issue 60519
+
+class S {}
+
+class T extends S {
+  int answer() => 42;
+}
+
+class C {
+  T v;
+  C(this.v);
+}
+
+test1() {
+  S s = S();
+  try {} catch (_) {
+    if (s is T) {} // make `T` a type of interest
+    s = T();
+    s.answer();
+  }
+}
+
+test2() {
+  S s = S();
+  try {
+  } on Exception catch (_) {
+    if (s is T) {}
+  } catch (_) {
+    (s,) = (T(),);
+    s.answer();
+  }
+}
+
+test3() {
+  S s = S();
+  try {
+  } on Exception catch (_) {
+    if (s is T) {}
+  }
+  C(v: s) = C(T());
+  s.answer();
+}
+
+main() {
+  print(test1);
+  print(test2);
+  print(test3);
+}

TypeSystem/flow-analysis/reachability_try_catch_A03_t04.dart

@@ -0,0 +1,54 @@
+// Copyright (c) 2025, the Dart project authors.  Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+/// @assertion try catch: If `N` is a try/catch statement of the form
+/// `try B alternatives` then:
+/// - Let `before(B) = before(N)`
+/// - For each catch block on `Ti Si` in alternatives:
+///   - Let
+///     `before(Si) = conservativeJoin(before(N), assignedIn(B), capturedIn(B))`
+/// - Let `after(N) = join(after(B), after(C0), ..., after(Ck))`
+///
+/// @description Checks that if a type `T` is made a type of interest in
+/// `alternatives` then it cannot be promoted in `B`.
+/// @author [email protected]
+
+class S {}
+
+class T extends S {
+  int answer() => 42;
+}
+
+test1() {
+  S s = S();
+  try {
+    s = T();
+    s.answer();
+//    ^^^^^^
+// [analyzer] unspecified
+// [cfe] unspecified
+  } catch (_) {
+    if (s is T) {} // make `T` a type of interest
+  }
+}
+
+test2() {
+  S s = S();
+  try {
+  } on Exception catch (_) {
+    s = T();
+    s.answer();
+//    ^^^^^^
+// [analyzer] unspecified
+// [cfe] unspecified
+  } catch (_) {
+    if (s is T) {}
+  }
+}
+
+
+main() {
+  print(test1);
+  print(test2);
+}

TypeSystem/flow-analysis/reachability_try_finally_A04_t01.dart

@@ -0,0 +1,75 @@
+// Copyright (c) 2025, the Dart project authors.  Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+/// @assertion try finally: If `N` is a try/finally statement of the form
+/// `try B1 finally B2` then:
+/// - Let `before(B1) = split(before(N))`
+/// - Let `before(B2) = split(join(drop(after(B1)),
+///     conservativeJoin(before(N), assignedIn(B1), capturedIn(B1))))`
+/// - Let `after(N) = restrict(after(B1), after(B2), assignedIn(B2))`
+///
+/// @description Checks that if a type `T` is made a type of interest in
+/// `before(N)` then it can be promoted in `B1`, `B2` and `after(N)`.
+/// @author [email protected]
+
+class S {}
+
+class T extends S {
+  int answer() => 42;
+}
+
+class C {
+  T v;
+  C(this.v);
+}
+
+test1() {
+  S s = S();
+  if (s is T) {}  // make `T` a type of interest
+  try {
+    s = T();
+    s.answer();
+  } finally {
+  }
+}
+
+test2() {
+  S s = S();
+  if (s is T) {}
+  try {
+  } catch (_) {
+    (s,) = (T(),);
+    s.answer();
+  } finally {
+  }
+}
+
+test3() {
+  S s = S();
+  if (s is T) {}
+  try {
+  } catch (_) {
+  } finally {
+    (x: s) = (x: T());
+    s.answer();
+  }
+}
+
+test4() {
+  S s = S();
+  if (s is T) {}
+  try {
+  } catch (_) {
+  } finally {
+  }
+  C(v: s) = C(T());
+  s.answer();
+}
+
+main() {
+  print(test1);
+  print(test2);
+  print(test3);
+  print(test4);
+}

TypeSystem/flow-analysis/reachability_try_finally_A04_t02.dart

@@ -0,0 +1,76 @@
+// Copyright (c) 2025, the Dart project authors.  Please see the AUTHORS file
+// for details. All rights reserved. Use of this source code is governed by a
+// BSD-style license that can be found in the LICENSE file.
+
+/// @assertion try finally: If `N` is a try/finally statement of the form
+/// `try B1 finally B2` then:
+/// - Let `before(B1) = split(before(N))`
+/// - Let `before(B2) = split(join(drop(after(B1)),
+///     conservativeJoin(before(N), assignedIn(B1), capturedIn(B1))))`
+/// - Let `after(N) = restrict(after(B1), after(B2), assignedIn(B2))`
+///
+/// @description Checks that if a type `T` is made a type of interest in `B1`
+/// then it can be promoted in `B1`, `B2` and `after(N)`.
+/// @author [email protected]
+/// @issue 60519
+
+class S {}
+
+class T extends S {
+  int answer() => 42;
+}
+
+class C {
+  T v;
+  C(this.v);
+}
+
+test1() {
+  S s = S();
+  try {
+    if (s is T) {}  // make `T` a type of interest
+    s = T();
+    s.answer();
+  } finally {
+  }
+}
+
+test2() {
+  S s = S();
+  try {
+    if (s is T) {}
+  } catch (_) {
+    (s,) = (T(),);
+    s.answer();
+  } finally {
+  }
+}
+
+test3() {
+  S s = S();
+  try {
+    if (s is T) {}
+  } catch (_) {
+  } finally {
+    (x: s) = (x: T());
+    s.answer();
+  }
+}
+
+test4() {
+  S s = S();
+  try {
+    if (s is T) {}
+  } catch (_) {
+  } finally {
+  }
+  C(v: s) = C(T());
+  s.answer();
+}
+
+main() {
+  print(test1);
+  print(test2);
+  print(test3);
+  print(test4);
+}