)]}'
{
  "commit": "6de3a0bd2655952d8e08db4d03a6c7b4a3d7fde3",
  "tree": "606de83e7bb76d4c4d9086b43a7850716b9f3ad3",
  "parents": [
    "f091fecf6c6a9ae39632aa1923330a178a63d112"
  ],
  "author": {
    "name": "Thomas Lively",
    "email": "tlively@google.com",
    "time": "Fri Oct 09 23:16:47 2026"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Fri Oct 09 23:16:47 2026"
  },
  "message": "Flatten WeakTopologicalOrdering into a single entry vector (#9220)\n\nReplace the recursive std::variant/Cycle representation of\nWeakTopologicalOrdering with a single contiguous std::vector\u003cEntry\u003e\nwhere cycle ends store the header block and jump target index. This\navoids per-cycle vector allocations and recursive evaluation in\nWTOWorklist::run.\n\nBenchmark results across 16 WebAssembly modules (3 iterations,\ninterleaved):\n- --constraint-analysis:\n  - Geomean: 1.606s -\u003e 1.592s (-0.9%)\n  - Total time: 64.05s -\u003e 63.67s (-0.6%; faster on 11/16 modules)\n- --rse:\n  - Geomean: 0.871s -\u003e 0.852s (-2.2%)\n  - Total time: 26.03s -\u003e 25.39s (-2.5%; faster on 12/16 modules)",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "742ca6f88b0b35ce3de777e6fe1aea5debac823f",
      "old_mode": 33188,
      "old_path": "src/cfg/wto.h",
      "new_id": "339b837a36af569940ecda6bb123fb0ff0988099",
      "new_mode": 33188,
      "new_path": "src/cfg/wto.h"
    },
    {
      "type": "modify",
      "old_id": "d08e65dfb6e020b785bba9d989e8483b8d59ccb1",
      "old_mode": 33188,
      "old_path": "test/gtest/wto.cpp",
      "new_id": "79e1f63acd986740c3a29630109c83d9483229a9",
      "new_mode": 33188,
      "new_path": "test/gtest/wto.cpp"
    }
  ]
}