| /* Bob Jenkins's cryptographic random number generators, ISAAC and ISAAC64. | |
| Copyright (C) 1999-2025 Free Software Foundation, Inc. | |
| Copyright (C) 1997, 1998, 1999 Colin Plumb. | |
| This program is free software: you can redistribute it and/or modify | |
| it under the terms of the GNU General Public License as published by | |
| the Free Software Foundation, either version 3 of the License, or | |
| (at your option) any later version. | |
| This program is distributed in the hope that it will be useful, | |
| but WITHOUT ANY WARRANTY; without even the implied warranty of | |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
| GNU General Public License for more details. | |
| You should have received a copy of the GNU General Public License | |
| along with this program. If not, see <https://www.gnu.org/licenses/>. | |
| Written by Colin Plumb and Paul Eggert. */ | |
| /* Log base 2 of the number of useful bits in an ISAAC word. It must | |
| be either 5 or 6. By default, this uses a value that should be | |
| faster for this architecture. */ | |
| /* The number of bits in an ISAAC word. */ | |
| typedef uint_least32_t isaac_word; | |
| typedef uint_least64_t isaac_word; | |
| /* Size of the state tables to use. ISAAC_WORDS_LOG should be at least 3, | |
| and smaller values give less security. */ | |
| /* State variables for the random number generator. The M member | |
| should be seeded with nonce data before calling isaac_seed. The | |
| other members are private. */ | |
| struct isaac_state | |
| { | |
| isaac_word m[ISAAC_WORDS]; /* Main state array */ | |
| isaac_word a, b, c; /* Extra variables */ | |
| }; | |
| void isaac_seed (struct isaac_state *) _GL_ATTRIBUTE_NONNULL (); | |
| void isaac_refill (struct isaac_state *, isaac_word[ISAAC_WORDS]) | |
| _GL_ATTRIBUTE_NONNULL (); | |