Function report |
Source Code:lib\find_bit.c |
Create Date:2022-07-28 06:24:25 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:This is a common helper function for find_next_bit, find_next_zero_bit, and* find_next_and_bit. The differences are:* - The "invert" argument, which is XORed with each fetched word before* searching it for one bits.
Proto:static inline unsigned long _find_next_bit(const unsigned long *addr1, const unsigned long *addr2, unsigned long nbits, unsigned long start, unsigned long invert)
Type:unsigned long
Parameter:
Type | Parameter | Name |
---|---|---|
const unsigned long * | addr1 | |
const unsigned long * | addr2 | |
unsigned long | nbits | |
unsigned long | start | |
unsigned long | invert |
36 | If Value for the false possibility is greater at compile time(start >= nbits) Then Return nbits |
39 | tmp = addr1[start / BITS_PER_LONG] |
40 | If addr2 Then tmp &= addr2[start / BITS_PER_LONG] |
45 | tmp &= BITMAP_FIRST_WORD_MASK(start) |
49 | start += BITS_PER_LONG |
53 | tmp = addr1[start / BITS_PER_LONG] |
54 | If addr2 Then tmp &= addr2[start / BITS_PER_LONG] |
Name | Describe |
---|---|
find_next_bit | Find the next set bit in a memory region. |
find_next_zero_bit | Find the next zero bit in a memory region. |
find_next_and_bit |
Source code conversion tool public plug-in interface | X |
---|---|
Support c/c++/esqlc/java Oracle/Informix/Mysql Plug-in can realize: logical Report Code generation and batch code conversion |