/*  Written in 2019 by Sebastiano Vigna (vigna@acm.org)

To the extent possible under law, the author has dedicated all copyright
and related and neighboring rights to this software to the public domain
worldwide. This software is distributed without any warranty.

See <http://creativecommons.org/publicdomain/zero/1.0/>. */

#include <stdint.h>

// You can play with this value on your architecture
#define XOROSHIRO128_UNROLL (4)

/* The current state of the generators. */
static uint64_t s[2][XOROSHIRO128_UNROLL];

static __inline uint64_t rotl(const uint64_t x, int k) {
	return (x << k) | (x >> (64 - k));
}

uint64_t result[1000];

static inline uint64_t next(uint64_t * const restrict array, int len) {
 	uint64_t s1[XOROSHIRO128_UNROLL];

	for(int b = 0; b < len; b += XOROSHIRO128_UNROLL) {
		for(int i = 0; i < XOROSHIRO128_UNROLL; i++) array[b + i] = rotl(s[0][i] + s[1][i], 17) + s[0][i];
		for(int i = 0; i < XOROSHIRO128_UNROLL; i++) s1[i] = s[0][i] ^ s[1][i];
		for(int i = 0; i < XOROSHIRO128_UNROLL; i++) s[0][i] = rotl(s[0][i], 49) ^ s1[i] ^ (s1[i] << 21);
		for(int i = 0; i < XOROSHIRO128_UNROLL; i++) s[1][i] = rotl(s1[i], 28);
	}

	// This is just to avoid dead-code elimination
	return array[0] ^ array[len - 1];
}

#define INIT for(int i = 0; i < XOROSHIRO128_UNROLL; i++) s[0][i] = 1 << i;
#define NEXT next(result, 1000);
#include "harness.c"