/*

* Portions Copyright (c) 2009 Nokia Corporation and/or its subsidiary(-ies).

* All rights reserved.

* This component and the accompanying materials are made available

* under the terms of "Eclipse Public License v1.0"

* which accompanies this distribution, and is available

* at the URL "http://www.eclipse.org/legal/epl-v10.html".

*

* Initial Contributors:

* Nokia Corporation - initial contribution.

*

* Contributors:

*

* Description: 

* The original NIST Statistical Test Suite code is placed in public domain.

* (http://csrc.nist.gov/groups/ST/toolkit/rng/documentation_software.html) 

* 

* This software was developed at the National Institute of Standards and Technology by 

* employees of the Federal Government in the course of their official duties. Pursuant

* to title 17 Section 105 of the United States Code this software is not subject to 

* copyright protection and is in the public domain. The NIST Statistical Test Suite is

* an experimental system. NIST assumes no responsibility whatsoever for its use by other 

* parties, and makes no guarantees, expressed or implied, about its quality, reliability, 

* or any other characteristic. We would appreciate acknowledgment if the software is used.

*/

#include "openc.h"

#include "../include/externs.h"

#include "../include/cephes.h"

#include "../include/matrix.h"

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *

                              R A N K  T E S T

 * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */

void

Rank(int n)

{

	int			N, i, k, r;

	double		p_value, product, chi_squared, arg1, p_32, p_31, p_30, R, F_32, F_31, F_30;

	N = n/(32*32);

	if ( isZero(N) ) {

		fprintf(stats[TEST_RANK], "\t\t\t\tRANK TEST\n");

		fprintf(stats[TEST_RANK], "\t\tError: Insuffucient # Of Bits To Define An 32x32 (%dx%d) Matrix\n", 32, 32);

		p_value = 0.00;

	}

	else {

        BitSequence **matrix = create_matrix(32, 32);

        r = 32;					/* COMPUTE PROBABILITIES */

		product = 1;

		for ( i=0; i<=r-1; i++ )

			product *= ((1.e0-pow(2, i-32))*(1.e0-pow(2, i-32)))/(1.e0-pow(2, i-r));

		p_32 = pow(2, r*(32+32-r)-32*32) * product;

		r = 31;

		product = 1;

		for ( i=0; i<=r-1; i++ )

			product *= ((1.e0-pow(2, i-32))*(1.e0-pow(2, i-32)))/(1.e0-pow(2, i-r));

		p_31 = pow(2, r*(32+32-r)-32*32) * product;

		p_30 = 1 - (p_32+p_31);

		F_32 = 0;

		F_31 = 0;

		for ( k=0; k<N; k++ ) {			/* FOR EACH 32x32 MATRIX   */

			def_matrix(32, 32, matrix, k);

#if (DISPLAY_MATRICES == 1)

			display_matrix(32, 32, matrix);

#endif

			R = computeRank(32, 32, matrix);

			if ( R == 32 )

				F_32++;			/* DETERMINE FREQUENCIES */

			if ( R == 31 )

				F_31++;

		}

		F_30 = (double)N - (F_32+F_31);

		chi_squared =(pow(F_32 - N*p_32, 2)/(double)(N*p_32) +

					  pow(F_31 - N*p_31, 2)/(double)(N*p_31) +

					  pow(F_30 - N*p_30, 2)/(double)(N*p_30));

		arg1 = -chi_squared/2.e0;

		fprintf(stats[TEST_RANK], "\t\t\t\tRANK TEST\n");

		fprintf(stats[TEST_RANK], "\t\t---------------------------------------------\n");

		fprintf(stats[TEST_RANK], "\t\tCOMPUTATIONAL INFORMATION:\n");

		fprintf(stats[TEST_RANK], "\t\t---------------------------------------------\n");

		fprintf(stats[TEST_RANK], "\t\t(a) Probability P_%d = %f\n", 32,p_32);

		fprintf(stats[TEST_RANK], "\t\t(b)             P_%d = %f\n", 31,p_31);

		fprintf(stats[TEST_RANK], "\t\t(c)             P_%d = %f\n", 30,p_30);

		fprintf(stats[TEST_RANK], "\t\t(d) Frequency   F_%d = %d\n", 32,(int)F_32);

		fprintf(stats[TEST_RANK], "\t\t(e)             F_%d = %d\n", 31,(int)F_31);

		fprintf(stats[TEST_RANK], "\t\t(f)             F_%d = %d\n", 30,(int)F_30);

		fprintf(stats[TEST_RANK], "\t\t(g) # of matrices    = %d\n", N);

		fprintf(stats[TEST_RANK], "\t\t(h) Chi^2            = %f\n", chi_squared);

		fprintf(stats[TEST_RANK], "\t\t(i) NOTE: %d BITS WERE DISCARDED.\n", n%(32*32));

		fprintf(stats[TEST_RANK], "\t\t---------------------------------------------\n");

		p_value = exp(arg1);

		if ( isNegative(p_value) || isGreaterThanOne(p_value) )

			fprintf(stats[TEST_RANK], "WARNING:  P_VALUE IS OUT OF RANGE.\n");

		for ( i=0; i<32; i++ )				/* DEALLOCATE MATRIX  */

			free(matrix[i]);

		free(matrix);

	}

	fprintf(stats[TEST_RANK], "%s\t\tp_value = %f\n\n", p_value < ALPHA ? "FAILURE" : "SUCCESS", p_value);

	fprintf(results[TEST_RANK], "%f\n", p_value);

}