| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| H A D | PriorityQueue.h | 25 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::size_type i = find(this->c, t) - this->c.begin(); in erase_one()
52 typename Sequence::size_type parent = (i - 1) / 2; in erase_one()
|
| /netbsd-src/external/apache2/llvm/dist/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()
|
| H A D | CodeEmitter.h | 42 ArrayRef<MCInst> Sequence; variable
56 : STI(ST), MAB(AB), MCE(CE), VecOS(Code), Sequence(S), in CodeEmitter()
|
| /netbsd-src/external/apache2/llvm/dist/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);
|
| /netbsd-src/external/apache2/llvm/dist/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 …]
|
| /netbsd-src/external/apache2/llvm/dist/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
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| H A D | DWARFDebugLine.h | 201 struct Sequence { struct
202 Sequence();
218 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) { in orderByHighPC() argument
241 void appendSequence(const DWARFDebugLine::Sequence &S) { in appendSequence() argument
289 using SequenceVector = std::vector<Sequence>;
297 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
404 struct Sequence Sequence; member
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| H A D | DWARFDebugLine.cpp | 503 DWARFDebugLine::Sequence::Sequence() { reset(); } in Sequence() function in DWARFDebugLine::Sequence
505 void DWARFDebugLine::Sequence::reset() { in reset()
548 Sequence.reset(); in resetRowAndSequence()
553 if (Sequence.Empty) { in appendRowToMatrix()
555 Sequence.Empty = false; in appendRowToMatrix()
556 Sequence.LowPC = Row.Address.Address; in appendRowToMatrix()
557 Sequence.FirstRowIndex = RowNumber; in appendRowToMatrix()
562 Sequence.HighPC = Row.Address.Address; in appendRowToMatrix()
563 Sequence.LastRowIndex = RowNumber + 1; in appendRowToMatrix()
564 Sequence.SectionIndex = Row.Address.SectionIndex; in appendRowToMatrix()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| H A D | PostRASchedulerList.cpp | 133 std::vector<SUnit*> Sequence; member in __anon3e4a0d930111::SchedulePostRATDList
239 Sequence.clear(); in enterRegion()
255 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in dumpSchedule()
256 if (SUnit *SU = Sequence[i]) in dumpSchedule()
501 Sequence.push_back(SU); in ScheduleNodeTopDown()
515 Sequence.push_back(nullptr); // NULL here means noop in emitNoop()
549 Sequence.reserve(SUnits.size()); in ListScheduleTopDown()
661 for (unsigned i = 0, e = Sequence.size(); i != e; ++i) in ListScheduleTopDown()
662 if (!Sequence[i]) in ListScheduleTopDown()
664 assert(Sequence.size() - Noops == ScheduledNodes && in ListScheduleTopDown()
[all …]
|
| /netbsd-src/external/bsd/file/dist/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)
|
| /netbsd-src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/include/gmock/ |
| H A D | gmock-spec-builders.h | 531 friend class Sequence; variable
632 class GTEST_API_ Sequence {
635 Sequence() : last_expectation_(new Expectation) {} in Sequence() function
684 GTEST_API_ extern ThreadLocal<Sequence*> g_gmock_implicit_sequence;
848 friend class ::testing::Sequence;
948 TypedExpectation& InSequence(const Sequence& s) { in InSequence()
958 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2) { in InSequence()
961 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence()
962 const Sequence& s3) { in InSequence()
965 TypedExpectation& InSequence(const Sequence& s1, const Sequence& s2, in InSequence()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Sema/ |
| H A D | SemaInit.cpp | 3814 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence, in maybeRecoverWithZeroInitialization() argument
3827 Sequence.AddZeroInitializationStep(Entity.getType()); in maybeRecoverWithZeroInitialization()
3828 Sequence.SetZeroInitializationFixit(Init, Loc); in maybeRecoverWithZeroInitialization()
3835 InitializationSequence &Sequence, in MaybeProduceObjCObject() argument
3847 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject()
3858 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject()
3866 InitializationSequence &Sequence,
3877 InitializationSequence &Sequence, in TryInitializerListConstruction() argument
3884 Sequence.setIncompleteTypeFailure(E); in TryInitializerListConstruction()
3898 TryListInitialization(S, HiddenArray, Kind, List, Sequence, in TryInitializerListConstruction()
[all …]
|
| /netbsd-src/crypto/external/bsd/heimdal/dist/lib/asn1/ |
| H A D | test.gen | 5 UNIV CONS Sequence 23
9 UNIV CONS Sequence 6
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/MCA/ |
| H A D | CodeEmitter.cpp | 25 const MCInst &Inst = Sequence[MCID]; in getOrCreateEncodingInfo()
26 MCInst Relaxed(Sequence[MCID]); in getOrCreateEncodingInfo()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | ScheduleDAGFast.cpp | 187 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 __anon50dbaec70211::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 | 154 Sequence.push_back(SU); in scheduleNodeTopDown()
183 Sequence.reserve(SUnits.size()); in listScheduleTopDown()
256 Sequence.push_back(nullptr); // NULL here means noop in listScheduleTopDown()
|
| H A D | ScheduleDAGSDNodes.cpp | 61 Sequence.clear(); in Run()
710 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in dumpSchedule()
711 if (SUnit *SU = Sequence[i]) in dumpSchedule()
726 for (unsigned i = 0, e = Sequence.size(); i != e; ++i) in VerifyScheduledSequence()
727 if (!Sequence[i]) in VerifyScheduledSequence()
729 assert(Sequence.size() - Noops == ScheduledNodes && in VerifyScheduledSequence()
915 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in EmitSchedule()
916 SUnit *SU = Sequence[i]; in EmitSchedule()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| H A D | PredicateExpander.cpp | 156 const RecVec &Sequence, in expandPredicateSequence() argument
158 assert(!Sequence.empty() && "Found an invalid empty predicate set!"); in expandPredicateSequence()
159 if (Sequence.size() == 1) in expandPredicateSequence()
160 return expandPredicate(OS, Sequence[0]); in expandPredicateSequence()
169 for (const Record *Rec : Sequence) { in expandPredicateSequence()
|
| H A D | CodeGenSchedule.h | 55 IdxVec Sequence; member
78 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) { in CodeGenSchedRW()
79 assert(Sequence.size() > 1 && "implied sequence needs >1 RWs"); in CodeGenSchedRW()
86 assert((!IsSequence || !Sequence.empty()) && "Sequence should be nonempty"); in isValid()
88 return TheDef || !Sequence.empty(); in isValid()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| H A D | CloneDetection.cpp | 318 static void CollectStmtSequenceData(const StmtSequence &Sequence, in CollectStmtSequenceData() argument
320 for (const Stmt *S : Sequence) { in CollectStmtSequenceData()
322 S, Sequence.getASTContext(), OutputData); in CollectStmtSequenceData()
328 CollectStmtSequenceData(StmtSequence(Child, Sequence.getContainingDecl()), in CollectStmtSequenceData()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libphobos/src/std/regex/internal/ |
| H A D | tests.d | 13 alias Sequence(int B, int E) = staticIota!(B, E);
411 alias Tests = Sequence!(0, 155); in ct_tests()
416 alias Tests = Sequence!(155, 174); in ct_tests()
422 alias Tests = Sequence!(178, 220); in ct_tests()
427 alias Tests = Sequence!(220, tv.length); in ct_tests()
430 alias Tests = AliasSeq!(Sequence!(0, 30), Sequence!(235, tv.length-5)); in ct_tests()
|
| /netbsd-src/external/gpl2/texinfo/dist/util/ |
| H A D | prepinfo.awk | 160 List[++Sequence] = Name
309 for (i = 1; i <= Sequence; i++)
|