| /freebsd-12.1/contrib/llvm/include/llvm/ADT/ |
| H A D | PriorityQueue.h | 26 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-12.1/contrib/llvm/include/llvm/MCA/ |
| H A D | SourceMgr.h | 30 ArrayRef<UniqueInst> Sequence; variable 37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {} in SourceMgr() 40 unsigned size() const { return Sequence.size(); } in size() 41 bool hasNext() const { return Current < (Iterations * Sequence.size()); } in hasNext() 46 return SourceRef(Current, *Sequence[Current % Sequence.size()]); in peekNext() 50 const_iterator begin() const { return Sequence.begin(); } in begin() 51 const_iterator end() const { return Sequence.end(); } in end()
|
| /freebsd-12.1/contrib/llvm/lib/Transforms/ObjCARC/ |
| H A D | PtrState.cpp | 37 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) { in operator <<() 61 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) { in MergeSeqs() 138 void PtrState::SetSeq(Sequence NewSeq) { in SetSeq() 144 void PtrState::ResetSequenceProgress(Sequence NewSeq) { in ResetSequenceProgress() 195 Sequence NewSeq = ReleaseMetadata ? S_MovableRelease : S_Release; in InitBottomUp() 208 Sequence OldSeq = GetSeq(); in MatchWithRetain() 233 Sequence S = GetSeq(); in HandlePotentialAlterRefCount() 261 auto SetSeqAndInsertReverseInsertPt = [&](Sequence NewSeq){ in HandlePotentialUse() 352 Sequence OldSeq = GetSeq(); in MatchWithRelease()
|
| H A D | PtrState.h | 41 enum Sequence { enum 52 const Sequence S) LLVM_ATTRIBUTE_UNUSED; 149 void SetSeq(Sequence NewSeq); 151 Sequence GetSeq() const { return static_cast<Sequence>(Seq); } in GetSeq() 155 void ResetSequenceProgress(Sequence NewSeq);
|
| /freebsd-12.1/contrib/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFDebugLine.cpp | 385 DWARFDebugLine::Sequence::Sequence() { reset(); } in Sequence() function in DWARFDebugLine::Sequence 423 Sequence.reset(); in resetRowAndSequence() 427 if (Sequence.Empty) { in appendRowToMatrix() 429 Sequence.Empty = false; in appendRowToMatrix() 439 if (Sequence.isValid()) in appendRowToMatrix() 441 Sequence.reset(); in appendRowToMatrix() 885 DWARFDebugLine::Sequence Sequence; in lookupAddress() local 886 Sequence.LowPC = Address; in lookupAddress() 890 FirstSeq, LastSeq, Sequence, DWARFDebugLine::Sequence::orderByLowPC); in lookupAddress() 910 DWARFDebugLine::Sequence Sequence; in lookupAddressRange() local [all …]
|
| /freebsd-12.1/contrib/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFDebugLine.h | 189 struct Sequence { struct 190 Sequence(); 202 static bool orderByLowPC(const Sequence &LHS, const Sequence &RHS) { in orderByLowPC() argument 221 void appendSequence(const DWARFDebugLine::Sequence &S) { in appendSequence() argument 258 using SequenceVector = std::vector<Sequence>; 266 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq, 345 struct Sequence Sequence; member
|
| /freebsd-12.1/contrib/file/magic/Magdir/ |
| H A D | apache | 21 # 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 D | communications | 20 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 D | bioinformatics | 39 # 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-12.1/contrib/llvm/lib/CodeGen/ |
| H A D | PostRASchedulerList.cpp | 135 std::vector<SUnit*> Sequence; member in __anon0a44832d0111::SchedulePostRATDList 241 Sequence.clear(); in enterRegion() 257 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in dumpSchedule() 258 if (SUnit *SU = Sequence[i]) in dumpSchedule() 503 Sequence.push_back(SU); in ScheduleNodeTopDown() 517 Sequence.push_back(nullptr); // NULL here means noop in emitNoop() 551 Sequence.reserve(SUnits.size()); in ListScheduleTopDown() 663 for (unsigned i = 0, e = Sequence.size(); i != e; ++i) in ListScheduleTopDown() 664 if (!Sequence[i]) in ListScheduleTopDown() 666 assert(Sequence.size() - Noops == ScheduledNodes && in ListScheduleTopDown() [all …]
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/ |
| H A D | SemaInit.cpp | 3674 if (Sequence) in TryInitializerListConstruction() 4071 if (Sequence) in TryReferenceListInitialization() 4077 if (Sequence.step_begin() != Sequence.step_end()) in TryReferenceListInitialization() 4086 if (Sequence) { in TryReferenceListInitialization() 4091 Sequence.SetFailed( in TryReferenceListInitialization() 4165 if (Sequence) { in TryListInitialization() 4274 if (Sequence) in TryListInitialization() 4608 Sequence.SetFailed( in TryReferenceInitializationCore() 4631 Sequence.SetFailed(FK); in TryReferenceInitializationCore() 4719 Sequence.SetFailed( in TryReferenceInitializationCore() [all …]
|
| /freebsd-12.1/contrib/googletest/googlemock/include/gmock/ |
| H A D | gmock-spec-builders.h | 526 friend class Sequence; variable 628 class GTEST_API_ Sequence { 631 Sequence() : last_expectation_(new Expectation) {} in Sequence() function 846 friend class ::testing::Sequence; 947 TypedExpectation& InSequence(const Sequence& s) { in InSequence() 957 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2) { in InSequence() 960 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence() 964 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence() 965 const Sequence& s3, const Sequence& s4) { in InSequence() 968 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence() [all …]
|
| /freebsd-12.1/crypto/heimdal/lib/asn1/ |
| H A D | test.gen | 5 UNIV CONS Sequence 23 9 UNIV CONS Sequence 6
|
| /freebsd-12.1/tests/sys/fs/fusefs/ |
| H A D | notify.cc | 68 off_t size, Sequence &seq) in expect_lookup() 188 Sequence seq; in TEST_F() 228 Sequence seq; in TEST_F() 272 Sequence seq; in TEST_F() 336 Sequence seq; in TEST_F() 420 Sequence seq; in TEST_F() 458 Sequence seq; in TEST_F() 501 Sequence seq; in TEST_F()
|
| /freebsd-12.1/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGFast.cpp | 188 Sequence.push_back(SU); in ScheduleNodeBottomUp() 542 Sequence.reserve(SUnits.size()); in ListScheduleBottomUp() 629 std::reverse(Sequence.begin(), Sequence.end()); in ListScheduleBottomUp() 653 std::vector<SDNode*> Sequence; member in __anon78c511a10211::ScheduleDAGLinearize 671 Sequence.push_back(N); in ScheduleNode() 757 Sequence.reserve(DAGSize); in Schedule() 768 unsigned NumNodes = Sequence.size(); in EmitSchedule() 771 SDNode *N = Sequence[NumNodes-i-1]; in EmitSchedule()
|
| H A D | ScheduleDAGVLIW.cpp | 157 Sequence.push_back(SU); in scheduleNodeTopDown() 186 Sequence.reserve(SUnits.size()); in listScheduleTopDown() 259 Sequence.push_back(nullptr); // NULL here means noop in listScheduleTopDown()
|
| H A D | ScheduleDAGSDNodes.cpp | 61 Sequence.clear(); in Run() 688 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in dumpSchedule() 689 if (SUnit *SU = Sequence[i]) in dumpSchedule() 704 for (unsigned i = 0, e = Sequence.size(); i != e; ++i) in VerifyScheduledSequence() 705 if (!Sequence[i]) in VerifyScheduledSequence() 707 assert(Sequence.size() - Noops == ScheduledNodes && in VerifyScheduledSequence() 833 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in EmitSchedule() 834 SUnit *SU = Sequence[i]; in EmitSchedule()
|
| /freebsd-12.1/contrib/llvm/utils/TableGen/ |
| H A D | PredicateExpander.cpp | 157 const RecVec &Sequence, in expandPredicateSequence() argument 159 assert(!Sequence.empty() && "Found an invalid empty predicate set!"); in expandPredicateSequence() 160 if (Sequence.size() == 1) in expandPredicateSequence() 161 return expandPredicate(OS, Sequence[0]); in expandPredicateSequence() 170 for (const Record *Rec : Sequence) { in expandPredicateSequence()
|
| H A D | CodeGenSchedule.h | 54 IdxVec Sequence; member 77 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) { in CodeGenSchedRW() 78 assert(Sequence.size() > 1 && "implied sequence needs >1 RWs"); in CodeGenSchedRW() 85 assert((!IsSequence || !Sequence.empty()) && "Sequence should be nonempty"); in isValid() 87 return TheDef || !Sequence.empty(); in isValid()
|
| H A D | RegisterInfoEmitter.cpp | 780 SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; in emitComposeSubRegIndexLaneMask() local 781 NextSIdx = SIdx + Sequence.size() + 1; in emitComposeSubRegIndexLaneMask() 782 if (Sequence == IdxSequence) { in emitComposeSubRegIndexLaneMask() 802 const SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; in emitComposeSubRegIndexLaneMask() local 803 for (size_t p = 0, pe = Sequence.size(); p != pe; ++p) { in emitComposeSubRegIndexLaneMask() 804 const MaskRolPair &P = Sequence[p]; in emitComposeSubRegIndexLaneMask() 812 Idx += Sequence.size() + 1; in emitComposeSubRegIndexLaneMask()
|
| /freebsd-12.1/contrib/googletest/googlemock/test/ |
| H A D | gmock-spec-builders_test.cc | 387 Sequence s; in TEST() 400 Sequence s; in TEST() 412 Sequence s1, s2; in TEST() 423 Sequence s; in TEST() 438 Sequence s; in TEST() 1339 Sequence s; in TEST() 1363 Sequence s; in TEST() 1448 Sequence s; in TEST() 1473 Sequence s; in TEST() 1725 Sequence s; in TEST() [all …]
|
| H A D | gmock_output_test_.cc | 54 using testing::Sequence; 161 Sequence s1, s2; in TEST_F()
|
| /freebsd-12.1/contrib/llvm/tools/clang/lib/Analysis/ |
| H A D | CloneDetection.cpp | 319 static void CollectStmtSequenceData(const StmtSequence &Sequence, in CollectStmtSequenceData() argument 321 for (const Stmt *S : Sequence) { in CollectStmtSequenceData() 323 S, Sequence.getASTContext(), OutputData); in CollectStmtSequenceData() 329 CollectStmtSequenceData(StmtSequence(Child, Sequence.getContainingDecl()), in CollectStmtSequenceData()
|
| /freebsd-12.1/sys/teken/ |
| H A D | sequences | 30 # Name Sequence name (will be converted to C function name) 31 # Sequence Bytes that form the sequence 37 # Abbr Name Sequence Args
|
| /freebsd-12.1/contrib/llvm/tools/clang/include/clang/Analysis/ |
| H A D | CloneDetection.h | 382 VariablePattern(const StmtSequence &Sequence) { in VariablePattern() argument 383 for (const Stmt *S : Sequence) in VariablePattern()
|