Home
last modified time | relevance | path

Searched refs:p1 (Results 1 – 19 of 19) sorted by relevance

/oneTBB/test/tbbmalloc/
H A Dtest_malloc_pure_c.c58 void *p1, *p2; in main() local
65 assert(p1); in main()
68 scalable_free(p1); in main()
72 p1 = scalable_malloc(i); in main()
73 if( !p1 ) in main()
75 scalable_free(p1); in main()
77 p1 = p2 = NULL; in main()
80 scalable_free(p1); in main()
81 p1 = scalable_realloc(p2, i); in main()
98 scalable_free(p1); in main()
[all …]
H A Dtest_malloc_init_shutdown.cpp128 inline bool intersectingObjects(const void *p1, const void *p2, size_t n) in intersectingObjects() argument
130 return p1>p2 ? ((uintptr_t)p1-(uintptr_t)p2)<n : ((uintptr_t)p2-(uintptr_t)p1)<n; in intersectingObjects()
H A Dtest_malloc_lib_unload.cpp166 void *p1 = aligned_malloc_ptr(sz, 16); in operator ()() local
167 std::memset(p1, 0, sz); in operator ()()
168 aligned_free_ptr(p1); in operator ()()
H A Dtest_scalable_allocator.cpp200 char *p1 = (char*)pool.malloc( 16 ); variable
201 REQUIRE(p1);
202 strcpy(p1, text);
203 char *p2 = (char*)pool.realloc( p1, 15 );
H A Dtest_malloc_pools.cpp607 char *p1 = (char*)pool_aligned_realloc(pool, p, curr_sz, curr_algn); in TestEntries() local
608 REQUIRE((p1 && 0==((uintptr_t)p1 & (curr_algn-1)))); in TestEntries()
609 REQUIRE(memEqual(p1, utils::min(size[i], curr_sz), j)); in TestEntries()
611 memset(p1, j+1, curr_sz); in TestEntries()
613 char *p2 = (char*)pool_realloc(pool, p1, curr_sz1); in TestEntries()
H A Dtest_malloc_compliance.cpp507 static int cmpAddrs(const void *p1, const void *p2) in cmpAddrs() argument
509 const PtrSize *a = (const PtrSize *)p1; in cmpAddrs()
H A Dtest_malloc_whitebox.cpp312 char *p1 = (char*)scalable_malloc(minLargeObjectSize-1); in operator ()() local
314 (LargeObjectHdr*)(p1+minLargeObjectSize-1 - sizeof(LargeObjectHdr)); in operator ()()
330 scalable_free(p1); in operator ()()
/oneTBB/examples/parallel_for/tachyon/src/
H A Dapitrigeom.cpp69 vector p1, p2, p3, p4; in rt_tri_fcylinder() local
90 p1.x = p1.y = p1.z = 0.0; in rt_tri_fcylinder()
91 p4 = p3 = p2 = p1; in rt_tri_fcylinder()
93 MyVAddS(u, &x, &p1, &p1); in rt_tri_fcylinder()
94 MyVAddS(v, &y, &p1, &p1); in rt_tri_fcylinder()
95 n1 = p1; in rt_tri_fcylinder()
97 MyVAddS(1.0, &ctr, &p1, &p1); in rt_tri_fcylinder()
142 p1.x = p1.y = p1.z = 0.0; in rt_tri_ring()
145 MyVAddS(u, &x, &p1, &p1); in rt_tri_ring()
146 MyVAddS(v, &y, &p1, &p1); in rt_tri_ring()
[all …]
H A Dtexture.cpp293 int p0, p1; in Noise() local
330 p1 = (int)((int)d1 * oy) + p01; in Noise()
331 d = p1 - p0; in Noise()
/oneTBB/examples/parallel_reduce/convex_hull/
H A Dconvex_hull_bench.cpp76 point_t p1, p2; member in SplitByCP
82 : p1(_p1), in SplitByCP()
86 farPoint(p1) {} in SplitByCP()
129 H.push_back(p1); in divide_and_conquer()
374 point_t p1, p2; member in SplitByCP
385 : p1(_p1), in SplitByCP()
393 : p1(sbcp.p1), in SplitByCP()
439 point_t p1, p2; member in SplitByCP_buf
450 : p1(_p1), in SplitByCP_buf()
458 : p1(sbcp.p1), in SplitByCP_buf()
[all …]
H A Dconvex_hull_sample.cpp154 point_t p1, p2; member in SplitByCP_buf
162 : p1(_p1), in SplitByCP_buf()
167 farPoint(p1) {} in SplitByCP_buf()
170 : p1(sbcp.p1), in SplitByCP_buf()
175 farPoint(p1) {} in SplitByCP_buf()
184 cp = util::cross_product(p1, p2, initialSet[i]); in operator ()()
211 SplitByCP_buf sbcpb(p1, p2, P, P_reduced); in divide()
220 << "dividing by: [ " << p1 << ", " << p2 << " ], " in divide()
232 point_t p_far = divide(P, P_reduced, p1, p2); in divide_and_conquer()
234 H.push_back(p1); in divide_and_conquer()
[all …]
H A Dconvex_hull.hpp148 bool operator==(point<T> p1, point<T> p2) { in operator ==() argument
149 return (p1.x == p2.x && p1.y == p2.y); in operator ==()
153 bool operator!=(point<T> p1, point<T> p2) { in operator !=() argument
154 return !(p1 == p2); in operator !=()
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolyover.cpp96 RPolygon *p1 = &((*map1)[i]); in SerialOverlayMaps() local
242 my_map1.reserve(p1->size()); in blocked_range_with_maps()
359 RPolygon *p1 = fmap1[i].p(); in operator ()() local
361 int parea = p1->area(); in operator ()()
362 p1->getColor(&r1, &g1, &b1); in operator ()()
494 RPolygon *p1 = fmap1[i].p(); in operator ()() local
496 int parea = p1->area(); in operator ()()
497 p1->getColor(&r1, &g1, &b1); in operator ()()
631 RPolygon *p1 = fmap1[i].p(); in operator ()() local
633 int parea = p1->area(); in operator ()()
[all …]
H A Dpolymain.hpp38 extern bool PolygonsOverlap(RPolygon *p1, RPolygon *p2, int &xl, int &yl, int &xh, int &yh);
42 extern bool CompOnePolygon(RPolygon *p1, RPolygon *p2);
44 extern bool PolygonsEqual(RPolygon *p1, RPolygon *p2);
H A Drpolygon.hpp186 inline bool PolygonsOverlap(RPolygon *p1, RPolygon *p2, int &xl, int &yl, int &xh, int &yh) { in PolygonsOverlap() argument
191 p1->get(&xl1, &yl1, &xh1, &yh1); in PolygonsOverlap()
H A Dpolymain.cpp631 bool CompOnePolygon(RPolygon &p1, RPolygon &p2) { in CompOnePolygon() argument
634 p1.get(&xl1, &yl1, &xh1, &yh1); in CompOnePolygon()
643 bool PolygonsEqual(RPolygon *p1, RPolygon *p2) { in PolygonsEqual() argument
646 p1->get(&xl1, &yl1, &xh1, &yh1); in PolygonsEqual()
H A DREADME.md23 …ort one map, say map1, by maxY, and sort the other map (map2) by minY. For p1 in map1, start testi…
/oneTBB/examples/concurrent_priority_queue/shortpath/
H A Dshortpath.cpp47 double get_distance(const point& p1, const point& p2) { in get_distance() argument
48 double xdiff = p1.x - p2.x, ydiff = p1.y - p2.y; in get_distance()
/oneTBB/test/common/
H A Dallocator_test_common.h197 typename std::allocator_traits<A>::pointer p1 = nullptr; in TestAllocatorExceptions() local
204 p1 = a.allocate(too_big); in TestAllocatorExceptions()
209 a.deallocate(p1, too_big); in TestAllocatorExceptions()