| /external/regex-re2/re2/testing/ |
| regexp_test.cc | 49 const map<string, int>* have = x->NamedCaptures(); local
50 EXPECT_TRUE(have != NULL);
51 EXPECT_EQ(2, have->size()); // there are only two named groups in
56 EXPECT_EQ(want, *have);
58 delete have;
68 const map<int, string>* have = x->CaptureNames(); local
69 EXPECT_TRUE(have != NULL);
70 EXPECT_EQ(3, have->size());
76 EXPECT_EQ(want, *have);
78 delete have;
[all...] |
| re2_test.cc | 981 CHECK(re.error().empty()); // Must have no error
1356 const map<int, string>& have = re.CapturingGroupNames(); local
[all...] |
| /external/zlib/src/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/src/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...] |
| /external/zlib/src/ |
| 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 some buffer space *
[all...] |
| 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...] |
| 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--; \
565 would all have to actually be part of the saved state in case NEEDBITS()
611 unsigned have, left; /* available input and output */ local
634 in = have;
735 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
|
| /bootable/recovery/applypatch/ |
| imgpatch.c | 105 // deflate chunks have an additional 60 bytes in their chunk header.
163 // We should have filled the output buffer exactly, except
212 ssize_t have = temp_size - strm.avail_out; local
214 if (sink(temp_data, have, token) != have) {
216 (long)have);
219 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
551 size_t have = BUFFER_SIZE - strm.avail_out; local
553 if (memcmp(out, chunk->deflate_data+p, have) != 0) {
558 p += have;
562 // mismatch; ran out of data before we should have.
848 // Verify that the source and target images have the same chunk
859 printf("source and target don't have same number of chunks!\n");
868 printf("source and target don't have same chunk
[all...] |
| /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_8/src/crypto/ |
| md4-internal.c | 110 size_t have, need; local
112 /* Check how many bytes we already have and how many more we need. */
113 have = (size_t)((ctx->count >> 3) & (MD4_BLOCK_LENGTH - 1));
114 need = MD4_BLOCK_LENGTH - have;
120 if (have != 0) {
121 os_memcpy(ctx->buffer + have, input, need);
125 have = 0;
138 os_memcpy(ctx->buffer + have, input, len);
|
| /external/zlib/src/test/ |
| 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 -= strm.avail_in
[all...] |
| /external/elfutils/libdwfl/ |
| dwfl_segment_report_module.c | 14 You should have received a copy of the GNU General Public License along
162 /* We already have this whole note segment from our initial read. */
231 Without them, we don't have a module to report. */
282 /* If we have already seen a build ID, we don't care any more. */
435 /* We must have seen the segment covering offset 0, or else the ELF
541 /* Now that we have chosen the module's name and bounds, report it.
557 They have been copied. */
567 /* We have reported the module. Now let the caller decide whether we
624 const size_t have = MIN (buffer_available, file_trimmed_end); local
625 memcpy (contents, buffer, have);
[all...] |
| /external/libppp/src/ |
| route.c | 217 int mib[6], have, had; local
250 have = 0;
257 if (ifm->ifm_index > have) {
260 had = have;
261 have = ifm->ifm_index + 5;
263 newifs = (char **)realloc(ifs, sizeof(char *) * have);
265 newifs = (char **)malloc(sizeof(char *) * have);
277 memset(ifs + had, '\0', sizeof(char *) * (have - had));
427 * may have gone with route Y).
612 /* Oops, we already have this route - unlink it *
[all...] |
| /external/openssh/ |
| kex.c | 484 u_int have; local
509 for (have = mdsz; need > have; have += mdsz) {
514 EVP_DigestUpdate(&md, digest, have);
515 EVP_DigestFinal(&md, digest + have, NULL);
|
| /external/valgrind/main/helgrind/ |
| hg_wordset.c | 24 You should have received a copy of the GNU General Public License
47 // define to 1 to have (a lot of) debugging of add/re-use/die WSU entries.
314 Bool have; local
321 have = VG_(lookupFM)( wsu->vec2ix,
324 if (have) {
|
