Lines Matching defs:SeqLs
21 void MipsAnalyzeImmediate::AddInstr(InstSeqLs &SeqLs, const Inst &I) {
23 if (SeqLs.empty()) {
24 SeqLs.push_back(InstSeq(1, I));
28 for (InstSeqLs::iterator Iter = SeqLs.begin(); Iter != SeqLs.end(); ++Iter)
33 InstSeqLs &SeqLs) {
34 GetInstSeqLs((Imm + 0x8000ULL) & 0xffffffffffff0000ULL, RemSize, SeqLs);
35 AddInstr(SeqLs, Inst(ADDiu, Imm & 0xffffULL));
39 InstSeqLs &SeqLs) {
40 GetInstSeqLs(Imm & 0xffffffffffff0000ULL, RemSize, SeqLs);
41 AddInstr(SeqLs, Inst(ORi, Imm & 0xffffULL));
45 InstSeqLs &SeqLs) {
47 GetInstSeqLs(Imm >> Shamt, RemSize - Shamt, SeqLs);
48 AddInstr(SeqLs, Inst(SLL, Shamt));
52 InstSeqLs &SeqLs) {
61 AddInstr(SeqLs, Inst(ADDiu, MaskedImm));
67 GetInstSeqLsSLL(Imm, RemSize, SeqLs);
71 GetInstSeqLsADDiu(Imm, RemSize, SeqLs);
78 SeqLs.append(std::make_move_iterator(SeqLsORi.begin()),
109 void MipsAnalyzeImmediate::GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts) {
110 InstSeqLs::iterator ShortestSeq = SeqLs.end();
114 for (InstSeqLs::iterator S = SeqLs.begin(); S != SeqLs.end(); ++S) {
145 InstSeqLs SeqLs;
149 GetInstSeqLsADDiu(Imm, Size, SeqLs);
151 GetInstSeqLs(Imm, Size, SeqLs);
154 GetShortestSeq(SeqLs, Insts);