multithreading tests from 152 lab 5
[riscv-tests.git] / mt / bt_vvadd / bt_vvadd.c
1 //**************************************************************************
2 // Vector-vector add benchmark
3 //--------------------------------------------------------------------------
4 // Author : Andrew Waterman
5 // TA : Christopher Celio
6 // Student :
7 //
8 // This benchmark adds two vectors and writes the results to a
9 // third vector. The input data (and reference data) should be
10 // generated using the vvadd_gendata.pl perl script and dumped
11 // to a file named dataset.h
12
13 // to print out arrays, etc.
14 //#define DEBUG
15
16 //--------------------------------------------------------------------------
17 // Includes
18
19 #include <string.h>
20 #include <stdlib.h>
21 #include <stdio.h>
22
23
24 //--------------------------------------------------------------------------
25 // Input/Reference Data
26
27 typedef float data_t;
28 #include "dataset.h"
29
30
31 //--------------------------------------------------------------------------
32 // Basic Utilities and Multi-thread Support
33
34 __thread unsigned long coreid;
35 unsigned long ncores;
36
37 #include "util.h"
38
39 #define stringify_1(s) #s
40 #define stringify(s) stringify_1(s)
41 #define stats(code) do { \
42 unsigned long _c = -rdcycle(), _i = -rdinstret(); \
43 code; \
44 _c += rdcycle(), _i += rdinstret(); \
45 if (coreid == 0) \
46 printf("%s: %ld cycles, %ld.%ld cycles/iter, %ld.%ld CPI\n", \
47 stringify(code), _c, _c/DATA_SIZE, 10*_c/DATA_SIZE%10, _c/_i, 10*_c/_i%10); \
48 } while(0)
49
50
51 //--------------------------------------------------------------------------
52 // Helper functions
53
54 void printArray( char name[], int n, data_t arr[] )
55 {
56 int i;
57 if (coreid != 0)
58 return;
59
60 printf( " %10s :", name );
61 for ( i = 0; i < n; i++ )
62 printf( " %4ld ", (long) arr[i] );
63 printf( "\n" );
64 }
65
66 void __attribute__((noinline)) verify(size_t n, const data_t* test, const data_t* correct)
67 {
68 if (coreid != 0)
69 return;
70
71 size_t i;
72 for (i = 0; i < n; i++)
73 {
74 if (test[i] != correct[i])
75 {
76 printf("FAILED test[%d]= %4ld, correct[%d]= %4ld\n",
77 i, (long) test[i], i, (long)correct[i]);
78 exit(-1);
79 }
80 }
81
82 return;
83 }
84
85 //--------------------------------------------------------------------------
86 // vvadd function
87
88 //perform in-place vvadd
89 void __attribute__((noinline)) vvadd(size_t n, data_t* __restrict__ x, const data_t* __restrict__ y)
90 {
91 size_t i;
92
93 // interleave accesses
94 for (i = coreid; i < n; i+=ncores)
95 {
96 x[i] = x[i] + y[i];
97 }
98 }
99
100 void __attribute__((noinline)) vvadd_opt(size_t n, data_t* __restrict__ x, const data_t* __restrict__ y)
101 {
102 // ***************************** //
103 size_t i;
104 size_t chunk_size = n/ncores;
105 size_t start = chunk_size * coreid;
106 size_t end = start + chunk_size;
107
108 for( i = start ; i < end; i++ )
109 {
110 x[i]=x[i]+y[i];
111 }
112 // ***************************** //
113 }
114
115 //--------------------------------------------------------------------------
116 // Main
117 //
118 // all threads start executing thread_entry(). Use their "coreid" to
119 // differentiate between threads (each thread is running on a separate core).
120
121 void thread_entry(int cid, int nc)
122 {
123 coreid = cid;
124 ncores = nc;
125
126 // static allocates data in the binary, which is visible to both threads
127 static data_t results_data[DATA_SIZE];
128
129 // because we're going to perform an in-place vvadd (and we're going to run
130 // it a couple of times) let's copy the input data to a temporary results
131 // array
132
133 size_t i;
134 if (coreid == 0)
135 {
136 for (i = 0; i < DATA_SIZE; i++)
137 results_data[i] = input1_data[i];
138 }
139
140
141 // Execute the provided, terrible vvadd
142 barrier();
143 stats(vvadd(DATA_SIZE, results_data, input2_data); barrier());
144
145
146 // verify
147 verify(DATA_SIZE, results_data, verify_data);
148
149 // reset results from the first trial
150 if (coreid == 0)
151 {
152 for (i=0; i < DATA_SIZE; i++)
153 results_data[i] = input1_data[i];
154 }
155 barrier();
156
157
158 // Execute your faster vvadd
159 barrier();
160 stats(vvadd_opt(DATA_SIZE, results_data, input2_data); barrier());
161
162 #ifdef DEBUG
163 printArray("results: ", DATA_SIZE, results_data);
164 printArray("verify : ", DATA_SIZE, verify_data);
165 #endif
166
167 // verify
168 verify(DATA_SIZE, results_data, verify_data);
169 barrier();
170
171 exit(0);
172 }
173