Function report |
Source Code:lib\bitmap.c |
Create Date:2022-07-28 06:20:32 |
| Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
| home page | Tree |
| Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:__reg_op
Proto:static int __reg_op(unsigned long *bitmap, unsigned int pos, int order, int reg_op)
Type:int
Parameter:
| Type | Parameter | Name |
|---|---|---|
| unsigned long * | bitmap | |
| unsigned int | pos | |
| int | order | |
| int | reg_op |
| 1053 | ret = 0 |
| 1060 | index = pos / BITS_PER_LONG |
| 1061 | offset = pos - index * BITS_PER_LONG |
| 1062 | nlongs_reg = BITS_TO_LONGS(nbits_reg) |
| 1063 | nbitsinlong = min - return minimum of two values of the same or compatible types*@x: first value*@y: second value(nbits_reg, BITS_PER_LONG) |
| 1069 | mask = 1UL << nbitsinlong - 1 |
| 1074 | Case reg_op == REG_OP_ISFREE |
| 1082 | Case reg_op == REG_OP_ALLOC |
| 1087 | Case reg_op == REG_OP_RELEASE |
| 1092 | done : |
| 1093 | Return ret |
| Name | Describe |
|---|---|
| bitmap_find_free_region | map_find_free_region - find a contiguous aligned mem region*@bitmap: array of unsigned longs corresponding to the bitmap*@bits: number of bits in the bitmap*@order: region size (log base 2 of number of bits) to find* Find a region of free (zero) bits in a |
| bitmap_release_region | map_release_region - release allocated bitmap region*@bitmap: array of unsigned longs corresponding to the bitmap*@pos: beginning of bit region to release*@order: region size (log base 2 of number of bits) to release* This is the complement to |
| bitmap_allocate_region | map_allocate_region - allocate bitmap region*@bitmap: array of unsigned longs corresponding to the bitmap*@pos: beginning of bit region to allocate*@order: region size (log base 2 of number of bits) to allocate |
| 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 |