| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Basic/ |
| H A D | SequenceToOffsetTable.h | 86 void add(const SeqT &Seq) { in add() argument 88 typename SeqMap::iterator I = Seqs.lower_bound(Seq); in add() 92 if (I != Seqs.end() && isSuffix(Seq, I->first)) in add() 95 I = Seqs.insert(I, {Seq, 0u}); in add() 98 if (I != Seqs.begin() && isSuffix((--I)->first, Seq)) in add() 124 unsigned get(const SeqT &Seq) const { in get() argument 126 typename SeqMap::const_iterator I = Seqs.lower_bound(Seq); in get() 127 assert(I != Seqs.end() && isSuffix(Seq, I->first) && in get() 129 return I->second + (I->first.size() - Seq.size()); in get() 150 for (const auto &[Seq, Offset] : Seqs) { in emitStringLiteralDef() [all …]
|
| /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/lib/Analysis/ |
| H A D | CloneDetection.cpp | 98 static bool containsAnyInGroup(StmtSequence &Seq, in containsAnyInGroup() argument 101 if (Seq.contains(GroupSeq)) in containsAnyInGroup() 418 const StmtSequence &Seq, std::size_t Limit, in calculateStmtComplexity() argument 420 if (Seq.empty()) in calculateStmtComplexity() 425 ASTContext &Context = Seq.getASTContext(); in calculateStmtComplexity() 429 data_collection::getMacroStack(Seq.getBeginLoc(), Context); in calculateStmtComplexity() 445 if (Seq.holdsSequence()) { in calculateStmtComplexity() 446 for (const Stmt *S : Seq) { in calculateStmtComplexity() 448 StmtSequence(S, Seq.getContainingDecl()), Limit, MacroStack); in calculateStmtComplexity() 453 for (const Stmt *S : Seq.front()->children()) { in calculateStmtComplexity() [all …]
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
| H A D | BottleneckAnalysis.cpp | 261 SmallVectorImpl<const DependencyEdge *> &Seq) const { in getCriticalSequence() 277 Seq.resize(Nodes[IID].Depth); in getCriticalSequence() 278 for (const DependencyEdge *&DE : llvm::reverse(Seq)) { in getCriticalSequence() 301 SmallVector<const DependencyEdge *, 16> Seq; in printCriticalSequence() local 302 DG.getCriticalSequence(Seq); in printCriticalSequence() 303 if (Seq.empty()) in printCriticalSequence() 308 const DependencyEdge &FirstEdge = *Seq[0]; in printCriticalSequence() 339 for (const DependencyEdge *&DE : Seq) { in printCriticalSequence() 651 SmallVector<const DependencyEdge *, 16> Seq; in toJSON() local 652 DG.getCriticalSequence(Seq); in toJSON() [all …]
|
| H A D | BottleneckAnalysis.h | 283 void getCriticalSequence(SmallVectorImpl<const DependencyEdge *> &Seq) const;
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | StructuralHash.cpp | 87 if (const auto *Seq = dyn_cast<ConstantDataSequential>(C)) in hashGlobalVariable() local 88 if (Seq->isString()) in hashGlobalVariable() 89 return stable_hash_name(Seq->getAsString()); in hashGlobalVariable() 139 if (const auto *Seq = dyn_cast<ConstantDataSequential>(C)) { in hashConstant() local 140 if (Seq->isString()) { in hashConstant() 141 Hashes.emplace_back(stable_hash_name(Seq->getAsString())); in hashConstant()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
| H A D | MemProfYAML.h | 275 static size_t size(IO &io, SmallVector<memprof::GUIDHex64> &Seq) { 276 return Seq.size(); 279 element(IO &io, SmallVector<memprof::GUIDHex64> &Seq, size_t Index) { 280 if (Index >= Seq.size()) 281 Seq.resize(Index + 1); 282 return Seq[Index];
|
| /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 | 394 assert(Idx < Seq.size()); in operator []() 395 return Seq[Idx]; in operator []() 399 return Seq.size(); in size() 405 iterator begin() { return Seq.begin(); } in begin() 406 iterator end() { return Seq.end(); } in end() 407 const_iterator begin() const { return Seq.begin(); } in begin() 408 const_iterator end() const { return Seq.end(); } in end() 414 ListType Seq; member in __anon7f002ed80311::OrderedRegisterList 444 iterator L = llvm::lower_bound(Seq, VR, Ord); in insert() 445 if (L == Seq.end()) in insert() [all …]
|
| H A D | HexagonConstExtenders.cpp | 134 void order(SmallVectorImpl<Node*> &Seq) const { in order() 135 order(Root, Seq); in order() 152 void order(Node *N, SmallVectorImpl<Node*> &Seq) const; 154 SmallVectorImpl<Node*> &Seq) const; 590 void RangeTree::order(Node *N, SmallVectorImpl<Node*> &Seq) const { in order() 593 order(N->Left, Seq); in order() 594 Seq.push_back(N); in order() 595 order(N->Right, Seq); in order() 599 SmallVectorImpl<Node*> &Seq) const { in nodesWith() 602 nodesWith(N->Left, P, CheckA, Seq); in nodesWith() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/Parallel/ |
| H A D | DWARFLinkerCompileUnit.cpp | 1544 std::vector<DWARFDebugLine::Row> Seq; in cloneAndEmitLineTable() local 1572 if (StopAddress != -1ULL && !Seq.empty()) { in cloneAndEmitLineTable() 1575 auto NextLine = Seq.back(); in cloneAndEmitLineTable() 1581 Seq.push_back(NextLine); in cloneAndEmitLineTable() 1582 insertLineSequence(Seq, NewRows); in cloneAndEmitLineTable() 1590 if (Row.EndSequence && Seq.empty()) in cloneAndEmitLineTable() 1595 Seq.emplace_back(Row); in cloneAndEmitLineTable() 1598 insertLineSequence(Seq, NewRows); in cloneAndEmitLineTable() 1607 void CompileUnit::insertLineSequence(std::vector<DWARFDebugLine::Row> &Seq, in insertLineSequence() argument 1609 if (Seq.empty()) in insertLineSequence() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/Classic/ |
| H A D | DWARFLinker.cpp | 2108 static void insertLineSequence(std::vector<TrackedRow> &Seq, in insertLineSequence() argument 2110 if (Seq.empty()) in insertLineSequence() 2115 Seq.front().isStartSeqInOutput = true; in insertLineSequence() 2117 if (!Rows.empty() && Rows.back().Row.Address < Seq.front().Row.Address) { in insertLineSequence() 2118 llvm::append_range(Rows, Seq); in insertLineSequence() 2119 Seq.clear(); in insertLineSequence() 2123 object::SectionedAddress Front = Seq.front().Row.Address; in insertLineSequence() 2133 *InsertPoint = Seq.front(); in insertLineSequence() 2134 Rows.insert(InsertPoint + 1, Seq.begin() + 1, Seq.end()); in insertLineSequence() 2136 Rows.insert(InsertPoint, Seq.begin(), Seq.end()); in insertLineSequence() [all …]
|
| /freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenSchedule.cpp | 699 std::string CodeGenSchedModels::genRWName(ArrayRef<unsigned> Seq, bool IsRead) { in genRWName() argument 702 for (unsigned I : Seq) { in genRWName() 807 unsigned CodeGenSchedModels::findOrInsertRW(ArrayRef<unsigned> Seq, in findOrInsertRW() argument 809 assert(!Seq.empty() && "cannot insert empty sequence"); in findOrInsertRW() 810 if (Seq.size() == 1) in findOrInsertRW() 811 return Seq.back(); in findOrInsertRW() 815 auto I = find_if(RWVec, [Seq](CodeGenSchedRW &RW) { in findOrInsertRW() 816 return ArrayRef(RW.Sequence) == Seq; in findOrInsertRW() 822 CodeGenSchedRW SchedRW(RWIdx, IsRead, Seq, genRWName(Seq, IsRead)); in findOrInsertRW() 1511 SmallVectorImpl<unsigned> &Seq = RWSequences.back(); in pushVariant() local [all …]
|
| H A D | CodeGenSchedule.h | 79 CodeGenSchedRW(unsigned Idx, bool Read, ArrayRef<unsigned> Seq, in CodeGenSchedRW() 82 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) { in CodeGenSchedRW() 563 unsigned findOrInsertRW(ArrayRef<unsigned> Seq, bool IsRead); 581 std::string genRWName(ArrayRef<unsigned> Seq, bool IsRead);
|
| /freebsd/contrib/llvm-project/llvm/lib/DWARFLinker/ |
| H A D | DWARFLinker.cpp | |
| /freebsd/contrib/llvm-project/llvm/tools/llvm-dwarfdump/ |
| H A D | Statistics.cpp | 931 for (const auto &Seq : LineTable->Sequences) { in collectStatsForObjectFile() local 932 LnStats.NumBytes += Seq.HighPC - Seq.LowPC; in collectStatsForObjectFile() 934 LnStats.NumEntries += Seq.LastRowIndex - Seq.FirstRowIndex - 1; in collectStatsForObjectFile() 935 for (size_t RowIdx = Seq.FirstRowIndex; RowIdx < Seq.LastRowIndex - 1; in collectStatsForObjectFile()
|
| /freebsd/contrib/llvm-project/llvm/lib/TextAPI/ |
| H A D | TextStub.cpp | 1045 static size_t size(IO &IO, std::vector<const MachO::InterfaceFile *> &Seq) { in size() 1046 return Seq.size(); in size() 1049 element(IO &IO, std::vector<const InterfaceFile *> &Seq, size_t Index) { in element() 1050 if (Index >= Seq.size()) in element() 1051 Seq.resize(Index + 1); in element() 1052 return Seq[Index]; in element()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Basic/ |
| H A D | OpenACCKinds.h | 316 Seq, enumerator 351 case OpenACCClauseKind::Seq: in printOpenACCClauseKind()
|
| H A D | OpenACCClauses.def | 67 VISIT_CLAUSE(Seq)
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFDebugLine.cpp | 1296 const DWARFDebugLine::Sequence &Seq, in findRowInSeq() argument 1298 if (!Seq.containsPC(Address)) in findRowInSeq() 1300 assert(Seq.SectionIndex == Address.SectionIndex); in findRowInSeq() 1311 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex; in findRowInSeq() 1312 RowIter LastRow = Rows.begin() + Seq.LastRowIndex; in findRowInSeq() 1318 assert(Seq.SectionIndex == RowPos->Address.SectionIndex); in findRowInSeq()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/LoongArch/ |
| H A D | LoongArchInstrInfo.cpp | 197 auto Seq = LoongArchMatInt::generateInstSeq(Val); in movImm() local 198 assert(!Seq.empty()); in movImm() 200 for (auto &Inst : Seq) { in movImm()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/RISCV/MCTargetDesc/ |
| H A D | RISCVMatInt.cpp | 470 RISCVMatInt::InstSeq Seq = RISCVMatInt::generateInstSeq(Val, STI); in generateMCInstSeq() local 473 for (RISCVMatInt::Inst &Inst : Seq) { in generateMCInstSeq()
|