Home
last modified time | relevance | path

Searched refs:base (Results 1 – 22 of 22) sorted by relevance

/oneTBB/examples/parallel_for/tachyon/src/
H A Dapigeom.cpp197 static void adjust(apiflt *base, in adjust() argument
210 if (base[x + (xres * y)] == 0.0) { in adjust()
213 v = (base[xa + (xres * ya)] + base[xb + (xres * yb)]) / 2.0 + in adjust()
220 base[x + (xres * y)] = v; in adjust()
240 if (base[x + xres * y] == 0.0) { in subdivide()
241 base[x + (xres * y)] = (base[x1 + xres * y1] + base[x2 + xres * y1] + base[x2 + xres * y2] + in subdivide()
242 base[x1 + xres * y2]) / in subdivide()
246 subdivide(base, xres, yres, wx, wy, x1, y1, x, y); in subdivide()
247 subdivide(base, xres, yres, wx, wy, x, y1, x2, y); in subdivide()
248 subdivide(base, xres, yres, wx, wy, x, y, x2, y2); in subdivide()
[all …]
/oneTBB/test/common/
H A Dutils_dynamic_libs.h73 #define TEST_LIBRARY_NAME(base) PREFIX base SUFFIX1 ".dll" argument
75 #define TEST_LIBRARY_NAME(base) PREFIX base SUFFIX1 ".dylib" argument
77 #define TEST_LIBRARY_NAME(base) PREFIX base SUFFIX1 ".so" argument
H A Ddoctest.h2220 #define DOCTEST_IMPLEMENT_FIXTURE(der, base, func, decorators) \
2222 struct der : public base \
2623 #define DOCTEST_IMPLEMENT_FIXTURE(der, base, func, name) \
2626 struct der : public base \
/oneTBB/examples/graph/fgbzip2/
H A Dhuffman.cpp221 Int32 *base, in BZ2_hbCreateDecodeTables() argument
238 base[i] = 0; in BZ2_hbCreateDecodeTables()
240 base[length[i] + 1]++; in BZ2_hbCreateDecodeTables()
243 base[i] += base[i - 1]; in BZ2_hbCreateDecodeTables()
250 vec += (base[i + 1] - base[i]); in BZ2_hbCreateDecodeTables()
255 base[i] = ((limit[i - 1] + 1) << 1) - base[i]; in BZ2_hbCreateDecodeTables()
H A Ddecompress.cpp127 gBase = &(s->base[gSel][0]); \
409 &(s->base[j][0]), in BZ2_decompress()
H A Dbzlib_private.hpp433 Int32 base[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE]; member
/oneTBB/src/tbb/
H A Dallocator.cpp219 std::uintptr_t base = reinterpret_cast<std::uintptr_t>(std::malloc(space)); in std_cache_aligned_allocate()
220 if (!base) { in std_cache_aligned_allocate()
223 std::uintptr_t result = (base + nfs_size) & ~(nfs_size - 1); in std_cache_aligned_allocate()
225 …__TBB_ASSERT((result - base) >= sizeof(std::uintptr_t), "Cannot store a base pointer to the header… in std_cache_aligned_allocate()
226 __TBB_ASSERT(space - (result - base) >= bytes, "Not enough space for the storage"); in std_cache_aligned_allocate()
229 (reinterpret_cast<std::uintptr_t*>(result))[-1] = base; in std_cache_aligned_allocate()
243 std::uintptr_t base = (reinterpret_cast<std::uintptr_t*>(p))[-1]; in std_cache_aligned_deallocate()
244 …__TBB_ASSERT(((base + nfs_size) & ~(nfs_size - 1)) == reinterpret_cast<std::uintptr_t>(p), "Incorr… in std_cache_aligned_deallocate()
245 std::free(reinterpret_cast<void*>(base)); in std_cache_aligned_deallocate()
H A Dscheduler_common.h568 inline std::uintptr_t calculate_stealing_threshold(std::uintptr_t base, std::size_t stack_size) { in calculate_stealing_threshold() argument
570 __TBB_ASSERT(base > stack_size / 2, "Stack anchor calculation overflow"); in calculate_stealing_threshold()
571 return base - stack_size / 2; in calculate_stealing_threshold()
/oneTBB/include/oneapi/tbb/
H A Dcache_aligned_allocator.h125 std::uintptr_t base = reinterpret_cast<std::uintptr_t>(m_upstream->allocate(space)); in do_allocate() local
126 __TBB_ASSERT(base != 0, "Upstream resource returned nullptr."); in do_allocate()
129 std::uintptr_t result = (base + cache_line_alignment) & ~(cache_line_alignment - 1); in do_allocate()
130 …__TBB_ASSERT((result - base) >= sizeof(std::uintptr_t), "Can`t store a base pointer to the header"… in do_allocate()
131 __TBB_ASSERT(space - (result - base) >= bytes, "Not enough space for the storage"); in do_allocate()
134 (reinterpret_cast<std::uintptr_t*>(result))[-1] = base; in do_allocate()
141 std::uintptr_t base = (reinterpret_cast<std::uintptr_t*>(ptr))[-1]; in do_deallocate() local
142 …m_upstream->deallocate(reinterpret_cast<void*>(base), correct_size(bytes) + correct_alignment(alig… in do_deallocate()
H A Dpartitioner.h428 void align_depth(depth_t base) { in align_depth()
429 __TBB_ASSERT(base <= my_max_depth, nullptr); in align_depth()
430 my_max_depth -= base; in align_depth()
H A Denumerable_thread_specific.h800 static void* create_local_by_copy( ets_base<ETS_key_type>& base, void* p ) {
801 enumerable_thread_specific& ets = static_cast<enumerable_thread_specific&>(base);
807 static void* create_local_by_move( ets_base<ETS_key_type>& base, void* p ) {
808 enumerable_thread_specific& ets = static_cast<enumerable_thread_specific&>(base);
H A Dconcurrent_hash_map.h709 …bucket_accessor( concurrent_hash_map *base, const hashcode_type h, bool writer = false ) { acquire… in __TBB_requires()
711 … inline void acquire( concurrent_hash_map *base, const hashcode_type h, bool writer = false ) { in __TBB_requires()
712 my_b = base->get_bucket( h ); in __TBB_requires()
717 …if (rehash_required(my_b->node_list.load(std::memory_order_relaxed))) base->rehash_bucket(my_b, h)… in __TBB_requires()
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_queue_base.h111 size_type prepare_page( ticket_type k, queue_rep_type& base, page_allocator_type page_allocator, in prepare_page() argument
120 ++base.n_invalid_entries; in prepare_page()
126 spin_wait_until_my_turn(tail_counter, k, base); in prepare_page()
145 … void push( ticket_type k, queue_rep_type& base, queue_allocator_type& allocator, Args&&... args ) in push() argument
149 size_type index = prepare_page(k, base, page_allocator, p); in push()
155 ++base.n_invalid_entries; in push()
169 void abort_push( ticket_type k, queue_rep_type& base, queue_allocator_type& allocator ) { in abort_push() argument
171 prepare_page(k, base, allocator, p); in abort_push()
172 ++base.n_invalid_entries; in abort_push()
176 bool pop( void* dst, ticket_type k, queue_rep_type& base, queue_allocator_type& allocator ) { in pop() argument
[all …]
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_compliance.cpp361 *base = (char*)Tmalloc(2*maxAllocSize); in InvariantDataRealloc() local
363 REQUIRE(base); in InvariantDataRealloc()
367 *(unsigned short*)(base+k) = fastRandom.get(); in InvariantDataRealloc()
378 REQUIRE_MESSAGE(!memcmp(ptrNew, base+start, utils::min(size, sizeNew)), "broken data"); in InvariantDataRealloc()
385 memcpy(ptr, base+start, size); in InvariantDataRealloc()
392 Tfree(base); in InvariantDataRealloc()
/oneTBB/test/conformance/
H A Dconformance_concurrent_vector.cpp756 iterator base; member
760 REPORT("ERROR for v[%ld]\n", long(i - base)); in operator ()()
762 *i = int(i-base); in operator ()()
765 AssignElement( iterator base_ ) : base(base_) {} in AssignElement()
770 iterator base; member
773 if (*i != int(i-base)) { in operator ()()
774 REPORT("ERROR for v[%ld]\n", long(i-base)); in operator ()()
778 CheckElement( iterator base_ ) : base(base_) {} in CheckElement()
/oneTBB/src/tbbmalloc_proxy/
H A Dfunction_replacement.cpp139 MemoryBuffer(void *base, DWORD size) in MemoryBuffer()
141 m_base = Ptr2Addrint(base); in MemoryBuffer()
/oneTBB/doc/main/intro/
H A Dnotation.rst97 - Method ``x()`` is inherited from a protected base class.
H A DBenefits.rst60 specify interfaces in terms of specific types or base classes.
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DLocal_Serializer.rst135 // Abstract base class for a prioritized piece of work.
166 completely hidden from the base class, thus permitting the framework
H A DNon-Preemptive_Priorities.rst94 // Abstract base class for a prioritized piece of work.
/oneTBB/.github/workflows/
H A Dci.yml124 $(git diff --diff-filter=d --name-only ${{ github.event.pull_request.base.sha }})
/oneTBB/doc/
H A DDoxyfile.in143 # operators of the base classes will not be shown.
476 # 'anonymous_namespace{file}', where file will be replaced with the base name of
1200 # that these files will be copied to the base HTML output directory. Use the
2181 # (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
2221 # to run in parallel. When set to 0 doxygen will base this on the number of