)]}'
{
  "commit": "9f3003fe7223765ea9ba285a1edecb15f6b5cb65",
  "tree": "f2b406b1a4a8c355300221a272364313520a9313",
  "parents": [
    "a8072f31bc90000b3b8a2c0c7819710cf924727a"
  ],
  "author": {
    "name": "Richard Biener",
    "email": "rguenther@suse.de",
    "time": "Fri Jul 03 13:18:43 2026 +0200"
  },
  "committer": {
    "name": "Richard Biener",
    "email": "rguenther@suse.de",
    "time": "Fri Jul 03 14:36:52 2026 +0200"
  },
  "message": "Make BB SLP costing more verbose\n\nThe following also dumps the costs for parts of the SLP graph that\nare associated with another loop when there\u0027s one that was not\nprofitable.  It also prints markers to where scalar/vector parts\nstart for easier debugging.\n\n\t* tree-vect-slp.cc (vect_bb_vectorization_profitable_p): Make\n\tprofitabilty decision easier to debug.\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "2250f6f74a1ae63b0b9e42559955c0ab77ff3135",
      "old_mode": 33188,
      "old_path": "gcc/tree-vect-slp.cc",
      "new_id": "6081948fed4f80a876fa85ef2c22e103c3a8dbd7",
      "new_mode": 33188,
      "new_path": "gcc/tree-vect-slp.cc"
    }
  ]
}