root / testing / matgen / HPL_xjumpm.c
Historique | Voir | Annoter | Télécharger (7,29 ko)
| 1 | 1 | equemene | /*
|
|---|---|---|---|
| 2 | 1 | equemene | * -- High Performance Computing Linpack Benchmark (HPL)
|
| 3 | 1 | equemene | * HPL - 2.0 - September 10, 2008
|
| 4 | 1 | equemene | * Antoine P. Petitet
|
| 5 | 1 | equemene | * University of Tennessee, Knoxville
|
| 6 | 1 | equemene | * Innovative Computing Laboratory
|
| 7 | 1 | equemene | * (C) Copyright 2000-2008 All Rights Reserved
|
| 8 | 1 | equemene | *
|
| 9 | 1 | equemene | * -- Copyright notice and Licensing terms:
|
| 10 | 1 | equemene | *
|
| 11 | 1 | equemene | * Redistribution and use in source and binary forms, with or without
|
| 12 | 1 | equemene | * modification, are permitted provided that the following conditions
|
| 13 | 1 | equemene | * are met:
|
| 14 | 1 | equemene | *
|
| 15 | 1 | equemene | * 1. Redistributions of source code must retain the above copyright
|
| 16 | 1 | equemene | * notice, this list of conditions and the following disclaimer.
|
| 17 | 1 | equemene | *
|
| 18 | 1 | equemene | * 2. Redistributions in binary form must reproduce the above copyright
|
| 19 | 1 | equemene | * notice, this list of conditions, and the following disclaimer in the
|
| 20 | 1 | equemene | * documentation and/or other materials provided with the distribution.
|
| 21 | 1 | equemene | *
|
| 22 | 1 | equemene | * 3. All advertising materials mentioning features or use of this
|
| 23 | 1 | equemene | * software must display the following acknowledgement:
|
| 24 | 1 | equemene | * This product includes software developed at the University of
|
| 25 | 1 | equemene | * Tennessee, Knoxville, Innovative Computing Laboratory.
|
| 26 | 1 | equemene | *
|
| 27 | 1 | equemene | * 4. The name of the University, the name of the Laboratory, or the
|
| 28 | 1 | equemene | * names of its contributors may not be used to endorse or promote
|
| 29 | 1 | equemene | * products derived from this software without specific written
|
| 30 | 1 | equemene | * permission.
|
| 31 | 1 | equemene | *
|
| 32 | 1 | equemene | * -- Disclaimer:
|
| 33 | 1 | equemene | *
|
| 34 | 1 | equemene | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
| 35 | 1 | equemene | * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
| 36 | 1 | equemene | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
| 37 | 1 | equemene | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE UNIVERSITY
|
| 38 | 1 | equemene | * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
| 39 | 1 | equemene | * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
| 40 | 1 | equemene | * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
| 41 | 1 | equemene | * DATA OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
| 42 | 1 | equemene | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
| 43 | 1 | equemene | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
| 44 | 1 | equemene | * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
| 45 | 1 | equemene | * ---------------------------------------------------------------------
|
| 46 | 1 | equemene | */
|
| 47 | 1 | equemene | /*
|
| 48 | 1 | equemene | * Include files
|
| 49 | 1 | equemene | */
|
| 50 | 1 | equemene | #include "hpl.h" |
| 51 | 1 | equemene | |
| 52 | 1 | equemene | #ifdef STDC_HEADERS
|
| 53 | 1 | equemene | void HPL_xjumpm
|
| 54 | 1 | equemene | ( |
| 55 | 1 | equemene | const int JUMPM, |
| 56 | 1 | equemene | int * MULT,
|
| 57 | 1 | equemene | int * IADD,
|
| 58 | 1 | equemene | int * IRANN,
|
| 59 | 1 | equemene | int * IRANM,
|
| 60 | 1 | equemene | int * IAM,
|
| 61 | 1 | equemene | int * ICM
|
| 62 | 1 | equemene | ) |
| 63 | 1 | equemene | #else
|
| 64 | 1 | equemene | void HPL_xjumpm
|
| 65 | 1 | equemene | ( JUMPM, MULT, IADD, IRANN, IRANM, IAM, ICM ) |
| 66 | 1 | equemene | const int JUMPM; |
| 67 | 1 | equemene | int * MULT;
|
| 68 | 1 | equemene | int * IADD;
|
| 69 | 1 | equemene | int * IRANN;
|
| 70 | 1 | equemene | int * IRANM;
|
| 71 | 1 | equemene | int * IAM;
|
| 72 | 1 | equemene | int * ICM;
|
| 73 | 1 | equemene | #endif
|
| 74 | 1 | equemene | {
|
| 75 | 1 | equemene | /*
|
| 76 | 1 | equemene | * Purpose
|
| 77 | 1 | equemene | * =======
|
| 78 | 1 | equemene | *
|
| 79 | 1 | equemene | * HPL_xjumpm computes the constants A and C to jump JUMPM numbers in
|
| 80 | 1 | equemene | * the random sequence: X(n+JUMPM) = A*X(n)+C. The constants encoded in
|
| 81 | 1 | equemene | * MULT and IADD specify how to jump from one entry in the sequence to
|
| 82 | 1 | equemene | * the next.
|
| 83 | 1 | equemene | *
|
| 84 | 1 | equemene | * Arguments
|
| 85 | 1 | equemene | * =========
|
| 86 | 1 | equemene | *
|
| 87 | 1 | equemene | * JUMPM (local input) const int
|
| 88 | 1 | equemene | * On entry, JUMPM specifies the number of entries in the
|
| 89 | 1 | equemene | * sequence to jump over. When JUMPM is less or equal than zero,
|
| 90 | 1 | equemene | * A and C are not computed, IRANM is set to IRANN corresponding
|
| 91 | 1 | equemene | * to a jump of size zero.
|
| 92 | 1 | equemene | *
|
| 93 | 1 | equemene | * MULT (local input) int *
|
| 94 | 1 | equemene | * On entry, MULT is an array of dimension 2, that contains the
|
| 95 | 1 | equemene | * 16-lower and 15-higher bits of the constant a to jump from
|
| 96 | 1 | equemene | * X(n) to X(n+1) = a*X(n) + c in the random sequence.
|
| 97 | 1 | equemene | *
|
| 98 | 1 | equemene | * IADD (local input) int *
|
| 99 | 1 | equemene | * On entry, IADD is an array of dimension 2, that contains the
|
| 100 | 1 | equemene | * 16-lower and 15-higher bits of the constant c to jump from
|
| 101 | 1 | equemene | * X(n) to X(n+1) = a*X(n) + c in the random sequence.
|
| 102 | 1 | equemene | *
|
| 103 | 1 | equemene | * IRANN (local input) int *
|
| 104 | 1 | equemene | * On entry, IRANN is an array of dimension 2. that contains the
|
| 105 | 1 | equemene | * 16-lower and 15-higher bits of the encoding of X(n).
|
| 106 | 1 | equemene | *
|
| 107 | 1 | equemene | * IRANM (local output) int *
|
| 108 | 1 | equemene | * On entry, IRANM is an array of dimension 2. On exit, this
|
| 109 | 1 | equemene | * array contains respectively the 16-lower and 15-higher bits
|
| 110 | 1 | equemene | * of the encoding of X(n+JUMPM).
|
| 111 | 1 | equemene | *
|
| 112 | 1 | equemene | * IAM (local output) int *
|
| 113 | 1 | equemene | * On entry, IAM is an array of dimension 2. On exit, when JUMPM
|
| 114 | 1 | equemene | * is greater than zero, this array contains the encoded
|
| 115 | 1 | equemene | * constant A to jump from X(n) to X(n+JUMPM) in the random
|
| 116 | 1 | equemene | * sequence. IAM(0:1) contains respectively the 16-lower and
|
| 117 | 1 | equemene | * 15-higher bits of this constant A. When JUMPM is less or
|
| 118 | 1 | equemene | * equal than zero, this array is not referenced.
|
| 119 | 1 | equemene | *
|
| 120 | 1 | equemene | * ICM (local output) int *
|
| 121 | 1 | equemene | * On entry, ICM is an array of dimension 2. On exit, when JUMPM
|
| 122 | 1 | equemene | * is greater than zero, this array contains the encoded
|
| 123 | 1 | equemene | * constant C to jump from X(n) to X(n+JUMPM) in the random
|
| 124 | 1 | equemene | * sequence. ICM(0:1) contains respectively the 16-lower and
|
| 125 | 1 | equemene | * 15-higher bits of this constant C. When JUMPM is less or
|
| 126 | 1 | equemene | * equal than zero, this array is not referenced.
|
| 127 | 1 | equemene | *
|
| 128 | 1 | equemene | * ---------------------------------------------------------------------
|
| 129 | 1 | equemene | */
|
| 130 | 1 | equemene | /*
|
| 131 | 1 | equemene | * .. Local Variables ..
|
| 132 | 1 | equemene | */
|
| 133 | 1 | equemene | int j[2], k; |
| 134 | 1 | equemene | /* ..
|
| 135 | 1 | equemene | * .. Executable Statements ..
|
| 136 | 1 | equemene | */
|
| 137 | 1 | equemene | if( JUMPM > 0 ) |
| 138 | 1 | equemene | {
|
| 139 | 1 | equemene | IAM[0] = MULT[0]; IAM[1] = MULT[1]; /* IAM = MULT; */ |
| 140 | 1 | equemene | ICM[0] = IADD[0]; ICM[1] = IADD[1]; /* ICM = IADD; */ |
| 141 | 1 | equemene | for( k = 1; k <= JUMPM-1; k++ ) |
| 142 | 1 | equemene | {
|
| 143 | 1 | equemene | HPL_lmul( IAM, MULT, j ); /* j = IAM * MULT; */
|
| 144 | 1 | equemene | IAM[0] = j[0]; IAM[1] = j[1]; /* IAM = j; */ |
| 145 | 1 | equemene | HPL_lmul( ICM, MULT, j ); /* j = ICM * MULT; */
|
| 146 | 1 | equemene | HPL_ladd( IADD, j, ICM ); /* ICM = IADD + j; */
|
| 147 | 1 | equemene | } |
| 148 | 1 | equemene | HPL_lmul( IRANN, IAM, j ); /* j = IRANN * IAM; */
|
| 149 | 1 | equemene | HPL_ladd( j, ICM, IRANM ); /* IRANM = j + ICM; */
|
| 150 | 1 | equemene | } |
| 151 | 1 | equemene | else
|
| 152 | 1 | equemene | { /* IRANM = IRANN */
|
| 153 | 1 | equemene | IRANM[0] = IRANN[0]; IRANM[1] = IRANN[1]; |
| 154 | 1 | equemene | } |
| 155 | 1 | equemene | /*
|
| 156 | 1 | equemene | * End of HPL_xjumpm
|
| 157 | 1 | equemene | */
|
| 158 | 1 | equemene | } |