)]}'
{
  "commit": "cd0893369ca85fd11bc517081b2d9079d2ef2f90",
  "tree": "e2f46e4b4270c7403a895339df93d9bbefb7c363",
  "parents": [
    "d84e0bd7971eb8357c700151ee4e8e4101ee65fa"
  ],
  "author": {
    "name": "David S. Miller",
    "email": "davem@davemloft.net",
    "time": "Mon Jul 11 01:28:12 2011 -0700"
  },
  "committer": {
    "name": "David S. Miller",
    "email": "davem@davemloft.net",
    "time": "Mon Jul 11 01:28:12 2011 -0700"
  },
  "message": "neigh: Store hash shift instead of mask.\n\nAnd mask the hash function result by simply shifting\ndown the \"-\u003ehash_shift\" most significant bits.\n\nCurrently which bits we use is arbitrary since jhash\nproduces entropy evenly across the whole hash function\nresult.\n\nBut soon we\u0027ll be using universal hashing functions,\nand in those cases more entropy exists in the higher\nbits than the lower bits, because they use multiplies.\n\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "4014b623880cf529e3bb5b184a5b31dee650a8b5",
      "old_mode": 33188,
      "old_path": "include/net/neighbour.h",
      "new_id": "6fe8c2cd5acb4602f36d4312d8c7a68af505f98d",
      "new_mode": 33188,
      "new_path": "include/net/neighbour.h"
    },
    {
      "type": "modify",
      "old_id": "ceb505b1507c0a07d2a5a2c2907dc96d3ebf9732",
      "old_mode": 33188,
      "old_path": "net/core/neighbour.c",
      "new_id": "4d5fc9433fd917e6b201e4d01c3162087420a16b",
      "new_mode": 33188,
      "new_path": "net/core/neighbour.c"
    }
  ]
}