)]}'
{
  "commit": "5f1a8c1bc724498ff32acbd59ed5263275676b9d",
  "tree": "0aa917ae98ebf20ec865930b75d0b16841b0b28f",
  "parents": [
    "83f619f3c8abb82cac9158cf23c656ec5c184607"
  ],
  "author": {
    "name": "Steffen Klassert",
    "email": "steffen.klassert@secunet.com",
    "time": "Wed Jul 07 15:32:39 2010 +0200"
  },
  "committer": {
    "name": "Herbert Xu",
    "email": "herbert@gondor.apana.org.au",
    "time": "Wed Jul 14 20:29:30 2010 +0800"
  },
  "message": "padata: simplify serialization mechanism\n\nWe count the number of processed objects on a percpu basis,\nso we need to go through all the percpu reorder queues to calculate\nthe sequence number of the next object that needs serialization.\nThis patch changes this to count the number of processed objects\nglobal. So we can calculate the sequence number and the percpu\nreorder queue of the next object that needs serialization without\nsearching through the percpu reorder queues. This avoids some\naccesses to memory of foreign cpus.\n\nSigned-off-by: Steffen Klassert \u003csteffen.klassert@secunet.com\u003e\nSigned-off-by: Herbert Xu \u003cherbert@gondor.apana.org.au\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "e4c17f9b7c9e2b03e76e8712c5d4566974ea2e3f",
      "old_mode": 33188,
      "old_path": "include/linux/padata.h",
      "new_id": "8844b851191e618a95343a94129effb9ded2ef8f",
      "new_mode": 33188,
      "new_path": "include/linux/padata.h"
    },
    {
      "type": "modify",
      "old_id": "ae8defcf062263d197d40c863a0f3d535a8418f1",
      "old_mode": 33188,
      "old_path": "kernel/padata.c",
      "new_id": "450d67d394b0fca3f99c3a9af233c46cde74f82e",
      "new_mode": 33188,
      "new_path": "kernel/padata.c"
    }
  ]
}