/external/elfutils/libdw/ |
dwarf_entry_breakpoints.c | 74 size_t idx = (l + u) / 2; local 75 if (lines->info[idx].addr < low) 76 l = idx + 1; 77 else if (lines->info[idx].addr > low) 78 u = idx; 79 else if (lines->info[idx].end_sequence) 80 l = idx + 1; 83 l = idx;
|
/external/freetype/include/freetype/internal/ |
ftdebug.h | 144 FT_Trace_Get_Name( FT_Int idx ); variable
|
/external/google-breakpad/src/common/ |
string_conversion.cc | 127 int idx = 0; local 131 it != in.end(); ++it, ++idx) 132 source_buffer_ptr[idx] = Swap(*it);
|
/external/guava/guava/src/com/google/thirdparty/publicsuffix/ |
TrieParser.java | 41 int idx = 0; local 42 while (idx < encodedLen) { 43 idx += doParseTrieToBuilder( 45 encoded.subSequence(idx, encodedLen), 66 int idx = 0; local 70 for ( ; idx < encodedLen; idx++) { 71 c = encoded.charAt(idx); 77 stack.add(0, reverse(encoded.subSequence(0, idx))); 89 idx++ [all...] |
/external/icu/icu4c/source/io/ |
ustream.cpp | 83 int32_t idx = 0; local 132 buffer[idx++] = ch; 133 while (idx > 0) { 134 stream.putback(buffer[--idx]); 154 idx = 0; 157 buffer[idx++] = ch;
|
/external/jacoco/org.jacoco.report/src/org/jacoco/report/internal/ |
NormalizedFileNames.java | 81 int idx = 1; local 83 unique = s + '~' + idx++;
|
/external/kmod/tools/ |
insmod.c | 77 int c, idx = 0; local 78 c = getopt_long(argc, argv, cmdopts_s, cmdopts, &idx);
|
remove.c | 93 int c, idx =0; local 94 c = getopt_long(argc, argv, cmdopts_s, cmdopts, &idx);
|
/external/mesa3d/src/compiler/glsl/ |
ast_array_index.cpp | 49 update_max_array_access(ir_rvalue *ir, int idx, YYLTYPE *loc, 54 if (idx > (int)var->data.max_array_access) { 55 var->data.max_array_access = idx; 60 check_builtin_array_max_size(var->name, idx+1, *loc, state); 100 if (idx > max_ifc_array_access[field_index]) { 101 max_ifc_array_access[field_index] = idx; 106 check_builtin_array_max_size(deref_record->field, idx+1, *loc, 145 ir_rvalue *array, ir_rvalue *idx, 157 if (!idx->type->is_error()) { 158 if (!idx->type->is_integer()) 172 const int idx = const_index->value.i[0]; local [all...] |
/external/mesa3d/src/compiler/nir/ |
nir_opt_peephole_select.c | 217 unsigned idx = src->pred == then_block ? 1 : 2; local 218 nir_src_copy(&sel->src[idx].src, &src->src, sel);
|
/external/mesa3d/src/glx/ |
vertarr.c | 162 const int idx = format - GL_V2F; local 165 /* All valid formats are on the range [GL_V2F, GL_V2F+0x0D]. Since idx 166 * is just the format biased by -GL_V2F, all valid idx values are on the 169 if ((idx < 0) || (idx > 0x0D)) { 185 offsets[i] = (modes[idx][i].count != 0) ? size : -1; 186 size += modes[idx][i].size; 195 __indirect_glTexCoordPointer(modes[idx][0].count, GL_FLOAT, 200 __indirect_glColorPointer(modes[idx][1].count, modes[idx][1].type [all...] |
/external/pdfium/xfa/fde/ |
cfde_texteditengine_unittest.cpp | 565 size_t idx = 0; local 567 std::tie(start_idx, count) = engine()->BoundsForWordAt(idx); 571 idx += count;
|
/external/skia/samplecode/ |
SampleComplexClip.cpp | 100 size_t idx = invA * SK_ARRAY_COUNT(gOps) + op; local 101 if (!(idx % 3)) {
|
/external/skia/src/gpu/gl/ |
GrGLExtensions.cpp | 29 int idx = SkTSearch<SkString, extension_compare>(&strings.front(), local 33 return idx; 126 int idx = find_string(*fStrings, ext); local 127 if (idx < 0) { 133 fStrings->removeShuffle(idx); 134 if (idx != fStrings->count()) { 136 SkTInsertionSort(&(fStrings->operator[](idx)), &fStrings->back(), cmp); 142 int idx = find_string(*fStrings, ext); local 143 if (idx < 0) {
|
/external/skia/src/gpu/ops/ |
GrDrawPathOp.cpp | 199 int idx = 0; local 203 memcpy(&indexStorage[idx], instances.indices(), instances.count() * sizeof(uint16_t)); 206 &transformStorage[floatsPerTransform * idx]); 207 idx += instances.count(); 212 SkASSERT(idx == fTotalPathCount);
|
/external/skia/src/gpu/vk/ |
GrVkExtensions.cpp | 26 int idx = SkTSearch<SkString, extension_compare>(&strings.front(), local 30 return idx;
|
/external/skqp/samplecode/ |
SampleComplexClip.cpp | 100 size_t idx = invA * SK_ARRAY_COUNT(gOps) + op; local 101 if (!(idx % 3)) {
|
/external/skqp/src/gpu/gl/ |
GrGLExtensions.cpp | 29 int idx = SkTSearch<SkString, extension_compare>(&strings.front(), local 33 return idx; 126 int idx = find_string(*fStrings, ext); local 127 if (idx < 0) { 133 fStrings->removeShuffle(idx); 134 if (idx != fStrings->count()) { 136 SkTInsertionSort(&(fStrings->operator[](idx)), &fStrings->back(), cmp); 142 int idx = find_string(*fStrings, ext); local 143 if (idx < 0) {
|
/external/skqp/src/gpu/ops/ |
GrDrawPathOp.cpp | 199 int idx = 0; local 203 memcpy(&indexStorage[idx], instances.indices(), instances.count() * sizeof(uint16_t)); 206 &transformStorage[floatsPerTransform * idx]); 207 idx += instances.count(); 212 SkASSERT(idx == fTotalPathCount);
|
/external/skqp/src/gpu/vk/ |
GrVkExtensions.cpp | 26 int idx = SkTSearch<SkString, extension_compare>(&strings.front(), local 30 return idx;
|
/external/tcpdump/ |
checksum.c | 148 int idx; local 153 for (idx = 0; idx < length; idx++) { 157 if (idx == checksum_offset || 158 idx == checksum_offset+1) {
|
/external/tensorflow/tensorflow/compiler/xla/ |
array.h | 114 int64 idx = 0; local 117 values_[idx] = it2; 118 ++idx; 121 CHECK(idx == num_elements()); 131 int64 idx = 0; local 134 values_[idx] = static_cast<T>(it2); 135 ++idx; 138 CHECK(idx == num_elements()); 146 int64 idx = 0; local 150 values_[idx] = it3 167 int64 idx = 0; local 185 int64 idx = 0; local 210 int64 idx = 0; local [all...] |
/external/turbine/java/com/google/turbine/parse/ |
UnicodeEscapePreprocessor.java | 29 private int idx = 0; field in class:UnicodeEscapePreprocessor 40 return idx - 1; 45 return idx >= input.length(); 68 idx--; 130 ch = done() ? ASCII_SUB : input.charAt(idx); 131 idx++;
|
/external/valgrind/callgrind/ |
jumps.c | 189 UInt idx; local 211 idx = jcc_hash_idx(from, jmp, to, current_jccs.size); 212 jcc = current_jccs.table[idx];
|
/frameworks/av/media/libstagefright/codecs/amrwb/src/ |
dec_alg_codebook.cpp | 195 int32 mask, idx; local 204 idx = index & mask; 213 dec_2p_2N1(idx, (int16)(N - 1), j, pos); 216 tmp = N << 1; /* idx = (index >> (2*N)) & mask; */ 217 idx = (index >> tmp) & mask; 219 dec_1p_N1(idx, N, offset, pos + 2); 232 int32 mask, idx; local 239 idx = index & mask; 248 dec_2p_2N1(idx, (int16)(N - 1), j, pos); 253 idx = (index >> (N << 1)) & mask; /* idx = (index >> (2*N)) & mask; * 319 int32 idx; local [all...] |