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

12

/freebsd-13-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.h43 ArrayRef<MCInst> Sequence; member in class:llvm::mca::CodeEmitter
57 : STI(ST), MAB(AB), MCE(CE), VecOS(Code), Sequence(S),
/freebsd-13-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-13-stable/contrib/llvm-project/llvm/lib/MCA/
H A DCodeEmitter.cpp25 const MCInst &Inst = Sequence[MCID];
26 MCInst Relaxed(Sequence[MCID]);
/freebsd-13-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-13-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DDebugUtils.cpp80 template <typename Sequence,
81 typename Pred = PrintAll<typename Sequence::value_type>>
84 SequencePrinter(const Sequence &S, char OpenSeq, char CloseSeq,
104 const Sequence &S;
110 template <typename Sequence, typename Pred>
111 SequencePrinter<Sequence, Pred> printSequence(const Sequence &S, char OpenSeq,
113 return SequencePrinter<Sequence, Pred>(S, OpenSeq, CloseSeq, std::move(P));
117 template <typename Sequence, typename Pred>
119 const SequencePrinter<Sequence, Pre
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugLine.h199 struct Sequence { struct in class:llvm::DWARFDebugLine
200 Sequence();
202 /// Sequence describes instructions at address range [LowPC, HighPC)
216 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) {
239 void appendSequence(const DWARFDebugLine::Sequence &S) {
283 using SequenceVector = std::vector<Sequence>;
291 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
400 struct Sequence Sequence; member in struct:llvm::DWARFDebugLine::ParsingState
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugLine.cpp491 DWARFDebugLine::Sequence::Sequence() { reset(); } function in class:DWARFDebugLine::Sequence
493 void DWARFDebugLine::Sequence::reset() {
536 Sequence.reset();
541 if (Sequence.Empty) {
543 Sequence.Empty = false;
544 Sequence.LowPC = Row.Address.Address;
545 Sequence.FirstRowIndex = RowNumber;
550 Sequence.HighPC = Row.Address.Address;
551 Sequence
1242 DWARFDebugLine::Sequence Sequence; local
1275 DWARFDebugLine::Sequence Sequence; local
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp133 std::vector<SUnit*> Sequence; member in class:__anon3543::SchedulePostRATDList
239 Sequence.clear();
253 /// dumpSchedule - dump the scheduled Sequence.
255 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
256 if (SUnit *SU = Sequence[i])
501 Sequence.push_back(SU);
515 Sequence.push_back(nullptr); // NULL here means noop
549 Sequence.reserve(SUnits.size());
661 for (unsigned i = 0, e = Sequence.size(); i != e; ++i)
662 if (!Sequence[
[all...]
/freebsd-13-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 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:__anon3579::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.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 DScheduleDAGSDNodes.cpp61 Sequence.clear();
711 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
712 if (SUnit *SU = Sequence[i])
722 /// their state is consistent with the nodes listed in Sequence.
727 for (unsigned i = 0, e = Sequence.size(); i != e; ++i)
728 if (!Sequence[i])
730 assert(Sequence.size() - Noops == ScheduledNodes &&
897 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
898 SUnit *SU = Sequence[i];
/freebsd-13-stable/contrib/googletest/googlemock/include/gmock/
H A Dgmock-spec-builders.h526 friend class Sequence;
625 // Sequence objects are used by a user to specify the relative order
628 class GTEST_API_ Sequence {
631 Sequence() : last_expectation_(new Expectation) {}
634 // that no other thread is accessing this Sequence object.
639 // because Sequence objects are copyable and we want the copies to
643 }; // class Sequence
683 GTEST_API_ extern ThreadLocal<Sequence*> g_gmock_implicit_sequence;
846 friend class ::testing::Sequence;
947 TypedExpectation& InSequence(const Sequence
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/lib/Sema/
H A DSemaInit.cpp3772 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence,
3785 Sequence.AddZeroInitializationStep(Entity.getType());
3786 Sequence.SetZeroInitializationFixit(Init, Loc);
3793 InitializationSequence &Sequence,
3805 Sequence.AddProduceObjCObjectStep(Entity.getType());
3816 Sequence.AddProduceObjCObjectStep(Entity.getType());
3824 InitializationSequence &Sequence,
3835 InitializationSequence &Sequence,
3842 Sequence.setIncompleteTypeFailure(E);
3856 TryListInitialization(S, HiddenArray, Kind, List, Sequence,
[all...]
/freebsd-13-stable/tests/sys/fs/fusefs/
H A Dnotify.cc68 off_t size, Sequence &seq)
188 Sequence seq;
228 Sequence seq;
272 Sequence seq;
336 Sequence seq;
420 Sequence seq;
458 Sequence seq;
501 Sequence seq;
H A Drmdir.cc82 Sequence seq;
/freebsd-13-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,
/freebsd-13-stable/contrib/googletest/googlemock/test/
H A Dgmock_output_test_.cc54 using testing::Sequence;
161 Sequence s1, s2;
H A Dgmock-spec-builders_test.cc92 using testing::Sequence;
388 Sequence s;
401 Sequence s;
413 Sequence s1, s2;
424 Sequence s;
439 Sequence s;
1122 Sequence s1, s2;
1340 Sequence s;
1364 Sequence s;
1389 Sequence
[all...]
/freebsd-13-stable/contrib/llvm-project/clang/include/clang/Analysis/
H A DCloneDetection.h381 VariablePattern(const StmtSequence &Sequence) { argument
382 for (const Stmt *S : Sequence)
/freebsd-13-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCloneDetection.cpp318 static void CollectStmtSequenceData(const StmtSequence &Sequence, argument
320 for (const Stmt *S : Sequence) {
322 S, Sequence.getASTContext(), OutputData);
328 CollectStmtSequenceData(StmtSequence(Child, Sequence.getContainingDecl()),

Completed in 403 milliseconds

12