HomeSort by relevance Sort by last modified time
    Searched defs:threads (Results 126 - 150 of 506) sorted by null

1 2 3 4 56 7 8 91011>>

  /system/core/init/
ueventd_test.cpp 56 std::vector<std::thread> threads; local
62 threads.emplace_back(std::thread(make_thread_function(file, parameter)));
65 for (auto& thread : threads) {
191 std::vector<std::thread> threads; local
192 std::generate_n(back_inserter(threads), num_threads,
197 for (auto& thread : threads) {
  /system/extras/libfec/
fec_process.cpp 42 /* launches a maximum number of threads to process a read */
54 int threads = sysconf(_SC_NPROCESSORS_ONLN); local
56 if (threads < WORK_MIN_THREADS) {
57 threads = WORK_MIN_THREADS;
58 } else if (threads > WORK_MAX_THREADS) {
59 threads = WORK_MAX_THREADS;
65 size_t count_per_thread = fec_div_round_up(blocks, threads) * FEC_BLOCKSIZE;
68 if ((size_t)threads > max_threads) {
69 threads = (int)max_threads;
76 debug("%d threads, %zu bytes per thread (total %zu)", threads
    [all...]
  /art/libartbase/base/
logging.h 54 bool threads; member in struct:art::LogVerbosity
  /art/test/165-lock-owner-proxy/src/
Main.java 36 final Thread[] threads = new Thread[numberOfThreads]; local
37 for (int t = 0; t < threads.length; t++) {
38 threads[t] = new Thread((t % 2 == 0) ? new ProxyRunner() : new SyncRunner());
40 for (Thread t : threads) {
45 for (Thread t : threads) {
  /art/test/911-get-stack-trace/src/art/
AllTraces.java 27 System.out.println("### Other threads (suspended) ###");
42 Thread threads[] = new Thread[N]; local
51 threads[i] = t;
68 threads[i].join();
  /art/test/924-threads/
threads.cc 152 jthread* threads; local
154 jvmtiError result = jvmti_env->GetAllThreads(&thread_count, &threads);
160 return threads[index];
164 jvmti_env->Deallocate(reinterpret_cast<unsigned char*>(threads));
  /art/test/925-threadgroups/src/art/
Test925.java 70 Thread[] threads = (Thread[])data[0]; local
73 List<Thread> threadList = new ArrayList<>(Arrays.asList(threads));
101 Thread[] threads = (Thread[])data[0]; local
102 if (threads.length == expectedChildCount) {
109 Thread[] threads = (Thread[])data[0]; local
110 System.out.println(Arrays.toString(threads));
128 // Returns an array where element 0 is an array of threads and element 1 is an array of groups.
  /bionic/tests/
ifaddrs_test.cpp 278 std::vector<std::thread*> threads; local
280 threads.push_back(new std::thread([]() {
286 for (auto& t : threads) {
  /bootable/recovery/update_verifier/
update_verifier.cpp 144 std::vector<std::future<bool>> threads; local
180 threads.emplace_back(std::async(std::launch::async, thread_func));
184 for (auto& t : threads) {
188 << " threads.";
  /development/tools/bugreport/src/com/android/bugreport/inspector/
DeadlockDetector.java 33 * Class to inspect an Anr object and determine which, if any threads are
39 * Entry in our growing list of involved threads.
73 * Entry in our growing list of involved threads.
176 // Find all the threads holding this lock.
177 for (ThreadSnapshot thread: lr.process.threads) {
195 if (dump) System.out.println("Involved threads:");
214 cloneProcess.threads.clear();
217 cloneProcess.threads.add(tr.thread);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/
thread_beos.h 149 int32 threads; local
154 threads = atomic_add( &thread_count, 0 );
156 if( threads == 0 ) {
157 /* No threads around, so exit main(). */
  /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/EventModifiers/
ThreadOnlyModifierDebuggee.java 84 logWriter.println("Create threads");
85 Thread[] threads = new Thread[10]; local
86 for (int i = 0; i < threads.length; ++i) {
87 threads[i] = new Thread(new TestThread(obj));
88 threads[i].setName("TestThread#" + i);
92 THREAD_ONLY = threads[threads.length - 1];
101 // Run all threads.
102 for (int i = 0; i < threads.length; ++i) {
103 runThread(threads[i])
    [all...]
  /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/ThreadReference/
ResumeTest.java 53 * <BR>At first the test starts ResumeDebuggee which starts and runs some tested threads.
70 ("## FAILURE: Exception while getting number of started threads from debuggee = " + exception);
72 printErrorAndFail("\n## Can NOT get number of started threads from debuggee! ");
75 logWriter.println("==> Number of threads in debuggee to test = " + testedThreadsNumber);
98 int threads = allThreadIDReply.getNextValueAsInt(); local
99 logWriter.println("==> Number of all threads in debuggee = " + threads);
100 for (int i = 0; i < threads; i++) {
122 logWriter.println("## FAILURE: Tested thread is not found out among debuggee threads!");
129 printErrorAndFail("\n## Some of tested threads are not found!")
    [all...]
SuspendCountTest.java 54 * <BR>At first the test starts SuspendCountDebuggee which starts and runs some tested threads.
55 * <BR>After the tested threads starts, the test suspends every
61 * for all tested threads and main thread.
64 * for all tested threads and main thread.
74 ("## FAILURE: Exception while getting number of started threads from debuggee = " + exception);
76 printErrorAndFail("Can NOT get number of started threads from debuggee! ");
79 logWriter.println("==> There are no started threads in debuggee to test"
84 logWriter.println("==> Number of started threads in debuggee to test = " + testedThreadsNumber);
102 int threads = allThreadIDReply.getNextValueAsInt(); local
103 logWriter.println("==> Number of all threads in debuggee = " + threads)
    [all...]
ThreadGroup002Test.java 54 * groups and starts some tested threads which belong to different created thread groups.
55 * <BR>After the tested threads start, at first the test wait for the some first
56 * tested threads to finish.
62 * <BR>&nbsp;&nbsp; - all threads with status ZOMBIE are only finished tested threads;
63 * <BR>&nbsp;&nbsp; - all threads without status ZOMBIE are only NOT finished tested threads;
76 ("## FAILURE: Exception while getting number of started threads from debuggee = " + exception);
78 printErrorAndFail("\n## Can NOT get number of started threads from debuggee! ");
81 logWriter.println("==> Number of threads in debuggee to test = " + testedThreadsNumber)
108 int threads = allThreadIDReply.getNextValueAsInt(); local
    [all...]
  /external/apache-harmony/jdwp/src/test/java/org/apache/harmony/jpda/tests/jdwp/VirtualMachine/
ResumeTest.java 54 // We need to finish the tested threads before detaching.
55 logWriter.println("Finish debuggee tested threads");
63 * <BR>At first the test starts ResumeDebuggee which starts and runs some tested threads.
65 * ThreadReference.Status command that all debuggee tested threads are suspended.
67 * ThreadReference.Status command that all debuggee tested threads are resumed.
75 // All the threads we're interested in.
78 // Suspend all threads with VirtualMachine.Suspend command.
81 // Check all threads are suspended now.
82 logWriter.println("\n==> Check that all tested threads are suspended " +
86 // Resume all threads with VirtualMachine.Resume command
303 int threads = allThreadIDReply.getNextValueAsInt(); local
    [all...]
  /external/eigen/unsupported/Eigen/CXX11/src/Tensor/
TensorCostModel.h 18 * \brief A cost model used to limit the number of threads used for evaluating
171 // Returns the number of threads in [1:max_threads] to use for
177 int threads = (cost - kStartupCycles) / kPerThreadCycles + 0.9; local
178 return numext::mini(max_threads, numext::maxi(1, threads));
197 // either because we are probably using all available threads already).
  /external/fio/
verify-state.h 44 uint64_t threads; member in struct:all_io_list
  /external/libvpx/libvpx/test/
decode_perf_test.cc 29 #define THREADS 1
35 DecodePerfTest takes a tuple of filename + number of threads to decode with
76 const unsigned threads = GET_PARAM(THREADS); local
82 cfg.threads = threads;
101 printf("\t\"threadCount\" : %u,\n", threads);
225 const uint32_t threads = 4; local
231 cfg.threads = threads;
    [all...]
  /external/libvpx/libvpx/vpx/
svc_context.h 42 int threads; member in struct:__anon26280
  /external/ltp/testcases/kernel/controllers/io-throttle/
iobw.c 46 const char usage[] = "Usage: iobw [-direct] threads chunk_size data_size\n";
67 static int threads; variable
172 for (i = 0; i < threads; i++)
176 for (i = 0; i < threads; i++) {
226 if ((threads = atoi(argv[1])) == 0) {
249 children = malloc(sizeof(pid_t) * threads);
265 for (i = 0; i < threads; i++)
267 for (i = 0; i < threads; i++) {
276 print_results(0, NUM_IOPS, data_size * threads * NUM_IOPS, &diff);
  /external/ltp/testcases/kernel/mem/mtest06/
mmap3.c 26 * 1GB) this is done by multiple threads.
30 * specified number of hours by a certain number of threads.
46 static int threads = 40; variable
127 pthread_t thids[threads];
132 for (i = 0; i < threads; i++) {
138 for (i = 0; i < threads; i++)
155 if (tst_parse_int(str_threads, &threads, 1, INT_MAX))
156 tst_brk(TBROK, "Invalid number of threads '%s'", str_threads);
173 tst_res(TINFO, "Number of threads %i", threads);
    [all...]
  /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_create/
1-6.c 31 * lower priority does not finish until the high priority threads finished
102 pthread_t threads[n_threads]; local
126 ret = pthread_create(&threads[i], &attr, do_work, NULL);
142 pthread_join(threads[i], NULL);
248 printf("INFO: Affinity not supported, running %i threads.\n",
  /external/ltp/utils/ffsb-6.0-rc2/
ffsb_tg.h 37 * "gang" of threads performing a particular mix of operations.
53 * that all their threads have been spawned The second one
54 * "thread_barrier" synchronizes all threads across multiple thread
65 struct ffsb_thread *threads; member in struct:ffsb_tg
93 /* Used for stopping the threads */
115 * multiple tgs and all threads pt is for pthread_create()
185 /* The threads in the tg should be the only ones using these (below)
192 /* The threads in this tg will use this function to get an op to run,
  /external/protobuf/java/util/src/test/java/com/google/protobuf/util/
TimeUtilTest.java 128 final List<Thread> threads = new ArrayList<Thread>(); local
136 threads.add(thread);
140 for (Thread thread : threads) {

Completed in 890 milliseconds

1 2 3 4 56 7 8 91011>>