ports/math/dieharder/patches/patch-libdieharder_dab_filltree_c

21 lines
883 B
Text

Index: libdieharder/dab_filltree.c
--- libdieharder/dab_filltree.c.orig
+++ libdieharder/dab_filltree.c
@@ -34,7 +34,7 @@ static double targetData[] = {
0.0, 0.0, 0.0, 0.0, 0.13333333, 0.20000000, 0.20634921, 0.17857143, 0.13007085, 0.08183633, 0.04338395, 0.01851828, 0.00617270, 0.00151193, 0.00023520, 0.00001680, 0.00000000, 0.00000000, 0.00000000, 0.00000000
};
-inline int insert(double x, double *array, unsigned int startVal);
+static inline int insert(double x, double *array, unsigned int startVal);
int dab_filltree(Test **test,int irun) {
int size = (ntuple == 0) ? 32 : ntuple;
@@ -105,7 +105,7 @@ int dab_filltree(Test **test,int irun) {
}
-inline int insert(double x, double *array, unsigned int startVal) {
+static inline int insert(double x, double *array, unsigned int startVal) {
uint d = (startVal + 1) / 2;
uint i = startVal;
while (d > 0) {