)]}'
{
  "log": [
    {
      "commit": "a42dde04152750426cc620fd277e80fffae2f65a",
      "tree": "98cdf246280c59e0bf044ae6d2c229fc27b73203",
      "parents": [
        "189d3c4a94ef19fca2a71a6a336e9fda900e25e7"
      ],
      "author": {
        "name": "Peter Zijlstra",
        "email": "a.p.zijlstra@chello.nl",
        "time": "Wed Apr 30 00:54:36 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Wed Apr 30 08:29:50 2008 -0700"
      },
      "message": "mm: bdi: allow setting a maximum for the bdi dirty limit\n\nAdd \"max_ratio\" to /sys/class/bdi.  This indicates the maximum percentage of\nthe global dirty threshold allocated to this bdi.\n\n[mszeredi@suse.cz]\n\n - fix parsing in max_ratio_store().\n - export bdi_set_max_ratio() to modules\n - limit bdi_dirty with bdi-\u003emax_ratio\n - document new sysfs attribute\n\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nSigned-off-by: Miklos Szeredi \u003cmszeredi@suse.cz\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "f16b34aa13e8c55085f346bcf07afb2312c56c0a",
      "tree": "4fba40d99a5907694a1a1de8023f1431204f4f98",
      "parents": [
        "cc295d0e95063809af31971e4aec1d809247f13b"
      ],
      "author": {
        "name": "Peter Zijlstra",
        "email": "a.p.zijlstra@chello.nl",
        "time": "Sat Dec 22 14:03:29 2007 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@woody.linux-foundation.org",
        "time": "Sun Dec 23 12:54:37 2007 -0800"
      },
      "message": "lib: proportion: fix underflow in prop_norm_percpu()\n\nZhe Jiang noticed that its possible to underflow pl-\u003eevents in\nprop_norm_percpu() when the value returned by percpu_counter_read() is less\nthan the error on that read and the period delay \u003e 1.  In that case half might\nnot trigger the batch increment and the value will be identical on the next\niteration, causing the same half to be subtracted again and again.\n\nFix this by rewriting the division as a single subtraction instead of a\nsubtraction loop and using percpu_counter_sum() when the value returned by\npercpu_counter_read() is smaller than the error.\n\nThe latter is still needed if we want pl-\u003eevents to shrink properly in the\nerror region.\n\n[akpm@linux-foundation.org: cleanups]\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nReviewed-by: Jiang Zhe \u003czhe.jiang@intel.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "145ca25eb2fbd20d4faf1bad4628c7650332058f",
      "tree": "ee5bebd5b7b1f0ced5e30c8f29f1ff5301aa9d0a",
      "parents": [
        "69cb51d18c1ed593009d9a620cac49d0dcf15dc8"
      ],
      "author": {
        "name": "Peter Zijlstra",
        "email": "a.p.zijlstra@chello.nl",
        "time": "Tue Oct 16 23:25:49 2007 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@woody.linux-foundation.org",
        "time": "Wed Oct 17 08:42:45 2007 -0700"
      },
      "message": "lib: floating proportions\n\nGiven a set of objects, floating proportions aims to efficiently give the\nproportional \u0027activity\u0027 of a single item as compared to the whole set. Where\n\u0027activity\u0027 is a measure of a temporal property of the items.\n\nIt is efficient in that it need not inspect any other items of the set\nin order to provide the answer. It is not even needed to know how many\nother items there are.\n\nIt has one parameter, and that is the period of \u0027time\u0027 over which the\n\u0027activity\u0027 is measured.\n\nSigned-off-by: Peter Zijlstra \u003ca.p.zijlstra@chello.nl\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    }
  ]
}