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
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
/* See LICENSE file for copyright and license details. */
#include "common.h"
#ifndef TEST
/**
* See `.inverse` in `struct libnormalform_sentence` (TRUE implementation)
*/
static LIBNORMALFORM_SENTENCE *
true_inverse(LIBNORMALFORM_SENTENCE *this)
{
(void) this;
return libnormalform_false();
}
/**
* See `.equals` in `struct libnormalform_sentence` (TRUE implementation)
*/
static int
true_equals(LIBNORMALFORM_SENTENCE *this, LIBNORMALFORM_SENTENCE *other, int *inv_out)
{
(void) this;
if (other->type == TYPE_TRUE) {
*inv_out = 0;
return 1;
} else if (other->type == TYPE_FALSE) {
*inv_out = 1;
return 1;
} else {
return 0;
}
}
/**
* See `.evaluate` in `struct libnormalform_sentence` (TRUE implementation)
*/
CONST static int
true_evaluate(LIBNORMALFORM_SENTENCE *this, void *input)
{
(void) this;
(void) input;
return 1;
}
LIBNORMALFORM_SENTENCE *
(libnormalform_true)(void)
{
static const struct libnormalform_sentence prototype = {
PROTOTYPE_COMMON,
.type = TYPE_TRUE,
.hash = TRUE_FALSE_HASH,
.inverse = &true_inverse,
.equals = &true_equals,
.evaluate = &true_evaluate
};
/*
* During normalisation, some fields may be set,
* therefore a new allocation is returned instead
* of a reference to a static allocation, so that
* converation can be done from the threads at
* the same time on different sentences, both
* including this constant.
*/
LIBNORMALFORM_SENTENCE *ret = malloc(sizeof(*ret));
if (ret)
*ret = prototype;
return ret;
}
#else
static int
tautology(void *user_data, void *input)
{
(void) user_data;
(void) input;
return 1;
}
static int
contradiction(void *user_data, void *input)
{
(void) user_data;
(void) input;
return 0;
}
int
main(void)
{
TEST_BEGIN;
struct libnormalform_variable var1, var2;
struct libnormalform_function fun1, fun2;
struct libnormalform_map domain;
LIBNORMALFORM_SENTENCE *a, *b, *v1, *v2, *f1, *f2;
var1.value = LIBNORMALFORM_FALSE;
var2.value = LIBNORMALFORM_TRUE;
fun1.evaluate = &tautology;
fun2.evaluate = &contradiction;
ASSUME(v1 = libnormalform_variable(&var1));
ASSUME(v2 = libnormalform_variable(&var2));
ASSUME(f1 = libnormalform_function(&fun1));
ASSUME(f2 = libnormalform_function(&fun2));
ASSUME(a = libnormalform_true());
ASSERT(a->type == TYPE_TRUE);
ASSERT(a->refcount == 1);
ASSERT_EQUAL(a, a);
ASSERT(a->evaluate(a, NULL) == 1);
#define CHECK(CMP, X)\
do {\
ASSUME(b = (X));\
ASSERT_##CMP(a, b);\
libnormalform_free(b);\
} while (0)
CHECK(EQUAL, libnormalform_true());
CHECK(INVEQUAL, libnormalform_false());
CHECK(NOTEQUAL, libnormalform_and2(REF(v1), REF(v2)));
CHECK(NOTEQUAL, libnormalform_or2(REF(v1), REF(v2)));
CHECK(NOTEQUAL, libnormalform_xor2(REF(v1), REF(v2)));
CHECK(NOTEQUAL, libnormalform_all(&domain, REF(f1), REF(f2)));
CHECK(NOTEQUAL, libnormalform_any(&domain, REF(f1), REF(f2)));
CHECK(NOTEQUAL, libnormalform_one(&domain, REF(f1), REF(f2)));
CHECK(NOTEQUAL, libnormalform_not(libnormalform_one(&domain, REF(f1), REF(f2))));
CHECK(NOTEQUAL, REF(v1));
CHECK(NOTEQUAL, REF(f1));
#undef CHECK
libnormalform_free(a);
libnormalform_free(v1);
libnormalform_free(v2);
libnormalform_free(f1);
libnormalform_free(f2);
TEST_END;
}
#endif
|
