)]}'
{
  "log": [
    {
      "commit": "6f6d6a1a6a1336431a6cba60ace9e97c3a496a19",
      "tree": "f32e82fc3a50b6877afa3220bdb6f7ea0582e07f",
      "parents": [
        "71abb3af62dfa52930755f3b6497eafbe1d6ec85"
      ],
      "author": {
        "name": "Roman Zippel",
        "email": "zippel@linux-m68k.org",
        "time": "Thu May 01 04:34:28 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Thu May 01 08:03:58 2008 -0700"
      },
      "message": "rename div64_64 to div64_u64\n\nRename div64_64 to div64_u64 to make it consistent with the other divide\nfunctions, so it clearly includes the type of the divide.  Move its definition\nto math64.h as currently no architecture overrides the generic implementation.\n They can still override it of course, but the duplicated declarations are\navoided.\n\nSigned-off-by: Roman Zippel \u003czippel@linux-m68k.org\u003e\nCc: Avi Kivity \u003cavi@qumranet.com\u003e\nCc: Russell King \u003crmk@arm.linux.org.uk\u003e\nCc: Geert Uytterhoeven \u003cgeert@linux-m68k.org\u003e\nCc: Ralf Baechle \u003cralf@linux-mips.org\u003e\nCc: David Howells \u003cdhowells@redhat.com\u003e\nCc: Jeff Dike \u003cjdike@addtoit.com\u003e\nCc: Ingo Molnar \u003cmingo@elte.hu\u003e\nCc: \"David S. Miller\" \u003cdavem@davemloft.net\u003e\nCc: Patrick McHardy \u003ckaber@trash.net\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    },
    {
      "commit": "3927f2e8f9afa3424bb51ca81f7abac01ffd0005",
      "tree": "da9e335169572e6c743c084edce6a802f9e667ee",
      "parents": [
        "9d729f72dca9406025bcfa9c1f660d71d9ef0ff5"
      ],
      "author": {
        "name": "Stephen Hemminger",
        "email": "shemminger@linux-foundation.org",
        "time": "Sun Mar 25 19:54:23 2007 -0700"
      },
      "committer": {
        "name": "David S. Miller",
        "email": "davem@sunset.davemloft.net",
        "time": "Wed Apr 25 22:23:33 2007 -0700"
      },
      "message": "[NET]: div64_64 consolidate (rev3)\n\nHere is the current version of the 64 bit divide common code.\n\nSigned-off-by: Stephen Hemminger \u003cshemminger@linux-foundation.org\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n"
    },
    {
      "commit": "fa4adc614922c24601320e55bc5a1f837abad6e9",
      "tree": "f93979fc2d9e2e2dad6edd3fa92b084a2645976a",
      "parents": [
        "0215ffb08ce99e2bb59eca114a99499a4d06e704"
      ],
      "author": {
        "name": "Nicolas Pitre",
        "email": "nico@cam.org",
        "time": "Wed Dec 06 04:13:18 2006 +0100"
      },
      "committer": {
        "name": "Russell King",
        "email": "rmk+kernel@arm.linux.org.uk",
        "time": "Thu Dec 07 16:06:09 2006 +0000"
      },
      "message": "[ARM] 3611/4: optimize do_div() when divisor is constant\n\nOn ARM all divisions have to be performed \"manually\".  For 64-bit\ndivisions that may take more than a hundred cycles in many cases.\n\nWith 32-bit divisions gcc already use the recyprocal of constant\ndivisors to perform a multiplication, but not with 64-bit divisions.\n\nSince the kernel is increasingly relying upon 64-bit divisions it is\nworth optimizing at least those cases where the divisor is a constant.\nThis is what this patch does using plain C code that gets optimized away\nat compile time.\n\nFor example, despite the amount of added C code, do_div(x, 10000) now\nproduces the following assembly code (where x is assigned to r0-r1):\n\n\tadr\tr4, .L0\n\tldmia\tr4, {r4-r5}\n\tumull\tr2, r3, r4, r0\n\tmov\tr2, #0\n\tumlal\tr3, r2, r5, r0\n\tumlal\tr3, r2, r4, r1\n\tmov\tr3, #0\n\tumlal\tr2, r3, r5, r1\n\tmov\tr0, r2, lsr #11\n\torr\tr0, r0, r3, lsl #21\n\tmov\tr1, r3, lsr #11\n\t...\n.L0:\n\t.word\t948328779\n\t.word\t879609302\n\nwhich is the fastest that can be done for any value of x in that case,\nmany times faster than the __do_div64 code (except for the small x value\nspace for which the result ends up being zero or a single bit).\n\nThe fact that this code is generated inline produces a tiny increase in\n.text size, but not significant compared to the needed code around each\n__do_div64 call site this code is replacing.\n\nThe algorithm used has been validated on a 16-bit scale for all possible\nvalues, and then recodified for 64-bit values.  Furthermore I\u0027ve been\nrunning it with the final BUG_ON() uncommented for over two months now\nwith no problem.\n\nNote that this new code is compiled with gcc versions 4.0 or later.\nEarlier gcc versions proved themselves too problematic and only the\noriginal code is used with them.\n\nSigned-off-by: Nicolas Pitre \u003cnico@cam.org\u003e\nSigned-off-by: Russell King \u003crmk+kernel@arm.linux.org.uk\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"
    }
  ]
}