Searched refs:nsteps (Results 1 - 9 of 9) sorted by relevance
| /macosx-10.9.5/Security-55471.14.18/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.9.5/Security-55471.14.18/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.9.5/dtrace-118.1/libdtrace/ |
| 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_consume.c | 696 uint16_t factor, low, high, nsteps; local
713 nsteps = DTRACE_LLQUANTIZE_NSTEP(arg);
720 nsteps == 0 || factor > nsteps)
759 step = next > nsteps ? next / nsteps : 1;
789 step = next > nsteps ? next / nsteps : 1;
|
| H A D | dt_cc.c | 1515 uint16_t factor, low, high, nsteps; local
1561 nsteps = args[3].value;
1574 if (nsteps < factor) {
1581 for (v = factor; v < nsteps; v *= factor)
1584 if ((nsteps % factor) || (v % nsteps)) {
1604 arg = ((int64_t) nsteps << DTRACE_LLQUANTIZE_NSTEPSHIFT)
|
| /macosx-10.9.5/Chess-310.5/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.9.5/xnu-2422.115.4/bsd/dev/dtrace/ |
| H A D | dtrace.c | 2069 int16_t nsteps, int64_t value)
2087 int nbuckets = this > nsteps ? nsteps : this;
2130 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(arg);
2132 llquanta[dtrace_aggregate_llquantize_bucket(factor, low, high, nsteps, nval)] += incr;
10645 uint16_t nsteps = DTRACE_LLQUANTIZE_NSTEP(desc->dtad_arg);
10651 if (factor < 2 || low >= high || nsteps < factor)
10659 for (v = factor; v < nsteps; v *= factor)
10662 if ((v % nsteps) || (nsteps
[all...] |
Completed in 135 milliseconds