HomeSort by: relevance | last modified time | path
    Searched defs:Seq (Results 1 - 10 of 10) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/utils/lit/lit/
ShCommands.py 88 class Seq:
96 return 'Seq(%r, %r, %r)' % (self.lhs, self.op, self.rhs)
99 if not isinstance(other, Seq):
  /src/external/apache2/llvm/dist/llvm/lib/Target/Mips/
MipsSEInstrInfo.cpp 631 const MipsAnalyzeImmediate::InstSeq &Seq =
633 MipsAnalyzeImmediate::InstSeq::const_iterator Inst = Seq.begin();
635 assert(Seq.size() && (!LastInstrIsADDiu || (Seq.size() > 1)));
648 // Build the remaining instructions in Seq.
649 for (++Inst; Inst != Seq.end() - LastInstrIsADDiu; ++Inst)
MipsSEISelDAGToDAG.cpp 803 const MipsAnalyzeImmediate::InstSeq &Seq =
806 MipsAnalyzeImmediate::InstSeq::const_iterator Inst = Seq.begin();
824 for (++Inst; Inst != Seq.end(); ++Inst) {
  /src/external/apache2/llvm/dist/llvm/lib/Target/RISCV/
RISCVISelDAGToDAG.cpp 49 RISCVMatInt::InstSeq Seq = RISCVMatInt::generateInstSeq(Imm, XLenVT == MVT::i64);
53 for (RISCVMatInt::Inst &Inst : Seq) {
RISCVInstrInfo.cpp 442 RISCVMatInt::InstSeq Seq = RISCVMatInt::generateInstSeq(Val, IsRV64);
443 assert(Seq.size() > 0);
445 for (RISCVMatInt::Inst &Inst : Seq) {
446 // Write the final result to DstReg if it's the last instruction in the Seq.
448 if (++Num == Seq.size())
  /src/external/apache2/llvm/dist/llvm/lib/DWARFLinker/
DWARFLinker.cpp 1595 /// Insert the new line info sequence \p Seq into the current
1597 static void insertLineSequence(std::vector<DWARFDebugLine::Row> &Seq,
1599 if (Seq.empty())
1602 if (!Rows.empty() && Rows.back().Address < Seq.front().Address) {
1603 llvm::append_range(Rows, Seq);
1604 Seq.clear();
1608 object::SectionedAddress Front = Seq.front().Address;
1618 *InsertPoint = Seq.front();
1619 Rows.insert(InsertPoint + 1, Seq.begin() + 1, Seq.end())
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 454 << " Seq: "
474 << " Seq: "
1285 const Sequence Seq = I->second.GetSeq();
1288 if (Seq == S_None)
1293 assert((Seq == S_Retain || Seq == S_CanRelease || Seq == S_Use) &&
1324 // *NOTE* We do not use Seq from above here since we are allowing for
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/
CodeGenSchedule.cpp 569 RecVec Seq = RWDef->getValueAsListOfDefs("Writes");
570 for (Record *WSRec : Seq)
709 std::string CodeGenSchedModels::genRWName(ArrayRef<unsigned> Seq, bool IsRead) {
712 for (unsigned I : Seq) {
830 unsigned CodeGenSchedModels::findRWForSequence(ArrayRef<unsigned> Seq,
834 auto I = find_if(RWVec, [Seq](CodeGenSchedRW &RW) {
835 return makeArrayRef(RW.Sequence) == Seq;
842 unsigned CodeGenSchedModels::findOrInsertRW(ArrayRef<unsigned> Seq,
844 assert(!Seq.empty() && "cannot insert empty sequence");
845 if (Seq.size() == 1
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Instrumentation/
AddressSanitizer.cpp 2440 auto Seq = dyn_cast<ConstantDataSequential>(G->getInitializer());
2441 if (Seq && Seq->isCString())
  /src/external/apache2/llvm/dist/clang/lib/Sema/
SemaChecking.cpp 13232 class Seq {
13237 explicit Seq(unsigned N) : Index(N) {}
13240 Seq() : Index(0) {}
13244 Seq root() const { return Seq(0); }
13249 Seq allocate(Seq Parent) {
13251 return Seq(Values.size() - 1);
13255 void merge(Seq S) {
13262 bool isUnsequenced(Seq Cur, Seq Old)
    [all...]

Completed in 95 milliseconds