1 // Copyright 2019 Google LLC
2 //
3 // Licensed under the Apache License, Version 2.0 (the "License");
4 // you may not use this file except in compliance with the License.
5 // You may obtain a copy of the License at
6 //
7 // http://www.apache.org/licenses/LICENSE-2.0
8 //
9 // Unless required by applicable law or agreed to in writing, software
10 // distributed under the License is distributed on an "AS IS" BASIS,
11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 // See the License for the specific language governing permissions and
13 // limitations under the License.
14
15 #include <cstddef>
16 #include <cstdint>
17 #include <cstdlib>
18 #include <string>
19
20 #include "Eigen/Core"
21
22 using ::Eigen::Matrix;
23 using ::Eigen::Dynamic;
24 using ::Eigen::Lower;
25 using ::Eigen::Upper;
26
ConsumeNextInt(const uint8_t ** data,size_t * size)27 int ConsumeNextInt(const uint8_t** data, size_t* size) {
28 if (*size < sizeof(int)) {
29 return 0;
30 }
31 int result;
32 memcpy(&result, *data, sizeof(int));
33 *size -= sizeof(int);
34 *data += sizeof(int);
35 return result;
36 }
37
LLVMFuzzerTestOneInput(const uint8_t * data,size_t size)38 extern "C" int LLVMFuzzerTestOneInput(const uint8_t* data, size_t size) {
39 const size_t rows = static_cast<size_t>(ConsumeNextInt(&data, &size));
40 const size_t columns = static_cast<size_t>(ConsumeNextInt(&data, &size));
41
42 if (rows == 0 || columns == 0) {
43 return 0;
44 }
45 if (rows > 1024 || columns > 1024) {
46 return 0;
47 }
48
49 // We can do this same fuzz test with other templated types. Here, we just use
50 // an int.
51 Matrix<int, Dynamic, 1> vec(rows);
52 for (size_t i = 0; i < rows; ++i) {
53 vec(i) = ConsumeNextInt(&data, &size);
54 }
55 Matrix<int, Dynamic, Dynamic> matrix(rows, columns);
56 for (int i = 0; i < rows; ++i) {
57 for (int j = 0; j < columns; ++j) {
58 matrix(i, j) = ConsumeNextInt(&data, &size);
59 }
60 }
61
62 matrix.template triangularView<Lower>().solve(vec);
63 matrix.template triangularView<Upper>().solve(vec);
64 matrix.conjugate().template triangularView<Lower>().solve(vec);
65 matrix.conjugate().template triangularView<Upper>().solve(vec);
66 matrix.transpose().template triangularView<Lower>().solve(vec);
67 matrix.transpose().template triangularView<Upper>().solve(vec);
68
69 return 0;
70 }
71