/freebsd/contrib/llvm-project/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/contrib/llvm-project/llvm/include/llvm/MCA/ |
H A D | SourceMgr.h | 60 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 D | CodeEmitter.h | 40 ArrayRef<MCInst> Sequence; variable 54 : STI(ST), MAB(AB), MCE(CE), Sequence(S), Encodings(S.size()) {} in CodeEmitter()
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | PtrState.cpp | 37 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 D | PtrState.h | 41 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 D | Nodes.td | 10 // 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 D | DebugUtils.cpp | 80 template <typename Sequence, 81 typename Pred = PrintAll<typename Sequence::value_type>> 84 SequencePrinter(const Sequence &S, char OpenSeq, char CloseSeq, in SequencePrinter() 104 const Sequence &S; 110 template <typename Sequence, typename Pred> 111 SequencePrinter<Sequence, Pred> printSequence(const Sequence &S, char OpenSeq, in printSequence() 113 return SequencePrinter<Sequence, Pred>(S, OpenSeq, CloseSeq, std::move(P)); in printSequence() 117 template <typename Sequence, typename Pred> 119 const SequencePrinter<Sequence, Pred> &Printer) { in operator <<() argument
|
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/ |
H A D | DWARFDebugLine.h | 197 struct Sequence { struct 198 Sequence(); 214 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) { in orderByHighPC() argument 237 void appendSequence(const DWARFDebugLine::Sequence &S) { in appendSequence() argument 290 using SequenceVector = std::vector<Sequence>; 298 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq, 415 struct Sequence Sequence; member
|
/freebsd/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/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/ |
H A D | DWARFDebugLine.cpp | 526 DWARFDebugLine::Sequence::Sequence() { reset(); } in Sequence() function in DWARFDebugLine::Sequence 528 void DWARFDebugLine::Sequence::reset() { in reset() 571 Sequence.reset(); in resetRowAndSequence() 576 if (Sequence.Empty) { in appendRowToMatrix() 578 Sequence.Empty = false; in appendRowToMatrix() 579 Sequence.LowPC = Row.Address.Address; in appendRowToMatrix() 580 Sequence.FirstRowIndex = RowNumber; in appendRowToMatrix() 585 Sequence.HighPC = Row.Address.Address; in appendRowToMatrix() 586 Sequence.LastRowIndex = RowNumber + 1; in appendRowToMatrix() 587 Sequence.SectionIndex = Row.Address.SectionIndex; in appendRowToMatrix() [all …]
|
/freebsd/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaInit.cpp | 4119 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence, in maybeRecoverWithZeroInitialization() argument 4132 Sequence.AddZeroInitializationStep(Entity.getType()); in maybeRecoverWithZeroInitialization() 4133 Sequence.SetZeroInitializationFixit(Init, Loc); in maybeRecoverWithZeroInitialization() 4140 InitializationSequence &Sequence, in MaybeProduceObjCObject() argument 4152 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject() 4163 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject() 4171 InitializationSequence &Sequence, 4182 InitializationSequence &Sequence, in TryInitializerListConstruction() argument 4189 Sequence.setIncompleteTypeFailure(E); in TryInitializerListConstruction() 4203 TryListInitialization(S, HiddenArray, Kind, List, Sequence, in TryInitializerListConstruction() [all …]
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | PostRASchedulerList.cpp | 131 std::vector<SUnit*> Sequence; member in __anonf33d7a280111::SchedulePostRATDList 237 Sequence.clear(); in enterRegion() 253 for (const SUnit *SU : Sequence) { in dumpSchedule() 498 Sequence.push_back(SU); in ScheduleNodeTopDown() 512 Sequence.push_back(nullptr); // NULL here means noop in emitNoop() 546 Sequence.reserve(SUnits.size()); in ListScheduleTopDown() 657 unsigned Noops = llvm::count(Sequence, nullptr); in ListScheduleTopDown() 658 assert(Sequence.size() - Noops == ScheduledNodes && in ListScheduleTopDown() 672 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in EmitSchedule() 673 if (SUnit *SU = Sequence[i]) in EmitSchedule()
|
/freebsd/contrib/googletest/googlemock/include/gmock/ |
H A D | gmock-spec-builders.h | 515 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/CodeGenData/ |
H A D | OutlinedHashTree.cpp | 72 auto &[Sequence, Count] = SequencePair; in insert() 75 for (stable_hash StableHash : Sequence) { in insert() 120 OutlinedHashTree::find(const HashSequence &Sequence) const { in find() 122 for (stable_hash StableHash : Sequence) { in find()
|
/freebsd/crypto/heimdal/lib/asn1/ |
H A D | test.gen | 5 UNIV CONS Sequence 23 9 UNIV CONS Sequence 6
|
/freebsd/contrib/llvm-project/llvm/lib/MCA/ |
H A D | CodeEmitter.cpp | 24 const MCInst &Inst = Sequence[MCID]; in getOrCreateEncodingInfo() 25 MCInst Relaxed(Sequence[MCID]); in getOrCreateEncodingInfo()
|
/freebsd/contrib/llvm-project/llvm/lib/MC/ |
H A D | DXContainerPSVInfo.cpp | 22 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/tests/sys/fs/fusefs/ |
H A D | notify.cc | 65 off_t size, Sequence &seq) in expect_lookup() 185 Sequence seq; in TEST_F() 225 Sequence seq; in TEST_F() 269 Sequence seq; in TEST_F() 333 Sequence seq; in TEST_F() 417 Sequence seq; in TEST_F() 455 Sequence seq; in TEST_F() 498 Sequence seq; in TEST_F()
|
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
H A D | ScheduleDAGFast.cpp | 183 Sequence.push_back(SU); in ScheduleNodeBottomUp() 552 Sequence.reserve(SUnits.size()); in ListScheduleBottomUp() 639 std::reverse(Sequence.begin(), Sequence.end()); in ListScheduleBottomUp() 663 std::vector<SDNode*> Sequence; member in __anon168f12fc0211::ScheduleDAGLinearize 681 Sequence.push_back(N); in ScheduleNode() 766 Sequence.reserve(DAGSize); in Schedule() 777 unsigned NumNodes = Sequence.size(); in EmitSchedule() 780 SDNode *N = Sequence[NumNodes-i-1]; in EmitSchedule()
|
H A D | ScheduleDAGVLIW.cpp | 150 Sequence.push_back(SU); in scheduleNodeTopDown() 179 Sequence.reserve(SUnits.size()); in listScheduleTopDown() 252 Sequence.push_back(nullptr); // NULL here means noop in listScheduleTopDown()
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/Common/ |
H A D | PredicateExpander.cpp | 180 const RecVec &Sequence, in expandPredicateSequence() argument 182 assert(!Sequence.empty() && "Found an invalid empty predicate set!"); in expandPredicateSequence() 183 if (Sequence.size() == 1) in expandPredicateSequence() 184 return expandPredicate(OS, Sequence[0]); in expandPredicateSequence() 193 for (const Record *Rec : Sequence) { in expandPredicateSequence()
|
H A D | CodeGenSchedule.h | 58 IdxVec Sequence; member 81 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) { in CodeGenSchedRW() 82 assert(Sequence.size() > 1 && "implied sequence needs >1 RWs"); in CodeGenSchedRW() 89 assert((!IsSequence || !Sequence.empty()) && "Sequence should be nonempty"); in isValid() 91 return TheDef || !Sequence.empty(); in isValid()
|
/freebsd/contrib/llvm-project/clang/lib/Analysis/ |
H A D | CloneDetection.cpp | 317 static void CollectStmtSequenceData(const StmtSequence &Sequence, in CollectStmtSequenceData() argument 319 for (const Stmt *S : Sequence) { in CollectStmtSequenceData() 321 S, Sequence.getASTContext(), OutputData); in CollectStmtSequenceData() 327 CollectStmtSequenceData(StmtSequence(Child, Sequence.getContainingDecl()), in CollectStmtSequenceData()
|