| /src/tests/lib/libutil/ |
| t_strpct.c | 56 const char *have = strspct(buf + 1, bufsiz, num, den, digits); local in function:check_strspct
62 ATF_REQUIRE_MSG(have == buf + 1,
63 "have != buf");
64 ATF_CHECK_MSG(bufsiz > 0 ? strcmp(have, want) == 0 : true,
65 "%s:%u: want \"%s\", have \"%s\"",
66 file, line, want, have);
84 const char *have = strpct(buf + 1, bufsiz, num, den, digits); local in function:check_strpct
90 ATF_REQUIRE_MSG(have == buf + 1,
91 "have != buf");
92 ATF_CHECK_MSG(bufsiz > 0 ? strcmp(have, want) == 0 : true
[all...] |
| /src/common/dist/zlib/examples/ |
| zpipe.c | 39 unsigned have; local in function:def
69 have = CHUNK - strm.avail_out;
70 if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
95 unsigned have; local in function:inf
135 have = CHUNK - strm.avail_out;
136 if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
|
| zran.h | 19 int have; // number of access points in list member in struct:deflate_index
|
| fitblk.c | 131 unsigned have; /* bytes written by deflate() call */ local in function:main
165 have = size + EXCESS - def.avail_out;
166 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
175 size - have, size);
218 have = size - def.avail_out;
219 if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
231 size - have, size, def.total_in);
|
| gun.c | 155 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
156 last = have ? (have--, (int)(*next++)) : -1)
160 have offset the index, but it's faster to waste the memory */
175 if (chunk > have) { \
176 chunk -= have; \
177 have = 0; \
181 if (chunk > have) { \
182 chunk = have = 0;
386 unsigned have, flags, len; local in function:gunpipe
[all...] |
| gzappend.c | 262 unsigned have; local in function:gzscan
296 have = full = 0;
306 strm->avail_out = DSIZE - have;
307 strm->next_out = window + have;
317 crc = crc32(crc, window + have, DSIZE - have - strm->avail_out);
319 have = DSIZE - strm->avail_out;
321 have = 0;
363 rotate(window, DSIZE, have);
364 have = DSIZE
[all...] |
| zran.c | 52 // be constrained to have access points at block boundaries, but would require
87 index->have = 0;
96 else if (index->have == index->mode) {
107 // Fill in the access point and increment how many we have.
108 point_t *next = (point_t *)(index->list) + index->have++;
109 if (index->have < 0) {
122 // Return the index, which may have been newly allocated or destroyed.
229 point_t *list = realloc(index->list, sizeof(point_t) * index->have);
238 return index->have;
243 // that do not have inflatePrime()
294 int have = 0; local in function:inflatePreface
[all...] |
| /src/common/dist/zlib/contrib/infback9/ |
| inflate9.h | 42 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
| infback9.c | 122 if (have == 0) { \
123 have = in(in_desc, &next); \
124 if (have == 0) { \
137 have--; \
217 unsigned have; /* available input */ local in function:inflateBack9
254 have = next != Z_NULL ? strm->avail_in : 0;
321 if (copy > have) copy = have;
324 have -= copy;
351 state->have = 0
[all...] |
| /src/common/dist/zlib/ |
| gzwrite.c | 69 unsigned have, max = ((unsigned)-1 >> 2) + 1; local in function:gz_comp
125 have = strm->avail_out;
132 have -= strm->avail_out;
133 } while (have);
197 unsigned have, copy; local in function:gz_write
201 have = (unsigned)((state->strm.next_in + state->strm.avail_in) -
203 copy = state->size - have;
206 memcpy(state->in + have, buf, copy);
290 unsigned have; local in function:gzputc
317 have = (unsigned)((strm->next_in + strm->avail_in) - state->in)
[all...] |
| infback.c | 127 have = strm->avail_in; \
138 strm->avail_in = have; \
154 if (have == 0) { \
155 have = in(in_desc, &next); \
156 if (have == 0) { \
169 have--; \
249 unsigned have, left; /* available input and output */ local in function:inflateBack
272 have = next != Z_NULL ? strm->avail_in : 0;
334 if (copy > have) copy = have;
[all...] |
| inflate.h | 118 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
| inflate.c | 451 have = strm->avail_in; \
462 strm->avail_in = have; \
478 if (have == 0) goto inf_leave; \
479 have--; \
553 would all have to actually be part of the saved state in case NEEDBITS()
596 unsigned have, left; /* available input and output */ local in function:inflate
626 in = have;
737 if (copy > have) copy = have;
749 have -= copy
[all...] |
| deflate.c | 96 * the desired pack level (0..9). The values given below have been tuned to
283 s->strstart -= wsize; /* we now have strstart >= MAX_DIST */
308 /* Initialize the hash value now that we have some input: */
334 /* If the WIN_INIT bytes after the end of the current data have never been
475 * code is written. At that time, 31*(n - 2) bits have been written, just
476 * after 24*(n - 2) bits have been consumed from sym_buf. sym_buf starts at
828 * the data being compressed may have slid out of the sliding window, impeding
1199 * that the flush is complete. So we don't have to output an
1282 * doesn't have enough memory anyway to duplicate compression states).
1383 /* Do not waste too much time if we already have a good match: *
1640 unsigned len, left, have, last = 0; local in function:deflate_stored
[all...] |
| zlib.h | 53 but other algorithms will be added later and will have the same stream
156 returned by zalloc for objects of exactly 65536 bytes *must* have their
470 operation to complete. (The size of the uncompressed data may have been
574 compressed data instead of a zlib wrapper. The gzip header will have no
663 to dictionary. dictionary must have enough space, where 32768 bytes is
701 will leave the compression level and any other attributes that may have been
717 strategy is changed, and if there have been any deflate() calls since the
725 not have enough output space to complete, then the parameter change will not
782 deflatePending() returns the number of bytes and bits of output that have
919 to dictionary. dictionary must have enough space, where 32768 bytes i
1842 unsigned have; member in struct:gzFile_s
[all...] |
| /src/libexec/rpc.rstatd/ |
| rstat_proc.c | 19 * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
153 static u_int have; local in function:rstatproc_havedisk_3_svc
158 have = havedisk();
159 return (&have);
283 * returns true if have a disk
|
| /src/usr.bin/jot/ |
| jot.c | 140 unsigned int have = 0; local in function:getargs
191 have |= STEP;
198 have |= ENDER;
207 have |= BEGIN;
220 have |= REPS;
237 if (!(have & STEP))
244 * The loop we run uses begin/step/reps, so if we have been
250 switch (have) {
|
| /src/common/lib/libc/hash/rmd160/ |
| rmd160.c | 138 uint32_t have, off, need; local in function:RMD160Update
140 have = (uint32_t)((ctx->count/8) % 64);
141 need = 64 - have;
146 if (have) {
147 memcpy(ctx->buffer + have, input, (size_t)need);
150 have = 0;
159 memcpy(ctx->buffer + have, input+off, (size_t)len-off);
|
| /src/common/dist/zlib/test/ |
| infcover.c | 264 if (val > 255) { /* have two digits */
288 unsigned have; local in function:inf
311 in = h2b(hex, &have); assert(in != NULL);
312 if (step == 0 || step > have)
313 step = have;
315 have -= step;
338 have += strm.avail_in;
339 strm.avail_in = step > have ? have : step;
340 have -= strm.avail_in
[all...] |
| /src/usr.bin/make/unit-tests/ |
| opt-jobs.mk | 22 . warning ${arg}:${.newline} have: ${OUTPUT:[2..-1]}${.newline} want: ${EXPECT.${arg}} target
49 . warning ${arg}:${.newline} have: ${OUTPUT:[2..-1]}${.newline} want: ${EXPECT.${arg}} target
|
| /src/usr.bin/units/ |
| units.c | 361 * beginning of the string failed further on. I have changed
463 /* have an exponent */
733 showanswer(struct unittype * have, struct unittype * want)
735 if (compareunits(have, want)) {
736 if (compareunitsreciprocal(have, want)) {
738 showunit(have);
743 precision, 1 / (have->factor * want->factor),
744 precision, want->factor * have->factor);
749 precision, have->factor / want->factor,
750 precision, want->factor / have->factor)
863 struct unittype have, want; local in function:main
[all...] |
| /src/usr.sbin/mtrace/ |
| mtrace.c | 592 * Return this packet we have been waiting for.
864 * Checks for count of all ones from mrouted 2.3 that doesn't have counters.
881 int have = NEITHER; local in function:stat_line
890 have |= OUTS;
896 have |= INS;
901 switch (have) {
1335 * mtrace -i [if_addr] will have to be used.
1524 * received, then the route must have changed (and
1532 printf("\nRoute must have changed...\n");
1541 printf("\nRoute must have changed...\n")
[all...] |
| /src/sys/dev/acpi/ |
| thinkpad_acpi.c | 66 } have; member in union:tp_batctl
1054 sc->sc_batctl.have.charge_start = 1;
1056 sc->sc_batctl.have.individual_control = 1;
1065 sc->sc_batctl.have.charge_stop = 1;
1073 sc->sc_batctl.have.force_discharge = 1;
1081 sc->sc_batctl.have.charge_inhibit = 1;
1199 if (sc->sc_batctl.have.charge_start)
1207 if (sc->sc_batctl.have.charge_stop)
1215 if (sc->sc_batctl.have.charge_inhibit)
1223 if (sc->sc_batctl.have.force_discharge
[all...] |
