| /macosx-10.10.1/Security-57031.1.35/Security/include/security_smime/ |
| H A D | plhash.h | 97 PRUint32 nsteps; /* number of hash chains traversed */ member in struct:PLHashTable
|
| H A D | plhash.c | 208 ht->nsteps++;
236 ht->nsteps++;
491 fprintf(fp, " mean steps per hash: %g\n", (double)ht->nsteps
|
| /macosx-10.10.1/Security-57031.1.35/Security/libsecurity_smime/lib/ |
| H A D | plhash.h | 97 PRUint32 nsteps; /* number of hash chains traversed */ member in struct:PLHashTable
|
| H A D | plhash.c | 208 ht->nsteps++;
236 ht->nsteps++;
491 fprintf(fp, " mean steps per hash: %g\n", (double)ht->nsteps
|
| /macosx-10.10.1/Security-57031.1.35/libsecurity_smime/Security/ |
| H A D | plhash.h | 95 PRUint32 nsteps; /* number of hash chains traversed */ member in struct:PLHashTable
|
| H A D | plhash.c | 208 ht->nsteps++;
236 ht->nsteps++;
491 fprintf(fp, " mean steps per hash: %g\n", (double)ht->nsteps
|
| /macosx-10.10.1/Security-57031.1.35/libsecurity_smime/lib/ |
| H A D | plhash.h | 95 PRUint32 nsteps; /* number of hash chains traversed */ member in struct:PLHashTable
|
| H A D | plhash.c | 208 ht->nsteps++;
236 ht->nsteps++;
491 fprintf(fp, " mean steps per hash: %g\n", (double)ht->nsteps
|
| /macosx-10.10.1/Security-57031.1.35/libsecurity_smime/security_smime/ |
| H A D | plhash.h | 95 PRUint32 nsteps; /* number of hash chains traversed */ member in struct:PLHashTable
|
| H A D | plhash.c | 208 ht->nsteps++;
236 ht->nsteps++;
491 fprintf(fp, " mean steps per hash: %g\n", (double)ht->nsteps
|
| /macosx-10.10.1/Chess-310.6/Sources/ |
| H A D | MBCBoardViewModels.mm | 79 const int nsteps = 32;
95 gluDisk(q, tr0, tr1, nsteps, 1);
98 gluDisk(q, tr1, tr0, nsteps, 1);
100 POLY_STAT(nsteps);
109 gluCylinder(q, tr1, tr0, -dh, nsteps, 1);
112 gluCylinder(q, tr0, tr1, dh, nsteps, 1);
115 POLY_STAT(2*nsteps);
|
| /macosx-10.10.1/dtrace-147/libdtrace/ |
| H A D | dt_consume.c | 1010 uint16_t factor, low, high, nsteps; local
1027 nsteps = DTRACE_LLQUANTIZE_NSTEP(arg);
1034 nsteps == 0 || factor > nsteps)
1073 step = next > nsteps ? next / nsteps : 1;
1103 step = next > nsteps ? next / nsteps : 1;
|
| H A D | dt_aggregate.c | 227 int16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); local
232 assert(nsteps >= factor);
233 assert(nsteps % factor == 0);
241 step = next > nsteps ? next / nsteps : 1;
253 step = next > nsteps ? next / nsteps : 1;
|
| H A D | dt_cc.c | 1528 uint16_t factor, low, high, nsteps; local
1574 nsteps = args[3].value;
1587 if (nsteps < factor) {
1594 for (v = factor; v < nsteps; v *= factor)
1597 if ((nsteps % factor) || (v % nsteps)) {
1617 arg = ((int64_t) nsteps << DTRACE_LLQUANTIZE_NSTEPSHIFT)
|
| /macosx-10.10.1/xnu-2782.1.97/bsd/dev/dtrace/ |
| H A D | dtrace.c | 2155 int16_t nsteps, int64_t value)
2173 int nbuckets = this > nsteps ? nsteps : this;
2216 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(arg); local
2218 llquanta[dtrace_aggregate_llquantize_bucket(factor, low, high, nsteps, nval)] += incr;
9837 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(desc->dtad_arg); local
9843 if (factor < 2 || low >= high || nsteps < factor)
9851 for (v = factor; v < nsteps; v *= factor)
9854 if ((v % nsteps) || (nsteps
2154 dtrace_aggregate_llquantize_bucket(int16_t factor, int16_t low, int16_t high, int16_t nsteps, int64_t value) argument
[all...] |