root / src / grid / HPL_sum.c
Historique | Voir | Annoter | Télécharger (4,86 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_sum
|
54 | 1 | equemene | ( |
55 | 1 | equemene | const int N, |
56 | 1 | equemene | const void * IN, |
57 | 1 | equemene | void * INOUT,
|
58 | 1 | equemene | const HPL_T_TYPE DTYPE
|
59 | 1 | equemene | ) |
60 | 1 | equemene | #else
|
61 | 1 | equemene | void HPL_sum
|
62 | 1 | equemene | ( N, IN, INOUT, DTYPE ) |
63 | 1 | equemene | const int N; |
64 | 1 | equemene | const void * IN; |
65 | 1 | equemene | void * INOUT;
|
66 | 1 | equemene | const HPL_T_TYPE DTYPE;
|
67 | 1 | equemene | #endif
|
68 | 1 | equemene | { |
69 | 1 | equemene | /*
|
70 | 1 | equemene | * Purpose
|
71 | 1 | equemene | * =======
|
72 | 1 | equemene | *
|
73 | 1 | equemene | * HPL_sum combines (sum) two buffers.
|
74 | 1 | equemene | *
|
75 | 1 | equemene | *
|
76 | 1 | equemene | * Arguments
|
77 | 1 | equemene | * =========
|
78 | 1 | equemene | *
|
79 | 1 | equemene | * N (input) const int
|
80 | 1 | equemene | * On entry, N specifies the length of the buffers to be
|
81 | 1 | equemene | * combined. N must be at least zero.
|
82 | 1 | equemene | *
|
83 | 1 | equemene | * IN (input) const void *
|
84 | 1 | equemene | * On entry, IN points to the input-only buffer to be combined.
|
85 | 1 | equemene | *
|
86 | 1 | equemene | * INOUT (input/output) void *
|
87 | 1 | equemene | * On entry, INOUT points to the input-output buffer to be
|
88 | 1 | equemene | * combined. On exit, the entries of this array contains the
|
89 | 1 | equemene | * combined results.
|
90 | 1 | equemene | *
|
91 | 1 | equemene | * DTYPE (input) const HPL_T_TYPE
|
92 | 1 | equemene | * On entry, DTYPE specifies the type of the buffers operands.
|
93 | 1 | equemene | *
|
94 | 1 | equemene | * ---------------------------------------------------------------------
|
95 | 1 | equemene | */
|
96 | 1 | equemene | /*
|
97 | 1 | equemene | * .. Local Variables ..
|
98 | 1 | equemene | */
|
99 | 1 | equemene | register int i; |
100 | 1 | equemene | /* ..
|
101 | 1 | equemene | * .. Executable Statements ..
|
102 | 1 | equemene | */
|
103 | 1 | equemene | if( DTYPE == HPL_INT )
|
104 | 1 | equemene | { |
105 | 1 | equemene | const int * a = (const int *)(IN); |
106 | 1 | equemene | int * b = (int *)(INOUT); |
107 | 1 | equemene | for( i = 0; i < N; i++ ) b[i] += a[i]; |
108 | 1 | equemene | } |
109 | 1 | equemene | else
|
110 | 1 | equemene | { |
111 | 1 | equemene | const double * a = (const double *)(IN); |
112 | 1 | equemene | double * b = (double *)(INOUT); |
113 | 1 | equemene | for( i = 0; i < N; i++ ) b[i] += a[i]; |
114 | 1 | equemene | } |
115 | 1 | equemene | /*
|
116 | 1 | equemene | * End of HPL_sum
|
117 | 1 | equemene | */
|
118 | 1 | equemene | } |