Home
last modified time | relevance | path

Searched refs:numThreads (Results 1 – 7 of 7) sorted by relevance

/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/core/sync/
H A Dbarrier.d113 int numThreads = 10; variable
114 auto barrier = new Barrier( numThreads );
134 for ( int i = 0; i < numThreads; ++i )
139 assert( numReady == numThreads && numPassed == numThreads );
H A Devent.d322 int numThreads = 10; variable
333 for (int i = 0; i < numThreads; ++i)
342 assert(numRunning == numThreads);
H A Dmutex.d403 int numThreads = 10; variable
420 for (int i = 0; i < numThreads; ++i)
424 assert(lockCount == numThreads * numTries);
/netbsd-src/external/gpl3/gcc/dist/libphobos/src/std/experimental/allocator/building_blocks/
H A Dascending_page_allocator.d647 enum numThreads = 100; variable
648 shared SharedAscendingPageAllocator a = SharedAscendingPageAllocator(pageSize * numThreads);
659 foreach (i; 0 .. numThreads)
931 enum numThreads = 100; variable
933 ulong[numThreads] ptrVals;
935 shared SharedAscendingPageAllocator a = SharedAscendingPageAllocator(pageSize * numThreads);
952 foreach (i; 0 .. numThreads)
959 foreach (i; 0 .. numThreads - 1)
972 enum numThreads = 100; variable
973 void[][numThreads] buf;
[all …]
H A Dregion.d1281 enum numThreads = 100; in testAlloc() local
1282 void[][numThreads] buf; in testAlloc()
1297 foreach (i; 0 .. numThreads) in testAlloc()
1303 sort!((a, b) => a.ptr < b.ptr)(buf[0 .. numThreads]); in testAlloc()
1304 foreach (i; 0 .. numThreads - 1) in testAlloc()
1311 foreach (i; 0 .. numThreads) in testAlloc()
1314 assert(a.deallocate(buf[numThreads - 1 - i])); in testAlloc()
1346 enum numThreads = 100; in testAlloc() local
1347 void[][2 * numThreads] buf; in testAlloc()
1371 foreach (i; 0 .. numThreads) in testAlloc()
[all …]
H A Daligned_block_list.d534 enum numThreads = 8; variable
562 foreach (i; 0 .. numThreads)
593 enum numThreads = 10; variable
595 enum totalAllocs = maxIter * numThreads;
625 foreach (i; 0 .. numThreads)
H A Dbitmapped_block.d1680 enum numThreads = 10;
1681 void[][numThreads] buf;
1698 foreach (i; 0 .. numThreads)
1706 sort!((a, b) => a.ptr < b.ptr)(buf[0 .. numThreads]);
1707 foreach (i; 0 .. numThreads - 1)
1713 foreach (i; 0 .. numThreads)