| /oneTBB/test/tbbmalloc/ |
| H A D | test_malloc_pure_c.c | 58 void *p1, *p2; in main() local
77 p1 = p2 = NULL; in main()
81 p1 = scalable_realloc(p2, i); in main()
82 p2 = scalable_calloc(i, 32); in main()
83 if (p2) { in main()
86 assert(0==*((char*)p2+j)); in main()
92 scalable_free(p2); in main()
93 p2 = scalable_malloc(i); in main()
99 p1 = scalable_realloc(p2, i); in main()
100 p2 = scalable_malloc(i); in main()
[all …]
|
| H A D | test_malloc_init_shutdown.cpp | 128 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 D | test_scalable_allocator.cpp | 203 char *p2 = (char*)pool.realloc( p1, 15 ); variable
204 REQUIRE_MESSAGE( (p2 && !strcmp(p2, text)), "realloc broke memory" );
209 char *p3 = (char*)pool.realloc( p2, sizeof(buf)-128*1024 );
|
| H A D | test_malloc_pools.cpp | 613 char *p2 = (char*)pool_realloc(pool, p1, curr_sz1); in TestEntries() local
614 REQUIRE(p2); in TestEntries()
615 REQUIRE(memEqual(p2, utils::min(curr_sz1, curr_sz), j+1)); in TestEntries()
617 pool_free(pool, p2); in TestEntries()
|
| H A D | test_malloc_whitebox.cpp | 311 void *p2 = scalable_malloc(minLargeObjectSize-1); in operator ()() local
323 scalable_free(p2); in operator ()()
324 p2 = scalable_malloc(minLargeObjectSize-1); in operator ()()
331 scalable_free(p2); in operator ()()
|
| H A D | test_malloc_compliance.cpp | 507 static int cmpAddrs(const void *p1, const void *p2) in cmpAddrs() argument
510 const PtrSize *b = (const PtrSize *)p2; in cmpAddrs()
|
| /oneTBB/examples/parallel_for/tachyon/src/ |
| H A D | apitrigeom.cpp | 69 vector p1, p2, p3, p4; in rt_tri_fcylinder() local
91 p4 = p3 = p2 = p1; in rt_tri_fcylinder()
99 MyVAddS(u2, &x, &p2, &p2); in rt_tri_fcylinder()
100 MyVAddS(v2, &y, &p2, &p2); in rt_tri_fcylinder()
101 n2 = p2; in rt_tri_fcylinder()
103 MyVAddS(1.0, &ctr, &p2, &p2); in rt_tri_fcylinder()
121 vector p1, p2, p3, p4; in rt_tri_ring() local
143 p4 = p3 = p2 = p1; in rt_tri_ring()
152 MyVAddS(u2, &x, &p2, &p2); in rt_tri_ring()
153 MyVAddS(v2, &y, &p2, &p2); in rt_tri_ring()
[all …]
|
| /oneTBB/examples/parallel_reduce/convex_hull/ |
| H A D | convex_hull_bench.cpp | 76 point_t p1, p2; member in SplitByCP
83 p2(_p2), in SplitByCP()
90 if ((p != p1) && (p != p2)) { in operator ()()
108 SplitByCP splitByCP(p1, p2, P_reduced); in divide()
374 point_t p1, p2; member in SplitByCP
386 p2(_p2), in SplitByCP()
394 p2(sbcp.p2), in SplitByCP()
439 point_t p1, p2; member in SplitByCP_buf
451 p2(_p2), in SplitByCP_buf()
459 p2(sbcp.p2), in SplitByCP_buf()
[all …]
|
| H A D | convex_hull_sample.cpp | 154 point_t p1, p2; member in SplitByCP_buf
163 p2(_p2), in SplitByCP_buf()
171 p2(sbcp.p2), in SplitByCP_buf()
183 if ((initialSet[i] != p1) && (initialSet[i] != p2)) { in operator ()()
184 cp = util::cross_product(p1, p2, initialSet[i]); in operator ()()
210 point_t divide(const pointVec_t &P, pointVec_t &P_reduced, const point_t &p1, const point_t &p2) { in divide() argument
211 SplitByCP_buf sbcpb(p1, p2, P, P_reduced); in divide()
220 << "dividing by: [ " << p1 << ", " << p2 << " ], " in divide()
228 void divide_and_conquer(const pointVec_t &P, pointVec_t &H, point_t p1, point_t p2) { in divide_and_conquer() argument
232 point_t p_far = divide(P, P_reduced, p1, p2); in divide_and_conquer()
[all …]
|
| H A D | convex_hull.hpp | 148 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 D | polymain.hpp | 38 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 D | polyover.cpp | 57 RPolygon *p2 = &((*map2)[j]); in OverlayOnePolygonWithMap() local
62 p2->getColor(&r2, &g2, &b2); in OverlayOnePolygonWithMap()
240 Polygon_map_t *p2) in blocked_range_with_maps() argument
243 my_map2.reserve(p2->size()); in blocked_range_with_maps()
247 for (int i = 1; i < p2->size(); ++i) { in blocked_range_with_maps()
365 RPolygon *p2 = fmap2[j].p(); in operator ()() local
368 p2->getColor(&r2, &g2, &b2); in operator ()()
500 RPolygon *p2 = fmap2[j].p(); in operator ()() local
503 p2->getColor(&r2, &g2, &b2); in operator ()()
637 RPolygon *p2 = fmap2[j].p(); in operator ()() local
[all …]
|
| H A D | rpolygon.hpp | 186 inline bool PolygonsOverlap(RPolygon *p1, RPolygon *p2, int &xl, int &yl, int &xh, int &yh) { in PolygonsOverlap() argument
192 p2->get(&xl2, &yl2, &xh2, &yh2); in PolygonsOverlap()
|
| H A D | polymain.cpp | 631 bool CompOnePolygon(RPolygon &p1, RPolygon &p2) { in CompOnePolygon() argument
635 p2.get(&xl2, &yl2, &xh2, &yh2); in CompOnePolygon()
643 bool PolygonsEqual(RPolygon *p1, RPolygon *p2) { in PolygonsEqual() argument
647 p2->get(&xl2, &yl2, &xh2, &yh2); in PolygonsEqual()
|
| H A D | README.md | 23 …map2) by minY. For p1 in map1, start testing for intersection at the first p2 in map2 that interse…
|
| /oneTBB/examples/concurrent_priority_queue/shortpath/ |
| H A D | shortpath.cpp | 47 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/tbb/ |
| H A D | test_queue_node.cpp | 93 for ( int p2 = 0; p2 < my_num_threads; ++p2) in touches() local
94 my_last_touch[p][p2] = -1; in touches()
|