HomeSort by: relevance | last modified time | path
    Searched defs:NTHREADS (Results 1 - 5 of 5) sorted by relevancy

  /src/tests/rump/kernspace/
tsleep.c 42 #define NTHREADS 10
59 if (wakeups >= NTHREADS-1) {
85 struct lwp *notbigl[NTHREADS];
90 for (i = 0; i < NTHREADS; i++) {
97 for (i = 0; i < NTHREADS; i++) {
  /src/tests/lib/libpthread/
t_preempt.c 51 #define NTHREADS 1
101 for (i = 0; i < NTHREADS; i++) {
105 while (started < NTHREADS) {
t_sem.c 106 #define NTHREADS 10
159 pthread_t threads[NTHREADS];
189 for (i = 0; i < NTHREADS; i++) {
194 for (i = 0; i < NTHREADS; i++) {
200 for (i = 0; i < NTHREADS; i++) {
h_resolv.c 46 #define NTHREADS 10
67 "Usage: %s [-d] [-h <nhosts>] [-n <nthreads>] <file> ...\n",
145 int nthreads = NTHREADS; local in function:main
162 nthreads = atoi(optarg);
174 if ((nleft = malloc(nthreads * sizeof(int))) == NULL)
180 if ((threads = malloc(nthreads * sizeof(pthread_t))) == NULL)
184 for (i = 0; i < nthreads; i++) {
191 for (i = 0; i < nthreads; i++) {
207 for (i = 0; i < nthreads; i++
    [all...]
t_once.c 52 #define NTHREADS 25
113 pthread_t threads[NTHREADS];
114 int id[NTHREADS];
119 for (i=0; i < NTHREADS; i++) {
124 for (i=0; i < NTHREADS; i++)

Completed in 13 milliseconds