/external/regex-re2/re2/testing/ |
H A D | 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...] |
H A D | re2_test.cc | 981 CHECK(re.error().empty()); // Must have no error 1356 const map<int, string>& have = re.CapturingGroupNames(); local 1361 EXPECT_EQ(want, have);
|
/external/zlib/src/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 264 have = next != Z_NULL ? strm->avail_in : 0; 331 if (copy > have) copy = have; 334 have -= copy; 361 state->have [all...] |
/external/zlib/src/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 | 49 not be constrained to have access points at block boundaries, but requires 76 int have; /* number of list entries filled in */ member in struct:access 107 index->have = 0; 111 else if (index->have == index->size) { 121 /* fill in entry and increment how many we have */ 122 next = index->list + index->have; 130 index->have++; 229 index->list = realloc(index->list, sizeof(struct point) * index->have); 230 index->size = index->have; 264 ret = index->have; [all...] |
H A D | 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 200 lunpipe(unsigned have, z_const unsigned char *next, struct ind *indp, int outfile, z_stream *strm) argument 386 unsigned have, flags, len; local [all...] |
H A D | gzappend.c | 262 unsigned have; local 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 [all...] |
/external/zlib/src/ |
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); 210 unsigned have, copy; local 214 have 249 unsigned have; local [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 | 101 local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf, 464 have = strm->avail_in; \ 475 strm->avail_in = have; \ 491 if (have == 0) goto inf_leave; \ 492 have--; \ 566 would all have to actually be part of the saved state in case NEEDBITS() 612 unsigned have, left; /* available input and output */ local 635 in = have; 736 if (copy > have) copy = have; [all...] |
/external/deqp/modules/glshared/ |
H A D | glsFboCompletenessTests.hpp | 70 void setHaveMulticolorAtts (bool have) { m_haveMultiColorAtts = have; } argument
|
/external/openssh/openbsd-compat/ |
H A D | md5.c | 71 size_t have, need; local 73 /* Check how many bytes we already have and how many more we need. */ 74 have = (size_t)((ctx->count >> 3) & (MD5_BLOCK_LENGTH - 1)); 75 need = MD5_BLOCK_LENGTH - have; 81 if (have != 0) { 82 memcpy(ctx->buffer + have, input, need); 86 have = 0; 99 memcpy(ctx->buffer + have, input, len);
|
H A D | rmd160.c | 110 size_t have, off, need; local 112 have = (ctx->count / 8) % RMD160_BLOCK_LENGTH; 113 need = RMD160_BLOCK_LENGTH - have; 118 if (have) { 119 memcpy(ctx->buffer + have, input, need); 122 have = 0; 131 memcpy(ctx->buffer + have, input+off, len-off);
|
/external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
H A D | gzread.c | 24 unsigned *have) 28 *have = 0; 30 ret = read(state->fd, buf + *have, len - *have); 33 *have += ret; 34 } while (*have < len); 77 /* Look for gzip header, set up for inflate or copy. state->x.have must be 0. 149 state->x.have = 0; 159 state->x.have = strm->avail_in; 168 On return, state->x.have an 20 gz_load( gz_statep state, unsigned char *buf, unsigned len, unsigned *have) argument [all...] |
H A D | fx_zlib_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 | fx_zlib_inflate.c | 101 local unsigned syncsearch OF((unsigned FAR *have, const unsigned char FAR *buf, 464 have = strm->avail_in; \ 475 strm->avail_in = have; \ 491 if (have == 0) goto inf_leave; \ 492 have--; \ 566 would all have to actually be part of the saved state in case NEEDBITS() 612 unsigned have, left; /* available input and output */ local 635 in = have; 736 if (copy > have) copy = have; [all...] |
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); 210 unsigned have, copy; local 214 have 249 unsigned have; local [all...] |
H A D | inflate.h | 114 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
/external/wpa_supplicant_8/hostapd/src/crypto/ |
H A D | 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/wpa_supplicant_8/src/crypto/ |
H A D | 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/wpa_supplicant_8/wpa_supplicant/src/crypto/ |
H A D | 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/ |
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...] |
/external/libxml2/ |
H A D | xzlib.c | 59 unsigned int have; /* amount of output data unused at next */ member in struct:__anon9788 123 state->have = 0; /* no output data available */ 232 unsigned int *have) 236 *have = 0; 238 ret = read(state->fd, buf + *have, len - *have); 241 *have += ret; 242 } while (*have < len); 458 /* we have a gzip header, woo hoo! */ 507 state->have 231 xz_load(xz_statep state, unsigned char *buf, unsigned int len, unsigned int *have) argument [all...] |