5#include "testing/testing.h"
39 static const int nodes_num = 128;
56 if (node_index != nodes_num - 1) {
71void concurrent_insert(
TaskPool *__restrict pool,
void *taskdata)
84 static const int nodes_num = 655360;
91 for (
int i = 0; i < nodes_num; ++i) {
101 node_v = node_v->
next)
103 IndexedNode *
node =
reinterpret_cast<IndexedNode *
>(node_v);
107 visited_nodes[
node->index] =
true;
110 for (
int node_index = 0; node_index < nodes_num; ++node_index) {
113 MEM_delete(visited_nodes);
Read Blender memory allocation and freeing.
#define POINTER_FROM_INT(i)
#define POINTER_AS_INT(i)
#define EXPECT_FALSE(result)
#define EXPECT_LT(result, expect)
#define EXPECT_GE(result, expect)
#define EXPECT_TRUE(result)
void * MEM_new_uninitialized(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
TaskPool * BLI_task_pool_create_suspended(void *userdata, eTaskPriority priority)
void MEM_delete_void(void *vmemh)
void BLI_linklist_lockfree_init(LockfreeLinkList *list)
void BLI_task_pool_work_and_wait(TaskPool *pool)
void * BLI_task_pool_user_data(TaskPool *pool)
void BLI_linklist_lockfree_free(LockfreeLinkList *list, LockfreeeLinkNodeFreeFP free_func)
void BLI_linklist_lockfree_insert(LockfreeLinkList *list, LockfreeLinkNode *node)
LockfreeLinkNode * BLI_linklist_lockfree_begin(LockfreeLinkList *list)
void BLI_task_pool_free(TaskPool *pool)
EXPECT_EQ(BLI_expr_pylike_eval(expr, nullptr, 0, &result), EXPR_PYLIKE_INVALID)
void BLI_task_pool_push(TaskPool *pool, TaskRunFunction run, void *taskdata, bool free_taskdata, TaskFreeFunction freedata)
void * MEM_new_array_zeroed(size_t len, size_t size, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1
struct LockfreeLinkNode * next