)]}'
{
  "commit": "e2f82ac3fcffffca59751b65124544d11ed8be4a",
  "tree": "9eba528eb094b79da8c471c3980c6a6b90f371b4",
  "parents": [
    "22c2d8bca212a655c120fd6617328ffa3480afad"
  ],
  "author": {
    "name": "Eric Dumazet",
    "email": "dada1@cosmosbay.com",
    "time": "Mon Dec 17 22:45:13 2007 -0800"
  },
  "committer": {
    "name": "David S. Miller",
    "email": "davem@davemloft.net",
    "time": "Mon Jan 28 14:59:10 2008 -0800"
  },
  "message": "[NETFILTER]: xt_hashlimit: speedup hash_dst()\n\n1) Using jhash2() instead of jhash() is a litle bit faster if applicable.\n\n2) Thanks to jhash, hash value uses full 32 bits.\n   Instead of returning hash % size (implying a divide)\n   we return the high 32 bits of the (hash * size) that will\n   give results between [0 and size-1] and same hash distribution.\n\n  On most cpus, a multiply is less expensive than a divide, by an order\n  of magnitude.\n\nSigned-off-by: Eric Dumazet \u003cdada1@cosmosbay.com\u003e\nSigned-off-by: Patrick McHardy \u003ckaber@trash.net\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "951d4c829674e323308f6ba848d3da3dbe95a328",
      "old_mode": 33188,
      "old_path": "net/netfilter/xt_hashlimit.c",
      "new_id": "651c1d26564a76b5dbf801ad03fcf1312d088c85",
      "new_mode": 33188,
      "new_path": "net/netfilter/xt_hashlimit.c"
    }
  ]
}