)]}' { "log": [ { "commit": "0624517d809b1cf53c977335c9bda4c216cbddee", "tree": "5791430160f4423cab3c6085baed815e10c421f7", "parents": [ "1977f032722c27ee3730284582fd3991ad9ac81b" ], "author": { "name": "Jiri Slaby", "email": "jirislaby@gmail.com", "time": "Thu Oct 18 23:40:26 2007 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@woody.linux-foundation.org", "time": "Fri Oct 19 11:53:41 2007 -0700" }, "message": "forbid asm/bitops.h direct inclusion\n\nforbid asm/bitops.h direct inclusion\n\nBecause of compile errors that may occur after bit changes if asm/bitops.h is\nincluded directly without e.g. linux/kernel.h which includes linux/bitops.h,\nforbid direct inclusion of asm/bitops.h. Thanks to Adrian Bunk.\n\nSigned-off-by: Jiri Slaby \u003cjirislaby@gmail.com\u003e\nCc: Adrian Bunk \u003cbunk@kernel.org\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n" }, { "commit": "26333576fd0d0b52f6e4025c5aded97e188bdd44", "tree": "a9c1f9518d940a8ef10453871f2899ca18d46efa", "parents": [ "38048983e14c0fb6324175fbaf2be1baa842f5ee" ], "author": { "name": "Nick Piggin", "email": "npiggin@suse.de", "time": "Thu Oct 18 03:06:39 2007 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@woody.linux-foundation.org", "time": "Thu Oct 18 14:37:29 2007 -0700" }, "message": "bitops: introduce lock ops\n\nIntroduce test_and_set_bit_lock / clear_bit_unlock bitops with lock semantics.\nConvert all architectures to use the generic implementation.\n\nSigned-off-by: Nick Piggin \u003cnpiggin@suse.de\u003e\nAcked-By: David Howells \u003cdhowells@redhat.com\u003e\nCc: Richard Henderson \u003crth@twiddle.net\u003e\nCc: Ivan Kokshaysky \u003cink@jurassic.park.msu.ru\u003e\nCc: Russell King \u003crmk@arm.linux.org.uk\u003e\nCc: Haavard Skinnemoen \u003chskinnemoen@atmel.com\u003e\nCc: Bryan Wu \u003cbryan.wu@analog.com\u003e\nCc: Mikael Starvik \u003cstarvik@axis.com\u003e\nCc: David Howells \u003cdhowells@redhat.com\u003e\nCc: Yoshinori Sato \u003cysato@users.sourceforge.jp\u003e\nCc: \"Luck, Tony\" \u003ctony.luck@intel.com\u003e\nCc: Hirokazu Takata \u003ctakata@linux-m32r.org\u003e\nCc: Geert Uytterhoeven \u003cgeert@linux-m68k.org\u003e\nCc: Roman Zippel \u003czippel@linux-m68k.org\u003e\nCc: Greg Ungerer \u003cgerg@uclinux.org\u003e\nCc: Ralf Baechle \u003cralf@linux-mips.org\u003e\nCc: Kyle McMartin \u003ckyle@mcmartin.ca\u003e\nCc: Matthew Wilcox \u003cwilly@debian.org\u003e\nCc: Paul Mackerras \u003cpaulus@samba.org\u003e\nCc: Benjamin Herrenschmidt \u003cbenh@kernel.crashing.org\u003e\nCc: Heiko Carstens \u003cheiko.carstens@de.ibm.com\u003e\nCc: Martin Schwidefsky \u003cschwidefsky@de.ibm.com\u003e\nCc: Paul Mundt \u003clethal@linux-sh.org\u003e\nCc: Kazumoto Kojima \u003ckkojima@rr.iij4u.or.jp\u003e\nCc: Richard Curnow \u003crc@rc0.org.uk\u003e\nCc: William Lee Irwin III \u003cwli@holomorphy.com\u003e\nCc: \"David S. Miller\" \u003cdavem@davemloft.net\u003e\nCc: Jeff Dike \u003cjdike@addtoit.com\u003e\nCc: Paolo \u0027Blaisorblade\u0027 Giarrusso \u003cblaisorblade@yahoo.it\u003e\nCc: Miles Bader \u003cuclinux-v850@lsi.nec.co.jp\u003e\nCc: Andi Kleen \u003cak@muc.de\u003e\nCc: Chris Zankel \u003cchris@zankel.net\u003e\nSigned-off-by: Andrew Morton \u003cakpm@linux-foundation.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@linux-foundation.org\u003e\n" }, { "commit": "94c12cc7d196bab34aaa98d38521549fa1e5ef76", "tree": "8e0cec0ed44445d74a2cb5160303d6b4dfb1bc31", "parents": [ "25d83cbfaa44e1b9170c0941c3ef52ca39f54ccc" ], "author": { "name": "Martin Schwidefsky", "email": "schwidefsky@de.ibm.com", "time": "Thu Sep 28 16:56:43 2006 +0200" }, "committer": { "name": "Martin Schwidefsky", "email": "schwidefsky@de.ibm.com", "time": "Thu Sep 28 16:56:43 2006 +0200" }, "message": "[S390] Inline assembly cleanup.\n\nMajor cleanup of all s390 inline assemblies. They now have a common\ncoding style. Quite a few have been shortened, mainly by using register\nasm variables. Use of the EX_TABLE macro helps as well. The atomic ops,\nbit ops and locking inlines new use the Q-constraint if a newer gcc\nis used. That results in slightly better code.\n\nThanks to Christian Borntraeger for proof reading the changes.\n\nSigned-off-by: Martin Schwidefsky \u003cschwidefsky@de.ibm.com\u003e\n" }, { "commit": "c406abd3a6d0cf5ce8db4db155a729a28fb98c4f", "tree": "3b837f54a28a9f9754f8b34fd9cc4847557025e9", "parents": [ "0a6047eef1c465c38aacfbdab193161b3f0cd144" ], "author": { "name": "Heiko Carstens", "email": "heiko.carstens@de.ibm.com", "time": "Thu Jun 29 14:56:13 2006 +0200" }, "committer": { "name": "Martin Schwidefsky", "email": "schwidefsky@de.ibm.com", "time": "Thu Jun 29 14:56:13 2006 +0200" }, "message": "[S390] cleanup bitops.h.\n\nEncapsulate complete bitops.h with #ifdef __KERNEL__ and remove the now\nsuperfluous ALIGN_CS define and its users.\nThis patch is needed for compiling klibc.\n\nSigned-off-by: Heiko Carstens \u003cheiko.carstens@de.ibm.com\u003e\nSigned-off-by: Martin Schwidefsky \u003cschwidefsky@de.ibm.com\u003e\n" }, { "commit": "62c4f0a2d5a188f73a94f2cb8ea0dba3e7cf0a7f", "tree": "e85ca2d0dd43f90dccf758338764c3caa55f333f", "parents": [ "089f26d5e31b7bf42a9a8fefec08b30cd27f4b0e" ], "author": { "name": "David Woodhouse", "email": "dwmw2@infradead.org", "time": "Wed Apr 26 12:56:16 2006 +0100" }, "committer": { "name": "David Woodhouse", "email": "dwmw2@infradead.org", "time": "Wed Apr 26 12:56:16 2006 +0100" }, "message": "Don\u0027t include linux/config.h from anywhere else in include/\n\nSigned-off-by: David Woodhouse \u003cdwmw2@infradead.org\u003e\n" }, { "commit": "7e33db4e2e9d67ee01d105e33fb773eed8ba10f0", "tree": "452a381a4e2d36f519acfd09a2dd824d8ee4f572", "parents": [ "e779b2f95f3786cd9cfc804cd6f04f7267d75541" ], "author": { "name": "Akinobu Mita", "email": "mita@miraclelinux.com", "time": "Sun Mar 26 01:39:34 2006 -0800" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Sun Mar 26 08:57:14 2006 -0800" }, "message": "[PATCH] bitops: s390: use generic bitops\n\n- remove generic_ffs()\n- remove generic_fls()\n- remove generic_fls64()\n- remove generic_hweight{64,32,16,8}()\n- remove minix_{test,set,test_and_clear,test,find_first_zero}_bit()\n\nSigned-off-by: Akinobu Mita \u003cmita@miraclelinux.com\u003e\nCc: Heiko Carstens \u003cheiko.carstens@de.ibm.com\u003e\nCc: Martin Schwidefsky \u003cschwidefsky@de.ibm.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "67b0ad574b5ee90f8ea58196ff8a7f3780b75365", "tree": "ca9bc212f6efa8f5170185ef1fa21f75de0684fd", "parents": [ "72b61a3cfd80d1321eb898be8ceae2064f0fbea1" ], "author": { "name": "Akinobu Mita", "email": "mita@miraclelinux.com", "time": "Sun Mar 26 01:39:05 2006 -0800" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Sun Mar 26 08:57:10 2006 -0800" }, "message": "[PATCH] bitops: use non atomic operations for minix_*_bit() and ext2_*_bit()\n\nBitmap functions for the minix filesystem and the ext2 filesystem except\next2_set_bit_atomic() and ext2_clear_bit_atomic() do not require the atomic\nguarantees.\n\nBut these are defined by using atomic bit operations on several architectures.\n (cris, frv, h8300, ia64, m32r, m68k, m68knommu, mips, s390, sh, sh64, sparc,\nsparc64, v850, and xtensa)\n\nThis patch switches to non atomic bit operation.\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": "ef1bea9e2a5a72d2c3362522e0a09099406732ff", "tree": "3d953b0f2f4c97a44dec193092660cd33cacc1d3", "parents": [ "0defa3c19e7792001df09d6fa5ab461d3599ff6d" ], "author": { "name": "Eric Paris", "email": "eparis@redhat.com", "time": "Sat Feb 11 17:56:04 2006 -0800" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Sat Feb 11 21:41:13 2006 -0800" }, "message": "[PATCH] s390: remove one set of brackets in __constant_test_bit()\n\nRight now in __constant_test_bit for the s390 there is an extra set of ()\nsurrounding the calculation. This patch simply removes one set of () that is\nsurrounding the whole clause.\n\nSigned-off-by: Eric Paris \u003ceparis@redhat.com\u003e\nSigned-off-by: Heiko Carstens \u003cheiko.carstens@de.ibm.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "3821af2fe13700cab6fd67367128fa180e43f8b8", "tree": "a70f63c24bd7d2ac8b25e3e4ee0ef6a50847aa67", "parents": [ "c865e5d99e25a171e8262fc0f7ba608568633c64" ], "author": { "name": "Stephen Hemminger", "email": "shemminger@osdl.org", "time": "Wed Dec 21 19:30:53 2005 -0800" }, "committer": { "name": "David S. Miller", "email": "davem@sunset.davemloft.net", "time": "Tue Jan 03 13:11:06 2006 -0800" }, "message": "[FLS64]: generic version\n\nSigned-off-by: Stephen Hemminger \u003cshemminger@osdl.org\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n" }, { "commit": "187dfc67b461058bbb84a923a17871ed54e10f30", "tree": "857b572a17c221a2c08e195f012fb68655514d60", "parents": [ "d4b68996785326a67e9842219ab69984243ec658" ], "author": { "name": "Christian Borntraeger", "email": "cborntra@de.ibm.com", "time": "Mon Nov 07 00:59:07 2005 -0800" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Mon Nov 07 07:53:34 2005 -0800" }, "message": "[PATCH] s390: test_bit return value\n\nThe test_bit function returns a non-boolean value, it returns 0,1,2,4,...\ninstead of only 0 or 1. This causes wrongs results in the mincore system\ncall. Check against 0 to get a proper boolean value.\n\nSigned-off-by: Christian Borntraeger \u003ccborntra@de.ibm.com\u003e\nSigned-off-by: Martin Schwidefsky \u003cschwidefsky@de.ibm.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "afff7e2b3b13dbd26a2b9991d3d571df111d92e8", "tree": "51142ff8f5160bcd317120ffba604653c9e34455", "parents": [ "951f22d5b1f0eaae35dafc669e3774a0c2084d10" ], "author": { "name": "Martin Schwidefsky", "email": "schwidefsky@de.ibm.com", "time": "Wed Jul 27 11:44:58 2005 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Wed Jul 27 16:26:04 2005 -0700" }, "message": "[PATCH] s390: find_next_{zero}_bit fixes\n\nThe find_next_{zero}_bit primitives on s390* should never return a bit number\nbigger then the bit field size. In the case of a bitfield that doesn\u0027t end on\na word boundary, an offset that makes the search start at the last word of the\nbit field and the last word doesn\u0027t contain any zero/one bits the search is\ncontinued with a call to find_first_bit with a negative size. The search\nnormally ends pretty quickly because the words following the bit field contain\na mix of zeros and ones. But the bit number that is returned in this case is\ntoo big.\n\nTo fix this and additional if to check for this case is needed. To make the\ncode easier to read I removed the assembler parts from the\nfind_next_{zero}_bit functions, the C-ified code is as good.\n\nSigned-off-by: Martin Schwidefsky \u003cschwidefsky@de.ibm.com\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" } ] }