函数逻辑报告 |
Source Code:lib\test_parman.c |
Create Date:2022-07-27 07:31:50 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:test_parman_check_array
函数原型:static int test_parman_check_array(struct test_parman *test_parman, bool gaps_allowed)
返回类型:int
参数:
类型 | 参数 | 名称 |
---|---|---|
struct test_parman * | test_parman | |
bool | gaps_allowed |
303 | last_unused_items等于0 |
304 | last_priority等于0 |
305 | used_items等于0 |
309 | 打印错误信息("Array limit is lower than the base count (%lu < %lu)\n", prio_array_limit, TEST_PARMAN_BASE_COUNT) |
311 | 返回:负EINVAL |
314 | 以i小于prio_array_limit循环 |
315 | item等于prio_array[i] |
317 | 如果非item则 |
318 | last_unused_items自加 |
319 | 继续下一循环 |
321 | 如果last_unused_items且非gaps_allowed则 |
326 | last_unused_items等于0 |
327 | used_items自加 |
329 | 如果priority小于last_priority则 |
330 | 打印错误信息("Item belongs under higher priority then the last one (current: %lu, previous: %lu)\n", priority, last_priority) |
332 | 返回:负EINVAL |
334 | last_priority等于priority |
343 | 如果used_items不等于used_items则 |
344 | 打印错误信息("Number of used items in array does not match (%u != %u)\n", used_items, used_items) |
346 | 返回:负EINVAL |
350 | 打印错误信息("Number of unused item at the end of array is bigger than resize step (%u >= %lu)\n", last_unused_items, TEST_PARMAN_RESIZE_STEP_COUNT) |
352 | 返回:负EINVAL |
355 | 打印信息("Priority array check successful\n") |
357 | 返回:0 |
名称 | 描述 |
---|---|
test_parman_lsort |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |