Lines Matching refs:Table
84 // 1. A operand match table is built, each entry contains a mnemonic, an
1617 // Verify that the table is now sorted
1818 SmallSetVector<std::string, 16> &Table,
1820 IsNew = Table.insert(Name);
1822 unsigned ID = IsNew ? Table.size() - 1 :
1823 std::find(Table.begin(), Table.end(), Name) - Table.begin();
1825 assert(ID < Table.size());
2108 // to the table.
2112 // Add the row to the table.
2140 // Output the conversion table.
2646 // Emit the static custom operand parsing table;
2757 // Emit code to search the table.
2758 OS << " // Search the table.\n";
2817 // Sort the instruction table using the partial order on classes. We use
2826 // Verify that the table is now sorted
2991 // Emit the static match table; unused classes get initalized to 0 which is
2994 // FIXME: We can reduce the size of this table very easily. First, we change
3079 OS << " // Find the appropriate table for this asm variant.\n";
3090 OS << " // Search the table.\n";
3144 // Emit code to search the table.
3145 OS << " // Find the appropriate table for this asm variant.\n";
3157 OS << " // Search the table.\n";
