函数逻辑报告 |
Source Code:include\linux\idr.h |
Create Date:2022-07-27 06:45:03 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:da_alloc_min() - Allocate an unused ID
函数原型:static inline int ida_alloc_min(struct ida *ida, unsigned int min, gfp_t gfp)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct ida * | ida | |
unsigned int | min | |
gfp_t | gfp |
名称 | 描述 |
---|---|
ida_check_alloc | Straightforward checks that allocating and freeing IDs work. |
ida_check_destroy_1 | Destroy an IDA with a single entry at @base |
ida_check_leaf | Check what happens when we fill a leaf and then delete it. This may* discover mishandling of IDR_FREE. |
ida_check_max | Check allocations up to and slightly above the maximum allowed (2^31-1) ID.* Allocating up to 2^31-1 should succeed, and then allocating the next one* should fail. |
ida_check_conv | Check handling of conversions between exceptional entries and full bitmaps. |
mnt_alloc_group_id | Allocate a new peer group ID |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |