)]}'
{
  "commit": "cf3a9c4842b1e097dbe0854933c471d43dd24f69",
  "tree": "5b2737cade79c491ba46cd642c01cc165118d723",
  "parents": [
    "cfed0a85dad921c683e9c0d25b072bcc5745ede0"
  ],
  "author": {
    "name": "Paul E. McKenney",
    "email": "paul.mckenney@linaro.org",
    "time": "Tue May 29 14:56:46 2012 -0700"
  },
  "committer": {
    "name": "Paul E. McKenney",
    "email": "paulmck@linux.vnet.ibm.com",
    "time": "Mon Jul 02 12:33:23 2012 -0700"
  },
  "message": "rcu: Increase rcu_barrier() concurrency\n\nThe traditional rcu_barrier() implementation has serialized all requests,\nregardless of RCU flavor, and also does not coalesce concurrent requests.\nIn the past, this has been good and sufficient.\n\nHowever, systems are getting larger and use of rcu_barrier() has been\nincreasing.  This commit therefore introduces a counter-based scheme\nthat allows _rcu_barrier() calls for the same flavor of RCU to take\nadvantage of each others\u0027 work.\n\nSigned-off-by: Paul E. McKenney \u003cpaul.mckenney@linaro.org\u003e\nSigned-off-by: Paul E. McKenney \u003cpaulmck@linux.vnet.ibm.com\u003e\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "44a8fda9be86da3c2630353d30a368f00c43f754",
      "old_mode": 33188,
      "old_path": "kernel/rcutree.c",
      "new_id": "6bb5d562253f415154e6f052afa148ee99c36373",
      "new_mode": 33188,
      "new_path": "kernel/rcutree.c"
    },
    {
      "type": "modify",
      "old_id": "7641aec3e59c3ba1f8f595ae6d2d05b0f11d6636",
      "old_mode": 33188,
      "old_path": "kernel/rcutree.h",
      "new_id": "be10286ad3809e559f37575778058a7124768ca8",
      "new_mode": 33188,
      "new_path": "kernel/rcutree.h"
    }
  ]
}