)]}'
{
  "commit": "b703b29f5e0de8cf18064348d40f5a5ae83fa9ec",
  "tree": "360492d9eb4545b52c6d2fd5313811bbd4404d44",
  "parents": [
    "7b5105001aca6b257316f50efef6f4256b08148a"
  ],
  "author": {
    "name": "Kees Cook",
    "email": "keescook@chromium.org",
    "time": "Wed Jan 17 16:40:03 2024 -0800"
  },
  "committer": {
    "name": "Kees Cook",
    "email": "keescook@chromium.org",
    "time": "Mon Jan 22 15:47:04 2024 -0800"
  },
  "message": "udf: Refactor intentional wrap-around test\n\nIn an effort to separate intentional arithmetic wrap-around from\nunexpected wrap-around, we need to refactor places that depend on this\nkind of math. One of the most common code patterns of this is:\n\n\tVAR + value \u003c VAR\n\nNotably, this is considered \"undefined behavior\" for signed and pointer\ntypes, which the kernel works around by using the -fno-strict-overflow\noption in the build[1] (which used to just be -fwrapv). Regardless, we\nwant to get the kernel source to the position where we can meaningfully\ninstrument arithmetic wrap-around conditions and catch them when they\nare unexpected, regardless of whether they are signed[2], unsigned[3],\nor pointer[4] types.\n\nRefactor open-coded wrap-around addition test to use add_would_overflow().\nThis paves the way to enabling the wrap-around sanitizers in the future.\n\nLink: https://git.kernel.org/linus/68df3755e383e6fecf2354a67b08f92f18536594 [1]\nLink: https://github.com/KSPP/linux/issues/26 [2]\nLink: https://github.com/KSPP/linux/issues/27 [3]\nLink: https://github.com/KSPP/linux/issues/344 [4]\nCc: Jan Kara \u003cjack@suse.com\u003e\nSigned-off-by: Kees Cook \u003ckeescook@chromium.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "ab3ffc355949dcd52bc377ec27e13335484ba16e",
      "old_mode": 33188,
      "old_path": "fs/udf/balloc.c",
      "new_id": "5c88300c3de7a89f50f032cb6ab07c94a74200f5",
      "new_mode": 33188,
      "new_path": "fs/udf/balloc.c"
    }
  ]
}