)]}'
{
  "commit": "dfd857530e0bda541d4112c5c19bda0567b521ef",
  "tree": "a632dfbe8bca9e824abe358f099dcd3e68e6662c",
  "parents": [
    "53a96b6b6d35ab730b6f227370b8858b241fcc38"
  ],
  "author": {
    "name": "Richard Biener",
    "email": "rguenther@suse.de",
    "time": "Fri Aug 21 09:36:27 2026 +0200"
  },
  "committer": {
    "name": "Richard Biener",
    "email": "rguenther@suse.de",
    "time": "Fri Aug 21 11:39:47 2026 +0200"
  },
  "message": "tree-optimization/126965 - limit recursive PRE expression generation\n\nAs I\u0027ve recently figured the PRE value graph can have cycles so\nwhen recursively generating a complex expression that should be\nprone to run into those cycles as well.  PR126965 now has a testcase\nfor that, so limit recursinve expression generation.\n\n\tPR tree-optimization/126965\n\t* tree-ssa-pre.cc (find_or_generate_expression): Limit\n\trecursion depth.\n\n\t* gcc.dg/tree-ssa/ssa-pre-37.c: New testcase.\n",
  "tree_diff": [
    {
      "type": "add",
      "old_id": "0000000000000000000000000000000000000000",
      "old_mode": 0,
      "old_path": "/dev/null",
      "new_id": "408f09a0e7d435e4c2422cc81234de32fb970d55",
      "new_mode": 33188,
      "new_path": "gcc/testsuite/gcc.dg/tree-ssa/ssa-pre-37.c"
    },
    {
      "type": "modify",
      "old_id": "3f001fe47630e077abe275dc9d86f0ea5f7485b5",
      "old_mode": 33188,
      "old_path": "gcc/tree-ssa-pre.cc",
      "new_id": "9353f19d4053990e417164499c6571c06802b43e",
      "new_mode": 33188,
      "new_path": "gcc/tree-ssa-pre.cc"
    }
  ]
}