| /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/ | 
| gzread.c | 13                   unsigned *have) { 17     *have = 0;
 19         get = len - *have;
 22         ret = read(state->fd, buf + *have, get);
 25         *have += (unsigned)ret;
 26     } while (*have < len);
 67 /* Look for gzip header, set up for inflate or copy.  state->x.have must be 0.
 135         state->x.have = 0;
 144     state->x.have = strm->avail_in;
 152    On return, state->x.have and state->x.next point to the just decompresse
 [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.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...]
 | 
| /src/common/dist/zlib/examples/ | 
| 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);
 
 | 
| 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 
 | 
| 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...]
 | 
| 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/usr.sbin/sysinst/arch/cats/ | 
| msg.md.en | 51 {We now have your NetBSD partitions on %s as follows (Size and Offset in %s): 
 | 
| /src/usr.sbin/sysinst/arch/zaurus/ | 
| msg.md.en | 51 {We now have your NetBSD partitions on %s as follows (Size and Offset in %s): 
 | 
| /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/usr.sbin/sysinst/arch/hp300/ | 
| msg.md.en | 63 {%s does not have enough free partitions for NetBSD. 64 It must have at least 2 free partitions (for root file system and swap).
 
 | 
| /src/usr.bin/make/unit-tests/ | 
| cond-func-commands.mk | 8 # have commands.  Sounds obvious, but good to know that it is really so. 36 # Expressions in the argument of a function call don't have to be defined.
 
 | 
| cond-func-target.mk | 14 # The target exists, even though it does not have any commands. 37 # Expressions in the argument of a function call don't have to be defined.
 
 | 
| use-inference.mk | 3 # Demonstrate that .USE rules do not have an effect on inference rules. 5 # have any associated commands.
 16 # Since this inference rule does not have any associated commands, it
 35 # have any associated commands.
 
 | 
| suff-main-several.mk | 21 # Since the targets '.1.2', '.1.3' and '.1.4' have now been turned into 30 # XXX: This should have no effect, but as of 2020-11-22, it does.
 
 | 
| /src/sys/arch/i386/i386/ | 
| linux_sigcode.S | 81 	leal	LINUX_SIGF_SC(%esp),%ebx # scp (the call may have clobbered the 92 	leal	LINUX_RT_SIGF_UC(%esp),%ebx # scp (the call may have clobbered the
 
 | 
| /src/sys/compat/freebsd/ | 
| freebsd_sigcode.S | 82 	leal	FREEBSD_SIGF_SC(%esp),%eax # scp (the call may have clobbered 
 | 
| /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/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/lib/libc/arch/vax/string/ | 
| bcmp.S | 60 	clrl	%r0		# we have a match! 
 | 
| /src/sys/arch/arm/include/ | 
| netbsd32_machdep.h | 38 #error You have wandered from the path of righteousness. 
 | 
| /src/usr.sbin/sysinst/arch/atari/ | 
| msg.md.en | 50 {You now have to prepare your root disk for the installation of NetBSD. This 56 If you want to use an AHDI compatible partitioning, you have to assign some
 
 |