@@ -24,7 +24,7 @@ TEST_F(test, baseAllocLinearAllocMoreThanPoolSize) {
24
24
25
25
size_t new_size = 20 * 1024 * 1024 ; // = 20 MB
26
26
void *ptr = umf_ba_linear_alloc (pool.get (), new_size);
27
- UT_ASSERTne (ptr, NULL );
27
+ ASSERT_NE (ptr, nullptr );
28
28
memset (ptr, 0 , new_size);
29
29
30
30
umf_ba_linear_free (pool.get (), ptr);
@@ -37,15 +37,14 @@ TEST_F(test, baseAllocLinearPoolContainsPointer) {
37
37
38
38
size_t size = 16 ;
39
39
void *ptr = umf_ba_linear_alloc (pool.get (), size);
40
- UT_ASSERTne (ptr, NULL );
40
+ ASSERT_NE (ptr, nullptr );
41
41
memset (ptr, 0 , size);
42
-
43
42
// assert pool contains pointer ptr
44
- UT_ASSERTne (umf_ba_linear_pool_contains_pointer (pool.get (), ptr), 0 );
43
+ ASSERT_NE (umf_ba_linear_pool_contains_pointer (pool.get (), ptr), 0 );
45
44
46
45
// assert pool does NOT contain pointer 0x0123
47
- UT_ASSERTeq (umf_ba_linear_pool_contains_pointer (pool.get (), (void *)0x0123 ),
48
- 0 );
46
+ ASSERT_EQ (umf_ba_linear_pool_contains_pointer (pool.get (), (void *)0x0123 ),
47
+ 0 );
49
48
50
49
umf_ba_linear_free (pool.get (), ptr);
51
50
}
@@ -78,14 +77,14 @@ TEST_F(test, baseAllocLinearMultiThreadedAllocMemset) {
78
77
(rand () / (double )RAND_MAX));
79
78
buffer[i].size = size;
80
79
buffer[i].ptr = (unsigned char *)umf_ba_linear_alloc (pool, size);
81
- UT_ASSERTne (buffer[i].ptr , NULL );
80
+ ASSERT_NE (buffer[i].ptr , nullptr );
82
81
memset (buffer[i].ptr , (i + TID) & 0xFF , buffer[i].size );
83
82
}
84
83
85
84
for (int i = 0 ; i < ITERATIONS; i++) {
86
- UT_ASSERTne (buffer[i].ptr , NULL );
85
+ ASSERT_NE (buffer[i].ptr , nullptr );
87
86
for (size_t k = 0 ; k < buffer[i].size ; k++) {
88
- UT_ASSERTeq (*(buffer[i].ptr + k), (i + TID) & 0xFF );
87
+ ASSERT_EQ (*(buffer[i].ptr + k), (i + TID) & 0xFF );
89
88
}
90
89
}
91
90
0 commit comments