| /vbox/src/libs/zlib-1.2.6/contrib/infback9/ |
| H A D | inflate9.h | 42 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
| H A D | 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
[all...] |
| /vbox/src/libs/zlib-1.2.6/examples/ |
| H A D | 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)) {
|
| H A D | 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);
|
| H A D | 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...] |
| H A D | 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
199 lunpipe(unsigned have, unsigned char *next, struct ind *indp, int outfile, z_stream *strm) argument
385 unsigned have, flags, len; local
[all...] |
| H A D | 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
[all...] |
| /vbox/src/libs/xpcom18a4/nsprpub/pr/tests/ |
| H A D | concur.c | 70 PRIntn want, have; member in struct:Context
84 context->have += 1;
85 while (context->want >= context->have)
87 context->have -= 1;
169 PR_STDERR, "Waiting for %d thread(s) to exit\n", context.have);
171 while (context.have > 0) PR_Sleep(hundredMills);
175 PR_STDERR, "Finished [want: %d, have: %d]\n",
176 context.want, context.have);
|
| /vbox/src/libs/zlib-1.2.6/ |
| H A D | gzwrite.c | 75 unsigned have; local
100 have = (unsigned)(strm->next_out - state->x.next);
101 if (have && ((got = write(state->fd, state->x.next, have)) < 0 ||
102 (unsigned)got != have)) {
114 have = strm->avail_out;
121 have -= strm->avail_out;
122 } while (have);
320 /* make sure we have some buffer space */
399 /* make sure we have som
[all...] |
| H A D | infback.c | 133 have = strm->avail_in; \
144 strm->avail_in = have; \
160 if (have == 0) { \
161 have = in(in_desc, &next); \
162 if (have == 0) { \
175 have--; \
260 unsigned have, left; /* available input and output */ local
283 have = next != Z_NULL ? strm->avail_in : 0;
345 if (copy > have) copy = have;
[all...] |
| H A D | inflate.c | 100 local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
463 have = strm->avail_in; \
474 strm->avail_in = have; \
490 if (have == 0) goto inf_leave; \
491 have--; \
570 would all have to actually be part of the saved state in case NEEDBITS()
616 unsigned have, left; /* available input and output */ local
639 in = have;
740 if (copy > have) copy = have;
[all...] |
| H A D | inflate.h | 114 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
| H A D | zlib.h | 51 but other algorithms will be added later and will have the same stream
150 returned by zalloc for objects of exactly 65536 bytes *must* have their
456 of the uncompressed data may have been saved by the compressor for this
550 compressed data instead of a zlib wrapper. The gzip header will have no
651 may have been set by deflateInit2.
670 a call of deflate(), since the currently available input may have to be
714 deflatePending() returns the number of bytes and bits of output that have
846 All full flush points have this pattern, but not all occurences of this
878 stream will keep attributes that may have been set by inflateInit2.
1183 uncompressed data. (The size of the uncompressed data must have bee
1649 unsigned have; member in struct:gzFile_s
[all...] |
| /vbox/src/libs/zlib-1.2.6/test/ |
| H A D | infcover.c | 264 if (val > 255) { /* have two digits */
288 unsigned have; local
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
[all...] |
| /vbox/src/libs/libxml2-2.6.31/ |
| H A D | relaxng.c | 363 * Errors accumulated in branches may have to be stacked to be
647 xmlRelaxNGTypeHave have; /* the export function */ member in struct:_xmlRelaxNGTypeLibrary
2739 * @have: the provide function
2749 xmlRelaxNGTypeHave have,
2777 lib->have = have;
3525 if (lib->have == NULL) {
3527 "Internal error with type library '%s': no 'have'\n",
3530 success = lib->have(lib->data, def->name);
3624 if (lib->have
2748 xmlRelaxNGRegisterTypeLibrary(const xmlChar * namespace, void *data, xmlRelaxNGTypeHave have, xmlRelaxNGTypeCheck check, xmlRelaxNGTypeCompare comp, xmlRelaxNGFacetCheck facet, xmlRelaxNGTypeFree freef) argument
[all...] |