Searched refs:arr (Results 1 – 6 of 6) sorted by relevance
| /oneTBB/test/tbbmalloc/ |
| H A D | test_malloc_compliance.cpp | 521 REQUIRE(arr); in AddrArifm()
525 arr[i].ptr=Tmalloc(arr[i].size); in AddrArifm()
531 if (nullptr!=arr[i].ptr && nullptr!=arr[i+1].ptr) in AddrArifm()
532 REQUIRE_MESSAGE((uintptr_t)arr[i].ptr+arr[i].size <= (uintptr_t)arr[i+1].ptr, in AddrArifm()
553 if (nullptr!=arr[i].ptr && nullptr!=arr[i+1].ptr) in AddrArifm()
554 REQUIRE_MESSAGE((uintptr_t)arr[i].ptr+arr[i].size <= (uintptr_t)arr[i+1].ptr, in AddrArifm()
559 Tfree(arr[i].ptr); in AddrArifm()
566 arr[i].ptr=Tcalloc(arr[i].size,1); in AddrArifm()
572 if (nullptr!=arr[i].ptr && nullptr!=arr[i+1].ptr) in AddrArifm()
573 REQUIRE_MESSAGE((uintptr_t)arr[i].ptr+arr[i].size <= (uintptr_t)arr[i+1].ptr, in AddrArifm()
[all …]
|
| H A D | test_malloc_shutdown_hang.cpp | 41 void *arr[ARRAY_SIZE] = {nullptr}; in allocatorRandomThrashing() local
45 arr[j] = scalable_malloc(rand() % MAX_ALLOC); in allocatorRandomThrashing()
49 scalable_free(arr[j]); in allocatorRandomThrashing()
50 arr[j] = nullptr; in allocatorRandomThrashing()
|
| /oneTBB/doc/main/reference/ |
| H A D | parallel_sort_ranges_extension.rst | 66 static std::array<int, 3> arr = {3, 2, 1};
67 return std::span<int>(arr);
|
| /oneTBB/examples/task_group/sudoku/ |
| H A D | sudoku.cpp | 102 void init_board(std::vector<board_element>& b, unsigned short arr[BOARD_SIZE]) { in init_board()
104 b[i].solved_element = arr[i]; in init_board()
|
| /oneTBB/include/oneapi/tbb/detail/ |
| H A D | _concurrent_skip_list.h | 168 atomic_node_ptr* arr = reinterpret_cast<atomic_node_ptr*>(this + 1); in get_atomic_next() local
169 return arr[level]; in get_atomic_next()
173 const atomic_node_ptr* arr = reinterpret_cast<const atomic_node_ptr*>(this + 1); in get_atomic_next() local
174 return arr[level]; in get_atomic_next()
|
| /oneTBB/test/common/ |
| H A D | concurrent_associative_common.h | 751 ParallelTraverseBody( atomic_byte_type arr[], int num )
752 : n(num), array(arr) {}
|