)]}'
{
  "commit": "f034b5d4efdfe0fb9e2a1ce1d95fa7914f24de49",
  "tree": "e166f1e87606f7e53a78cac543284c3484481727",
  "parents": [
    "8f126e37c0b250310a48a609bedf92a19a5559ec"
  ],
  "author": {
    "name": "David S. Miller",
    "email": "davem@sunset.davemloft.net",
    "time": "Thu Aug 24 03:08:07 2006 -0700"
  },
  "committer": {
    "name": "David S. Miller",
    "email": "davem@sunset.davemloft.net",
    "time": "Fri Sep 22 15:08:41 2006 -0700"
  },
  "message": "[XFRM]: Dynamic xfrm_state hash table sizing.\n\nThe grow algorithm is simple, we grow if:\n\n1) we see a hash chain collision at insert, and\n2) we haven\u0027t hit the hash size limit (currently 1*1024*1024 slots), and\n3) the number of xfrm_state objects is \u003e the current hash mask\n\nAll of this needs some tweaking.\n\nRemove __initdata from \"hashdist\" so we can use it safely at run time.\n\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "1021f508d82cee1e2577582e100ce9f9abe259b4",
      "old_mode": 33188,
      "old_path": "include/linux/bootmem.h",
      "new_id": "e319c649e4fdc3fd27ce22213c66e69cece28bff",
      "new_mode": 33188,
      "new_path": "include/linux/bootmem.h"
    },
    {
      "type": "modify",
      "old_id": "54a4f5375bbaeaaa9af8faef441e4a758b89d12e",
      "old_mode": 33188,
      "old_path": "mm/page_alloc.c",
      "new_id": "3b5358a0561fa99366fbb9c7d2f858c40208b0fb",
      "new_mode": 33188,
      "new_path": "mm/page_alloc.c"
    },
    {
      "type": "modify",
      "old_id": "fe3c8c38d5e1292a69989d13ee03304513d2af3a",
      "old_mode": 33188,
      "old_path": "net/xfrm/xfrm_state.c",
      "new_id": "445263c54c94e4405305dcf3ff327b2ff85604d0",
      "new_mode": 33188,
      "new_path": "net/xfrm/xfrm_state.c"
    }
  ]
}