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
|
/*
* Copyright 2018 Garrett D'Amore <garrett@damore.org>
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom
* the Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included
* in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*/
/*
* This file is intended to test the framework. It also demonstrates
* some of the capabilities.
*/
#include "convey.h"
#include <stdlib.h>
#include <string.h>
Main({
/*
* The ordering test demonstrates the execution order.
* At the end of each inner Convey, we roll back up the stack
* to the root, and then start over, bypassing Convey blocks
* that have already completed. Note that if a Convey block
* is the last thing in an enclosing Convey, we will make
* one more pass all the way through until we bypass that last
* item and can close the outer Convey.
*/
Test("Ordering", {
/*
* The buffer has to be static because don't want to clear
* it with each new pass -- that would defeat our tests!
* Note that it starts zeroed (C standard).
*/
static char buffer[32];
static int bufidx;
Convey("A runs first", { buffer[bufidx++] = 'A'; });
Printf("Bufidx is now %d", 1);
buffer[bufidx++] = '1';
Convey("B runs after A", {
So(strlen(buffer) > 0);
So(buffer[bufidx - 1] == '1');
buffer[bufidx++] = 'B';
Convey("C runs inside B", {
So(buffer[bufidx - 1] == 'B');
buffer[bufidx++] = 'C';
});
});
Convey("D runs afer A, B, C.", {
So(buffer[bufidx - 1] == '1');
buffer[bufidx++] = 'D';
});
buffer[bufidx++] = '2';
Convey("E is last", {
So(buffer[bufidx - 1] == '2');
buffer[bufidx++] = 'E';
});
So(strcmp(buffer, "A1BC1B1D12E12") == 0);
});
Test("Skipping works", {
int skipped = 0;
SkipConvey("ConveySkip works.", { So(skipped = 0); });
So(skipped == 0);
Convey("Assertion skipping works.", { SkipSo(skipped == 1); });
So(skipped == 0);
});
Test("Reset", {
static int x;
Convey("Initialize X to a non-zero value", {
So(x == 0);
x = 1;
So(x == 1);
});
Reset({ x = 20; });
Convey("Verify that reset did not get called", {
So(x == 1);
x = 5;
So(x == 5);
});
Convey("But now it did", { So(x == 20); });
});
/* save the current status so we can override */
int oldrv = convey_main_rv;
Test("Failures work", {
Convey("Assertion failure works",
{ Convey("Injected failure", { So(1 == 0); }); });
Convey("ConveyFail works", { ConveyFail("forced failure"); });
Convey("ConveyError works", { ConveyError("forced error"); });
});
/* Override the result variable to reset failure. */
convey_main_rv = oldrv;
Test("Environment works", {
Convey("PATH environment", {
So(ConveyGetEnv("PATH") != NULL);
So(strlen(ConveyGetEnv("PATH")) != 0);
});
Convey("Command line args work", {
char *v1 = ConveyGetEnv("ANOTHERNAME");
char *v2 = ConveyGetEnv("AGAIN");
if (ConveyGetEnv("NAMETEST") == NULL) {
SkipSo(v1 != NULL);
SkipSo(v2 != NULL);
SkipSo(strcmp(v1, "") == 0);
SkipSo(strcmp(v2, "YES") == 0);
} else {
So(v1 != NULL);
So(v2 != NULL);
So(strcmp(v1, "") == 0);
So(strcmp(v2, "YES") == 0);
}
})
});
})
|
