Home
last modified time | relevance | path

Searched refs:pos (Results 1 – 20 of 20) sorted by relevance

/oneTBB/src/tbb/
H A Dtask_stream.h56 inline void set_one_bit( std::atomic<population_t>& dest, int pos ) { in set_one_bit() argument
57 __TBB_ASSERT( pos>=0, nullptr); in set_one_bit()
58 __TBB_ASSERT( pos<int(sizeof(population_t)*CHAR_BIT), nullptr); in set_one_bit()
59 dest.fetch_or( one<<pos ); in set_one_bit()
63 __TBB_ASSERT( pos>=0, nullptr); in clear_one_bit()
64 __TBB_ASSERT( pos<int(sizeof(population_t)*CHAR_BIT), nullptr); in clear_one_bit()
65 dest.fetch_and( ~(one<<pos) ); in clear_one_bit()
68 inline bool is_bit_set( population_t val, int pos ) { in is_bit_set() argument
69 __TBB_ASSERT( pos>=0, nullptr); in is_bit_set()
70 __TBB_ASSERT( pos<int(sizeof(population_t)*CHAR_BIT), nullptr); in is_bit_set()
[all …]
H A Dintrusive_list.h57 iterator_impl( pointer_type pos ) : my_pos(pos) {} in iterator_impl() argument
/oneTBB/examples/getting_started/sub_string_finder/
H A Dsub_string_finder_pretty.cpp70 std::vector<std::size_t> pos(num_elem); in main() local
73 SubStringFinder(to_scan, max, pos)); in main()
85 if (j >= pos[i] && j < pos[i] + max[i]) in main()
H A Dsub_string_finder.cpp79 std::vector<std::size_t> pos(num_elem); in main() local
82 SubStringFinder(to_scan, max, pos)); in main()
86 std::cout << " " << max[i] << "(" << pos[i] << ")" in main()
/oneTBB/src/tbbmalloc/
H A Dtbbmalloc_internal.h189 int pos = WORD_LEN - idx % WORD_LEN - 1; in set() local
191 mask[i].fetch_or(1ULL << pos); in set()
193 mask[i].fetch_and(~(1ULL << pos)); in set()
198 int pos; in getMinTrue() local
202 pos = WORD_LEN - startIdx % WORD_LEN; in getMinTrue()
203 … uintptr_t actualMask = mask[idx].load(std::memory_order_relaxed) & (((uintptr_t)1<<pos) - 1); in getMinTrue()
205 if (-1 != (pos = BitScanRev(actualMask))) in getMinTrue()
206 return idx*WORD_LEN - pos - 1; in getMinTrue()
210 if (-1 != (pos = BitScanRev(mask[idx++].load(std::memory_order_relaxed)))) in getMinTrue()
211 return idx*WORD_LEN - pos - 1; in getMinTrue()
H A Dfrontend.cpp776 unsigned int pos; in highestBitPos() local
780 __asm__ ("bsr %1,%0" : "=r"(pos) : "r"(n)); in highestBitPos()
785 mov pos, eax in highestBitPos()
788 _BitScanReverse((unsigned long*)&pos, (unsigned long)n); in highestBitPos()
797 :"=r" (pos) :"r" (n), "I" (31) in highestBitPos()
801 pos = bsr[ n>>6 ]; in highestBitPos()
803 return pos; in highestBitPos()
/oneTBB/test/conformance/
H A Dconformance_arena_constraints.cpp49 auto pos = std::find_if(numa_nodes_info.begin(), numa_nodes_info.end(), variable
53 …REQUIRE_MESSAGE(pos != numa_nodes_info.end(), "Wrong, extra or repeated NUMA node index detected."…
54 numa_nodes_info.erase(pos);
/oneTBB/examples/parallel_for/tachyon/src/
H A Dtrace.tbb.cpp207 int pos = thread_id % NUM_COLORS; in operator ()() local
218 colors[pos][0] / d, colors[pos][1] / d, colors[pos][2] / d)); in operator ()()
237 x, y, local_mbox, serial, startx, stopx, starty, stopy, colors[pos], alpha); in operator ()()
H A Dgrid.cpp446 static int pos2grid(grid *g, vector *pos, gridindex *index) { in pos2grid() argument
447 index->x = (int)((pos->x - g->min.x) / g->voxsize.x); in pos2grid()
448 index->y = (int)((pos->y - g->min.y) / g->voxsize.y); in pos2grid()
449 index->z = (int)((pos->z - g->min.z) / g->voxsize.z); in pos2grid()
462 if (pos->x < g->min.x || pos->x > g->max.x || pos->y < g->min.y || pos->y > g->max.y || in pos2grid()
463 pos->z < g->min.z || pos->z > g->max.z) in pos2grid()
H A Dgrid.hpp109 static int pos2grid(grid *g, vector *pos, gridindex *index);
/oneTBB/examples/graph/fgbzip2/
H A Dcompress.cpp591 UChar pos[BZ_N_GROUPS], ll_i, tmp2, tmp; in sendMTFValues() local
593 pos[i] = i; in sendMTFValues()
597 tmp = pos[j]; in sendMTFValues()
601 tmp = pos[j]; in sendMTFValues()
602 pos[j] = tmp2; in sendMTFValues()
604 pos[0] = tmp; in sendMTFValues()
H A Ddecompress.cpp362 UChar pos[BZ_N_GROUPS], tmp, v; in BZ2_decompress() local
364 pos[i] = i; in BZ2_decompress()
368 tmp = pos[v]; in BZ2_decompress()
370 pos[v] = pos[v - 1]; in BZ2_decompress()
373 pos[0] = tmp; in BZ2_decompress()
/oneTBB/src/tbbmalloc_proxy/
H A Dfunction_replacement.cpp305 const char* pos = strstr(pattern, "#*******"); in CorrectOffset() local
306 if( pos ) { in CorrectOffset()
307 address += (pos - pattern)/2; // compute the offset position in CorrectOffset()
/oneTBB/include/oneapi/tbb/detail/
H A D_concurrent_unordered_base.h494 iterator unsafe_erase( const_iterator pos ) { in unsafe_erase() argument
495 return iterator(first_value_node(internal_erase(pos.get_node_ptr()))); in unsafe_erase()
498 iterator unsafe_erase( iterator pos ) { in unsafe_erase() argument
499 return iterator(first_value_node(internal_erase(pos.get_node_ptr()))); in unsafe_erase()
522 node_type unsafe_extract( const_iterator pos ) { in unsafe_extract() argument
523 internal_extract(pos.get_node_ptr()); in unsafe_extract()
524 return node_handle_accessor::construct<node_type>(pos.get_node_ptr()); in unsafe_extract()
527 node_type unsafe_extract( iterator pos ) { in unsafe_extract() argument
528 internal_extract(pos.get_node_ptr()); in unsafe_extract()
529 return node_handle_accessor::construct<node_type>(pos.get_node_ptr()); in unsafe_extract()
H A D_concurrent_skip_list.h444 iterator unsafe_erase( iterator pos ) { in unsafe_erase() argument
445 std::pair<node_ptr, node_ptr> extract_result = internal_extract(pos); in unsafe_erase()
453 iterator unsafe_erase( const_iterator pos ) { in unsafe_erase() argument
454 return unsafe_erase(get_iterator(pos)); in unsafe_erase()
478 node_type unsafe_extract( const_iterator pos ) { in unsafe_extract() argument
479 std::pair<node_ptr, node_ptr> extract_result = internal_extract(pos); in unsafe_extract()
483 node_type unsafe_extract( iterator pos ) { in unsafe_extract() argument
484 return unsafe_extract(const_iterator(pos)); in unsafe_extract()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_pools.cpp41 size_t pos; member
49 pos(0), regions(0), in PoolSpace()
205 if (poolSpace[pool_id].pos + bytes > poolSpace[pool_id].bufSize) in CrossThreadGetMem()
208 void *ret = poolSpace[pool_id].space + poolSpace[pool_id].pos; in CrossThreadGetMem()
209 poolSpace[pool_id].pos += bytes; in CrossThreadGetMem()
H A Dtest_malloc_whitebox.cpp379 static size_t pos; in getMem() local
381 if (pos + bytes > BUF_SIZE) in getMem()
384 void *ret = space + pos; in getMem()
385 pos += bytes; in getMem()
/oneTBB/test/common/
H A Ddoctest.h702 String substr(size_type pos, size_type cnt = npos) &&;
705 size_type find(char ch, size_type pos = 0) const;
706 size_type rfind(char ch, size_type pos = npos) const;
3401 std::streampos pos = stack.back();
3806 String String::substr(size_type pos, size_type cnt) && {
3807 cnt = std::min(cnt, size() - 1 - pos);
3809 memmove(cptr, cptr + pos, cnt);
3815 cnt = std::min(cnt, size() - 1 - pos);
3816 return String{ c_str() + pos, cnt };
3822 const char* it = begin + pos;
[all …]
H A Dcustom_allocators.h527 PropagatingAllocator( bool& poca, bool& poma, bool& pos, bool& soc )
530 propagated_on_swap(&pos),
H A Dconcurrent_associative_common.h1248 const char& operator[] (std::size_t pos) const {
1249 return my_item[pos];