Searched refs:step (Results 1 - 25 of 72) sorted by relevance

123

/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/des/
H A Df_parity.c19 #define smask(step) ((1<<step)-1)
20 #define pstep(x,step) (((x)&smask(step))^(((x)>>step)&smask(step)))
/illumos-gate/usr/src/lib/libgen/inc/
H A Dregexpr.h60 extern int step(const char *string, const char *expbuf);
64 extern int step();
/illumos-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DLinearDistribution.java37 * bounded by the step parameter of the {@code lquantize()} action.
40 * step, unless it is the first bucket, which is the frequency of all
46 * and a step of 10. It has twelve buckets starting with {@code n < 0}
65 private long step; field in class:LinearDistribution
72 new String[] {"base", "step", "buckets" });
90 step = frequencyStep;
94 * Creates a linear distribution with the given base, step, and
106 * @throws IllegalArgumentException if the given step is less than
116 step = bucketStep;
118 if (step <
129 getBucketRange(int i, int len, long base, long step) argument
[all...]
H A DLogLinearDistribution.java27 * by the step parameter of the {@code llquantize()} action.
81 * @param enc The encoded representation of the high, low, step and steps
124 long next, step;
146 step = (next > nsteps) ? (next / nsteps) : 1;
150 rangeCache[bucket][1] = value + step - 1;
153 if ((value += step) != next)
157 step = (next > nsteps) ? (next / nsteps) : 1;
/illumos-gate/usr/src/lib/libadm/common/
H A Dregexp.c48 #define step __step macro
/illumos-gate/usr/src/uts/i86pc/os/
H A Dcpuid_subr.c356 synth_amd_info(uint_t family, uint_t model, uint_t step, argument
370 step >= rmp->rm_steplo && step <= rmp->rm_stephi) {
441 _cpuid_skt(uint_t vendor, uint_t family, uint_t model, uint_t step) argument
447 synth_amd_info(family, model, step, &skt, NULL, NULL);
459 _cpuid_sktstr(uint_t vendor, uint_t family, uint_t model, uint_t step) argument
467 synth_amd_info(family, model, step, &skt, NULL, NULL);
487 _cpuid_chiprev(uint_t vendor, uint_t family, uint_t model, uint_t step) argument
493 synth_amd_info(family, model, step, NULL, &chiprev, NULL);
505 _cpuid_chiprevstr(uint_t vendor, uint_t family, uint_t model, uint_t step) argument
[all...]
H A Ddtrace_subr.c198 uint8_t step = curthread->t_dtrace_step; local
217 if (step == 0) {
/illumos-gate/usr/src/man/man3gen/
H A DMakefile37 step.3gen \
51 step.3gen := LINKSRC = regexpr.3gen
/illumos-gate/usr/src/cmd/dtrace/test/tst/common/java_api/src/
H A DTestBean.java252 int step = 10;
255 for (int i = base; i < (n * step); i += step) {
256 bucket = new Distribution.Bucket(i, (i + (step - 1)),
257 ((i - 1) / step));
260 bucket = new Distribution.Bucket((n * step) + 1, Long.MAX_VALUE, 0);
262 LinearDistribution d = new LinearDistribution(base, step, buckets);
270 long next, step;
288 step = (next > nsteps) ? (next / nsteps) : 1;
291 bucket = new Distribution.Bucket(value, value + step
[all...]
/illumos-gate/usr/src/uts/common/sys/fibre-channel/fca/emlxs/
H A Demlxs_sdapi.h124 uint32_t step);
131 uint32_t *step,
/illumos-gate/usr/src/uts/sun4/os/
H A Ddtrace_subr.c125 uint8_t step = curthread->t_dtrace_step; local
143 if (step == 0) {
/illumos-gate/usr/src/uts/common/io/igb/
H A Digb_sw.h247 * ASSERT(step < limit)
251 #define NEXT_INDEX(index, step, limit) (((index) + (step)) < (limit) ? \
252 (index) + (step) : (index) + (step) - (limit))
253 #define PREV_INDEX(index, step, limit) ((index) >= (step) ? \
254 (index) - (step) : (index) + (limit) - (step))
/illumos-gate/usr/src/uts/common/io/ixgbe/
H A Dixgbe_sw.h317 * ASSERT(step < limit)
321 #define NEXT_INDEX(index, step, limit) (((index) + (step)) < (limit) ? \
322 (index) + (step) : (index) + (step) - (limit))
323 #define PREV_INDEX(index, step, limit) ((index) >= (step) ? \
324 (index) - (step) : (index) + (limit) - (step))
/illumos-gate/usr/src/boot/lib/libz/test/
H A Dinfcover.c276 text to include in an error message, step is how much input data to feed
284 local void inf(char *hex, char *what, unsigned step, int win, unsigned len, argument
312 if (step == 0 || step > have)
313 step = have;
314 strm.avail_in = step;
315 have -= step;
339 strm.avail_in = step > have ? have : step;
/illumos-gate/usr/src/man/man5/
H A DMakefile164 step.5 \
182 step.5 := LINKSRC = regexp.5
/illumos-gate/usr/src/lib/libc/port/locale/
H A Dengine.c49 #define step sstep macro
60 #define step lstep macro
71 #define step mstep macro
110 static states step(struct re_guts *, sopno, sopno, states, wint_t, states);
753 * fast - step through the string at top speed
773 st = step(m->g, startst, stopst, st, NOTHING, st);
813 st = step(m->g, startst, stopst, st,
828 st = step(m->g, startst, stopst, st, flagch, st);
840 st = step(m->g, startst, stopst, tmp, c, st);
842 assert(EQ(step(
955 step(struct re_guts *g, function
1136 #undef step macro
[all...]
/illumos-gate/usr/src/lib/libast/common/comp/
H A Dregexp.h61 #define step(a,b) _re_exec(&_re_info,a,b,0) macro
/illumos-gate/usr/src/grub/grub-0.97/stage2/
H A Dexpand.c195 uint_t family, model, step; local
210 step = BITX(vcr->r_eax, 3, 0);
212 grub_printf("cpu: '%s' family %d model %d step %d\n",
213 vendor, family, model, step);
/illumos-gate/usr/src/lib/libast/amd64/include/ast/
H A Dregexp.h70 #define step(a,b) _re_exec(&_re_info,a,b,0) macro
/illumos-gate/usr/src/lib/libast/i386/include/ast/
H A Dregexp.h70 #define step(a,b) _re_exec(&_re_info,a,b,0) macro
/illumos-gate/usr/src/lib/libast/sparc/include/ast/
H A Dregexp.h70 #define step(a,b) _re_exec(&_re_info,a,b,0) macro
/illumos-gate/usr/src/lib/libast/sparcv9/include/ast/
H A Dregexp.h70 #define step(a,b) _re_exec(&_re_info,a,b,0) macro
/illumos-gate/usr/src/lib/libdladm/common/
H A Dusage.c40 #define NET_RESET_TOT(tbytes, ttime, tibytes, tobytes, step) { \
41 (step) = 1; \
1055 int step = 1; local
1126 tot_obytes, step);
1134 if (--step == 0) {
1152 tot_obytes, step);
1196 int step = 1; local
1271 if (--step == 0) {
1277 step = 1;
1294 step
[all...]
/illumos-gate/usr/src/cmd/nl/
H A Dnl.c618 if (step(p, bexpbuf)) {
626 if (step(p, hexpbuf)) {
634 if (step(p, fexpbuf)) {
/illumos-gate/usr/src/cmd/sgs/rtld.4.x/
H A Ddiv.s138 ! our usual 4-at-a-shot divide step will cause overflow and havoc. The
168 ! %o5 > %o3: went too far: back up 1 step
174 ! first divide step without thinking. BUT, the others are conditional,
176 ! order bit set in the first step, just falling into the regular

Completed in 95 milliseconds

123