Home
last modified time | relevance | path

Searched refs:l (Results 1 – 25 of 36) sorted by relevance

12

/oneTBB/examples/parallel_for/tachyon/src/
H A Dlight.cpp66 point_light *l; in newlight() local
69 memset(l, 0, sizeof(point_light)); in newlight()
70 l->methods = &light_methods; in newlight()
72 l->tex = (texture *)tex; in newlight()
73 l->ctr = ctr; in newlight()
74 l->rad = rad; in newlight()
76 return l; in newlight()
91 VSUB(l->ctr, ry->o, V); in light_intersect()
95 disc = b * b + l->rad * l->rad - temp; in light_intersect()
104 add_intersection(t2, (object *)l, ry); in light_intersect()
[all …]
/oneTBB/examples/graph/fgbzip2/
H A Ddecompress.cpp430 Int32 l, j, k; in BZ2_decompress() local
432 for (l = 256 / MTFL_SIZE - 1; l >= 0; l--) { in BZ2_decompress()
437 s->mtfbase[l] = k + 1; in BZ2_decompress()
504 l = s->mtfbase[0]; in BZ2_decompress()
505 uc = s->mtfa[l + nn]; in BZ2_decompress()
507 Int32 z = l + nn; in BZ2_decompress()
515 s->mtfa[(l + nn)] = s->mtfa[(l + nn) - 1]; in BZ2_decompress()
518 s->mtfa[l] = uc; in BZ2_decompress()
525 uc = s->mtfa[l]; in BZ2_decompress()
527 s->mtfa[l] = s->mtfa[l - 1]; in BZ2_decompress()
[all …]
H A DREADME.md21 fgbzip2 [-b=value] [-v] [-l=value] [-async] [filename=value] [-h] [filename]
26 * `-l` - use memory limit for compression algorithm with 1 MB (minimum) granularity.
H A Dblocksort.cpp274 Int32 H, i, j, k, l, r, cc, cc1; in fallbackSort() local
348 l = k - 1; in fallbackSort()
349 if (l >= nblock) in fallbackSort()
364 if (r > l) { in fallbackSort()
365 nNotDone += (r - l + 1); in fallbackSort()
366 fallbackQSort3(fmap, eclass, l, r); in fallbackSort()
370 for (i = l; i <= r; i++) { in fallbackSort()
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_cache_impl.h243 typename mutex_type::scoped_lock l(my_mutex, true); in register_successor()
251 typename mutex_type::scoped_lock l(my_mutex, true); in remove_successor()
262 typename mutex_type::scoped_lock l(my_mutex, false); in empty()
296 typename mutex_type::scoped_lock l(my_mutex, true); in register_successor()
308 typename mutex_type::scoped_lock l(my_mutex, true); in remove_successor()
321 typename mutex_type::scoped_lock l(my_mutex, false); in empty()
348 typename mutex_type::scoped_lock l(this->my_mutex, /*write=*/true); in try_put_task()
372 typename mutex_type::scoped_lock l(this->my_mutex, /*write=*/true); in gather_successful_try_puts()
410 typename mutex_type::scoped_lock l(this->my_mutex, false); in size()
415 typename mutex_type::scoped_lock l(this->my_mutex, /*write=*/true); in try_put_task()
H A D_concurrent_skip_list.h100 for (size_type l = 0; l < height; ++l) { in create() local
101 allocator_traits::construct(alloc, &node->get_atomic_next(l), nullptr); in create()
109 for (size_type l = 0; l < node->height(); ++l) { in destroy() local
110 allocator_traits::destroy(alloc, &node->atomic_next(l)); in destroy()
699 const_range_type( const concurrent_skip_list& l) in const_range_type() argument
700 : my_end(l.end()), my_begin(l.begin()), in const_range_type()
720 range_type(const concurrent_skip_list& l) : const_range_type(l) {} in range_type() argument
/oneTBB/test/conformance/
H A Dconformance_blocked_range2d.cpp129 for( int l=0; l<N; ++l ) { in ParallelTest() local
130 if( Array[k][l] != (k<i && l<j) ) REQUIRE(false); in ParallelTest()
131 Array[k][l] = 0; in ParallelTest()
H A Dconformance_concurrent_unordered_map.cpp132 auto l = { ComplexTypeConst(1, "one"), ComplexTypeConst(2, "two")}; in test_deduction_guides() local
167 TMap m7(l); in test_deduction_guides()
171 TMap m8(l, 1); in test_deduction_guides()
175 TMap m9(l, 4, degenerate_hash<int>()); in test_deduction_guides()
179 TMap m10(l, 4, degenerate_hash<int>(), std::less<int>()); in test_deduction_guides()
183 TMap m11(l, 4, degenerate_hash<int>(), std::less<int>(), custom_allocator_type{}); in test_deduction_guides()
188 TMap m12(l, 4, custom_allocator_type{}); in test_deduction_guides()
193 TMap m13(l, 4, degenerate_hash<int>(), custom_allocator_type{}); in test_deduction_guides()
H A Dconformance_concurrent_unordered_set.cpp135 auto l = { ComplexType(&s), ComplexType(&s)}; in test_deduction_guides() local
168 TSet s7(l); in test_deduction_guides()
172 TSet s8(l, 5, degenerate_hash<ComplexType>()); in test_deduction_guides()
176 TSet s9(l, 5, degenerate_hash<ComplexType>(), std::less<ComplexType>()); in test_deduction_guides()
181 … TSet s10(l, 5, degenerate_hash<ComplexType>(), std::less<ComplexType>(), custom_allocator_type{}); in test_deduction_guides()
186 TSet s11(l, 5, custom_allocator_type{}); in test_deduction_guides()
191 TSet s12(l, 5, std::hash<ComplexType>(), custom_allocator_type{}); in test_deduction_guides()
H A Dconformance_blocked_range3d.cpp158 for( int l=0; l<N; ++l ) { in ParallelTest() local
161 if( Array[l][m][n] != (l<i && m<j && n<k) ) REQUIRE(false); in ParallelTest()
162 Array[l][m][n] = 0; in ParallelTest()
H A Dconformance_concurrent_priority_queue.cpp396 LessA<int> l(true); in test_ctors_dtor_accessors() local
409 cpq_with_compare_type cpq3(l); in test_ctors_dtor_accessors()
414 cpq_with_compare_and_allocator_type cpq4(l, a); in test_ctors_dtor_accessors()
419 cpq_with_compare_type cpq5(42, l); in test_ctors_dtor_accessors()
424 cpq_with_compare_and_allocator_type cpq6(42, l, a); in test_ctors_dtor_accessors()
439 cpq_with_compare_type cpq8(v.begin(), v.end(), l); in test_ctors_dtor_accessors()
562 auto l = {ComplexType(&s), ComplexType(&s) }; in TestDeductionGuides() local
583 TQueue ql(l); in TestDeductionGuides()
587 TQueue qla(l, std::allocator<ComplexType>()); in TestDeductionGuides()
592 TQueue qlc(l, LessA<ComplexType>(true)); in TestDeductionGuides()
[all …]
H A Dconformance_mutex.h214 typename M::scoped_lock l(mutex, /*write=*/false); in TestRWStateMultipleChange()
216 … CHECK_MESSAGE(l.downgrade_to_reader(), mutex_name << " downgrade must succeed for read lock"); in TestRWStateMultipleChange()
218 l.upgrade_to_writer(); in TestRWStateMultipleChange()
220 … CHECK_MESSAGE(l.upgrade_to_writer(), mutex_name << " upgrade must succeed for write lock"); in TestRWStateMultipleChange()
/oneTBB/src/tbb/tools_api/
H A Dittnotify_config.h287 #define __itt_fstrnlen(s, l) strnlen_s(s, l) argument
288 #define __itt_fstrcpyn(s1, b, s2, l) strncpy_s(s1, b, s2, l) argument
342 #define __itt_fstrnlen(s, l) SDL_STRNLEN_S(s, l) argument
344 #define __itt_fstrnlen(s, l) strlen(s) argument
347 #define __itt_fstrcpyn(s1, b, s2, l) SDL_STRNCPY_S(s1, b, s2, l) argument
349 #define __itt_fstrcpyn(s1, b, s2, l) { \ argument
353 volatile size_t num_to_copy = (size_t)(b - 1) < (size_t)(l) ? \
354 (size_t)(b - 1) : (size_t)(l); \
/oneTBB/include/oneapi/tbb/
H A Dparallel_sort.h60 …std::size_t median_of_three( const RandomAccessIterator& array, std::size_t l, std::size_t m, std:… in median_of_three() argument
61 …return comp(array[l], array[m]) ? ( comp(array[m], array[r]) ? m : ( comp(array[l], array[r]) ? r … in median_of_three()
62 … : ( comp(array[r], array[m]) ? m : ( comp(array[r], array[l]) ? r : l ) ); in median_of_three()
/oneTBB/test/tbb/
H A Dtest_partitioner.cpp181 custom_range(int l, int r, int g) : base_type(l, r, g) {} in custom_range() argument
192 custom_range_with_psplit(int l, int r, int g) : base_type(l, r, g) {} in custom_range_with_psplit() argument
H A Dtest_resumable_tasks.cpp375 bool& l = is_in_arena; in on_scheduler_entry() local
376 CHECK_MESSAGE(l == false, "The thread must call on_scheduler_entry only one time."); in on_scheduler_entry()
377 l = true; in on_scheduler_entry()
381 bool& l = is_in_arena; in on_scheduler_exit() local
382 …CHECK_MESSAGE(l == true, "The thread must call on_scheduler_entry before calling on_scheduler_exit… in on_scheduler_exit()
383 l = false; in on_scheduler_exit()
H A Dtest_mutex.h249 scoped_lock l(nrw_mutex);
250 CHECK(l.is_writer());
/oneTBB/doc/main/tbb_userguide/
H A Duse_limiter_node.rst56 limiter_node< big_object * > l( g, max_objects );
69 make_edge( l, f );
70 make_edge( f, l.decrement );
71 make_edge( s, l );
H A DData_Flow_Graph.rst154 src_body(int l) : my_limit(l), my_next_value(1) {}
/oneTBB/src/tbb/
H A Dconcurrent_monitor.h216 concurrent_monitor_mutex::scoped_lock l(my_mutex); in prepare_wait()
247 concurrent_monitor_mutex::scoped_lock l(my_mutex); in cancel_wait()
288 concurrent_monitor_mutex::scoped_lock l(my_mutex); in notify_one_relaxed()
327 concurrent_monitor_mutex::scoped_lock l(my_mutex); in notify_all_relaxed()
366 concurrent_monitor_mutex::scoped_lock l(my_mutex); in notify_relaxed()
401 concurrent_monitor_mutex::scoped_lock l(my_mutex); in notify_one_relaxed()
435 concurrent_monitor_mutex::scoped_lock l(my_mutex); in abort_all_relaxed()
/oneTBB/examples/graph/logic_sim/
H A Dbasics.hpp611 led_body(signal_t& s, std::string& l, bool r) in led_body() argument
613 label(l), in led_body()
637 led(oneapi::tbb::flow::graph& g, std::string l, bool rc = false) in led() argument
639 label(l), in led()
686 digit_body(unsigned int& s, std::string& l, bool& r) in digit_body() argument
688 label(l), in digit_body()
717 digit(oneapi::tbb::flow::graph& g, std::string l, bool rc = false) in digit() argument
719 label(l), in digit()
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp509 for (int l = j; l <= jlen; l++) { in GenerateMap() local
510 tempMap[k * ySize + l] = gNPolygons; in GenerateMap()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_pools.cpp437 size_t l, r; in TestFixedBufferPool() local
439 for (l = MAX_OBJECT/2, r = MAX_OBJECT + 1024*1024; l < r-1; ) { in TestFixedBufferPool()
440 size_t mid = (l+r)/2; in TestFixedBufferPool()
442 l = mid; in TestFixedBufferPool()
446 maxSz = l; in TestFixedBufferPool()
/oneTBB/integration/pkg-config/
H A Dtbb.pc.in23 Libs: -L${libdir} @_tbb_pc_extra_libdir@ -l@_tbb_pc_lib_name@
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A Dshortpath.cpp131 oneapi::tbb::spin_mutex::scoped_lock l(locks[u]); in shortpath_helper() local
143 oneapi::tbb::spin_mutex::scoped_lock l(locks[v]); in shortpath_helper() local

12