函数逻辑报告 |
Source Code:lib\math\prime_numbers.c |
Create Date:2022-07-27 07:40:59 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
首页 | 函数Tree |
注解内核,赢得工具 | 下载SCCT | English |
函数名称:expand_to_next_prime
函数原型:static bool expand_to_next_prime(unsigned long x)
返回类型:bool
参数:
类型 | 参数 | 名称 |
---|---|---|
unsigned long | x |
130 | 如果非new则返回:false |
133 | mutex_lock( & lock) |
144 | bitmap_fill(primes, sz) |
145 | bitmap_copy(primes, primes, sz) |
153 | 如果p不等于small_primes则kfree_rcu() - kfree an object after a grace period((structprimes * )p, rcu) |
156 | unlock : |
157 | mutex_unlock( & lock) |
158 | 返回:true |
名称 | 描述 |
---|---|
next_prime_number | xt_prime_number - return the next prime number*@x: the starting point for searching to test* A prime number is an integer greater than 1 that is only divisible by* itself and 1 |
is_prime_number | s_prime_number - test whether the given number is prime*@x: the number to test* A prime number is an integer greater than 1 that is only divisible by* itself and 1 |
源代码转换工具 开放的插件接口 | X |
---|---|
支持:c/c++/esqlc/java Oracle/Informix/Mysql 插件可实现:逻辑报告 代码生成和批量转换代码 |