array_init(&array, 2);
array_append(&array, c1);
- assert_return(array.count == 1, EXIT_FAILURE);
- assert_return(array.array[0] == c1, EXIT_FAILURE);
+ TS_ASSERT(array.count == 1);
+ TS_ASSERT(array.array[0] == c1);
array_free_array(&array);
return 0;
array_append(&array, c1);
array_append(&array, c2);
array_append(&array, c3);
- assert_return(array.count == 3, EXIT_FAILURE);
- assert_return(array.array[0] == c1, EXIT_FAILURE);
- assert_return(array.array[1] == c2, EXIT_FAILURE);
- assert_return(array.array[2] == c3, EXIT_FAILURE);
+ TS_ASSERT(array.count == 3);
+ TS_ASSERT(array.array[0] == c1);
+ TS_ASSERT(array.array[1] == c2);
+ TS_ASSERT(array.array[2] == c3);
array_free_array(&array);
return 0;
array_append_unique(&array, c3);
array_append_unique(&array, c2);
array_append_unique(&array, c1);
- assert_return(array.count == 3, EXIT_FAILURE);
- assert_return(array.array[0] == c1, EXIT_FAILURE);
- assert_return(array.array[1] == c2, EXIT_FAILURE);
- assert_return(array.array[2] == c3, EXIT_FAILURE);
+ TS_ASSERT(array.count == 3);
+ TS_ASSERT(array.array[0] == c1);
+ TS_ASSERT(array.array[1] == c2);
+ TS_ASSERT(array.array[2] == c3);
array_free_array(&array);
return 0;
array_append(&array, c3);
array_append(&array, c1);
array_sort(&array, strptrcmp);
- assert_return(array.count == 6, EXIT_FAILURE);
- assert_return(array.array[0] == c1, EXIT_FAILURE);
- assert_return(array.array[1] == c1, EXIT_FAILURE);
- assert_return(array.array[2] == c2, EXIT_FAILURE);
- assert_return(array.array[3] == c2, EXIT_FAILURE);
- assert_return(array.array[4] == c3, EXIT_FAILURE);
- assert_return(array.array[5] == c3, EXIT_FAILURE);
+ TS_ASSERT(array.count == 6);
+ TS_ASSERT(array.array[0] == c1);
+ TS_ASSERT(array.array[1] == c1);
+ TS_ASSERT(array.array[2] == c2);
+ TS_ASSERT(array.array[3] == c2);
+ TS_ASSERT(array.array[4] == c3);
+ TS_ASSERT(array.array[5] == c3);
array_free_array(&array);
return 0;
array_append(&array, c3);
array_remove_at(&array, 2);
- assert_return(array.count == 2, EXIT_FAILURE);
- assert_return(array.array[0] == c1, EXIT_FAILURE);
- assert_return(array.array[1] == c2, EXIT_FAILURE);
- assert_return(array.total == 4, EXIT_FAILURE);
+ TS_ASSERT(array.count == 2);
+ TS_ASSERT(array.array[0] == c1);
+ TS_ASSERT(array.array[1] == c2);
+ TS_ASSERT(array.total == 4);
array_remove_at(&array, 0);
- assert_return(array.count == 1, EXIT_FAILURE);
- assert_return(array.array[0] == c2, EXIT_FAILURE);
- assert_return(array.total == 2, EXIT_FAILURE);
+ TS_ASSERT(array.count == 1);
+ TS_ASSERT(array.array[0] == c2);
+ TS_ASSERT(array.total == 2);
array_remove_at(&array, 0);
- assert_return(array.count == 0, EXIT_FAILURE);
- assert_return(array.total == 2, EXIT_FAILURE);
+ TS_ASSERT(array.count == 0);
+ TS_ASSERT(array.total == 2);
array_append(&array, c1);
array_append(&array, c2);
array_append(&array, c3);
array_remove_at(&array, 1);
- assert_return(array.count == 2, EXIT_FAILURE);
- assert_return(array.array[0] == c1, EXIT_FAILURE);
- assert_return(array.array[1] == c3, EXIT_FAILURE);
- assert_return(array.total == 4, EXIT_FAILURE);
+ TS_ASSERT(array.count == 2);
+ TS_ASSERT(array.array[0] == c1);
+ TS_ASSERT(array.array[1] == c3);
+ TS_ASSERT(array.total == 4);
array_free_array(&array);
array_pop(&array);
- assert_return(array.count == 2, EXIT_FAILURE);
- assert_return(array.array[0] == c1, EXIT_FAILURE);
- assert_return(array.array[1] == c2, EXIT_FAILURE);
+ TS_ASSERT(array.count == 2);
+ TS_ASSERT(array.array[0] == c1);
+ TS_ASSERT(array.array[1] == c2);
array_pop(&array);
array_pop(&array);
- assert_return(array.count == 0, EXIT_FAILURE);
+ TS_ASSERT(array.count == 0);
array_pop(&array);
- assert_return(array.count == 0, EXIT_FAILURE);
+ TS_ASSERT(array.count == 0);
array_free_array(&array);
static int test_hash_new(void)
{
struct hash *h = hash_new(8, NULL);
- assert_return(h != NULL, EXIT_FAILURE);
+ TS_ASSERT(h != NULL);
hash_free(h);
return 0;
}
hash_add(h, k2, v2);
hash_add(h, k3, v3);
- assert_return(hash_get_count(h) == 3, EXIT_FAILURE);
+ TS_ASSERT(hash_get_count(h) == 3);
hash_free(h);
return 0;
/* replace v1 */
r |= hash_add(h, k1, v4);
- assert_return(r == 0, EXIT_FAILURE);
- assert_return(hash_get_count(h) == 3, EXIT_FAILURE);
+ TS_ASSERT(r == 0);
+ TS_ASSERT(hash_get_count(h) == 3);
v = hash_find(h, "k1");
- assert_return(streq(v, v4), EXIT_FAILURE);
+ TS_ASSERT(streq(v, v4));
- assert_return(freecount == 1, EXIT_FAILURE);
+ TS_ASSERT(freecount == 1);
hash_free(h);
return 0;
r |= hash_add(h, k2, v2);
r |= hash_add(h, k3, v3);
- assert_return(r == 0, EXIT_FAILURE);
+ TS_ASSERT(r == 0);
/* replace v1 */
r = hash_add_unique(h, k1, v4);
- assert_return(r != 0, EXIT_FAILURE);
- assert_return(hash_get_count(h) == 3, EXIT_FAILURE);
+ TS_ASSERT(r != 0);
+ TS_ASSERT(hash_get_count(h) == 3);
v = hash_find(h, "k1");
- assert_return(streq(v, v1), EXIT_FAILURE);
+ TS_ASSERT(streq(v, v1));
- assert_return(freecount == 0, EXIT_FAILURE);
+ TS_ASSERT(freecount == 0);
hash_free(h);
return 0;
for (hash_iter_init(h, &iter); hash_iter_next(&iter, &k, (const void **)&v);) {
v2 = hash_find(h2, k);
- assert_return(v2 != NULL, EXIT_FAILURE);
+ TS_ASSERT(v2 != NULL);
hash_del(h2, k);
}
- assert_return(hash_get_count(h) == 3, EXIT_FAILURE);
- assert_return(hash_get_count(h2) == 0, EXIT_FAILURE);
+ TS_ASSERT(hash_get_count(h) == 3);
+ TS_ASSERT(hash_get_count(h2) == 0);
hash_free(h);
hash_free(h2);
for (hash_iter_init(h, &iter); hash_iter_next(&iter, &k, (const void **)&v);) {
v2 = hash_find(h2, k);
- assert_return(v2 != NULL, EXIT_FAILURE);
+ TS_ASSERT(v2 != NULL);
hash_del(h2, k);
}
- assert_return(hash_get_count(h) == 2, EXIT_FAILURE);
- assert_return(hash_get_count(h2) == 1, EXIT_FAILURE);
+ TS_ASSERT(hash_get_count(h) == 2);
+ TS_ASSERT(hash_get_count(h2) == 1);
hash_free(h);
hash_free(h2);
int rc;
rc = hash_del(h, k1);
- assert_return(rc == -ENOENT, EXIT_FAILURE);
+ TS_ASSERT(rc == -ENOENT);
hash_free(h);
hash_del(h, k1);
- assert_return(freecount == 1, EXIT_FAILURE);
+ TS_ASSERT(freecount == 1);
- assert_return(hash_get_count(h) == 2, EXIT_FAILURE);
+ TS_ASSERT(hash_get_count(h) == 2);
hash_free(h);
- assert_return(freecount == 3, EXIT_FAILURE);
+ TS_ASSERT(freecount == 3);
return 0;
}
hash_add_unique(h, k[idx], v[idx]);
}
- assert_return(hash_get_count(h) == N, EXIT_FAILURE);
+ TS_ASSERT(hash_get_count(h) == N);
hash_free(h);
}
return 0;
k += 8;
}
- assert_return(hash_get_count(h) == N, EXIT_FAILURE);
+ TS_ASSERT(hash_get_count(h) == N);
k = &buf[0];
for (i = 0; i < N; i++) {
k += 8;
}
- assert_return(hash_get_count(h) == 0, EXIT_FAILURE);
+ TS_ASSERT(hash_get_count(h) == 0);
hash_free(h);
return 0;
for (i = 0; i < N; i++)
list = kmod_list_append(list, v[i]);
- assert_return(len(list) == N, EXIT_FAILURE);
+ TS_ASSERT(len(list) == N);
last = kmod_list_last(list);
- assert_return(last->data == v[N - 1], EXIT_FAILURE);
+ TS_ASSERT(last->data == v[N - 1]);
kmod_list_remove_all(list);
const int N = ARRAY_SIZE(v);
l = kmod_list_prev(list, list);
- assert_return(l == NULL, EXIT_FAILURE);
+ TS_ASSERT(l == NULL);
for (i = 0; i < N; i++)
list = kmod_list_append(list, v[i]);
l = kmod_list_prev(list, list);
- assert_return(l == NULL, EXIT_FAILURE);
+ TS_ASSERT(l == NULL);
l = list;
for (i = 0; i < N - 1; i++) {
l = kmod_list_next(list, l);
p = kmod_list_prev(list, l);
- assert_return(p->data == v[i], EXIT_FAILURE);
+ TS_ASSERT(p->data == v[i]);
}
kmod_list_remove_all(list);
removed = v[N / 2];
list = kmod_list_remove_data(list, removed);
- assert_return(len(list) == N - 1, EXIT_FAILURE);
+ TS_ASSERT(len(list) == N - 1);
kmod_list_foreach(l, list)
- assert_return(l->data != removed, EXIT_FAILURE);
+ TS_ASSERT(l->data != removed);
kmod_list_remove_all(list);
for (i = 0; i < M; i++)
a = kmod_list_append(a, v[i]);
- assert_return(len(a) == M, EXIT_FAILURE);
+ TS_ASSERT(len(a) == M);
for (i = M; i < N; i++)
b = kmod_list_append(b, v[i]);
- assert_return(len(b) == N - M, EXIT_FAILURE);
+ TS_ASSERT(len(b) == N - M);
a = kmod_list_append_list(a, NULL);
- assert_return(len(a) == M, EXIT_FAILURE);
+ TS_ASSERT(len(a) == M);
b = kmod_list_append_list(NULL, b);
- assert_return(len(b) == N - M, EXIT_FAILURE);
+ TS_ASSERT(len(b) == N - M);
c = kmod_list_append_list(a, b);
- assert_return(len(c) == N, EXIT_FAILURE);
+ TS_ASSERT(len(c) == N);
i = 0;
kmod_list_foreach(l, c) {
- assert_return(l->data == v[i], EXIT_FAILURE);
+ TS_ASSERT(l->data == v[i]);
i++;
}
const char *v1 = "v1", *v2 = "v2", *v3 = "v3", *vx = "vx";
list = kmod_list_insert_before(list, v3);
- assert_return(len(list) == 1, EXIT_FAILURE);
+ TS_ASSERT(len(list) == 1);
list = kmod_list_insert_before(list, v2);
list = kmod_list_insert_before(list, v1);
- assert_return(len(list) == 3, EXIT_FAILURE);
+ TS_ASSERT(len(list) == 3);
l = list;
- assert_return(l->data == v1, EXIT_FAILURE);
+ TS_ASSERT(l->data == v1);
l = kmod_list_next(list, l);
- assert_return(l->data == v2, EXIT_FAILURE);
+ TS_ASSERT(l->data == v2);
l = kmod_list_insert_before(l, vx);
- assert_return(len(list) == 4, EXIT_FAILURE);
- assert_return(l->data == vx, EXIT_FAILURE);
+ TS_ASSERT(len(list) == 4);
+ TS_ASSERT(l->data == vx);
l = kmod_list_next(list, l);
- assert_return(l->data == v2, EXIT_FAILURE);
+ TS_ASSERT(l->data == v2);
l = kmod_list_next(list, l);
- assert_return(l->data == v3, EXIT_FAILURE);
+ TS_ASSERT(l->data == v3);
kmod_list_remove_all(list);
const char *v1 = "v1", *v2 = "v2", *v3 = "v3", *vx = "vx";
list = kmod_list_insert_after(list, v1);
- assert_return(len(list) == 1, EXIT_FAILURE);
+ TS_ASSERT(len(list) == 1);
list = kmod_list_insert_after(list, v3);
list = kmod_list_insert_after(list, v2);
- assert_return(len(list) == 3, EXIT_FAILURE);
+ TS_ASSERT(len(list) == 3);
l = list;
- assert_return(l->data == v1, EXIT_FAILURE);
+ TS_ASSERT(l->data == v1);
l = kmod_list_insert_after(l, vx);
- assert_return(len(list) == 4, EXIT_FAILURE);
- assert_return(l->data == v1, EXIT_FAILURE);
+ TS_ASSERT(len(list) == 4);
+ TS_ASSERT(l->data == v1);
l = kmod_list_next(list, l);
- assert_return(l->data == vx, EXIT_FAILURE);
+ TS_ASSERT(l->data == vx);
l = kmod_list_next(list, l);
- assert_return(l->data == v2, EXIT_FAILURE);
+ TS_ASSERT(l->data == v2);
l = kmod_list_next(list, l);
- assert_return(l->data == v3, EXIT_FAILURE);
+ TS_ASSERT(l->data == v3);
kmod_list_remove_all(list);
strbuf_pushchar(&buf, *c);
result = strbuf_str(&buf);
- assert_return(result == buf.bytes, EXIT_FAILURE);
- assert_return(streq(result, TEXT), EXIT_FAILURE);
+ TS_ASSERT(result == buf.bytes);
+ TS_ASSERT(streq(result, TEXT));
return 0;
}
*/
strbuf_popchar(&buf);
result = strbuf_str(&buf);
- assert_return(result == buf.bytes, EXIT_FAILURE);
- assert_return(streq(result, TEXT), EXIT_FAILURE);
+ TS_ASSERT(result == buf.bytes);
+ TS_ASSERT(streq(result, TEXT));
strbuf_popchars(&buf, lastwordlen);
result = strbuf_str(&buf);
- assert_return(!streq(TEXT, result), EXIT_FAILURE);
- assert_return(strncmp(TEXT, result, strlen(TEXT) - lastwordlen) == 0,
- EXIT_FAILURE);
- assert_return(result[strlen(TEXT) - lastwordlen] == '\0', EXIT_FAILURE);
+ TS_ASSERT(!streq(TEXT, result));
+ TS_ASSERT(strncmp(TEXT, result, strlen(TEXT) - lastwordlen) == 0);
+ TS_ASSERT(result[strlen(TEXT) - lastwordlen] == '\0');
free(str);
DECLARE_STRBUF_WITH_STACK(buf3, sizeof(test) + 1);
strbuf_pushchars(&buf, test);
- assert_return(streq(test, strbuf_str(&buf)), EXIT_FAILURE);
+ TS_ASSERT(streq(test, strbuf_str(&buf)));
p = strbuf_str(&buf);
- assert_return(streq(test, p), EXIT_FAILURE);
+ TS_ASSERT(streq(test, p));
strbuf_pushchars(&buf2, test);
- assert_return(streq(test, strbuf_str(&buf2)), EXIT_FAILURE);
+ TS_ASSERT(streq(test, strbuf_str(&buf2)));
/* It fits on stack, but when we steal, we get a copy on heap */
p = strbuf_str(&buf2);
- assert_return(streq(test, p), EXIT_FAILURE);
+ TS_ASSERT(streq(test, p));
/*
* Check assumption about buffer being on stack vs heap is indeed valid.
strbuf_clear(&buf3);
stack_buf = buf3.bytes;
strbuf_pushchars(&buf3, test);
- assert_return(stack_buf == buf3.bytes, EXIT_FAILURE);
+ TS_ASSERT(stack_buf == buf3.bytes);
- assert_return(streq(test, strbuf_str(&buf3)), EXIT_FAILURE);
- assert_return(stack_buf == buf3.bytes, EXIT_FAILURE);
+ TS_ASSERT(streq(test, strbuf_str(&buf3)));
+ TS_ASSERT(stack_buf == buf3.bytes);
strbuf_pushchars(&buf3, "-overflow");
- assert_return(stack_buf != buf3.bytes, EXIT_FAILURE);
+ TS_ASSERT(stack_buf != buf3.bytes);
return 0;
}
{
DECLARE_STRBUF(heapbuf);
- assert_return(heapbuf.bytes == NULL, EXIT_FAILURE);
- assert_return(heapbuf.size == 0, EXIT_FAILURE);
- assert_return(heapbuf.used == 0, EXIT_FAILURE);
+ TS_ASSERT(heapbuf.bytes == NULL);
+ TS_ASSERT(heapbuf.size == 0);
+ TS_ASSERT(heapbuf.used == 0);
strbuf_pushchars(&heapbuf, "-overflow");
- assert_return(heapbuf.bytes != NULL, EXIT_FAILURE);
- assert_return(heapbuf.size != 0, EXIT_FAILURE);
- assert_return(heapbuf.used != 0, EXIT_FAILURE);
+ TS_ASSERT(heapbuf.bytes != NULL);
+ TS_ASSERT(heapbuf.size != 0);
+ TS_ASSERT(heapbuf.used != 0);
return 0;
}
strbuf_pushmem(&buf, "", 0);
strbuf_pushmem(&buf, TEXT, strlen(TEXT) + 1);
- assert_return(streq(TEXT, strbuf_str(&buf)), EXIT_FAILURE);
+ TS_ASSERT(streq(TEXT, strbuf_str(&buf)));
return 0;
}
_cleanup_strbuf_ struct strbuf buf;
strbuf_init(&buf);
- assert_return(strbuf_used(&buf) == 0, EXIT_FAILURE);
+ TS_ASSERT(strbuf_used(&buf) == 0);
strbuf_pushchars(&buf, TEXT);
- assert_return(strbuf_used(&buf) == strlen(TEXT), EXIT_FAILURE);
+ TS_ASSERT(strbuf_used(&buf) == strlen(TEXT));
strbuf_pushchar(&buf, 'a');
strbuf_popchar(&buf);
- assert_return(strbuf_used(&buf) == strlen(TEXT), EXIT_FAILURE);
+ TS_ASSERT(strbuf_used(&buf) == strlen(TEXT));
- assert_return(streq(TEXT, strbuf_str(&buf)), EXIT_FAILURE);
- assert_return(strbuf_used(&buf) == strlen(TEXT), EXIT_FAILURE);
+ TS_ASSERT(streq(TEXT, strbuf_str(&buf)));
+ TS_ASSERT(strbuf_used(&buf) == strlen(TEXT));
strbuf_pushchar(&buf, '\0');
- assert_return(streq(TEXT, strbuf_str(&buf)), EXIT_FAILURE);
- assert_return(strbuf_used(&buf) == strlen(TEXT) + 1, EXIT_FAILURE);
+ TS_ASSERT(streq(TEXT, strbuf_str(&buf)));
+ TS_ASSERT(strbuf_used(&buf) == strlen(TEXT) + 1);
return 0;
}
strbuf_init(&buf);
strbuf_shrink_to(&buf, 0);
- assert_return(strbuf_used(&buf) == 0, EXIT_FAILURE);
+ TS_ASSERT(strbuf_used(&buf) == 0);
strbuf_pushchars(&buf, TEXT);
strbuf_shrink_to(&buf, strlen(TEXT) - 1);
- assert_return(strbuf_used(&buf) == strlen(TEXT) - 1, EXIT_FAILURE);
+ TS_ASSERT(strbuf_used(&buf) == strlen(TEXT) - 1);
return 0;
}
const char *res = "thiC iC a teCt Ctring";
strchr_replace(s, 's', 'C');
- assert_return(streq(s, res), EXIT_FAILURE);
+ TS_ASSERT(streq(s, res));
return EXIT_SUCCESS;
}
for (size_t i = 0; i < ARRAY_SIZE(teststr); i++) {
_cleanup_free_ char *val = strdup(teststr[i].val);
- assert_return(val != NULL, EXIT_FAILURE);
- assert_return(!underscores(val), EXIT_FAILURE);
- assert_return(streq(val, teststr[i].res), EXIT_FAILURE);
+ TS_ASSERT(val != NULL);
+ TS_ASSERT(!underscores(val));
+ TS_ASSERT(streq(val, teststr[i].res));
}
return EXIT_SUCCESS;
};
for (size_t i = 0; i < ARRAY_SIZE(teststr); i++) {
- assert_return(path_ends_with_kmod_ext(teststr[i].val,
- strlen(teststr[i].val)) ==
- teststr[i].res,
- EXIT_FAILURE);
+ TS_ASSERT(
+ path_ends_with_kmod_ext(teststr[i].val, strlen(teststr[i].val)) ==
+ teststr[i].res);
}
return EXIT_SUCCESS;
int fd;
fd = open(TEST_WRITE_STR_SAFE_FILE ".txt", O_CREAT | O_TRUNC | O_WRONLY, 0644);
- assert_return(fd >= 0, EXIT_FAILURE);
+ TS_ASSERT(fd >= 0);
write_str_safe(fd, s, strlen(s));
close(fd);
bool overflow;
overflow = uadd32_overflow(UINT32_MAX - 1, 1, &res);
- assert_return(!overflow, EXIT_FAILURE);
- assert_return(res == UINT32_MAX, EXIT_FAILURE);
+ TS_ASSERT(!overflow);
+ TS_ASSERT(res == UINT32_MAX);
overflow = uadd32_overflow(UINT32_MAX, 1, &res);
- assert_return(overflow, EXIT_FAILURE);
+ TS_ASSERT(overflow);
return EXIT_SUCCESS;
}
bool overflow;
overflow = uadd64_overflow(UINT64_MAX - 1, 1, &res);
- assert_return(!overflow, EXIT_FAILURE);
- assert_return(res == UINT64_MAX, EXIT_FAILURE);
+ TS_ASSERT(!overflow);
+ TS_ASSERT(res == UINT64_MAX);
overflow = uadd64_overflow(UINT64_MAX, 1, &res);
- assert_return(overflow, EXIT_FAILURE);
+ TS_ASSERT(overflow);
return EXIT_SUCCESS;
}
bool overflow;
overflow = umul32_overflow(UINT32_MAX / 0x10, 0x10, &res);
- assert_return(!overflow, EXIT_FAILURE);
- assert_return(res == (UINT32_MAX & ~0xf), EXIT_FAILURE);
+ TS_ASSERT(!overflow);
+ TS_ASSERT(res == (UINT32_MAX & ~0xf));
overflow = umul32_overflow(UINT32_MAX, 0x10, &res);
- assert_return(overflow, EXIT_FAILURE);
+ TS_ASSERT(overflow);
return EXIT_SUCCESS;
}
bool overflow;
overflow = umul64_overflow(UINT64_MAX / 0x10, 0x10, &res);
- assert_return(!overflow, EXIT_FAILURE);
- assert_return(res == (UINT64_MAX & ~0xf), EXIT_FAILURE);
+ TS_ASSERT(!overflow);
+ TS_ASSERT(res == (UINT64_MAX & ~0xf));
overflow = umul64_overflow(UINT64_MAX, 0x10, &res);
- assert_return(overflow, EXIT_FAILURE);
+ TS_ASSERT(overflow);
return EXIT_SUCCESS;
}
/* Check exponential increments */
get_backoff_delta_msec(now_msec() + 10, &delta);
- assert_return(delta == 1, EXIT_FAILURE);
+ TS_ASSERT(delta == 1);
get_backoff_delta_msec(now_msec() + 10, &delta);
- assert_return(delta == 2, EXIT_FAILURE);
+ TS_ASSERT(delta == 2);
get_backoff_delta_msec(now_msec() + 10, &delta);
- assert_return(delta == 4, EXIT_FAILURE);
+ TS_ASSERT(delta == 4);
get_backoff_delta_msec(now_msec() + 10, &delta);
- assert_return(delta == 8, EXIT_FAILURE);
+ TS_ASSERT(delta == 8);
get_backoff_delta_msec(now_msec() + 10, &delta);
- assert_return(delta == 8, EXIT_FAILURE);
+ TS_ASSERT(delta == 8);
{
/* Check tail */
delta = 4;
get_backoff_delta_msec(now_msec() + 3, &delta);
- assert_return(delta == 2, EXIT_FAILURE);
+ TS_ASSERT(delta == 2);
get_backoff_delta_msec(now_msec() + 1, &delta);
- assert_return(delta == 1, EXIT_FAILURE);
+ TS_ASSERT(delta == 1);
get_backoff_delta_msec(now_msec(), &delta);
- assert_return(delta == 0, EXIT_FAILURE);
+ TS_ASSERT(delta == 0);
}
/* Check when end time has passed */
delta = 0;
get_backoff_delta_msec(now_msec() - 10, &delta);
- assert_return(delta == 0, EXIT_FAILURE);
+ TS_ASSERT(delta == 0);
return EXIT_SUCCESS;
}
#define WARN(fmt, ...) _LOG("WARN: ", fmt, ##__VA_ARGS__)
#define ERR(fmt, ...) _LOG("ERR: ", fmt, ##__VA_ARGS__)
-#define assert_return(expr, r) TS_ASSERT(expr)
-
#define TS_ASSERT(expr) \
do { \
if ((!(expr))) { \