/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | MipsAnalyzeImmediate.cpp | 89 void MipsAnalyzeImmediate::ReplaceADDiuSLLWithLUi(InstSeq &Seq) { argument 92 if ((Seq.size() < 2) || (Seq[0].Opc != ADDiu) || 93 (Seq[1].Opc != SLL) || (Seq[1].ImmOpnd < 16)) 97 int64_t Imm = SignExtend64<16>(Seq[0].ImmOpnd); 98 int64_t ShiftedImm = (uint64_t)Imm << (Seq[1].ImmOpnd - 16); 104 Seq[0].Opc = LUi; 105 Seq[0].ImmOpnd = (unsigned)(ShiftedImm & 0xffff); 106 Seq [all...] |
H A D | MipsAnalyzeImmediate.h | 53 void ReplaceADDiuSLLWithLUi(InstSeq &Seq);
|
H A D | MipsSEInstrInfo.cpp | 631 const MipsAnalyzeImmediate::InstSeq &Seq = local 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)
|
H A D | MipsSEISelDAGToDAG.cpp | 803 const MipsAnalyzeImmediate::InstSeq &Seq = local 806 MipsAnalyzeImmediate::InstSeq::const_iterator Inst = Seq.begin(); 824 for (++Inst; Inst != Seq.end(); ++Inst) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | PtrState.h | 111 unsigned char Seq : 8; 116 PtrState() : Seq(S_None) {} 150 Sequence GetSeq() const { return static_cast<Sequence>(Seq); }
|
H A D | PtrState.cpp | 140 Seq = NewSeq; 151 Seq = MergeSeqs(GetSeq(), Other.GetSeq(), TopDown); 155 if (Seq == S_None) { 238 LLVM_DEBUG(dbgs() << " CanAlterRefCount: Seq: " << S << "; " 290 LLVM_DEBUG(dbgs() << " CanUse: Seq: " << GetSeq() << "; " 293 } else if (Seq == S_Release && IsUser(Class)) { 294 LLVM_DEBUG(dbgs() << " PreciseReleaseUse: Seq: " << GetSeq() 300 LLVM_DEBUG(dbgs() << " ReleaseUse: Seq: " << GetSeq() << "; " 308 LLVM_DEBUG(dbgs() << " PreciseStopUse: Seq: " << GetSeq() 390 LLVM_DEBUG(dbgs() << " CanAlterRefCount: Seq [all...] |
H A D | ObjCARCOpts.cpp | 452 << " Seq: " 472 << " Seq: " 1262 const Sequence Seq = I->second.GetSeq(); local 1265 if (Seq == S_None) 1270 assert((Seq == S_Retain || Seq == S_CanRelease || Seq == S_Use) && 1301 // *NOTE* We do not use Seq from above here since we are allowing for
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/ |
H A D | CloneDetection.cpp | 99 static bool containsAnyInGroup(StmtSequence &Seq, argument 102 if (Seq.contains(GroupSeq)) 420 const StmtSequence &Seq, std::size_t Limit, 422 if (Seq.empty()) 427 ASTContext &Context = Seq.getASTContext(); 431 data_collection::getMacroStack(Seq.getBeginLoc(), Context); 447 if (Seq.holdsSequence()) { 448 for (const Stmt *S : Seq) { 450 StmtSequence(S, Seq.getContainingDecl()), Limit, MacroStack); 455 for (const Stmt *S : Seq 419 calculateStmtComplexity( const StmtSequence &Seq, std::size_t Limit, const std::string &ParentMacroStack) argument [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/ |
H A D | BottleneckAnalysis.cpp | 265 SmallVectorImpl<const DependencyEdge *> &Seq) const { 279 Seq.resize(Nodes[IID].Depth); 280 for (unsigned I = Seq.size(), E = 0; I > E; --I) { 282 Seq[I - 1] = &N.CriticalPredecessor; 311 SmallVector<const DependencyEdge *, 16> Seq; 312 DG.getCriticalSequence(Seq); 313 if (Seq.empty()) 318 const DependencyEdge &FirstEdge = *Seq[0]; 348 for (const DependencyEdge *&DE : Seq) {
|
H A D | BottleneckAnalysis.h | 277 void getCriticalSequence(SmallVectorImpl<const DependencyEdge *> &Seq) const;
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonGenInsert.cpp | 394 assert(Idx < Seq.size()); 395 return Seq[Idx]; 399 return Seq.size(); 405 iterator begin() { return Seq.begin(); } 406 iterator end() { return Seq.end(); } 407 const_iterator begin() const { return Seq.begin(); } 408 const_iterator end() const { return Seq.end(); } 414 ListType Seq; 444 iterator L = llvm::lower_bound(Seq, VR, Ord); 445 if (L == Seq [all...] |
H A D | HexagonConstExtenders.cpp | 141 void order(SmallVectorImpl<Node*> &Seq) const { 142 order(Root, Seq); 159 void order(Node *N, SmallVectorImpl<Node*> &Seq) const; 161 SmallVectorImpl<Node*> &Seq) const; 603 void RangeTree::order(Node *N, SmallVectorImpl<Node*> &Seq) const { 606 order(N->Left, Seq); 607 Seq.push_back(N); 608 order(N->Right, Seq); 612 SmallVectorImpl<Node*> &Seq) const { 615 nodesWith(N->Left, P, CheckA, Seq); [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | CodeGenSchedule.cpp | 572 RecVec Seq = RWDef->getValueAsListOfDefs("Writes"); local 573 for (Record *WSRec : Seq) 712 std::string CodeGenSchedModels::genRWName(ArrayRef<unsigned> Seq, bool IsRead) { argument 714 for (auto I = Seq.begin(), E = Seq.end(); I != E; ++I) { 715 if (I != Seq.begin()) 833 unsigned CodeGenSchedModels::findRWForSequence(ArrayRef<unsigned> Seq, argument 837 auto I = find_if(RWVec, [Seq](CodeGenSchedRW &RW) { 838 return makeArrayRef(RW.Sequence) == Seq; 845 unsigned CodeGenSchedModels::findOrInsertRW(ArrayRef<unsigned> Seq, argument 1554 SmallVectorImpl<unsigned> &Seq = RWSequences.back(); local 1701 SmallVectorImpl<unsigned> &Seq = LastTransitions[0].WriteSequences.back(); local 1710 SmallVectorImpl<unsigned> &Seq = LastTransitions[0].ReadSequences.back(); local [all...] |
H A D | CodeGenSchedule.h | 73 CodeGenSchedRW(unsigned Idx, bool Read, ArrayRef<unsigned> Seq, argument 76 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) { 567 unsigned findOrInsertRW(ArrayRef<unsigned> Seq, bool IsRead); 583 std::string genRWName(ArrayRef<unsigned> Seq, bool IsRead); 584 unsigned findRWForSequence(ArrayRef<unsigned> Seq, bool IsRead);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/DWARFLinker/ |
H A D | DWARFLinker.cpp | 1546 /// Insert the new line info sequence \p Seq into the current 1548 static void insertLineSequence(std::vector<DWARFDebugLine::Row> &Seq, argument 1550 if (Seq.empty()) 1553 if (!Rows.empty() && Rows.back().Address < Seq.front().Address) { 1554 Rows.insert(Rows.end(), Seq.begin(), Seq.end()); 1555 Seq.clear(); 1559 object::SectionedAddress Front = Seq.front().Address; 1569 *InsertPoint = Seq.front(); 1570 Rows.insert(InsertPoint + 1, Seq 1626 std::vector<DWARFDebugLine::Row> Seq; local [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/RISCV/ |
H A D | RISCVInstrInfo.cpp | 178 RISCVMatInt::InstSeq Seq; local 179 RISCVMatInt::generateInstSeq(Val, IsRV64, Seq); 180 assert(Seq.size() > 0); 182 for (RISCVMatInt::Inst &Inst : Seq) { 183 // Write the final result to DstReg if it's the last instruction in the Seq. 185 if (++Num == Seq.size())
|
H A D | RISCVISelDAGToDAG.cpp | 32 RISCVMatInt::InstSeq Seq; local 33 RISCVMatInt::generateInstSeq(Imm, XLenVT == MVT::i64, Seq); 37 for (RISCVMatInt::Inst &Inst : Seq) {
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFDebugLine.cpp | 1201 const DWARFDebugLine::Sequence &Seq, 1203 if (!Seq.containsPC(Address)) 1205 assert(Seq.SectionIndex == Address.SectionIndex); 1213 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex; 1214 RowIter LastRow = Rows.begin() + Seq.LastRowIndex; 1220 assert(Seq.SectionIndex == RowPos->Address.SectionIndex); 1200 findRowInSeq( const DWARFDebugLine::Sequence &Seq, object::SectionedAddress Address) const argument
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/TextAPI/MachO/ |
H A D | TextStub.cpp | 1080 static size_t size(IO &IO, std::vector<const MachO::InterfaceFile *> &Seq) { argument 1081 return Seq.size(); 1084 element(IO &IO, std::vector<const InterfaceFile *> &Seq, size_t Index) { argument 1085 if (Index >= Seq.size()) 1086 Seq.resize(Index + 1); 1087 return Seq[Index];
|
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/ |
H A D | CloneDetection.h | 294 size_t calculateStmtComplexity(const StmtSequence &Seq, std::size_t Limit,
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Format/ |
H A D | Format.cpp | 646 static size_t size(IO &IO, std::vector<FormatStyle> &Seq) { argument 647 return Seq.size(); 649 static FormatStyle &element(IO &IO, std::vector<FormatStyle> &Seq, argument 651 if (Index >= Seq.size()) { 652 assert(Index == Seq.size()); 654 if (!Seq.empty() && Seq[0].Language == FormatStyle::LK_None) { 655 Template = Seq[0]; 660 Seq.resize(Index + 1, Template); 662 return Seq[Inde [all...] |
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/ |
H A D | DWARFDebugLine.h | 291 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
|
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaInit.cpp | 1365 InitializationSequence Seq(SemaRef, TmpEntity, Kind, expr, 1374 if (Seq || isa<InitListExpr>(expr)) { 1376 ExprResult Result = Seq.Perform(SemaRef, TmpEntity, Kind, expr); 1382 } else if (!Seq) { 2397 InitializationSequence Seq(SemaRef, Entity, Kind, Init, 2402 : Seq.Perform(SemaRef, Entity, Kind, Init); 2407 return !Seq; 9665 InitializationSequence Seq(*this, Entity, Kind, InitE); 9666 return !Seq.Failed(); 9686 InitializationSequence Seq(*thi [all...] |
H A D | SemaStmt.cpp | 3088 InitializationSequence Seq(S, Entity, Kind, InitExpr); 3090 if (!Seq) 3093 for (const InitializationSequence::Step &Step : Seq.steps()) { 3141 Res = Seq.Perform(S, Entity, Kind, Value);
|
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/RISCV/AsmParser/ |
H A D | RISCVAsmParser.cpp | 2123 RISCVMatInt::InstSeq Seq; local 2124 RISCVMatInt::generateInstSeq(Value, isRV64(), Seq); 2127 for (RISCVMatInt::Inst &Inst : Seq) {
|