HomeSort by relevance Sort by last modified time
    Searched defs:have (Results 1 - 25 of 26) sorted by null

1 2

  /external/bison/
GNUmakefile 19 # You should have received a copy of the GNU General Public License along
33 have-Makefile := $(shell test -f Makefile && echo yes)
37 ifeq ($(have-Makefile),yes)
  /external/zlib/examples/
zpipe.c 39 unsigned have; local
69 have = CHUNK - strm.avail_out;
70 if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
95 unsigned have; local
135 have = CHUNK - strm.avail_out;
136 if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
fitblk.c 131 unsigned have; /* bytes written by deflate() call */ local
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);
zran.c 44 not be constrained to have access points at block boundaries, but requires
71 int have; /* number of list entries filled in */ member in struct:access
102 index->have = 0;
106 else if (index->have == index->size) {
116 /* fill in entry and increment how many we have */
117 next = index->list + index->have;
125 index->have++;
224 index = realloc(index, sizeof(struct point) * index->have);
225 index->size = index->have;
259 ret = index->have;
    [all...]
gun.c 154 #define NEXT() (have ? 0 : (have = in(indp, &next)), \
155 last = have ? (have--, (int)(*next++)) : -1)
159 have offset the index, but it's faster to waste the memory */
174 if (chunk > have) { \
175 chunk -= have; \
176 have = 0; \
180 if (chunk > have) { \
181 chunk = have = 0;
385 unsigned have, flags, len; local
    [all...]
gzappend.c 260 unsigned have; local
294 have = full = 0;
304 strm->avail_out = DSIZE - have;
305 strm->next_out = window + have;
315 crc = crc32(crc, window + have, DSIZE - have - strm->avail_out);
317 have = DSIZE - strm->avail_out;
319 have = 0;
361 rotate(window, DSIZE, have);
362 have = DSIZE
    [all...]
  /external/zlib/contrib/infback9/
inflate9.h 42 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
infback9.c 127 if (have == 0) { \
128 have = in(in_desc, &next); \
129 if (have == 0) { \
142 have--; \
227 unsigned have; /* available input */ local
266 have = next != Z_NULL ? strm->avail_in : 0;
333 if (copy > have) copy = have;
336 have -= copy;
363 state->have = 0
    [all...]
  /bootable/recovery/applypatch/
imgpatch.c 104 // deflate chunks have an additional 60 bytes in their chunk header.
156 // We should have filled the output buffer exactly.
199 ssize_t have = temp_size - strm.avail_out; local
201 if (sink(temp_data, have, token) != have) {
203 (long)have);
206 SHA_update(ctx, temp_data, have);
imgdiff.c 35 * image must have been generated using the same deflate encoder that
45 * For a diff to be generated, the source and target images must have the
58 * sequence appears spuriously in the file. (Note that it would have to
543 size_t have = BUFFER_SIZE - strm.avail_out; local
545 if (memcmp(out, chunk->deflate_data+p, have) != 0) {
550 p += have;
554 // mismatch; ran out of data before we should have.
816 // Verify that the source and target images have the same chunk
827 printf("source and target don't have same number of chunks!\n");
836 printf("source and target don't have same chunk
    [all...]
  /external/zlib/
gzwrite.c 64 unsigned have; local
78 have = (unsigned)(strm->next_out - state->next);
79 if (have && ((got = write(state->fd, state->next, have)) < 0 ||
80 (unsigned)got != have)) {
92 have = strm->avail_out;
99 have -= strm->avail_out;
100 } while (have);
298 /* make sure we have some buffer space */
373 /* make sure we have some buffer space *
    [all...]
gzguts.h 98 unsigned have; /* amount of output data unused at next */ member in struct:__anon8785
infback.c 124 have = strm->avail_in; \
135 strm->avail_in = have; \
151 if (have == 0) { \
152 have = in(in_desc, &next); \
153 if (have == 0) { \
166 have--; \
251 unsigned have, left; /* available input and output */ local
274 have = next != Z_NULL ? strm->avail_in : 0;
336 if (copy > have) copy = have;
    [all...]
inflate.c 100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
443 have = strm->avail_in; \
454 strm->avail_in = have; \
470 if (have == 0) goto inf_leave; \
471 have--; \
550 would all have to actually be part of the saved state in case NEEDBITS()
596 unsigned have, left; /* available input and output */ local
619 in = have;
720 if (copy > have) copy = have;
    [all...]
inflate.h 114 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
  /system/extras/tests/bionic/libc/other/
test_zlib.c 48 unsigned have; local
77 have = CHUNK - strm.avail_out;
78 if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
96 unsigned have; local
  /external/chromium/third_party/zlib/
infback.c 124 have = strm->avail_in; \
135 strm->avail_in = have; \
151 if (have == 0) { \
152 have = in(in_desc, &next); \
153 if (have == 0) { \
166 have--; \
251 unsigned have, left; /* available input and output */ local
274 have = next != Z_NULL ? strm->avail_in : 0;
336 if (copy > have) copy = have;
    [all...]
inflate.c 100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
408 have = strm->avail_in; \
419 strm->avail_in = have; \
435 if (have == 0) goto inf_leave; \
436 have--; \
515 would all have to actually be part of the saved state in case NEEDBITS()
561 unsigned have, left; /* available input and output */ local
584 in = have;
683 if (copy > have) copy = have;
    [all...]
inflate.h 110 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
  /external/qemu/distrib/zlib-1.2.3/
infback.c 124 have = strm->avail_in; \
135 strm->avail_in = have; \
151 if (have == 0) { \
152 have = in(in_desc, &next); \
153 if (have == 0) { \
166 have--; \
251 unsigned have, left; /* available input and output */ local
274 have = next != Z_NULL ? strm->avail_in : 0;
336 if (copy > have) copy = have;
    [all...]
inflate.c 100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
408 have = strm->avail_in; \
419 strm->avail_in = have; \
435 if (have == 0) goto inf_leave; \
436 have--; \
515 would all have to actually be part of the saved state in case NEEDBITS()
561 unsigned have, left; /* available input and output */ local
584 in = have;
683 if (copy > have) copy = have;
    [all...]
inflate.h 110 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
  /external/wpa_supplicant/
md4.c 118 size_t have, need; local
120 /* Check how many bytes we already have and how many more we need. */
121 have = (size_t)((ctx->count >> 3) & (MD4_BLOCK_LENGTH - 1));
122 need = MD4_BLOCK_LENGTH - have;
128 if (have != 0) {
129 os_memcpy(ctx->buffer + have, input, need);
133 have = 0;
146 os_memcpy(ctx->buffer + have, input, len);
  /external/wpa_supplicant_6/wpa_supplicant/src/crypto/
md4.c 118 size_t have, need; local
120 /* Check how many bytes we already have and how many more we need. */
121 have = (size_t)((ctx->count >> 3) & (MD4_BLOCK_LENGTH - 1));
122 need = MD4_BLOCK_LENGTH - have;
128 if (have != 0) {
129 os_memcpy(ctx->buffer + have, input, need);
133 have = 0;
146 os_memcpy(ctx->buffer + have, input, len);
  /development/simulator/wrapsim/
SimMgr.c 57 * Once we have established a connection to the simulator and are ready
66 * that, we have no access to input or output devices, and we might
199 ssize_t have; local
201 have = 0;
202 while (have != (ssize_t) count) {
203 actual = _ws_read(fd, ((char*) buf) + have, count - have);
212 have += actual;
215 assert(have <= (ssize_t)count);
231 ssize_t have;
    [all...]

Completed in 1089 milliseconds

1 2