)]}'
{
  "commit": "529955e03dda72b66bf83e89a57565b03e55e14b",
  "tree": "76dc80ac30248f260209c018363e7c6c3f4e1371",
  "parents": [
    "8eb85098342a998d1b835bfd591fba2f19a6dcb9"
  ],
  "author": {
    "name": "Steven Perron",
    "email": "stevenperron@google.com",
    "time": "Fri Sep 02 12:27:10 2022 -0400"
  },
  "committer": {
    "name": "GitHub",
    "email": "noreply@github.com",
    "time": "Fri Sep 02 16:27:10 2022 +0000"
  },
  "message": "Improve time to build dominators (#4916)\n\nChanged a couple small parts of the algorithm to reduce time to build\r\nthe dominator trees.  There should be no visible changes.\r\n\r\nAdd a depth first search algorithm that does not run a function on\r\nbackedges.  The check if an edge is a back edge is time consuming, and\r\npointless if the function run on it is a nop.\r\n\r\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "f55a7bde677bb19fd1e2e537d9a509a72b07982f",
      "old_mode": 33188,
      "old_path": "source/cfa.h",
      "new_id": "2743ab40ce51889eaf11bc966dc672b9f56a70b2",
      "new_mode": 33188,
      "new_path": "source/cfa.h"
    },
    {
      "type": "modify",
      "old_id": "66b1aeda8b52e475aac4ec0c9677522b084d0ddd",
      "old_mode": 33188,
      "old_path": "source/opt/cfg.cpp",
      "new_id": "a0248d54c483748ca84076d2b261f1bd76b0edae",
      "new_mode": 33188,
      "new_path": "source/opt/cfg.cpp"
    },
    {
      "type": "modify",
      "old_id": "d6017bb1975ba0c7639e7c68976c7b0f00b239c3",
      "old_mode": 33188,
      "old_path": "source/opt/dominator_tree.cpp",
      "new_id": "2680be2af49de461ef81910c011af3f68324ab1b",
      "new_mode": 33188,
      "new_path": "source/opt/dominator_tree.cpp"
    },
    {
      "type": "modify",
      "old_id": "6c341cb8d25949e5d33a2e07e4849f6e3e693480",
      "old_mode": 33188,
      "old_path": "source/val/validate_cfg.cpp",
      "new_id": "87975e1efade9a435718318cc20794358a658c23",
      "new_mode": 33188,
      "new_path": "source/val/validate_cfg.cpp"
    }
  ]
}