Searched defs:idx (Results 401 - 425 of 1374) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/third_party/skia/src/gpu/
H A DGrDefaultPathRenderer.cpp239 uint16_t* idx = idxBase; local
272 prevIdx, &idx);
287 firstQPtIdx + i, &idx);
302 firstCPtIdx + i, &idx);
317 SkASSERT((idx - idxBase) <= maxIdxs);
320 *indexCnt = static_cast<int>(idx - idxBase);
/external/chromium_org/third_party/skia/third_party/lua/src/
H A Dlparser.h29 VINDEXED, /* t = table register/upvalue; idx = index R/K */
44 short idx; /* index (R/K) */ member in struct:expdesc::__anon15433::__anon15434
58 short idx; /* variable index in stack */ member in struct:Vardesc
/external/chromium_org/third_party/sqlite/src/src/
H A Ddelete.c629 int idx = pIdx->aiColumn[j]; local
630 if( idx==pTab->iPKey ){
633 sqlite3VdbeAddOp3(v, OP_Column, iCur, idx, regBase+j);
634 sqlite3ColumnDefault(v, pTab, idx, -1);
/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/isac/fix/source/
H A Dencode.c297 int16_t idx; local
339 idx = 4;
340 idx += (bytesLeftQ5 >= WEBRTC_SPL_MUL_16_16(ratioQ5[idx], arithLenDFTByte))? 2:-2;
341 idx += (bytesLeftQ5 >= WEBRTC_SPL_MUL_16_16(ratioQ5[idx], arithLenDFTByte))? 1:-1;
342 idx += (bytesLeftQ5 >= WEBRTC_SPL_MUL_16_16(ratioQ5[idx], arithLenDFTByte))? 0:-1;
349 idx = 0;
354 LP16a[k] = (int16_t)WEBRTC_SPL_MUL_16_16_RSFT(LP16a[k], scaleQ14[idx], 1
[all...]
/external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/
H A Drtp_packet_history.cc263 int32_t idx = (prev_index_ - 1) - (temp_sequence_number - sequence_number); local
264 if (idx >= 0 && idx < static_cast<int>(stored_seq_nums_.size())) {
265 *index = idx;
/external/clang/include/clang/Analysis/Support/
H A DBumpVector.h98 reference operator[](unsigned idx) { argument
99 assert(Begin + idx < End);
100 return Begin[idx];
102 const_reference operator[](unsigned idx) const {
103 assert(Begin + idx < End);
104 return Begin[idx];
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSValBuilder.h226 NonLoc makeArrayIndex(uint64_t idx) { argument
227 return nonloc::ConcreteInt(BasicVals.getValue(idx, ArrayIndexTy));
/external/clang/lib/CodeGen/
H A DCodeGenTBAA.cpp190 unsigned idx = 0; local
192 e = RD->field_end(); i != e; ++i, ++idx) {
194 Layout.getFieldOffset(idx) / Context.getCharWidth();
254 unsigned idx = 0; local
256 e = RD->field_end(); i != e; ++i, ++idx) {
266 FieldNode, Layout.getFieldOffset(idx) / Context.getCharWidth()));
/external/compiler-rt/lib/asan/tests/
H A Dasan_interface_test.cc426 size_t idx = i % kNumMallocs; local
427 EXPECT_TRUE(__sanitizer_get_ownership(pointers[idx]));
428 EXPECT_EQ(sizes[idx], __sanitizer_get_allocated_size(pointers[idx]));
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bitvector.h34 bool setBit(uptr idx) { argument
36 bits_ |= mask(idx);
41 bool clearBit(uptr idx) { argument
43 bits_ &= ~mask(idx);
47 bool getBit(uptr idx) const { return (bits_ & mask(idx)) != 0; }
51 uptr idx = LeastSignificantSetBitIndex(bits_); local
52 clearBit(idx);
53 return idx;
85 // uptr idx
144 setBit(uptr idx) argument
159 clearBit(uptr idx) argument
[all...]
H A Dsanitizer_stackdepot.cc139 for (int idx = 0; idx < StackDepot::kTabSize; idx++) {
140 atomic_uintptr_t *p = &theDepot.tab[idx];
154 uptr idx = InternalBinarySearch(map_, 0, map_.size(), pair, local
156 if (idx > map_.size()) {
160 StackDepotNode *desc = map_[idx].desc;
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_bvgraph_test.cc47 return s_.insert(idx(from, to)).second;
50 return s_.erase(idx(from, to));
62 uptr idx(uptr from, uptr to) { function in class:SimpleGraph
82 uptr idx = (uptr)my_rand() % g.size(); local
83 EXPECT_EQ(target.setBit(idx), s_target.insert(idx).second);
135 uptr idx = my_rand() % g.size(); local
136 s.insert(idx);
137 bv.setBit(idx);
/external/e2fsprogs/misc/
H A De2freefrag.c79 unsigned long idx; local
81 idx = ul_log2(chunk_size) + 1;
82 if (idx >= MAX_HIST)
83 idx = MAX_HIST-1;
84 info->histogram.fc_chunks[idx]++;
85 info->histogram.fc_blocks[idx] += chunk_size;
/external/eigen/bench/spbench/
H A Dspbenchsolver.h545 int idx = 1, found=false; local
546 while (idx<argc && !found){
547 if (option.compare(args[idx]) == 0){
549 if(value) *value = args[idx+1];
551 idx+=2;
/external/eigen/unsupported/Eigen/src/BVH/
H A DKdBVH.h145 int idx = index * 2; local
146 if(children[idx + 1] < numBoxes) { //second index is always bigger
147 outVBegin = &(children[idx]);
151 else if(children[idx] >= numBoxes) { //if both children are objects
153 outOBegin = &(objects[children[idx] - numBoxes]);
156 outVBegin = &(children[idx]);
158 outOBegin = &(objects[children[idx + 1] - numBoxes]);
/external/elfutils/0.153/libdwfl/
H A Dderelocate.c250 dwfl_module_relocation_info (Dwfl_Module *mod, unsigned int idx, argument
262 if (idx != 0)
277 if (idx >= sections->count)
281 *shndxp = elf_ndxscn (sections->refs[idx].scn);
283 return sections->refs[idx].name;
330 size_t idx = (l + u) / 2; local
331 if (*addr < sections->refs[idx].start)
332 u = idx;
333 else if (*addr > sections->refs[idx].end)
334 l = idx
387 int idx = find_section (mod, address); local
[all...]
/external/f2fs-tools/fsck/
H A Ddump.c144 u32 i, idx; local
148 skip = idx = ADDRS_PER_BLOCK;
151 idx = NIDS_PER_BLOCK;
152 skip = idx * ADDRS_PER_BLOCK;
156 idx = NIDS_PER_BLOCK;
170 for (i = 0; i < idx; i++, (*ofs)++) {
/external/fio/crc/
H A Dsha256.c246 unsigned int i, idx, part_len; local
249 idx = (unsigned int)((sctx->count[0] >> 3) & 0x3f);
257 part_len = 64 - idx;
261 memcpy(&sctx->buf[idx], data, part_len);
266 idx = 0;
272 memcpy(&sctx->buf[idx], &data[i], len-i);
H A Dsha512.c165 unsigned int i, idx, part_len; local
168 idx = (unsigned int)((sctx->count[0] >> 3) & 0x7F);
178 part_len = 128 - idx;
182 memcpy(&sctx->buf[idx], data, part_len);
188 idx = 0;
194 memcpy(&sctx->buf[idx], &data[i], len - i);
/external/fio/engines/
H A Dsync.c178 int idx)
180 sd->io_us[idx] = io_u;
181 sd->iovecs[idx].iov_base = io_u->xfer_buf;
182 sd->iovecs[idx].iov_len = io_u->xfer_buflen;
177 fio_vsyncio_set_iov(struct syncio_data *sd, struct io_u *io_u, int idx) argument
/external/freetype/src/autofit/
H A Dafwarp.c125 FT_Int idx; local
129 for ( idx = idx_min; idx <= idx_max; idx++, y++ )
130 scores[idx] += af_warper_weights[y & 63] * len;
135 FT_Int idx; local
138 for ( idx = idx_min; idx <= idx_max; idx++ )
140 AF_WarpScore score = scores[idx];
[all...]
/external/freetype/src/cache/
H A Dftccache.c95 FT_UInt idx; local
98 idx = (FT_UInt)( hash & cache->mask );
99 if ( idx < cache->p )
100 idx = (FT_UInt)( hash & ( 2 * cache->mask + 1 ) );
101 pnode = cache->buckets + idx;
/external/harfbuzz_ng/src/
H A Dhb-buffer-private.hh65 unsigned int idx; /* Cursor into ->info and ->pos arrays */ member in struct:hb_buffer_t
74 inline hb_glyph_info_t &cur (unsigned int i = 0) { return info[idx + i]; }
75 inline hb_glyph_info_t cur (unsigned int i = 0) const { return info[idx + i]; }
77 inline hb_glyph_position_t &cur_pos (unsigned int i = 0) { return pos[idx + i]; }
78 inline hb_glyph_position_t cur_pos (unsigned int i = 0) const { return pos[idx + i]; }
105 { return have_output? out_len : idx; }
107 { return len - idx; }
134 /* Makes a copy of the glyph at idx to output and replace glyph_index */
137 /* Copies glyph at idx to output but doesn't advance idx */
[all...]
/external/harfbuzz_ng/src/hb-ucdn/
H A Ducdn.c88 static int get_comp_index(uint32_t code, const Reindex *idx) argument
92 for (i = 0; idx[i].start; i++) {
93 const Reindex *cur = &idx[i];
/external/icu/icu4c/source/common/
H A Dlocmap.c913 uint32_t idx; local
915 for (idx = 0; idx < this_0->numRegions; idx++ ) {
916 int32_t sameChars = idCmp(posixID, this_0->regionMaps[idx].posixID);
917 if (sameChars > bestIdxDiff && this_0->regionMaps[idx].posixID[sameChars] == 0) {
920 return this_0->regionMaps[idx].hostID;
923 bestIdx = idx;
1085 uint32_t idx; local
1118 for (idx
[all...]

Completed in 573 milliseconds

<<11121314151617181920>>