Lines Matching defs:threads
146 // TestThreads -- see if threads really work at all.
148 // Set up N threads pointing at N chars. When they are started, they will
169 SimpleThread *threads[THREADTEST_NRTHREADS];
176 threads[i] = new TestThreadsThread(&threadTestChars[i]);
180 logln("->" + UnicodeString(threadTestChars) + "<- Firing off threads.. ");
183 if (threads[i]->start() != 0) {
193 errln("Not all threads could be started for testing!");
197 logln("Waiting for threads to be set..");
199 threads[i]->join();
203 delete threads[i];
210 // TestArabicShapeThreads -- see if calls to u_shapeArabic in many threads works successfully
212 // Set up N threads pointing at N chars. When they are started, they will make calls to doTailTest which tests
214 // At the end we make sure all threads managed to run u_shapeArabic successfully.
276 TestArabicShapeThreads threads[30];
280 logln("-> do TestArabicShapingThreads <- Firing off threads.. ");
281 for(i=0; i < UPRV_LENGTHOF(threads); i++) {
282 if (threads[i].start() != 0) {
287 for(i=0; i < UPRV_LENGTHOF(threads); i++) {
288 threads[i].join();
290 logln("->TestArabicShapingThreads <- Got all threads! cya");
315 // This is the code that each of the spawned threads runs.
316 // All threads move together throught the started - middle - done sequence together,
317 // waiting for all other threads to reach each point before advancing.
356 TestMutexThread threads[TESTMUTEX_THREAD_COUNT];
359 if (threads[i].start() != 0) {
365 // Because we are holding gTestMutexA, all of the threads should be blocked
386 threads[i].join();
434 const int kFormatThreadThreads = 10; // # of threads to spawn
833 // Create and start the test threads
835 logln("Spawning: %d threads * %d iterations each.",
868 #define kCollatorThreadThreads 10 // # of threads to spawn
1073 logln(UnicodeString("Spawning: ") + kCollatorThreadThreads + " threads * " + kFormatThreadIterations + " iterations each.");
1107 const int kStringThreadThreads = 10; // # of threads to spawn
1159 logln(UnicodeString("Spawning: ") + kStringThreadThreads + " threads * " + kStringThreadIterations + " iterations each.");
1218 TxThread threads[4];
1220 for (i=0; i<UPRV_LENGTHOF(threads); i++) {
1221 threads[i].start();
1224 for (i=0; i<UPRV_LENGTHOF(threads); i++) {
1225 threads[i].join();
1234 // Create a swarm of threads.
1236 // Increments a global count of started threads.
1238 // Waits on the condition that all threads have started.
1239 // Increments a global count of finished threads.
1240 // Waits on the condition that all threads have finished.
1291 CondThread *threads[NUMTHREADS];
1293 threads[i] = new CondThread;
1294 threads[i]->start();
1308 if (!threads[i]->fFinished) {
1309 errln("File %s, Line %d: Error, threads[%d]->fFinished == false", __FILE__, __LINE__, i);
1314 threads[i]->join();
1315 delete threads[i];
1376 // early, to keep subsequent threads from entering this path.
1455 // eviction can't start until the threads end.
1474 UnifiedCacheThread *threads[CACHE_LOAD][UPRV_LENGTHOF(gCacheLocales)];
1478 threads[i][j] = new UnifiedCacheThread(
1480 threads[i][j]->start();
1486 threads[i][j]->join();
1498 // objects fetched from the cache. If the threads run in series because
1507 // clean up threads
1510 delete threads[i][j];
1561 BreakTranslitThread threads[4];
1562 for (int i=0; i<UPRV_LENGTHOF(threads); ++i) {
1563 threads[i].start();
1565 for (int i=0; i<UPRV_LENGTHOF(threads); ++i) {
1566 threads[i].join();
