Home
last modified time | relevance | path

Searched refs:s (Results 1 – 25 of 159) sorted by relevance

1234567

/oneTBB/examples/graph/fgbzip2/
H A Ddecompress.cpp77 s->seqToUnseq[s->nInUse] = i; in makeMaps_d()
102 s->bsBuff = (s->bsBuff << 8) | ((UInt32)(*((UChar*)(s->strm->next_in)))); \
470 uc = s->seqToUnseq[s->mtfa[s->mtfbase[0]]]; in BZ2_decompress()
533 s->mtfa[s->mtfbase[lno]] = s->mtfa[s->mtfbase[lno - 1] + MTFL_SIZE - 1]; in BZ2_decompress()
542 s->mtfa[k] = s->mtfa[s->mtfbase[i] + j]; in BZ2_decompress()
552 s->unzftab[s->seqToUnseq[uc]]++; in BZ2_decompress()
579 s->cftab[i] = s->unzftab[i - 1]; in BZ2_decompress()
581 s->cftab[i] += s->cftab[i - 1]; in BZ2_decompress()
606 s->cftabCopy[i] = s->cftab[i]; in BZ2_decompress()
625 s->tPos = s->origPtr; in BZ2_decompress()
[all …]
H A Dbzlib.cpp211 if (s->arr1 == nullptr || s->arr2 == nullptr || s->ftab == nullptr) { in BZ_API()
232 s->block = (UChar*)s->arr2; in BZ_API()
233 s->mtfv = (UInt16*)s->arr1; in BZ_API()
235 s->ptr = (UInt32*)s->arr1; in BZ_API()
254 s->inUse[s->state_in_ch] = True; in add_pair_to_block()
284 s->block[s->nblock] = ((UChar)(s->state_in_len - 4)); in add_pair_to_block()
383 *(s->strm->next_out) = s->zbits[s->state_out_pos]; in copy_output_until_stop()
474 if (s->avail_in_expect > 0 || !isempty_RL(s) || s->state_out_pos < s->numZ) in BZ_API()
487 if (s->avail_in_expect > 0 || !isempty_RL(s) || s->state_out_pos < s->numZ) in BZ_API()
599 s->state_out_ch = s->k0; in unRLE_obuf_to_output_FAST()
[all …]
H A Dcompress.cpp91 s->zbits[s->numZ] = (UChar)(s->bsBuff >> 24); in bsFinishWrite()
102 s->zbits[s->numZ] = (UChar)(s->bsBuff >> 24); \
139 s->unseqToSeq[i] = s->nInUse; in makeMaps_e()
380 s->len_pack[i][0] = (s->len[1][i] << 16) | s->len[0][i]; in sendMTFValues()
381 s->len_pack[i][1] = (s->len[3][i] << 16) | s->len[2][i]; in sendMTFValues()
382 s->len_pack[i][2] = (s->len[5][i] << 16) | s->len[4][i]; in sendMTFValues()
766 bsW(s, s->len[s->selector[selCtr]][mtfv[i]], s->code[s->selector[selCtr]][mtfv[i]]); in sendMTFValues()
783 s->combinedCRC = (s->combinedCRC << 1) | (s->combinedCRC >> 31); in BZ2_compressBlock()
799 s->zbits = (UChar*)(&((UChar*)s->arr2)[s->nblock]); in BZ2_compressBlock()
819 bsPutUInt32(s, s->blockCRC); in BZ2_compressBlock()
[all …]
H A Dbzlib_private.hpp195 s->rTPos = 0
201 s->rNToGo = BZ2_rNums[s->rTPos]; \
206 s->rNToGo--;
469 if (s->tPos >= (UInt32)100000 * (UInt32)s->blockSize100k) \
471 s->tPos = s->tt[s->tPos]; \
473 s->tPos >>= 8;
486 s->ll4[(i) >> 1] = (s->ll4[(i) >> 1] & 0xf0) | (n); \
488 s->ll4[(i) >> 1] = (s->ll4[(i) >> 1] & 0x0f) | ((n) << 4); \
503 if (s->tPos >= (UInt32)100000 * (UInt32)s->blockSize100k) \
505 cccc = BZ2_indexIntoF(s->tPos, s->cftab); \
[all …]
H A Dblocksort.cpp942 UInt16 s; in mainSort() local
988 s = (s >> 8) | (block[i] << 8); in mainSort()
990 ftab[s] = j; in mainSort()
992 s = (s >> 8) | (block[i - 1] << 8); in mainSort()
994 ftab[s] = j; in mainSort()
996 s = (s >> 8) | (block[i - 2] << 8); in mainSort()
998 ftab[s] = j; in mainSort()
1000 s = (s >> 8) | (block[i - 3] << 8); in mainSort()
1006 s = (s >> 8) | (block[i] << 8); in mainSort()
1231 fallbackSort(s->arr1, s->arr2, ftab, nblock, verb); in BZ2_blockSort()
[all …]
/oneTBB/src/tbb/
H A Drtm_rw_mutex.cpp43 s.m_mutex = nullptr; in release()
48 s.m_mutex = nullptr; in release()
53 s.m_mutex->unlock(); in release()
54 s.m_mutex = nullptr; in release()
87 s.m_mutex = &m; in acquire_writer()
127 s.m_mutex = &m; in acquire_reader()
144 s.m_mutex = &m; in acquire_reader()
145 s.m_mutex->lock_shared(); in acquire_reader()
164 release(s); in upgrade()
210 s.m_mutex = &m; in try_acquire_writer()
[all …]
H A Dqueuing_rw_mutex.cpp142 release_internal_lock(s); in unblock_or_wait_on_internal_lock()
164 s.my_mutex = &m; in acquire()
275 s.my_mutex = &m; in try_acquire()
316 acquire_internal_lock(s); in release()
411 s.initialize(); in release()
422 if( &s == s.my_mutex->q_tail.load(std::memory_order_seq_cst) ) { in downgrade_to_reader()
472 acquire_internal_lock(s); in upgrade_to_writer()
507 release_internal_lock(s); in upgrade_to_writer()
520 __TBB_ASSERT( me==&s, nullptr ); in upgrade_to_writer()
524 s.my_mutex->q_tail.compare_exchange_strong(expected, &s, std::memory_order_release); in upgrade_to_writer()
[all …]
H A Drtm_mutex.cpp38 switch(s.m_transaction_state) { in release()
42 s.m_mutex = nullptr; in release()
45 s.m_mutex->unlock(); in release()
46 s.m_mutex = nullptr; in release()
78 s.m_mutex = &m; in acquire()
86 s.m_mutex = &m; in acquire()
87 s.m_mutex->lock(); in acquire()
93 acquire(m, s, /*only_speculate=*/true); in try_acquire()
100 s.m_mutex = &m; in try_acquire()
112 return rtm_mutex_impl::try_acquire(m, s); in try_acquire()
[all …]
H A Ddynamic_link.h47 #define DLD(s,h) {#s, (pointer_to_handler*)(void*)(&h), (pointer_to_handler)&s} argument
48 #define DLD_NOWEAK(s,h) {#s, (pointer_to_handler*)(void*)(&h), nullptr} argument
50 #define DLD(s,h) {#s, (pointer_to_handler*)(void*)(&h)} argument
51 #define DLD_NOWEAK(s,h) DLD(s,h) argument
H A Denvironment.h39 if ( const char* s = std::getenv(name) ) {
43 size_t index = std::strspn(s, " ");
44 if (s[index] != '1') return false;
50 index += std::strspn(&s[index], " ");
51 return !s[index];
57 if ( const char* s = std::getenv(name) ) {
60 long value = std::strtol(s, &end, 10);
63 if ( errno == ERANGE || value < 0 || end==s ) {
/oneTBB/examples/parallel_for/tachyon/src/
H A Dsphere.cpp66 sphere *s; in newsphere() local
72 s->tex = (texture *)tex; in newsphere()
73 s->ctr = ctr; in newsphere()
74 s->rad = rad; in newsphere()
76 return (object *)s; in newsphere()
82 min->x = s->ctr.x - s->rad; in sphere_bbox()
83 min->y = s->ctr.y - s->rad; in sphere_bbox()
84 min->z = s->ctr.z - s->rad; in sphere_bbox()
85 max->x = s->ctr.x + s->rad; in sphere_bbox()
86 max->y = s->ctr.y + s->rad; in sphere_bbox()
[all …]
H A Dvector.cpp107 void VScale(vector *a, flt s) { in VScale() argument
108 a->x *= s; in VScale()
109 a->y *= s; in VScale()
110 a->z *= s; in VScale()
114 a->r += b->r * s; in ColorAddS()
115 a->g += b->g * s; in ColorAddS()
116 a->b += b->b * s; in ColorAddS()
125 void ColorScale(color *a, flt s) { in ColorScale() argument
126 a->r *= s; in ColorScale()
127 a->g *= s; in ColorScale()
[all …]
H A Dcylinder.cpp92 flt t, s, tin, tout, ln, d; in cylinder_intersect() local
125 VDOT(s, ry->d, O); in cylinder_intersect()
126 s = fabs(sqrt(cyl->rad * cyl->rad - d * d) / s); in cylinder_intersect()
127 tin = t - s; in cylinder_intersect()
129 tout = t + s; in cylinder_intersect()
205 flt t, s, tin, tout, ln, d, tmp, tmp3; in fcylinder_intersect() local
230 VDOT(s, ry->d, O); in fcylinder_intersect()
231 s = fabs(sqrt(cyl->rad * cyl->rad - d * d) / s); in fcylinder_intersect()
232 tin = t - s; in fcylinder_intersect()
248 tout = t + s; in fcylinder_intersect()
/oneTBB/include/oneapi/tbb/
H A Dspin_rw_mutex.h68 state_type s = m_state.load(std::memory_order_relaxed); in lock() local
69 if (!(s & BUSY)) { // no readers, no writers in lock()
70 if (m_state.compare_exchange_strong(s, WRITER)) in lock()
84 state_type s = m_state.load(std::memory_order_relaxed); in try_lock() local
86 if (m_state.compare_exchange_strong(s, WRITER)) { in try_lock()
104 state_type s = m_state.load(std::memory_order_relaxed); in lock_shared() local
121 state_type s = m_state.load(std::memory_order_relaxed); in try_lock_shared() local
122 if (!(s & (WRITER | WRITER_PENDING))) { // no writers in try_lock_shared()
148 state_type s = m_state.load(std::memory_order_relaxed); in upgrade() local
153 while ((s & READERS) == ONE_READER || !(s & WRITER_PENDING)) { in upgrade()
[all …]
H A Drw_mutex.h75 state_type s = m_state.load(std::memory_order_relaxed); in try_lock() local
76 if (!(s & BUSY)) { // no readers, no writers; mask is 1..1101 in try_lock()
77 if (m_state.compare_exchange_strong(s, WRITER)) { in try_lock()
151 state_type s = m_state.load(std::memory_order_relaxed); in upgrade() local
152 __TBB_ASSERT(s & READERS, "invalid state before upgrade: no readers "); in upgrade()
156 while ((s & READERS) == ONE_READER || !(s & WRITER_PENDING)) { in upgrade()
157 if (m_state.compare_exchange_strong(s, s | WRITER | WRITER_PENDING)) { in upgrade()
/oneTBB/examples/graph/som/
H A Dsom.cpp38 for (int i = 0; i < (int)s.w.size(); ++i) { in operator <<()
39 out << s.w[i]; in operator <<()
40 if (i < (int)s.w.size() - 1) { in operator <<()
48 void remark_SOM_element(const SOM_element &s) { in remark_SOM_element() argument
50 for (int i = 0; i < (int)s.w.size(); ++i) { in remark_SOM_element()
51 printf("%g", s.w[i]); in remark_SOM_element()
52 if (i < (int)s.w.size() - 1) { in remark_SOM_element()
61 out << std::get<RADIUS>(s); in operator <<()
62 out << ", " << std::get<XV>(s); in operator <<()
64 out << std::get<YV>(s); in operator <<()
[all …]
H A Dsom.hpp39 std::ostream &operator<<(std::ostream &out, const search_result_type &s);
72 void remark_SOM_element(const SOM_element &s);
80 friend std::ostream &operator<<(std::ostream &out, const SOM_element &s);
81 friend void remark_SOM_element(const SOM_element &s);
154 SOM_element &at(search_result_type const &s) { in at() argument
155 return my_map[std::get<1>(s)][std::get<2>(s)]; in at()
157 void epoch_update(SOM_element const &s, in epoch_update() argument
172 void epoch_update_range(SOM_element const &s,
183 double BMU(const SOM_element &s, int &xval, int &yval) { in BMU() argument
185 return BMU_range(s, xval, yval, br); in BMU()
[all …]
/oneTBB/python/rml/
H A Dipc_server.cpp78 pthread_attr_t s; in launch() local
527 if( s==st_normal || s==st_starting ) { in start_shutdown()
535 if( s==st_normal ) in start_shutdown()
544 if( s==st_normal || s==st_starting ) { in start_stopping()
552 if( s==st_normal ) in start_stopping()
617 state_t s = st_starting; in wake_or_launch() local
619 if( st_starting!=s ) { in wake_or_launch()
716 state_t s = st_starting; in wake_or_launch() local
718 if( st_starting!=s ) { in wake_or_launch()
803 state_t s = st_starting; in wake_or_launch() local
[all …]
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_regression.cpp129 for (int s=0; allocSz[s]; s++) { in TestAlignedMsize() local
131 p[i] = (char*)scalable_aligned_malloc(allocSz[s], align[a]); in TestAlignedMsize()
137 … CHECK_FAST_MESSAGE(objSizes[i] >= allocSz[s], "allocated size must be not less than requested"); in TestAlignedMsize()
146 p[i] = (char*)scalable_aligned_realloc(p[i], 2*allocSz[s], align[a]); in TestAlignedMsize()
148 memset((char*)p[i]+allocSz[s], i+1, allocSz[s]); in TestAlignedMsize()
151 for (unsigned j=0; j<allocSz[s]; j++) in TestAlignedMsize()
153 for (size_t j=allocSz[s]; j<2*allocSz[s]; j++) in TestAlignedMsize()
/oneTBB/test/common/
H A Dstate_trackable.h44 State( const State& s ) : state(Unspecified) { in State()
45 assign_new_state(s.state); in State()
48 State( StateValue s ) noexcept : state(Unspecified) { in State()
49 assign_new_state(s); in State()
57 State& operator=( StateValue s ) noexcept {
58 assign_new_state(s);
64 void assign_new_state( StateValue s ) noexcept;
90 void StateTrackableBase::State::assign_new_state( StateValue s ) noexcept { in assign_new_state() argument
92 CHECK_FAST_MESSAGE((s == StateTrackableBase::Unspecified || in assign_new_state()
93 … StateTrackableCounters::counters.find(s) != StateTrackableCounters::counters.end()), in assign_new_state()
[all …]
/oneTBB/test/conformance/
H A Dconformance_composite_node.cpp95 oneapi::tbb::flow::split_node< std::tuple<int, int> > s(g);
119 a_node.add_visible_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
120 a_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
135 b_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
150 c_node.add_nodes(src, fxn, m_fxn, bc, lim, ind, s, ct, j, q, bf, pq, wo, ovw, seq);
162 split_node<std::tuple<int, int, int, int>> s(g);
167 make_edge(output_port<0>(s), input_port<0>(a0));
168 make_edge(output_port<1>(s), input_port<1>(a0));
171 make_edge(output_port<2>(s), input_port<1>(a1));
174 make_edge(output_port<3>(s), input_port<1>(a2));
[all …]
/oneTBB/examples/common/utility/
H A Dutility.hpp43 std::stringstream stream(s); in string_to()
52 dest_type string_to(std::string const& s) { in string_to() argument
54 return string_to(s, result); in string_to()
108 if (is_bool && s.empty()) { in parse_and_store()
115 internal::string_to(s, target); in parse_and_store()
136 static bool is_null_c_str(char* s) { in is_null_c_str() argument
137 return s == nullptr; in is_null_c_str()
184 p_type->parse_and_store(s); in parse_and_store()
485 std::string s; in operator >>() local
486 i >> s; in operator >>()
[all …]
/oneTBB/test/tbb/
H A Dtest_function_node.cpp100 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels() local
116 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels() local
117 size_t n = senders[s]->my_received; in buffered_levels()
186 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels_with_copy() local
199 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels_with_copy() local
200 size_t n = senders[s]->my_received; in buffered_levels_with_copy()
202 CHECK( senders[s]->my_receiver.load(std::memory_order_relaxed) == &exe_node ); in buffered_levels_with_copy()
294 for (size_t s = 0; s < num_senders; ++s ) { in concurrency_levels() local
306 for (size_t s = 0; s < num_senders; ++s ) { in concurrency_levels() local
307 size_t n = senders[s]->my_received; in concurrency_levels()
[all …]
H A Dtest_multifunction_node.cpp92 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels() local
108 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels() local
109 size_t n = senders[s]->my_received; in buffered_levels()
177 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels_with_copy() local
190 for (size_t s = 0; s < num_senders; ++s ) { in buffered_levels_with_copy() local
191 size_t n = senders[s]->my_received; in buffered_levels_with_copy()
193 … CHECK_MESSAGE( senders[s]->my_receiver.load(std::memory_order_relaxed) == &exe_node, "" ); in buffered_levels_with_copy()
281 for (size_t s = 0; s < num_senders; ++s ) { in concurrency_levels() local
292 for (size_t s = 0; s < num_senders; ++s ) { in concurrency_levels() local
293 size_t n = senders[s]->my_received; in concurrency_levels()
[all …]
H A Dtest_composite_node.cpp49 my_input_body(int f, int s) : start(1), finish(f), step(s) {} in my_input_body() argument
227 tbb::flow::make_edge( s, tbb::flow::input_port<0>(a0) ); in test_adder()
242 s.try_put(i); in test_adder()
266 s.try_put(i); in test_adder()
347 tbb::flow::split_node< my_tuple_t > s; member in prefix_node
365 tbb::flow::make_edge( f, s ); in prefix_node()
369 …:output_port<0>(s), tbb::flow::output_port<1>(s), tbb::flow::output_port<2>(s), tbb::flow::output_… in prefix_node()
374 base_type::add_nodes(j,s,f); in prefix_node()
376 base_type::add_visible_nodes(j,s,f); in prefix_node()
393 …CHECK_MESSAGE( (&tbb::flow::output_port<1>(p.s) == &tbb::flow::output_port<1>(p.s)), "output port … in test_prefix()
[all …]

1234567