Lines Matching defs:Opcodes
192 /// This recursive scheme ends when the number of Opcodes assigned to the
195 /// Opcodes assigned.
313 const std::vector<unsigned> &Opcodes;
339 : AllInstructions(FC.AllInstructions), Opcodes(FC.Opcodes),
350 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops), Filters(),
363 : AllInstructions(Insts), Opcodes(IDs), Operands(Ops),
510 for (unsigned i = 0, e = Owner->Opcodes.size(); i != e; ++i) {
514 Owner->insnWithID(Insn, Owner->Opcodes[i]);
523 LastOpcFiltered = Owner->Opcodes[i];
529 VariableInstructions.push_back(Owner->Opcodes[i]);
983 for (unsigned i = 0; i < Opcodes.size(); ++i) {
984 if (Opcodes[i] == Opc) continue;
985 errs() << nameWithID(Opcodes[i]) << ' ';
990 for (unsigned i = 0; i < Opcodes.size(); ++i) {
991 const std::string &Name = nameWithID(Opcodes[i]);
995 getBitsField(*AllInstructions[Opcodes[i]]->TheDef, "Inst"));
1405 unsigned numInstructions = Opcodes.size();
1418 for (unsigned i = 0; i < Opcodes.size(); ++i) {
1424 insnWithID(Insn, Opcodes[i]);
1468 insnWithID(insn, Opcodes[InsnIndex]);
1634 unsigned Num = Opcodes.size();
1660 if (Opcodes.size() == 1) {
1664 emitSingletonTableEntry(TableInfo, Opcodes[0]);
1686 for (unsigned i = 0; i < Opcodes.size(); ++i) {
1687 const std::string &Name = nameWithID(Opcodes[i]);
1691 getBitsField(*AllInstructions[Opcodes[i]]->TheDef, "Inst"));