)]}'
{
  "commit": "3f2a6963fb1f3cd31cb797e8f04e335a08e75ca9",
  "tree": "c66fda7cb35eadaa1eb69240f06bad2a840bf575",
  "parents": [
    "d34f769deb34ab5dbda0a03f17c15d7c6f18f88e"
  ],
  "author": {
    "name": "Stephen Adams",
    "email": "sra@google.com",
    "time": "Fri May 30 18:05:54 2025 -0700"
  },
  "committer": {
    "name": "Commit Queue",
    "email": "dart-scoped@luci-project-accounts.iam.gserviceaccount.com",
    "time": "Fri May 30 18:05:54 2025 -0700"
  },
  "message": "[dart2js] Improve algorithm for condition targets\n\n1. Use a work queue to avoid recursion on deep trees.\n\n2. Use a visited set to avoid cycles and repeated work on conditions like `b \u0026\u0026 b`.\n\nBug: #60801\nChange-Id: If20de27b1ddd157feee2391289ec781c03f741ae\nReviewed-on: https://dart-review.googlesource.com/c/sdk/+/431704\nReviewed-by: Mayank Patke \u003cfishythefish@google.com\u003e\nCommit-Queue: Stephen Adams \u003csra@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "7eebfbf8e5f63d1f824278aa46ffad5c702e3ad8",
      "old_mode": 33188,
      "old_path": "pkg/compiler/lib/src/ssa/optimize.dart",
      "new_id": "792d797c1e5ec4e6428f3aa7b231adbecf483ec6",
      "new_mode": 33188,
      "new_path": "pkg/compiler/lib/src/ssa/optimize.dart"
    },
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "bbf30a6a51c1ae06a7766e684d3b371bc11e39a8",
      "new_mode": 33188,
      "new_path": "pkg/compiler/test/codegen/data/promotion2.dart"
    }
  ]
}