Home
last modified time | relevance | path

Searched refs:size (Results 1 – 25 of 175) sorted by relevance

1234567

/oneTBB/src/tbbmalloc/
H A Dlarge_objects.h53 static size_t alignToBin(size_t size) { in alignToBin()
54 return alignUp(size, CacheStep); in alignToBin()
57 static int sizeToIdx(size_t size) { in sizeToIdx()
58 MALLOC_ASSERT(MinSize <= size && size < MaxSize, ASSERT_TEXT); in sizeToIdx()
89 static int sizeToIdx(size_t size) { in sizeToIdx()
90 MALLOC_ASSERT(MinSize <= size && size <= MaxSize, ASSERT_TEXT); in sizeToIdx()
252 return Props::alignToBin(size); in alignToBin()
254 static int sizeToIdx(size_t size) { in sizeToIdx() argument
255 return Props::sizeToIdx(size); in sizeToIdx()
330 static int sizeToIdx(size_t size);
[all …]
H A Dfrontend.cpp541 int size; member in rml::internal::FreeBlockPool
1654 size--; in getBlock()
1689 size++; in returnBlock()
1875 size = alignUp(size, sizeof(size_t)); in allocate()
2169 size_t size = in findObjectSize() local
2171 MALLOC_ASSERT(size>0 && size<minLargeObjectSize, ASSERT_TEXT); in findObjectSize()
2172 return size; in findObjectSize()
2557 if (!size) size = sizeof(size_t); in internalPoolMalloc()
2651 if (!size) size = sizeof(size_t); in internalMalloc()
2762 if (!size) { in pool_realloc()
[all …]
H A Dlarge_objects.cpp66 return size < maxHugeSize && (size <= defaultMaxHugeSize || size >= hugeSizeThreshold); in sizeInCacheRange()
151 size_t size; member
173 size_t size; member
769 size_t size = 0; in getLOCSize() local
772 return size; in getLOCSize()
783 size_t size = 0; in getUsedSize() local
786 return size; in getUsedSize()
855 bin[idx].updateUsedSize(extMemPool, op==decrease? -size : size, &bitMask, idx); in updateCacheState()
887 if (size < maxLargeSize) in updateCacheState()
906 return size < maxLargeSize ? LargeCacheType::alignToBin(size) : HugeCacheType::alignToBin(size); in alignToBin()
[all …]
H A Dbackend.h312 void *allocRawMem(size_t &size);
313 bool freeRawMem(void *object, size_t size);
323 static int sizeToBin(size_t size) { in sizeToBin() argument
324 if (size >= maxBinned_HugePage) in sizeToBin()
326 else if (size < minBinnedSize) in sizeToBin()
329 int bin = (size - minBinnedSize)/freeBinsStep; in sizeToBin()
334 static bool toAlignedBin(FreeBlock *block, size_t size) { in toAlignedBin() argument
335 return isAligned((char*)block + size, slabSize) && size >= slabSize; in toAlignedBin()
352 LargeMemoryBlock *getLargeBlock(size_t size);
357 void *getBackRefSpace(size_t size, bool *rawMemUsed);
[all …]
H A Dbackend.cpp43 return MapMemory(size, pageType); in getRawMemory()
47 return UnmapMemory(object, size); in freeRawMemory()
83 void *Backend::allocRawMem(size_t &size) in allocRawMem() argument
121 size = allocSize; in allocRawMem()
128 totalMemSize.fetch_add(size); in allocRawMem()
141 totalMemSize.fetch_sub(size); in freeRawMem()
187 void unlock(size_t size) { in unlock() argument
236 void setMeFree(size_t size) { myL.unlock(size); } in setMeFree() argument
575 const size_t totalSize = num * size; in splitBlock()
867 lmb->unalignedSize = size; in getLargeBlock()
[all …]
/oneTBB/examples/graph/som/
H A Dsom.cpp38 for (int i = 0; i < (int)s.w.size(); ++i) { in operator <<()
40 if (i < (int)s.w.size() - 1) { in operator <<()
50 for (int i = 0; i < (int)s.w.size(); ++i) { in remark_SOM_element()
52 if (i < (int)s.w.size() - 1) { in remark_SOM_element()
80 if (teaching.size() == 0) in find_data_ranges()
90 for (int i = 0; i < (int)from.size(); ++i) { in add_fraction_of_difference()
97 for (int i = 0; i < (int)x.size(); ++i) { in distance_squared()
157 if (max_xiter > (int)my_map.size() - 1) in epoch_update_range()
158 max_xiter = (int)my_map.size() - 1; in epoch_update_range()
182 if (j == in.size()) in teach()
[all …]
H A Dsom.hpp90 for (std::size_t i = 0; i < size(); ++i) { in operator ==()
101 for (std::size_t i = 0; i < w.size(); ++i) in elementwise_max()
106 for (std::size_t i = 0; i < w.size(); ++i) in elementwise_min()
110 std::size_t size() const { in size() function in SOM_element
111 return w.size(); in size()
144 std::size_t size() { in size() function in SOMap
145 return my_map.size(); in size()
167 if (max_xiter > (int)my_map.size() - 1) in epoch_update()
168 max_xiter = (int)(my_map.size() - 1); in epoch_update()
184 subsquare_type br(0, (int)my_map.size(), 1, 0, (int)my_map[0].size(), 1); in BMU()
H A Dsom_graph.cpp138 xsize = ((int)map1.size() + xranges - 1) / xranges; in build_BMU_graph()
139 ysize = ((int)map1[0].size() + yranges - 1) / yranges; in build_BMU_graph()
155 for (int i = 0; i < (int)map1.size(); i += xsize) { in build_BMU_graph()
159 if (s_array[scnt]->size() != xindex + 1) { in build_BMU_graph()
162 (int)(s_array[scnt]->size()), in build_BMU_graph()
171 int xmax = (i + xsize) > (int)map1.size() ? (int)map1.size() : i + xsize; in build_BMU_graph()
172 int ymax = (j + ysize) > (int)map1[0].size() ? (int)map1[0].size() : j + ysize; in build_BMU_graph()
392 next_j = (epoch + 1) % in.size(); in graph_teach()
536 single_dist.reserve(my_teaching.size()); in main()
538 single_xval.reserve(my_teaching.size()); in main()
[all …]
/oneTBB/src/tbbmalloc_proxy/
H A Dproxy_overload_osx.h58 static size_t good_size(malloc_zone_t *, size_t size) in good_size() argument
60 return size; in good_size()
101 static void *impl_malloc(struct _malloc_zone_t *, size_t size);
102 static void *impl_calloc(struct _malloc_zone_t *, size_t num_items, size_t size);
103 static void *impl_valloc(struct _malloc_zone_t *, size_t size);
105 static void *impl_realloc(struct _malloc_zone_t *, void *ptr, size_t size);
106 static void *impl_memalign(struct _malloc_zone_t *, size_t alignment, size_t size);
109 static void impl_free_definite_size(struct _malloc_zone_t*, void *ptr, size_t size) in impl_free_definite_size() argument
111 __TBB_malloc_free_definite_size(ptr, size); in impl_free_definite_size()
142 zone.size = &impl_malloc_usable_size; in DoMallocReplacement()
[all …]
H A Dproxy.cpp187 void *PREFIX(malloc)(ZONE_ARG size_t size) __THROW in PREFIX()
189 return scalable_malloc(size); in PREFIX()
194 return scalable_calloc(num, size); in PREFIX()
214 return scalable_aligned_malloc(size, alignment); in PREFIX()
218 void *PREFIX(valloc)(ZONE_ARG size_t size) __THROW in PREFIX()
222 return scalable_aligned_malloc(size, memoryPageSize); in PREFIX()
248 void *pvalloc(size_t size) __THROW in pvalloc() argument
253 size = size? ((size-1) | (memoryPageSize-1)) + 1 : memoryPageSize; in pvalloc()
255 return scalable_aligned_malloc(size, memoryPageSize); in pvalloc()
300 void *__libc_realloc(void *ptr, size_t size) in __libc_realloc() argument
[all …]
/oneTBB/test/conformance/
H A Dconformance_concurrent_queue.cpp424 for (size_type size = 0; size < 1001; ++size) { in TestConstructors() local
440 for (size_type size=0; size < 1001; ++size) { in TestConstructors() local
450 CHECK_FAST(size == dst_queue2.size()); in TestConstructors()
464 CHECK(src_queue.size() == dst_queue3.size()); in TestConstructors()
476 CHECK_FAST(src_queue.size() == dst_queue4.size()); in TestConstructors()
488 CHECK(src_queue.size() == dst_queue5.size()); in TestConstructors()
505 CHECK(src_queue.size() == dst_queue5.size()); in TestConstructors()
517 for (size_type size = 0; size < 1001; ++size) { in TestConstructors() local
553 for (size_type size = 0; size < 1001; ++size) { in TestConstructors() local
1286 CHECK(q2.size() == size_type(vec.size())); in bounded_queue_specific_test()
[all …]
H A Dconformance_parallel_scan.cpp32 constexpr std::size_t size = 1000; variable
89 std::vector<int> input(size);
90 std::vector<int> output(size);
91 std::vector<int> control(size);
93 for(size_t i = 0; i < size; ++i) {
101 … parallel_scan_wrapper<Partitioner>()(oneapi::tbb::blocked_range<std::size_t>(0U, size, 1U), body);
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) {
[all …]
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_compliance.cpp166 void* Tmalloc(size_t size);
358 size_t size = 0, start = 0; in InvariantDataRealloc() local
381 size = sizeNew; in InvariantDataRealloc()
447 void* Tmalloc(size_t size) in Tmalloc() argument
451 void *ret = Rmalloc(size); in Tmalloc()
461 void *ret = Rcalloc(num, size); in Tcalloc()
504 size_t size; member
539 size_t count=arr[i].size*2; in AddrArifm()
543 arr[i].size = count; in AddrArifm()
546 arr[i].size = 0; in AddrArifm()
[all …]
/oneTBB/examples/common/gui/xcode/tbbExample/
H A DOpenGLView.m45 CGFloat full_height = imageRect.size.height;
47 imageRect.size.height=imageRect.size.width/ratio;
48 imageRect.origin.y=(full_height-imageRect.size.height)/2;
71 if ( (y-imageRect.origin.y) > 0 && y < (imageRect.origin.y + imageRect.size.height ))
72 …on_mouse_func( x*g_sizex/(imageRect.size.width), (y-imageRect.origin.y)*g_sizey/imageRect.size.hei…
97 glWindowPos2i(0, (int)self.visibleRect.size.height);
98 glPixelZoom( (float)self.visibleRect.size.width /(float)g_sizex,
99 -(float)self.visibleRect.size.height/(float)g_sizey);
119 …on_mouse_func(x*g_sizex/(int)rect.size.width,((int)rect.size.height-y)*g_sizey/(int)rect.size.heig…
136 const int x=(int)rect.size.width;
[all …]
H A Dmain.m28 *x=imageRect.size.width>imageRect.size.height?imageRect.size.width:imageRect.size.height;
29 *y=imageRect.size.width<imageRect.size.height?imageRect.size.width:imageRect.size.height;
/oneTBB/src/tbb/
H A Dallocator.cpp75 static void* initialize_allocate_handler(std::size_t size);
78 using allocate_handler_type = void* (*)(std::size_t size);
160 static void* initialize_allocate_handler(std::size_t size) { in initialize_allocate_handler() argument
163 return (*allocate_handler)(size); in initialize_allocate_handler()
181 void* __TBB_EXPORTED_FUNC cache_aligned_allocate(std::size_t size) { in cache_aligned_allocate() argument
186 if (size + cache_line_size < size) { in cache_aligned_allocate()
190 if (size == 0) size = 1; in cache_aligned_allocate()
192 …void* result = cache_aligned_allocate_handler.load(std::memory_order_acquire)(size, cache_line_siz… in cache_aligned_allocate()
250 void* __TBB_EXPORTED_FUNC allocate_memory(std::size_t size) { in allocate_memory() argument
251 void* result = allocate_handler.load(std::memory_order_acquire)(size); in allocate_memory()
/oneTBB/test/tbb/
H A Dtest_concurrent_vector.cpp281 REQUIRE( c.size() == vec.size() ); in Examine()
299 REQUIRE( c.size() == 5 ); in Examine()
723 CHECK(v.size() == 382);
724 while (v.size() < 737) {
727 CHECK(v.size() == 737);
730 CHECK(v.size() == 27);
734 CHECK(v.size() == 737);
737 CHECK(v.size() == 1);
738 while (v.size() < 40) {
741 CHECK(v.size() == 40);
[all …]
/oneTBB/test/common/
H A Dutils_concurrency_limit.h180 const size_t size = CPU_ALLOC_SIZE(ncpus); in get_thread_affinity_mask() local
181 CPU_ZERO_S(size, mask); in get_thread_affinity_mask()
182 const int err = sched_getaffinity(0, size, mask); in get_thread_affinity_mask()
192 const size_t size = CPU_ALLOC_SIZE(ncpus); in get_thread_affinity_mask() local
193 const int num_cpus = CPU_COUNT_S(size, mask); in get_thread_affinity_mask()
195 if (CPU_ISSET_S(i, size, mask)) { in get_thread_affinity_mask()
204 const size_t size = CPU_ALLOC_SIZE(ncpus); in pin_thread_imp() local
206 ASSERT(free_indexes.size() > 0, nullptr); in pin_thread_imp()
211 CPU_ZERO_S(size, target_mask); in pin_thread_imp()
212 CPU_SET_S(mapped_idx, size, target_mask); in pin_thread_imp()
[all …]
H A Dconcurrent_associative_common.h157 REQUIRE_MESSAGE(cont1.size() == cont2.size(), "Incorrect count of elements was erased");
556 typename T::size_type size;
1137 if (!(!c.empty() && c.size() == lst.size() && c.max_size() >= c.size())) {
1140 std::cout << "sizes equal? " << (c.size() == lst.size()) << std::endl;
1145 REQUIRE((!c.empty() && c.size() == lst.size() && c.max_size() >= c.size()));
1155 REQUIRE(c.size() == constC.size());
1173 REQUIRE(c2.size() == lst.size());
1174 REQUIRE(c.size() == 5);
1179 REQUIRE(c2.size() == 0);
1252 std::size_t size() const {
[all …]
H A Dconcurrent_priority_queue_common.h34 v.reserve(cpq.size()); in toVector()
64 REQUIRE((!q1.empty() && q1.size() == vec_sorted.size())); in examine()
68 REQUIRE((q2.empty() && !q2.size() && !q2.try_pop(elem))); in examine()
80 REQUIRE((q1.empty() && !q1.size())); in examine()
81 REQUIRE((!q2.empty() && q2.size() == vec_sorted.size())); in examine()
84 REQUIRE((q2.empty() && !q2.size())); in examine()
85 REQUIRE((!q1.empty() && q1.size() == vec_sorted.size())); in examine()
101 REQUIRE_MESSAGE(vec.size() >= 5, "Array should have at least 5 elements"); in type_tester()
324 qsize = q.size(); in test_parallel_push_pop()
330 REQUIRE_MESSAGE(q.size() == 0, "Failed pop empty test"); in test_parallel_push_pop()
[all …]
/oneTBB/doc/main/reference/scalable_memory_pools/
H A Dfixed_pool_cls.rst9 A class for scalable memory allocation from a buffer of fixed size.
41 fixed_pool(void *buffer, size_t size);
47 void* malloc(size_t size);
49 void* realloc(void* ptr, size_t size);
57 .. cpp:function:: fixed_pool(void *buffer, size_t size)
59 …**Effects**: Constructs a memory pool to manage the memory of size ``size`` pointed to by ``buffer…
/oneTBB/include/oneapi/tbb/
H A Dparallel_sort.h66 std::size_t offset = range.size / 8u; in pseudo_median_of_nine()
81 std::size_t j = range.size; in split_range()
105 std::size_t new_range_size = range.size - i; in split_range()
106 range.size = j; in split_range()
117 std::size_t size; variable
121 comp(comp_), size(size_), begin(begin_) {} in quick_sort_range()
123 bool empty() const { return size == 0; } in empty()
124 bool is_divisible() const { return size >= grainsize; } in is_divisible()
128 , size(split_range(range)) in quick_sort_range()
131 , begin(range.begin + range.size + 1) {} in quick_sort_range()
[all …]
H A Dscalable_allocator.h51 TBBMALLOC_EXPORT void* __TBB_EXPORTED_FUNC scalable_malloc(size_t size);
59 TBBMALLOC_EXPORT void* __TBB_EXPORTED_FUNC scalable_realloc(void* ptr, size_t size);
63 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 …
186 TBBMALLOC_EXPORT void *pool_malloc(MemoryPool* memPool, std::size_t size);
187 TBBMALLOC_EXPORT void *pool_realloc(MemoryPool* memPool, void *object, std::size_t size);
188 TBBMALLOC_EXPORT void *pool_aligned_malloc(MemoryPool* mPool, std::size_t size, std::size_t alignme…
189 TBBMALLOC_EXPORT void *pool_aligned_realloc(MemoryPool* mPool, void *ptr, std::size_t size, std::si…
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_bench.cpp113 ss << P.size() << " nodes in bucket" in divide()
124 assert(P.size() >= 2); in divide_and_conquer()
128 if (P_reduced.size() < 2) { in divide_and_conquer()
142 if (points.size() < 2) { in quickhull()
205 vect.grow_to_at_least(size); in grow_vector_to_at_least()
225 if (vect.size() < size) { in grow_vector_to_at_least()
226 vect.resize(size); in grow_vector_to_at_least()
516 ss << P.size() << " nodes in bucket" in divide()
527 assert(P.size() >= 2); in divide_and_conquer()
539 if (P_reduced.size() < 2) { in divide_and_conquer()
[all …]
/oneTBB/doc/main/tbb_userguide/
H A DPartitioner_Summary.rst23 - Chunksize bounded by grain size.
26 - Automatic chunk size.
29 - Automatic chunk size, cache affinity and uniform distribution of iterations.
32 …- Deterministic chunk size, cache affinity and uniform distribution of iterations without loa…
50 - The subrange size for ``operator()`` must not exceed a limit. That
52 temporary array proportional to the size of the range. With a limited
53 subrange size, you can use an automatic variable for the array

1234567