)]}'
{
  "log": [
    {
      "commit": "d5e181f78ac753893eb930868a52a4488cd3de0a",
      "tree": "7d2f71fd3c84196f0d81a9e44861743b74e58ef6",
      "parents": [
        "f595ec964daf7f99668039d7303ddedd09a75142"
      ],
      "author": {
        "name": "Jeremy Fitzhardinge",
        "email": "jeremy.fitzhardinge@citrix.com",
        "time": "Thu Jun 12 10:47:58 2008 +0200"
      },
      "committer": {
        "name": "Ingo Molnar",
        "email": "mingo@elte.hu",
        "time": "Thu Jun 12 10:47:58 2008 +0200"
      },
      "message": "add an inlined version of iter_div_u64_rem\n\niter_div_u64_rem is used in the x86-64 vdso, which cannot call other\nkernel code.  For this case, provide the always_inlined version,\n__iter_div_u64_rem.\n\nSigned-off-by: Jeremy Fitzhardinge \u003cjeremy.fitzhardinge@citrix.com\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n"
    },
    {
      "commit": "f595ec964daf7f99668039d7303ddedd09a75142",
      "tree": "4ee6679105f0437995ff200f10885598921ae1cd",
      "parents": [
        "5e70b7f3c24468bb1635b295945edb48ecd9656a"
      ],
      "author": {
        "name": "Jeremy Fitzhardinge",
        "email": "jeremy.fitzhardinge@citrix.com",
        "time": "Thu Jun 12 10:47:56 2008 +0200"
      },
      "committer": {
        "name": "Ingo Molnar",
        "email": "mingo@elte.hu",
        "time": "Thu Jun 12 10:47:56 2008 +0200"
      },
      "message": "common implementation of iterative div/mod\n\nWe have a few instances of the open-coded iterative div/mod loop, used\nwhen we don\u0027t expcet the dividend to be much bigger than the divisor.\nUnfortunately modern gcc\u0027s have the tendency to strength \"reduce\" this\ninto a full mod operation, which isn\u0027t necessarily any faster, and\neven if it were, doesn\u0027t exist if gcc implements it in libgcc.\n\nThe workaround is to put a dummy asm statement in the loop to prevent\ngcc from performing the transformation.\n\nThis patch creates a single implementation of this loop, and uses it\nto replace the open-coded versions I know about.\n\nSigned-off-by: Jeremy Fitzhardinge \u003cjeremy.fitzhardinge@citrix.com\u003e\nCc: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nCc: john stultz \u003cjohnstul@us.ibm.com\u003e\nCc: Segher Boessenkool \u003csegher@kernel.crashing.org\u003e\nCc: Christian Kujau \u003clists@nerdbynature.de\u003e\nCc: Robert Hancock \u003chancockr@shaw.ca\u003e\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\n"
    },
    {
      "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": "2418f4f28f8467b92a6177af32d05737ebf6206c",
      "tree": "cd35f4feef2ed3078ebb7ce6dcaf5f627299944e",
      "parents": [
        "adafbedf0c31ae1cde62035c82857f5e376af553"
      ],
      "author": {
        "name": "Roman Zippel",
        "email": "zippel@linux-m68k.org",
        "time": "Thu May 01 04:34:25 2008 -0700"
      },
      "committer": {
        "name": "Linus Torvalds",
        "email": "torvalds@linux-foundation.org",
        "time": "Thu May 01 08:03:58 2008 -0700"
      },
      "message": "introduce explicit signed/unsigned 64bit divide\n\nThe current do_div doesn\u0027t explicitly say that it\u0027s unsigned and the signed\ncounterpart is missing, which is e.g.  needed when dealing with time values.\n\nThis introduces 64bit signed/unsigned divide functions which also attempts to\ncleanup the somewhat awkward calling API, which often requires the use of\ntemporary variables for the dividend.  To avoid the need for temporary\nvariables everywhere for the remainder, each divide variant also provides a\nversion which doesn\u0027t return the remainder.\n\nEach architecture can now provide optimized versions of these function,\notherwise generic fallback implementations will be used.\n\nAs an example I provided an alternative for the current x86 divide, which\navoids the asm casts and using an union allows gcc to generate better code.\nIt also avoids the upper divde in a few more cases, where the result is known\n(i.e.  upper quotient is zero).\n\nSigned-off-by: Roman Zippel \u003czippel@linux-m68k.org\u003e\nCc: john stultz \u003cjohnstul@us.ibm.com\u003e\nCc: Thomas Gleixner \u003ctglx@linutronix.de\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n"
    }
  ]
}