Home
last modified time | relevance | path

Searched refs:Sequence (Results 1 – 25 of 109) sorted by relevance

12345

/freebsd/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::size_type i = find(this->c, t) - this->c.begin(); in erase_one()
53 typename Sequence::size_type parent = (i - 1) / 2; in erase_one()
/freebsd/contrib/llvm-project/lldb/include/lldb/Symbol/
H A DLineTable.h27 class Sequence;
38 LineTable(CompileUnit *comp_unit, std::vector<Sequence> &&sequences);
64 AppendLineEntryToSequence(Sequence &sequence, lldb::addr_t file_addr,
71 void InsertSequence(Sequence sequence);
290 class Sequence {
292 Sequence() = default;
296 Sequence(Sequence &&rhs) : m_entries(std::exchange(rhs.m_entries, {})) {} in Sequence() function
297 Sequence &operator=(Sequence &&rhs) {
301 Sequence(const Sequence &) = delete;
302 Sequence &operator=(const Sequence &) = delete;
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/MCA/
H A DSourceMgr.h60 ArrayRef<UniqueInst> Sequence; variable
67 : Sequence(S), Current(0U), Iterations(Iter ? Iter : DefaultIterations) {} in CircularSourceMgr()
69 ArrayRef<UniqueInst> getInstructions() const override { return Sequence; } in getInstructions()
73 return Current < (Iterations * Sequence.size()); in hasNext()
79 return SourceRef(Current, *Sequence[Current % Sequence.size()]); in peekNext()
H A DCodeEmitter.h40 ArrayRef<MCInst> Sequence; variable
54 : STI(ST), MCE(CE), Sequence(S), Encodings(S.size()) {} in CodeEmitter()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/
H A DPtrState.cpp37 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) { in operator <<()
59 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) { in MergeSeqs()
134 void PtrState::SetSeq(Sequence NewSeq) { in SetSeq()
140 void PtrState::ResetSequenceProgress(Sequence NewSeq) { in ResetSequenceProgress()
191 Sequence NewSeq = ReleaseMetadata ? S_MovableRelease : S_Stop; in InitBottomUp()
206 Sequence OldSeq = GetSeq(); in MatchWithRetain()
230 Sequence S = GetSeq(); in HandlePotentialAlterRefCount()
257 auto SetSeqAndInsertReverseInsertPt = [&](Sequence NewSeq){ in HandlePotentialUse()
353 Sequence OldSeq = GetSeq(); in MatchWithRelease()
H A DPtrState.h41 enum Sequence { enum
51 const Sequence S) LLVM_ATTRIBUTE_UNUSED;
148 void SetSeq(Sequence NewSeq);
150 Sequence GetSeq() const { return static_cast<Sequence>(Seq); } in GetSeq()
154 void ResetSequenceProgress(Sequence NewSeq);
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DNodes.td10 // The archetypes they fall into (Sequence, List etc) are defined in Syntax.td.
46 def ParenExpression : Sequence<Expression> {
62 def IntegerLiteralExpression : Sequence<LiteralExpression> {
74 def CharacterLiteralExpression : Sequence<LiteralExpression> {
82 def FloatingLiteralExpression : Sequence<LiteralExpression> {
94 def StringLiteralExpression : Sequence<LiteralExpression> {
105 def BoolLiteralExpression : Sequence<LiteralExpression> {
113 def CxxNullPtrExpression : Sequence<LiteralExpression> {
131 def IntegerUserDefinedLiteralExpression : Sequence<UserDefinedLiteralExpression> {
139 def FloatUserDefinedLiteralExpression : Sequence<UserDefinedLiteralExpression> {
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DDebugUtils.cpp79 template <typename Sequence,
80 typename Pred = PrintAll<typename Sequence::value_type>>
83 SequencePrinter(const Sequence &S, char OpenSeq, char CloseSeq, in SequencePrinter()
103 const Sequence &S;
109 template <typename Sequence, typename Pred>
110 SequencePrinter<Sequence, Pred> printSequence(const Sequence &S, char OpenSeq, in printSequence()
112 return SequencePrinter<Sequence, Pred>(S, OpenSeq, CloseSeq, std::move(P)); in printSequence()
116 template <typename Sequence, typename Pred>
118 const SequencePrinter<Sequence, Pred> &Printer) { in operator <<() argument
/freebsd/contrib/file/magic/Magdir/
H A Dapache21 # Sequence files (and the careless first version of RC file)
24 >3 byte <6 Apache Hadoop Sequence file version %d
25 >3 byte >6 Apache Hadoop Sequence file version %d
28 >>3 default x Apache Hadoop Sequence file version 6
H A Dcommunications20 0 string mscdocument Message Sequence Chart (document)
21 0 string msc Message Sequence Chart (chart)
22 0 string submsc Message Sequence Chart (subchart)
H A Dbioinformatics39 # BAM (Binary Sequence Alignment/Map format)
43 0 string BAM\1 SAMtools BAM (Binary Sequence Alignment/Map)
59 # CRAM (Binary Sequence Alignment/Map format)
144 # SAM (Sequence Alignment/Map format)
150 >4 search VN: Sequence Alignment/Map (SAM), with header
176 >>>>>>>>>>0 regex =^([^\t]+\t){10}[!-~]+ Sequence Alignment/Map (SAM)
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugLine.h198 struct Sequence { struct
199 LLVM_ABI Sequence();
218 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) { in orderByHighPC() argument
241 void appendSequence(const DWARFDebugLine::Sequence &S) { in appendSequence() argument
306 using SequenceVector = std::vector<Sequence>;
314 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
446 struct Sequence Sequence; member
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugLine.cpp525 DWARFDebugLine::Sequence::Sequence() { reset(); } in Sequence() function in DWARFDebugLine::Sequence
527 void DWARFDebugLine::Sequence::reset() { in reset()
569 Sequence.reset(); in resetRowAndSequence()
570 Sequence.StmtSeqOffset = Offset; in resetRowAndSequence()
575 if (Sequence.Empty) { in appendRowToMatrix()
577 Sequence.Empty = false; in appendRowToMatrix()
578 Sequence.LowPC = Row.Address.Address; in appendRowToMatrix()
579 Sequence.FirstRowIndex = RowNumber; in appendRowToMatrix()
584 Sequence.HighPC = Row.Address.Address; in appendRowToMatrix()
585 Sequence.LastRowIndex = RowNumber + 1; in appendRowToMatrix()
[all …]
/freebsd/contrib/llvm-project/clang/lib/Sema/
H A DSemaInit.cpp4211 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence, in maybeRecoverWithZeroInitialization() argument
4224 Sequence.AddZeroInitializationStep(Entity.getType()); in maybeRecoverWithZeroInitialization()
4225 Sequence.SetZeroInitializationFixit(Init, Loc); in maybeRecoverWithZeroInitialization()
4232 InitializationSequence &Sequence, in MaybeProduceObjCObject() argument
4244 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject()
4255 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject()
4262 QualType DestType, InitializationSequence &Sequence, in TryArrayCopy() argument
4266 Sequence.AddArrayInitStep(DestType, /*IsGNUExtension*/ false); in TryArrayCopy()
4279 Sequence.InitializeFrom(S, Element, Kind, OVEAsExpr, in TryArrayCopy()
4282 if (Sequence) in TryArrayCopy()
[all …]
/freebsd/contrib/googletest/googlemock/include/gmock/
H A Dgmock-spec-builders.h515 friend class Sequence; variable
615 class GTEST_API_ Sequence {
618 Sequence() : last_expectation_(new Expectation) {} in Sequence() function
669 GTEST_API_ extern ThreadLocal<Sequence*> g_gmock_implicit_sequence;
834 friend class ::testing::Sequence;
944 TypedExpectation& InSequence(const Sequence& s) { in InSequence()
954 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2) { in InSequence()
957 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence()
958 const Sequence& s3) { in InSequence()
961 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DPostRASchedulerList.cpp137 std::vector<SUnit *> Sequence; member in __anonf33d7a280111::SchedulePostRATDList
242 Sequence.clear(); in enterRegion()
258 for (const SUnit *SU : Sequence) { in dumpSchedule()
520 Sequence.push_back(SU); in ScheduleNodeTopDown()
534 Sequence.push_back(nullptr); // NULL here means noop in emitNoop()
568 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
679 unsigned Noops = llvm::count(Sequence, nullptr); in ListScheduleTopDown()
680 assert(Sequence.size() - Noops == ScheduledNodes && in ListScheduleTopDown()
694 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in EmitSchedule()
695 if (SUnit *SU = Sequence[i]) in EmitSchedule()
/freebsd/contrib/llvm-project/llvm/lib/CGData/
H A DOutlinedHashTree.cpp72 auto &[Sequence, Count] = SequencePair; in insert()
75 for (stable_hash StableHash : Sequence) { in insert()
119 OutlinedHashTree::find(const HashSequence &Sequence) const { in find()
121 for (stable_hash StableHash : Sequence) { in find()
/freebsd/crypto/heimdal/lib/asn1/
H A Dtest.gen5 UNIV CONS Sequence 23
9 UNIV CONS Sequence 6
/freebsd/contrib/llvm-project/llvm/lib/MC/
H A DDXContainerPSVInfo.cpp22 ArrayRef<uint32_t> Sequence) { in FindSequence() argument
23 if (Buffer.size() < Sequence.size()) in FindSequence()
25 for (size_t Idx = 0; Idx <= Buffer.size() - Sequence.size(); ++Idx) { in FindSequence()
27 static_cast<const void *>(Sequence.begin()), in FindSequence()
28 Sequence.size() * sizeof(uint32_t))) in FindSequence()
/freebsd/contrib/llvm-project/lldb/source/Symbol/
H A DLineTable.cpp24 LineTable::LineTable(CompileUnit *comp_unit, std::vector<Sequence> &&sequences) in LineTable()
28 for (const Sequence &seq : sequences) { in LineTable()
60 Sequence &sequence, lldb::addr_t file_addr, uint32_t line, uint16_t column, in AppendLineEntryToSequence()
92 void LineTable::InsertSequence(Sequence sequence) { in InsertSequence()
151 const Sequence &seq_a, const Sequence &seq_b) const { in operator ()()
378 Sequence sequence; in LinkLineTable()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DScheduleDAGFast.cpp177 Sequence.push_back(SU); in ScheduleNodeBottomUp()
545 Sequence.reserve(SUnits.size()); in ListScheduleBottomUp()
632 std::reverse(Sequence.begin(), Sequence.end()); in ListScheduleBottomUp()
656 std::vector<SDNode*> Sequence; member in __anon168f12fc0211::ScheduleDAGLinearize
674 Sequence.push_back(N); in ScheduleNode()
759 Sequence.reserve(DAGSize); in Schedule()
770 unsigned NumNodes = Sequence.size(); in EmitSchedule()
773 SDNode *N = Sequence[NumNodes-i-1]; in EmitSchedule()
H A DScheduleDAGVLIW.cpp146 Sequence.push_back(SU); in scheduleNodeTopDown()
175 Sequence.reserve(SUnits.size()); in listScheduleTopDown()
248 Sequence.push_back(nullptr); // NULL here means noop in listScheduleTopDown()
/freebsd/tests/sys/fs/fusefs/
H A Dnotify.cc72 off_t size, Sequence &seq) in expect_lookup()
192 Sequence seq; in TEST_P()
232 Sequence seq; in TEST_P()
276 Sequence seq; in TEST_P()
340 Sequence seq; in TEST_P()
445 Sequence seq; in TEST_P()
483 Sequence seq; in TEST_P()
526 Sequence seq; in TEST_P()
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/
H A DCodeGenSchedule.h59 IdxVec Sequence; member
82 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) { in CodeGenSchedRW()
83 assert(Sequence.size() > 1 && "implied sequence needs >1 RWs"); in CodeGenSchedRW()
90 assert((!IsSequence || !Sequence.empty()) && "Sequence should be nonempty"); in isValid()
92 return TheDef || !Sequence.empty(); in isValid()
H A DPredicateExpander.cpp174 raw_ostream &OS, ArrayRef<const Record *> Sequence, bool IsCheckAll) { in expandPredicateSequence() argument
175 assert(!Sequence.empty() && "Found an invalid empty predicate set!"); in expandPredicateSequence()
176 if (Sequence.size() == 1) in expandPredicateSequence()
177 return expandPredicate(OS, Sequence[0]); in expandPredicateSequence()
186 for (const Record *Rec : Sequence) { in expandPredicateSequence()

12345