Home
last modified time | relevance | path

Searched refs:COUNTOF (Results 1 – 4 of 4) sorted by relevance

/dalvik/vm/compiler/codegen/x86/libenc/
Denc_base.cpp110 if (*pargsCount >= COUNTOF(opnds)) { in encode_aux()
128 if (memidx >= COUNTOF(opnds) || regidx >= COUNTOF(opnds)) { in encode_aux()
465 assert(idx < COUNTOF(curRelOpnd)); in encodeModRM()
748 unsigned key = hash % COUNTOF(subHash); in find()
768 unsigned key = hash % COUNTOF(subHash); in put()
895 for (unsigned i = 0; i<COUNTOF(sizes); i++) { in getOpndSize()
904 for( unsigned i = 0; i<COUNTOF(sizes); i++ ) { in getOpndSizeString()
934 for (unsigned i = 0; i<COUNTOF(kinds); i++) { in getOpndKindString()
945 for (unsigned i = 0; i<COUNTOF(kinds); i++) { in getOpndKind()
1131 for (unsigned i = 0; i<COUNTOF(registers); i++) { in getRegNameString()
[all …]
Denc_base.h562 assert(m_count < COUNTOF(m_operands)); in add()
578 Operand m_operands[COUNTOF( ((OpcodeDesc*)NULL)->opnds )];
Denc_tabl.cpp283 assert(kind<COUNTOF(kind_hash)); in getHash()
284 assert(size<COUNTOF(size_hash)); in getHash()
291 assert(kind<COUNTOF(kind_hash)); in getHash()
292 assert(size<COUNTOF(size_hash)); in getHash()
300 assert(kind<COUNTOF(kind_hash)); in getHash()
301 assert(size<COUNTOF(size_hash)); in getHash()
1762 assert(COUNTOF(masterEncodingTable) == Mnemonic_Count); in buildTable()
1795 for (unsigned i=0, oindex=0; i<COUNTOF(minfo->opcodes); i++) { in buildMnemonicDesc()
Denc_defs.h37 #ifndef COUNTOF
41 #define COUNTOF(a) (sizeof(a)/sizeof(a[0])) macro