/src/elfutils/lib/next_prime.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* Determine prime number. |
2 | | Copyright (C) 2006 Red Hat, Inc. |
3 | | This file is part of elfutils. |
4 | | Written by Ulrich Drepper <drepper@redhat.com>, 2000. |
5 | | |
6 | | This file is free software; you can redistribute it and/or modify |
7 | | it under the terms of either |
8 | | |
9 | | * the GNU Lesser General Public License as published by the Free |
10 | | Software Foundation; either version 3 of the License, or (at |
11 | | your option) any later version |
12 | | |
13 | | or |
14 | | |
15 | | * the GNU General Public License as published by the Free |
16 | | Software Foundation; either version 2 of the License, or (at |
17 | | your option) any later version |
18 | | |
19 | | or both in parallel, as here. |
20 | | |
21 | | elfutils is distributed in the hope that it will be useful, but |
22 | | WITHOUT ANY WARRANTY; without even the implied warranty of |
23 | | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
24 | | General Public License for more details. |
25 | | |
26 | | You should have received copies of the GNU General Public License and |
27 | | the GNU Lesser General Public License along with this program. If |
28 | | not, see <http://www.gnu.org/licenses/>. */ |
29 | | |
30 | | #ifdef HAVE_CONFIG_H |
31 | | # include <config.h> |
32 | | #endif |
33 | | |
34 | | #include <stddef.h> |
35 | | |
36 | | |
37 | | /* Test whether CANDIDATE is a prime. */ |
38 | | static int |
39 | | is_prime (size_t candidate) |
40 | 5.73k | { |
41 | | /* No even number and none less than 10 will be passed here. */ |
42 | 5.73k | size_t divn = 3; |
43 | 5.73k | size_t sq = divn * divn; |
44 | | |
45 | 11.4k | while (sq < candidate && candidate % divn != 0) |
46 | 5.73k | { |
47 | 5.73k | size_t old_sq = sq; |
48 | 5.73k | ++divn; |
49 | 5.73k | sq += 4 * divn; |
50 | 5.73k | if (sq < old_sq) |
51 | 0 | return 1; |
52 | 5.73k | ++divn; |
53 | 5.73k | } |
54 | | |
55 | 5.73k | return candidate % divn != 0; |
56 | 5.73k | } dwarf_abbrev_hash.c:is_prime Line | Count | Source | 40 | 5.73k | { | 41 | | /* No even number and none less than 10 will be passed here. */ | 42 | 5.73k | size_t divn = 3; | 43 | 5.73k | size_t sq = divn * divn; | 44 | | | 45 | 11.4k | while (sq < candidate && candidate % divn != 0) | 46 | 5.73k | { | 47 | 5.73k | size_t old_sq = sq; | 48 | 5.73k | ++divn; | 49 | 5.73k | sq += 4 * divn; | 50 | 5.73k | if (sq < old_sq) | 51 | 0 | return 1; | 52 | 5.73k | ++divn; | 53 | 5.73k | } | 54 | | | 55 | 5.73k | return candidate % divn != 0; | 56 | 5.73k | } |
Unexecuted instantiation: next_prime.c:is_prime |
57 | | |
58 | | |
59 | | /* We need primes for the table size. */ |
60 | | size_t |
61 | | next_prime (size_t seed) |
62 | 5.73k | { |
63 | | /* Make it definitely odd. */ |
64 | 5.73k | seed |= 1; |
65 | | |
66 | 5.73k | while (!is_prime (seed)) |
67 | 0 | seed += 2; |
68 | | |
69 | 5.73k | return seed; |
70 | 5.73k | } Line | Count | Source | 62 | 5.73k | { | 63 | | /* Make it definitely odd. */ | 64 | 5.73k | seed |= 1; | 65 | | | 66 | 5.73k | while (!is_prime (seed)) | 67 | 0 | seed += 2; | 68 | | | 69 | 5.73k | return seed; | 70 | 5.73k | } |
Unexecuted instantiation: next_prime |