| … | |
… | |
| 147 | va_end (ap); |
147 | va_end (ap); |
| 148 | |
148 | |
| 149 | alloc (len); |
149 | alloc (len); |
| 150 | } |
150 | } |
| 151 | |
151 | |
|
|
152 | // simply return a mask with "bits" bits set |
|
|
153 | inline uint64 |
|
|
154 | m (int b) |
|
|
155 | { |
|
|
156 | return (uint64 (1) << b) - 1; |
|
|
157 | } |
|
|
158 | |
|
|
159 | // convert 9 digits to ascii, using only a single multiplication |
|
|
160 | // (depending on cpu and compiler). |
|
|
161 | // will generate a single 0 as output when v=lz=0 |
|
|
162 | inline char * |
|
|
163 | i2a_9 (char *ptr, uint32 v, bool lz) |
|
|
164 | { |
|
|
165 | // convert to 4.56 fixed-point representation |
|
|
166 | // this should be optimal on 64 bit cpus, and rather |
|
|
167 | // slow on 32 bit cpus. go figure :) |
|
|
168 | const int bits = 7*8; // 8 bits per post-comma digit |
|
|
169 | |
|
|
170 | uint64 u = v * ((m (bits) + 100000000) / 100000000); // 10**8 |
|
|
171 | |
|
|
172 | if (lz) |
|
|
173 | { |
|
|
174 | // output leading zeros |
|
|
175 | // good compilers will compile this into only shifts, masks and adds |
|
|
176 | *ptr++ = char (u >> (bits - 0)) + '0'; u = (u & m (bits - 0)) * 5; |
|
|
177 | *ptr++ = char (u >> (bits - 1)) + '0'; u = (u & m (bits - 1)) * 5; |
|
|
178 | *ptr++ = char (u >> (bits - 2)) + '0'; u = (u & m (bits - 2)) * 5; |
|
|
179 | *ptr++ = char (u >> (bits - 3)) + '0'; u = (u & m (bits - 3)) * 5; |
|
|
180 | *ptr++ = char (u >> (bits - 4)) + '0'; u = (u & m (bits - 4)) * 5; |
|
|
181 | *ptr++ = char (u >> (bits - 5)) + '0'; u = (u & m (bits - 5)) * 5; |
|
|
182 | *ptr++ = char (u >> (bits - 6)) + '0'; u = (u & m (bits - 6)) * 5; |
|
|
183 | *ptr++ = char (u >> (bits - 7)) + '0'; u = (u & m (bits - 7)) * 5; |
|
|
184 | *ptr++ = char (u >> (bits - 8)) + '0'; |
|
|
185 | } |
|
|
186 | else |
|
|
187 | { |
|
|
188 | // do not output leading zeroes (except if v == 0) |
|
|
189 | // good compilers will compile this into completely branchless code |
|
|
190 | char digit, nz = 0; |
|
|
191 | |
|
|
192 | digit = (u >> (bits - 0)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 0)) * 5; |
|
|
193 | digit = (u >> (bits - 1)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 1)) * 5; |
|
|
194 | digit = (u >> (bits - 2)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 2)) * 5; |
|
|
195 | digit = (u >> (bits - 3)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 3)) * 5; |
|
|
196 | digit = (u >> (bits - 4)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 4)) * 5; |
|
|
197 | digit = (u >> (bits - 5)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 5)) * 5; |
|
|
198 | digit = (u >> (bits - 6)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 6)) * 5; |
|
|
199 | digit = (u >> (bits - 7)); *ptr = digit + '0'; nz |= digit; ptr += nz ? 1 : 0; u = (u & m (bits - 7)) * 5; |
|
|
200 | digit = (u >> (bits - 8)); *ptr = digit + '0'; nz |= digit; ptr += 1; |
|
|
201 | } |
|
|
202 | |
|
|
203 | return ptr; |
|
|
204 | } |
|
|
205 | |
| 152 | void |
206 | void |
| 153 | dynbuf_text::add (sint32 i) |
207 | dynbuf_text::add (sint32 i) |
| 154 | { |
208 | { |
| 155 | char buf[max_sint32_size]; |
209 | force (11); // 10 digits + '-' |
| 156 | char *p = buf + sizeof (buf); |
|
|
| 157 | char neg; |
|
|
| 158 | |
210 | |
| 159 | uint32 val; |
211 | *ptr = '-'; ptr += i < 0 ? 1 : 0; |
|
|
212 | uint32 u = i < 0 ? -i : i; |
|
|
213 | |
|
|
214 | if (expect_true (u < 10)) // we have a lot of single-digit numbers, so optimise |
|
|
215 | fadd (char (u + '0')); |
|
|
216 | else if (expect_true (u < 1000000000)) // 9 0's |
|
|
217 | ptr = i2a_9 (ptr, u, false); |
|
|
218 | else |
|
|
219 | { |
|
|
220 | sint32 div = u / 1000000000; |
|
|
221 | uint32 rem = u % 1000000000; |
|
|
222 | |
|
|
223 | ptr = i2a_9 (ptr, div, false); |
|
|
224 | ptr = i2a_9 (ptr, rem, true); |
|
|
225 | } |
|
|
226 | } |
|
|
227 | |
|
|
228 | void |
|
|
229 | dynbuf_text::add (sint64 i) |
|
|
230 | { |
|
|
231 | force (20); // 19 digits + '-' |
|
|
232 | |
|
|
233 | *ptr = '-'; ptr += i < 0 ? 1 : 0; |
|
|
234 | uint64 u = i < 0 ? -i : i; |
| 160 | |
235 | |
| 161 | if (i < 0) |
236 | if (i < 0) |
| 162 | { |
237 | { |
| 163 | neg = '-'; |
238 | fadd ('-'); |
| 164 | val = -i; |
239 | u = -i; |
| 165 | } |
240 | } |
| 166 | else |
241 | else |
| 167 | { |
|
|
| 168 | neg = 0; |
|
|
| 169 | val = i; |
242 | u = i; |
|
|
243 | |
|
|
244 | // split the number into a 1-digit part |
|
|
245 | // (#19) and two 9 digit parts (9..18 and 0..8) |
|
|
246 | |
|
|
247 | // good compilers will only use multiplications here |
|
|
248 | |
|
|
249 | if (u < 10) // we have a lot of single-digit numbers, so optimise |
|
|
250 | fadd (char (u + '0')); |
|
|
251 | else if (expect_true (u < 1000000000)) // 9 0's |
|
|
252 | ptr = i2a_9 (ptr, u, false); |
|
|
253 | else if (expect_true (u < UINT64_C (1000000000000000000))) // 18 0's |
| 170 | } |
254 | { |
| 171 | |
|
|
| 172 | do |
|
|
| 173 | { |
|
|
| 174 | uint32 div = val / 10; |
255 | sint32 div = u / 1000000000; |
| 175 | *--p = '0' + char (val - div * 10); |
256 | uint32 rem = u % 1000000000; |
| 176 | |
257 | |
| 177 | val = div; |
258 | ptr = i2a_9 (ptr, div, false); |
| 178 | } |
259 | ptr = i2a_9 (ptr, rem, true); |
| 179 | while (val); |
|
|
| 180 | |
|
|
| 181 | if (neg) |
|
|
| 182 | *--p = neg; |
|
|
| 183 | |
|
|
| 184 | add ((void *) p, buf + sizeof (buf) - p); |
|
|
| 185 | } |
|
|
| 186 | |
|
|
| 187 | void |
|
|
| 188 | dynbuf_text::add (sint64 i) |
|
|
| 189 | { |
|
|
| 190 | if (i > -10000000 && i < 10000000) |
|
|
| 191 | { |
|
|
| 192 | add (sint32 (i)); |
|
|
| 193 | return; |
|
|
| 194 | } |
|
|
| 195 | |
|
|
| 196 | char buf[max_sint64_size]; |
|
|
| 197 | char *p = buf + sizeof (buf); |
|
|
| 198 | char neg; |
|
|
| 199 | |
|
|
| 200 | uint64 val; |
|
|
| 201 | |
|
|
| 202 | if (i < 0) |
|
|
| 203 | { |
|
|
| 204 | neg = '-'; |
|
|
| 205 | val = -i; |
|
|
| 206 | } |
260 | } |
| 207 | else |
261 | else |
| 208 | { |
262 | { |
| 209 | neg = 0; |
263 | // a biggy |
| 210 | val = i; |
264 | sint32 div = u / UINT64_C (1000000000000000000); |
| 211 | } |
265 | uint64 rem = u % UINT64_C (1000000000000000000); |
| 212 | |
266 | |
| 213 | do |
267 | fadd (char (div + '0')); |
|
|
268 | u = rem; |
|
|
269 | |
| 214 | { |
270 | { |
| 215 | uint64 div = val / 10; |
271 | sint32 div = u / 1000000000; |
| 216 | *--p = '0' + char (val - div * 10); |
272 | uint32 rem = u % 1000000000; |
| 217 | |
273 | |
| 218 | val = div; |
274 | ptr = i2a_9 (ptr, div, true); |
|
|
275 | ptr = i2a_9 (ptr, rem, true); |
| 219 | } |
276 | } |
| 220 | while (val); |
277 | } |
| 221 | |
|
|
| 222 | if (neg) |
|
|
| 223 | *--p = neg; |
|
|
| 224 | |
|
|
| 225 | add ((void *) p, buf + sizeof (buf) - p); |
|
|
| 226 | } |
278 | } |
|
|
279 | |
|
|
280 | #if 0 |
|
|
281 | struct dynbuf_test_class { |
|
|
282 | dynbuf_test_class () |
|
|
283 | { |
|
|
284 | sint64 s = 0; |
|
|
285 | for (int i = 0; i < 10000000; ++i) |
|
|
286 | { |
|
|
287 | char b1[256], b2[256]; |
|
|
288 | |
|
|
289 | dynbuf_text db; |
|
|
290 | db.add (s); |
|
|
291 | db.add (char (0)); |
|
|
292 | |
|
|
293 | db.linearise (b1); |
|
|
294 | sprintf (b2, "%ld", s); |
|
|
295 | |
|
|
296 | if (strcmp (b1, b2)) |
|
|
297 | printf ("<%s,%s>\n", b1, b2); |
|
|
298 | |
|
|
299 | if (i < 20) |
|
|
300 | s = (sint64) pow (10., i); |
|
|
301 | else |
|
|
302 | s = (sint64) exp (random () * (43.6682723752766 / RAND_MAX)); |
|
|
303 | } |
|
|
304 | |
|
|
305 | exit (0); |
|
|
306 | } |
|
|
307 | } dynbuf_test; |
|
|
308 | #endif |
