5#include "testing/testing.h"
20#define TESTFAIL(test) \
27 const Link *prev, *link;
31 link =
static_cast<Link *
>(listbase->
last_);
38 }
while ((
void)(prev = link), (link = link->
next));
42 link =
static_cast<Link *
>(listbase->
last_);
45 }
while ((
void)(prev = link), (link = link->
prev));
62 while (*
string != 0) {
63 if (*
string == ch_src) {
72TEST(listbase, FindLinkOrIndex)
108 lb.free_no_destruct();
111TEST(listbase, FindLinkFromStringOrPointer)
114 TestLink *next, *prev;
119 const char *
const link1_name =
"Link1";
120 const char *
const link2_name =
"Link2";
121 const void *
const link1_ptr =
nullptr;
122 const void *
const link2_ptr = link2_name;
124 const size_t name_offset =
offsetof(TestLink, name);
125 const size_t ptr_offset =
offsetof(TestLink, ptr);
127 ListBaseT<TestLink> lb;
129 STRNCPY(link1->name, link1_name);
130 link1->ptr = link1_ptr;
132 STRNCPY(link2->name, link2_name);
133 link2->ptr = link2_ptr;
136 lb.clear_no_delete();
142 static_cast<void *
>(
nullptr));
151 static_cast<void *
>(link1));
153 static_cast<void *
>(link1));
155 static_cast<void *
>(link1));
157 static_cast<void *
>(
nullptr));
166 static_cast<void *
>(link1));
168 static_cast<void *
>(link2));
170 static_cast<void *
>(link1));
172 static_cast<void *
>(link2));
174 static_cast<void *
>(
nullptr));
176 lb.free_no_destruct();
181 ListBaseT<Link> lb = {
nullptr,
nullptr};
201 lb.free_no_destruct();
207 ListBaseT<Link> split_after_lb;
212 lb.clear_no_delete();
213 split_after_lb.clear_no_delete();
216 EXPECT_EQ(split_after_lb.is_empty(),
true);
219 lb.clear_no_delete();
220 split_after_lb.clear_no_delete();
230 lb.clear_no_delete();
231 split_after_lb.clear_no_delete();
239 EXPECT_EQ(split_after_lb.is_empty(),
true);
242 lb.clear_no_delete();
243 split_after_lb.clear_no_delete();
255 lb.clear_no_delete();
256 split_after_lb.clear_no_delete();
270 lb.free_no_destruct();
271 split_after_lb.free_no_destruct();
274TEST(listbase, EnumerateIterator)
277 TestLink *next, *prev;
281 ListBaseT<TestLink> lb;
282 lb.clear_no_delete();
293 for (
auto [i, link] : lb.enumerate()) {
307 lb.free_no_destruct();
310TEST(listbase, ReversedIterator)
313 TestLink *next, *prev;
317 ListBaseT<TestLink> lb;
318 lb.clear_no_delete();
329 for (TestLink &link : lb.items_reversed()) {
333 else if (count == 1) {
340 lb.free_no_destruct();
346 TestLink *next, *prev;
350 ListBaseT<TestLink> lb;
351 lb.clear_no_delete();
363 for (TestLink &link : lb.items_mutable()) {
365 if (&link == link2) {
374 lb.free_no_destruct();
377TEST(listbase, MutableReversedIterator)
380 TestLink *next, *prev;
384 ListBaseT<TestLink> lb;
385 lb.clear_no_delete();
397 for (TestLink &link : lb.items_reversed_mutable()) {
399 if (&link == link2) {
408 lb.free_no_destruct();
416 int i = strcmp(*
static_cast<const char **
>(
const_cast<void *
>(a)),
417 *
static_cast<const char **
>(
const_cast<void *
>(
b)));
418 return (i > 0) ? 1 : (i < 0) ? -1 : 0;
425 int i = strcmp(
static_cast<const char *
>(link_a->
data),
static_cast<const char *
>(link_b->
data));
426 return (i > 0) ? 1 : (i < 0) ? -1 : 0;
445 link_step =
static_cast<LinkData *
>(lb->first_);
446 for (i = 0; i < arr_num; i++) {
447 if (!
STREQ(arr[i], (
char *)link_step->
data)) {
450 link_step = link_step->
next;
464 link_step =
static_cast<LinkData *
>(lb->first_);
465 while (link_step && link_step->
next) {
467 if ((link_step < link_step->next) != forward) {
471 link_step = link_step->
next;
478 const int words_len =
sizeof(
words10k) - 1;
484 ListBaseT<LinkData> words_lb;
496 for (i = 0; i < words_num; i++) {
497 words_arr[i] = w_step;
498 w_step += strlen(w_step) + 1;
503 words_lb.clear_no_delete();
515 words_lb.clear_no_delete();
519 words_lb.clear_no_delete();
521 for (i = 0; i < words_num; i++) {
522 LinkData *link = &words_linkdata_arr[i];
525 w_step += strlen(w_step) + 1;
566 MEM_delete(words_arr);
567 MEM_delete(words_linkdata_arr);
Generic array manipulation API.
#define BLI_array_reverse(arr, arr_len)
Read Blender memory allocation and freeing.
#define EXPECT_TRUE(result)
void * BLI_findptr(const ListBase *listbase, const void *ptr, int offset) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
static int testsort_listbase_str_cmp(const void *a, const void *b)
void * BLI_rfindlink(const ListBase *listbase, int number) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
static int char_switch(char *string, char ch_src, char ch_dst)
char * STRNCPY(char(&dst)[N], const char *src)
static bool listbase_is_valid(const ListBase *listbase)
void * MEM_new_array_uninitialized(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
static int testsort_listbase_str_cmp_reverse(const void *a, const void *b)
void * BLI_rfindstring(const ListBase *listbase, const char *id, int offset) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
static int testsort_array_str_cmp(const void *a, const void *b)
static bool testsort_listbase_array_str_cmp(ListBaseT< LinkData > *lb, char **arr, int arr_num)
void * BLI_findstring(const ListBase *listbase, const char *id, int offset) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
char * BLI_strdupn(const char *str, size_t len) ATTR_MALLOC ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void * BLI_findlinkfrom(Link *start, int step) ATTR_WARN_UNUSED_RESULT
void * BLI_findlink(const ListBase *listbase, int number) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
int BLI_findindex(const ListBase *listbase, const void *vlink) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void * MEM_new_zeroed(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
void void void void void BLI_listbase_split_after(ListBase *original_listbase, ListBase *split_listbase, void *vlink) ATTR_NONNULL(1
void BLI_freelinkN(ListBase *listbase, void *vlink) ATTR_NONNULL(1)
void * BLI_rfindptr(const ListBase *listbase, const void *ptr, int offset) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void void void void void void void BLI_listbase_reverse(ListBase *lb) ATTR_NONNULL(1)
void void BLI_listbase_sort(ListBase *listbase, int(*cmp)(const void *, const void *)) ATTR_NONNULL(1
EXPECT_EQ(BLI_expr_pylike_eval(expr, nullptr, 0, &result), EXPR_PYLIKE_INVALID)
void void * BLI_listbase_string_or_index_find(const ListBase *listbase, const char *string, size_t string_offset, int index) ATTR_WARN_UNUSED_RESULT ATTR_NONNULL(1)
void BLI_addtail(ListBase *listbase, void *vlink) ATTR_NONNULL(1)
static int testsort_array_str_cmp_reverse(const void *a, const void *b)
ListBase BLI_listbase_from_link(Link *some_link)
static bool testsort_listbase_sort_is_stable(ListBaseT< LinkData > *lb, bool forward)