)]}'
{
  "commit": "a72dafafbd5f11c6ea3a9682d64da1074f28eb67",
  "tree": "ae346ff4d6db900c334a2a7512165d13880b4954",
  "parents": [
    "d405c7407a5468d4fc11724d76063e0647d80106"
  ],
  "author": {
    "name": "Jiong Wang",
    "email": "jiong.wang@netronome.com",
    "time": "Sat Jan 26 12:26:00 2019 -0500"
  },
  "committer": {
    "name": "Alexei Starovoitov",
    "email": "ast@kernel.org",
    "time": "Sat Jan 26 13:33:01 2019 -0800"
  },
  "message": "bpf: refactor verifier min/max code for condition jump\n\nThe current min/max code does both signed and unsigned comparisons against\nthe input argument \"val\" which is \"u64\" and there is explicit type casting\nwhen the comparison is signed.\n\nAs we will need slightly more complexer type casting when JMP32 introduced,\nit is better to host the signed type casting. This makes the code more\nclean with ignorable runtime overhead.\n\nAlso, code for J*GE/GT/LT/LE and JEQ/JNE are very similar, this patch\ncombine them.\n\nThe main purpose for this refactor is to make sure the min/max code will\nstill be readable and with minimum code duplication after JMP32 introduced.\n\nReviewed-by: Jakub Kicinski \u003cjakub.kicinski@netronome.com\u003e\nSigned-off-by: Jiong Wang \u003cjiong.wang@netronome.com\u003e\nSigned-off-by: Alexei Starovoitov \u003cast@kernel.org\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "8cfe39ef770f4c5447f62f6d691bfbd3eb6a3feb",
      "old_mode": 33188,
      "old_path": "kernel/bpf/verifier.c",
      "new_id": "eae6cb1fe6536ab047a31c13f7b13b02424d99c0",
      "new_mode": 33188,
      "new_path": "kernel/bpf/verifier.c"
    }
  ]
}