Searched refs:Sequence (Results 1 - 25 of 35) sorted by relevance

12

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MCA/
H A DSourceMgr.h30 ArrayRef<UniqueInst> Sequence;
37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {}
40 unsigned size() const { return Sequence.size(); }
41 bool hasNext() const { return Current < (Iterations * Sequence.size()); }
46 return SourceRef(Current, *Sequence[Current % Sequence.size()]);
50 const_iterator begin() const { return Sequence.begin(); }
51 const_iterator end() const { return Sequence.end(); }
H A DCodeEmitter.h46 ArrayRef<MCInst> Sequence; member in class:llvm::mca::CodeEmitter
60 : STI(ST), MAB(AB), MCE(CE), VecOS(Code), Sequence(S),
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPriorityQueue.h25 class Sequence = std::vector<T>,
26 class Compare = std::less<typename Sequence::value_type> >
27 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 const Sequence &sequence = Sequence())
31 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
37 const Sequence &sequence = Sequence())
38 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
48 typename Sequence
29 PriorityQueue(const Compare &compare = Compare(), const Sequence &sequence = Sequence()) argument
35 PriorityQueue(Iterator begin, Iterator end, const Compare &compare = Compare(), const Sequence &sequence = Sequence()) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/
H A DCodeEmitter.cpp25 const MCInst &Inst = Sequence[MCID];
26 MCInst Relaxed(Sequence[MCID]);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DPtrState.h10 // is only used by the ARC Sequence Dataflow computation. By separating this
36 /// \enum Sequence
40 enum Sequence { enum in namespace:llvm::objcarc
51 const Sequence S) LLVM_ATTRIBUTE_UNUSED;
148 void SetSeq(Sequence NewSeq);
150 Sequence GetSeq() const { return static_cast<Sequence>(Seq); }
154 void ResetSequenceProgress(Sequence NewSeq);
H A DPtrState.cpp36 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) {
57 // Sequence
60 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) {
137 void PtrState::SetSeq(Sequence NewSeq) {
143 void PtrState::ResetSequenceProgress(Sequence NewSeq) {
194 Sequence NewSeq = ReleaseMetadata ? S_MovableRelease : S_Release;
207 Sequence OldSeq = GetSeq();
225 llvm_unreachable("Sequence unknow
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugLine.h206 struct Sequence { struct in class:llvm::DWARFDebugLine
207 Sequence();
209 /// Sequence describes instructions at address range [LowPC, HighPC)
223 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) {
246 void appendSequence(const DWARFDebugLine::Sequence &S) {
290 using SequenceVector = std::vector<Sequence>;
298 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
379 struct Sequence Sequence; member in struct:llvm::DWARFDebugLine::ParsingState
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugLine.cpp414 DWARFDebugLine::Sequence::Sequence() { reset(); } function in class:DWARFDebugLine::Sequence
416 void DWARFDebugLine::Sequence::reset() {
457 Sequence.reset();
462 if (Sequence.Empty) {
464 Sequence.Empty = false;
465 Sequence.LowPC = Row.Address.Address;
466 Sequence.FirstRowIndex = RowNumber;
471 Sequence.HighPC = Row.Address.Address;
472 Sequence
955 DWARFDebugLine::Sequence Sequence; local
988 DWARFDebugLine::Sequence Sequence; local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp155 Sequence.push_back(SU);
184 Sequence.reserve(SUnits.size());
257 Sequence.push_back(nullptr); // NULL here means noop
H A DScheduleDAGSDNodes.h53 std::vector<SUnit*> Sequence; member in class:llvm::ScheduleDAGSDNodes
111 /// in the Sequence member.
116 /// consistent with the Sequence of scheduled instructions.
120 /// according to the order specified in Sequence.
H A DScheduleDAGFast.cpp187 Sequence.push_back(SU);
542 Sequence.reserve(SUnits.size());
629 std::reverse(Sequence.begin(), Sequence.end());
653 std::vector<SDNode*> Sequence; member in class:__anon1816::ScheduleDAGLinearize
671 Sequence.push_back(N);
757 Sequence.reserve(DAGSize);
768 unsigned NumNodes = Sequence.size();
771 SDNode *N = Sequence[NumNodes-i-1];
H A DScheduleDAGSDNodes.cpp60 Sequence.clear();
706 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
707 if (SUnit *SU = Sequence[i])
717 /// their state is consistent with the nodes listed in Sequence.
722 for (unsigned i = 0, e = Sequence.size(); i != e; ++i)
723 if (!Sequence[i])
725 assert(Sequence.size() - Noops == ScheduledNodes &&
887 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
888 SUnit *SU = Sequence[i];
H A DScheduleDAGRRList.cpp755 Sequence.push_back(SU);
930 unsigned LookAhead = std::min((unsigned)Sequence.size(),
935 std::vector<SUnit *>::const_iterator I = (Sequence.end() - LookAhead);
937 for (auto E = Sequence.end(); I != E; ++I) {
949 SUnit *OldSU = Sequence.back();
951 Sequence.pop_back();
958 OldSU = Sequence.back();
1611 Sequence.reserve(SUnits.size());
1633 std::reverse(Sequence.begin(), Sequence
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp135 std::vector<SUnit*> Sequence; member in class:__anon1785::SchedulePostRATDList
241 Sequence.clear();
255 /// dumpSchedule - dump the scheduled Sequence.
257 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
258 if (SUnit *SU = Sequence[i])
503 Sequence.push_back(SU);
517 Sequence.push_back(nullptr); // NULL here means noop
551 Sequence.reserve(SUnits.size());
663 for (unsigned i = 0, e = Sequence.size(); i != e; ++i)
664 if (!Sequence[
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaInit.cpp3754 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence,
3767 Sequence.AddZeroInitializationStep(Entity.getType());
3768 Sequence.SetZeroInitializationFixit(Init, Loc);
3775 InitializationSequence &Sequence,
3787 Sequence.AddProduceObjCObjectStep(Entity.getType());
3798 Sequence.AddProduceObjCObjectStep(Entity.getType());
3806 InitializationSequence &Sequence,
3817 InitializationSequence &Sequence,
3824 Sequence.setIncompleteTypeFailure(E);
3838 TryListInitialization(S, HiddenArray, Kind, List, Sequence,
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DPredicateExpander.cpp156 const RecVec &Sequence,
158 assert(!Sequence.empty() && "Found an invalid empty predicate set!");
159 if (Sequence.size() == 1)
160 return expandPredicate(OS, Sequence[0]);
169 for (const Record *Rec : Sequence) {
155 expandPredicateSequence(raw_ostream &OS, const RecVec &Sequence, bool IsCheckAll) argument
H A DCodeGenSchedule.h38 /// sequences. TheDef is nonnull for explicit SchedWrites, but Sequence may or
39 /// may not be empty. TheDef is null for inferred sequences, and Sequence must
53 IdxVec Sequence; member in struct:llvm::CodeGenSchedRW
68 // added. Note that implicit Reads (from ReadVariant) may have a Sequence
76 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) {
77 assert(Sequence.size() > 1 && "implied sequence needs >1 RWs");
83 assert((!IsSequence || !HasVariants) && "Sequence can't have variant");
84 assert((!IsSequence || !Sequence.empty()) && "Sequence should be nonempty");
86 return TheDef || !Sequence
[all...]
H A DPredicateExpander.h74 void expandPredicateSequence(raw_ostream &OS, const RecVec &Sequence,
H A DRegisterInfoEmitter.cpp779 SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; local
780 NextSIdx = SIdx + Sequence.size() + 1;
781 if (Sequence == IdxSequence) {
801 const SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; local
802 for (size_t p = 0, pe = Sequence.size(); p != pe; ++p) {
803 const MaskRolPair &P = Sequence[p];
810 OS << " // Sequence " << Idx << "\n";
811 Idx += Sequence.size() + 1;
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/
H A DCloneDetection.h381 VariablePattern(const StmtSequence &Sequence) { argument
382 for (const Stmt *S : Sequence)
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCloneDetection.cpp317 static void CollectStmtSequenceData(const StmtSequence &Sequence, argument
319 for (const Stmt *S : Sequence) {
321 S, Sequence.getASTContext(), OutputData);
327 CollectStmtSequenceData(StmtSequence(Child, Sequence.getContainingDecl()),
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZSelectionDAGInfo.cpp22 // address Dest. Sequence is the opcode to use for straight-line code
25 static SDValue emitMemMem(SelectionDAG &DAG, const SDLoc &DL, unsigned Sequence, argument
44 return DAG.getNode(Sequence, DL, MVT::Other, Chain, Dst, Src,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/BinaryFormat/
H A DMsgPackDocumentYAML.cpp154 return NodeKind::Sequence;
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-mca/Views/
H A DBottleneckAnalysis.h326 ArrayRef<MCInst> Sequence, unsigned Iterations);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DCore.cpp83 template <typename Sequence,
84 typename Pred = PrintAll<typename Sequence::value_type>>
87 SequencePrinter(const Sequence &S, char OpenSeq, char CloseSeq,
107 const Sequence &S;
113 template <typename Sequence, typename Pred>
114 SequencePrinter<Sequence, Pred> printSequence(const Sequence &S, char OpenSeq,
116 return SequencePrinter<Sequence, Pred>(S, OpenSeq, CloseSeq, std::move(P));
120 template <typename Sequence, typename Pred>
122 const SequencePrinter<Sequence, Pre
[all...]

Completed in 309 milliseconds

12