Searched defs:N_PROC (Results 1 - 11 of 11) sorted by relevance

/ast/src/cmd/tests/aso/
H A Dtproc.c25 #ifndef N_PROC
26 #define N_PROC 8 macro
34 /* all threads wait until this is == N_PROC */
45 while(*Active < N_PROC) /* wait for all to be ready */
62 pid_t pid, cpid[N_PROC];
91 tinfo("testing %s method with %d processes", meth->name, N_PROC);
98 #if N_PROC > 1
99 for(k = 0; k < N_PROC; ++k)
111 if (twait(cpid, N_PROC))
119 if(*Count != N_PROC*N_STE
[all...]
H A Dtlock.c29 #ifndef N_PROC
30 #define N_PROC 16 macro
152 z = sizeof(*Nproc) + (N_PROC+1)*sizeof(pid_t) + sizeof(*Done) +
163 Done = (unsigned int*)(Pid + (N_PROC+1)*sizeof(pid_t));
168 for(k = 1; k <= N_PROC; ++k)
177 if(*Nproc == N_PROC)
184 if (twait(Pid+1, N_PROC))
187 if(*Done != N_PROC)
/ast/src/cmd/tests/sfio/
H A Dtmprocess.c26 #ifndef N_PROC
27 #define N_PROC 3 macro
67 static Sfdisc_t Disc[N_PROC];
71 ssize_t size[N_PROC][N_REC];
72 int count[N_PROC];
73 char record[N_PROC][128], *s, *file;
76 Sfio_t* fa[N_PROC];
77 char buf[N_PROC][B_SIZE], b[N_PROC][128];
82 for(i = 0; i < N_PROC;
[all...]
/ast/src/cmd/tests/vmalloc/
H A Dtsharemem.c28 #ifndef N_PROC
29 #define N_PROC 64 macro
116 pid_t proc[N_PROC];
137 size = 2*size*N_PROC; /* this should be big enough for region */
164 for(k = 0; k < N_PROC; ++k)
168 code = twait(proc, N_PROC);
180 if(vmst.n_busy != (N_ALLOC-N_FREE)*N_PROC)
182 store, vmst.n_busy, (N_ALLOC-N_FREE)*N_PROC );
/ast/src/cmd/tests/cdt/
H A Dtrehash.c29 #ifndef N_PROC
30 #define N_PROC 64 macro
33 #define N_OBJ (N_PROC*64*1024) /* #objects to insert */
35 #define PROGRESS (N_OBJ/(N_PROC*4)) /* amount done */
69 static Proc_t Proc[N_PROC]; /* process workloads */
70 static int Pnum = N_PROC+1; /* start as parent */
132 while(asogetint(&State->insert) != N_PROC) /* wait until all processes are set */
164 while(asogetint(&State->delete) != N_PROC) /* wait until all processes are set */
192 pid_t pid[N_PROC];
225 objn = N_OBJ/N_PROC;
[all...]
H A Dtsafehash.c29 #ifndef N_PROC
30 #define N_PROC 64 macro
33 #define N_OBJ (N_PROC*64*1024) /* #objects to insert */
35 #define PROGRESS (N_OBJ/(N_PROC*4)) /* amount done */
69 static Proc_t Proc[N_PROC]; /* process workloads */
70 static int Pnum = N_PROC+1; /* start as parent */
132 while(asogetint(&State->insert) != N_PROC) /* wait until all processes are set */
164 while(asogetint(&State->delete) != N_PROC) /* wait until all processes are set */
192 pid_t pid[N_PROC];
225 objn = N_OBJ/N_PROC;
[all...]
H A Dtsafetree.c29 #ifndef N_PROC
30 #define N_PROC 64 macro
33 #define N_OBJ (N_PROC*64*1024) /* #objects to insert */
35 #define PROGRESS (N_OBJ/(N_PROC*4)) /* amount done */
69 static Proc_t Proc[N_PROC]; /* process workloads */
70 static int Pnum = N_PROC+1; /* start as parent */
134 while(asogetint(&State->insert) != N_PROC) /* wait until all processes are set */
166 while(asogetint(&State->delete) != N_PROC) /* wait until all processes are set */
194 pid_t pid[N_PROC];
227 objn = N_OBJ/N_PROC;
[all...]
H A Dtvsafehash.c29 #ifndef N_PROC
30 #define N_PROC 64 macro
32 #if N_PROC < 2
33 #undef N_PROC macro
34 #define N_PROC 2 macro
37 #define N_CONCUR ((N_PROC/2)*2) /* #players, must be even */
H A Dtvsaferehash.c29 #ifndef N_PROC
30 #define N_PROC 64 macro
32 #if N_PROC < 2
33 #undef N_PROC macro
34 #define N_PROC 2 macro
37 #define N_CONCUR ((N_PROC/2)*2) /* #players, must be even */
H A Dtvsafetree.c29 #ifndef N_PROC
30 #define N_PROC 64 macro
32 #if N_PROC < 2
33 #undef N_PROC macro
34 #define N_PROC 2 macro
37 #define N_CONCUR ((N_PROC/2)*2) /* #players, must be even */
H A Dtvsharemem.c28 #ifndef N_PROC
29 #define N_PROC 48 macro
31 #if N_PROC < 8
32 #undef N_PROC macro
33 #define N_PROC 8 macro
36 #define N_INSERT (N_PROC/3) /* #concurrent writers */
37 #define N_DELETE (N_PROC/3) /* #concurrent deleters */
38 #define N_SEARCH (N_PROC/3) /* #concurrent searchers */

Completed in 29 milliseconds