)]}'
{
  "commit": "fc07a90f173538484d0ed68c47f96e1ab297ceb7",
  "tree": "90076164c60065f19634adafd5467dfc742eb487",
  "parents": [
    "bd3282a1cf1025c7869a8664c2d54266a4dded44"
  ],
  "author": {
    "name": "Li Bingzhuo",
    "email": "lbz2770828522@gmail.com",
    "time": "Sun Oct 04 21:15:24 2026 +0800"
  },
  "committer": {
    "name": "Li Bingzhuo",
    "email": "lbz2770828522@gmail.com",
    "time": "Sun Oct 04 21:15:28 2026 +0800"
  },
  "message": "rxe: Prevent overflow in wr_set_inline_data_list() bound check\n\nwr_set_inline_data_list() accumulates the length of the caller\u0027s buffers\nand compares the running total against the send queue\u0027s inline limit:\n\n    while (num_buf--) {\n        length \u003d buf_list-\u003elength;\n\n        if (tot_length + length \u003e qp-\u003esq.max_inline) {\n            qp-\u003eerr \u003d ENOSPC;\n            return;\n        }\n\n        memcpy(data, buf_list-\u003eaddr, length);\n\n        tot_length +\u003d length;\n\nBoth operands are size_t and both are caller controlled, so the addition in\nthe comparison can wrap.  A first buffer that leaves tot_length non-zero\nfollowed by a second buffer of length SIZE_MAX makes the sum zero, which\nsatisfies the comparison, and memcpy() is then asked to copy that length\ninto the inline area of the work queue element.  The single buffer variant\nwr_set_inline_data() compares the length against max_inline directly and\ndoes not have this problem.\n\nCompare the length against the remaining budget, which cannot wrap because\ntot_length never exceeds max_inline.\n\nFixes: 1a894ca10105 (\"Providers/rxe: Implement ibv_create_qp_ex verb\")\nSigned-off-by: Li Bingzhuo \u003clbz2770828522@gmail.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "62615e65ef3601f88b518773daf4bdc37e480e24",
      "old_mode": 33188,
      "old_path": "providers/rxe/rxe.c",
      "new_id": "615e1a2e8f54a3156738099336f343db3411f9ed",
      "new_mode": 33188,
      "new_path": "providers/rxe/rxe.c"
    }
  ]
}
