Searched refs:dist (Results 1 - 23 of 23) sorted by relevance

/illumos-gate/usr/src/test/zfs-tests/tests/functional/compression/
H A Dcompress_004_pos.ksh59 typeset -i dist=0
63 (( dist = fsz - start ))
64 for len in `expr $RANDOM % $dist` $dist \
65 `expr $start + $dist`; do
/illumos-gate/usr/src/boot/lib/libz/
H A Dinffast.c94 unsigned dist; /* match distance */ local
165 dist = (unsigned)(here.val);
175 dist += (unsigned)hold & ((1U << op) - 1);
177 if (dist > dmax) {
185 Tracevv((stderr, "inflate: distance %u\n", dist));
187 if (dist > op) { /* see if copy from window */
188 op = dist - op; /* distance back in window */
208 from = out - dist;
224 from = out - dist; /* rest from output */
242 from = out - dist; /* res
[all...]
H A Ddeflate.h297 int ZLIB_INTERNAL _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
305 #define d_code(dist) \
306 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
307 /* Mapping from a distance to a distance code. dist is the distance - 1 and
332 ush dist = (distance); \
333 s->d_buf[s->last_lit] = dist; \
335 dist--; \
337 s->dyn_dtree[d_code(dist)]
[all...]
H A Dtrees.c242 int dist; /* distance index */ local
272 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
273 dist = 0;
275 base_dist[code] = dist;
277 _dist_code[dist++] = (uch)code;
280 Assert (dist == 256, "tr_static_init: dist != 256");
281 dist >>= 7; /* from now on, all distances are divided by 128 */
283 base_dist[code] = dist <<
1065 unsigned dist; /* distance of matched string */ local
[all...]
H A Dinflate.c385 unsigned dist; local
411 dist = state->wsize - state->wnext;
412 if (dist > copy) dist = copy;
413 zmemcpy(state->window + state->wnext, end - copy, dist);
414 copy -= dist;
421 state->wnext += dist;
423 if (state->whave < state->wsize) state->whave += dist;
/illumos-gate/usr/src/cmd/mdb/common/modules/genunix/
H A Ddist.c33 #include "dist.h"
46 int dist = end - beg + 1; local
49 out[pos] = beg + (pos * dist)/buckets;
164 const char *dist = " Distribution "; local
173 n = (NCHARS - strlen(dist)) / 2;
177 mdb_printf("%*s %s%s%s %s\n", width, label, dashes, dist, dashes,
H A Dkgrep.c117 * value in [pattern, pattern + dist) OR
127 uintbits_t dist = kg->kg_dist; \
166 (uintbits_t)(cur - pattern) >= dist) \
204 " -d dist\n"
205 " Search for values in [addr, addr + dist)\n"
222 uintmax_t dist = 0; local
239 'd', MDB_OPT_UINT64, &dist,
250 if (dist != 0)
288 if (dist > 0 &&
289 ((dist
[all...]
/illumos-gate/usr/src/uts/common/zmod/
H A Dinffast.c96 unsigned dist; /* match distance */ local
167 dist = (unsigned)(this.val);
177 dist += (unsigned)hold & ((1U << op) - 1);
179 if (dist > dmax) {
187 Tracevv((stderr, "inflate: distance %u\n", dist));
189 if (dist > op) { /* see if copy from window */
190 op = dist - op; /* distance back in window */
204 from = out - dist; /* rest from output */
222 from = out - dist; /* rest from output */
233 from = out - dist; /* res
[all...]
H A Ddeflate.h283 int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
290 #define d_code(dist) \
291 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
292 /* Mapping from a distance to a distance code. dist is the distance - 1 and
317 ush dist = (distance); \
318 s->d_buf[s->last_lit] = dist; \
320 dist--; \
322 s->dyn_dtree[d_code(dist)]
[all...]
H A Dtrees.c246 int dist; /* distance index */ local
274 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
275 dist = 0;
277 base_dist[code] = dist;
279 _dist_code[dist++] = (uch)code;
282 Assert (dist == 256, "tr_static_init: dist != 256");
283 dist >>= 7; /* from now on, all distances are divided by 128 */
285 base_dist[code] = dist <<
1077 unsigned dist; /* distance of matched string */ local
[all...]
H A Dinflate.c335 unsigned copy, dist; local
362 dist = state->wsize - state->write;
363 if (dist > copy) dist = copy;
364 zmemcpy(state->window + state->write, strm->next_out - copy, dist);
365 copy -= dist;
372 state->write += dist;
374 if (state->whave < state->wsize) state->whave += dist;
/illumos-gate/usr/src/lib/libxcurses2/src/libc/xcurses/
H A Dmvcur.c130 int parm_cursor, one_step, dist; local
138 dist = orow - nrow;
142 dist = nrow - orow;
151 add_op(try, parm_cursor, dist, 0);
156 add_op(try, one_step, dist, 0);
182 int dist, tabs, tabstop; local
210 dist = nc - oc;
227 dist = oc - nc;
250 add_op(best, dir->_one, dist, 0);
290 int parm_cursor, dist; local
[all...]
/illumos-gate/usr/src/lib/libxcurses/src/libc/xcurses/
H A Dmvcur.c131 int parm_cursor, one_step, dist; local
139 dist = orow - nrow;
143 dist = nrow - orow;
152 add_op(try, parm_cursor, dist, 0);
157 add_op(try, one_step, dist, 0);
185 int dist, tabs, tabstop; local
193 tabs = tabstop = dist = 0;
213 dist = nc - oc;
230 dist = oc - nc;
252 add_op(best, dir->_one, dist,
292 int parm_cursor, dist; local
[all...]
/illumos-gate/usr/src/cmd/mdb/intel/ia32/libumem/
H A DMakefile32 dist.c \
/illumos-gate/usr/src/cmd/mdb/sparc/v7/libumem/
H A DMakefile32 dist.c \
/illumos-gate/usr/src/cmd/mdb/intel/amd64/libumem/
H A DMakefile32 dist.c \
/illumos-gate/usr/src/cmd/mdb/sparc/v9/libumem/
H A DMakefile32 dist.c \
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/pppdump/
H A Dzlib.c409 local int ct_tally OF((deflate_state *s, int dist, int lc));
1599 #define d_code(dist) \
1600 ((dist) < 256 ? dist_code[dist] : dist_code[256+((dist)>>7)])
1601 /* Mapping from a distance to a distance code. dist is the distance - 1 and
1676 int dist; /* distance index */ local
1695 /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
1696 dist
2456 unsigned dist; /* distance of matched string */ local
4109 uInt dist; /* distance back to copy from */ member in struct:inflate_codes_state::__anon140::__anon142
[all...]
/illumos-gate/usr/src/uts/common/io/ppp/spppcomp/
H A Dzlib.c585 int _tr_tally OF((deflate_state *s, unsigned dist, unsigned lc));
593 #define d_code(dist) \
594 ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
596 * Mapping from a distance to a distance code. dist is the distance - 1 and
616 ush dist = (distance); \
617 s->d_buf[s->last_lit] = dist; \
619 dist--; \
621 s->dyn_dtree[d_code(dist)]
2465 int dist; /* distance index */ local
3364 unsigned dist; /* distance of matched string */ local
5290 uInt dist; /* distance back to copy from */ member in struct:inflate_codes_state::__anon6458::__anon6460
[all...]
/illumos-gate/usr/src/cmd/troff/troff.d/
H A Ddraw.c178 numdots = (dist(x[i],y[i], x[i+1],y[i+1]) + dist(x[i+1],y[i+1], x[i+2],y[i+2])) / 2;
234 dist(x1, y1, x2, y2) /* integer distance from x1,y1 to x2,y2 */ function
/illumos-gate/usr/src/cmd/fs.d/ufs/volcopy/
H A Dvolcopy.c308 long dist; local
583 dist = (long)(Fs * BLKSIZ);
588 dist = (long)(V_labl.v_offset * BLKSIZ);
591 if (lseek(lfdes, dist, 0) < 0)
/illumos-gate/usr/src/uts/common/io/usb/clients/usbinput/usbwcm/
H A Dusbwcm.c111 int dist = abs(val - sc->sc_abs[idx].value); local
113 if (dist < sc->sc_abs[idx].fuzz >> 1) {
115 } else if (dist < sc->sc_abs[idx].fuzz) {
117 } else if (dist < sc->sc_abs[idx].fuzz << 1) {
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dbtree.c1786 int i, dist; local
1788 dist = SWAB32(pBt, pInfo->aFree[0]) - nearby;
1789 if( dist<0 ) dist = -dist;
1793 if( d2<dist ) closest = i;

Completed in 149 milliseconds