Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(563)

Side by Side Diff: crosstest/test_vector_ops_main.cpp

Issue 435353002: Subzero: Fix and clean up some cross tests. (Closed) Base URL: https://gerrit.chromium.org/gerrit/p/native_client/pnacl-subzero.git@master
Patch Set: Fix newlines and filename Created 6 years, 4 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
« no previous file with comments | « crosstest/test_vector_ops.def ('k') | crosstest/vectors.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
1 //===- subzero/crosstest/test_vector_ops_main.cpp - Driver for tests ------===// 1 //===- subzero/crosstest/test_vector_ops_main.cpp - Driver for tests ------===//
2 // 2 //
3 // The Subzero Code Generator 3 // The Subzero Code Generator
4 // 4 //
5 // This file is distributed under the University of Illinois Open Source 5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details. 6 // License. See LICENSE.TXT for details.
7 // 7 //
8 //===----------------------------------------------------------------------===// 8 //===----------------------------------------------------------------------===//
9 // 9 //
10 // Driver for crosstesting insertelement and extractelement operations 10 // Driver for crosstesting insertelement and extractelement operations
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after
46 Ty Max; 46 Ty Max;
47 for (int I = 0; I < VectorOps<T>::NumElements; ++I) 47 for (int I = 0; I < VectorOps<T>::NumElements; ++I)
48 Max[I] = std::numeric_limits<ElementTy>::max(); 48 Max[I] = std::numeric_limits<ElementTy>::max();
49 Ty TestVectors[] = {Zero, Incr, Decr, Min, Max}; 49 Ty TestVectors[] = {Zero, Incr, Decr, Min, Max};
50 50
51 NumTestVectors = sizeof(TestVectors) / sizeof(Ty); 51 NumTestVectors = sizeof(TestVectors) / sizeof(Ty);
52 52
53 const size_t VECTOR_ALIGNMENT = 16; 53 const size_t VECTOR_ALIGNMENT = 16;
54 void *Dest; 54 void *Dest;
55 if (posix_memalign(&Dest, VECTOR_ALIGNMENT, sizeof(TestVectors))) { 55 if (posix_memalign(&Dest, VECTOR_ALIGNMENT, sizeof(TestVectors))) {
56 std::cerr << "memory allocation error" << std::endl; 56 std::cerr << "memory allocation error\n";
57 abort(); 57 abort();
58 } 58 }
59 59
60 memcpy(Dest, TestVectors, sizeof(TestVectors)); 60 memcpy(Dest, TestVectors, sizeof(TestVectors));
61 61
62 return static_cast<Ty *>(Dest); 62 return static_cast<Ty *>(Dest);
63 } 63 }
64 64
65 template <typename T> 65 template <typename T>
66 void testInsertElement(size_t &TotalTests, size_t &Passes, size_t &Failures) { 66 void testInsertElement(size_t &TotalTests, size_t &Passes, size_t &Failures) {
(...skipping 15 matching lines...) Expand all
82 Ty ResultLlc = VectorOps<T>::insertelement(Vect, Elt, I); 82 Ty ResultLlc = VectorOps<T>::insertelement(Vect, Elt, I);
83 Ty ResultSz = VectorOps<T>::Subzero_insertelement(Vect, Elt, I); 83 Ty ResultSz = VectorOps<T>::Subzero_insertelement(Vect, Elt, I);
84 ++TotalTests; 84 ++TotalTests;
85 if (!memcmp(&ResultLlc, &ResultSz, sizeof(ResultLlc))) { 85 if (!memcmp(&ResultLlc, &ResultSz, sizeof(ResultLlc))) {
86 ++Passes; 86 ++Passes;
87 } else { 87 } else {
88 ++Failures; 88 ++Failures;
89 std::cout << "insertelement<" << VectorOps<T>::TypeName << ">(Vect="; 89 std::cout << "insertelement<" << VectorOps<T>::TypeName << ">(Vect=";
90 std::cout << vectAsString<T>(Vect) 90 std::cout << vectAsString<T>(Vect)
91 << ", Element=" << (typename VectorOps<T>::CastTy)Elt 91 << ", Element=" << (typename VectorOps<T>::CastTy)Elt
92 << ", Pos=" << I << ")" << std::endl; 92 << ", Pos=" << I << ")\n";
93 std::cout << "llc=" << vectAsString<T>(ResultLlc) << std::endl; 93 std::cout << "llc=" << vectAsString<T>(ResultLlc) << "\n";
94 std::cout << "sz =" << vectAsString<T>(ResultSz) << std::endl; 94 std::cout << "sz =" << vectAsString<T>(ResultSz) << "\n";
95 } 95 }
96 } 96 }
97 } 97 }
98 } 98 }
99 99
100 free(TestVectors); 100 free(TestVectors);
101 } 101 }
102 102
103 template <typename T> 103 template <typename T>
104 void testExtractElement(size_t &TotalTests, size_t &Passes, size_t &Failures) { 104 void testExtractElement(size_t &TotalTests, size_t &Passes, size_t &Failures) {
105 typedef typename VectorOps<T>::Ty Ty; 105 typedef typename VectorOps<T>::Ty Ty;
106 typedef typename VectorOps<T>::ElementTy ElementTy; 106 typedef typename VectorOps<T>::ElementTy ElementTy;
107 typedef typename VectorOps<T>::CastTy CastTy; 107 typedef typename VectorOps<T>::CastTy CastTy;
108 108
109 size_t NumTestVectors; 109 size_t NumTestVectors;
110 Ty *TestVectors = getTestVectors<T>(NumTestVectors); 110 Ty *TestVectors = getTestVectors<T>(NumTestVectors);
111 111
112 for (size_t VI = 0; VI < NumTestVectors; ++VI) { 112 for (size_t VI = 0; VI < NumTestVectors; ++VI) {
113 Ty Vect = TestVectors[VI]; 113 Ty Vect = TestVectors[VI];
114 for (size_t I = 0; I < VectorOps<T>::NumElements; ++I) { 114 for (size_t I = 0; I < VectorOps<T>::NumElements; ++I) {
115 CastTy ResultLlc = VectorOps<T>::extractelement(Vect, I); 115 CastTy ResultLlc = VectorOps<T>::extractelement(Vect, I);
116 CastTy ResultSz = VectorOps<T>::Subzero_extractelement(Vect, I); 116 CastTy ResultSz = VectorOps<T>::Subzero_extractelement(Vect, I);
117 ++TotalTests; 117 ++TotalTests;
118 if (!memcmp(&ResultLlc, &ResultSz, sizeof(ResultLlc))) { 118 if (!memcmp(&ResultLlc, &ResultSz, sizeof(ResultLlc))) {
119 ++Passes; 119 ++Passes;
120 } else { 120 } else {
121 ++Failures; 121 ++Failures;
122 std::cout << "extractelement<" << VectorOps<T>::TypeName << ">(Vect="; 122 std::cout << "extractelement<" << VectorOps<T>::TypeName << ">(Vect=";
123 std::cout << vectAsString<T>(Vect) << ", Pos=" << I << ")" << std::endl; 123 std::cout << vectAsString<T>(Vect) << ", Pos=" << I << ")\n";
124 std::cout << "llc=" << ResultLlc << std::endl; 124 std::cout << "llc=" << ResultLlc << "\n";
125 std::cout << "sz =" << ResultSz << std::endl; 125 std::cout << "sz =" << ResultSz << "\n";
126 } 126 }
127 } 127 }
128 } 128 }
129 129
130 free(TestVectors); 130 free(TestVectors);
131 } 131 }
132 132
133 int main(int argc, char *argv[]) { 133 int main(int argc, char *argv[]) {
134 size_t TotalTests = 0; 134 size_t TotalTests = 0;
135 size_t Passes = 0; 135 size_t Passes = 0;
(...skipping 23 matching lines...) Expand all
159 159
160 std::cout << "TotalTests=" << TotalTests << " Passes=" << Passes 160 std::cout << "TotalTests=" << TotalTests << " Passes=" << Passes
161 << " Failures=" << Failures << "\n"; 161 << " Failures=" << Failures << "\n";
162 162
163 return Failures; 163 return Failures;
164 } 164 }
165 165
166 extern "C" { 166 extern "C" {
167 167
168 void ice_unreachable(void) { 168 void ice_unreachable(void) {
169 std::cerr << "\"unreachable\" instruction encountered" << std::endl; 169 std::cerr << "\"unreachable\" instruction encountered\n";
170 abort(); 170 abort();
171 } 171 }
172 } 172 }
OLDNEW
« no previous file with comments | « crosstest/test_vector_ops.def ('k') | crosstest/vectors.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698