Home
last modified time | relevance | path

Searched refs:o (Results 1 – 25 of 40) sorted by relevance

12

/oneTBB/examples/parallel_for/tachyon/src/
H A Dbox.cpp93 if ((ry->o.x < bx->min.x) || (ry->o.x > bx->max.x)) in box_intersect()
97 tx1 = (bx->min.x - ry->o.x) / ry->d.x; in box_intersect()
98 tx2 = (bx->max.x - ry->o.x) / ry->d.x; in box_intersect()
115 if ((ry->o.y < bx->min.y) || (ry->o.y > bx->max.y)) in box_intersect()
119 ty1 = (bx->min.y - ry->o.y) / ry->d.y; in box_intersect()
120 ty2 = (bx->max.y - ry->o.y) / ry->d.y; in box_intersect()
137 if ((ry->o.z < bx->min.z) || (ry->o.z > bx->max.z)) in box_intersect()
141 tz1 = (bx->min.z - ry->o.z) / ry->d.z; in box_intersect()
142 tz2 = (bx->max.z - ry->o.z) / ry->d.z; in box_intersect()
H A Dbndbox.cpp126 if ((ry->o.x < bx->min.x) || (ry->o.x > bx->max.x)) in bndbox_intersect()
130 tx1 = (bx->min.x - ry->o.x) / ry->d.x; in bndbox_intersect()
131 tx2 = (bx->max.x - ry->o.x) / ry->d.x; in bndbox_intersect()
148 if ((ry->o.y < bx->min.y) || (ry->o.y > bx->max.y)) in bndbox_intersect()
152 ty1 = (bx->min.y - ry->o.y) / ry->d.y; in bndbox_intersect()
153 ty2 = (bx->max.y - ry->o.y) / ry->d.y; in bndbox_intersect()
170 if ((ry->o.z < bx->min.z) || (ry->o.z > bx->max.z)) in bndbox_intersect()
174 tz1 = (bx->min.z - ry->o.z) / ry->d.z; in bndbox_intersect()
175 tz2 = (bx->max.z - ry->o.z) / ry->d.z; in bndbox_intersect()
H A Dvol.cpp183 if ((ry->o.x < bx->min.x) || (ry->o.x > bx->max.x)) in scalar_volume_texture()
187 tx1 = (bx->min.x - ry->o.x) / ry->d.x; in scalar_volume_texture()
188 tx2 = (bx->max.x - ry->o.x) / ry->d.x; in scalar_volume_texture()
205 if ((ry->o.y < bx->min.y) || (ry->o.y > bx->max.y)) in scalar_volume_texture()
209 ty1 = (bx->min.y - ry->o.y) / ry->d.y; in scalar_volume_texture()
210 ty2 = (bx->max.y - ry->o.y) / ry->d.y; in scalar_volume_texture()
227 if ((ry->o.z < bx->min.z) || (ry->o.z > bx->max.z)) in scalar_volume_texture()
231 tz1 = (bx->min.z - ry->o.z) / ry->d.z; in scalar_volume_texture()
232 tz2 = (bx->max.z - ry->o.z) / ry->d.z; in scalar_volume_texture()
268 pnt.x = ((ry->o.x + (ry->d.x * t)) - bx->min.x) / bln.x; in scalar_volume_texture()
[all …]
H A Dextvol.cpp175 if ((ry->o.x < bx->min.x) || (ry->o.x > bx->max.x)) in ext_volume_texture()
179 tx1 = (bx->min.x - ry->o.x) / ry->d.x; in ext_volume_texture()
180 tx2 = (bx->max.x - ry->o.x) / ry->d.x; in ext_volume_texture()
197 if ((ry->o.y < bx->min.y) || (ry->o.y > bx->max.y)) in ext_volume_texture()
201 ty1 = (bx->min.y - ry->o.y) / ry->d.y; in ext_volume_texture()
202 ty2 = (bx->max.y - ry->o.y) / ry->d.y; in ext_volume_texture()
219 if ((ry->o.z < bx->min.z) || (ry->o.z > bx->max.z)) in ext_volume_texture()
223 tz1 = (bx->min.z - ry->o.z) / ry->d.z; in ext_volume_texture()
224 tz2 = (bx->max.z - ry->o.z) / ry->d.z; in ext_volume_texture()
257 pnt.x = ((ry->o.x + (ry->d.x * t)) - bx->min.x) / bln.x; in ext_volume_texture()
[all …]
H A Dcamera.cpp81 ray1.o = projcent; in camray()
88 ray1.o = projpixel; in camray()
97 newray.o = scene->camcent; in camray()
H A Dmacros.hpp59 c.x = a.o.x + (a.d.x * b); \
60 c.y = a.o.y + (a.d.y * b); \
61 c.z = a.o.z + (a.d.z * b);
H A Dshade.cpp125 shadowray.o = hit; in shader()
196 specray.o = *hit; in shade_reflection()
198 specray.o = Raypnt(&specray, EPSILON); /* avoid numerical precision bugs */ in shade_reflection()
219 transray.o = *hit; in shade_transmission()
221 transray.o = Raypnt(&transray, EPSILON); /* avoid numerical precision bugs */ in shade_transmission()
H A Dcylinder.cpp94 rc.x = ry->o.x - cyl->ctr.x; in cylinder_intersect()
95 rc.y = ry->o.y - cyl->ctr.y; in cylinder_intersect()
96 rc.z = ry->o.z - cyl->ctr.z; in cylinder_intersect()
207 rc.x = ry->o.x - cyl->ctr.x; in fcylinder_intersect()
208 rc.y = ry->o.y - cyl->ctr.y; in fcylinder_intersect()
209 rc.z = ry->o.z - cyl->ctr.z; in fcylinder_intersect()
H A Dgrid.cpp641 if ((ry->o.x < g->min.x) || (ry->o.x > g->max.x)) in grid_bounds_intersect()
645 tx1 = (g->min.x - ry->o.x) / ry->d.x; in grid_bounds_intersect()
646 tx2 = (g->max.x - ry->o.x) / ry->d.x; in grid_bounds_intersect()
663 if ((ry->o.y < g->min.y) || (ry->o.y > g->max.y)) in grid_bounds_intersect()
667 ty1 = (g->min.y - ry->o.y) / ry->d.y; in grid_bounds_intersect()
668 ty2 = (g->max.y - ry->o.y) / ry->d.y; in grid_bounds_intersect()
685 if ((ry->o.z < g->min.z) || (ry->o.z > g->max.z)) in grid_bounds_intersect()
689 tz1 = (g->min.z - ry->o.z) / ry->d.z; in grid_bounds_intersect()
690 tz2 = (g->max.z - ry->o.z) / ry->d.z; in grid_bounds_intersect()
H A Dvector.cpp100 temp.x = a->o.x + (a->d.x * t); in Raypnt()
101 temp.y = a->o.y + (a->d.y * t); in Raypnt()
102 temp.z = a->o.z + (a->d.z * t); in Raypnt()
H A Dquadric.cpp91 ro.x = ry->o.x - q->ctr.x; in quadric_intersect()
92 ro.y = ry->o.y - q->ctr.y; in quadric_intersect()
93 ro.z = ry->o.z - q->ctr.z; in quadric_intersect()
H A Dplane.cpp87 t = -(pln->d + VDot(&pln->norm, &ry->o)); in plane_intersect()
H A Dlight.cpp91 VSUB(l->ctr, ry->o, V); in light_intersect()
H A Dsphere.cpp96 VSUB(spr->ctr, ry->o, V); in sphere_intersect()
/oneTBB/test/common/
H A Dconcurrency_tracker.h142 ExactConcurrencyLevel o(30., concLevel);
147 ok = o.run();
149 ok = o.run();
155 ExactConcurrencyLevel o(3., concLevel); in isEqual()
156 return o.run(); in isEqual()
161 ExactConcurrencyLevel o(0., concLevel); in checkLessOrEqual()
163 o.run(); // ignore result, as without a barrier it is not reliable in checkLessOrEqual()
164 CHECK_MESSAGE(o.myUniqueThreadsCnt<=concLevel, "Too many workers observed."); in checkLessOrEqual()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_pools.cpp351 ASSERT(o, "Invalid object"); in operator ()()
352 pool_free(pool, o); in operator ()()
383 pool_free(pool, o); in operator ()()
451 void *o = pool_malloc(pool, 64); in TestFixedBufferPool() local
453 pool_free(pool, o); in TestFixedBufferPool()
640 void *o = pool_malloc(pool, size); in CreateUsablePool() local
650 pool_free(pool, o); in CreateUsablePool()
725 PoolIdentityCheck(rml::MemoryPool** p, AllocatedObject** o) : pools(p), objs(o) {} in PoolIdentityCheck() argument
734 REQUIRE(o); in operator ()()
735 act_pool = rml::pool_identify(o); in operator ()()
[all …]
H A Dtest_malloc_atexit.cpp43 void *o = malloc(reqSz); in dll_isMallocOverloaded() local
44 bool ret = __TBB_malloc_safer_msize(o, nullptr) >= reqSz; in dll_isMallocOverloaded()
45 free(o); in dll_isMallocOverloaded()
/oneTBB/test/tbb/
H A Dtest_eh_flow_graph.cpp363 o.observe(true); in run_one_input_node_test()
411 o.observe(false); in run_one_input_node_test()
497 o.observe(true); in run_one_functype_node_test()
561 o.observe(false); in run_one_functype_node_test()
803 o.observe(true); in run_one_continue_node_test()
923 o.observe(true); in run_one_buffer_node_test()
1057 o.observe(true); in run_one_sequencer_node_test()
1177 o.observe(true); in run_one_priority_queue_node_test()
1564 o.observe(true); in run_one_limiter_node_test()
1686 o.observe(true); in run_one_split_node_test()
[all …]
/oneTBB/test/conformance/
H A Dconformance_concurrent_priority_queue.cpp356 NoDefaultCtorType o(0, 0); in test_move_support_in_push_pop() local
357 q2.try_pop(o); in test_move_support_in_push_pop()
358 …REQUIRE_MESSAGE((o.value1 == 2 && o.value2 == 35), "Unexpected data popped; possible emplace() fai… in test_move_support_in_push_pop()
359 q2.try_pop(o); in test_move_support_in_push_pop()
360 …REQUIRE_MESSAGE((o.value1 == 15 && o.value2 == 3), "Unexpected data popped; possible emplace() fai… in test_move_support_in_push_pop()
361 q2.try_pop(o); in test_move_support_in_push_pop()
362 …REQUIRE_MESSAGE((o.value1 == 8 && o.value2 == 8), "Unexpected data popped; possible emplace() fail… in test_move_support_in_push_pop()
363 REQUIRE_MESSAGE(!q2.try_pop(o), "The queue should be empty"); in test_move_support_in_push_pop()
/oneTBB/doc/main/tbb_userguide/
H A DLinux_C_Dynamic_Memory_Interface_Replacement.rst73 g++ foo.o bar.o -ltbbmalloc_proxy -o a.out
/oneTBB/include/oneapi/tbb/detail/
H A D_flow_graph_item_buffer_impl.h77 void set_my_item(size_t i, const item_type &o) { in set_my_item() argument
81 new(&(item(i).first)) item_type(o); in set_my_item()
86 void fetch_item(size_t i, item_type &o) { in fetch_item() argument
88 o = get_my_item(i); // could have std::move assign semantics in fetch_item()
/oneTBB/examples/graph/logic_sim/
H A Dtest_all.cpp150 or_gate<3> o(g); in main() local
156 make_edge(input0.get_out(), input_port<0>(o)); in main()
157 make_edge(input1.get_out(), input_port<1>(o)); in main()
158 make_edge(input2.get_out(), input_port<2>(o)); in main()
159 make_edge(output_port<0>(o), output.get_in()); in main()
289 or_gate<2> o(g); in main() local
298 make_edge(input0.get_out(), input_port<0>(o)); in main()
299 make_edge(input1.get_out(), input_port<1>(o)); in main()
300 make_edge(output_port<0>(o), input_port<1>(output)); in main()
/oneTBB/examples/graph/dining_philosophers/
H A Ddining_philosophers.cpp130 friend std::ostream &operator<<(std::ostream &o, philosopher const &p);
145 std::ostream &operator<<(std::ostream &o, philosopher const &p) { in operator <<() argument
146 o << "< philosopher[" << reinterpret_cast<uintptr_t>(const_cast<philosopher *>(&p)) << "] " in operator <<()
149 return o; in operator <<()
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull.hpp85 std::ostream& operator<<(std::ostream& o, point<double> const& p) { in operator <<() argument
86 return o << "(" << p.x << "," << p.y << ")"; in operator <<()
/oneTBB/
H A D.gitignore8 *.o

12