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

123

/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/
H A DPriorityQueue.h26 class Sequence = std::vector<T>,
27 class Compare = std::less<typename Sequence::value_type> >
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
31 const Sequence &sequence = Sequence())
32 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
38 const Sequence &sequence = Sequence())
39 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
49 typename Sequence
30 PriorityQueue(const Compare &compare = Compare(), const Sequence &sequence = Sequence()) argument
36 PriorityQueue(Iterator begin, Iterator end, const Compare &compare = Compare(), const Sequence &sequence = Sequence()) argument
[all...]
/freebsd-current/contrib/llvm-project/llvm/include/llvm/MCA/
H A DSourceMgr.h60 ArrayRef<UniqueInst> Sequence; member in class:llvm::mca::CircularSourceMgr
67 : Sequence(S), Current(0U), Iterations(Iter ? Iter : DefaultIterations) {}
69 ArrayRef<UniqueInst> getInstructions() const override { return Sequence; }
73 return Current < (Iterations * Sequence.size());
79 return SourceRef(Current, *Sequence[Current % Sequence.size()]);
H A DCodeEmitter.h40 ArrayRef<MCInst> Sequence; member in class:llvm::mca::CodeEmitter
54 : STI(ST), MAB(AB), MCE(CE), Sequence(S), Encodings(S.size()) {}
/freebsd-current/contrib/llvm-project/llvm/lib/MCA/
H A DCodeEmitter.cpp24 const MCInst &Inst = Sequence[MCID];
25 MCInst Relaxed(Sequence[MCID]);
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DPtrState.h10 // is only used by the ARC Sequence Dataflow computation. By separating this
37 /// \enum Sequence
41 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.cpp37 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) {
56 // Sequence
59 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) {
134 void PtrState::SetSeq(Sequence NewSeq) {
140 void PtrState::ResetSequenceProgress(Sequence NewSeq) {
191 Sequence NewSeq = ReleaseMetadata ? S_MovableRelease : S_Stop;
206 Sequence OldSeq = GetSeq();
223 llvm_unreachable("Sequence unknow
[all...]
/freebsd-current/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-current/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugLine.h197 struct Sequence { struct in class:llvm::DWARFDebugLine
198 Sequence();
200 /// Sequence describes instructions at address range [LowPC, HighPC)
214 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) {
237 void appendSequence(const DWARFDebugLine::Sequence &S) {
290 using SequenceVector = std::vector<Sequence>;
298 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
415 struct Sequence Sequence; member in struct:llvm::DWARFDebugLine::ParsingState
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGVLIW.cpp150 Sequence.push_back(SU);
179 Sequence.reserve(SUnits.size());
252 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.cpp183 Sequence.push_back(SU);
552 Sequence.reserve(SUnits.size());
639 std::reverse(Sequence.begin(), Sequence.end());
663 std::vector<SDNode*> Sequence; member in class:__anon1954::ScheduleDAGLinearize
681 Sequence.push_back(N);
767 Sequence.reserve(DAGSize);
778 unsigned NumNodes = Sequence.size();
781 SDNode *N = Sequence[NumNodes-i-1];
/freebsd-current/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugLine.cpp510 DWARFDebugLine::Sequence::Sequence() { reset(); } function in class:DWARFDebugLine::Sequence
512 void DWARFDebugLine::Sequence::reset() {
555 Sequence.reset();
560 if (Sequence.Empty) {
562 Sequence.Empty = false;
563 Sequence.LowPC = Row.Address.Address;
564 Sequence.FirstRowIndex = RowNumber;
569 Sequence.HighPC = Row.Address.Address;
570 Sequence
1317 DWARFDebugLine::Sequence Sequence; local
1350 DWARFDebugLine::Sequence Sequence; local
[all...]
/freebsd-current/contrib/googletest/googlemock/include/gmock/
H A Dgmock-spec-builders.h515 friend class Sequence;
612 // Sequence objects are used by a user to specify the relative order
615 class GTEST_API_ Sequence {
618 Sequence() : last_expectation_(new Expectation) {}
621 // that no other thread is accessing this Sequence object.
627 }; // class Sequence
669 GTEST_API_ extern ThreadLocal<Sequence*> g_gmock_implicit_sequence;
834 friend class ::testing::Sequence;
944 TypedExpectation& InSequence(const Sequence& s) {
954 TypedExpectation& InSequence(const Sequence
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp131 std::vector<SUnit*> Sequence; member in class:__anon1926::SchedulePostRATDList
237 Sequence.clear();
251 /// dumpSchedule - dump the scheduled Sequence.
253 for (const SUnit *SU : Sequence) {
498 Sequence.push_back(SU);
512 Sequence.push_back(nullptr); // NULL here means noop
546 Sequence.reserve(SUnits.size());
657 unsigned Noops = llvm::count(Sequence, nullptr);
658 assert(Sequence.size() - Noops == ScheduledNodes &&
672 for (unsigned i = 0, e = Sequence
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/MC/
H A DDXContainerPSVInfo.cpp22 ArrayRef<uint32_t> Sequence) {
23 if (Buffer.size() < Sequence.size())
25 for (size_t Idx = 0; Idx <= Buffer.size() - Sequence.size(); ++Idx) {
27 static_cast<const void *>(Sequence.begin()),
28 Sequence.size() * sizeof(uint32_t)))
21 FindSequence(ArrayRef<uint32_t> Buffer, ArrayRef<uint32_t> Sequence) argument
/freebsd-current/contrib/llvm-project/clang/lib/Sema/
H A DSemaInit.cpp3982 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence,
3995 Sequence.AddZeroInitializationStep(Entity.getType());
3996 Sequence.SetZeroInitializationFixit(Init, Loc);
4003 InitializationSequence &Sequence,
4015 Sequence.AddProduceObjCObjectStep(Entity.getType());
4026 Sequence.AddProduceObjCObjectStep(Entity.getType());
4034 InitializationSequence &Sequence,
4045 InitializationSequence &Sequence,
4052 Sequence.setIncompleteTypeFailure(E);
4066 TryListInitialization(S, HiddenArray, Kind, List, Sequence,
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86FixupVectorConstants.cpp129 SmallVector<Constant *, 16> Sequence(NumScaleOps, nullptr);
135 if (!Sequence[SplatIdx] || Sequence[SplatIdx] == Elt) {
136 Sequence[SplatIdx] = Elt;
146 if (!Sequence[I])
148 if (std::optional<APInt> Bits = extractConstantBits(Sequence[I])) {
/freebsd-current/tests/sys/fs/fusefs/
H A Dnotify.cc66 off_t size, Sequence &seq)
186 Sequence seq;
226 Sequence seq;
270 Sequence seq;
334 Sequence seq;
418 Sequence seq;
456 Sequence seq;
499 Sequence seq;
H A Drmdir.cc80 Sequence seq;
/freebsd-current/contrib/llvm-project/clang/include/clang/Analysis/
H A DCloneDetection.h373 VariablePattern(const StmtSequence &Sequence) { argument
374 for (const Stmt *S : Sequence)
/freebsd-current/contrib/googletest/googlemock/test/
H A Dgmock_output_test_.cc50 using testing::Sequence;
155 Sequence s1, s2;
H A Dgmock_stress_test.cc151 Sequence s1, s2;
/freebsd-current/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenSchedule.h43 /// sequences. TheDef is nonnull for explicit SchedWrites, but Sequence may or
44 /// may not be empty. TheDef is null for inferred sequences, and Sequence must
58 IdxVec Sequence; member in struct:llvm::CodeGenSchedRW
73 // added. Note that implicit Reads (from ReadVariant) may have a Sequence
81 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) {
82 assert(Sequence.size() > 1 && "implied sequence needs >1 RWs");
88 assert((!IsSequence || !HasVariants) && "Sequence can't have variant");
89 assert((!IsSequence || !Sequence.empty()) && "Sequence should be nonempty");
91 return TheDef || !Sequence
[all...]
H A DPredicateExpander.cpp181 const RecVec &Sequence,
183 assert(!Sequence.empty() && "Found an invalid empty predicate set!");
184 if (Sequence.size() == 1)
185 return expandPredicate(OS, Sequence[0]);
194 for (const Record *Rec : Sequence) {
180 expandPredicateSequence(raw_ostream &OS, const RecVec &Sequence, bool IsCheckAll) argument
/freebsd-current/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()),

Completed in 335 milliseconds

123