diff options
author | H. Peter Anvin <hpa@zytor.com> | 2009-12-11 13:57:42 -0500 |
---|---|---|
committer | H. Peter Anvin <hpa@zytor.com> | 2009-12-11 13:57:42 -0500 |
commit | 5c6baba84e1ac6a79b266b40e17e692aab6604a1 (patch) | |
tree | 6ba34db1109107023d753dd9fd5c359b3b990a04 /lib | |
parent | 893f38d144a4d96d2483cd7c3801d26e1b2c23e9 (diff) | |
parent | 3ef884b4c04e857c283cc77ca70ad8f638d94b0e (diff) |
Merge commit 'linus/master' into x86/urgent
Diffstat (limited to 'lib')
-rw-r--r-- | lib/Kconfig.debug | 10 | ||||
-rw-r--r-- | lib/decompress_bunzip2.c | 2 | ||||
-rw-r--r-- | lib/dma-debug.c | 2 | ||||
-rw-r--r-- | lib/idr.c | 4 | ||||
-rw-r--r-- | lib/swiotlb.c | 2 |
5 files changed, 14 insertions, 6 deletions
diff --git a/lib/Kconfig.debug b/lib/Kconfig.debug index 0b8f35918a36..2f22cf4576db 100644 --- a/lib/Kconfig.debug +++ b/lib/Kconfig.debug | |||
@@ -105,7 +105,7 @@ config DEBUG_SECTION_MISMATCH | |||
105 | bool "Enable full Section mismatch analysis" | 105 | bool "Enable full Section mismatch analysis" |
106 | depends on UNDEFINED | 106 | depends on UNDEFINED |
107 | # This option is on purpose disabled for now. | 107 | # This option is on purpose disabled for now. |
108 | # It will be enabled when we are down to a resonable number | 108 | # It will be enabled when we are down to a reasonable number |
109 | # of section mismatch warnings (< 10 for an allyesconfig build) | 109 | # of section mismatch warnings (< 10 for an allyesconfig build) |
110 | help | 110 | help |
111 | The section mismatch analysis checks if there are illegal | 111 | The section mismatch analysis checks if there are illegal |
@@ -298,6 +298,14 @@ config DEBUG_OBJECTS_TIMERS | |||
298 | timer routines to track the life time of timer objects and | 298 | timer routines to track the life time of timer objects and |
299 | validate the timer operations. | 299 | validate the timer operations. |
300 | 300 | ||
301 | config DEBUG_OBJECTS_WORK | ||
302 | bool "Debug work objects" | ||
303 | depends on DEBUG_OBJECTS | ||
304 | help | ||
305 | If you say Y here, additional code will be inserted into the | ||
306 | work queue routines to track the life time of work objects and | ||
307 | validate the work operations. | ||
308 | |||
301 | config DEBUG_OBJECTS_ENABLE_DEFAULT | 309 | config DEBUG_OBJECTS_ENABLE_DEFAULT |
302 | int "debug_objects bootup default value (0-1)" | 310 | int "debug_objects bootup default value (0-1)" |
303 | range 0 1 | 311 | range 0 1 |
diff --git a/lib/decompress_bunzip2.c b/lib/decompress_bunzip2.c index 600f473a5610..76074209f9a2 100644 --- a/lib/decompress_bunzip2.c +++ b/lib/decompress_bunzip2.c | |||
@@ -299,7 +299,7 @@ static int INIT get_next_block(struct bunzip_data *bd) | |||
299 | again when using them (during symbol decoding).*/ | 299 | again when using them (during symbol decoding).*/ |
300 | base = hufGroup->base-1; | 300 | base = hufGroup->base-1; |
301 | limit = hufGroup->limit-1; | 301 | limit = hufGroup->limit-1; |
302 | /* Calculate permute[]. Concurently, initialize | 302 | /* Calculate permute[]. Concurrently, initialize |
303 | * temp[] and limit[]. */ | 303 | * temp[] and limit[]. */ |
304 | pp = 0; | 304 | pp = 0; |
305 | for (i = minLen; i <= maxLen; i++) { | 305 | for (i = minLen; i <= maxLen; i++) { |
diff --git a/lib/dma-debug.c b/lib/dma-debug.c index ce6b7eabf674..d9b08e0f7f55 100644 --- a/lib/dma-debug.c +++ b/lib/dma-debug.c | |||
@@ -259,7 +259,7 @@ static struct dma_debug_entry *hash_bucket_find(struct hash_bucket *bucket, | |||
259 | * times. Without a hardware IOMMU this results in the | 259 | * times. Without a hardware IOMMU this results in the |
260 | * same device addresses being put into the dma-debug | 260 | * same device addresses being put into the dma-debug |
261 | * hash multiple times too. This can result in false | 261 | * hash multiple times too. This can result in false |
262 | * positives being reported. Therfore we implement a | 262 | * positives being reported. Therefore we implement a |
263 | * best-fit algorithm here which returns the entry from | 263 | * best-fit algorithm here which returns the entry from |
264 | * the hash which fits best to the reference value | 264 | * the hash which fits best to the reference value |
265 | * instead of the first-fit. | 265 | * instead of the first-fit. |
@@ -281,7 +281,7 @@ static int idr_get_new_above_int(struct idr *idp, void *ptr, int starting_id) | |||
281 | /** | 281 | /** |
282 | * idr_get_new_above - allocate new idr entry above or equal to a start id | 282 | * idr_get_new_above - allocate new idr entry above or equal to a start id |
283 | * @idp: idr handle | 283 | * @idp: idr handle |
284 | * @ptr: pointer you want associated with the ide | 284 | * @ptr: pointer you want associated with the id |
285 | * @start_id: id to start search at | 285 | * @start_id: id to start search at |
286 | * @id: pointer to the allocated handle | 286 | * @id: pointer to the allocated handle |
287 | * | 287 | * |
@@ -313,7 +313,7 @@ EXPORT_SYMBOL(idr_get_new_above); | |||
313 | /** | 313 | /** |
314 | * idr_get_new - allocate new idr entry | 314 | * idr_get_new - allocate new idr entry |
315 | * @idp: idr handle | 315 | * @idp: idr handle |
316 | * @ptr: pointer you want associated with the ide | 316 | * @ptr: pointer you want associated with the id |
317 | * @id: pointer to the allocated handle | 317 | * @id: pointer to the allocated handle |
318 | * | 318 | * |
319 | * This is the allocate id function. It should be called with any | 319 | * This is the allocate id function. It should be called with any |
diff --git a/lib/swiotlb.c b/lib/swiotlb.c index 795472d8ae24..5bc01803f8f8 100644 --- a/lib/swiotlb.c +++ b/lib/swiotlb.c | |||
@@ -485,7 +485,7 @@ do_unmap_single(struct device *hwdev, char *dma_addr, size_t size, int dir) | |||
485 | 485 | ||
486 | /* | 486 | /* |
487 | * Return the buffer to the free list by setting the corresponding | 487 | * Return the buffer to the free list by setting the corresponding |
488 | * entries to indicate the number of contigous entries available. | 488 | * entries to indicate the number of contiguous entries available. |
489 | * While returning the entries to the free list, we merge the entries | 489 | * While returning the entries to the free list, we merge the entries |
490 | * with slots below and above the pool being returned. | 490 | * with slots below and above the pool being returned. |
491 | */ | 491 | */ |