Searched defs:num_pairs (Results 1 - 12 of 12) sorted by relevance

/external/qemu/android/
H A Dsnaphost-android.c39 const int num_pairs = iniFile_getPairCount(current); local
42 if (num_pairs != iniFile_getPairCount(saved)) {
44 num_pairs, iniFile_getPairCount(saved));
50 for (n = 0; n < num_pairs && ret == 0; n++) {
/external/chromium_org/third_party/ots/src/
H A Dkern.cc79 uint16_t num_pairs = 0; local
80 if (!table.ReadU16(&num_pairs) ||
87 if (!num_pairs) {
96 if (num_pairs > (65536 / kFormat0PairSize)) {
103 while (1u << (max_pow2 + 1) <= num_pairs) {
115 = kFormat0PairSize * num_pairs - subtable.search_range;
122 subtable.pairs.reserve(num_pairs);
124 for (unsigned j = 0; j < num_pairs; ++j) {
/external/chromium_org/third_party/freetype/src/sfnt/
H A Dttkern.c88 FT_UInt num_pairs, length, coverage; local
115 num_pairs = FT_NEXT_USHORT( p );
118 if ( ( p_next - p ) < 6 * (int)num_pairs ) /* handle broken count */
119 num_pairs = (FT_UInt)( ( p_next - p ) / 6 );
127 if ( num_pairs > 0 )
136 for ( count = num_pairs - 1; count > 0; count-- )
203 FT_UInt num_pairs; local
220 num_pairs = FT_NEXT_USHORT( p );
223 if ( ( next - p ) < 6 * (int)num_pairs ) /* handle broken count */
224 num_pairs
[all...]
/external/freetype/src/sfnt/
H A Dttkern.c88 FT_UInt num_pairs, length, coverage; local
115 num_pairs = FT_NEXT_USHORT( p );
118 if ( ( p_next - p ) < 6 * (int)num_pairs ) /* handle broken count */
119 num_pairs = (FT_UInt)( ( p_next - p ) / 6 );
127 if ( num_pairs > 0 )
136 for ( count = num_pairs - 1; count > 0; count-- )
203 FT_UInt num_pairs; local
220 num_pairs = FT_NEXT_USHORT( p );
223 if ( ( next - p ) < 6 * (int)num_pairs ) /* handle broken count */
224 num_pairs
[all...]
/external/chromium_org/third_party/sfntly/cpp/src/sfntly/table/bitmap/
H A Dindex_sub_table_format4.cc295 int32_t num_pairs = IndexSubTableFormat4::NumGlyphs(data, 0) + 1; local
297 for (int32_t i = 0; i < num_pairs; ++i) {
/external/sfntly/cpp/src/sfntly/table/bitmap/
H A Dindex_sub_table_format4.cc295 int32_t num_pairs = IndexSubTableFormat4::NumGlyphs(data, 0) + 1; local
297 for (int32_t i = 0; i < num_pairs; ++i) {
/external/srec/srec/EventLog/include/
H A Driff.h188 int num_pairs; member in struct:__anon26783
/external/chromium_org/third_party/libwebp/enc/
H A Dhistogram.c365 int num_pairs, int num_tries_no_success) {
390 const int num_tries = (num_pairs < out_size) ? num_pairs : out_size;
494 const int num_pairs = (quality < 25) ? 10 : (5 * quality) >> 3; local
503 if (!HistogramCombine(image_out, image_in, iter_mult, num_pairs,
363 HistogramCombine(const VP8LHistogramSet* const in, VP8LHistogramSet* const out, int iter_mult, int num_pairs, int num_tries_no_success) argument
/external/srec/srec/EventLog/src/
H A Driff.c309 if (swichunk->kvals.num_pairs)
313 swichunk->kvals.num_pairs = 0;
321 for (i = 0; i < swichunk->kvals.num_pairs; i++)
463 swichunk->kvals.num_pairs = 0;
499 int i, num_pairs; local
501 fread(&num_pairs, 1, sizeof(int), f);
502 if (doSwap) swapInt(&num_pairs);
503 swichunk->kvals.num_pairs = num_pairs;
511 swichunk->kvals.kvpairs = (RiffKVPair *)CALLOC(num_pairs, sizeo
1079 int i, num_pairs; local
[all...]
/external/webp/src/enc/
H A Dhistogram.c365 int num_pairs, int num_tries_no_success) {
390 const int num_tries = (num_pairs < out_size) ? num_pairs : out_size;
494 const int num_pairs = (quality < 25) ? 10 : (5 * quality) >> 3; local
503 if (!HistogramCombine(image_out, image_in, iter_mult, num_pairs,
363 HistogramCombine(const VP8LHistogramSet* const in, VP8LHistogramSet* const out, int iter_mult, int num_pairs, int num_tries_no_success) argument
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/dbgfmts/codeview/
H A Dcv-symline.c127 size_t num_pairs; member in struct:cv8_lineset
491 if (!info->cv8_cur_ls || info->cv8_cur_ls->num_pairs >= 126) {
493 info->cv8_cur_ls->num_pairs = 0;
498 info->cv8_cur_ls->pairs[info->cv8_cur_ls->num_pairs].offset = bc->offset;
499 info->cv8_cur_ls->pairs[info->cv8_cur_ls->num_pairs].line =
501 info->cv8_cur_ls->num_pairs++;
/external/chromium_org/gpu/command_buffer/client/
H A Dgles2_implementation_unittest.cc1975 size_t num_pairs = sizeof(pairs) / sizeof(pairs[0]); local
1976 for (size_t ii = 0; ii < num_pairs; ++ii) {
2015 size_t num_pairs = sizeof(pairs) / sizeof(pairs[0]); local
2016 for (size_t ii = 0; ii < num_pairs; ++ii) {
2432 size_t num_pairs = sizeof(pairs) / sizeof(pairs[0]); local
2433 for (size_t ii = 0; ii < num_pairs; ++ii) {

Completed in 521 milliseconds