@@ -6,7 +6,8 @@ license that can be found in the LICENSE file or at
6
6
https://developers.google.com/open-source/licenses/bsd
7
7
*/
8
8
9
- #include "test-lib.h"
9
+ #include "unit-test.h"
10
+ #include "lib-reftable-clar.h"
10
11
#include "reftable/constants.h"
11
12
#include "reftable/pq.h"
12
13
#include "strbuf.h"
@@ -15,26 +16,27 @@ static void merged_iter_pqueue_check(const struct merged_iter_pqueue *pq)
15
16
{
16
17
for (size_t i = 1 ; i < pq -> len ; i ++ ) {
17
18
size_t parent = (i - 1 ) / 2 ;
18
- check (pq_less (& pq -> heap [parent ], & pq -> heap [i ]));
19
+ cl_assert (pq_less (& pq -> heap [parent ], & pq -> heap [i ]) != 0 );
19
20
}
20
21
}
21
22
22
23
static int pq_entry_equal (struct pq_entry * a , struct pq_entry * b )
23
24
{
24
25
int cmp ;
25
- check (! reftable_record_cmp (a -> rec , b -> rec , & cmp ));
26
+ cl_assert_equal_i ( reftable_record_cmp (a -> rec , b -> rec , & cmp ), 0 );
26
27
return !cmp && (a -> index == b -> index );
27
28
}
28
29
29
- static void t_pq_record (void )
30
+ void test_reftable_pq__record (void )
30
31
{
31
32
struct merged_iter_pqueue pq = { 0 };
32
33
struct reftable_record recs [54 ];
33
34
size_t N = ARRAY_SIZE (recs ) - 1 , i ;
34
35
char * last = NULL ;
35
36
36
37
for (i = 0 ; i < N ; i ++ ) {
37
- check (!reftable_record_init (& recs [i ], REFTABLE_BLOCK_TYPE_REF ));
38
+ cl_assert (!reftable_record_init (& recs [i ],
39
+ REFTABLE_BLOCK_TYPE_REF ));
38
40
recs [i ].u .ref .refname = xstrfmt ("%02" PRIuMAX , (uintmax_t )i );
39
41
}
40
42
@@ -53,13 +55,13 @@ static void t_pq_record(void)
53
55
struct pq_entry top = merged_iter_pqueue_top (pq );
54
56
struct pq_entry e ;
55
57
56
- check (! merged_iter_pqueue_remove (& pq , & e ));
58
+ cl_assert_equal_i ( merged_iter_pqueue_remove (& pq , & e ), 0 );
57
59
merged_iter_pqueue_check (& pq );
58
60
59
- check (pq_entry_equal (& top , & e ));
60
- check (reftable_record_type (e .rec ) == REFTABLE_BLOCK_TYPE_REF );
61
+ cl_assert (pq_entry_equal (& top , & e ));
62
+ cl_assert (reftable_record_type (e .rec ) == REFTABLE_BLOCK_TYPE_REF );
61
63
if (last )
62
- check_int (strcmp (last , e .rec -> u .ref .refname ), < , 0 );
64
+ cl_assert (strcmp (last , e .rec -> u .ref .refname ) < 0 );
63
65
last = e .rec -> u .ref .refname ;
64
66
}
65
67
@@ -68,15 +70,16 @@ static void t_pq_record(void)
68
70
merged_iter_pqueue_release (& pq );
69
71
}
70
72
71
- static void t_pq_index (void )
73
+ void test_reftable_pq__index (void )
72
74
{
73
75
struct merged_iter_pqueue pq = { 0 };
74
76
struct reftable_record recs [13 ];
75
77
char * last = NULL ;
76
78
size_t N = ARRAY_SIZE (recs ), i ;
77
79
78
80
for (i = 0 ; i < N ; i ++ ) {
79
- check (!reftable_record_init (& recs [i ], REFTABLE_BLOCK_TYPE_REF ));
81
+ cl_assert (!reftable_record_init (& recs [i ],
82
+ REFTABLE_BLOCK_TYPE_REF ));
80
83
recs [i ].u .ref .refname = (char * ) "refs/heads/master" ;
81
84
}
82
85
@@ -96,28 +99,29 @@ static void t_pq_index(void)
96
99
struct pq_entry top = merged_iter_pqueue_top (pq );
97
100
struct pq_entry e ;
98
101
99
- check (! merged_iter_pqueue_remove (& pq , & e ));
102
+ cl_assert_equal_i ( merged_iter_pqueue_remove (& pq , & e ), 0 );
100
103
merged_iter_pqueue_check (& pq );
101
104
102
- check (pq_entry_equal (& top , & e ));
103
- check (reftable_record_type (e .rec ) == REFTABLE_BLOCK_TYPE_REF );
104
- check_int (e .index , = = , i );
105
+ cl_assert (pq_entry_equal (& top , & e ));
106
+ cl_assert (reftable_record_type (e .rec ) == REFTABLE_BLOCK_TYPE_REF );
107
+ cl_assert_equal_i (e .index , i );
105
108
if (last )
106
- check_str (last , e .rec -> u .ref .refname );
109
+ cl_assert_equal_s (last , e .rec -> u .ref .refname );
107
110
last = e .rec -> u .ref .refname ;
108
111
}
109
112
110
113
merged_iter_pqueue_release (& pq );
111
114
}
112
115
113
- static void t_merged_iter_pqueue_top (void )
116
+ void test_reftable_pq__merged_iter_pqueue_top (void )
114
117
{
115
118
struct merged_iter_pqueue pq = { 0 };
116
119
struct reftable_record recs [13 ];
117
120
size_t N = ARRAY_SIZE (recs ), i ;
118
121
119
122
for (i = 0 ; i < N ; i ++ ) {
120
- check (!reftable_record_init (& recs [i ], REFTABLE_BLOCK_TYPE_REF ));
123
+ cl_assert (!reftable_record_init (& recs [i ],
124
+ REFTABLE_BLOCK_TYPE_REF ));
121
125
recs [i ].u .ref .refname = (char * ) "refs/heads/master" ;
122
126
}
123
127
@@ -137,25 +141,16 @@ static void t_merged_iter_pqueue_top(void)
137
141
struct pq_entry top = merged_iter_pqueue_top (pq );
138
142
struct pq_entry e ;
139
143
140
- check (! merged_iter_pqueue_remove (& pq , & e ));
144
+ cl_assert_equal_i ( merged_iter_pqueue_remove (& pq , & e ), 0 );
141
145
142
146
merged_iter_pqueue_check (& pq );
143
- check (pq_entry_equal (& top , & e ));
144
- check (reftable_record_equal (top .rec , & recs [i ], REFTABLE_HASH_SIZE_SHA1 ));
147
+ cl_assert (pq_entry_equal (& top , & e ) != 0 );
148
+ cl_assert (reftable_record_equal (top .rec , & recs [i ], REFTABLE_HASH_SIZE_SHA1 ) != 0 );
145
149
for (size_t j = 0 ; i < pq .len ; j ++ ) {
146
- check (pq_less (& top , & pq .heap [j ]));
147
- check_int (top .index , > , j );
150
+ cl_assert (pq_less (& top , & pq .heap [j ]) != 0 );
151
+ cl_assert (top .index > j );
148
152
}
149
153
}
150
154
151
155
merged_iter_pqueue_release (& pq );
152
156
}
153
-
154
- int cmd_main (int argc UNUSED , const char * argv [] UNUSED )
155
- {
156
- TEST (t_pq_record (), "pq works with record-based comparison" );
157
- TEST (t_pq_index (), "pq works with index-based comparison" );
158
- TEST (t_merged_iter_pqueue_top (), "merged_iter_pqueue_top works" );
159
-
160
- return test_done ();
161
- }
0 commit comments