)]}'
{
  "commit": "9088c5609584684149f3fb5b065aa7f18dcb03ff",
  "tree": "270a8d4d853825b7ff169b4153816372fca00ea1",
  "parents": [
    "53e915034970935596703a6005cde27c2128b5c3"
  ],
  "author": {
    "name": "Eric Dumazet",
    "email": "dada1@cosmosbay.com",
    "time": "Wed Oct 08 11:44:17 2008 -0700"
  },
  "committer": {
    "name": "David S. Miller",
    "email": "davem@davemloft.net",
    "time": "Wed Oct 08 11:44:17 2008 -0700"
  },
  "message": "udp: Improve port randomization\n\nCurrent UDP port allocation is suboptimal.\nWe select the shortest chain to chose a port (out of 512)\nthat will hash in this shortest chain.\n\nFirst, it can lead to give not so ramdom ports and ease\ngive attackers more opportunities to break the system.\n\nSecond, it can consume a lot of CPU to scan all table\nin order to find the shortest chain.\n\nThird, in some pathological cases we can fail to find\na free port even if they are plenty of them.\n\nThis patch zap the search for a short chain and only\nuse one random seed. Problem of getting long chains\nshould be addressed in another way, since we can\nobtain long chains with non random ports.\n\nBased on a report and patch from Vitaly Mayatskikh\n\nSigned-off-by: Eric Dumazet \u003cdada1@cosmosbay.com\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "85f8e8e10b1bdf054c5e65966095b09cd0a75c3e",
      "old_mode": 33188,
      "old_path": "net/ipv4/udp.c",
      "new_id": "67d8430b4a2a0097ea0e13a5a52ce9348a36f76e",
      "new_mode": 33188,
      "new_path": "net/ipv4/udp.c"
    }
  ]
}