| /src/external/apache2/llvm/dist/llvm/include/llvm/MCA/ |
| SourceMgr.h | 10 /// code sequence (a sequence of MCInst), and assings unique identifiers to
11 /// every instruction in the sequence.
30 ArrayRef<UniqueInst> Sequence;
37 : Sequence(S), Current(0), Iterations(Iter ? Iter : DefaultIterations) {}
40 unsigned size() const { return Sequence.size(); }
41 bool hasNext() const { return Current < (Iterations * Sequence.size()); }
45 assert(hasNext() && "Already at end of sequence!");
46 return SourceRef(Current, *Sequence[Current % Sequence.size()])
[all...] |
| CodeEmitter.h | 42 ArrayRef<MCInst> Sequence;
56 : STI(ST), MAB(AB), MCE(CE), VecOS(Code), Sequence(S),
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
| 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()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/MCA/ |
| CodeEmitter.cpp | 25 const MCInst &Inst = Sequence[MCID];
26 MCInst Relaxed(Sequence[MCID]);
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/ObjCARC/ |
| PtrState.h | 10 // is only used by the ARC Sequence Dataflow computation. By separating this
37 /// \enum Sequence
39 /// A sequence of states that a pointer may go through in which an
41 enum Sequence {
51 const Sequence S) LLVM_ATTRIBUTE_UNUSED;
54 /// retain-decrement-use-release sequence or release-use-decrement-retain
55 /// reverse sequence.
78 /// For a top-down sequence, the set of objc_retains or
83 /// sequence.
110 /// The current position in the sequence
[all...] |
| PtrState.cpp | 37 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) {
52 llvm_unreachable("Unknown sequence type.");
56 // Sequence
59 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) {
69 // Choose the side which is further along in the sequence.
74 // Choose the side which is further along in the sequence.
134 void PtrState::SetSeq(Sequence NewSeq) {
140 void PtrState::ResetSequenceProgress(Sequence NewSeq)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/Orc/ |
| DebugUtils.cpp | 79 // Prints a sequence of items, filtered by an user-supplied predicate.
80 template <typename Sequence,
81 typename Pred = PrintAll<typename Sequence::value_type>>
84 SequencePrinter(const Sequence &S, char OpenSeq, char CloseSeq,
104 const Sequence &S;
110 template <typename Sequence, typename Pred>
111 SequencePrinter<Sequence, Pred> printSequence(const Sequence &S, char OpenSeq,
113 return SequencePrinter<Sequence, Pred>(S, OpenSeq, CloseSeq, std::move(P));
117 template <typename Sequence, typename Pred
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugLine.h | 185 /// first byte after the end of a sequence of target machine
201 struct Sequence {
202 Sequence();
204 /// Sequence describes instructions at address range [LowPC, HighPC)
218 static bool orderByHighPC(const Sequence &LHS, const Sequence &RHS) {
241 void appendSequence(const DWARFDebugLine::Sequence &S) {
289 using SequenceVector = std::vector<Sequence>;
297 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &Seq,
315 /// Helper to allow for parsing of an entire .debug_line section in sequence
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/python/lib/gdb/dap/ |
| typecheck.py | 39 elif base == collections.abc.Sequence or base == typing.Sequence:
40 # In some places we simply use 'Sequence' without arguments.
|
| breakpoint.py | 20 from typing import Optional, Sequence
295 def set_breakpoint(*, source, breakpoints: Sequence = (), **args):
335 def set_fn_breakpoint(*, breakpoints: Sequence, **args):
369 *, breakpoints: Sequence, offset: Optional[int] = None, **args
450 *, filters: Sequence[str], filterOptions: Sequence = (), **args
|
| launch.py | 19 from typing import Mapping, Optional, Sequence
79 args: Sequence[str] = (),
117 # occur in a more logical sequence -- but if the inferior does
|
| /src/external/gpl3/gdb/dist/gdb/python/lib/gdb/dap/ |
| typecheck.py | 39 elif base == collections.abc.Sequence or base == typing.Sequence:
40 # In some places we simply use 'Sequence' without arguments.
|
| breakpoint.py | 20 from typing import Optional, Sequence
291 def set_breakpoint(*, source, breakpoints: Sequence = (), **args):
331 def set_fn_breakpoint(*, breakpoints: Sequence, **args):
365 *, breakpoints: Sequence, offset: Optional[int] = None, **args
446 *, filters: Sequence[str], filterOptions: Sequence = (), **args
|
| launch.py | 19 from typing import Mapping, Optional, Sequence
79 args: Sequence[str] = (),
117 # occur in a more logical sequence -- but if the inferior does
|
| /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugLine.cpp | 503 DWARFDebugLine::Sequence::Sequence() { reset(); }
505 void DWARFDebugLine::Sequence::reset() {
548 Sequence.reset();
553 if (Sequence.Empty) {
554 // Record the beginning of instruction sequence.
555 Sequence.Empty = false;
556 Sequence.LowPC = Row.Address.Address;
557 Sequence.FirstRowIndex = RowNumber;
561 // Record the end of instruction sequence
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| PostRASchedulerList.cpp | 133 std::vector<SUnit*> Sequence;
239 Sequence.clear();
253 /// dumpSchedule - dump the scheduled Sequence.
255 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
256 if (SUnit *SU = Sequence[i])
331 // Schedule each sequence of instructions not interrupted by a label
501 Sequence.push_back(SU);
511 /// emitNoop - Add a noop to the current instruction sequence.
515 Sequence.push_back(nullptr); // NULL here means noop
549 Sequence.reserve(SUnits.size())
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGVLIW.cpp | 154 Sequence.push_back(SU);
183 Sequence.reserve(SUnits.size());
256 Sequence.push_back(nullptr); // NULL here means noop
|
| ScheduleDAGSDNodes.h | 53 std::vector<SUnit*> Sequence;
111 /// in the Sequence member.
116 /// consistent with the Sequence of scheduled instructions.
120 /// according to the order specified in Sequence.
|
| ScheduleDAGFast.cpp | 187 Sequence.push_back(SU);
542 Sequence.reserve(SUnits.size());
629 std::reverse(Sequence.begin(), Sequence.end());
653 std::vector<SDNode*> Sequence;
671 Sequence.push_back(N);
757 Sequence.reserve(DAGSize);
768 unsigned NumNodes = Sequence.size();
771 SDNode *N = Sequence[NumNodes-i-1];
|
| /src/external/apache2/llvm/dist/llvm/utils/unittest/googlemock/include/gmock/ |
| gmock-spec-builders.h | 122 // expectation gets picked. Therefore, we sequence all mock function
531 friend class Sequence;
629 // Sequence objects are used by a user to specify the relative order
632 class GTEST_API_ Sequence {
634 // Constructs an empty sequence.
635 Sequence() : last_expectation_(new Expectation) {}
637 // Adds an expectation to this sequence. The caller must ensure
638 // that no other thread is accessing this Sequence object.
642 // The last expectation in this sequence.
644 }; // class Sequence
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaInit.cpp | 3454 // Initialization sequence
3814 maybeRecoverWithZeroInitialization(Sema &S, InitializationSequence &Sequence,
3827 Sequence.AddZeroInitializationStep(Entity.getType());
3828 Sequence.SetZeroInitializationFixit(Init, Loc);
3835 InitializationSequence &Sequence,
3847 Sequence.AddProduceObjCObjectStep(Entity.getType());
3858 Sequence.AddProduceObjCObjectStep(Entity.getType());
3866 InitializationSequence &Sequence,
3877 InitializationSequence &Sequence,
3884 Sequence.setIncompleteTypeFailure(E)
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dap/ |
| type_check.py | 52 def sequence_type(*, s: typing.Sequence[str]):
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dap/ |
| type_check.py | 52 def sequence_type(*, s: typing.Sequence[str]):
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| PredicateExpander.cpp | 156 const RecVec &Sequence,
158 assert(!Sequence.empty() && "Found an invalid empty predicate set!");
159 if (Sequence.size() == 1)
160 return expandPredicate(OS, Sequence[0]);
169 for (const Record *Rec : Sequence) {
|
| /src/external/apache2/llvm/dist/clang/include/clang/Analysis/ |
| CloneDetection.h | 31 /// Can either identify a single arbitrary Stmt object, a continuous sequence of
34 /// If this object identifies a sequence of statements inside a CompoundStmt,
51 /// The resulting StmtSequence identifies a continuous sequence of statements
75 /// Returns an iterator pointing to the first statement in this sequence.
78 /// Returns an iterator pointing behind the last statement in this sequence.
81 /// Returns the first statement in this sequence.
89 /// Returns the last statement in this sequence.
121 /// Returns the start sourcelocation of the first statement in this sequence.
126 /// Returns the end sourcelocation of the last statement in this sequence.
131 /// Returns the source range of the whole sequence - from the beginnin
[all...] |
