)]}' { "log": [ { "commit": "77ba89c5cf28d5d98a3cae17f67a3e42b102cc25", "tree": "d487b536522574ab183cc600b62008c60db85b59", "parents": [ "8eb94f80dd2da5977c35cd094f0802c1501a12cd" ], "author": { "name": "Ingo Molnar", "email": "mingo@elte.hu", "time": "Tue Jun 27 02:54:51 2006 -0700" }, "committer": { "name": "Linus Torvalds", "email": "torvalds@g5.osdl.org", "time": "Tue Jun 27 17:32:46 2006 -0700" }, "message": "[PATCH] pi-futex: add plist implementation\n\nAdd the priority-sorted list (plist) implementation.\n\nSigned-off-by: Ingo Molnar \u003cmingo@elte.hu\u003e\nSigned-off-by: Thomas Gleixner \u003ctglx@linutronix.de\u003e\nSigned-off-by: Arjan van de Ven \u003carjan@linux.intel.com\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": "29cb9f9c5502f6218cd3ea574efe46a5e55522d2", "tree": "e3e16f62e7d203093e5d582db32ea357e3e70a58", "parents": [ "8082e4ed0a61da347f1c7f210493c4e9e55c8cd0" ], "author": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Thu Aug 25 16:23:11 2005 -0700" }, "committer": { "name": "David S. Miller", "email": "davem@sunset.davemloft.net", "time": "Mon Aug 29 16:11:11 2005 -0700" }, "message": "[LIB]: Make TEXTSEARCH_BM plain tristate like the others\n\nAnd select it when the relevant modules are enabled.\n\nSigned-off-by: David S. Miller \u003cdavem@davemloft.net\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": "f7704347a74fceaf79c89f8b8dbdd0111013e4d6", "tree": "96cdf098692ee1054ca75af546b9cc720f07a7a1", "parents": [ "b3e112bcc19abd8e9657dca34a87316786e096f3" ], "author": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Fri Jun 24 17:39:03 2005 -0700" }, "committer": { "name": "David S. Miller", "email": "davem@davemloft.net", "time": "Fri Jun 24 17:39:03 2005 -0700" }, "message": "[PKT_SCHED]: Make TEXTSEARCH* options only selected.\n\nDo not present these confusing new options to the user\nunless he picked some facility that makes use of it,\nsuch as NET_EMATCH_TEXT.\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": "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" } ] }