HomeSort by relevance Sort by last modified time
    Searched defs:new_idx (Results 1 - 14 of 14) sorted by null

  /art/runtime/mirror/
art_field.h 81 void SetDexFieldIndex(uint32_t new_idx) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
83 SetField32<false>(OFFSET_OF_OBJECT_MEMBER(ArtField, field_dex_idx_), new_idx); local
art_method.h 198 void SetDexMethodIndex(uint32_t new_idx) SHARED_LOCKS_REQUIRED(Locks::mutator_lock_) {
200 SetField32<false>(OFFSET_OF_OBJECT_MEMBER(ArtMethod, dex_method_index_), new_idx); local
  /external/valgrind/main/callgrind/
jumps.c 89 UInt new_idx; local
108 new_idx = jcc_hash_idx(curr_jcc->from, curr_jcc->jmp,
111 curr_jcc->next_hash = new_table[new_idx];
112 new_table[new_idx] = curr_jcc;
143 UInt new_idx; local
174 new_idx = jcc_hash_idx(from, jmp, to, current_jccs.size);
175 jcc->next_hash = current_jccs.table[new_idx];
176 current_jccs.table[new_idx] = jcc;
bb.c 71 UInt new_idx; local
89 new_idx = bb_hash_idx(curr->obj, curr->offset, new_size);
91 curr->next = new_table[new_idx];
92 new_table[new_idx] = curr;
context.c 95 UInt new_idx; local
113 new_idx = (UInt) (curr->hash % new_size);
115 curr->next = new_table[new_idx];
116 new_table[new_idx] = curr;
bbcc.c 197 UInt new_idx; local
216 new_idx = bbcc_hash_idx(curr_BBCC->bb,
220 curr_BBCC->next = new_table[new_idx];
221 new_table[new_idx] = curr_BBCC;
  /external/lldb/include/lldb/Core/
StreamTee.h 127 size_t new_idx = m_streams.size(); local
130 return new_idx;
  /external/lldb/source/Interpreter/
OptionValueArray.cpp 102 uint32_t new_idx = UINT32_MAX; local
106 new_idx = array_count - idx;
111 new_idx = idx;
114 if (new_idx < array_count)
116 if (m_values[new_idx])
119 return m_values[new_idx]->GetSubValue (exe_ctx, sub_value, will_modify, error);
121 return m_values[new_idx];
  /external/chromium_org/third_party/openssl/openssl/crypto/engine/
eng_dyn.c 240 int new_idx = ENGINE_get_ex_new_index(0, NULL, NULL, NULL, local
242 if(new_idx == -1)
252 dynamic_ex_data_idx = new_idx;
253 new_idx = -1;
257 * (new_idx>-1), but it's not possible and wouldn't gain us much
  /external/llvm/include/llvm/IR/
CFG.h 205 unsigned new_idx = idx + Right; local
206 assert(index_is_valid(new_idx) && "Iterator index out of bound");
207 idx = new_idx;
  /external/openssl/crypto/engine/
eng_dyn.c 240 int new_idx = ENGINE_get_ex_new_index(0, NULL, NULL, NULL, local
242 if(new_idx == -1)
252 dynamic_ex_data_idx = new_idx;
253 new_idx = -1;
257 * (new_idx>-1), but it's not possible and wouldn't gain us much
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
radeon_compiler_util.c 687 unsigned int new_idx = 0; local
691 for ( ; new_idx < 4; new_idx++) {
692 if (GET_BIT(new_mask, new_idx)) {
693 SET_SWZ(conversion_swizzle, old_idx, new_idx);
694 new_idx++;
  /external/mesa3d/src/gallium/drivers/r300/compiler/
radeon_compiler_util.c 687 unsigned int new_idx = 0; local
691 for ( ; new_idx < 4; new_idx++) {
692 if (GET_BIT(new_mask, new_idx)) {
693 SET_SWZ(conversion_swizzle, old_idx, new_idx);
694 new_idx++;
  /external/opencv/ml/src/
mltree.cpp 2521 int* new_idx = data->split_buf->data.i; local
    [all...]

Completed in 715 milliseconds