Function report |
Source Code:include\asm-generic\bitops\sched.h |
Create Date:2022-07-28 05:34:13 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| home page | Tree |
| Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:Every architecture must define this function. It's the fastest* way of searching a 100-bit bitmap. It's guaranteed that at least* one of the 100 bits is cleared.
Proto:static inline int sched_find_first_bit(const unsigned long *b)
Type:int
Parameter:
| Type | Parameter | Name |
|---|---|---|
| const unsigned long * | b |
| 20 | If b[0] Then Return __ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first. |
| 22 | If b[1] Then Return __ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first. + 32 |
| 24 | If b[2] Then Return __ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first. + 64 |
| 26 | Return __ffs - find first set bit in word*@word: The word to search* Undefined if no bit exists, so code should check against 0 first. + 96 |
| Name | Describe |
|---|---|
| pick_next_rt_entity |
| 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 |