Home
last modified time | relevance | path

Searched refs:start (Results 1 – 25 of 43) sorted by relevance

12

/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull.hpp132 Index start; member
134 edge(Index _p1, Index _p2) : start(_p1), end(_p2){}; in edge()
158 double cross_product(const point<T>& start, const point<T>& end1, const point<T>& end2) { in cross_product() argument
159 return ((end1.x - start.x) * (end2.y - start.y) - (end2.x - start.x) * (end1.y - start.y)); in cross_product()
169 double time_diff(my_time_t start, my_time_t end) { in time_diff() argument
170 return (end - start).seconds(); in time_diff()
/oneTBB/examples/parallel_for/tachyon/src/
H A Dutil.cpp87 double ttime, start, end; in timertime() local
89 start = ((double)st) / ((double)1000.00); in timertime()
91 ttime = end - start; in timertime()
108 double ttime, start, end; in timertime() local
110 start = (st.tv_sec + 1.0 * st.tv_usec / 1000000.0); in timertime()
112 ttime = end - start; in timertime()
H A Dintersect.cpp78 void free_objects(object *start) { in free_objects() argument
82 cur = start; in free_objects()
/oneTBB/examples/parallel_reduce/primes/
H A Dprimes.cpp41 inline NumberType strike(NumberType start, NumberType limit, NumberType stride) { in strike() argument
45 for (; start < limit; start += stride) in strike()
46 is_composite[start] = true; in strike()
47 return start; in strike()
85 NumberType find_primes_in_window(NumberType start, NumberType window_size) { in find_primes_in_window() argument
94 printf("%ld\n", long(start + 2 * k + 1)); in find_primes_in_window()
123 void initialize(NumberType start) { in initialize() argument
124 assert(start >= 1); in initialize()
129 NumberType p = (start - 1) / f * f % m; in initialize()
/oneTBB/test/tbb/
H A Dtest_openmp.cpp39 int start = i < n ? 0 : i - n + 1; in SerialConvolve() local
42 for (int j = start; j < finish; ++j) in SerialConvolve()
85 int start = i < n ? 0 : i - n + 1; in OpenMP_TBB_Convolve() local
88 tbb::parallel_reduce(tbb::blocked_range<int>(start, finish, 10), body); in OpenMP_TBB_Convolve()
114 int start = i < n ? 0 : i - n + 1; in operator ()() local
118 for (int j = start; j < finish; ++j) in operator ()()
H A Dtest_composite_node.cpp45 int start; member in my_input_body
49 my_input_body(int f, int s) : start(1), finish(f), step(s) {} in my_input_body()
51 int a = start; in operator ()()
52 if (start <= finish) { in operator ()()
53 a = start; in operator ()()
54 start+=step; in operator ()()
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A DREADME.md4 It is parameterized by `N`, a number of nodes, and a start and end node in `[0..N)`. A graph is gen…
6 … add nodes back to the open set when the `g` estimate (shortest path from start to the node) is im…
28 shortpath [#threads=value] [verbose] [silent] [N=value] [start=value] [end=value] [-h] [#threads]
35 * `start` - node to start path at.
H A DCMakeLists.txt29 set(ARGS 4 N=1000 start=0 end=999 verbose)
30 set(PERF_ARGS auto N=1000 start=0 end=99 silent)
/oneTBB/include/oneapi/tbb/
H A Dpartitioner.h269 start.run_body( range ); // static partitioner goes here in work_balance()
273 void execute(StartType &start, Range &range, execution_data& ed) { in execute()
285 start.offer_work( split_obj, ed ); in execute()
289 self().work_balance(start, range, ed); in execute()
433 void work_balance(StartType &start, Range &range, execution_data& ed) { in work_balance()
435 start.run_body( range ); in work_balance()
441 if( self().check_for_demand( start ) ) { in work_balance()
450 start.run_body( range_pool.back() ); in work_balance()
509 void execute(StartType &start, Range &range, execution_data& ed) { in execute() argument
512 start.offer_work( split_obj, ed ); in execute()
[all …]
/oneTBB/test/common/
H A Dvector_types.h85 void ClassWithVectorType<Mvec>::init( int start ) { in init() argument
92 ((float*)value)[j] = float(n*start+F*i+j); in init()
/oneTBB/test/conformance/
H A Dconformance_parallel_for.cpp59 int start; member in FooRange
63 FooRange( int start_, int size_ ) : start(start_), size(size_) { in FooRange()
77 start = original.start+original.size; in FooRange()
98 for (int k = r.start; k < r.start + r.size; ++k) { in operator ()()
H A Dconformance_tick_count.cpp58 oneapi::tbb::tick_count start = oneapi::tbb::tick_count::now(); in WaitForDuration() local
61 sec = (oneapi::tbb::tick_count::now() - start).seconds(); in WaitForDuration()
/oneTBB/doc/main/tbb_userguide/
H A Dattach_flow_graph_to_arena.rst21 :start-after: /*begin_attach_to_arena_1*/
37 :start-after: /*begin_attach_to_arena_2*/
H A Dstd_invoke.rst24 : start(s), size(sz), stride(str) {}
31 : start(other.start), size(other.size / 2)
34 other.start += size;
57 int* start;
H A DDependence_Graph.rst41 Function B must complete before C and D start executing; and E must
42 complete before D and F start executing. This is a partial ordering
109 does not start until both B and E are finished. While a task is waiting
H A DSummary_of_Loops_and_Pipelines.rst7 give you efficient scalable ways to exploit the power of multi-core chips without having to start f…
H A Dcancel_a_graph.rst46 execute will not start. So in the example above, f2 will print both the
/oneTBB/examples/common/gui/xcode/tbbExample/
H A DOpenGLView.h48 - (void) drawRect:(NSRect)start;
H A DOpenGLView.m39 - (void)drawRect:(CGRect)start
90 - (void) drawRect:(NSRect)start
/oneTBB/doc/GSG/
H A Dget_started.rst12 To start using oneTBB, follow the next steps:
/oneTBB/python/tbb/
H A D__init__.py96 w.start()
139 w.start()
/oneTBB/src/tbbmalloc/
H A Dbackend.h189 int getMinUsedBin(int start) const { return bins.getMinTrue(start); } in getMinUsedBin() argument
/oneTBB/examples/graph/binpack/
H A Dbinpack.cpp299 oneapi::tbb::tick_count start = oneapi::tbb::tick_count::now(); in main() local
335 utility::report_elapsed_time((oneapi::tbb::tick_count::now() - start).seconds()); in main()
/oneTBB/examples/graph/som/
H A DREADME.md26 * `radius-fraction` - size of radius at which to start speculating.
/oneTBB/examples/parallel_for/seismic/
H A DREADME.md27 * `serial` - in GUI mode start with serial version of algorithm.

12