Home
last modified time | relevance | path

Searched refs:num (Results 1 – 25 of 26) sorted by relevance

12

/oneTBB/examples/parallel_for/tachyon/src/
H A Dintersect.cpp111 intstruct->num = 0; in reset_intersection()
132 intstruct->num++; in add_intersection()
133 intstruct->list[intstruct->num].obj = obj; in add_intersection()
134 intstruct->list[intstruct->num].t = t; in add_intersection()
142 for (i = 1; i <= intstruct->num; i++) { in closest_intersection()
149 return intstruct->num; in closest_intersection()
155 if (intstruct->num > 0) { in shadow_intersection()
156 for (i = 1; i <= intstruct->num; i++) { in shadow_intersection()
H A Dppm.cpp70 int num; in getint() local
72 num = 0; in getint()
73 while (num == 0) { in getint()
78 num = sscanf(ch, "%d", &i); in getint()
H A Dtypes.hpp177 int num; /* number of intersections */ member
/oneTBB/test/common/
H A Dtest_comparisons.h89 TwoWayComparable( std::size_t num ) : n(num) { in TwoWayComparable() argument
185 ThreeWayComparable( std::size_t num ) : TwoWayComparable(num) { reset(); }
219 ThreeWayComparableOnly( std::size_t num ) : n(num) {}
235 LessComparableOnly( std::size_t num ) : n(num) {}
H A Dconcurrent_associative_common.h752 : n(num), array(arr) {}
869 const int num = 10;
873 for (int i = 0; i != num; ++i) {
887 for (int i = 0; i != num; ++i) {
899 for (int i = 0; i != num; ++i) {
906 for (int i = 0; i != num; ++i) {
916 const int num = 10;
920 for (int i = 0; i != num; ++i) {
941 for (int i = 0; i != num; ++i) {
955 for (int i = 0; i != num; ++i) {
[all …]
/oneTBB/examples/task_arena/fractal/
H A Dfractal.cpp161 void fractal_group::calc_fractal(int num) { in calc_fractal() argument
163 fractal &f = num ? f1 : f0; in calc_fractal()
166 while (v->next_frame() && num_frames[num] != 0) { in calc_fractal()
167 f.run(context[num]); in calc_fractal()
168 if (num_frames[num] > 0) in calc_fractal()
169 num_frames[num] -= 1; in calc_fractal()
174 printf(" %s fractal finished. Time: %g\n", num ? "Second" : "First", (t1 - t0).seconds()); in calc_fractal()
H A Dfractal.hpp136 void calc_fractal(int num);
/oneTBB/test/conformance/
H A Dconformance_global_control.cpp95 for (size_t num=2; num<limit_par; num++) in TestWorkersConstraints() local
96 RunWorkersLimited(num); in TestWorkersConstraints()
97 for (size_t num=limit_par; num>1; num--) in TestWorkersConstraints() local
98 RunWorkersLimited(num); in TestWorkersConstraints()
/oneTBB/src/tbbmalloc/
H A Dlarge_objects.cpp276 putListNum += num; in addToPutList()
280 putListNum = num; in addToPutList()
310 int num = 0; in operator ()() local
323 num += 1; in operator ()()
329 addToPutList(head, tail, num); in operator ()()
545 MALLOC_ASSERT( (tail==head && num==1) || (tail!=head && num>1), ASSERT_TEXT ); in putList()
559 num--; in putList()
561 if (num) { in putList()
687 CacheBin::reportStat(int num, FILE *f) in reportStat() argument
692 num, num*Props::CacheStep+Props::MinSize, in reportStat()
[all …]
H A Dbackend.cpp267 static void markBlocks(FreeBlock *fBlock, int num, size_t size) { in markBlocks() argument
268 for (int i=1; i<num; i++) { in markBlocks()
575 const size_t totalSize = num * size; in splitBlock()
621 FreeBlock::markBlocks(fBlock, num, size); in splitBlock()
789 FreeBlock *Backend::genericGetBlock(int num, size_t size, bool needAlignedBlock) in genericGetBlock() argument
792 const size_t totalReqSize = num*size; in genericGetBlock()
815 … block = freeSlabAlignedBins.findBlock(nativeBin, &bkndSync, num*size, needAlignedBlock, in genericGetBlock()
821 … block = freeLargeBlockBins.findBlock(nativeBin, &bkndSync, num*size, needAlignedBlock, in genericGetBlock()
854 block = splitBlock(block, num, size, block->slabAligned, needAlignedBlock); in genericGetBlock()
874 BlockI *Backend::getSlabBlock(int num) { in getSlabBlock() argument
[all …]
H A Dbackend.h286 FreeBlock *genericGetBlock(int num, size_t size, bool slabAligned);
290 …FreeBlock *splitBlock(FreeBlock *fBlock, int num, size_t size, bool isAligned, bool needAlignedBlo…
348 BlockI *getSlabBlock(int num);
H A Dbackref.cpp41 BackRefBlock(const BackRefBlock *blockToUse, intptr_t num) : in BackRefBlock()
43 freeList(nullptr), nextRawMemBlock(nullptr), allocatedCount(0), myNum(num), in BackRefBlock()
47 MALLOC_ASSERT(!(num >> CHAR_BIT*sizeof(BackRefIdx::main_t)), in BackRefBlock()
H A Dlarge_objects.h203 size_t reportStat(int num, FILE *f);
208 int idx, int num, size_t hugeObjectThreshold);
/oneTBB/examples/parallel_pipeline/square/
H A Dgen_input.cpp36 long num = INPUT_SIZE; in gen_input() local
44 for (long j = 0; j < num; ++j) { in gen_input()
/oneTBB/test/tbb/
H A Dtest_continue_node.cpp394 tbb::flow::buffer_node<int>& f, std::size_t num,
398 tbb::flow::continue_node<Input>(graph, num, body);
399 tbb::flow::continue_node<Input>(graph, num, body, priority);
403 tbb::flow::continue_node<Input>(tbb::flow::follows(f), num, body);
404 tbb::flow::continue_node<Input>(tbb::flow::follows(f), num, body, priority);
H A Dtest_composite_node.cpp445 int num = 0; in input_only_output_only_composite() local
483 que.try_get(num); in input_only_output_only_composite()
484 CHECK_MESSAGE( (num == 4*i - 3), "number does not match position in sequence"); in input_only_output_only_composite()
H A Dtest_flow_graph_priorities.cpp498 void create_nodes( nodes_container_t& nodes, graph& g, int num, int body_size ) { in create_nodes() argument
499 for( int i = 0; i < num; ++i ) in create_nodes()
H A Dtest_task_group.cpp1036 const unsigned num = 10; variable
1037 std::atomic<unsigned> count{num};
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp196 int CountRateSum(Sound sounds[], const int num, const int part) { in CountRateSum() argument
198 for (int i = 0; i < num; i++) in CountRateSum()
/oneTBB/include/oneapi/tbb/
H A Dtick_count.h82 return static_cast<double>(interval_t::period::num) / interval_t::period::den; in resolution()
/oneTBB/test/tbbmalloc/
H A Dtest_malloc_whitebox.cpp1004 void putList( int num ) { in putList() argument
1006 cacheCurrTime += num; in putList()
1008 …cacheBinModel.usedSize.store(cacheBinModel.usedSize.load(std::memory_order_relaxed) - num * size, … in putList()
1014 num--; in putList()
1017 for ( int i=1; i<=num; ++i ) { in putList()
1025 …achedSize.store(cacheBinModel.cachedSize.load(std::memory_order_relaxed) + num * size, std::memory… in putList()
1064 int num=1; in LOCModelTester() local
1065 for (rml::internal::LargeMemoryBlock *curr = lmb; curr->next; curr=curr->next) num+=1; in LOCModelTester()
1067 cacheBinModel.putList(num); in LOCModelTester()
H A Dtest_malloc_compliance.cpp147 typedef void* TestCalloc(size_t num, size_t size);
167 void* Tcalloc(size_t num, size_t size);
457 void* Tcalloc(size_t num, size_t size) in Tcalloc() argument
460 size_t alignment = (sizeof(intptr_t)>4 && num && size>8) ? 16 : 8; in Tcalloc()
461 void *ret = Rcalloc(num, size); in Tcalloc()
H A Dtest_malloc_pools.cpp129 static void init(int num, rml::MemoryPool *pl, void **crThread, void **aTerm) { in init() argument
130 threadNum = num; in init()
228 static void init(long num) { in init() argument
229 number_of_threads = num; in init()
H A Dtest_malloc_overload.cpp87 void *__libc_calloc(size_t num, size_t size);
/oneTBB/src/tbbmalloc_proxy/
H A Dproxy.cpp192 void *PREFIX(calloc)(ZONE_ARG size_t num, size_t size) __THROW in PREFIX()
194 return scalable_calloc(num, size); in PREFIX()
288 void *__libc_calloc(size_t num, size_t size) __TBB_ALIAS_ATTR_COPY(calloc);

12