)]}'
{
  "commit": "10b09ad28e3269964b6de52db444a1feccaaec7b",
  "tree": "14e8a5c4519879cf1b6cfd6ae7272a2125b2839d",
  "parents": [
    "22edd87755ae3284fe1c1a990f3237658a15f5a1"
  ],
  "author": {
    "name": "Brian Smith",
    "email": "brian@briansmith.org",
    "time": "Tue Aug 02 16:18:00 2016 -1000"
  },
  "committer": {
    "name": "CQ bot account: commit-bot@chromium.org",
    "email": "commit-bot@chromium.org",
    "time": "Fri Aug 05 21:29:09 2016 +0000"
  },
  "message": "Factor out common logic in bn_mod_inverse_*.\n\nThis is in preparation for factoring out the binary Euclidean\nimplementation (the one used for odd numbers that aren\u0027t too big) for\ndirect use from outside of crypto/bn/gcd.c. The goal is to make the\nresultant |BN_mod_inverse_odd|\u0027s signature similar to\n|BN_mod_inverse_blinded|. Thus, the logic for reducing the final result\nisn\u0027t factored out because that yet-to-be-created |BN_mod_inverse_odd|\nwill need to do it itself.\n\nChange-Id: Iaecb79fb17d13c774c4fb6ade8742937780b0006\nReviewed-on: https://boringssl-review.googlesource.com/9100\nReviewed-by: David Benjamin \u003cdavidben@google.com\u003e\nCommit-Queue: David Benjamin \u003cdavidben@google.com\u003e\nCQ-Verified: CQ bot account: commit-bot@chromium.org \u003ccommit-bot@chromium.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "0cc18d91ff6674772e03acb735acdaca0fa1cd97",
      "old_mode": 33188,
      "old_path": "crypto/bn/gcd.c",
      "new_id": "7224ef7d48af6144439792b50c9f054cfbb78743",
      "new_mode": 33188,
      "new_path": "crypto/bn/gcd.c"
    }
  ]
}