HomeSort by relevance Sort by last modified time
    Searched refs:idx (Results 376 - 400 of 1388) sorted by null

<<11121314151617181920>>

  /ndk/sources/host-tools/sed-4.2.1/lib/
regex_internal.c 23 static void re_string_construct_common (const char *str, Idx len,
43 re_string_allocate (re_string_t *pstr, const char *str, Idx len, Idx init_len,
47 Idx init_buf_len;
71 re_string_construct (re_string_t *pstr, const char *str, Idx len,
134 re_string_realloc_buffers (re_string_t *pstr, Idx new_buf_len)
142 size_t max_object_size = MAX (sizeof (wint_t), sizeof (Idx));
152 Idx *new_offsets = re_realloc (pstr->offsets, Idx, new_buf_len);
174 re_string_construct_common (const char *str, Idx len, re_string_t *pstr
1283 Idx idx; local
1373 __re_size_t idx, right, mid; local
    [all...]
  /dalvik/libdex/
DexProto.cpp 143 u4 idx = dexTypeListGetIdx(typeList, i); local
144 length += strlen(dexStringByTypeIdx(dexFile, idx));
155 u4 idx = dexTypeListGetIdx(typeList, i); local
156 const char* desc = dexStringByTypeIdx(dexFile, idx);
504 u4 idx = dexTypeListGetIdx(pIterator->parameters, cursor); local
506 return idx;
516 u4 idx = dexParameterIteratorNextIndex(pIterator); local
518 if (idx == kDexNoIndex) {
522 return dexStringByTypeIdx(pIterator->proto->dexFile, idx);
  /external/opencv/ml/src/
mltree.cpp 630 int j = 0, idx, count_i; local
635 idx = src[i].i;
636 count_i = co[idx*2];
640 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
652 idx = src[i].i;
653 count_i = co[idx*2];
657 for( cur_ofs = co[idx*2+1]; count_i > 0; count_i--, j++, cur_ofs++ )
727 int idx = sidx ? sidx[i] : i; local
728 int val = src[idx];
746 int idx = src[i].i local
777 int idx = sidx ? sidx[i] : i; local
788 int idx = sidx ? sidx[i] : i; local
995 int idx = n->buf_idx + 1; local
1447 int idx = labels[i]; local
1464 int idx = labels[i]; local
1503 int idx = sorted[i].i; local
1511 int idx = sorted[i].i; local
1601 int idx = responses[sorted[i].i]; local
1632 int idx = responses[sorted[i].i]; local
1664 int i, j, idx; local
1988 int idx = labels[i]; local
2013 int idx = (int)(sum_ptr[subset_i] - sum); local
2040 int idx = (int)(sum_ptr[i] - sum); local
2116 int idx = sorted[i].i; local
2131 int idx = sorted[i].i; local
2192 int idx = labels[i]; local
2214 int idx = labels[i]; local
2458 int idx; local
2478 int idx = sorted[i].i; local
2569 int idx = src[i].i; local
2585 int idx = src[i].i; local
    [all...]
  /dalvik/dexgen/src/com/android/dexgen/dex/file/
StringIdsSection.java 203 int idx = 0; local
206 s.setIndex(idx);
207 idx++;
TypeIdsSection.java 185 int idx = 0; local
188 ((TypeIdItem) i).setIndex(idx);
189 idx++;
  /dalvik/dx/src/com/android/dx/dex/file/
StringIdsSection.java 175 int idx = 0; local
178 s.setIndex(idx);
179 idx++;
TypeIdsSection.java 185 int idx = 0; local
188 ((TypeIdItem) i).setIndex(idx);
189 idx++;
  /dalvik/vm/
AllocTracker.cpp 326 int idx = headIndex(); local
332 AllocRecord* pRec = &gDvm.allocRecords[idx];
351 idx = (idx + 1) & (kNumAllocRecords-1);
378 int idx = headIndex(); local
393 AllocRecord* pRec = &gDvm.allocRecords[idx];
434 idx = (idx + 1) & (kNumAllocRecords-1);
610 * "idx" is the head of the list. We want to start at the end of the
613 int idx = headIndex() local
    [all...]
  /external/bluetooth/bluez/src/
rfkill.c 60 uint32_t idx; member in struct:rfkill_event
94 DBG("RFKILL event idx %u type %u op %u soft %u hard %u",
95 event->idx, event->type, event->op,
109 "/sys/class/rfkill/rfkill%u/name", event->idx);
  /external/clang/lib/StaticAnalyzer/Checkers/
AttrNonNullChecker.cpp 51 unsigned idx = 0; local
54 ++I, ++idx) {
56 if (!Att->isNonNull(idx))
  /external/dexmaker/src/dx/java/com/android/dx/dex/file/
StringIdsSection.java 175 int idx = 0; local
178 s.setIndex(idx);
179 idx++;
TypeIdsSection.java 185 int idx = 0; local
188 ((TypeIdItem) i).setIndex(idx);
189 idx++;
  /external/dropbear/libtomcrypt/src/mac/f9/
f9_test.c 52 int err, x, idx;
55 if ((idx = find_cipher("kasumi")) == -1) {
61 if ((err = f9_memory(idx, tests[x].K, 16, tests[x].M, tests[x].msglen, T, &taglen)) != CRYPT_OK) {
  /external/kernel-headers/original/linux/
highmem.h 40 #define kmap_atomic(page, idx) page_address(page)
41 #define kunmap_atomic(addr, idx) do { } while (0)
42 #define kmap_atomic_pfn(pfn, idx) page_address(pfn_to_page(pfn))
  /external/linux-tools-perf/util/
evsel.h 63 int idx; member in struct:perf_evsel
78 struct perf_evsel *perf_evsel__new(struct perf_event_attr *attr, int idx);
80 struct perf_event_attr *attr, int idx);
  /external/llvm/lib/DebugInfo/
DWARFDebugAbbrev.cpp 51 uint32_t idx = abbrCode - IdxOffset; local
52 if (idx < Decls.size())
53 return &Decls[idx];
  /external/llvm/lib/Support/
DeltaAlgorithm.cpp 33 unsigned idx = 0, N = S.size() / 2; local
35 ie = S.end(); it != ie; ++it, ++idx)
36 ((idx < N) ? LHS : RHS).insert(*it);
  /frameworks/compile/libbcc/lib/ExecutionEngine/
Script.h 114 int addSourceBC(size_t idx,
120 int addSourceModule(size_t idx,
124 int addSourceFile(size_t idx,
  /external/icu4c/i18n/
rbtz.cpp 425 int32_t idx = fHistoricTransitions->size() - 1; local
426 UDate tend = getTransitionTime((Transition*)fHistoricTransitions->elementAt(idx),
433 rule = ((Transition*)fHistoricTransitions->elementAt(idx))->to;
437 while (idx >= 0) {
438 if (date >= getTransitionTime((Transition*)fHistoricTransitions->elementAt(idx),
442 idx--;
444 rule = ((Transition*)fHistoricTransitions->elementAt(idx))->to;
588 int32_t idx; local
591 idx = 0;
592 while (cnt < trscount && idx < historicCount)
727 int32_t idx = fHistoricTransitions->size() - 1; local
810 int32_t idx = fHistoricTransitions->size() - 1; local
    [all...]
  /external/srec/portable/src/
pmemory.c 179 int idx = initialIdx; local
183 if (gMemoryMap[idx].tag == NULL)
186 gMemoryMap[idx].tag = key;
187 gMemoryMap[idx].curAlloc = 0;
188 gMemoryMap[idx].maxAlloc = 0;
189 gMemoryMap[idx].crc = crc;
190 gMemoryMap[idx].first = NULL;
191 gMemoryMap[idx].last = NULL;
194 pfprintf(gFile, L("pmem|newtag|%s|%d|\n"), key, idx);
196 return idx;
577 int idx; local
    [all...]
  /dalvik/vm/compiler/
SSATransformation.cpp 70 * register idx is defined in BasicBlock bb.
80 int idx = dvmBitVectorIteratorNext(&iterator); local
81 if (idx == -1) break;
82 /* Block bb defines register idx */
83 dvmCompilerSetBit(cUnit->defBlockMatrix[idx], bb->id);
373 unsigned int idx; local
374 for (idx = 0; idx < dest->storageSize; idx++) {
375 dest->storage[idx] |= src1->storage[idx] & ~src2->storage[idx]
454 int idx = dvmBitVectorIteratorNext(&iterator); local
482 int idx = dvmBitVectorIteratorNext(&iterator); local
    [all...]
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/
ArrayIterator.h 69 - (void) removeObjectAtIndex:(NSInteger)idx;
  /external/dropbear/libtomcrypt/src/mac/omac/
omac_test.c 76 int x, err, idx;
81 if ((idx = find_cipher("aes")) == -1) {
82 if ((idx = find_cipher("rijndael")) == -1) {
89 if ((err = omac_memory(idx, tests[x].key, tests[x].keylen, tests[x].msg, tests[x].msglen, out, &len)) != CRYPT_OK) {
  /external/dropbear/libtomcrypt/src/mac/xcbc/
xcbc_test.c 100 int err, x, idx;
103 if ((idx = find_cipher("aes")) == -1) {
104 if ((idx = find_cipher("rijndael")) == -1) {
111 if ((err = xcbc_memory(idx, tests[x].K, 16, tests[x].M, tests[x].msglen, T, &taglen)) != CRYPT_OK) {
  /external/dropbear/libtomcrypt/src/modes/ctr/
ctr_test.c 51 int idx, err, x;
56 if ((idx = find_cipher("aes")) == -1) {
57 if ((idx = find_cipher("rijndael")) == -1) {
63 if ((err = ctr_start(idx, tests[x].IV, tests[x].key, tests[x].keylen, 0, CTR_COUNTER_BIG_ENDIAN|LTC_CTR_RFC3686, &ctr)) != CRYPT_OK) {

Completed in 1315 milliseconds

<<11121314151617181920>>