/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsAnalyzeImmediate.cpp | 89 void MipsAnalyzeImmediate::ReplaceADDiuSLLWithLUi(InstSeq &Seq) { in ReplaceADDiuSLLWithLUi() argument 92 if ((Seq.size() < 2) || (Seq[0].Opc != ADDiu) || in ReplaceADDiuSLLWithLUi() 93 (Seq[1].Opc != SLL) || (Seq[1].ImmOpnd < 16)) in ReplaceADDiuSLLWithLUi() 97 int64_t Imm = SignExtend64<16>(Seq[0].ImmOpnd); in ReplaceADDiuSLLWithLUi() 98 int64_t ShiftedImm = (uint64_t)Imm << (Seq[1].ImmOpnd - 16); in ReplaceADDiuSLLWithLUi() 104 Seq[0].Opc = LUi; in ReplaceADDiuSLLWithLUi() 105 Seq[0].ImmOpnd = (unsigned)(ShiftedImm & 0xffff); in ReplaceADDiuSLLWithLUi() 106 Seq.erase(Seq.begin() + 1); in ReplaceADDiuSLLWithLUi()
|
H A D | MipsAnalyzeImmediate.h | 53 void ReplaceADDiuSLLWithLUi(InstSeq &Seq);
|
H A D | MipsSEInstrInfo.cpp | 601 const MipsAnalyzeImmediate::InstSeq &Seq = in loadImmediate() local 603 MipsAnalyzeImmediate::InstSeq::const_iterator Inst = Seq.begin(); in loadImmediate() 605 assert(Seq.size() && (!LastInstrIsADDiu || (Seq.size() > 1))); in loadImmediate() 619 for (++Inst; Inst != Seq.end() - LastInstrIsADDiu; ++Inst) in loadImmediate()
|
/freebsd/contrib/llvm-project/clang/include/clang/Serialization/ |
H A D | SourceLocationEncoding.h | 149 SourceLocationSequence Seq; variable 155 : Seq(Parent ? Parent->Prev : Prev) {} 158 operator SourceLocationSequence *() { return &Seq; } 164 SourceLocationSequence *Seq) { in encode() argument 168 return Seq ? Seq->encode(Loc) : encodeRaw(Loc.getRawEncoding()); in encode() 187 SourceLocationSequence *Seq) { in decode() argument 191 return {Seq ? Seq->decode(Encoded) in decode()
|
H A D | ASTRecordWriter.h | 139 void AddSourceLocation(SourceLocation Loc, LocSeq *Seq = nullptr) { 140 return Writer->AddSourceLocation(Loc, *Record, Seq); 152 void AddSourceRange(SourceRange Range, LocSeq *Seq = nullptr) { 153 return Writer->AddSourceRange(Range, *Record, Seq); 219 void AddTypeLoc(TypeLoc TL, LocSeq *Seq = nullptr);
|
H A D | ASTRecordReader.h | 163 void readTypeLoc(TypeLoc TL, LocSeq *Seq = nullptr); 285 SourceLocation readSourceLocation(LocSeq *Seq = nullptr) { 286 return Reader->ReadSourceLocation(*F, Record, Idx, Seq); 290 SourceRange readSourceRange(LocSeq *Seq = nullptr) { 291 return Reader->ReadSourceRange(*F, Record, Idx, Seq);
|
H A D | ASTReader.h | 2241 LocSeq *Seq = nullptr) const { 2242 return SourceLocationEncoding::decode(Raw, Seq); 2247 LocSeq *Seq = nullptr) const { 2251 auto [Loc, ModuleFileIndex] = ReadUntranslatedSourceLocation(Raw, Seq); 2280 LocSeq *Seq = nullptr) { 2281 return ReadSourceLocation(ModuleFile, Record[Idx++], Seq); 2298 unsigned &Idx, LocSeq *Seq = nullptr);
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Basic/ |
H A D | SequenceToOffsetTable.h | 81 void add(const SeqT &Seq) { in add() argument 83 typename SeqMap::iterator I = Seqs.lower_bound(Seq); in add() 87 if (I != Seqs.end() && isSuffix(Seq, I->first)) in add() 90 I = Seqs.insert(I, std::pair(Seq, 0u)); in add() 93 if (I != Seqs.begin() && isSuffix((--I)->first, Seq)) in add() 117 unsigned get(const SeqT &Seq) const { in get() argument 119 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq); in get() 120 assert(I != Seqs.end() && isSuffix(Seq, I->first) && in get() 122 return I->second + (I->first.size() - Seq.size()); in get()
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/ |
H A D | CloneDetection.cpp | 99 static bool containsAnyInGroup(StmtSequence &Seq, in containsAnyInGroup() argument 102 if (Seq.contains(GroupSeq)) in containsAnyInGroup() 419 const StmtSequence &Seq, std::size_t Limit, in calculateStmtComplexity() argument 421 if (Seq.empty()) in calculateStmtComplexity() 426 ASTContext &Context = Seq.getASTContext(); in calculateStmtComplexity() 430 data_collection::getMacroStack(Seq.getBeginLoc(), Context); in calculateStmtComplexity() 446 if (Seq.holdsSequence()) { in calculateStmtComplexity() 447 for (const Stmt *S : Seq) { in calculateStmtComplexity() 449 StmtSequence(S, Seq.getContainingDecl()), Limit, MacroStack); in calculateStmtComplexity() 454 for (const Stmt *S : Seq.front()->children()) { in calculateStmtComplexity() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | PtrState.h | 111 unsigned char Seq : 8; variable 116 PtrState() : Seq(S_None) {} in PtrState() 150 Sequence GetSeq() const { return static_cast<Sequence>(Seq); } in GetSeq()
|
H A D | PtrState.cpp | 137 Seq = NewSeq; in SetSeq() 148 Seq = MergeSeqs(GetSeq(), Other.GetSeq(), TopDown); in Merge() 152 if (Seq == S_None) { in Merge()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonGenInsert.cpp | 393 assert(Idx < Seq.size()); in operator []() 394 return Seq[Idx]; in operator []() 398 return Seq.size(); in size() 404 iterator begin() { return Seq.begin(); } in begin() 405 iterator end() { return Seq.end(); } in end() 406 const_iterator begin() const { return Seq.begin(); } in begin() 407 const_iterator end() const { return Seq.end(); } in end() 413 ListType Seq; member in __anon7f002ed80311::OrderedRegisterList 443 iterator L = llvm::lower_bound(Seq, VR, Ord); in insert() 444 if (L == Seq.end()) in insert() [all …]
|
H A D | HexagonConstExtenders.cpp | 143 void order(SmallVectorImpl<Node*> &Seq) const { in order() 144 order(Root, Seq); in order() 161 void order(Node *N, SmallVectorImpl<Node*> &Seq) const; 163 SmallVectorImpl<Node*> &Seq) const; 603 void RangeTree::order(Node *N, SmallVectorImpl<Node*> &Seq) const { in order() 606 order(N->Left, Seq); in order() 607 Seq.push_back(N); in order() 608 order(N->Right, Seq); in order() 612 SmallVectorImpl<Node*> &Seq) const { in nodesWith() 615 nodesWith(N->Left, P, CheckA, Seq); in nodesWith() [all …]
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
H A D | BottleneckAnalysis.cpp | 262 SmallVectorImpl<const DependencyEdge *> &Seq) const { in getCriticalSequence() 278 Seq.resize(Nodes[IID].Depth); in getCriticalSequence() 279 for (const DependencyEdge *&DE : llvm::reverse(Seq)) { in getCriticalSequence() 302 SmallVector<const DependencyEdge *, 16> Seq; in printCriticalSequence() local 303 DG.getCriticalSequence(Seq); in printCriticalSequence() 304 if (Seq.empty()) in printCriticalSequence() 309 const DependencyEdge &FirstEdge = *Seq[0]; in printCriticalSequence() 340 for (const DependencyEdge *&DE : Seq) { in printCriticalSequence()
|
/freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/Parallel/ |
H A D | DWARFLinkerCompileUnit.cpp | 1548 std::vector<DWARFDebugLine::Row> Seq; in cloneAndEmitLineTable() local 1576 if (StopAddress != -1ULL && !Seq.empty()) { in cloneAndEmitLineTable() 1579 auto NextLine = Seq.back(); in cloneAndEmitLineTable() 1585 Seq.push_back(NextLine); in cloneAndEmitLineTable() 1586 insertLineSequence(Seq, NewRows); in cloneAndEmitLineTable() 1594 if (Row.EndSequence && Seq.empty()) in cloneAndEmitLineTable() 1599 Seq.emplace_back(Row); in cloneAndEmitLineTable() 1602 insertLineSequence(Seq, NewRows); in cloneAndEmitLineTable() 1611 void CompileUnit::insertLineSequence(std::vector<DWARFDebugLine::Row> &Seq, in insertLineSequence() argument 1613 if (Seq.empty()) in insertLineSequence() [all …]
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
H A D | CodeGenSchedule.cpp | 592 RecVec Seq = RWDef->getValueAsListOfDefs("Writes"); in scanSchedRW() local 593 for (Record *WSRec : Seq) in scanSchedRW() 730 std::string CodeGenSchedModels::genRWName(ArrayRef<unsigned> Seq, bool IsRead) { in genRWName() argument 733 for (unsigned I : Seq) { in genRWName() 838 unsigned CodeGenSchedModels::findRWForSequence(ArrayRef<unsigned> Seq, in findRWForSequence() argument 842 auto I = find_if(RWVec, [Seq](CodeGenSchedRW &RW) { in findRWForSequence() 843 return ArrayRef(RW.Sequence) == Seq; in findRWForSequence() 850 unsigned CodeGenSchedModels::findOrInsertRW(ArrayRef<unsigned> Seq, in findOrInsertRW() argument 852 assert(!Seq.empty() && "cannot insert empty sequence"); in findOrInsertRW() 853 if (Seq.size() == 1) in findOrInsertRW() [all …]
|
H A D | CodeGenSchedule.h | 78 CodeGenSchedRW(unsigned Idx, bool Read, ArrayRef<unsigned> Seq, in CodeGenSchedRW() 81 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) { in CodeGenSchedRW() 574 unsigned findOrInsertRW(ArrayRef<unsigned> Seq, bool IsRead); 591 std::string genRWName(ArrayRef<unsigned> Seq, bool IsRead); 592 unsigned findRWForSequence(ArrayRef<unsigned> Seq, bool IsRead);
|
/freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/ |
H A D | DWARFLinker.cpp |
|
/freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/Classic/ |
H A D | DWARFLinker.cpp | 2069 static void insertLineSequence(std::vector<DWARFDebugLine::Row> &Seq, in insertLineSequence() argument 2071 if (Seq.empty()) in insertLineSequence() 2074 if (!Rows.empty() && Rows.back().Address < Seq.front().Address) { in insertLineSequence() 2075 llvm::append_range(Rows, Seq); in insertLineSequence() 2076 Seq.clear(); in insertLineSequence() 2080 object::SectionedAddress Front = Seq.front().Address; in insertLineSequence() 2090 *InsertPoint = Seq.front(); in insertLineSequence() 2091 Rows.insert(InsertPoint + 1, Seq.begin() + 1, Seq.end()); in insertLineSequence() 2093 Rows.insert(InsertPoint, Seq.begin(), Seq.end()); in insertLineSequence() 2096 Seq.clear(); in insertLineSequence() [all …]
|
/freebsd/contrib/llvm-project/llvm/tools/llvm-dwarfdump/ |
H A D | Statistics.cpp | 929 for (const auto &Seq : LineTable->Sequences) { in collectStatsForObjectFile() local 930 LnStats.NumBytes += Seq.HighPC - Seq.LowPC; in collectStatsForObjectFile() 932 LnStats.NumEntries += Seq.LastRowIndex - Seq.FirstRowIndex - 1; in collectStatsForObjectFile() 933 for (size_t RowIdx = Seq.FirstRowIndex; RowIdx < Seq.LastRowIndex - 1; in collectStatsForObjectFile()
|
/freebsd/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | OpenACCKinds.h | 170 Seq, enumerator 302 case OpenACCClauseKind::Seq: in printOpenACCClauseKind()
|
H A D | OpenACCClauses.def | 53 VISIT_CLAUSE(Seq)
|
/freebsd/contrib/llvm-project/llvm/lib/TextAPI/ |
H A D | TextStub.cpp | 1046 static size_t size(IO &IO, std::vector<const MachO::InterfaceFile *> &Seq) { in size() 1047 return Seq.size(); in size() 1050 element(IO &IO, std::vector<const InterfaceFile *> &Seq, size_t Index) { in element() 1051 if (Index >= Seq.size()) in element() 1052 Seq.resize(Index + 1); in element() 1053 return Seq[Index]; in element()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/LoongArch/ |
H A D | LoongArchInstrInfo.cpp | 192 auto Seq = LoongArchMatInt::generateInstSeq(Val); in movImm() local 193 assert(!Seq.empty()); in movImm() 195 for (auto &Inst : Seq) { in movImm()
|
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFDebugLine.cpp | 1289 const DWARFDebugLine::Sequence &Seq, in findRowInSeq() argument 1291 if (!Seq.containsPC(Address)) in findRowInSeq() 1293 assert(Seq.SectionIndex == Address.SectionIndex); in findRowInSeq() 1304 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex; in findRowInSeq() 1305 RowIter LastRow = Rows.begin() + Seq.LastRowIndex; in findRowInSeq() 1311 assert(Seq.SectionIndex == RowPos->Address.SectionIndex); in findRowInSeq()
|