Home
last modified time | relevance | path

Searched refs:size_t (Results 1 – 25 of 306) sorted by relevance

12345678910>>...13

/oneTBB/test/tbbmalloc/
H A Dtest_malloc_lib_unload.cpp33 extern __declspec(dllexport) void *scalable_calloc(size_t, size_t);
34 extern __declspec(dllexport) int scalable_posix_memalign(void **, size_t, size_t);
35 extern __declspec(dllexport) void *scalable_aligned_malloc(size_t, size_t);
36 extern __declspec(dllexport) void *scalable_aligned_realloc(void *, size_t, size_t);
73 extern "C" void *scalable_calloc(size_t, size_t) in scalable_calloc() argument
78 extern "C" int scalable_posix_memalign(void **, size_t, size_t) in scalable_posix_memalign() argument
83 extern "C" void *scalable_aligned_malloc(size_t, size_t) in scalable_aligned_malloc() argument
88 extern "C" void *scalable_aligned_realloc(void *, size_t, size_t) in scalable_aligned_realloc() argument
93 extern "C" void *safer_scalable_aligned_realloc(void *, size_t, size_t, void *) in safer_scalable_aligned_realloc() argument
107 extern "C" size_t safer_scalable_msize (void *, size_t (*)(void*)) in safer_scalable_msize()
[all …]
H A Dtest_malloc_compliance.cpp147 typedef void* TestCalloc(size_t num, size_t size);
151 typedef void* TestAlignedMalloc(size_t size, size_t alignment);
167 void* Tcalloc(size_t num, size_t size);
170 void* Taligned_malloc(size_t size, size_t alignment);
218 size_t limit;
323 const size_t max_alignment = size_t(1) << (sizeof(size_t)*CHAR_BIT - 1); in CheckArgumentsOverflow()
416 size_t NonZero(void *ptr, size_t size) in NonZero()
457 void* Tcalloc(size_t num, size_t size) in Tcalloc()
485 void* Taligned_malloc(size_t size, size_t alignment) in Taligned_malloc()
504 size_t size;
[all …]
/oneTBB/test/tbb/
H A Dtest_hw_concurrency.cpp61 tbb::combinable<std::size_t> comb;
62 tbb::concurrent_vector<std::size_t> cv;
63 tbb::concurrent_queue<std::size_t> cq;
66 tbb::concurrent_hash_map<std::size_t, std::size_t> chmap;
67 tbb::concurrent_unordered_map<std::size_t, std::size_t> cumap;
68 tbb::concurrent_unordered_multimap<std::size_t, std::size_t> cummap;
71 tbb::concurrent_map<std::size_t, std::size_t> cmap;
72 tbb::concurrent_multimap<std::size_t, std::size_t> cmmap;
73 tbb::concurrent_set<std::size_t> cset;
76 tbb::scalable_allocator<std::size_t> sa;
[all …]
H A Dtest_partitioner.h30 size_t m_rangeNum;
103 RangeBase(size_t _begin, size_t _end, RangeStatisticData *statData, in RangeBase()
138 size_t round(T part) { return size_t(part); } in round()
180 size_t round(float part) { return size_t(std::ceil(part)); } in round()
185 Range1_2(size_t _begin, size_t _end, RangeStatisticData *statData, in Range1_2()
199 Range1_999(size_t _begin, size_t _end, RangeStatisticData *statData, in Range1_999()
213 Range999_1(size_t _begin, size_t _end, RangeStatisticData *statData, in Range999_1()
263 size_t parts = size_t(p.left() + p.right()); in compute_right_part()
281 TreeNode(size_t range_begin, size_t range_end, size_t affinity, in TreeNode()
286 friend TreeNode* make_node(size_t range_begin, size_t range_end, size_t affinity,
[all …]
H A Dtest_blocked_range.cpp42 const std::size_t sequence_length = 100;
43 std::size_t int_array[sequence_length] = {0};
50 … CHECK_MESSAGE(range_based_for_accumulate<std::size_t>(r, std::plus<std::size_t>(), std::size_t(0))
60 blocked_range<std::size_t> r1(0, std::size_t(-1) / 2);
61 std::size_t size = r1.size();
62 std::size_t begin = r1.begin();
63 std::size_t end = r1.end();
66 blocked_range<std::size_t> r2(r1, p);
69 std::size_t parts = p.left() + p.right();
70 std::size_t int_part = size / parts;
[all …]
H A Dtest_function_node.cpp55 void buffered_levels( size_t concurrency, Body body ) { in buffered_levels()
58 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels()
86 for (size_t i = 0; i < num_receivers; i++) { in buffered_levels()
117 size_t n = senders[s]->my_received; in buffered_levels()
141 const size_t Offset = 123;
142 std::atomic<size_t> global_execute_count;
146 std::atomic<size_t> local_execute_count;
163 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels_with_copy()
221 size_t global_count = global_execute_count; in buffered_levels_with_copy()
253 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in concurrency_levels()
[all …]
H A Dtest_multifunction_node.cpp54 void buffered_levels( size_t concurrency, Body body ) { in buffered_levels()
57 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels()
132 const size_t Offset = 123;
133 std::atomic<size_t> global_execute_count;
137 std::atomic<size_t> local_execute_count;
151 void buffered_levels_with_copy( size_t concurrency ) { in buffered_levels_with_copy()
154 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in buffered_levels_with_copy()
191 size_t n = senders[s]->my_received; in buffered_levels_with_copy()
212 size_t global_count = global_execute_count; in buffered_levels_with_copy()
240 for ( size_t lc = 1; lc <= concurrency; ++lc ) { in concurrency_levels()
[all …]
/oneTBB/src/tbbmalloc/
H A Dlarge_objects.h46 template<size_t MIN_SIZE, size_t MAX_SIZE>
53 static size_t alignToBin(size_t size) { in alignToBin()
67 template<size_t MIN_SIZE, size_t MAX_SIZE>
82 static size_t alignToBin(size_t size) { in alignToBin()
124 size_t usedSz;
125 size_t cachedSz;
130 void update(size_t usedSize, size_t cachedSize) { in update()
251 static size_t alignToBin(size_t size) { in alignToBin()
292 size_t hugeSizeThreshold;
361 static size_t alignToBin(size_t size);
[all …]
H A Dbackend.h158 size_t countFreeBlocks();
159 size_t reportFreeBlocks(FILE *f);
197 inline bool operator()(size_t oldMaxReq, size_t requestSize) const;
244 std::atomic<size_t> totalMemSize;
245 std::atomic<size_t> memSoftLimit;
260 std::atomic<size_t> maxRequestedSize;
312 void *allocRawMem(size_t &size);
323 static int sizeToBin(size_t size) { in sizeToBin()
361 void *remap(void *ptr, size_t oldSize, size_t newSize, size_t alignment);
375 size_t getMaxBinnedSize() const;
[all …]
/oneTBB/src/tbbmalloc_proxy/
H A Dproxy.h34 TBBMALLOC_EXPORT void * __TBB_malloc_safer_realloc( void *ptr, size_t, void* );
35 TBBMALLOC_EXPORT void * __TBB_malloc_safer_aligned_realloc( void *ptr, size_t, size_t, void* );
36 … TBBMALLOC_EXPORT size_t __TBB_malloc_safer_msize( void *ptr, size_t (*orig_msize_crt80d)(void*));
37 …TBBMALLOC_EXPORT size_t __TBB_malloc_safer_aligned_msize( void *ptr, size_t, size_t, size_t (*orig…
40 void __TBB_malloc_free_definite_size(void *object, size_t size);
47 size_t (*msize)(void*);
52 size_t (*aligned_msize)(void*,size_t,size_t);
H A Dproxy.cpp192 void *PREFIX(calloc)(ZONE_ARG size_t num, size_t size) __THROW in PREFIX()
212 void *PREFIX(memalign)(ZONE_ARG size_t alignment, size_t size) __THROW in PREFIX()
241 int posix_memalign(void **memptr, size_t alignment, size_t size) __THROW in posix_memalign()
281 void *aligned_alloc(size_t alignment, size_t size) __TBB_ALIAS_ATTR_COPY(memalign);
288 void *__libc_calloc(size_t num, size_t size) __TBB_ALIAS_ATTR_COPY(calloc);
289 void *__libc_memalign(size_t alignment, size_t size) __TBB_ALIAS_ATTR_COPY(memalign);
311 void* operator new(size_t sz) { in operator new()
362 void* safer_aligned_malloc( size_t size, size_t alignment ) in safer_aligned_malloc()
393 size_t (*orig__aligned_msize_##CRTLIB)(void*, size_t, size_t); …
394 size_t __TBB_malloc_safer__aligned_msize_##CRTLIB( void *ptr, size_t alignment, size_t offset) …
[all …]
/oneTBB/examples/getting_started/sub_string_finder/
H A Dsub_string_finder_extended.cpp26 static const std::size_t N = 22;
32 std::size_t max_size = 0, max_pos = 0; in SerialSubStringFinder()
52 const std::size_t len;
53 std::size_t *max_array;
54 std::size_t *pos_array;
78 SubStringFinder(const char *s, const std::size_t s_len, std::size_t *m, std::size_t *p) in SubStringFinder()
87 for (std::size_t i = 2; i < N; ++i) in main()
92 std::vector<std::size_t> max1(num_elem); in main()
93 std::vector<std::size_t> pos1(num_elem); in main()
94 std::vector<std::size_t> max2(num_elem); in main()
[all …]
H A Dsub_string_finder_pretty.cpp26 static const std::size_t N = 9;
30 std::vector<std::size_t> &max_array;
31 std::vector<std::size_t> &pos_array;
36 std::size_t max_size = 0, max_pos = 0; in operator ()()
55 SubStringFinder(const std::string &s, std::vector<std::size_t> &m, std::vector<std::size_t> &p) in SubStringFinder()
63 for (std::size_t i = 2; i < N; ++i) in main()
66 const std::size_t num_elem = to_scan.size(); in main()
69 std::vector<std::size_t> max(num_elem); in main()
70 std::vector<std::size_t> pos(num_elem); in main()
75 for (std::size_t i = 0; i < num_elem; ++i) { in main()
[all …]
H A Dsub_string_finder.cpp29 static const std::size_t N = 23;
33 std::vector<std::size_t> &max_array;
34 std::vector<std::size_t> &pos_array;
39 std::size_t max_size = 0, max_pos = 0; in operator ()()
40 for (std::size_t j = 0; j < str.size(); ++j) { in operator ()()
58 SubStringFinder(const std::string &s, std::vector<std::size_t> &m, std::vector<std::size_t> &p) in SubStringFinder()
73 for (std::size_t i = 2; i < N; ++i) in main()
76 const std::size_t num_elem = to_scan.size(); in main()
78 std::vector<std::size_t> max(num_elem); in main()
79 std::vector<std::size_t> pos(num_elem); in main()
[all …]
/oneTBB/test/common/
H A Dparallel_invoke_common.h31 template<std::size_t Counter, template <std::size_t> class Functor, class Generator, typename... Fs>
40 template<std::size_t Size, template <std::size_t> class Functor, class Generator>
45 template <template <std::size_t> class Functor, std::size_t NonTypeArg>
49 template <std::size_t Fixed>
51 template <template <std::size_t> class Functor, std::size_t NonTypeArg>
55 template<std::size_t LevelTaskCount, std::size_t MaxDepth, std::size_t WorkSize>
58 static constexpr std::size_t size = WorkSize;
63 template <std::size_t NonTypeArg>
66 template<std::size_t CurrentDepth>
74 template<std::size_t Depth>
[all …]
H A Dconcurrent_lru_cache_common.h33 template<std::size_t id>
92 std::size_t index = k; in operator()
100 template<typename CounterType = std::size_t>
166 const std::size_t number_of_lru_history_items;
177 const std::size_t number_of_lru_history_items;
190 template<std::size_t tag_id>
195 const std::size_t number_of_lru_history_items;
206 std::size_t, helpers::instance_serial_counter,
213 const std::size_t number_of_lru_history_items;
238 bool is_evicted(std::size_t key) { in is_evicted()
[all …]
/oneTBB/include/oneapi/tbb/
H A Dscalable_allocator.h63 TBBMALLOC_EXPORT void* __TBB_EXPORTED_FUNC scalable_calloc(size_t nobj, size_t size);
67 …PORT int __TBB_EXPORTED_FUNC scalable_posix_memalign(void** memptr, size_t alignment, size_t size);
71 TBBMALLOC_EXPORT void* __TBB_EXPORTED_FUNC scalable_aligned_malloc(size_t size, size_t alignment);
75 TBBMALLOC_EXPORT void* __TBB_EXPORTED_FUNC scalable_aligned_realloc(void* ptr, size_t size, size_t …
150 std::size_t granularity;
188 TBBMALLOC_EXPORT void *pool_aligned_malloc(MemoryPool* mPool, std::size_t size, std::size_t alignme…
189 …T void *pool_aligned_realloc(MemoryPool* mPool, void *ptr, std::size_t size, std::size_t alignment…
233 void deallocate(T* p, std::size_t) { in deallocate() argument
243 using size_type = std::size_t;
289 void* do_allocate(std::size_t bytes, std::size_t alignment) override { in do_allocate()
[all …]
H A Dcache_aligned_allocator.h35 TBB_EXPORT std::size_t __TBB_EXPORTED_FUNC cache_line_size();
53 __TBB_nodiscard T* allocate(std::size_t n) { in allocate()
58 void deallocate(T* p, std::size_t) { in deallocate() argument
63 std::size_t max_size() const noexcept { in max_size()
73 using size_type = std::size_t;
121 void* do_allocate(std::size_t bytes, std::size_t alignment) override { in do_allocate()
124 std::size_t space = correct_size(bytes) + cache_line_alignment; in do_allocate()
138 void do_deallocate(void* ptr, std::size_t bytes, std::size_t alignment) override { in do_deallocate()
156 std::size_t correct_alignment(std::size_t alignment) { in correct_alignment()
161 std::size_t cache_line_size = r1::cache_line_size(); in correct_alignment()
[all …]
/oneTBB/test/conformance/
H A Dconformance_parallel_scan.cpp32 constexpr std::size_t size = 1000;
93 for(size_t i = 0; i < size; ++i) {
109 std::vector<std::size_t> input(size);
110 std::vector<std::size_t> output(size);
111 std::vector<std::size_t> control(size);
113 for (std::size_t i = 0; i<size; ++i) {
120 …_scan_wrapper<Partitioner>()(oneapi::tbb::blocked_range<std::size_t>(0U, size, 1U), std::size_t(0),
121 …[&](const oneapi::tbb::blocked_range<std::size_t>& r, std::size_t sum, bool is_final) -> std::size…
123 std::size_t temp = sum; in __anonb56fb5590102()
131 [](std::size_t a, std::size_t b) -> std::size_t
[all …]
H A Dconformance_parallel_for_each.cpp30 for ( size_t i=0; i < depth; ++i )
47 const size_t elements = 10000;
48 const size_t init_sum = 0;
49 std::atomic<size_t> element_counter;
51 template<size_t K>
53 void operator()(size_t& x) const { in operator ()()
69 std::deque<size_t> v(elements, 0); in WorkProducingTest()
98 …ForEachInvokeItem(std::size_t rv, std::vector<std::size_t>& cv) : real_value(rv), change_vector(cv… in ForEachInvokeItem()
111 std::size_t real_value;
112 std::vector<std::size_t>& change_vector;
[all …]
H A Dconformance_parallel_for.cpp43 size_t pfor_buffer[PFOR_BUFFER_ACTUAL_SIZE];
56 template<size_t Pad>
84 template<size_t Pad>
152 template<typename Flavor, std::size_t Pad>
252 SmartIndex(std::size_t ri, std::vector<std::size_t>& cv) in SmartIndex()
304 std::size_t real_index;
371 oneapi::tbb::parallel_for(std::size_t(0), iterations, [&](std::size_t) { in __anondcc278fb0302() argument
375 oneapi::tbb::parallel_for(std::size_t(0), iterations, [&](std::size_t) { in __anondcc278fb0402() argument
379 oneapi::tbb::parallel_for(std::size_t(0), iterations, [&](std::size_t) { in __anondcc278fb0502() argument
383 oneapi::tbb::parallel_for(std::size_t(0), iterations, [&](std::size_t) { in __anondcc278fb0602() argument
[all …]
H A Dconformance_sequencer_node.cpp49 std::size_t sequencer_body_f(const int&) { return 1; } in sequencer_body_f()
150 std::atomic<std::size_t> counter{0};
158 for (std::size_t i = 0; i < 100; ++i) {
174 …function_node<std::size_t, test_invoke::SmartID<std::size_t>> starter(g, unlimited, [](std::size_t… in __anona3025c380502()
175 …sequencer_node<test_invoke::SmartID<std::size_t>> seq1(g, &test_invoke::SmartID<std::size_t>::get_…
176 …sequencer_node<test_invoke::SmartID<std::size_t>> seq2(g, &test_invoke::SmartID<std::size_t>::id);…
178 std::size_t expected_item = 0;
180 …tion_node<test_invoke::SmartID<std::size_t>, std::size_t> check(g, serial, [&](const test_invoke::… in __anona3025c380602()
190 std::size_t objects_count = 10;
191 for (std::size_t i = 0; i < objects_count; ++i) {
[all …]
/oneTBB/src/tbb/
H A Dglobal_control.cpp48 std::size_t my_active_value{0};
53 virtual std::size_t default_value() const = 0;
57 virtual bool is_first_arg_preferred(std::size_t a, std::size_t b) const { in is_first_arg_preferred()
60 virtual std::size_t active_value() { in active_value()
65 std::size_t active_value_unsafe() { in active_value_unsafe()
71 std::size_t default_value() const override { in default_value()
74 bool is_first_arg_preferred(std::size_t a, std::size_t b) const override { in is_first_arg_preferred()
83 std::size_t active_value() override { in active_value()
98 std::size_t default_value() const override { in default_value()
125 bool is_first_arg_preferred(std::size_t, std::size_t) const override { in is_first_arg_preferred() argument
[all …]
H A Dallocator.cpp62 void* scalable_malloc(std::size_t);
64 void* scalable_aligned_malloc(std::size_t, std::size_t);
86 static void* initialize_cache_aligned_allocate_handler(std::size_t n, std::size_t alignment);
89 static void* std_cache_aligned_allocate(std::size_t n, std::size_t alignment);
95 using cache_aligned_allocate_handler_type = void* (*)(std::size_t n, std::size_t alignment);
167 static void* initialize_cache_aligned_allocate_handler(std::size_t bytes, std::size_t alignment) { in initialize_cache_aligned_allocate_handler()
175 static constexpr std::size_t nfs_size = 128;
177 std::size_t __TBB_EXPORTED_FUNC cache_line_size() { in cache_line_size()
182 const std::size_t cache_line_size = nfs_size; in cache_aligned_allocate()
205 static void* std_cache_aligned_allocate(std::size_t bytes, std::size_t alignment) { in std_cache_aligned_allocate()
[all …]
H A Ddynamic_link.cpp142 for( std::size_t k = 0; k < required; ++k ) in resolve_symbols()
195 const std::size_t ind = my_size++; in add()
201 const std::size_t size = my_size; in free()
202 for (std::size_t i=0; i<size; ++i) in free()
211 std::size_t _len;
262 std::size_t fname_len=0; in init_ap_data()
268 std::size_t rc; in init_ap_data()
313 static std::size_t abs_path( char const * name, char * path, std::size_t len ) { in abs_path()
317 std::size_t name_len = std::strlen( name ); in abs_path()
351 for ( std::size_t k = 0; k < required; ++k ) in weak_symbol_link()
[all …]

12345678910>>...13