)]}'
{
  "commit": "385d936fb287cfe3a491ced2d77d52d71b7705a8",
  "tree": "4d5c1137911a0412ca0b7adb602156d5072efeef",
  "parents": [
    "79112707bb27bfe28aeb57ac427af244d6d20b96"
  ],
  "author": {
    "name": "Giovanni Bajo",
    "email": "rasky@develer.com",
    "time": "Tue Mar 13 00:21:57 2018 +0100"
  },
  "committer": {
    "name": "Giovanni Bajo",
    "email": "rasky@develer.com",
    "time": "Sat Mar 24 03:06:01 2018 +0000"
  },
  "message": "cmd/compile: in prove, fail fast when unsat is found\n\nWhen an unsatisfiable relation is recorded in the facts table,\nthere is no need to compute further relations or updates\nadditional data structures.\n\nSince we\u0027re about to transitively propagate relations, make\nsure to fail as fast as possible to avoid doing useless work\nin dead branches.\n\nPasses toolstash -cmp.\n\nChange-Id: I23eed376d62776824c33088163c7ac9620abce85\nReviewed-on: https://go-review.googlesource.com/100275\nReviewed-by: Austin Clements \u003caustin@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "d90f0cad33cadccc537ce907074abe77094b5e6a",
      "old_mode": 33188,
      "old_path": "src/cmd/compile/internal/ssa/prove.go",
      "new_id": "ec31d46d0294f2fdf8635cc2041a67d14f325cb8",
      "new_mode": 33188,
      "new_path": "src/cmd/compile/internal/ssa/prove.go"
    }
  ]
}