Lines Matching refs:threads
144 // TestThreads -- see if threads really work at all.
146 // Set up N threads pointing at N chars. When they are started, they will
167 SimpleThread *threads[THREADTEST_NRTHREADS];
174 threads[i] = new TestThreadsThread(&threadTestChars[i]);
178 logln("->" + UnicodeString(threadTestChars) + "<- Firing off threads.. ");
181 if (threads[i]->start() != 0) {
191 errln("Not all threads could be started for testing!");
195 logln("Waiting for threads to be set..");
197 threads[i]->join();
201 delete threads[i];
208 // TestArabicShapeThreads -- see if calls to u_shapeArabic in many threads works successfully
210 // Set up N threads pointing at N chars. When they are started, they will make calls to doTailTest which tests
212 // At the end we make sure all threads managed to run u_shapeArabic successfully.
274 TestArabicShapeThreads threads[30];
278 logln("-> do TestArabicShapingThreads <- Firing off threads.. ");
279 for(i=0; i < UPRV_LENGTHOF(threads); i++) {
280 if (threads[i].start() != 0) {
285 for(i=0; i < UPRV_LENGTHOF(threads); i++) {
286 threads[i].join();
288 logln("->TestArabicShapingThreads <- Got all threads! cya");
313 // This is the code that each of the spawned threads runs.
314 // All threads move together throught the started - middle - done sequence together,
315 // waiting for all other threads to reach each point before advancing.
354 TestMutexThread threads[TESTMUTEX_THREAD_COUNT];
357 if (threads[i].start() != 0) {
363 // Because we are holding gTestMutexA, all of the threads should be blocked
384 threads[i].join();
432 const int kFormatThreadThreads = 10; // # of threads to spawn
831 // Create and start the test threads
833 logln("Spawning: %d threads * %d iterations each.",
866 #define kCollatorThreadThreads 10 // # of threads to spawn
1071 logln(UnicodeString("Spawning: ") + kCollatorThreadThreads + " threads * " + kFormatThreadIterations + " iterations each.");
1105 const int kStringThreadThreads = 10; // # of threads to spawn
1157 logln(UnicodeString("Spawning: ") + kStringThreadThreads + " threads * " + kStringThreadIterations + " iterations each.");
1216 TxThread threads[4];
1218 for (i=0; i<UPRV_LENGTHOF(threads); i++) {
1219 threads[i].start();
1222 for (i=0; i<UPRV_LENGTHOF(threads); i++) {
1223 threads[i].join();
1232 // Create a swarm of threads.
1234 // Increments a global count of started threads.
1236 // Waits on the condition that all threads have started.
1237 // Increments a global count of finished threads.
1238 // Waits on the condition that all threads have finished.
1289 CondThread *threads[NUMTHREADS];
1291 threads[i] = new CondThread;
1292 threads[i]->start();
1306 if (!threads[i]->fFinished) {
1307 errln("File %s, Line %d: Error, threads[%d]->fFinished == false", __FILE__, __LINE__, i);
1312 threads[i]->join();
1313 delete threads[i];
1374 // early, to keep subsequent threads from entering this path.
1453 // eviction can't start until the threads end.
1472 UnifiedCacheThread *threads[CACHE_LOAD][UPRV_LENGTHOF(gCacheLocales)];
1476 threads[i][j] = new UnifiedCacheThread(
1478 threads[i][j]->start();
1484 threads[i][j]->join();
1496 // objects fetched from the cache. If the threads run in series because
1505 // clean up threads
1508 delete threads[i][j];
1559 BreakTranslitThread threads[4];
1560 for (int i=0; i<UPRV_LENGTHOF(threads); ++i) {
1561 threads[i].start();
1563 for (int i=0; i<UPRV_LENGTHOF(threads); ++i) {
1564 threads[i].join();
