This file is indexed.

/usr/include/dieharder/diehard_rank_6x8.h is in libdieharder-dev 3.31.1-2.

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
/*
 * diehard_rank_6x8 test header.
 */

/*
 * function prototype
 */
int diehard_rank_6x8(Test **test,int irun);

static Dtest diehard_rank_6x8_dtest __attribute__((unused)) = {
  "Diehard 6x8 Binary Rank Test",
  "diehard_rank_6x8",
  "\n\
#==================================================================\n\
#              Diehard 6x8 Binary Rank Test\n\
# This is the BINARY RANK TEST for 6x8 matrices.  From each of\n\
# six random 32-bit integers from the generator under test, a\n\
# specified byte is chosen, and the resulting six bytes form a\n\
# 6x8 binary matrix whose rank is determined.  That rank can be\n\
# from 0 to 6, but ranks 0,1,2,3 are rare; their counts are\n\
# pooled with those for rank 4. Ranks are found for 100,000\n\
# random matrices, and a chi-square test is performed on\n\
# counts for ranks 6,5 and <=4.\n\
#\n\
# As always, the test is repeated and a KS test applied to the\n\
# resulting p-values to verify that they are approximately uniform.\n\
#==================================================================\n",
  100,
  100000,
  1,
  diehard_rank_6x8,
  0
};