| /NextBSD/contrib/llvm/include/llvm/ADT/ |
| HD | 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 = in erase_one() 54 typename Sequence::size_type parent = (i - 1) / 2; in erase_one()
|
| /NextBSD/contrib/llvm/lib/DebugInfo/DWARF/ |
| HD | DWARFDebugLine.cpp | 169 DWARFDebugLine::Sequence::Sequence() { in Sequence() function in DWARFDebugLine::Sequence 173 void DWARFDebugLine::Sequence::reset() { in reset() 212 Sequence.reset(); in resetRowAndSequence() 216 if (Sequence.Empty) { in appendRowToMatrix() 218 Sequence.Empty = false; in appendRowToMatrix() 219 Sequence.LowPC = Row.Address; in appendRowToMatrix() 220 Sequence.FirstRowIndex = RowNumber; in appendRowToMatrix() 226 Sequence.HighPC = Row.Address; in appendRowToMatrix() 227 Sequence.LastRowIndex = RowNumber; in appendRowToMatrix() 228 if (Sequence.isValid()) in appendRowToMatrix() [all …]
|
| /NextBSD/contrib/llvm/include/llvm/DebugInfo/DWARF/ |
| HD | DWARFDebugLine.h | 148 struct Sequence { struct 157 Sequence(); argument 160 static bool orderByLowPC(const Sequence& LHS, const Sequence& RHS) { in orderByLowPC() argument 180 void appendSequence(const DWARFDebugLine::Sequence &S) { in appendSequence() argument 213 typedef std::vector<Sequence> SequenceVector; 219 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &seq, 240 struct Sequence Sequence; member
|
| /NextBSD/contrib/llvm/lib/Transforms/ObjCARC/ |
| HD | PtrState.cpp | 25 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) { in operator <<() 49 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) { in MergeSeqs() 126 void PtrState::SetSeq(Sequence NewSeq) { in SetSeq() 131 void PtrState::ResetSequenceProgress(Sequence NewSeq) { in ResetSequenceProgress() 181 Sequence NewSeq = ReleaseMetadata ? S_MovableRelease : S_Release; in InitBottomUp() 194 Sequence OldSeq = GetSeq(); in MatchWithRetain() 219 Sequence S = GetSeq(); in HandlePotentialAlterRefCount() 325 Sequence OldSeq = GetSeq(); in MatchWithRelease()
|
| HD | PtrState.h | 37 enum Sequence { enum 48 const Sequence S) LLVM_ATTRIBUTE_UNUSED; 147 void SetSeq(Sequence NewSeq); 149 Sequence GetSeq() const { return static_cast<Sequence>(Seq); } in GetSeq() 153 void ResetSequenceProgress(Sequence NewSeq);
|
| HD | ObjCARCOpts.cpp | 935 static void CheckForUseCFGHazard(const Sequence SuccSSeq, in CheckForUseCFGHazard() 973 static void CheckForCanReleaseCFGHazard(const Sequence SuccSSeq, in CheckForCanReleaseCFGHazard() 1011 const Sequence Seq = I->second.GetSeq(); in CheckForCFGHazards() 1037 const Sequence SuccSSeq = SuccS.GetSeq(); in CheckForCFGHazards()
|
| /NextBSD/contrib/llvm/lib/CodeGen/ |
| HD | PostRASchedulerList.cpp | 129 std::vector<SUnit*> Sequence; member in __anon6a5547170111::SchedulePostRATDList 228 Sequence.clear(); in enterRegion() 244 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in dumpSchedule() 245 if (SUnit *SU = Sequence[i]) in dumpSchedule() 484 Sequence.push_back(SU); in ScheduleNodeTopDown() 498 Sequence.push_back(nullptr); // NULL here means noop in emitNoop() 532 Sequence.reserve(SUnits.size()); in ListScheduleTopDown() 641 for (unsigned i = 0, e = Sequence.size(); i != e; ++i) in ListScheduleTopDown() 642 if (!Sequence[i]) in ListScheduleTopDown() 644 assert(Sequence.size() - Noops == ScheduledNodes && in ListScheduleTopDown() [all …]
|
| /NextBSD/contrib/llvm/tools/clang/lib/Sema/ |
| HD | SemaInit.cpp | 3260 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence, in maybeRecoverWithZeroInitialization() argument 3273 Sequence.AddZeroInitializationStep(Entity.getType()); in maybeRecoverWithZeroInitialization() 3274 Sequence.SetZeroInitializationFixit(Init, Loc); in maybeRecoverWithZeroInitialization() 3281 InitializationSequence &Sequence, in MaybeProduceObjCObject() argument 3293 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject() 3303 Sequence.AddProduceObjCObjectStep(Entity.getType()); in MaybeProduceObjCObject() 3311 InitializationSequence &Sequence); 3321 InitializationSequence &Sequence) { in TryInitializerListConstruction() argument 3327 Sequence.setIncompleteTypeFailure(E); in TryInitializerListConstruction() 3340 TryListInitialization(S, HiddenArray, Kind, List, Sequence); in TryInitializerListConstruction() [all …]
|
| /NextBSD/contrib/file/magic/Magdir/ |
| HD | 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)
|
| /NextBSD/crypto/heimdal/lib/asn1/ |
| HD | test.gen | 5 UNIV CONS Sequence 23 9 UNIV CONS Sequence 6
|
| /NextBSD/contrib/llvm/utils/TableGen/ |
| HD | 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()
|
| HD | RegisterInfoEmitter.cpp | 717 SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; in emitComposeSubRegIndexLaneMask() local 718 NextSIdx = SIdx + Sequence.size() + 1; in emitComposeSubRegIndexLaneMask() 719 if (Sequence == IdxSequence) { in emitComposeSubRegIndexLaneMask() 743 const SmallVectorImpl<MaskRolPair> &Sequence = Sequences[s]; in emitComposeSubRegIndexLaneMask() local 744 for (size_t p = 0, pe = Sequence.size(); p != pe; ++p) { in emitComposeSubRegIndexLaneMask() 745 const MaskRolPair &P = Sequence[p]; in emitComposeSubRegIndexLaneMask() 752 Idx += Sequence.size() + 1; in emitComposeSubRegIndexLaneMask()
|
| HD | CodeGenSchedule.cpp | 293 findRWs(WI->TheDef->getValueAsListOfDefs("Writes"), WI->Sequence, in collectSchedRW() 411 for (IdxIter I = SchedRW.Sequence.begin(), E = SchedRW.Sequence.end(); in expandRWSequence() 452 for (IdxIter I = SchedWrite.Sequence.begin(), E = SchedWrite.Sequence.end(); in expandRWSeqForProc() 466 if (I->Sequence == Seq) in findRWForSequence() 1722 dumpIdxVec(Sequence); in dump()
|
| /NextBSD/contrib/llvm/lib/CodeGen/SelectionDAG/ |
| HD | ScheduleDAGFast.cpp | 189 Sequence.push_back(SU); in ScheduleNodeBottomUp() 550 Sequence.reserve(SUnits.size()); in ListScheduleBottomUp() 637 std::reverse(Sequence.begin(), Sequence.end()); in ListScheduleBottomUp() 661 std::vector<SDNode*> Sequence; member in __anona909dccb0211::ScheduleDAGLinearize 679 Sequence.push_back(N); in ScheduleNode() 766 Sequence.reserve(DAGSize); in Schedule() 780 unsigned NumNodes = Sequence.size(); in EmitSchedule() 782 SDNode *N = Sequence[NumNodes-i-1]; in EmitSchedule()
|
| HD | ScheduleDAGVLIW.cpp | 158 Sequence.push_back(SU); in scheduleNodeTopDown() 187 Sequence.reserve(SUnits.size()); in listScheduleTopDown() 260 Sequence.push_back(nullptr); // NULL here means noop in listScheduleTopDown()
|
| HD | ScheduleDAGSDNodes.cpp | 60 Sequence.clear(); in Run() 675 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in dumpSchedule() 676 if (SUnit *SU = Sequence[i]) in dumpSchedule() 691 for (unsigned i = 0, e = Sequence.size(); i != e; ++i) in VerifyScheduledSequence() 692 if (!Sequence[i]) in VerifyScheduledSequence() 694 assert(Sequence.size() - Noops == ScheduledNodes && in VerifyScheduledSequence() 817 for (unsigned i = 0, e = Sequence.size(); i != e; i++) { in EmitSchedule() 818 SUnit *SU = Sequence[i]; in EmitSchedule()
|
| HD | ScheduleDAGSDNodes.h | 43 std::vector<SUnit*> Sequence; variable
|
| HD | ScheduleDAGRRList.cpp | 725 Sequence.push_back(SU); in ScheduleNodeBottomUp() 895 unsigned LookAhead = std::min((unsigned)Sequence.size(), in RestoreHazardCheckerBottomUp() 900 std::vector<SUnit*>::const_iterator I = (Sequence.end() - LookAhead); in RestoreHazardCheckerBottomUp() 902 for (std::vector<SUnit*>::const_iterator E = Sequence.end(); I != E; ++I) { in RestoreHazardCheckerBottomUp() 914 SUnit *OldSU = Sequence.back(); in BacktrackBottomUp() 916 Sequence.pop_back(); in BacktrackBottomUp() 923 OldSU = Sequence.back(); in BacktrackBottomUp() 1511 Sequence.reserve(SUnits.size()); in ListScheduleBottomUp() 1532 std::reverse(Sequence.begin(), Sequence.end()); in ListScheduleBottomUp()
|
| /NextBSD/sys/teken/ |
| HD | sequences | 30 # Name Sequence name (will be converted to C function name) 31 # Sequence Bytes that form the sequence 37 # Abbr Name Sequence Arguments
|
| /NextBSD/contrib/llvm/lib/Target/SystemZ/ |
| HD | SystemZSelectionDAGInfo.cpp | 26 static SDValue emitMemMem(SelectionDAG &DAG, SDLoc DL, unsigned Sequence, in emitMemMem() argument 45 return DAG.getNode(Sequence, DL, MVT::Other, Chain, Dst, Src, in emitMemMem()
|
| /NextBSD/sys/boot/efi/include/ |
| HD | efipxebc.h | 97 UINT16 Sequence; member
|
| /NextBSD/sys/contrib/dev/acpica/include/ |
| HD | actbl2.h | 623 UINT8 Sequence; /* HPET sequence number */ member
|
| /NextBSD/sys/dev/acpica/ |
| HD | acpi_hpet.c | 384 100, hpet_find, NULL, (void *)(uintptr_t)hpet->Sequence, in hpet_identify()
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | LoopStrengthReduce.cpp | 3667 SmallVector<const SCEV *, 8> Sequence; in GenerateCrossUseConstantOffsets() local 3673 Sequence.push_back(Reg); in GenerateCrossUseConstantOffsets() 3683 for (const SCEV *Reg : Sequence) { in GenerateCrossUseConstantOffsets() 3732 Sequence.clear(); in GenerateCrossUseConstantOffsets()
|
| /NextBSD/crypto/openssl/doc/crypto/ |
| HD | pem.pod | 292 Sequence using a NETSCAPE_CERT_SEQUENCE structure.
|