Searched defs:lengths (Results 26 - 50 of 51) sorted by relevance

123

/external/deqp/framework/opengl/
H A DgluShaderProgram.cpp65 void Shader::setSources (int numSourceStrings, const char* const* sourceStrings, const int* lengths) argument
67 m_gl.shaderSource(m_shader, numSourceStrings, sourceStrings, lengths);
73 const size_t length = lengths && lengths[ndx] >= 0 ? lengths[ndx] : strlen(sourceStrings[ndx]);
/external/libvorbis/vq/
H A Dbookutil.c338 void build_tree_from_lengths(int vals, long *hist, long *lengths){ argument
346 /* find codeword lengths */
377 lengths[j]++;
392 bitsum+=(histsave[i]-1)*lengths[i];
407 void build_tree_from_lengths0(int vals, long *hist, long *lengths){ argument
410 the lengths after the build */
430 lengths[i]=lengthlist[upper++];
432 lengths[i]=0;
/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/tcpdump/
H A Dutil.c232 static const char *lengths[] = {"y", "w", "d", "h", "m", "s"}; local
234 const char **l = lengths;
/external/glide/third_party/disklrucache/src/main/java/com/bumptech/glide/disklrucache/
H A DDiskLruCache.java126 * and may be read. A publish line is followed by the lengths of each of
330 size += entry.lengths[t];
433 return new Value(key, entry.sequenceNumber, entry.cleanFiles, entry.lengths);
527 long oldLength = entry.lengths[i];
529 entry.lengths[i] = newLength;
592 size -= entry.lengths[i];
593 entry.lengths[i] = 0;
669 private final long[] lengths; field in class:DiskLruCache.Value
672 private Value(String key, long sequenceNumber, File[] files, long[] lengths) { argument
676 this.lengths
807 private final long[] lengths; field in class:DiskLruCache.Entry
[all...]
/external/icu/icu4c/source/test/perf/dicttrieperf/
H A Ddicttrieperf.cpp214 // Prime the prefix lengths so that we don't keep prefixLength at 0 until
347 int32_t *lengths, int &count, int limit ) {
363 // lengths[count++]=(int32_t)utext_getNativeIndex(text);
364 lengths[count++]=numChars; // CompactTrieDictionary just counts chars too.
440 int32_t lengths[20]; local
451 lengths, count, UPRV_LENGTHOF(lengths));
452 if(count==0 || lengths[count-1]!=lines[i].len) {
546 int32_t *lengths, int &count, int limit ) {
557 // lengths[coun
345 ucharsTrieMatches(UCharsTrie &trie, UText *text, int32_t textLimit, int32_t *lengths, int &count, int limit ) argument
544 bytesTrieMatches(BytesTrie &trie, UText *text, int32_t textLimit, int32_t *lengths, int &count, int limit ) argument
589 int32_t lengths[20]; local
[all...]
/external/okhttp/okhttp/src/main/java/com/squareup/okhttp/internal/
H A DDiskLruCache.java130 * and may be read. A publish line is followed by the lengths of each of
361 size += entry.lengths[t];
541 long oldLength = entry.lengths[i];
543 entry.lengths[i] = newLength;
609 size -= entry.lengths[i];
610 entry.lengths[i] = 0;
771 private final long[] lengths; field in class:DiskLruCache.Snapshot
773 private Snapshot(String key, long sequenceNumber, Source[] sources, long[] lengths) { argument
777 this.lengths = lengths;
932 private final long[] lengths; field in class:DiskLruCache.Entry
[all...]
/external/android-clat/
H A Dclatd_test.cpp286 void reassemble_packet(const uint8_t **fragments, const size_t lengths[], int numpackets, argument
296 int len = lengths[i];
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DUCharacterName.java159 * Reads a block of compressed lengths of 32 strings and expands them into
160 * offsets and lengths for each string. Lengths are stored with a
165 * The offsets and lengths arrays must be at least 33 (one more) long
170 * @param lengths array to store the value of the string length
171 * @return next index of the data string immediately after the lengths
174 public int getGroupLengths(int index, char offsets[], char lengths[]) argument
187 // all 32 lengths must be read to get the offset of the first group
201 lengths[i] = (char)((length | n) + 12);
204 lengths[i] = (char)n;
208 offsets[i + 1] = (char)(offsets[i] + lengths[
[all...]
/external/mesa3d/src/mesa/main/
H A Derrors.c507 GLsizei* lengths, GLcharARB* messageLog)
531 if (lengths) {
532 *lengths = written;
533 lengths++;
505 _mesa_GetDebugMessageLogARB(GLuint count, GLsizei logSize, GLenum* sources, GLenum* types, GLenum* ids, GLenum* severities, GLsizei* lengths, GLcharARB* messageLog) argument
/external/deqp/modules/gles2/functional/
H A Des2fShaderApiTests.cpp67 std::vector<int> lengths; member in struct:deqp::gles2::Functional::__anon3189::ShaderSources
97 if (sources.lengths.size() > 0)
98 shader.setSources((int)cStrings.size(), &cStrings[0], &sources.lengths[0]);
116 out.lengths.push_back((int)sliceSize);
127 out.lengths.push_back(lastStringLength);
669 DE_ASSERT(sources.lengths.size() > 0);
670 DE_ASSERT(sources.lengths.size() == sources.strings.size());
680 const int unpaddedLength = sources.lengths[ndx];
684 sources.lengths[ndx] = m_rnd.getInt(-10, -1);
1088 + (explicitLengths ? ", using explicitly specified string lengths"
[all...]
/external/deqp/modules/gles3/functional/
H A Des3fShaderApiTests.cpp72 std::vector<int> lengths; member in struct:deqp::gles3::Functional::__anon3343::ShaderSources
114 if (sources.lengths.size() > 0)
115 shader.setSources((int)cStrings.size(), &cStrings[0], &sources.lengths[0]);
133 out.lengths.push_back((int)sliceSize);
144 out.lengths.push_back(lastStringLength);
729 DE_ASSERT(sources.lengths.size() > 0);
730 DE_ASSERT(sources.lengths.size() == sources.strings.size());
740 const int unpaddedLength = sources.lengths[ndx];
744 sources.lengths[ndx] = m_rnd.getInt(-10, -1);
1714 + (explicitLengths ? ", using explicitly specified string lengths"
[all...]
/external/freetype/include/internal/
H A Dpsaux.h104 /* init :: Set to 0xDEADBEEF if `elements' and `lengths' have */
113 /* lengths :: A table of element sizes within the block. */
130 FT_UInt* lengths; /* lengths of table elements */ member in struct:PS_TableRec_
/external/icu/icu4c/source/common/
H A Dunames.cpp503 * expandGroupLengths() reads a block of compressed lengths of 32 strings and
504 * expands them into offsets and lengths for each string.
509 * The offsets and lengths arrays must be at least 33 (one more) long because
514 uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) {
515 /* read the lengths of the 32 strings in this group and get each string's offset */
519 /* all 32 lengths must be read to get the offset of the first group string */
538 *lengths++=length;
550 *lengths++=length;
568 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
570 s=expandGroupLengths(s, offsets, lengths);
513 expandGroupLengths(const uint8_t *s, uint16_t offsets[LINES_PER_GROUP+1], uint16_t lengths[LINES_PER_GROUP+1]) argument
601 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
1341 uint16_t offsets[LINES_PER_GROUP+2], lengths[LINES_PER_GROUP+2]; local
1990 uint16_t offsets[LINES_PER_GROUP+1], lengths[LINES_PER_GROUP+1]; local
[all...]
/external/pdfium/third_party/freetype/include/internal/
H A Dpsaux.h104 /* init :: Set to 0xDEADBEEF if `elements' and `lengths' have */
113 /* lengths :: A table of element sizes within the block. */
130 FT_PtrDist* lengths; /* lengths of table elements */ member in struct:PS_TableRec_
/external/v8/test/cctest/
H A Dtest-strings.cc902 const int lengths[12] = {0, 0, 2, 3, 3, 3, 6, 7, 7, 7, 10, 11}; local
916 CHECK_EQ(lengths[i], written);
919 for (int j = 0; j < lengths[i]; j++)
922 for (int j = lengths[i]; j < 11; j++)
932 // Make sure we cover all always-flat lengths and at least one above.
1224 // summing the lengths of the strings (as Smis) overflows and wraps.
/external/webp/src/enc/
H A Dvp8l.c213 uint8_t* lengths; local
215 sizeof(*lengths) + sizeof(*codes));
219 lengths = (uint8_t*)&codes[total_length_size];
223 huffman_codes[i].code_lengths = lengths;
225 lengths += bit_length;
512 // Create Huffman bit lengths and codes for each histogram image.
606 // Create Huffman bit lengths and codes for each histogram image.
/external/elfutils/src/src/
H A Dldgeneric.c3503 uint32_t *lengths; local
3526 /* Array for counting the collisions and chain lengths. */
3528 lengths = &counts[maxcnt + 1];
3539 memset (lengths, '\0', size * sizeof (uint32_t));
3545 ++lengths[hashcodes[inner] % size];
3547 /* Determine the lengths. */
3551 ++counts[lengths[inner]];
3553 if (lengths[inner] > maxlength)
3554 maxlength = lengths[inner];
H A Dreadelf.c81 N_("Display histogram of bucket list lengths"), 0 },
2907 uint_fast32_t nsyms, uint32_t *lengths, const char *extrastr)
2912 ++counts[lengths[cnt]];
3010 uint32_t *lengths = (uint32_t *) xcalloc (nbucket, sizeof (uint32_t)); local
3020 if (maxlength < ++lengths[cnt])
3028 lengths, NULL);
3030 free (lengths);
3067 uint32_t *lengths = (uint32_t *) xcalloc (nbucket, sizeof (uint32_t)); local
3077 if (maxlength < ++lengths[cnt])
3085 lengths, NUL
2905 print_hash_info(Ebl *ebl, Elf_Scn *scn, GElf_Shdr *shdr, size_t shstrndx, uint_fast32_t maxlength, Elf32_Word nbucket, uint_fast32_t nsyms, uint32_t *lengths, const char *extrastr) argument
[all...]
/external/libpng/contrib/tools/
H A Dpngfix.c602 * using sync_stream below and the new lengths are recorded here. Because the
612 png_uint_32 lengths[IDAT_INIT_LENGTH]; member in struct:IDAT_list
631 return sizeof *list - sizeof list->lengths +
632 length * sizeof list->lengths[0];
1828 if (len == 0) /* use original chunk lengths */
1843 idat->idat_length == cur->lengths[count]);
1847 return cur->lengths[count];
1853 return cur->lengths[0];
1871 * individual lengths are always <= 0x7fffffff, so when we add two
1881 have += cur->lengths[
[all...]
/external/mesa3d/include/CL/
H A Dcl.hpp2400 ::size_t* lengths = (::size_t*) alloca(n * sizeof(::size_t)); local
2405 lengths[i] = sources[(int)i].second;
2409 context(), (cl_uint)n, strings, lengths, &error);
2426 ::size_t* lengths = (::size_t*) alloca(n * sizeof(::size_t)); local
2431 lengths[i] = binaries[(int)i].second;
2437 lengths, images, binaryStatus != NULL
/external/zopfli/src/zopflipng/lodepng/
H A Dlodepng.cpp453 /*the code length codes. 0-15: code lengths, 16: copy previous 3-6 times, 17: 3-10 zeros, 18: 11-138 zeros*/
456 /*the base lengths represented by codes 257-285*/
476 /*the order in which "code length alphabet code lengths" are stored, out of this
477 the huffman tree of the dynamic huffman tree lengths is generated*/
490 unsigned* lengths; /*the lengths of the codes of the 1d-tree*/ member in struct:HuffmanTree
502 if(tree->lengths.data[i])
503 std::cout << i << " " << tree->tree1d.data[i] << " " << tree->lengths.data[i] << std::endl;
512 tree->lengths = 0;
519 lodepng_free(tree->lengths);
714 lodepng_huffman_code_lengths(unsigned* lengths, const unsigned* frequencies, size_t numcodes, unsigned maxbitlen) argument
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...
H A Dorg.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 4621 milliseconds

123