hollalinux
/
linux-sg2042
mirror of https://github.com/sophgo/linux-riscv.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Correct explanations of "find_next" bit routines. 

Correct the obvious "copy and paste" errors explaining some of the
"find_next" routines.

Signed-off-by: Robert P. J. Day <rpjday@mindspring.com>
Acked-by: Randy Dunlap <randy.dunlap@oracle.com>
Signed-off-by: Adrian Bunk <bunk@kernel.org>
This commit is contained in:
Robert P. J. Day 2008-02-03 15:02:21 +02:00 committed by Adrian Bunk
parent a247b5d594
commit 4fe3fcaca0
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
arch/x86/lib/bitops_32.c
View File

@ -2,7 +2,7 @@
#include <linux/module.h>
/**
* find_next_bit - find the first set bit in a memory region
* find_next_bit - find the next set bit in a memory region
* @addr: The address to base the search on
* @offset: The bitnumber to start searching at
* @size: The maximum size to search

2
arch/x86/lib/bitops_64.c
View File

@ -58,7 +58,7 @@ long find_first_zero_bit(const unsigned long * addr, unsigned long size)
}
/**
* find_next_zero_bit - find the first zero bit in a memory region
* find_next_zero_bit - find the next zero bit in a memory region
* @addr: The address to base the search on
* @offset: The bitnumber to start searching at
* @size: The maximum size to search