)]}'
{
  "log": [
    {
      "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"
    }
  ]
}