| /external/libchrome/base/task_scheduler/ |
| sequence.h | 24 // A sequence holds tasks that must be executed in posting order.
27 // architecture: Sequence -> Task -> TaskRunner -> Sequence -> ...
28 // This is okay so long as the other owners of Sequence (PriorityQueue and
36 // the caller that the Sequence should be re-enqueued for execution).
39 class BASE_EXPORT Sequence : public RefCountedThreadSafe<Sequence> {
41 Sequence();
43 // Adds |task| at the end of the sequence's queue. Returns true if the
44 // sequence was empty before this operation
[all...] |
| sequence.cc | 5 #include "base/task_scheduler/sequence.h"
15 Sequence::Sequence() = default;
17 bool Sequence::PushTask(std::unique_ptr<Task> task) {
25 // Return true if the sequence was empty before the push.
29 const Task* Sequence::PeekTask() const {
38 bool Sequence::PopTask() {
51 SequenceSortKey Sequence::GetSortKey() const {
59 // Find the highest task priority in the sequence.
69 // Save the sequenced time of the next task in the sequence
[all...] |
| sequence_unittest.cc | 5 #include "base/task_scheduler/sequence.h"
51 // Tasks to be handed off to a Sequence for testing.
60 // moved into a Sequence.
74 scoped_refptr<Sequence> sequence(new Sequence);
76 // Push task A in the sequence. Its sequenced time should be updated and it
77 // should be in front of the sequence.
78 EXPECT_TRUE(sequence->PushTask(std::move(task_a_owned_)));
80 EXPECT_EQ(task_a_, sequence->PeekTask())
[all...] |
| /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/swiftshader/third_party/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...] |
| /prebuilts/go/darwin-x86/doc/progs/ |
| eff_sequence.go | 13 seq := Sequence{6, 2, -1, 44, 16}
18 type Sequence []int
21 func (s Sequence) Len() int {
24 func (s Sequence) Less(i, j int) bool {
27 func (s Sequence) Swap(i, j int) {
32 func (s Sequence) String() string {
|
| /prebuilts/go/linux-x86/doc/progs/ |
| eff_sequence.go | 13 seq := Sequence{6, 2, -1, 44, 16}
18 type Sequence []int
21 func (s Sequence) Len() int {
24 func (s Sequence) Less(i, j int) bool {
27 func (s Sequence) Swap(i, j int) {
32 func (s Sequence) String() string {
|
| /prebuilts/misc/common/swig/include/2.0.11/ruby/ |
| rubycontainer.swg | 4 * Ruby sequence <-> C++ container wrapper
80 template <class Sequence, class Difference>
81 inline typename Sequence::iterator
82 getpos(Sequence* self, Difference i) {
83 typename Sequence::iterator pos = self->begin();
88 template <class Sequence, class Difference>
89 inline typename Sequence::const_iterator
90 cgetpos(const Sequence* self, Difference i) {
91 typename Sequence::const_iterator pos = self->begin();
96 template <class Sequence, class Difference
[all...] |
| std_set.i | 155 %define %swig_sequence_methods_extra_set(Sequence...)
158 Sequence* reject_bang() {
162 for ( Sequence::iterator i = $self->begin(); i != $self->end(); ) {
163 VALUE r = swig::from< Sequence::value_type >(*i);
164 Sequence::iterator current = i++;
|
| /prebuilts/misc/common/swig/include/2.0.11/octave/ |
| octcontainer.swg | 111 template <class Sequence, class Difference>
112 inline typename Sequence::iterator
113 getpos(Sequence* self, Difference i) {
114 typename Sequence::iterator pos = self->begin();
119 template <class Sequence, class Difference>
120 inline typename Sequence::const_iterator
121 cgetpos(const Sequence* self, Difference i) {
122 typename Sequence::const_iterator pos = self->begin();
127 template <class Sequence, class Difference>
128 inline Sequence*
[all...] |
| /external/compiler-rt/test/profile/Inputs/ |
| instrprof-value-prof-evict.c | 27 // Four target sequence --
31 // hot period in the sequence is shorter than the cold targets' count.
56 #define INDIRECT_CALLSITE(Sequence, NumValsTracked) \
58 for (I = 0; I < sizeof(Sequence) / sizeof(*Sequence); I++) { \
59 FPT FP = getCalleeFunc(Sequence[I]); \
|
| /external/llvm/include/llvm/DebugInfo/DWARF/ |
| DWARFDebugLine.h | 132 // first byte after the end of a sequence of target machine
148 struct Sequence {
149 // Sequence describes instructions at address range [LowPC, HighPC)
157 Sequence();
160 static bool orderByLowPC(const Sequence& LHS, const Sequence& RHS) {
180 void appendSequence(const DWARFDebugLine::Sequence &S) {
213 typedef std::vector<Sequence> SequenceVector;
219 uint32_t findRowInSeq(const DWARFDebugLine::Sequence &seq,
240 struct Sequence Sequence
[all...] |
| /external/llvm/lib/Transforms/ObjCARC/ |
| PtrState.h | 11 // is only used by the ARC Sequence Dataflow computation. By separating this
33 /// \enum Sequence
35 /// \brief A sequence of states that a pointer may go through in which an
37 enum Sequence {
48 const Sequence S) LLVM_ATTRIBUTE_UNUSED;
51 /// retain-decrement-use-release sequence or release-use-decrement-retain
52 /// reverse sequence.
75 /// For a top-down sequence, the set of objc_retains or
80 /// sequence.
109 /// The current position in the sequence
[all...] |
| PtrState.cpp | 25 raw_ostream &llvm::objcarc::operator<<(raw_ostream &OS, const Sequence S) {
42 llvm_unreachable("Unknown sequence type.");
46 // Sequence
49 static Sequence MergeSeqs(Sequence A, Sequence B, bool TopDown) {
59 // Choose the side which is further along in the sequence.
64 // Choose the side which is further along in the sequence.
126 void PtrState::SetSeq(Sequence NewSeq) {
131 void PtrState::ResetSequenceProgress(Sequence NewSeq)
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/python/ |
| pycontainer.swg | 4 * Python sequence <-> C++ container wrapper
241 template <class Sequence, class Difference>
242 inline typename Sequence::iterator
243 getpos(Sequence* self, Difference i) {
244 typename Sequence::iterator pos = self->begin();
249 template <class Sequence, class Difference>
250 inline typename Sequence::const_iterator
251 cgetpos(const Sequence* self, Difference i) {
252 typename Sequence::const_iterator pos = self->begin();
257 template <class Sequence, class Difference
[all...] |
| /external/llvm/lib/DebugInfo/DWARF/ |
| DWARFDebugLine.cpp | 163 DWARFDebugLine::Sequence::Sequence() { reset(); }
165 void DWARFDebugLine::Sequence::reset() {
202 Sequence.reset();
206 if (Sequence.Empty) {
207 // Record the beginning of instruction sequence.
208 Sequence.Empty = false;
209 Sequence.LowPC = Row.Address;
210 Sequence.FirstRowIndex = RowNumber;
215 // Record the end of instruction sequence
582 DWARFDebugLine::Sequence sequence; local
[all...] |
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/ |
| rd-dw2-10.d | 11 \[0x.*\] Extended opcode 1: End of Sequence
|
| rd-dw2-3.d | 12 \[0x.*\] Extended opcode 1: End of Sequence
|
| rd-dw2-4.d | 13 \[0x.*\] Extended opcode 1: End of Sequence
|
| rd-dw2-5.d | 14 \[0x.*\] Extended opcode 1: End of Sequence
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/ |
| loc-swap-3.d | 17 .* Extended opcode 1: End of Sequence
|
| /external/autotest/client/cros/cellular/mbim_compliance/sequences/ |
| sequence.py | 12 class Sequence(entity.Entity):
17 Run the sequence.
19 @returns The result of the sequence. The type of value returned varies
20 by the sequence type.
23 logging.info('---- Sequence (%s) begin ----', self.name())
25 logging.info('---- Sequence (%s) end ----', self.name())
30 The actual method runs the sequence.
31 Subclasses should override this method to run their own sequence.
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/lns/ |
| lns-big-delta.d | 16 \[0x.*\] Extended opcode 1: End of Sequence
|
| /external/google-breakpad/src/testing/include/gmock/ |
| gmock-spec-builders.h | 112 // expectation gets picked. Therefore, we sequence all mock function
509 friend class Sequence;
608 // Sequence objects are used by a user to specify the relative order
611 class GTEST_API_ Sequence {
613 // Constructs an empty sequence.
614 Sequence() : last_expectation_(new Expectation) {}
616 // Adds an expectation to this sequence. The caller must ensure
617 // that no other thread is accessing this Sequence object.
621 // The last expectation in this sequence. We use a linked_ptr here
622 // because Sequence objects are copyable and we want the copies t
[all...] |
| /external/googletest/googlemock/include/gmock/ |
| gmock-spec-builders.h | 116 // expectation gets picked. Therefore, we sequence all mock function
517 friend class Sequence;
616 // Sequence objects are used by a user to specify the relative order
619 class GTEST_API_ Sequence {
621 // Constructs an empty sequence.
622 Sequence() : last_expectation_(new Expectation) {}
624 // Adds an expectation to this sequence. The caller must ensure
625 // that no other thread is accessing this Sequence object.
629 // The last expectation in this sequence. We use a linked_ptr here
630 // because Sequence objects are copyable and we want the copies t
[all...] |
