Searched defs:lengths (Results 1 - 19 of 19) sorted by relevance

/external/v8/test/mjsunit/
H A Dstring-indexof-1.js116 var lengths = [1, 4, 15]; // Single char, simple and complex. variable
118 for (var lengthIndex = 0; lengthIndex < lengths.length; lengthIndex++) {
119 var length = lengths[lengthIndex];
/external/skia/src/animator/
H A DSkGetCondensedInfo.cpp30 static int _searchByName(const unsigned char* lengths, int count, const char* strings, const char target[]) { argument
35 if (strcmp(&strings[lengths[mid << 2]], target) < 0)
40 if (strcmp(&strings[lengths[hi << 2]], target) != 0)
/external/webkit/Source/WebCore/platform/text/
H A DTextCodecUTF8.cpp67 static const uint8_t lengths[256] = { local
85 return lengths[firstByte];
/external/icu4c/common/
H A Ddictbe.cpp109 // list of word candidate lengths, in increasing length order
110 int32_t lengths[POSSIBLE_WORD_LIST_MAX]; member in class:PossibleWord
153 prefix = dict->matches(text, rangeEnd-start, lengths, count, sizeof(lengths)/sizeof(lengths[0]));
160 utext_setNativeIndex(text, start+lengths[count-1]);
169 utext_setNativeIndex(text, offset + lengths[mark]);
170 return lengths[mark];
176 utext_setNativeIndex(text, offset + lengths[--current]);
H A Dtriedict.cpp112 int32_t *lengths,
145 lengths[mycount++] = i+1;
220 int32_t *lengths,
225 return search(text, maxLength, lengths, count, limit, parent, pMatched);
467 int32_t *lengths,
480 lengths[mycount++] = i;
110 search( UText *text, int32_t maxLength, int32_t *lengths, int &count, int limit, TernaryNode *&parent, UBool &pMatched ) const argument
218 matches( UText *text, int32_t maxLength, int32_t *lengths, int &count, int limit ) const argument
465 matches( UText *text, int32_t maxLength, int32_t *lengths, int &count, int limit ) const argument
H A Dunames.c526 * expandGroupLengths() reads a block of compressed lengths of 32 strings and
527 * expands them into offsets and lengths for each string.
532 * The offsets and lengths arrays must be at least 33 (one more) long because
537 uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) {
538 /* read the lengths of the 32 strings in this group and get each string's offset */
542 /* all 32 lengths must be read to get the offset of the first group string */
561 *lengths++=length;
573 *lengths++=length;
591 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
593 s=expandGroupLengths(s, offsets, lengths);
536 expandGroupLengths(const uint8_t *s, uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) argument
624 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
1352 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
2004 uint16_t offsets[LINES_PER_GROUP+1], lengths[LINES_PER_GROUP+1]; local
[all...]
/external/qemu/block/
H A Ddmg.c33 * lengths[i] is the length of the compressed chunk,
42 uint64_t* lengths; member in struct:BDRVDMGState
85 s->offsets = s->lengths = s->sectors = s->sectorcounts = NULL;
132 s->lengths = qemu_realloc(s->lengths, new_size);
141 last_in_offset = s->offsets[i-1]+s->lengths[i-1];
160 s->lengths[i] = read_off(bs, offset);
163 if(s->lengths[i]>max_compressed_size)
164 max_compressed_size = s->lengths[i];
232 s->compressed_chunk+i, s->lengths[chun
[all...]
/external/tcpdump/
H A Dutil.c213 static const char *lengths[] = {"y", "w", "d", "h", "m", "s"}; local
215 const char **l = lengths;
/external/dbus/dbus/
H A Ddbus-message-factory.c820 int lengths[] = { -42, -17, -16, -15, -9, -8, -7, -6, -5, -4, -3, -2, -1, local
827 if (len_seq == _DBUS_N_ELEMENTS (lengths))
830 _dbus_assert (len_seq < _DBUS_N_ELEMENTS (lengths));
842 adjust = lengths[len_seq];
859 /* Fixup lengths */
1220 { "wrong body lengths", generate_wrong_length },
/external/mtpd/
H A Dpptp.c58 static uint8_t lengths[] = { variable
136 uint16_t length = lengths[message];
272 if (incoming.length < lengths[incoming.message]) {
/external/v8/test/cctest/
H A Dtest-strings.cc325 const int lengths[12] = {0, 0, 2, 3, 3, 3, 6, 7, 7, 7, 10, 11}; local
338 CHECK_EQ(lengths[i], written);
341 for (int j = 0; j < lengths[i]; j++)
344 for (int j = lengths[i]; j < 11; j++)
356 // Make sure we cover all always-flat lengths and at least one above.
/external/zlib/contrib/puff/
H A Dpuff.c52 * 1.3 20 Mar 2002 - Go back to lengths for puff() parameters [Jean-loup]
87 #define MAXCODES (MAXLCODES+MAXDCODES) /* maximum codes lengths to read */
203 * a negative value if there is an error. If all of the lengths are zero, i.e.
210 * a simple integer ordering of codes of the same lengths. Hence below the
296 * Given the list of code lengths length[0..n-1] representing a canonical
307 * codes past the end of the incomplete lengths.
338 (h->count[length[symbol]])++; /* assumes lengths are within bounds */
342 /* check for an over-subscribed or incomplete set of lengths */
379 * - Literals, lengths, and the end-of-block code are combined into a single
383 * - There are 256 possible lengths (
526 short lengths[FIXLCODES]; local
650 short lengths[MAXCODES]; /* descriptor code lengths */ local
[all...]
/external/skia/gpu/src/
H A DGrGLProgram.cpp631 int lengths[MAX_STRINGS]; local
636 lengths[stringCnt] = segments.fHeader.size();
641 lengths[stringCnt] = segments.fVSUnis.size();
646 lengths[stringCnt] = segments.fVSAttrs.size();
651 lengths[stringCnt] = segments.fVaryings.size();
657 lengths[stringCnt] = segments.fVSCode.size();
672 lengths);
682 lengths[stringCnt] = segments.fHeader.size();
687 lengths[stringCnt] = strlen(GrShaderPrecision());
692 lengths[stringCn
[all...]
/external/freetype/include/freetype/internal/
H A Dpsaux.h110 /* lengths :: A table of element sizes within the block. */
127 FT_PtrDist* lengths; /* lengths of table elements */ member in struct:PS_TableRec_
/external/icu4c/tools/gennames/
H A Dgennames.c76 * These lengths are sequentially for each tokenized string, not for the de-tokenized result.
78 * 32 lengths.
322 addLine(uint32_t code, char *names[], int16_t lengths[], int16_t count);
551 int16_t lengths[4]={ 0, 0, 0, 0 }; local
564 lengths[0]=getName(names+0, fields[1][1]);
567 lengths[0]=0;
575 lengths[1]=getName(names+1, fields[10][1]);
578 lengths[1]=0;
585 lengths[2]=getName(names+2, fields[11][1]);
588 if(lengths[
1430 addLine(uint32_t code, char *names[], int16_t lengths[], int16_t count) argument
[all...]
/external/openssl/apps/
H A Dspeed.c234 static int lengths[SIZE_NUM]={16,64,256,1024,8*1024}; variable
1270 c[D_MD2][i]=c[D_MD2][0]*4*lengths[0]/lengths[i];
1271 c[D_MDC2][i]=c[D_MDC2][0]*4*lengths[0]/lengths[i];
1272 c[D_MD4][i]=c[D_MD4][0]*4*lengths[0]/lengths[i];
1273 c[D_MD5][i]=c[D_MD5][0]*4*lengths[0]/lengths[i];
1274 c[D_HMAC][i]=c[D_HMAC][0]*4*lengths[
[all...]
/external/elfutils/src/
H A Dldgeneric.c3295 uint32_t *lengths; local
3318 /* Array for counting the collisions and chain lengths. */
3320 lengths = &counts[maxcnt + 1];
3331 memset (lengths, '\0', size * sizeof (uint32_t));
3336 ++lengths[hashcodes[inner] % size];
3338 /* Determine the lengths. */
3342 ++counts[lengths[inner]];
3344 if (lengths[inner] > maxlength)
3345 maxlength = lengths[inner];
H A Dreadelf.c56 N_("Display histogram of bucket list lengths") },
2402 uint32_t *lengths; local
2439 lengths = (uint32_t *) xcalloc (nbucket, sizeof (uint32_t));
2450 if (maxlength < ++lengths[cnt])
2460 ++counts[lengths[cnt]];
2496 free (lengths);
/external/bluetooth/bluez/lib/
H A Dsdp.c4657 int *lengths; local
4668 lengths = malloc(plen * sizeof(int *));
4669 if (!lengths) {
4683 lengths[j] = data->unitSize - sizeof(uint8_t);
4692 lengths[j] = 0;
4696 lengths[j] = 0;
4700 feat = sdp_seq_alloc_with_length(dtds, vals, lengths, plen);
4703 free(lengths);

Completed in 540 milliseconds