/external/emma/core/java12/com/vladium/util/ |
D | ObjectIntMap.java | 98 if ((keyHash == entry.m_key.hashCode ()) || entry.m_key.equals (key)) in contains() 126 if ((keyHash == entry.m_key.hashCode ()) || entry.m_key.equals (key)) in get() 145 result [scan ++] = entry.m_key; in keys() 174 if ((keyHash == entry.m_key.hashCode ()) || entry.m_key.equals (key)) in put() 222 if ((keyHash == entry.m_key.hashCode ()) || entry.m_key.equals (key)) in remove() 264 m_key = key; in Entry() 269 Object m_key; // reference to the value [never null] field in ObjectIntMap.Entry 297 final int entryKeyHash = entry.m_key.hashCode () & 0x7FFFFFFF; in rehash()
|
D | IntIntMap.java | 93 if (key == entry.m_key) return true; in contains() 117 if (key == entry.m_key) in get() 136 if (key == entry.m_key) in get() 155 result [scan ++] = entry.m_key; in keys() 181 if (key == entry.m_key) in put() 226 if (key == entry.m_key) in remove() 268 m_key = key; in Entry() 273 int m_key; field in IntIntMap.Entry 301 final int entryKeyHash = entry.m_key & 0x7FFFFFFF; in rehash()
|
D | IntSet.java | 91 if (key == entry.m_key) in contains() 111 result [scan ++] = entry.m_key; in values() 129 target [scan ++] = entry.m_key; in values() 148 if (key == entry.m_key) in add() 200 m_key = key; in Entry() 204 final int m_key; field in IntSet.Entry 231 final int entryKey = entry.m_key; in rehash()
|
D | IntObjectMap.java | 93 if (key == entry.m_key) in contains() 118 if (key == entry.m_key) in get() 138 result [scan ++] = entry.m_key; in keys() 167 if (key == entry.m_key) in put() 226 m_key = key; in Entry() 232 final int m_key; field in IntObjectMap.Entry 259 final int entryKey = entry.m_key; in rehash()
|
D | SoftValueMap.java | 171 final Object entryKey = entry.m_key; in get() 240 final Object entryKey = entry.m_key; in put() 309 final Object entryKey = entry.m_key; in remove() 330 entry.m_key = null; in remove() 359 entry.m_key = null; in clear() 449 m_key = key; in SoftEntry() 458 Object m_key; // strong reference to the key [never null] field in SoftValueMap.SoftEntry 500 final int entryKeyHashCode = entry.m_key.hashCode (); in rehash() 572 entry.m_key = null; in removeClearedValues()
|
/external/mdnsresponder/mDNSWindows/ControlPanel/ |
D | SharedSecret.cpp | 42 , m_key(_T("")) in IMPLEMENT_DYNAMIC() 64 DDX_Text(pDX, IDC_KEY, m_key ); in DoDataExchange() 89 m_key = outKey; in BEGIN_MESSAGE_MAP() 94 m_key = zone; in BEGIN_MESSAGE_MAP() 111 StringObjectToUTF8String( m_key, keyUTF8, sizeof( keyUTF8 ) ); in Commit()
|
D | SharedSecret.h | 52 CString m_key;
|
/external/mesa3d/src/gallium/drivers/r600/sfn/ |
D | sfn_shader_tess_eval.cpp | 12 m_key(key) in TEvalShaderFromNir() 89 m_key.vs.as_gs_a) { in do_allocate_reserved_registers() 94 if (m_key.vs.as_gs_a) in do_allocate_reserved_registers()
|
D | sfn_shader_vertex.cpp | 54 m_key(key), in VertexShaderFromNir() 61 sh_info().vs_as_gs_a = m_key.vs.as_gs_a; in VertexShaderFromNir() 100 if (m_key.vs.as_gs_a || m_sv_values.test(es_primitive_id)) { in do_allocate_reserved_registers()
|
D | sfn_shader_tess_eval.h | 36 const r600_shader_key& m_key; variable
|
D | sfn_shader_vertex.h | 74 r600_shader_key m_key; variable
|
D | sfn_shader_geometry.h | 73 r600_shader_key m_key; variable
|
D | sfn_vertexstageexport.h | 57 const r600_shader_key& m_key; variable
|
D | sfn_vertexstageexport.cpp | 32 m_key(key) in VertexStageExportForFS() 254 if (m_key.vs.as_gs_a) { in finalize_exports() 267 io.spi_sid = m_key.vs.prim_id_out; in finalize_exports()
|
D | sfn_shader_geometry.cpp | 45 m_key(key), in GeometryShaderFromNir() 188 if (m_key.gs.tri_strip_adj_fix) in do_allocate_reserved_registers()
|
D | sfn_ir_to_assembly.cpp | 88 r600_shader_key *m_key; member 218 m_key(key), in AssemblyFromShaderLegacyImpl() 224 m_max_color_exports = MAX2(m_key->ps.nr_cbufs, 1); in AssemblyFromShaderLegacyImpl() 460 output.swizzle_w = m_key->ps.alpha_to_one ? 5 : gpr.chan_i(3); ; in emit_fs_pixel_export()
|
/external/OpenCL-CTS/test_common/miniz/ |
D | miniz.c | 1057 typedef struct { mz_uint16 m_key, m_sym_index; } tdefl_sym_freq; member 1061 …for (i = 0; i < num_syms; i++) { mz_uint freq = pSyms0[i].m_key; hist[freq & 0xFF]++; hist[256 + (… in tdefl_radix_sort_syms() 1068 …for (i = 0; i < num_syms; i++) pNew_syms[offsets[(pCur_syms[i].m_key >> pass_shift) & 0xFF]++] = p… in tdefl_radix_sort_syms() 1078 if (n==0) return; else if (n==1) { A[0].m_key = 1; return; } in tdefl_calculate_minimum_redundancy() 1079 A[0].m_key += A[1].m_key; root = 0; leaf = 2; in tdefl_calculate_minimum_redundancy() 1082 …n || A[root].m_key<A[leaf].m_key) { A[next].m_key = A[root].m_key; A[root++].m_key = (mz_uint16)ne… in tdefl_calculate_minimum_redundancy() 1083 …m_key<A[leaf].m_key)) { A[next].m_key = (mz_uint16)(A[next].m_key + A[root].m_key); A[root++].m_ke… in tdefl_calculate_minimum_redundancy() 1085 A[n-2].m_key = 0; for (next=n-3; next>=0; next--) A[next].m_key = A[A[next].m_key].m_key+1; in tdefl_calculate_minimum_redundancy() 1089 while (root>=0 && (int)A[root].m_key==dpth) { used++; root--; } in tdefl_calculate_minimum_redundancy() 1090 while (avbl>used) { A[next--].m_key = (mz_uint16)(dpth); avbl--; } in tdefl_calculate_minimum_redundancy() [all …]
|
/external/antlr/runtime/Cpp/include/ |
D | antlr3collections.hpp | 69 …ANTLR_INTKEY m_key; /**< This is the actual key that the entry represents if it is a terminal nod… member in IntTrieNode
|
D | antlr3collections.inl | 39 return m_key; 64 m_key = key; 491 m_key = 0;
|
/external/emma/lib/ |
D | emma.jar | META-INF/
META-INF/MANIFEST.MF
com/
com/vladium/
com/ ... |