)]}'
{
  "commit": "1b421be241ea9bd4926137c92197627a5994d801",
  "tree": "3fd97c2b6b327eaa749d7de120a3669463d6cb8d",
  "parents": [
    "5615db6c7ba79cf664a74a1401edb9400636cbb1"
  ],
  "author": {
    "name": "David Benjamin",
    "email": "davidben@google.com",
    "time": "Sat Aug 10 11:52:23 2024 -0400"
  },
  "committer": {
    "name": "Boringssl LUCI CQ",
    "email": "boringssl-scoped@luci-project-accounts.iam.gserviceaccount.com",
    "time": "Wed Aug 14 20:04:10 2024 +0000"
  },
  "message": "Reverse the loop variable in BN_div and assert pointer invariants\n\nAlthough Knuth iterates the index forwards, it makes more sense for us\nto do it backwards because he numbers words big-endian and we use\nlittle-endian. Ultimately each loop iteration i is about computing\nres-\u003ed[i] in the quotient.\n\nOnce we do that, we can assert some pointer invariants. Subsequent CLs\nwill remove some of the pointers. The compiler can figure it out and\nthey make it harder to even confirm we stay within bounds.\n\nBug: 358687140\nChange-Id: I159489fafb8b071725c0e49a6fea66d6006f5a78\nReviewed-on: https://boringssl-review.googlesource.com/c/boringssl/+/70174\nCommit-Queue: David Benjamin \u003cdavidben@google.com\u003e\nReviewed-by: Bob Beck \u003cbbe@google.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "3c9c4f53fd66c43650bddec19526c2ab585d6b5f",
      "old_mode": 33188,
      "old_path": "crypto/fipsmodule/bn/div.c",
      "new_id": "097c5ebcee1038b72853dcb1c1c4cc944f776233",
      "new_mode": 33188,
      "new_path": "crypto/fipsmodule/bn/div.c"
    }
  ]
}