)]}'
{
  "commit": "e27fc9641e8ddc8146f8e01f06e5eba2469698de",
  "tree": "5cff4c23cb113b901718d9c0f4a6e3081f3173bd",
  "parents": [
    "46fdb0937f26124700fc9fc80da4776330cc00d3"
  ],
  "author": {
    "name": "Tejun Heo",
    "email": "tj@kernel.org",
    "time": "Mon Nov 22 21:36:11 2010 -0800"
  },
  "committer": {
    "name": "Paul E. McKenney",
    "email": "paulmck@linux.vnet.ibm.com",
    "time": "Fri Dec 17 12:34:08 2010 -0800"
  },
  "message": "rcu: increase synchronize_sched_expedited() batching\n\nThe fix in commit #6a0cc49 requires more than three concurrent instances\nof synchronize_sched_expedited() before batching is possible.  This\npatch uses a ticket-counter-like approach that is also not unrelated to\nLai Jiangshan\u0027s Ring RCU to allow sharing of expedited grace periods even\nwhen there are only two concurrent instances of synchronize_sched_expedited().\n\nThis commit builds on Tejun\u0027s original posting, which may be found at\nhttp://lkml.org/lkml/2010/11/9/204, adding memory barriers, avoiding\noverflow of signed integers (other than via atomic_t), and fixing the\ndetection of batching.\n\nSigned-off-by: Tejun Heo \u003ctj@kernel.org\u003e\nSigned-off-by: Paul E. McKenney \u003cpaulmck@linux.vnet.ibm.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "49e8e16308e15dd36dbd8f1481e68af8e58ee87d",
      "old_mode": 33188,
      "old_path": "include/linux/rcupdate.h",
      "new_id": "af5614856285d32e0f07d3ca7e7294b03b9b27b7",
      "new_mode": 33188,
      "new_path": "include/linux/rcupdate.h"
    },
    {
      "type": "modify",
      "old_id": "c22c4ef2a0d0a7b44f23e8e9f681ff0a1f3c3005",
      "old_mode": 33188,
      "old_path": "kernel/rcutree_plugin.h",
      "new_id": "a3638710dc67f4627f5cdb88e1cafb43b500d24a",
      "new_mode": 33188,
      "new_path": "kernel/rcutree_plugin.h"
    }
  ]
}
