)]}'
{
  "commit": "e8ced39d5e8911c662d4d69a342b9d053eaaac4e",
  "tree": "cd4d643bfbd37c67ff9bd2feff2c0b477a56f117",
  "parents": [
    "64769240bd07f446f83660bb143bb609d8ab4910"
  ],
  "author": {
    "name": "Mingming Cao",
    "email": "cmm@us.ibm.com",
    "time": "Fri Jul 11 19:27:31 2008 -0400"
  },
  "committer": {
    "name": "Theodore Ts\u0027o",
    "email": "tytso@mit.edu",
    "time": "Fri Jul 11 19:27:31 2008 -0400"
  },
  "message": "percpu_counter: new function percpu_counter_sum_and_set\n\nDelayed allocation need to check free blocks at every write time.\npercpu_counter_read_positive() is not quit accurate. delayed\nallocation need a more accurate accounting, but using\npercpu_counter_sum_positive() is frequently is quite expensive.\n\nThis patch added a new function to update center counter when sum\nper-cpu counter, to increase the accurate rate for next\npercpu_counter_read() and require less calling expensive\npercpu_counter_sum().\n\nSigned-off-by: Mingming Cao \u003ccmm@us.ibm.com\u003e\nSigned-off-by: \"Theodore Ts\u0027o\" \u003ctytso@mit.edu\u003e\n\n",
  "tree_diff": [
    {
      "type": "modify",
      "old_id": "25f63d8c1b3da0890901c11182839df1f453f848",
      "old_mode": 33188,
      "old_path": "fs/ext4/balloc.c",
      "new_id": "6369bacf0dcb8594bb2e7bd469696b2b56d511e7",
      "new_mode": 33188,
      "new_path": "fs/ext4/balloc.c"
    },
    {
      "type": "modify",
      "old_id": "9007ccdfc1127cfe73db03e31dd82a843f8f4fa8",
      "old_mode": 33188,
      "old_path": "include/linux/percpu_counter.h",
      "new_id": "20838883535704c89cf72bafe29a28d12dea45e3",
      "new_mode": 33188,
      "new_path": "include/linux/percpu_counter.h"
    },
    {
      "type": "modify",
      "old_id": "119174494cb5c096eaf5b1da239dbd5a4040ebc0",
      "old_mode": 33188,
      "old_path": "lib/percpu_counter.c",
      "new_id": "4a8ba4bf5f6f2b1c0de7d16f794d6d39cbb00d31",
      "new_mode": 33188,
      "new_path": "lib/percpu_counter.c"
    }
  ]
}