| /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 | 120 // first byte after the end of a sequence of target machine
136 struct Sequence {
137 // Sequence describes instructions at address range [LowPC, HighPC)
145 Sequence() { reset(); }
153 static bool orderByLowPC(const Sequence& LHS, const Sequence& RHS) {
166 void appendSequence(const DWARFDebugLine::Sequence &sequence) {
167 Sequences.push_back(sequence);
190 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()
[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/llvm/lib/CodeGen/ |
| PostRASchedulerList.cpp | 130 std::vector<SUnit*> Sequence;
230 Sequence.clear();
244 /// dumpSchedule - dump the scheduled Sequence.
246 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
247 if (SUnit *SU = Sequence[i])
311 // Schedule each sequence of instructions not interrupted by a label
630 Sequence.push_back(SU);
671 Sequence.reserve(SUnits.size());
741 Sequence.push_back(0); // NULL here means noop
753 for (unsigned i = 0, e = Sequence.size(); i != e; ++i
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| ScheduleDAGVLIW.cpp | 155 Sequence.push_back(SU);
184 Sequence.reserve(SUnits.size());
257 Sequence.push_back(0); // NULL here means noop
|
| 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.
668 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
669 if (SUnit *SU = Sequence[i])
679 /// their state is consistent with the nodes listed in Sequence.
684 for (unsigned i = 0, e = Sequence.size(); i != e; ++i)
685 if (!Sequence[i])
687 assert(Sequence.size() - Noops == ScheduledNodes &&
817 for (unsigned i = 0, e = Sequence.size(); i != e; i++) {
818 SUnit *SU = Sequence[i]
[all...] |
| ScheduleDAGFast.cpp | 183 Sequence.push_back(SU);
534 Sequence.reserve(SUnits.size());
625 std::reverse(Sequence.begin(), Sequence.end());
|
| ScheduleDAGRRList.cpp | 311 // to track the virtual resource of a calling sequence.
491 /// across a sequence of two-address node. This is important because the
705 Sequence.push_back(SU);
862 unsigned LookAhead = std::min((unsigned)Sequence.size(),
867 std::vector<SUnit*>::const_iterator I = (Sequence.end() - LookAhead);
869 for (std::vector<SUnit*>::const_iterator E = Sequence.end(); I != E; ++I) {
881 SUnit *OldSU = Sequence.back();
883 Sequence.pop_back();
893 OldSU = Sequence.back();
[all...] |
| /external/clang/lib/Sema/ |
| SemaInit.cpp | [all...] |
| /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/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 */
|
| harfbuzz-gsub.c | 323 /* Sequence */
409 ms->Sequence = NULL;
411 if ( ALLOC_ARRAY( ms->Sequence, count, HB_Sequence ) )
414 s = ms->Sequence;
454 if ( ms->Sequence )
457 s = ms->Sequence;
497 count = ms->Sequence[index].GlyphCount;
498 s = ms->Sequence[index].Substitute;
[all...] |
| /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 \
|
| /external/llvm/lib/Transforms/Scalar/ |
| ObjCARC.cpp | [all...] |
| LoopStrengthReduce.cpp | [all...] |
| /external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime.Tests/ |
| Antlr.Runtime.Tree.Tests.pas | 847 // Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EOF
888 // Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EOF
938 // Sequence of types: 101 DN 102 DN 103 106 DN 107 UP UP 104 105 UP EOF
986 // Sequence of types: 101 DN 102 DN 103 UP 104 DN 105 UP 106 DN 107 UP 108 109 UP
[all...] |
| /external/blktrace/doc/ |
| blktrace.tex | 76 \emph{bt} is the name of the directory from the above git sequence). The
129 To build and install the tools, execute the following sequence (as root):
607 \emph{s} & Sequence numbers \\ \hline
666 \item[\%8s] Sequence number
[all...] |
