Commit | Line | Data |
---|---|---|
245bfdef | 1 | /* -*-c-*- |
245bfdef | 2 | * |
3 | * Build Blowfish key table | |
4 | * | |
5 | * (c) 2000 Straylight/Edgeware | |
6 | */ | |
7 | ||
45c0fd36 | 8 | /*----- Licensing notice --------------------------------------------------* |
245bfdef | 9 | * |
10 | * This file is part of Catacomb. | |
11 | * | |
12 | * Catacomb is free software; you can redistribute it and/or modify | |
13 | * it under the terms of the GNU Library General Public License as | |
14 | * published by the Free Software Foundation; either version 2 of the | |
15 | * License, or (at your option) any later version. | |
45c0fd36 | 16 | * |
245bfdef | 17 | * Catacomb is distributed in the hope that it will be useful, |
18 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
19 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
20 | * GNU Library General Public License for more details. | |
45c0fd36 | 21 | * |
245bfdef | 22 | * You should have received a copy of the GNU Library General Public |
23 | * License along with Catacomb; if not, write to the Free | |
24 | * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, | |
25 | * MA 02111-1307, USA. | |
26 | */ | |
27 | ||
245bfdef | 28 | /*----- Header files ------------------------------------------------------*/ |
29 | ||
30 | #include <stdio.h> | |
31 | #include <stdlib.h> | |
32 | ||
33 | #include <mLib/bits.h> | |
34 | ||
35 | /*----- Main code ---------------------------------------------------------*/ | |
36 | ||
37 | /* --- @spigot@ --- * | |
38 | * | |
39 | * Arguments: @uint32 *buf@ = pointer to the output buffer | |
40 | * @size_t n@ = number of output digits wanted | |
41 | * | |
42 | * Returns: --- | |
43 | * | |
44 | * Use: Writes digits of %$\pi$% to the given array. The algorithm | |
45 | * is based on the Spigot algorithm by Stanley Rabinowitz and | |
46 | * Stan Wagon, published in Amer.Math.Monthly, March 1995, with | |
47 | * bug fixes by C. Haenel. I then bodged it to output hex | |
48 | * digits rather than decimal ones, and to leave off the initial | |
49 | * `3'. | |
50 | * | |
51 | * I've not analysed the algorithm very much. | |
52 | */ | |
53 | ||
54 | #define SPIGOT_WORDS (18 + 4 * 256ul) | |
55 | #define SPIGOT_BITS 8 | |
56 | #define SPIGOT_RADIX (1ul << SPIGOT_BITS) | |
57 | #define SPIGOT_BUFLEN (SPIGOT_WORDS * 32) | |
58 | ||
cc3ca08f MW |
59 | #ifdef QUIET |
60 | # define Q(x) | |
61 | #else | |
62 | # define Q(x) x | |
63 | #endif | |
64 | ||
245bfdef | 65 | static void spigot(uint32 *buf, size_t n) |
66 | { | |
67 | uint32 acc = 0; | |
68 | int b = -1; | |
69 | unsigned a[SPIGOT_BUFLEN] = { 0 }; | |
70 | uint32 p = 0; | |
71 | unsigned f = 0; | |
72 | unsigned max = 32 * n; | |
cc3ca08f | 73 | Q( size_t step = n / 60; ) |
245bfdef | 74 | |
cc3ca08f MW |
75 | Q( fputs("[ ]\r[", |
76 | stderr); ) | |
245bfdef | 77 | |
78 | #define EMIT(z) do { \ | |
79 | if (b == -1) \ | |
80 | b = 0; \ | |
81 | else { \ | |
82 | acc = (acc << SPIGOT_BITS) | (z); \ | |
83 | b += SPIGOT_BITS; \ | |
84 | if (b == 32) { \ | |
85 | *buf++ = acc; \ | |
86 | acc = 0; \ | |
87 | b = 0; \ | |
88 | n--; \ | |
89 | if (!n) \ | |
90 | goto done; \ | |
cc3ca08f MW |
91 | Q( if (n % step == 0) \ |
92 | fputc('.', stderr); ) \ | |
245bfdef | 93 | } \ |
94 | } \ | |
95 | } while (0) | |
96 | ||
97 | while (n) { | |
98 | uint32 q = 0; | |
99 | uint32 i; | |
bede7d27 | 100 | uint32 x = 0; |
245bfdef | 101 | uint32 k = max * 2 - 1; |
102 | ||
103 | for (i = max; i; i--) { | |
104 | x = (b == -1 ? SPIGOT_RADIX * 2 : a[i - 1] << SPIGOT_BITS) + q * i; | |
105 | q = x / k; | |
106 | a[i - 1] = x - q * k; | |
107 | k -= 2; | |
108 | } | |
109 | ||
110 | k = x & (SPIGOT_RADIX - 1); | |
111 | if (k == SPIGOT_RADIX - 1) | |
112 | f++; | |
113 | else { | |
114 | EMIT(p + (x >> SPIGOT_BITS)); | |
115 | if (f) { | |
116 | unsigned d = (x >= SPIGOT_RADIX ? 0 : SPIGOT_RADIX - 1); | |
117 | while (f) { | |
118 | EMIT(d); | |
119 | f--; | |
120 | } | |
121 | } | |
122 | p = k; | |
123 | } | |
124 | } | |
125 | ||
cc3ca08f MW |
126 | done:; |
127 | Q( fputc('\n', stderr); ) | |
245bfdef | 128 | |
129 | #undef EMIT | |
130 | } | |
131 | ||
132 | /* --- @main@ --- */ | |
133 | ||
134 | int main(void) | |
135 | { | |
136 | uint32 dbuf[SPIGOT_WORDS]; | |
137 | int i, j; | |
138 | uint32 *d = dbuf; | |
139 | ||
140 | spigot(d, SPIGOT_WORDS); | |
141 | ||
142 | fputs("\ | |
143 | /* -*-c-*-\n\ | |
144 | *\n\ | |
145 | * Blowfish initial key table [generated]\n\ | |
146 | */\n\ | |
147 | \n\ | |
e5b61a8d | 148 | #include \"blowfish.h\"\n\ |
245bfdef | 149 | \n\ |
e5b61a8d | 150 | const blowfish_ctx blowfish_ikey = {\n\ |
245bfdef | 151 | { ", stdout); |
152 | ||
153 | for (i = 0; i < 18; i++) { | |
154 | printf("0x%08x", *d++); | |
155 | if (i == 17) | |
e5b61a8d | 156 | fputs(" },\n\n { ", stdout); |
245bfdef | 157 | else if (i % 4 == 3) |
e5b61a8d | 158 | fputs(",\n ", stdout); |
245bfdef | 159 | else |
160 | fputs(", ", stdout); | |
161 | } | |
162 | ||
163 | for (j = 0; j < 4; j++) { | |
164 | for (i = 0; i < 256; i++) { | |
165 | printf("0x%08x", *d++); | |
166 | if (i == 255) { | |
167 | if (j == 3) | |
e5b61a8d | 168 | fputs(" }\n};\n", stdout); |
245bfdef | 169 | else |
e5b61a8d | 170 | fputs(" },\n\n { ", stdout); |
245bfdef | 171 | } else if (i % 4 == 3) |
e5b61a8d | 172 | fputs(",\n ", stdout); |
245bfdef | 173 | else |
174 | fputs(", ", stdout); | |
175 | } | |
176 | } | |
177 | ||
178 | if (fclose(stdout)) { | |
179 | fprintf(stderr, "error writing data\n"); | |
180 | exit(EXIT_FAILURE); | |
181 | } | |
182 | return (0); | |
183 | } | |
184 | ||
185 | /*----- That's all, folks -------------------------------------------------*/ |