blob: 0eaa28f1baf6e1d8eb5b471ef4c08bfe43bd0242 (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
#include "klee/util/ArrayCache.h"
#include "klee/util/Assignment.h"
#include "gtest/gtest.h"
#include <iostream>
#include <vector>
int finished = 0;
using namespace klee;
TEST(AssignmentTest, FoldNotOptimized)
{
ArrayCache ac;
const Array* array = ac.CreateArray("simple_array", /*size=*/ 1);
// Create a simple assignment
std::vector<const Array*> objects;
std::vector<unsigned char> value;
std::vector< std::vector<unsigned char> > values;
objects.push_back(array);
value.push_back(128);
values.push_back(value);
// We want to simplify to a constant so allow free values so
// if the assignment is incomplete we don't get back a constant.
Assignment assignment(objects, values, /*_allowFreeValues=*/true);
// Now make an expression that reads from the array at position
// zero.
ref<Expr> read = NotOptimizedExpr::alloc(Expr::createTempRead(array, Expr::Int8));
// Now evaluate. The OptimizedExpr should be folded
ref<Expr> evaluated = assignment.evaluate(read);
const ConstantExpr* asConstant = dyn_cast<ConstantExpr>(evaluated);
ASSERT_TRUE(asConstant != NULL);
ASSERT_EQ(asConstant->getZExtValue(), (unsigned) 128);
}
|