d843d432d3
The printer and formatter objects are not trusted code. We moved them to the kernel to be able to provide them as an argument to the trace objects. Another motivation is to eliminate the kernel_exception_formatter hack. With the formatter in the kernel, we can implement the pretty printer for kernel exceptions as a virtual method. Signed-off-by: Leonardo de Moura <leonardo@microsoft.com>
118 lines
3.9 KiB
C++
118 lines
3.9 KiB
C++
/*
|
|
Copyright (c) 2013 Microsoft Corporation. All rights reserved.
|
|
Released under Apache 2.0 license as described in the file LICENSE.
|
|
|
|
Author: Leonardo de Moura
|
|
*/
|
|
#include <locale>
|
|
#include "util/test.h"
|
|
#include "util/exception.h"
|
|
#include "kernel/environment.h"
|
|
#include "kernel/printer.h"
|
|
using namespace lean;
|
|
|
|
static void tst0() {
|
|
environment env;
|
|
lean_assert(env.begin_objects() == env.end_objects());
|
|
std::for_each(env.begin_objects(), env.end_objects(), [&](object const & obj) {
|
|
std::cout << obj.keyword() << "\n";
|
|
});
|
|
level l1 = env.add_uvar(name(name("l1"), "suffix"), level());
|
|
lean_assert(env.begin_objects() != env.end_objects());
|
|
std::for_each(env.begin_objects(), env.end_objects(), [&](object const & obj) {
|
|
std::cout << obj.keyword() << "\n";
|
|
});
|
|
std::cout << env;
|
|
}
|
|
|
|
static void tst1() {
|
|
environment env;
|
|
level l1 = env.add_uvar(name(name("l1"), "suffix"), level());
|
|
level l2 = env.add_uvar("l2", l1 + 10);
|
|
level l3 = env.add_uvar("l3", max(l2, l1 + 3));
|
|
level l4 = env.add_uvar("l4", max(l1 + 8, max(l2 + 2, l3 + 20)));
|
|
std::cout << pp(max(l1 + 8, max(l2 + 2, l3 + 20))) << "\n";
|
|
std::cout << pp(level()) << "\n";
|
|
std::cout << pp(level()+1) << "\n";
|
|
std::cout << env;
|
|
lean_assert(env.is_ge(l4 + 10, l3 + 30));
|
|
lean_assert(!env.is_ge(l4 + 9, l3 + 30));
|
|
}
|
|
|
|
static void tst2() {
|
|
environment env;
|
|
level l1 = env.add_uvar("l1", level());
|
|
try {
|
|
level l2 = env.add_uvar("l1", level());
|
|
lean_unreachable();
|
|
}
|
|
catch (exception & ex) {
|
|
std::cout << "ok\n";
|
|
}
|
|
}
|
|
|
|
static void tst3() {
|
|
environment env;
|
|
level l1 = env.add_uvar("l1", level());
|
|
level l2 = env.add_uvar("l2", l1 + ((1<<30) + 1024));
|
|
try {
|
|
level l3 = env.add_uvar("l3", l2 + (1<<30));
|
|
lean_unreachable();
|
|
}
|
|
catch (exception & ex) {
|
|
std::cout << "ok\n";
|
|
}
|
|
}
|
|
|
|
static void tst4() {
|
|
environment env;
|
|
level l1 = env.add_uvar("l1", level() + 1);
|
|
level l2 = env.add_uvar("l2", level() + 1);
|
|
level l3 = env.add_uvar("l3", max(l1, l2) + 1);
|
|
level l4 = env.add_uvar("l4", l3 + 1);
|
|
level l5 = env.add_uvar("l5", l3 + 1);
|
|
level l6 = env.add_uvar("l6", max(l4, l5) + 1);
|
|
lean_assert(!env.is_ge(l5 + 1, l6));
|
|
lean_assert(env.is_ge(l6, l5));
|
|
lean_assert(env.is_ge(l6, max({l1, l2, l3, l4, l5})));
|
|
lean_assert(env.is_ge(l6, l6));
|
|
lean_assert(!env.is_ge(l5, l4));
|
|
lean_assert(env.is_ge(max({l1, l2, l4, l5}), max({l1, l2, l3, l4, l5})));
|
|
lean_assert(env.is_ge(max({l4, l5}), max({l1, l2, l3})));
|
|
lean_assert(!env.is_ge(max({l1, l2, l5}), max({l1, l2, l3, l4, l5})));
|
|
lean_assert(!env.is_ge(max({l2, l4}), max({l1, l2, l3, l4, l5})));
|
|
lean_assert(env.is_ge(max(l2, l3) + 1, max(l1, l1+1)));
|
|
lean_assert(env.is_ge(max(l2, l3) + 1, max(l1+2, l1+1)));
|
|
lean_assert(env.is_ge(max(l2, l3) + 1, max(l2+2, l1+1)));
|
|
lean_assert(!env.is_ge(max(l4, l5) + 1, max(l2+4, l1+1)));
|
|
lean_assert(!env.is_ge(max(l6, l5), max(l2+4, l1+1)));
|
|
lean_assert(env.is_ge(max(l6, l5), max(l2+3, l1+1)));
|
|
lean_assert(!env.is_ge(max(l6, l5), max(l2, l1+1)+3));
|
|
lean_assert(env.is_ge(max(l6+1, l5), max(l2, l1+1)+3));
|
|
std::cout << env;
|
|
}
|
|
|
|
static void tst5() {
|
|
environment env;
|
|
level l1 = env.add_uvar("l1", level() + 1);
|
|
level l2 = env.add_uvar("l2", level() + 1);
|
|
std::cout << max(l1, l1) << "\n";
|
|
lean_assert(max(l1, l1) == l1);
|
|
lean_assert(max(l1+1, l1+1) == l1+1);
|
|
std::cout << max(l1, l1+1) << "\n";
|
|
std::cout << max(l2, max(l1, l1+1)) << "\n";
|
|
lean_assert(max(l1, l1+1) == l1+1);
|
|
lean_assert(max(l2, max(l1, l1+1)) == max(l2, l1+1));
|
|
std::cout << max(l1, max(l2, l1+1)) << "\n";
|
|
lean_assert(max(l1, max(l2, l1+1)) == max(l1+1, l2));
|
|
}
|
|
|
|
int main() {
|
|
tst0();
|
|
tst1();
|
|
tst2();
|
|
tst3();
|
|
tst4();
|
|
tst5();
|
|
return has_violations() ? 1 : 0;
|
|
}
|