Home
last modified time | relevance | path

Searched refs:object (Results 1 – 25 of 83) sorted by relevance

1234

/oneTBB/examples/parallel_for/tachyon/src/
H A Dobjbound.hpp52 void dividespace(int, object **);
56 static void globalbound(object **, vector *, vector *);
57 static int objinside(object *obj, vector *min, vector *max);
58 static int countobj(object *);
59 static void movenextobj(object *, object **);
60 static void octreespace(object **, int);
H A Dobjbound.cpp61 object *cur; in globalbound()
92 cur = (object *)cur->nextobj; in globalbound()
111 static int countobj(object *root) { in countobj()
119 cur = (object *)cur->nextobj; in countobj()
125 static void movenextobj(object *thisobj, object **root) { in movenextobj()
126 object *cur, *tmp; in movenextobj()
142 object *cur; in octreespace()
236 cur = (object *)cur->nextobj; in octreespace()
291 *rootlist = (object *)box1; in octreespace()
294 *rootlist = (object *)box1->nextobj; in octreespace()
[all …]
H A Dintersect.cpp65 void add_object(object *obj) { in add_object()
66 object *objtemp; in add_object()
78 void free_objects(object *start) { in free_objects()
79 object *cur; in free_objects()
80 object *cur2; in free_objects()
84 cur2 = (object *)cur->nextobj; in free_objects()
100 object *cur; in intersect_objects()
101 object temp; in intersect_objects()
106 while ((cur = (object *)cur->nextobj) != nullptr) in intersect_objects()
118 void add_intersection(flt t, object *obj, ray *ry) { in add_intersection()
[all …]
H A Dintersect.hpp55 void add_object(object *);
57 void free_objects(object *);
60 void add_intersection(flt, object *, ray *);
61 int closest_intersection(flt *, object **, intersectstruct *);
62 int next_intersection(object **, object *, intersectstruct *);
H A Dgrid.hpp53 int engrid_scene(object **list);
54 object *newgrid(int xsize, int ysize, int zsize, vector min, vector max);
60 object *obj; /* the actual object */
74 object *objects; /* all objects contained in the grid */
103 void engrid_objlist(grid *g, object **list);
104 static int engrid_object(grid *g, object *obj);
H A Dsphere.cpp65 object *newsphere(void *tex, vector ctr, flt rad) { in newsphere()
76 return (object *)s; in newsphere()
109 add_intersection(t2, (object *)spr, ry); in sphere_intersect()
113 add_intersection(t1, (object *)spr, ry); in sphere_intersect()
H A Dplane.cpp65 object *newplane(void *tex, vector ctr, vector norm) { in newplane()
77 return (object *)p; in newplane()
92 add_intersection(t, (object *)pln, ry); in plane_intersect()
H A Dcylinder.cpp72 object *newcylinder(void *tex, vector ctr, vector axis, flt rad) { in newcylinder()
83 return (object *)c; in newcylinder()
128 add_intersection(tin, (object *)cyl, ry); in cylinder_intersect()
130 add_intersection(tout, (object *)cyl, ry); in cylinder_intersect()
160 object *newfcylinder(void *tex, vector ctr, vector axis, flt rad) { in newfcylinder()
172 return (object *)c; in newfcylinder()
247 add_intersection(tin, (object *)cyl, ry); in fcylinder_intersect()
260 add_intersection(tout, (object *)cyl, ry); in fcylinder_intersect()
H A Dgrid.cpp102 return (object *)g; in newgrid()
141 object *cur; in globalbound()
172 cur = (object *)cur->nextobj; in globalbound()
245 static int countobj(object *root) { in countobj()
253 cur = (object *)cur->nextobj; in countobj()
273 int engrid_scene(object **list) { in engrid_scene()
296 *list = (object *)g; in engrid_scene()
312 object *cur, *next, **prev; in engrid_objlist()
321 next = (object *)cur->nextobj; in engrid_objlist()
370 newobj->obj = (object *)g; in engrid_cell()
[all …]
H A Dcylinder.hpp52 object *newcylinder(void *, vector, vector, flt);
53 object *newfcylinder(void *, vector, vector, flt);
H A Dring.cpp65 object *newring(void *tex, vector ctr, vector norm, flt inrad, flt outrad) { in newring()
78 return (object *)r; in newring()
111 add_intersection(t, (object *)rng, ry); in ring_intersect()
H A Dapi.cpp327 add_object((object *)li); in rt_light()
338 add_object((object *)newscalarvol( in rt_scalarvol()
343 add_object((object *)newextvol(tex, (vector)min, (vector)max, samples, evaluator)); in rt_extvol()
347 add_object((object *)newbox(tex, (vector)min, (vector)max)); in rt_box()
371 object *trn; in rt_tri()
381 object *trn; in rt_stri()
409 add_object((object *)q); in rt_quadsphere()
H A Dtriangle.hpp52 object *newtri(void *, vector, vector, vector);
53 object *newstri(void *, vector, vector, vector, vector, vector, vector);
H A Dtriangle.cpp70 object *newtri(void *tex, vector v0, vector v1, vector v2) { in newtri()
91 return (object *)t; in newtri()
97 object *newstri(void *tex, vector v0, vector v1, vector v2, vector n0, vector n1, vector n2) { in newstri()
121 return (object *)t; in newstri()
191 add_intersection(t, (object *)trn, ry); in tri_intersect()
/oneTBB/src/tbbmalloc/
H A Dfrontend.cpp2170 blSize - ((uintptr_t)object - (uintptr_t)findObjectToFree(object)); in findObjectSize()
2204 object->prev = nullptr; in put()
2205 object->next = localHead; in put()
2212 tail = object; in put()
2214 localHead = object; in put()
2760 if (!object) in pool_realloc()
2818 if (object) { in pool_msize()
2948 internalFree(object); in scalable_free()
2964 if (!object) in __TBB_malloc_safer_free()
3220 if (object) { in __TBB_malloc_safer_msize()
[all …]
/oneTBB/include/oneapi/tbb/detail/
H A D_small_object_pool.h68 void delete_object(Type* object, const execution_data& ed) { in delete_object() argument
72 object->~Type(); in delete_object()
73 alloc.deallocate(object, ed); in delete_object()
77 void delete_object(Type* object) { in delete_object() argument
81 object->~Type(); in delete_object()
82 alloc.deallocate(object); in delete_object()
/oneTBB/doc/main/reference/
H A Dconcurrent_lru_cache_cls.rst25 ``concurrent_lru_cache::handle`` object that refers to an item instead of its value.
33 ``value_function_type`` object to construct a value for the key, and stores that value.
34 The ``value_function_type`` object must be thread-safe.
92 unused values, with a function object ``f`` for constructing new values.
108 If such an item is not found, the user-specified function object is called to
111 **Returns**: a ``handle`` object holding reference to the matching value.
123 **Effects**: Constructs a ``handle`` object that does not refer to any value.
130 from ``other`` to the newly constructed object. Upon completion,
161 **Returns**: a reference to a ``value_type`` object stored in ``concurrent_lru_cache``.
H A Dtask_group_extensions.rst16 …eduler/task_group/task_group_cls.html>`_ with the requirements for a user-provided function object.
63 As an optimization hint, ``F`` might return a ``task_handle``, which task object can be executed ne…
70 As an optimization hint, ``F`` might return a ``task_handle``, which task object can be executed ne…
78 As an optimization hint, ``F`` might return a ``task_handle``, which task object can be executed ne…
/oneTBB/doc/main/tbb_userguide/
H A DGraph_Object.rst9 the same graph. In the flow graph interface, a graph object represents
16 The code below creates a graph object and then waits for all tasks
28 The graph object does not own the nodes associated with it. You need to make sure that the graph ob…
30 .. tip:: Call ``wait_for_all`` on a graph object before destroying it to make sure all activities a…
H A Dparallel_for_os.rst25 that operates on a chunk. The form is an STL-style function object,
26 called the *body* object, in which ``operator()`` processes a chunk. The
27 following code declares the body object.
65 inside it. Usually, the constructor for the body object will initialize
66 these fields, though ``parallel_for`` does not care how the body object
68 object have a copy constructor, which is invoked to create a separate
76 Because the body object might be copied, its ``operator()`` should not
81 object's ``operator()`` be declared ``const``.
97 Once you have the loop body written as a body object, invoke the
H A DLambda_Expressions.rst9 the compiler do the tedious work of creating a function object.
13 …a expression, replaces both the declaration and construction of function object ``ApplyFoo`` in the
37 function object very similar to ``ApplyFoo``. When local variables like
39 inside it, they are "captured" as fields inside the function object. The
42 definition for the ``operator()`` of the generated function object. The
H A DMutual_Exclusion.rst9 exclusion is implemented by *mutexes* and *locks.* A mutex is an object
57 Be sure to name the lock object, otherwise it will be destroyed too
58 soon. For example, if the creation of the ``scoped_lock`` object in
98 why there are not simply acquire and release methods on the mutex object
101 over the release. With the object-oriented interface, destruction of the
102 ``scoped_lock`` object causes the lock to be released, no matter whether
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_overload.cpp194 static void scalableMallocCheckSize(void *object, size_t size) in scalableMallocCheckSize() argument
198 static void *v = object; in scalableMallocCheckSize()
201 REQUIRE(object); in scalableMallocCheckSize()
203 LargeMemoryBlock *lmb = ((LargeObjectHdr*)object-1)->memoryBlock; in scalableMallocCheckSize()
204 REQUIRE((uintptr_t(lmb)<uintptr_t(((LargeObjectHdr*)object-1)) && lmb->objectSize >= size)); in scalableMallocCheckSize()
207 REQUIRE(malloc_usable_size(object) >= size); in scalableMallocCheckSize()
210 REQUIRE(_msize(object) >= size); in scalableMallocCheckSize()
211 REQUIRE((size < 8 || _aligned_msize(object,8,0) >= size)); in scalableMallocCheckSize()
/oneTBB/doc/main/tbb_userguide/design_patterns/
H A DReference_Counting.rst13 Destroy an object when it will no longer be used.
22 Often it is desirable to destroy an object when it is known that it
61 // Construct object with a single reference to it.
67 // Get reference to underlying object
91 writes complete before the object is deleted.
98 object. Two ways to address the problem are "hazard pointers" and
H A DLazy_Initialization.rst13 Delay the creation of an object, potentially expensive, until it is accessed.
24 of the object may be considerably high. In that case, the object
36 helps to implement thread-safe lazy initialization for a user object.

1234