| /external/llvm/include/llvm/ADT/ |
| 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()
[all...] |
| /external/llvm/lib/DebugInfo/ |
| DWARFDebugLine.h | 122 // first byte after the end of a sequence of target machine
138 struct Sequence {
139 // Sequence describes instructions at address range [LowPC, HighPC)
147 Sequence() { reset(); }
155 static bool orderByLowPC(const Sequence& LHS, const Sequence& RHS) {
168 void appendSequence(const DWARFDebugLine::Sequence &sequence) {
169 Sequences.push_back(sequence);
196 typedef std::vector<Sequence> SequenceVector
[all...] |
| DWARFDebugLine.cpp | 99 if (Sequence::Empty) {
100 // Record the beginning of instruction sequence.
101 Sequence::Empty = false;
102 Sequence::LowPC = Address;
103 Sequence::FirstRowIndex = row;
108 // Record the end of instruction sequence.
109 Sequence::HighPC = Address;
110 Sequence::LastRowIndex = row;
111 if (Sequence::isValid())
113 Sequence::reset()
535 DWARFDebugLine::Sequence sequence; local
[all...] |
| /external/chromium/net/tools/testserver/ |
| asn1der.py | 16 SEQUENCE = 0x30
53 def Sequence(values):
54 """Encodes a sequence of other values.
61 return Data(SEQUENCE, ''.join(values))
|
| device_management.py | 593 algorithm = asn1der.Sequence(
596 rsa_pubkey = asn1der.Sequence([ asn1der.Integer(key.n),
598 pubkey = asn1der.Sequence([ algorithm, asn1der.Bitstring(rsa_pubkey) ])
|
| /external/chromium/testing/gmock/include/gmock/ |
| gmock-spec-builders.h | 112 // expectation gets picked. Therefore, we sequence all mock function
504 friend class Sequence;
603 // Sequence objects are used by a user to specify the relative order
606 class Sequence {
608 // Constructs an empty sequence.
609 Sequence() : last_expectation_(new Expectation) {}
611 // Adds an expectation to this sequence. The caller must ensure
612 // that no other thread is accessing this Sequence object.
616 // The last expectation in this sequence. We use a linked_ptr here
617 // because Sequence objects are copyable and we want the copies t
[all...] |
| /external/clang/lib/Sema/ |
| SemaInit.cpp | [all...] |
| /external/llvm/lib/CodeGen/ |
| PostRASchedulerList.cpp | 128 std::vector<SUnit*> Sequence;
228 Sequence.clear();
242 /// dumpSchedule - dump the scheduled Sequence.
244 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
245 if (SUnit *SU = Sequence[i])
309 // Schedule each sequence of instructions not interrupted by a label
614 Sequence.push_back(SU);
654 Sequence.reserve(SUnits.size());
724 Sequence.push_back(0); // NULL here means noop
736 for (unsigned i = 0, e = Sequence.size(); i != e; ++i
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGVLIW.cpp | 157 Sequence.push_back(SU);
186 Sequence.reserve(SUnits.size());
259 Sequence.push_back(0); // NULL here means noop
|
| ScheduleDAGFast.cpp | 188 Sequence.push_back(SU);
544 Sequence.reserve(SUnits.size());
631 std::reverse(Sequence.begin(), Sequence.end());
654 std::vector<SDNode*> Sequence;
672 Sequence.push_back(N);
760 Sequence.reserve(DAGSize);
774 unsigned NumNodes = Sequence.size();
776 SDNode *N = Sequence[NumNodes-i-1];
|
| ScheduleDAGSDNodes.h | 43 std::vector<SUnit*> Sequence;
106 /// in the Sequence member.
111 /// consistent with the Sequence of scheduled instructions.
115 /// according to the order specified in Sequence.
|
| ScheduleDAGSDNodes.cpp | 60 Sequence.clear();
393 // of the sequence of nodes that are glued together.
669 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
670 if (SUnit *SU = Sequence[i])
680 /// their state is consistent with the nodes listed in Sequence.
685 for (unsigned i = 0, e = Sequence.size(); i != e; ++i)
686 if (!Sequence[i])
688 assert(Sequence.size() - Noops == ScheduledNodes &&
818 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
819 SUnit *SU = Sequence[i]
[all...] |
| ScheduleDAGRRList.cpp | 329 // to track the virtual resource of a calling sequence.
510 /// across a sequence of two-address node. This is important because the
724 Sequence.push_back(SU);
885 unsigned LookAhead = std::min((unsigned)Sequence.size(),
890 std::vector<SUnit*>::const_iterator I = (Sequence.end() - LookAhead);
892 for (std::vector<SUnit*>::const_iterator E = Sequence.end(); I != E; ++I) {
[all...] |
| /external/llvm/utils/TableGen/ |
| CodeGenSchedule.h | 40 /// sequences. TheDef is nonnull for explicit SchedWrites, but Sequence may or
41 /// may not be empty. TheDef is null for inferred sequences, and Sequence must
45 /// or a sequence of writes on one operand.
55 IdxVec Sequence;
70 // added. Note that implicit Reads (from ReadVariant) may have a Sequence
78 HasVariants(false), IsVariadic(false), IsSequence(true), Sequence(Seq) {
79 assert(Sequence.size() > 1 && "implied sequence needs >1 RWs");
85 assert((!IsSequence || !HasVariants) && "Sequence can't have variant");
86 assert((!IsSequence || !Sequence.empty()) && "Sequence should be nonempty")
[all...] |
| CodeGenSchedule.cpp | 188 // Reads don't current have sequence records, but it can be added later.
198 // Visit each RW in the sequence selected by the current variant.
298 findRWs(WI->TheDef->getValueAsListOfDefs("Writes"), WI->Sequence,
333 /// Compute a SchedWrite name from a sequence of writes.
396 // Call getSchedRWIdx for all elements in a sequence of SchedRW defs.
416 for (IdxIter I = SchedRW.Sequence.begin(), E = SchedRW.Sequence.end();
423 // Expand a SchedWrite as a sequence following any aliases that coincide with
457 for (IdxIter I = SchedWrite.Sequence.begin(), E = SchedWrite.Sequence.end()
[all...] |
| /external/llvm/lib/Target/R600/ |
| AMDGPUIndirectAddressing.cpp | 280 MachineInstrBuilder Sequence = BuildMI(MBB, I, MBB.findDebugLoc(I),
298 Sequence.addReg(LiveAddressRegisterMap[Addr]);
299 Sequence.addImm(TII->getRegisterInfo().getIndirectSubReg(Addr));
|
| /external/chromium/testing/gmock/test/ |
| gmock_output_test_.cc | 48 using testing::Sequence;
154 Sequence s1, s2;
|
| gmock-spec-builders_test.cc | 90 using testing::Sequence;
366 Sequence s;
379 Sequence s;
391 Sequence s1, s2;
402 Sequence s;
417 Sequence s;
1045 Sequence s1, s2;
1224 // Tests that any order is allowed when no sequence is used.
[all...] |
| /external/clang/test/SemaTemplate/ |
| temp_arg_nontype.cpp | 203 template <typename Sequence, int I0>
204 struct as_nview<Sequence, I0> // expected-note{{while checking a default template argument used here}}
|
| /external/chromium/testing/gmock/src/ |
| gmock-spec-builders.cc | 241 // Points to the implicit sequence introduced by a living InSequence
243 ThreadLocal<Sequence*> g_gmock_implicit_sequence;
767 // Adds an expectation to a sequence.
768 void Sequence::AddExpectation(const Expectation& expectation) const {
778 // Creates the implicit sequence if there isn't one.
781 internal::g_gmock_implicit_sequence.set(new Sequence);
788 // Deletes the implicit sequence if it was created by the constructor
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| ObjCARCOpts.cpp | 306 /// \enum Sequence
308 /// \brief A sequence of states that a pointer may go through in which an
310 enum Sequence {
320 raw_ostream &operator<<(raw_ostream &OS, const Sequence S)
322 raw_ostream &operator<<(raw_ostream &OS, const Sequence S) {
339 llvm_unreachable("Unknown sequence type.");
343 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) {
352 // Choose the side which is further along in the sequence
[all...] |
| /external/harfbuzz/src/ |
| harfbuzz-gsub-private.h | 92 HB_Sequence* Sequence; /* array of Sequence tables */
95 HB_UShort SequenceCount; /* number of Sequence tables */
163 glyph sequence */
|
| /external/harfbuzz_ng/src/hb-old/ |
| harfbuzz-gsub-private.h | 92 HB_Sequence* Sequence; /* array of Sequence tables */
95 HB_UShort SequenceCount; /* number of Sequence tables */
163 glyph sequence */
|
| /external/icu4c/test/intltest/ |
| wbnf.cpp | 685 class Sequence : public Pick {
702 virtual ~Sequence(){
890 // combining sequence.
1153 UBool sequence(Pick* &node \/*out*\/){ function in class:Parser
[all...] |
| /external/neven/ |
| Android.mk | 64 Embedded/common/src/b_BitFeatureEm/Sequence.c \
|
