)]}'
{
  "log": [
    {
      "commit": "66f1991bc2357436498ac990302b6f5bf403d7ef",
      "tree": "1b98628c3863b23f81f9475d7c29f096206512c6",
      "parents": [
        "1fa7e5473cba543b02a396ced9e407f614bb117c"
      ],
      "author": {
        "name": "Andy Shevchenko",
        "email": "andy.shevchenko@gmail.com",
        "time": "Tue Oct 26 14:23:03 2010 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Tue Oct 26 16:52:18 2010 -0700"
      },
      "message": "lib/bitmap.c: use hex_to_bin()\n\nSigned-off-by: Andy Shevchenko \u003candy.shevchenko@gmail.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "35926ff5fba8245bd1c6ac04155048f6f89232b1",
      "tree": "9afc520f47e29cb3cd80462fe62858f17b1c6cfb",
      "parents": [
        "b612a0553714c6b9744ad0d03f10cac78f3a84b1"
      ],
      "author": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Sun May 30 09:00:03 2010 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Sun May 30 09:00:03 2010 -0700"
      },
      "message": "Revert \"cpusets: randomize node rotor used in cpuset_mem_spread_node()\"\n\nThis reverts commit 0ac0c0d0f837c499afd02a802f9cf52d3027fa3b, which\ncaused cross-architecture build problems for all the wrong reasons.\nIA64 already added its own version of __node_random(), but the fact is,\nthere is nothing architectural about the function, and the original\ncommit was just badly done. Revert it, since no fix is forthcoming.\n\nRequested-by: Stephen Rothwell \u003csfr@canb.auug.org.au\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "0ac0c0d0f837c499afd02a802f9cf52d3027fa3b",
      "tree": "c20a7306d4b727722556af1aa5565855686aee07",
      "parents": [
        "6adef3ebe570bcde67fd6c16101451ddde5712b5"
      ],
      "author": {
        "name": "Jack Steiner",
        "email": "steiner@sgi.com",
        "time": "Wed May 26 14:42:51 2010 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Thu May 27 09:12:44 2010 -0700"
      },
      "message": "cpusets: randomize node rotor used in cpuset_mem_spread_node()\n\nSome workloads that create a large number of small files tend to assign\ntoo many pages to node 0 (multi-node systems).  Part of the reason is that\nthe rotor (in cpuset_mem_spread_node()) used to assign nodes starts at\nnode 0 for newly created tasks.\n\nThis patch changes the rotor to be initialized to a random node number of\nthe cpuset.\n\n[akpm@linux-foundation.org: fix layout]\n[Lee.Schermerhorn@hp.com: Define stub numa_random() for !NUMA configuration]\nSigned-off-by: Jack Steiner \u003csteiner@sgi.com\u003e\nSigned-off-by: Lee Schermerhorn \u003clee.schermerhorn@hp.com\u003e\nCc: Christoph Lameter \u003ccl@linux-foundation.org\u003e\nCc: Pekka Enberg \u003cpenberg@cs.helsinki.fi\u003e\nCc: Paul Menage \u003cmenage@google.com\u003e\nCc: Jack Steiner \u003csteiner@sgi.com\u003e\nCc: Robin Holt \u003cholt@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "08564fb7ab9ead9226b6154439c3fecd17972eb0",
      "tree": "a6bb96ffbe702d22d29bca871c42993cf552e9fa",
      "parents": [
        "9a86e2bad0b9fbf3290ae496da6dab9536dd6bf7"
      ],
      "author": {
        "name": "Akinobu Mita",
        "email": "akinobu.mita@gmail.com",
        "time": "Fri Mar 05 13:43:18 2010 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Sat Mar 06 11:26:35 2010 -0800"
      },
      "message": "bitmap: use for_each_set_bit()\n\nReplace open-coded loop with for_each_set_bit().\n\nSigned-off-by: Akinobu Mita \u003cakinobu.mita@gmail.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "9a86e2bad0b9fbf3290ae496da6dab9536dd6bf7",
      "tree": "639ad635462be0578fcb4988aa0d59a0bc6cd818",
      "parents": [
        "a069c266ae5fdfbf5b4aecf2c672413aa33b2504"
      ],
      "author": {
        "name": "Ben Hutchings",
        "email": "ben@decadent.org.uk",
        "time": "Fri Mar 05 13:43:17 2010 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Sat Mar 06 11:26:35 2010 -0800"
      },
      "message": "lib: fix first line of kernel-doc for a few functions\n\nThe function name must be followed by a space, hypen, space, and a short\ndescription.\n\nSigned-off-by: Ben Hutchings \u003cben@decadent.org.uk\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "c1a2a962a2ad103846e7950b4591471fabecece7",
      "tree": "9a06ab8d1c65037456bad02c821033197f67f03f",
      "parents": [
        "868d64812ae84e8f094e0bcf95157c7d79d625ec"
      ],
      "author": {
        "name": "Akinobu Mita",
        "email": "akinobu.mita@gmail.com",
        "time": "Tue Dec 15 16:48:25 2009 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Wed Dec 16 07:20:18 2009 -0800"
      },
      "message": "bitmap: introduce bitmap_set, bitmap_clear, bitmap_find_next_zero_area\n\nThis introduces new bitmap functions:\n\nbitmap_set: Set specified bit area\nbitmap_clear: Clear specified bit area\nbitmap_find_next_zero_area: Find free bit area\n\nThese are mostly stolen from iommu helper. The differences are:\n\n- Use find_next_bit instead of doing test_bit for each bit\n\n- Rewrite bitmap_set and bitmap_clear\n\n  Instead of setting or clearing for each bit.\n\n- Check the last bit of the limit\n\n  iommu-helper doesn\u0027t want to find such area\n\n- The return value if there is no zero area\n\n  find_next_zero_area in iommu helper: returns -1\n  bitmap_find_next_zero_area: return \u003e\u003d bitmap size\n\nSigned-off-by: Akinobu Mita \u003cakinobu.mita@gmail.com\u003e\nCc: FUJITA Tomonori \u003cfujita.tomonori@lab.ntt.co.jp\u003e\nCc: \"David S. Miller\" \u003cdavem@davemloft.net\u003e\nCc: Benjamin Herrenschmidt \u003cbenh@kernel.crashing.org\u003e\nCc: Paul Mackerras \u003cpaulus@samba.org\u003e\nCc: Thomas Gleixner \u003ctglx@linutronix.de\u003e\nCc: Ingo Molnar \u003cmingo@redhat.com\u003e\nCc: \"H. Peter Anvin\" \u003chpa@zytor.com\u003e\nCc: Greg Kroah-Hartman \u003cgregkh@suse.de\u003e\nCc: Lothar Wassmann \u003cLW@KARO-electronics.de\u003e\nCc: Roland Dreier \u003crolandd@cisco.com\u003e\nCc: Yevgeny Petrilin \u003cyevgenyp@mellanox.co.il\u003e\nCc: Tony Luck \u003ctony.luck@intel.com\u003e\nCc: Fenghua Yu \u003cfenghua.yu@intel.com\u003e\nCc: Joerg Roedel \u003cjoerg.roedel@amd.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "f4b0373b26567cafd421d91101852ed7a34e9e94",
      "tree": "35607b1c1d28429bb275ca3472cd0065fbde2f14",
      "parents": [
        "83d349f35e1ae72268c5104dbf9ab2ae635425d4"
      ],
      "author": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Fri Aug 21 09:26:15 2009 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Fri Aug 21 09:26:15 2009 -0700"
      },
      "message": "Make bitmask \u0027and\u0027 operators return a result code\n\nWhen \u0027and\u0027ing two bitmasks (where \u0027andnot\u0027 is a variation on it), some\ncases want to know whether the result is the empty set or not.  In\nparticular, the TLB IPI sending code wants to do cpumask operations and\ndetermine if there are any CPU\u0027s left in the final set.\n\nSo this just makes the bitmask (and cpumask) functions return a boolean\nfor whether the result has any bits set.\n\nCc: stable@kernel.org (2.6.30, needed by TLB shootdown fix)\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "aa8e4fc68d8024cd3132035d13c3cefa7baeac8f",
      "tree": "ace4457c20730a5a557f91599ba30274a89c46a8",
      "parents": [
        "9ead64974b05501bbac0d63a47c99fa786d064ba"
      ],
      "author": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Thu Mar 12 19:32:51 2009 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Thu Mar 12 19:32:51 2009 -0700"
      },
      "message": "bitmap: fix end condition in bitmap_find_free_region\n\nGuennadi Liakhovetski noticed that the end condition for the loop in\nbitmap_find_free_region() is wrong, and the \"return if error\" was also\nusing the wrong conditional that would only trigger if the bitmap was an\nexact multiple of the allocation size, which is not necessarily the case\nwith dma_alloc_from_coherent().\n\nSuch a failure would end up in bitmap_find_free_region() accessing\nbeyond the end of the bitmap.\n\nReported-by: Guennadi Liakhovetski \u003clg@denx.de\u003e\nCc: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "9779a8325a9bbf4ccd3853e0e4064984cf9da9c9",
      "tree": "7814d54c7554210ee03d0dbecc546cc2e8a876ec",
      "parents": [
        "309e1e4240636f3a9704d77a164a08e1f5a81fea",
        "61e0e79ee3c609eb34edf2fe023708cba6a79b1f"
      ],
      "author": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Thu Oct 23 08:20:34 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Thu Oct 23 08:20:34 2008 -0700"
      },
      "message": "Merge branch \u0027for-upstream\u0027 of git://git.kernel.org/pub/scm/linux/kernel/git/dvrabel/uwb\n\n* \u0027for-upstream\u0027 of git://git.kernel.org/pub/scm/linux/kernel/git/dvrabel/uwb: (47 commits)\n  uwb: wrong sizeof argument in mac address compare\n  uwb: don\u0027t use printk_ratelimit() so often\n  uwb: use kcalloc where appropriate\n  uwb: use time_after() when purging stale beacons\n  uwb: add credits for the original developers of the UWB/WUSB/WLP subsystems\n  uwb: add entries in the MAINTAINERS file\n  uwb: depend on EXPERIMENTAL\n  wusb: wusb-cbaf (CBA driver) sysfs ABI simplification\n  uwb: document UWB and WUSB sysfs files\n  uwb: add symlinks in sysfs between radio controllers and PALs\n  uwb: dont tranmit identification IEs\n  uwb: i1480/GUWA100U: fix firmware download issues\n  uwb: i1480: remove MAC/PHY information checking function\n  uwb: add Intel i1480 HWA to the UWB RC quirk table\n  uwb: disable command/event filtering for D-Link DUB-1210\n  uwb: initialize the debug sub-system\n  uwb: Fix handling IEs with empty IE data in uwb_est_get_size()\n  wusb: fix bmRequestType for Abort RPipe request\n  wusb: fix error path for wusb_set_dev_addr()\n  wusb: add HWA host controller driver\n  ...\n"
    },
    {
      "commit": "c4596435404976b0ded9cdf18b456ca2e1408ddd",
      "tree": "ec8dce51ec28d3f94f39c7af9ec6685ceeb7e76b",
      "parents": [
        "30e8e13603c247c301fdacabef2a765c84840994"
      ],
      "author": {
        "name": "Lai Jiangshan",
        "email": "laijs@cn.fujitsu.com",
        "time": "Sat Oct 18 20:28:21 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Mon Oct 20 08:52:39 2008 -0700"
      },
      "message": "bitmask: remove bitmap_scnprintf_len()\n\nbitmap_scnprintf_len() is not used now, so we remove it.\n\nOtherwise we have to maintain it and make its return\nvalue always equal to bitmap_scnprintf()\u0027s return value.\n\nSigned-off-by: Lai Jiangshan \u003claijs@cn.fujitsu.com\u003e\nCc: Alexey Dobriyan \u003cadobriyan@gmail.com\u003e\nCc: Paul Menage \u003cmenage@google.com\u003e\nCc: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "ccbe329bcd87924baed96474ec0a6725e3957897",
      "tree": "7d1f2737916d85aae76e54ab0fefff816fdf4316",
      "parents": [
        "45e9c0de2e86485f8b6633fd64ab19cfbff167f6"
      ],
      "author": {
        "name": "David Vrabel",
        "email": "david.vrabel@csr.com",
        "time": "Wed Sep 17 16:34:03 2008 +0100"
      },
      "committer": {
        "name": "David Vrabel",
        "email": "dv02@dv02pc01.europe.root.pri",
        "time": "Wed Sep 17 16:54:22 2008 +0100"
      },
      "message": "bitmap: add bitmap_copy_le()\n\nbitmap_copy_le() copies a bitmap, putting the bits into little-endian\norder (i.e., each unsigned long word in the bitmap is put into\nlittle-endian order).\n\nThe UWB stack used bitmaps to manage Medium Access Slot availability,\nand these bitmaps need to be written to the hardware in LE order.\n\nSigned-off-by: David Vrabel \u003cdavid.vrabel@csr.com\u003e\n"
    },
    {
      "commit": "50ac2d694f2dd1658341cf97bcf2ffb836d772cb",
      "tree": "c4466ecb7c5211ee9423380783f00027411d5d5a",
      "parents": [
        "dd763460eb628b57814251a15a39f8d75c044d76"
      ],
      "author": {
        "name": "Alexey Dobriyan",
        "email": "adobriyan@gmail.com",
        "time": "Tue Aug 12 15:09:02 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Tue Aug 12 16:07:30 2008 -0700"
      },
      "message": "seq_file: add seq_cpumask(), seq_nodemask()\n\nShort enough reads from /proc/irq/*/smp_affinity return -EINVAL for no\ngood reason.\n\nThis became noticed with NR_CPUS\u003d4096 patches, when length of printed\nrepresentation of cpumask becase 1152, but cat(1) continued to read with\n1024-byte chunks.  bitmap_scnprintf() in good faith fills buffer, returns\n1023, check returns -EINVAL.\n\nFix it by switching to seq_file, so handler will just fill buffer and\ndoesn\u0027t care about offsets, length, filling EOF and all this crap.\n\nFor that add seq_bitmap(), and wrappers around it -- seq_cpumask() and\nseq_nodemask().\n\nSigned-off-by: Alexey Dobriyan \u003cadobriyan@gmail.com\u003e\nReviewed-by: Paul Jackson \u003cpj@sgi.com\u003e\nCc: Mike Travis \u003ctravis@sgi.com\u003e\nCc: Al Viro \u003cviro@zeniv.linux.org.uk\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "f4ed0deae8983591264d0e194e168ef65f4775f5",
      "tree": "6d25ff09060a69530b1ba0711d20e978edfda92e",
      "parents": [
        "53c78dd1718b99dc365ff8a2244d7d4504b070a5"
      ],
      "author": {
        "name": "Paul Jackson",
        "email": "pj@sgi.com",
        "time": "Mon May 12 14:02:29 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Tue May 13 08:02:25 2008 -0700"
      },
      "message": "cpumask: remove bitmap_scnprintf_len and cpumask_scnprintf_len\n\nThey aren\u0027t used.  They were briefly used as part of some other patches to\nprovide an alternative format for displaying some /proc and /sys cpumasks.\nThey probably should have been removed when those other patches were dropped,\nin favor of a different solution.\n\nSigned-off-by: Paul Jackson \u003cpj@sgi.com\u003e\nCc: \"Mike Travis\" \u003ctravis@sgi.com\u003e\nCc: \"Bert Wesarg\" \u003cbert.wesarg@googlemail.com\u003e\nCc: Alexey Dobriyan \u003cadobriyan@gmail.com\u003e\nCc: WANG Cong \u003cxiyou.wangcong@gmail.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "7ea931c9fc80c4d0a4306c30ec92eb0f1d922a0b",
      "tree": "4f2c85d658c75e8679e01943e3e95866b3729b54",
      "parents": [
        "f5b087b52f1710eb0bf15a2d2b030c51a6a1ca9e"
      ],
      "author": {
        "name": "Paul Jackson",
        "email": "pj@sgi.com",
        "time": "Mon Apr 28 02:12:29 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Mon Apr 28 08:58:19 2008 -0700"
      },
      "message": "mempolicy: add bitmap_onto() and bitmap_fold() operations\n\nThe following adds two more bitmap operators, bitmap_onto() and bitmap_fold(),\nwith the usual cpumask and nodemask wrappers.\n\nThe bitmap_onto() operator computes one bitmap relative to another.  If the\nn-th bit in the origin mask is set, then the m-th bit of the destination mask\nwill be set, where m is the position of the n-th set bit in the relative mask.\n\nThe bitmap_fold() operator folds a bitmap into a second that has bit m set iff\nthe input bitmap has some bit n set, where m \u003d\u003d n mod sz, for the specified sz\nvalue.\n\nThere are two substantive changes between this patch and its\npredecessor bitmap_relative:\n 1) Renamed bitmap_relative() to be bitmap_onto().\n 2) Added bitmap_fold().\n\nThe essential motivation for bitmap_onto() is to provide a mechanism for\nconverting a cpuset-relative CPU or Node mask to an absolute mask.  Cpuset\nrelative masks are written as if the current task were in a cpuset whose CPUs\nor Nodes were just the consecutive ones numbered 0..N-1, for some N.  The\nbitmap_onto() operator is provided in anticipation of adding support for the\nfirst such cpuset relative mask, by the mbind() and set_mempolicy() system\ncalls, using a planned flag of MPOL_F_RELATIVE_NODES.  These bitmap operators\n(and their nodemask wrappers, in particular) will be used in code that\nconverts the user specified cpuset relative memory policy to a specific system\nnode numbered policy, given the current mems_allowed of the tasks cpuset.\n\nSuch cpuset relative mempolicies will address two deficiencies\nof the existing interface between cpusets and mempolicies:\n 1) A task cannot at present reliably establish a cpuset\n    relative mempolicy because there is an essential race\n    condition, in that the tasks cpuset may be changed in\n    between the time the task can query its cpuset placement,\n    and the time the task can issue the applicable mbind or\n    set_memplicy system call.\n 2) A task cannot at present establish what cpuset relative\n    mempolicy it would like to have, if it is in a smaller\n    cpuset than it might have mempolicy preferences for,\n    because the existing interface only allows specifying\n    mempolicies for nodes currently allowed by the cpuset.\n\nCpuset relative mempolicies are useful for tasks that don\u0027t distinguish\nparticularly between one CPU or Node and another, but only between how many of\neach are allowed, and the proper placement of threads and memory pages on the\nvarious CPUs and Nodes available.\n\nThe motivation for the added bitmap_fold() can be seen in the following\nexample.\n\nLet\u0027s say an application has specified some mempolicies that presume 16 memory\nnodes, including say a mempolicy that specified MPOL_F_RELATIVE_NODES (cpuset\nrelative) nodes 12-15.  Then lets say that application is crammed into a\ncpuset that only has 8 memory nodes, 0-7.  If one just uses bitmap_onto(),\nthis mempolicy, mapped to that cpuset, would ignore the requested relative\nnodes above 7, leaving it empty of nodes.  That\u0027s not good; better to fold the\nhigher nodes down, so that some nodes are included in the resulting mapped\nmempolicy.  In this case, the mempolicy nodes 12-15 are taken modulo 8 (the\nweight of the mems_allowed of the confining cpuset), resulting in a mempolicy\nspecifying nodes 4-7.\n\nSigned-off-by: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: David Rientjes \u003crientjes@google.com\u003e\nCc: Christoph Lameter \u003cclameter@sgi.com\u003e\nCc: Andi Kleen \u003cak@suse.de\u003e\nCc: Mel Gorman \u003cmel@csn.ul.ie\u003e\nCc: Lee Schermerhorn \u003clee.schermerhorn@hp.com\u003e\nCc: \u003ckosaki.motohiro@jp.fujitsu.com\u003e\nCc: \u003cray-lk@madrabbit.org\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "30ca60c15a725f655e5d3f14e0238a066bc5aeb7",
      "tree": "96d36a2cf12e7a964ce4cd0c49d30b2d40f94b52",
      "parents": [
        "9f0e738f492522a2f70ad9a2a0287e4e966c633a"
      ],
      "author": {
        "name": "Mike Travis",
        "email": "travis@sgi.com",
        "time": "Tue Mar 25 15:06:55 2008 -0700"
      },
      "committer": {
        "name": "Ingo Molnar",
        "email": "mingo@elte.hu",
        "time": "Sat Apr 19 19:44:58 2008 +0200"
      },
      "message": "cpumask: add cpumask_scnprintf_len function\n\nAdd a new function cpumask_scnprintf_len() to return the number of\ncharacters needed to display \"len\" cpumask bits.  The current method\nof allocating NR_CPUS bytes is incorrect as what\u0027s really needed is\n9 characters per 32-bit word of cpumask bits (8 hex digits plus the\nseperator [\u0027,\u0027] or the terminating NULL.)  This function provides the\ncaller the means to allocate the correct string length.\n\nCc: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Mike Travis \u003ctravis@sgi.com\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n"
    },
    {
      "commit": "0b030c2c2f0f1d98d5fe412e5b7cf7fd53f5221a",
      "tree": "ff10db5bc25c1aa3e7cc5c8dac6807d76fd7f506",
      "parents": [
        "5a75983eef1193c43caebde6643a218bd8d8390e"
      ],
      "author": {
        "name": "Andi Kleen",
        "email": "ak@suse.de",
        "time": "Mon Nov 05 14:50:56 2007 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@woody.linux-foundation.org",
        "time": "Mon Nov 05 15:12:32 2007 -0800"
      },
      "message": "Fix bitmap_scnlistprintf for empty masks\n\nWhen a bitmap is empty bitmap_scnlistprintf() would leave the buffer\nuninitialized.  Set it to an empty string in this case.\n\nI didn\u0027t see any in normal kernel callers hitting this, but some custom\ndebug code of mine did.\n\nSigned-off-by: Andi Kleen \u003cak@suse.de\u003e\nAcked-by: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "05fb6bf0b29552b64dc86f405a484de2514e0ac2",
      "tree": "cd3306512f98f73f7e846fc55b6e56aed4bfea61",
      "parents": [
        "328d24403d6a6b856722facd39d7b6ccb429353b"
      ],
      "author": {
        "name": "Randy Dunlap",
        "email": "randy.dunlap@oracle.com",
        "time": "Wed Feb 28 20:12:13 2007 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@woody.linux-foundation.org",
        "time": "Thu Mar 01 14:53:37 2007 -0800"
      },
      "message": "[PATCH] kernel-doc fixes for 2.6.20-git15 (non-drivers)\n\nFix kernel-doc warnings in 2.6.20-git15 (lib/, mm/, kernel/, include/).\n\nSigned-off-by: Randy Dunlap \u003crandy.dunlap@oracle.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "72fd4a35a824331d7a0f4168d7576502d95d34b3",
      "tree": "be27880bc36b7f62e8044a88b8744a35c5317714",
      "parents": [
        "262086cf5b5343c2b81c97b1c606058e921859df"
      ],
      "author": {
        "name": "Robert P. J. Day",
        "email": "rpjday@mindspring.com",
        "time": "Sat Feb 10 01:45:59 2007 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@woody.linux-foundation.org",
        "time": "Sun Feb 11 10:51:32 2007 -0800"
      },
      "message": "[PATCH] Numerous fixes to kernel-doc info in source files.\n\nA variety of (mostly) innocuous fixes to the embedded kernel-doc content in\nsource files, including:\n\n  * make multi-line initial descriptions single line\n  * denote some function names, constants and structs as such\n  * change erroneous opening \u0027/*\u0027 to \u0027/**\u0027 in a few places\n  * reword some text for clarity\n\nSigned-off-by: Robert P. J. Day \u003crpjday@mindspring.com\u003e\nCc: \"Randy.Dunlap\" \u003crdunlap@xenotime.net\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "01a3ee2b203e511e20f98b85a9172fd32c53e87c",
      "tree": "0dd90d81dc86f231828af23bdb97522405b06cab",
      "parents": [
        "39484e53bb00f55b6303a908070db133608ef2a5"
      ],
      "author": {
        "name": "Reinette Chatre",
        "email": "reinette.chatre@linux.intel.com",
        "time": "Wed Oct 11 01:21:55 2006 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Wed Oct 11 11:14:22 2006 -0700"
      },
      "message": "[PATCH] bitmap: parse input from kernel and user buffers\n\nlib/bitmap.c:bitmap_parse() is a library function that received as input a\nuser buffer.  This seemed to have originated from the way the write_proc\nfunction of the /proc filesystem operates.\n\nThis has been reworked to not use kmalloc and eliminates a lot of\nget_user() overhead by performing one access_ok before using __get_user().\n\nWe need to test if we are in kernel or user space (is_user) and access the\nbuffer differently.  We cannot use __get_user() to access kernel addresses\nin all cases, for example in architectures with separate address space for\nkernel and user.\n\nThis function will be useful for other uses as well; for example, taking\ninput for /sysfs instead of /proc, so it was changed to accept kernel\nbuffers.  We have this use for the Linux UWB project, as part as the\nupcoming bandwidth allocator code.\n\nOnly a few routines used this function and they were changed too.\n\nSigned-off-by: Reinette Chatre \u003creinette.chatre@linux.intel.com\u003e\nSigned-off-by: Inaky Perez-Gonzalez \u003cinaky@linux.intel.com\u003e\nCc: Paul Jackson \u003cpj@sgi.com\u003e\nCc: Joe Korty \u003cjoe.korty@ccur.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "6e1907ffdc694023712b5e6516933a29e1be954f",
      "tree": "87edb0233deca3b805d5154877964a09ca450db2",
      "parents": [
        "099a71d99578a53bdf5f383c55e4095f1c59410c"
      ],
      "author": {
        "name": "Randy Dunlap",
        "email": "rdunlap@xenotime.net",
        "time": "Sun Jun 25 05:48:57 2006 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Sun Jun 25 10:01:20 2006 -0700"
      },
      "message": "[PATCH] kernel-doc for lib/bitmap.c\n\nMake corrections/fixes to kernel-doc in lib/bitmap.c and include it in DocBook\ntemplate.\n\nSigned-off-by: Randy Dunlap \u003crdunlap@xenotime.net\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "37d54111c133bea05fbae9dfe6d3d61a1b19c09b",
      "tree": "780d15232a465815b96e2cd22c85b3e05f2b1238",
      "parents": [
        "e9bebd6f3acee68fa07d44726895b40733cb1dc0"
      ],
      "author": {
        "name": "Akinobu Mita",
        "email": "mita@miraclelinux.com",
        "time": "Sun Mar 26 01:39:56 2006 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Sun Mar 26 08:57:15 2006 -0800"
      },
      "message": "[PATCH] bitops: hweight() related cleanup\n\nBy defining generic hweight*() routines\n\n- hweight64() will be defined on all architectures\n- hweight_long() will use architecture optimized hweight32() or hweight64()\n\nI found two possible cleanups by these reasons.\n\nSigned-off-by: Akinobu Mita \u003cmita@miraclelinux.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "3cf64b933c90ba701cfdc7188431104c646d7c9e",
      "tree": "a51cd036519cfddc1235b7023320c0dc53939432",
      "parents": [
        "74373c6acc52450ced28780d5fece60f1d7d20aa"
      ],
      "author": {
        "name": "Paul Jackson",
        "email": "pj@sgi.com",
        "time": "Fri Mar 24 03:15:46 2006 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Fri Mar 24 07:33:20 2006 -0800"
      },
      "message": "[PATCH] bitmap: region restructuring\n\nRestructure the bitmap_*_region() operations, to avoid code duplication.\n\nAlso reduces binary text size by about 100 bytes (ia64 arch).  The original\nBottomley bitmap_*_region patch added about 1000 bytes of compiled kernel text\n(ia64).  The Mundt multiword extension added another 600 bytes, and this\nrestructuring patch gets back about 100 bytes.\n\nBut the real motivation was the reduced amount of duplicated code.\n\nTested by Paul Mundt using \u003c\u003d BITS_PER_LONG as well as power of\n2 aligned multiword spanning allocations.\n\nSigned-off-by: Paul Mundt \u003clethal@linux-sh.org\u003e\nSigned-off-by: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "74373c6acc52450ced28780d5fece60f1d7d20aa",
      "tree": "6717fce7fdebbda48ad62b79b4ff721fae1c8dc3",
      "parents": [
        "87e24802586333fa861861f6493c76039872755b"
      ],
      "author": {
        "name": "Paul Mundt",
        "email": "lethal@linux-sh.org",
        "time": "Fri Mar 24 03:15:45 2006 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Fri Mar 24 07:33:20 2006 -0800"
      },
      "message": "[PATCH] bitmap: region multiword spanning support\n\nAdd support to the lib/bitmap.c bitmap_*_region() routines\n\nFor bitmap regions larger than one word (nbits \u003e BITS_PER_LONG).  This removes\na BUG_ON() in lib bitmap.\n\nI have an updated store queue API for SH that is currently using this with\nrelative success, and at first glance, it seems like this could be useful for\nx86 (arch/i386/kernel/pci-dma.c) as well.  Particularly for anything using\ndma_declare_coherent_memory() on large areas and that attempts to allocate\nlarge buffers from that space.\n\nPaul Jackson also did some cleanup to this patch.\n\nSigned-off-by: Paul Mundt \u003clethal@linux-sh.org\u003e\nSigned-off-by: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "87e24802586333fa861861f6493c76039872755b",
      "tree": "631a252da4716798027cd96b4529351e601c50c6",
      "parents": [
        "f993b3bf80b23d329951fe0fc5ba3647d5d912e9"
      ],
      "author": {
        "name": "Paul Jackson",
        "email": "pj@sgi.com",
        "time": "Fri Mar 24 03:15:44 2006 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Fri Mar 24 07:33:20 2006 -0800"
      },
      "message": "[PATCH] bitmap: region cleanup\n\nPaul Mundt \u003clethal@linux-sh.org\u003e says:\n\nThis patch set implements a number of patches to clean up and restructure the\nbitmap region code, in addition to extending the interface to support\nmultiword spanning allocations.\n\nThe current implementation (before this patch set) is limited by only being\nable to allocate pages \u003c\u003d BITS_PER_LONG, as noted by the strategically\npositioned BUG_ON() at lib/bitmap.c:752:\n\n        /* We don\u0027t do regions of pages \u003e BITS_PER_LONG.  The\n\t * algorithm would be a simple look for multiple zeros in the\n\t * array, but there\u0027s no driver today that needs this.  If you\n\t * trip this BUG(), you get to code it... */\n        BUG_ON(pages \u003e BITS_PER_LONG);\n\nAs I seem to have been the first person to trigger this, the result ends up\nbeing the following patch set with the help of Paul Jackson.\n\nThe final patch in the series eliminates quite a bit of code duplication, so\nthe bitmap code size ends up being smaller than the current implementation as\nan added bonus.\n\nAfter these are applied, it should already be possible to do multiword\nallocations with dma_alloc_coherent() out of ranges established by\ndma_declare_coherent_memory() on x86 without having to change any of the code,\nand the SH store queue API will follow up on this as the other user that needs\nsupport for this.\n\nThis patch:\n\nSome code cleanup on the lib/bitmap.c bitmap_*_region() routines:\n\n * spacing\n * variable names\n * comments\n\nHas no change to code function.\n\nSigned-off-by: Paul Mundt \u003clethal@linux-sh.org\u003e\nSigned-off-by: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "96b7f34143c2c823a6a750fcb758fc66c44945d2",
      "tree": "a17cadb13e4eeb555f32186579d5d174cf51796b",
      "parents": [
        "10cef6029502915bdb3cf0821d425cf9dc30c817"
      ],
      "author": {
        "name": "Paul Jackson",
        "email": "pj@sgi.com",
        "time": "Sun Jan 08 01:01:46 2006 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Sun Jan 08 20:13:42 2006 -0800"
      },
      "message": "[PATCH] cpuset: better bitmap remap defaults\n\nFix the default behaviour for the remap operators in bitmap, cpumask and\nnodemask.\n\nAs previously submitted, the pair of masks \u003cA, B\u003e defined a map of the\npositions of the set bits in A to the corresponding bits in B.  This is still\ntrue.\n\nThe issue is how to map the other positions, corresponding to the unset (0)\nbits in A.  As previously submitted, they were all mapped to the first set bit\nposition in B, a constant map.\n\nWhen I tried to code per-vma mempolicy rebinding using these remap operators,\nI realized this was wrong.\n\nThis patch changes the default to map all the unset bit positions in A to the\nsame positions in B, the identity map.\n\nFor example, if A has bits 4-7 set, and B has bits 9-12 set, then the map\ndefined by the pair \u003cA, B\u003e maps each bit position in the first 32 bits as\nfollows:\n\n\t0 \u003d\u003d\u003e 0\n\t  ...\n\t3 \u003d\u003d\u003e 3\n\t4 \u003d\u003d\u003e 9\n\t  ...\n\t7 \u003d\u003d\u003e 12\n\t8 \u003d\u003d\u003e 8\n\t9 \u003d\u003d\u003e 9\n\t  ...\n\t31 \u003d\u003d\u003e 31\n\nThis now corresponds to the typical behaviour desired when migrating pages and\npolicies from one cpuset to another.\n\nThe pages on nodes within the original cpuset, and the references in memory\npolicies to nodes within the original cpuset, are migrated to the\ncorresponding cpuset-relative nodes in the destination cpuset.  Other pages\nand node references are left untouched.\n\nSigned-off-by: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "fb5eeeee44edb248b4837416966f19731f497f79",
      "tree": "f947a4dcf103f55d526bb5c71f69b657d8f22e61",
      "parents": [
        "28a42b9ea7e42e1efb02cc2dcacba0b6af234e1b"
      ],
      "author": {
        "name": "Paul Jackson",
        "email": "pj@sgi.com",
        "time": "Sun Oct 30 15:02:33 2005 -0800"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@g5.osdl.org",
        "time": "Sun Oct 30 17:37:21 2005 -0800"
      },
      "message": "[PATCH] cpusets: bitmap and mask remap operators\n\nIn the forthcoming task migration support, a key calculation will be\nmapping cpu and node numbers from the old set to the new set while\npreserving cpuset-relative offset.\n\nFor example, if a task and its pages on nodes 8-11 are being migrated to\nnodes 24-27, then pages on node 9 (the 2nd node in the old set) should be\nmoved to node 25 (the 2nd node in the new set.)\n\nAs with other bitmap operations, the proper way to code this is to provide\nthe underlying calculation in lib/bitmap.c, and then to provide the usual\ncpumask and nodemask wrappers.\n\nThis patch provides that.  These operations are termed \u0027remap\u0027 operations.\nBoth remapping a single bit and a set of bits is supported.\n\nSigned-off-by: Paul Jackson \u003cpj@sgi.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "8c0e33c133021ee241e9d51255b9fb18eb34ef0e",
      "tree": "30ddff7f7cf375c36d11d49352365a42b25e1def",
      "parents": [
        "f45494480f31342125870c1a184999d7c5a59471"
      ],
      "author": {
        "name": "Nick Wilson",
        "email": "njw@osdl.org",
        "time": "Sat Jun 25 14:59:00 2005 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@ppc970.osdl.org",
        "time": "Sat Jun 25 16:25:02 2005 -0700"
      },
      "message": "[PATCH] Use ALIGN to remove duplicate code\n\nThis patch makes use of ALIGN() to remove duplicate round-up code.\n\nSigned-off-by: Nick Wilson \u003cnjw@osdl.org\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n"
    },
    {
      "commit": "1da177e4c3f41524e886b7f1b8a0c1fc7321cac2",
      "tree": "0bba044c4ce775e45a88a51686b5d9f90697ea9d",
      "parents": [],
      "author": {
        "name": "Linus Torvalds",
        "email": "torvalds@ppc970.osdl.org",
        "time": "Sat Apr 16 15:20:36 2005 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@ppc970.osdl.org",
        "time": "Sat Apr 16 15:20:36 2005 -0700"
      },
      "message": "Linux-2.6.12-rc2\n\nInitial git repository build. I\u0027m not bothering with the full history,\neven though we have it. We can create a separate \"historical\" git\narchive of that later if we want to, and in the meantime it\u0027s about\n3.2GB when imported into git - space that would just make the early\ngit days unnecessarily complicated, when we don\u0027t have a lot of good\ninfrastructure for it.\n\nLet it rip!\n"
    }
  ]
}