| /external/chromium-trace/catapult/telemetry/telemetry/testing/ |
| story_set_smoke_test.py | 31 """Verify that all URLs of pages in story_set have an associated archive."""
71 """Verify that story_set and its stories base attributes have the right
82 msg='story_set %\'s base_dir must have type string')
86 msg='story_set\'s archive_data_file path must have type string')
92 msg='story %s \'s name field must have type string' % story.display_name)
95 msg='story %s \'s labels field must have type set' % story.display_name)
99 msg='label %s in story %s \'s labels must have type string'
107 msg='page %s \'s url must have type string' % story.display_name)
110 msg=('page %s \'s startup_url field must have type string'
114 msg='page %s \'s make_javascript_deterministic must have type bool
[all...] |
| /external/opencv3/3rdparty/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...] |
| 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 = (unsigned)((strm->next_in + strm->avail_in) - state->in)
249 unsigned have; local
[all...] |
| inflate.h | 114 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
| /external/zlib/src/ |
| 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...] |
| 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 = (unsigned)((strm->next_in + strm->avail_in) - state->in)
249 unsigned have; local
[all...] |
| inflate.h | 114 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
| /external/pdfium/third_party/zlib_v128/ |
| 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...] |
| 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 = (unsigned)((strm->next_in + strm->avail_in) - state->in)
249 unsigned have; local
[all...] |
| inflate.h | 114 unsigned have; /* number of code lengths in lens[] */ member in struct:inflate_state
|
| /toolchain/binutils/binutils-2.25/gas/ |
| configure.com | 4 $! do not have /bin/sh to execute it.
18 $! You should have received a copy of the GNU General Public License
96 /* Define to 1 if you have `alloca', as a function or macro. */
101 /* Define to 1 if you have the `basename' function. */
107 /* Define to 1 if you have the declaration of `vsnprintf', and to 0 if you
111 /* Define to 1 if you have the declaration of `snprintf', and to 0 if you
115 /* Define to 1 if you have the <errno.h> header file. */
118 /* Define to 1 if you have the <limits.h> header file. */
121 /* Define to 1 if you have the `remove' function. */
124 /* Define to 1 if you have the <stdarg.h> header file. *
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/go/ |
| vendor_test.go | 41 have := tg.stdout.String()
43 if have != want {
44 t.Errorf("incorrect go list output:\n%s", diffSortedOutputs(have, want))
119 have := splitLines(haveText)
121 for len(have) > 0 || len(want) > 0 {
122 if len(want) == 0 || len(have) > 0 && have[0] < want[0] {
123 fmt.Fprintf(&diff, "unexpected: %s\n", have[0])
124 have = have[1:
[all...] |
| /prebuilts/go/linux-x86/src/cmd/go/ |
| vendor_test.go | 41 have := tg.stdout.String()
43 if have != want {
44 t.Errorf("incorrect go list output:\n%s", diffSortedOutputs(have, want))
119 have := splitLines(haveText)
121 for len(have) > 0 || len(want) > 0 {
122 if len(want) == 0 || len(have) > 0 && have[0] < want[0] {
123 fmt.Fprintf(&diff, "unexpected: %s\n", have[0])
124 have = have[1:
[all...] |
| /external/zlib/src/examples/ |
| 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...] |
| /hardware/akm/AK8975_FS/akmdfs/AKFS_APIs_8975/ |
| AKFS_Direction.c | 95 AKFVEC have, aave; local
109 if (AKFS_VbAve(nhvec, hvec, hnave, &have) != AKFS_SUCCESS) {
120 AKFS_Azimuth(&have, pitchRad, rollRad, &azimuthRad);
|
| /prebuilts/go/darwin-x86/src/go/types/ |
| predicates.go | 143 // Two array types are identical if they have identical element types
150 // Two slice types are identical if they have identical element types.
156 // Two struct types are identical if they have the same sequence of fields,
157 // and if corresponding fields have the same names, and identical types,
158 // and identical tags. Two anonymous fields are considered to have the same
176 // Two pointer types are identical if they have identical base types.
182 // Two tuples types are identical if they have the same number of elements
183 // and corresponding elements have identical types.
199 // Two function types are identical if they have the same number of parameters
210 // Two interface types are identical if they have the same set of methods wit
[all...] |
| /prebuilts/go/linux-x86/src/go/types/ |
| predicates.go | 143 // Two array types are identical if they have identical element types
150 // Two slice types are identical if they have identical element types.
156 // Two struct types are identical if they have the same sequence of fields,
157 // and if corresponding fields have the same names, and identical types,
158 // and identical tags. Two anonymous fields are considered to have the same
176 // Two pointer types are identical if they have identical base types.
182 // Two tuples types are identical if they have the same number of elements
183 // and corresponding elements have identical types.
199 // Two function types are identical if they have the same number of parameters
210 // Two interface types are identical if they have the same set of methods wit
[all...] |
| /external/llvm/test/MC/Mips/mips32r6/ |
| valid.s | 3 # Branches have some unusual encoding rules in MIPS32r6 so we need to test:
|
| /external/llvm/test/MC/Mips/mips64r6/ |
| valid.s | 3 # Branches have some unusual encoding rules in MIPS32r6 so we need to test:
|
| /external/skia/tools/copyright/ |
| main.py | 10 - For files that already have a copyright header, the header is modified
12 - For files that don't have a copyright header, we add one with the current
|
| /external/v8/test/mjsunit/es6/ |
| no-unicode-regexp-flag.js | 5 // Before Unicode RegExps are shipped, we shouldn't have the 'unicode'
16 // If we were going to be really strict, we could have a test like this,
|
| /prebuilts/go/darwin-x86/test/ |
| gc2.go | 9 // An interesting case because they have finalizers and used to
10 // have self loops that kept them from being collected.
|
| /prebuilts/go/linux-x86/test/ |
| gc2.go | 9 // An interesting case because they have finalizers and used to
10 // have self loops that kept them from being collected.
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| regreg.s | 4 ; Note that sizes have to be tested by iterating over them; they
|
| separator.s | 1 ; Testing separators. This file should only have nops. See
|
