Function report |
Source Code:lib\math\prime_numbers.c |
Create Date:2022-07-28 06:43:31 |
Last Modify:2020-03-12 14:18:49 | Copyright©Brick |
home page | Tree |
Annotation kernel can get tool activity | Download SCCT | Chinese |
Name:expand_to_next_prime
Proto:static bool expand_to_next_prime(unsigned long x)
Type:bool
Parameter:
Type | Parameter | Name |
---|---|---|
unsigned long | x |
130 | If Not new Then Return false |
133 | mutex_lock( & lock) |
144 | bitmap_fill(primes, sz) |
145 | bitmap_copy(primes, primes, sz) |
153 | If p != small_primes Then kfree_rcu() - kfree an object after a grace period((structprimes * )p, rcu) |
156 | unlock : |
157 | mutex_unlock( & lock) |
158 | Return true |
Name | Describe |
---|---|
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 |
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 |