#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
#include <math.h>
#include <ctype.h>
#include <string.h>
#include <signal.h>
#include <sys/types.h>
#include <sys/time.h>
#include <sys/resource.h>
#include <unistd.h>
#include <errno.h>

#include "gmp.h"

#define MY_ALLOC(t, n)		((t *) my_alloc((n) * sizeof(t)))

static void *my_alloc(size_t sz)
{
    void *p;

    if (sz == 0) {
	++sz;
    }
    p = malloc(sz);
    if (p == NULL) {
	fprintf(stderr, "out of memory\n");
	exit(1);
    }
    return(p);
}

static int stop = 0;
static int reload = 0;

static void sig_handler(int sig)
{
    if (sig == SIGTERM || sig == SIGALRM) {
	stop = 1;
    }
    if (sig == SIGHUP) {
	reload = 1;
    }
    signal(SIGTERM, sig_handler);
    signal(SIGALRM, sig_handler);
    signal(SIGHUP, sig_handler);
}

/* k goes from 1 to 1e7, or about 24 bits, l goes from 1 to about 3.6e10,
   or about 36 bits, we want to evaluate S = k*(k^2 + 3*l^2)/4, but only
   up to about 1e21, so overall we're under about 2^70. */

typedef struct big_num {
    uint32_t lo;
    uint64_t hi;
} bignum;

typedef struct triple {
    uint32_t i;
    uint64_t j;
    bignum s;
} triple_type;

typedef struct triple_chain {
    unsigned short length;
    unsigned short max;
    triple_type *chain;
} chain_type;

#define MASK_14		0x3fff
#define MASK_20		0xfffff
#define MASK_32		0xffffffff

static __inline__ void gen_sum(uint32_t k, uint64_t l, uint32_t* lo, uint64_t* hi)
{
    uint64_t t0, t1, t2, i0, i1, i2, i3;
    uint32_t l0, l1, k0, k1;

    l0 = l & MASK_20;
    l1 = (l >> 20) & MASK_20;
    k0 = k & MASK_20;
    k1 = (k >> 20) & MASK_20;
    i0 = k0;
    i1 = l0;
    i2 = k1;
    i3 = l1;
    t0 = i0*i0 + 3*i1*i1;
    t1 = 2*i0*i2 + 6*i1*i3;
    t2 = i2*i2 + 3*i3*i3;
    i0 = k0*t0;
    i1 = k0*t1 + k1*t0;
    i2 = k0*t2 + k1*t1;
    i3 = k1*t2;
    if (i0%4 != 0) {
	fprintf(stderr,
		"fatal error! division by 4 failed: inputs are %lu,%llu\n",
		(unsigned long) k, (unsigned long long) l);
	printf("fatal error! division by 4 failed: inputs are %lu,%llu\n",
	       (unsigned long) k, (unsigned long long) l);
	exit(1);
    }
    i0 /= 4;
    t0 = (i0 & MASK_32) + ((i1 & MASK_14) << 18);
    *lo = t0 & MASK_32;
    *hi = (t0 >> 32) + (i0 >> 32) + (i1 >> 14) + (i2 << 6) + (i3 << 26);
}

#ifdef CHECK_WITH_GMP
#define MASK_SIZE	20
#define MASK		0xfffff

static mpz_t t0, t1, t2;

static __inline__ void gen_sum_1(uint32_t k, uint64_t l, uint32_t* lo, uint64_t* hi)
{
    unsigned long il, ih, ij;

    il = l & MASK;
    ih = (l >> MASK_SIZE) & MASK;

    mpz_set_ui(t0, ih);
    mpz_mul_2exp(t0, t0, MASK_SIZE);
    mpz_add_ui(t0, t0, il);

    mpz_pow_ui(t1, t0, 2);
    mpz_mul_ui(t0, t1, 3);

    mpz_set_ui(t1, k);
    mpz_pow_ui(t1, t1, 2);
    mpz_add(t0, t0, t1);
    mpz_mul_ui(t2, t0, k);

    ij = mpz_fdiv_ui(t2, 4);
    if (ij != 0) {
	fprintf(stderr,
		"fatal error! division by 4 failed: inputs are %lu,%llu\n",
		(unsigned long) k, (unsigned long long) l);
	printf("fatal error! division by 4 failed: inputs are %lu,%llu\n",
	       (unsigned long) k, (unsigned long long) l);
	exit(1);
    }
    mpz_div_2exp(t1, t2, 2);

    il = mpz_fdiv_q_ui(t0, t1, (1 << 16));
    ih = mpz_fdiv_q_ui(t1, t0, (1 << 16));
    *lo = il + (ih << 16);

    il = mpz_fdiv_q_ui(t0, t1, (1 << 16));
    ih = mpz_fdiv_q_ui(t1, t0, (1 << 16));
    ij = mpz_fdiv_q_ui(t0, t1, (1 << 16));
    *hi = (((unsigned long long) ij) << 32) + (ih << 16) + il;
}
#endif /* CHECK_WITH_GMP */

static __inline__ int bignum_compare(bignum *p1, bignum *p2)
{
    if (p1->hi < p2->hi) {
	return(-1);
    } else if (p1->hi > p2->hi) {
	return(+1);
    } else {
	if (p1->lo < p2->lo) {
	    return(-1);
	} else if (p1->lo > p2->lo) {
	    return(+1);
	} else {
	    return(0);
	}
    }
}

static int triple_compare(const void *p1, const void *p2)
{
    return(bignum_compare(&(((triple_type *) p1)->s),
			  &(((triple_type *) p2)->s)));
}

static void read_bignum(char *str, struct big_num *v)
{
    char buf[200];
    int i;
    uint64_t lo, hi;
    unsigned long long rhi;
    unsigned long rlo;

    strcpy(buf, str);
    str = strchr(buf, 'e');
    if (str == NULL) {
	str = strchr(buf, 'E');
    }
    if (str) {
	i = atoi(str + 1);
	if (i <= 0 || i > 99) {
	    fprintf(stderr, "error: bad exponent %d\n", i);
	    exit(1);
	}
	while (i--) {
	    *str++ = '0';
	}
	*str = '\0';
    }
    if (strchr(buf, ':')) {
	if (sscanf(buf, "%llu:%lu", &rhi, &rlo) != 2) {
	    fprintf(stderr, "error: bad input number %s\n", buf);
	    exit(1);
	}
	lo = rlo;
	hi = rhi;
    } else {
	str = buf;
	lo = 0;
	hi = 0;
	while (*str && isdigit(*str)) {
	    lo = 10*lo + (*str - '0');
	    hi = 10*hi + (lo >> 32);
	    lo &= 0xffffffff;
	    ++str;
	}
    }
    v->hi = hi;
    v->lo = lo;
}

static double my_cbrt(double val)
{
    if (val < 0.0) {
	return(-exp((1.0/3.0)*log(-val)));
    } else if (val > 0.0) {
	return(exp((1.0/3.0)*log(val)));
    } else {
	return(0.0);
    }
}

static uint64_t gcd(int64_t a, int64_t b)
{
    uint64_t t;

    a = (a < 0) ? -a : a;
    b = (b < 0) ? -b : b;
    while (b) {
	t = b;
	b = a%b;
	a = t;
    }
    return(a);
}

static mpz_t tprint;

static void write_bignum(bignum *v, FILE *fp)
{
    mpz_set_ui(tprint, (unsigned long) ((v->hi >> 32) & 0xffffffff));
    mpz_mul_2exp(tprint, tprint, 32);
    mpz_add_ui(tprint, tprint, (unsigned long) (v->hi & 0xffffffff));
    mpz_mul_2exp(tprint, tprint, 32);
    mpz_add_ui(tprint, tprint, (unsigned long) (v->lo & 0xffffffff));
    mpz_out_str(fp, 10, tprint);
}

static double diff_time(struct timeval end, struct timeval start)
{
    double e, s;

    e = ((double) end.tv_sec + ((double) end.tv_usec / 1.0e6));
    s = ((double) start.tv_sec + ((double) start.tv_usec / 1.0e6));
    return (e - s);
}

/* table of small primes, for checking primality of exponents */

static uint32_t small_primes[] = {
    2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67,
    71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149,
    151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
    233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313,
    317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
    419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499,
    503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601,
    607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691,
    701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
    811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907,
    911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009,
    1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087,
    1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171,
    1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259,
    1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327,
    1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447,
    1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523,
    1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607,
    1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697,
    1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787,
    1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879,
    1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993,
    1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081,
    2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153,
    2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269,
    2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351,
    2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437,
    2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549,
    2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659,
    2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719,
    2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803,
    2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909,
    2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019,
    3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121,
    3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229,
    3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329,
    3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433,
    3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529,
    3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613,
    3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701,
    3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803,
    3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911,
    3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007,
    4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099,
    4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217,
    4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289,
    4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421,
    4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517,
    4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637,
    4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723,
    4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817,
    4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943,
    4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021,
    5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119,
    5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237,
    5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381,
    5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449,
    5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557,
    5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657,
    5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749,
    5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851,
    5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953,
    5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079,
    6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197,
    6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277,
    6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361,
    6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481,
    6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599,
    6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703,
    6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823,
    6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911,
    6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001,
    7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127,
    7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237,
    7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351,
    7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489,
    7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573,
    7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673,
    7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759,
    7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883,
    7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011,
    8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117,
    8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233,
    8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329,
    8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447,
    8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581,
    8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681,
    8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761,
    8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863,
    8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999,
    9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103,
    9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203,
    9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319,
    9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419,
    9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497,
    9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629,
    9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739,
    9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833,
    9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931,
    9941, 9949, 9967, 9973, 10007
};

#define N_PRIMES	(sizeof(small_primes)/sizeof(uint32_t))

static int is_prime(uint32_t n)
{
    int i, lo, hi;
    uint32_t j;

    j = small_primes[N_PRIMES-1];
    if (n <= j) {
	lo = 0;
	hi = N_PRIMES-1;
	while (hi >= lo) {
	    i = (hi + lo)/2;
	    if (small_primes[i] == n) {
		return(1);
	    } else if (small_primes[i] > n) {
		hi = i - 1;
	    } else {
		lo = i + 1;
	    }
	}
	return(0);
    } else {
	j = 1 + (int) ceil(sqrt((double) n));
	for (i = 0; i < N_PRIMES; ++i) {
	    if (n%small_primes[i] == 0) {
		return(0);
	    }
	    if (small_primes[i] > j) {
		return(1);
	    }
	}
    }
    fprintf(stderr, "internal error: table overflow in is_prime(%lu)\n",
	(unsigned long) n);
    exit(1);
}

static void load_params(uint64_t *incr, int *numbers, int *sizes)
{
    char buf[200];
    unsigned long long incl;
    FILE *fp;

    fp = fopen("ari4.params", "r");
    if (fp) {
	fprintf(stderr, "reloading params\n");
	fgets(buf, sizeof(buf), fp);
	if (sscanf(buf, "%llu", &incl) != 1) {
	    fprintf(stderr, "error while reading incr\n");
	    exit(1);
	}
	*incr = (uint64_t) incl;
	fgets(buf, sizeof(buf), fp);
	if (sscanf(buf, "%d %d", numbers + 0, sizes + 0) != 2) {
	    fprintf(stderr, "error while reading small numbers & sizes\n");
	    exit(1);
	}
	fgets(buf, sizeof(buf), fp);
	if (sscanf(buf, "%d %d", numbers + 1, sizes + 1) != 2) {
	    fprintf(stderr, "error while reading med numbers & sizes\n");
	    exit(1);
	}
	fgets(buf, sizeof(buf), fp);
	if (sscanf(buf, "%d %d", numbers + 2, sizes + 2) != 2) {
	    fprintf(stderr, "error while reading large numbers & sizes\n");
	    exit(1);
	}
	fprintf(stderr, "done\n");
	if (numbers[0] < small_primes[N_PRIMES-1]*small_primes[N_PRIMES-1]) {
	    while (!is_prime((uint32_t) numbers[0])) {
		++numbers[0];
	    }
	    fprintf(stderr, "resetting main arena size to %d\n", numbers[0]);
	} else {
	    fprintf(stderr,
		"main arena size is very big, can't check it...\n");
	}
	fclose(fp);
	fprintf(stderr, "new params are:\n  %d %d\n  %d %d\n  %d %d\n",
		numbers[0], sizes[0], numbers[1],
		sizes[1], numbers[2], sizes[2]);
	if (numbers[0] < 1 || numbers[1] < 1 || numbers[2] < 1 ||
	    sizes[0] < 1 || sizes[1] < 1 || sizes[2] < 1 ||
	    sizes[1] <= sizes[0] || sizes[2] <= sizes[1]) {
	    fprintf(stderr, "fatal error: bad parameter values!\n");
	    exit(1);
	}
    } else {
	fprintf(stderr, "error %d while loading params\n", errno);
	exit(1);
    }
}

#define N_COUNT		10

#define MIN_RUN		3

int main(int argc, char **argv)
{
    int rlen, i, k, l, i2, count, ml, il,
	numbers[3], sizes[3], alloc[3],
	n_count, alloc_count[N_COUNT];
    double dlo, dhi, d1, d3, cpu, elapsed;
    uint64_t j, jl, jh, g1, g2,  incr, llo;
    int64_t r1, r2, r3, r4, run[32];
    chain_type *handles, *hp;
    triple_type *trip, *small_buckets, *med_buckets, *large_buckets;
    bignum lo, hi, end, sum;
#ifdef CHECK_WITH_GMP
    bignum sum1;
#endif /* CHECK_WITH_GMP */
    struct rusage begin_cpu, end_cpu;
    struct timeval begin_elapsed, end_elapsed;

#ifdef CHECK_WITH_GMP
    mpz_init(t0);
    mpz_init(t1);
    mpz_init(t2);
#endif /* CHECK_WITH_GMP */
    mpz_init(tprint);

#if 0	/* don't do this on raksha, it causes speedstep to run at 1/3 speed */
    if (setpriority(PRIO_PROCESS, 0, 19)) {
	fprintf(stderr, "renicing failed: %d\n", errno);
	exit(1);
    }
#endif /* 0 */
    if (argc < 2) {
	fprintf(stderr, "usage: %s start\n", argv[0]);
	exit(0);
    }
    read_bignum(argv[1], &lo);
    dlo = ldexp((double) lo.hi, 32) + (double) lo.lo;
    if (argc > 2) {
	read_bignum(argv[2], &end);
	++end.hi;
    } else {
	end.lo = 0;
	end.hi = 1;
	end.hi <<= 60;
    }
    sig_handler(0);
    handles = NULL;
    small_buckets = NULL;
    med_buckets = NULL;
    large_buckets = NULL;
    reload = 1;
    getrusage(RUSAGE_SELF, &begin_cpu);
    gettimeofday(&begin_elapsed, NULL);
    n_count = 0;
    for (i = 0; i < N_COUNT; ++i) {
	alloc_count[i] = 0;
    }
    incr = ((uint64_t) 1) << 48;
    while (1) {
      top_of_loop:
	if (bignum_compare(&lo, &end) >= 0) {
	    break;
	}
	if (reload) {
	    reload = 0;
	    free(handles);
	    free(small_buckets);
	    free(med_buckets);
	    free(large_buckets);
	    load_params(&incr, numbers, sizes);
	    handles = MY_ALLOC(chain_type, numbers[0]);
	    small_buckets = MY_ALLOC(triple_type, numbers[0]*sizes[0]);
	    med_buckets = MY_ALLOC(triple_type, numbers[1]*sizes[1]);
	    large_buckets = MY_ALLOC(triple_type, numbers[2]*sizes[2]);
	}
	for (i = 0; i < numbers[0]; ++i) {
	    handles[i].length = 0;
	    handles[i].max = sizes[0];
	    handles[i].chain = small_buckets + sizes[0]*i;
	}
	alloc[1] = 0;
	alloc[2] = 0;
	hi.hi = lo.hi;
	llo = lo.lo + incr;
	hi.hi += (llo >> 32);
	hi.lo = llo & 0xffffffff;
	if (bignum_compare(&hi, &end) > 0) {
	    hi.lo = end.lo;
	    hi.hi = end.hi;
	}
	fputs("scan ", stderr);
	write_bignum(&lo, stderr);
	dlo = ldexp((double) lo.hi, 32) + (double) lo.lo;
	dhi = ldexp((double) hi.hi, 32) + (double) hi.lo;
	dlo *= 4.0;
	dhi *= 4.0;
	i2 = ceil(my_cbrt(dhi));
	count = 0;
	for (i = 1; i <= i2; ++i) {
	    d1 = (double) i;
	    d3 = d1*d1*d1;
	    if (dlo <= d3) {
		jl = 0;
	    } else {
		jl = floor(sqrt((dlo - d3)/(3.0*d1)) - 2.0);
	    }
	    if (jl > 0 && (jl%2) != (i%2)) {
		--jl;
	    }
	    if (jl < i%2) {
		jl = i%2;
	    }
	    if (dhi <= d3) {
		jh = 0;
	    } else {
		jh = ceil(sqrt((dhi - d3)/(3.0*d1)) + 2.0);
	    }
	    for (j = jl; j <= jh; j += 2) {
		gen_sum(i, j, &(sum.lo), &(sum.hi));
#ifdef CHECK_WITH_GMP
		gen_sum_1(i, j, &(sum1.lo), &(sum1.hi));
		if (sum.lo != sum1.lo ||
		    sum.hi != sum1.hi) {
		    fprintf(stderr,
			    "sums mismatch!\n\t%lu %llu b\n\t%lu %llu g\n",
			    (unsigned long) sum.lo, sum.hi,
			    (unsigned long) sum1.lo, sum1.hi);
		    exit(1);
		}
#endif /* CHECK_WITH_GMP */
		if (bignum_compare(&sum, &lo) < 0) {
		    continue;
		}
		if (bignum_compare(&sum, &hi) > 0) {
		    break;
		}
		++count;
		k = sum.lo % numbers[0];
		hp = handles + k;
		if (hp->length == hp->max) {
		    if (hp->max == sizes[0]) {
			if (alloc[1] < numbers[1]) {
			    trip = med_buckets + sizes[1]*alloc[1];
			    ++alloc[1];
			    memcpy(trip, hp->chain,
				   sizes[0]*sizeof(triple_type));
			    hp->chain = trip;
			    hp->max = sizes[1];
			    if (hp->length >= hp->max) {
				fprintf(stderr,
					"fatal error! array overrun\n");
				exit(1);
			    }
			} else {
			    incr *= 0.95;
			    fprintf(stderr,
				" no more room in pool 1!"
				" tweak incr down %llu\n",
				(unsigned long long) incr);
			    n_count = 0;
			    goto top_of_loop;
			}
		    } else if (hp->max == sizes[1]) {
			if (alloc[2] < numbers[2]) {
			    trip = large_buckets + sizes[2]*alloc[2];
			    ++alloc[2];
			    memcpy(trip, hp->chain,
				   sizes[1]*sizeof(triple_type));
			    hp->chain = trip;
			    hp->max = sizes[2];
			    if (hp->length >= hp->max) {
				fprintf(stderr,
					"fatal error! array overrun\n");
				exit(1);
			    }
			} else {
			    incr *= 0.95;
			    fprintf(stderr,
				" no more room in pool 2!"
				" tweak incr down %llu\n",
				(unsigned long long) incr);
			    n_count = 0;
			    goto top_of_loop;
			}
		    } else {
			incr *= 0.95;
			fprintf(stderr,
			    " no jumbo pools! tweak incr down %llu\n",
			    (unsigned long long) incr);
			n_count = 0;
			goto top_of_loop;
		    }
		}
		hp->chain[hp->length].i = i;
		hp->chain[hp->length].j = j;
		hp->chain[hp->length].s.lo = sum.lo;
		hp->chain[hp->length].s.hi = sum.hi;
		++hp->length;
	    }
	}
	lo.hi = hi.hi;
	lo.lo = hi.lo;
	ml = 0;
	il = -1;
	for (i = 0; i < numbers[0]; ++i) {
	    if (handles[i].length >= MIN_RUN) {
		hp = handles + i;
		qsort(hp->chain, hp->length,
		      sizeof(triple_type), triple_compare);
		j = 0;
		trip = hp->chain;
		k = 1;
		while (k < hp->length) {
		    while (bignum_compare(&(trip->s),
					  &(hp->chain[k].s)) == 0) {
			++k;
			if (k == hp->length) {
			    break;
			}
		    }
		    if (k - j >= MIN_RUN) {
			sum = trip->s;
			rlen = 0;
			g1 = 0;
			while (j < k) {
			    r1 = trip->i;
			    r2 = trip->j;
			    r3 = (r1 - r2)/2;
			    r4 = (r1 + r2)/2;
			    run[rlen++] = r3;
			    run[rlen++] = r4;
			    g2 = gcd(r3, r4);
			    g1 = (g1 == 0) ? g2 : gcd(g1, g2);
			    ++trip;
			    ++j;
			}
			if (g1 == 1) {
			    write_bignum(&sum, stdout);
			    putchar('\t');
			    for (l = 0; l < rlen; ++l) {
				if (l) {
				    putchar(' ');
				}
				printf("%lld", (long long) run[l]);
			    }
			    putchar('\n');
			}
		    }
		    j = k;
		    trip = hp->chain + k;
		    k = j + 1;
		}
	    }
	    if (ml < handles[i].length) {
		ml = handles[i].length;
		il = i;
	    }
	}
	fflush(NULL);
	getrusage(RUSAGE_SELF, &end_cpu);
	gettimeofday(&end_elapsed, NULL);
	cpu = diff_time(end_cpu.ru_utime, begin_cpu.ru_utime)
	    + diff_time(end_cpu.ru_stime, begin_cpu.ru_stime);
	elapsed = diff_time(end_elapsed, begin_elapsed);
	begin_cpu = end_cpu;
	begin_elapsed = end_elapsed;
	fprintf(stderr,
	    " rate %.2e %.2e ml %d alloc %d/%d\n",
	    ((double) incr)/cpu, ((double) incr)/elapsed,
	    ml, alloc[1], alloc[2]);
	alloc_count[n_count%N_COUNT] = alloc[1];
	++n_count;
	if (n_count >= N_COUNT) {
	    j = 0;
	    for (i = 0; i < N_COUNT; ++i) {
		j = (j < alloc_count[i]) ? alloc_count[i] : j;
	    }
	    if (j < numbers[1] - 20000) {
		incr *= 1.001;
		fprintf(stderr, "tweak incr up %llu\n",
			(unsigned long long) incr);
	    } else if (j > numbers[1] - 10000) {
		incr *= 0.997;
		fprintf(stderr, "tweak incr down %llu\n",
			(unsigned long long) incr);
		n_count = 0;
	    }
	}
	if (stop) {
	    break;
	}
    }
    return(0);
}