/usr/include/dieharder/diehard_opso.h is in libdieharder-dev 3.31.1-4.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 | /*
* diehard_opso test header.
*/
/*
* function prototype
*/
int diehard_opso(Test **test, int irun);
static Dtest diehard_opso_dtest __attribute__((unused)) = {
"Diehard OPSO",
"diehard_opso",
"\
#==================================================================\n\
# Diehard Overlapping Pairs Sparse Occupance (OPSO)\n\
# The OPSO test considers 2-letter words from an alphabet of \n\
# 1024 letters. Each letter is determined by a specified ten \n\
# bits from a 32-bit integer in the sequence to be tested. OPSO \n\
# generates 2^21 (overlapping) 2-letter words (from 2^21+1 \n\
# \"keystrokes\") and counts the number of missing words---that \n\
# is 2-letter words which do not appear in the entire sequence. \n\
# That count should be very close to normally distributed with \n\
# mean 141,909, sigma 290. Thus (missingwrds-141909)/290 should \n\
# be a standard normal variable. The OPSO test takes 32 bits at \n\
# a time from the test file and uses a designated set of ten \n\
# consecutive bits. It then restarts the file for the next de- \n\
# signated 10 bits, and so on. \n\
# \n\
# Note 2^21 = 2097152, tsamples cannot be varied.\n\
#==================================================================\n",
100,
2097152,
1,
diehard_opso,
0
};
|