)]}' { "log": [ { "commit": "3b9ed1a5d2d121f32d2cb4f2b05f1fc57c99c946", "tree": "d8ea52d6b490c0e3b3851e1887c01700cc0115c6", "parents": [ "09020adb61416c4307de35941a9725a5e33d9beb" ], "author": { "name": "Akinobu Mita", "email": "mita@miraclelinux.com", "time": "Sun Mar 26 01:39:13 2006 -0800" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Sun Mar 26 08:57:11 2006 -0800" }, "message": "[PATCH] bitops: generic hweight{64,32,16,8}()\n\nThis patch introduces the C-language equivalents of the functions below:\n\nunsigned int hweight32(unsigned int w);\nunsigned int hweight16(unsigned int w);\nunsigned int hweight8(unsigned int w);\nunsigned long hweight64(__u64 w);\n\nIn include/asm-generic/bitops/hweight.h\n\nThis code largely copied from: include/linux/bitops.h\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": "ccb46000f4bb459777686611157ac0eac928704e", "tree": "461e956d9e27a7afa7de64950f3186070ffa61f5", "parents": [ "64b91379439ff0fb007bde90eb496299c14a9b2a" ], "author": { "name": "Andrew Morton", "email": "akpm@osdl.org", "time": "Sat Mar 25 03:08:08 2006 -0800" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Sat Mar 25 08:22:59 2006 -0800" }, "message": "[PATCH] cpumask: uninline first_cpu()\n\n text data bss dec hex filename\nbefore: 3490577 1322408 360000 5172985 4eeef9 vmlinux\nafter: 3488027 1322496 360128 5170651 4ee5db vmlinux\n\nCc: 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": "c27a0d75b33c030965cc97d3d7f571107a673fb4", "tree": "c4d797b413bb6f8a1b8507213294a291ab5114f8", "parents": [ "f7589f28d7dd4586b4e90ac3b2a180409669053a" ], "author": { "name": "Bryan O\u0027Sullivan", "email": "bos@pathscale.com", "time": "Wed Feb 01 03:05:16 2006 -0800" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Wed Feb 01 08:53:13 2006 -0800" }, "message": "[PATCH] Introduce __iowrite32_copy\n\nThis arch-independent routine copies data to a memory-mapped I/O region,\nusing 32-bit accesses. The naming is double-underscored to make it clear\nthat it does not guarantee write ordering, nor does it perform a memory\nbarrier afterwards; the kernel doc also explicitly states this. This style\nof access is required by some devices.\n\nThis change also introduces include/linux/io.h, at Andrew\u0027s suggestion. It\nonly has one occupant at the moment, but is a logical destination for\noft-replicated contents of include/asm-*/{io,iomap}.h to migrate to.\n\nSigned-off-by: Bryan O\u0027Sullivan \u003cbos@pathscale.com\u003e\nCc: Andi Kleen \u003cak@muc.de\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "6c654b5fdf093cd05f35f7c9c2a00182fa5636dc", "tree": "7aa16a41d64b906c6e7e5248897f88027428d12a", "parents": [ "0b9afede3d9c66fef06f1d5ef5ff15c4b97730fc" ], "author": { "name": "John W. Linville", "email": "linville@tuxdriver.com", "time": "Thu Sep 29 14:42:42 2005 -0700" }, "committer": { "name": "Tony Luck", "email": "tony.luck@intel.com", "time": "Thu Sep 29 14:42:42 2005 -0700" }, "message": "[PATCH] swiotlb: move from arch/ia64/lib/ to lib/\n\nThe swiotlb implementation is shared by both IA-64 and EM64T. However,\nthe source itself lives under arch/ia64. This patch moves swiotlb.c\nfrom arch/ia64/lib to lib/ and fixes-up the appropriate Makefile and\nKconfig files. No actual changes are made to swiotlb.c.\n\nSigned-off-by: John W. Linville \u003clinville@tuxdriver.com\u003e\nSigned-off-by: Tony Luck \u003ctony.luck@intel.com\u003e\n" }, { "commit": "fb1c8f93d869b34cacb8b8932e2b83d96a19d720", "tree": "a006d078aa02e421a7dc4793c335308204859d36", "parents": [ "4327edf6b8a7ac7dce144313947995538842d8fd" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Sat Sep 10 00:25:56 2005 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Sat Sep 10 10:06:21 2005 -0700" }, "message": "[PATCH] spinlock consolidation\n\nThis patch (written by me and also containing many suggestions of Arjan van\nde Ven) does a major cleanup of the spinlock code. It does the following\nthings:\n\n - consolidates and enhances the spinlock/rwlock debugging code\n\n - simplifies the asm/spinlock.h files\n\n - encapsulates the raw spinlock type and moves generic spinlock\n features (such as -\u003ebreak_lock) into the generic code.\n\n - cleans up the spinlock code hierarchy to get rid of the spaghetti.\n\nMost notably there\u0027s now only a single variant of the debugging code,\nlocated in lib/spinlock_debug.c. (previously we had one SMP debugging\nvariant per architecture, plus a separate generic one for UP builds)\n\nAlso, i\u0027ve enhanced the rwlock debugging facility, it will now track\nwrite-owners. There is new spinlock-owner/CPU-tracking on SMP builds too.\nAll locks have lockup detection now, which will work for both soft and hard\nspin/rwlock lockups.\n\nThe arch-level include files now only contain the minimally necessary\nsubset of the spinlock code - all the rest that can be generalized now\nlives in the generic headers:\n\n include/asm-i386/spinlock_types.h | 16\n include/asm-x86_64/spinlock_types.h | 16\n\nI have also split up the various spinlock variants into separate files,\nmaking it easier to see which does what. The new layout is:\n\n SMP | UP\n ----------------------------|-----------------------------------\n asm/spinlock_types_smp.h | linux/spinlock_types_up.h\n linux/spinlock_types.h | linux/spinlock_types.h\n asm/spinlock_smp.h | linux/spinlock_up.h\n linux/spinlock_api_smp.h | linux/spinlock_api_up.h\n linux/spinlock.h | linux/spinlock.h\n\n/*\n * here\u0027s the role of the various spinlock/rwlock related include files:\n *\n * on SMP builds:\n *\n * asm/spinlock_types.h: contains the raw_spinlock_t/raw_rwlock_t and the\n * initializers\n *\n * linux/spinlock_types.h:\n * defines the generic type and initializers\n *\n * asm/spinlock.h: contains the __raw_spin_*()/etc. lowlevel\n * implementations, mostly inline assembly code\n *\n * (also included on UP-debug builds:)\n *\n * linux/spinlock_api_smp.h:\n * contains the prototypes for the _spin_*() APIs.\n *\n * linux/spinlock.h: builds the final spin_*() APIs.\n *\n * on UP builds:\n *\n * linux/spinlock_type_up.h:\n * contains the generic, simplified UP spinlock type.\n * (which is an empty structure on non-debug builds)\n *\n * linux/spinlock_types.h:\n * defines the generic type and initializers\n *\n * linux/spinlock_up.h:\n * contains the __raw_spin_*()/etc. version of UP\n * builds. (which are NOPs on non-debug, non-preempt\n * builds)\n *\n * (included on UP-non-debug builds:)\n *\n * linux/spinlock_api_up.h:\n * builds the _spin_*() APIs.\n *\n * linux/spinlock.h: builds the final spin_*() APIs.\n */\n\nAll SMP and UP architectures are converted by this patch.\n\narm, i386, ia64, ppc, ppc64, s390/s390x, x64 was build-tested via\ncrosscompilers. m32r, mips, sh, sparc, have not been tested yet, but should\nbe mostly fine.\n\nFrom: Grant Grundler \u003cgrundler@parisc-linux.org\u003e\n\n Booted and lightly tested on a500-44 (64-bit, SMP kernel, dual CPU).\n Builds 32-bit SMP kernel (not booted or tested). I did not try to build\n non-SMP kernels. That should be trivial to fix up later if necessary.\n\n I converted bit ops atomic_hash lock to raw_spinlock_t. Doing so avoids\n some ugly nesting of linux/*.h and asm/*.h files. Those particular locks\n are well tested and contained entirely inside arch specific code. I do NOT\n expect any new issues to arise with them.\n\n If someone does ever need to use debug/metrics with them, then they will\n need to unravel this hairball between spinlocks, atomic ops, and bit ops\n that exist only because parisc has exactly one atomic instruction: LDCW\n (load and clear word).\n\nFrom: \"Luck, Tony\" \u003ctony.luck@intel.com\u003e\n\n ia64 fix\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nSigned-off-by: Arjan van de Ven \u003carjanv@infradead.org\u003e\nSigned-off-by: Grant Grundler \u003cgrundler@parisc-linux.org\u003e\nCc: Matthew Wilcox \u003cwilly@debian.org\u003e\nSigned-off-by: Hirokazu Takata \u003ctakata@linux-m32r.org\u003e\nSigned-off-by: Mikael Pettersson \u003cmikpe@csd.uu.se\u003e\nSigned-off-by: Benoit Boissinot \u003cbenoit.boissinot@ens-lyon.org\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "7657ec1fcb69e266ab876af56332d0c484ca6d00", "tree": "6118ceffa2f83f43c3086941d96011dc1abeb459", "parents": [ "a3d65f254274567daa89d8b99ab3d481d60fcaef" ], "author": { "name": "Evgeniy Polyakov", "email": "johnpol@2ka.mipt.ru", "time": "Wed Aug 17 15:17:26 2005 +0400" }, "committer": { "name": "Greg Kroah-Hartman", "email": "gregkh@suse.de", "time": "Thu Sep 08 14:41:27 2005 -0700" }, "message": "[PATCH] lib/crc16: added crc16 algorithm.\n\nAdd the crc16 routines, as used by w1 devices.\n\nSigned-off-by: Ben Gardner \u003cbgardner@wabtec.com\u003e\nSigned-off-by: Evgeniy Polyakov \u003cjohnpol@2ka.mipt.ru\u003e\nSigned-off-by: Greg Kroah-Hartman \u003cgregkh@suse.de\u003e\n" }, { "commit": "52fdd08903a1d1162e184114837e232640191627", "tree": "9469f521b7ba12ac48337155bc5a65049d361229", "parents": [ "4ad8d38342430f8b52f7a8458dce90caf8c8ca64" ], "author": { "name": "Benjamin LaHaise", "email": "bcrl@kvack.org", "time": "Sat Sep 03 15:56:52 2005 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@evo.osdl.org", "time": "Mon Sep 05 00:06:14 2005 -0700" }, "message": "[PATCH] unify x86/x86-64 semaphore code\n\nThis patch moves the common code in x86 and x86-64\u0027s semaphore.c into a\nsingle file in lib/semaphore-sleepers.c. The arch specific asm stubs are\nleft in the arch tree (in semaphore.c for i386 and in the asm for x86-64).\nThere should be no changes in code/functionality with this patch.\n\nSigned-off-by: Benjamin LaHaise \u003cbenjamin.c.lahaise@intel.com\u003e\nCc: Andi Kleen \u003cak@muc.de\u003e\nSigned-off-by: Jeff Dike \u003cjdike@addtoit.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "8082e4ed0a61da347f1c7f210493c4e9e55c8cd0", "tree": "f77b01974f0c773a828b7f910f9269a0a07d298f", "parents": [ "cf4ef01440ca5c6d96f2ea2b793a37a0a863a045" ], "author": { "name": "Pablo Neira Ayuso", "email": "pablo@eurodev.net", "time": "Thu Aug 25 16:12:22 2005 -0700" }, "committer": { "name": "David S. Miller", "email": "davem@sunset.davemloft.net", "time": "Mon Aug 29 16:11:06 2005 -0700" }, "message": "[LIB]: Boyer-Moore extension for textsearch infrastructure strike #2\n\nAttached the implementation of the Boyer-Moore string search\nalgorithm for the new textsearch infrastructure.\n\nI\u0027ve added as well a note about the limitations that this approach\npresents, as Thomas has remarked.\n\nSigned-off-by: Pablo Neira Ayuso \u003cpablo@eurodev.net\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n" }, { "commit": "7e8c9e14e8fdce0af9f5eed7ce6dd26b91fc8f4e", "tree": "5cf9aed809b520eea2dbdf4926c490966169c919", "parents": [ "1aaf18ff9de1f37bf674236fc0779c3aaa65b998" ], "author": { "name": "Andrew Morton", "email": "akpm@osdl.org", "time": "Wed Jul 27 11:43:55 2005 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Wed Jul 27 16:25:53 2005 -0700" }, "message": "[PATCH] statically link halfmd4\n\nFor some reason halfmd4 isn\u0027t being linked into the kernel any more and\nmodular ext3 wants it.\n\nSo statically link the halfmd4 code into the kernel.\n\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "65df877ab2e2328a4704af218efaed0a45176c86", "tree": "ec7cf77ddc08fca3c007dc0ac209d1e7ba2953d3", "parents": [ "a8acfbac75c2ffdd66fb5dfcdb7ab5aaced94fd8" ], "author": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Thu Jun 23 23:49:52 2005 -0700" }, "committer": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Thu Jun 23 23:49:52 2005 -0700" }, "message": "[LIB]: textsearch.o needs to be obj-y not lib-y.\n\nIt exports symbols.\n\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n" }, { "commit": "6408f79cce401e1bfecf923e7156f84f96e021e3", "tree": "203624ffacf60d364293adc47d2f59f6ba81dd35", "parents": [ "df3fb93ad9ec0b20c785c0ad82d42d159a1af272" ], "author": { "name": "Thomas Graf", "email": "tgraf@suug.ch", "time": "Thu Jun 23 20:59:16 2005 -0700" }, "committer": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Thu Jun 23 20:59:16 2005 -0700" }, "message": "[LIB]: Naive finite state machine based textsearch\n\nA finite state machine consists of n states (struct ts_fsm_token)\nrepresenting the pattern as a finite automation. The data is read\nsequentially on a octet basis. Every state token specifies the number\nof recurrences and the type of value accepted which can be either a\nspecific character or ctype based set of characters. The available\ntype of recurrences include 1, (0|1), [0 n], and [1 n].\n\nThe algorithm differs between strict/non-strict mode specyfing\nwhether the pattern has to start at the first octect. Strict mode\nis enabled by default and can be disabled by inserting\nTS_FSM_HEAD_IGNORE as the first token in the chain.\n\nThe runtime performance of the algorithm should be around O(n),\nhowever while in strict mode the average runtime can be better.\n\nSigned-off-by: Thomas Graf \u003ctgraf@suug.ch\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n" }, { "commit": "df3fb93ad9ec0b20c785c0ad82d42d159a1af272", "tree": "e29ba25f55cb77e24310999a949b433e98d7656e", "parents": [ "2de4ff7bd658c97fb357efa3095a509674dacb5a" ], "author": { "name": "Thomas Graf", "email": "tgraf@suug.ch", "time": "Thu Jun 23 20:58:37 2005 -0700" }, "committer": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Thu Jun 23 20:58:37 2005 -0700" }, "message": "[LIB]: Knuth-Morris-Pratt textsearch algorithm\n\nImplements a linear-time string-matching algorithm due to Knuth,\nMorris, and Pratt [1]. Their algorithm avoids the explicit\ncomputation of the transition function DELTA altogether. Its\nmatching time is O(n), for n being length(text), using just an\nauxiliary function PI[1..m], for m being length(pattern),\nprecomputed from the pattern in time O(m). The array PI allows\nthe transition function DELTA to be computed efficiently\n\"on the fly\" as needed. Roughly speaking, for any state\n\"q\" \u003d 0,1,...,m and any character \"a\" in SIGMA, the value\nPI[\"q\"] contains the information that is independent of \"a\" and\nis needed to compute DELTA(\"q\", \"a\") [2]. Since the array PI\nhas only m entries, whereas DELTA has O(m|SIGMA|) entries, we\nsave a factor of |SIGMA| in the preprocessing time by computing\nPI rather than DELTA.\n \n[1] Cormen, Leiserson, Rivest, Stein\n Introdcution to Algorithms, 2nd Edition, MIT Press\n[2] See finite automation theory\n\nSigned-off-by: Thomas Graf \u003ctgraf@suug.ch\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n" }, { "commit": "2de4ff7bd658c97fb357efa3095a509674dacb5a", "tree": "49036dbf594317a6a17ff4e56f65158a6aeacbda", "parents": [ "5f8ef48d240963093451bcf83df89f1a1364f51d" ], "author": { "name": "Thomas Graf", "email": "tgraf@suug.ch", "time": "Thu Jun 23 20:49:30 2005 -0700" }, "committer": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Thu Jun 23 20:49:30 2005 -0700" }, "message": "[LIB]: Textsearch infrastructure.\n\nThe textsearch infrastructure provides text searching\nfacitilies for both linear and non-linear data.\nIndividual search algorithms are implemented in modules\nand chosen by the user.\n\nSigned-off-by: Thomas Graf \u003ctgraf@suug.ch\u003e\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\u003e\n" }, { "commit": "f14f75b81187cdbe10cc53a521bf9fdf97b59f8c", "tree": "5c0d48c8a3338e6f1747e6cd55f699be96ffef1a", "parents": [ "2caaad41e4aa8f5dd999695b4ddeaa0e7f3912a4" ], "author": { "name": "Jes Sorensen", "email": "jes@wildopensource.com", "time": "Tue Jun 21 17:15:02 2005 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@ppc970.osdl.org", "time": "Tue Jun 21 18:46:18 2005 -0700" }, "message": "[PATCH] ia64 uncached alloc\n\nThis patch contains the ia64 uncached page allocator and the generic\nallocator (genalloc). The uncached allocator was formerly part of the SN2\nmspec driver but there are several other users of it so it has been split\noff from the driver.\n\nThe generic allocator can be used by device driver to manage special memory\netc. The generic allocator is based on the allocator from the sym53c8xx_2\ndriver.\n\nVarious users on ia64 needs uncached memory. The SGI SN architecture requires\nit for inter-partition communication between partitions within a large NUMA\ncluster. The specific user for this is the XPC code. Another application is\nlarge MPI style applications which use it for synchronization, on SN this can\nbe done using special \u0027fetchop\u0027 operations but it also benefits non SN\nhardware which may use regular uncached memory for this purpose. Performance\nof doing this through uncached vs cached memory is pretty substantial. This\nis handled by the mspec driver which I will push out in a seperate patch.\n\nRather than creating a specific allocator for just uncached memory I came up\nwith genalloc which is a generic purpose allocator that can be used by device\ndrivers and other subsystems as they please. For instance to handle onboard\ndevice memory. It was derived from the sym53c7xx_2 driver\u0027s allocator which\nis also an example of a potential user (I am refraining from modifying sym2\nright now as it seems to have been under fairly heavy development recently).\n\nOn ia64 memory has various properties within a granule, ie. it isn\u0027t safe to\naccess memory as uncached within the same granule as currently has memory\naccessed in cached mode. The regular system therefore doesn\u0027t utilize memory\nin the lower granules which is mixed in with device PAL code etc. The\nuncached driver walks the EFI memmap and pulls out the spill uncached pages\nand sticks them into the uncached pool. Only after these chunks have been\nutilized, will it start converting regular cached memory into uncached memory.\nHence the reason for the EFI related code additions.\n\nSigned-off-by: Jes Sorensen \u003cjes@wildopensource.com\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "39c715b71740c4a78ba4769fb54826929bac03cb", "tree": "94dd679dfc8e6c2db65971739aa8c8c6206f8174", "parents": [ "84929801e14d968caeb84795bfbb88f04283fbd9" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Tue Jun 21 17:14:34 2005 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@ppc970.osdl.org", "time": "Tue Jun 21 18:46:13 2005 -0700" }, "message": "[PATCH] smp_processor_id() cleanup\n\nThis patch implements a number of smp_processor_id() cleanup ideas that\nArjan van de Ven and I came up with.\n\nThe previous __smp_processor_id/_smp_processor_id/smp_processor_id API\nspaghetti was hard to follow both on the implementational and on the\nusage side.\n\nSome of the complexity arose from picking wrong names, some of the\ncomplexity comes from the fact that not all architectures defined\n__smp_processor_id.\n\nIn the new code, there are two externally visible symbols:\n\n - smp_processor_id(): debug variant.\n\n - raw_smp_processor_id(): nondebug variant. Replaces all existing\n uses of _smp_processor_id() and __smp_processor_id(). Defined\n by every SMP architecture in include/asm-*/smp.h.\n\nThere is one new internal symbol, dependent on DEBUG_PREEMPT:\n\n - debug_smp_processor_id(): internal debug variant, mapped to\n smp_processor_id().\n\nAlso, i moved debug_smp_processor_id() from lib/kernel_lock.c into a new\nlib/smp_processor_id.c file. All related comments got updated and/or\nclarified.\n\nI have build/boot tested the following 8 .config combinations on x86:\n\n {SMP,UP} x {PREEMPT,!PREEMPT} x {DEBUG_PREEMPT,!DEBUG_PREEMPT}\n\nI have also build/boot tested x64 on UP/PREEMPT/DEBUG_PREEMPT. (Other\narchitectures are untested, but should work just fine.)\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nSigned-off-by: Arjan van de Ven \u003carjan@infradead.org\u003e\nSigned-off-by: Andrew Morton \u003cakpm@osdl.org\u003e\nSigned-off-by: Linus Torvalds \u003ctorvalds@osdl.org\u003e\n" }, { "commit": "9a19fea43616066561e221359596ce532e631395", "tree": "f776bee1bcb1051bf75323b65fa887347412409e", "parents": [ "6034a080f98b0bbc0a058e2ac65a538f75cffeee" ], "author": { "name": "mochel@digitalimplant.org", "email": "mochel@digitalimplant.org", "time": "Mon Mar 21 11:45:16 2005 -0800" }, "committer": { "name": "Greg Kroah-Hartman", "email": "gregkh@suse.de", "time": "Mon Jun 20 15:15:14 2005 -0700" }, "message": "[PATCH] Add initial implementation of klist helpers.\n\nThis klist interface provides a couple of structures that wrap around\nstruct list_head to provide explicit list \"head\" (struct klist) and\nlist \"node\" (struct klist_node) objects. For struct klist, a spinlock\nis included that protects access to the actual list itself. struct\nklist_node provides a pointer to the klist that owns it and a kref\nreference count that indicates the number of current users of that node\nin the list.\n\nThe entire point is to provide an interface for iterating over a list\nthat is safe and allows for modification of the list during the\niteration (e.g. insertion and removal), including modification of the\ncurrent node on the list.\n\nIt works using a 3rd object type - struct klist_iter - that is declared\nand initialized before an iteration. klist_next() is used to acquire the\nnext element in the list. It returns NULL if there are no more items.\nThis klist interface provides a couple of structures that wrap around\nstruct list_head to provide explicit list \"head\" (struct klist) and\nlist \"node\" (struct klist_node) objects. For struct klist, a spinlock\nis included that protects access to the actual list itself. struct\nklist_node provides a pointer to the klist that owns it and a kref\nreference count that indicates the number of current users of that node\nin the list.\n\nThe entire point is to provide an interface for iterating over a list\nthat is safe and allows for modification of the list during the\niteration (e.g. insertion and removal), including modification of the\ncurrent node on the list.\n\nIt works using a 3rd object type - struct klist_iter - that is declared\nand initialized before an iteration. klist_next() is used to acquire the\nnext element in the list. It returns NULL if there are no more items.\nInternally, that routine takes the klist\u0027s lock, decrements the reference\ncount of the previous klist_node and increments the count of the next\nklist_node. It then drops the lock and returns.\n\nThere are primitives for adding and removing nodes to/from a klist.\nWhen deleting, klist_del() will simply decrement the reference count.\nOnly when the count goes to 0 is the node removed from the list.\nklist_remove() will try to delete the node from the list and block\nuntil it is actually removed. This is useful for objects (like devices)\nthat have been removed from the system and must be freed (but must wait\nuntil all accessors have finished).\n\nInternally, that routine takes the klist\u0027s lock, decrements the reference\ncount of the previous klist_node and increments the count of the next\nklist_node. It then drops the lock and returns.\n\nThere are primitives for adding and removing nodes to/from a klist.\nWhen deleting, klist_del() will simply decrement the reference count.\nOnly when the count goes to 0 is the node removed from the list.\nklist_remove() will try to delete the node from the list and block\nuntil it is actually removed. This is useful for objects (like devices)\nthat have been removed from the system and must be freed (but must wait\nuntil all accessors have finished).\n\nSigned-off-by: Patrick Mochel \u003cmochel@digitalimplant.org\u003e\nSigned-off-by: Greg Kroah-Hartman \u003cgregkh@suse.de\u003e\n\ndiff -Nru a/include/linux/klist.h b/include/linux/klist.h\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" } ] }