| /external/libvpx/examples/includes/geshi/geshi/ |
| ruby.php | 97 'Process::Status', 'Process::Sys', 'Process::UID', 'Queue',
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MultimapsTest.java | 48 import java.util.Queue;
545 private static class QueueSupplier extends CountingSupplier<Queue<Integer>> {
546 @Override public Queue<Integer> getImpl() {
554 CountingSupplier<Queue<Integer>> factory = new QueueSupplier();
578 CountingSupplier<Queue<Integer>> factory = new QueueSupplier();
[all...] |
| IterablesTest.java | 47 import java.util.Queue;
[all...] |
| MapConstraintsTest.java | 40 import java.util.Queue;
420 private static class QueueSupplier implements Supplier<Queue<Integer>> {
422 public Queue<Integer> get() {
|
| /external/oprofile/events/i386/nehalem/ |
| unit_masks | 207 0x04 iq_full Stall cycles due to a full instruction queue
354 0x01 promotion Counts the number of L2 secondary misses that hit the Super Queue
355 0x02 promotion_post_go Counts the number of L2 secondary misses during the Super Queue filling L2
356 0x04 lru_hints Counts number of Super Queue LRU hints sent to L3
|
| events | 34 event:0x17 counters:0,1,2,3 um:one minimum:6000 name:INST_QUEUE_WRITES : Counts the number of instructions written into the instruction queue every cycle.
38 event:0x1E counters:0,1,2,3 um:one minimum:6000 name:INST_QUEUE_WRITE_CYCLES : This event counts the number of cycles during which instructions are written to the instruction queue. Dividing this counter by the number of instructions written to the instruction queue (INST_QUEUE_WRITES) yields the average number of instructions decoded each cycle. If this number is less than four and the pipe stalls, this indicates that the decoder is failing to decode enough instructions per cycle to sustain the 4-wide pipeline.
72 event:0xA7 counters:0,1,2,3 um:one minimum:6000 name:BACLEAR_FORCE_IQ : Counts number of times a BACLEAR was forced by the Instruction Queue. The IQ is also responsible for providing conditional branch prediciton direction based on a static scheme and dynamic data provided by the L2 Branch Prediction Unit. If the conditional branch target is not found in the Target Array and the IQ predicts that the branch is taken, then the IQ will force the Branch Address Calculator to issue a BACLEAR. Each BACLEAR asserted by the BAC generates approximately an 8 cycle bubble in the instruction fetch pipeline.
103 event:0xF4 counters:0,1,2,3 um:sq_misc minimum:6000 name:SQ_MISC : Counts events in the Super Queue below the L2.
104 event:0xF6 counters:0,1,2,3 um:one minimum:6000 name:SQ_FULL_STALL_CYCLES : Counts cycles the Super Queue is full. Neither of the threads on this core will be able to access the uncore.
|
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/testtype/ |
| CtsTest.java | 61 import java.util.Queue;
623 // treat shardQueue as a circular queue, to sequentially distribute tests among shards
624 Queue<IRemoteTest> shardQueue = new LinkedList<IRemoteTest>();
|
| /development/cmds/monkey/src/com/android/commands/monkey/ |
| MonkeySourceNetwork.java | 42 import java.util.Queue;
100 * @param queue the command queue.
103 MonkeyCommandReturn translateCommand(List<String> command, CommandQueue queue);
113 CommandQueue queue) {
117 queue.enqueueEvent(new MonkeyFlipEvent(true));
120 queue.enqueueEvent(new MonkeyFlipEvent(false));
137 CommandQueue queue) {
165 queue.enqueueEvent(new MonkeyTouchEvent(action)
181 CommandQueue queue) {
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| MinMaxPriorityQueue.java | 39 import java.util.Queue;
42 * A double-ended priority queue, which provides constant-time access to both
43 * its least element and its greatest element, as determined by the queue's
47 * <p>As a {@link Queue} it functions exactly as a {@link PriorityQueue}: its
50 * the queue according to the queue's comparator. But unlike a regular priority
51 * queue, the methods {@link #peekLast}, {@link #pollLast} and
53 * in the queue instead.
55 * <p>A min-max priority queue can be configured with a maximum size. If so,
56 * each time the size of the queue exceeds that value, the queue automaticall
205 MinMaxPriorityQueue<T> queue = new MinMaxPriorityQueue<T>( local
222 private Object[] queue; field in class:MinMaxPriorityQueue
[all...] |
| Iterators.java | 42 import java.util.Queue;
[all...] |
| MapMakerInternalMap.java | 46 import java.util.Queue;
91 * This implementation uses a per-segment queue to record a memento of the additions, removals,
92 * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
127 * the cleanup queue and both reference queues.
179 final Queue<RemovalNotification<K, V>> removalNotificationQueue;
609 ValueReference<K, V> copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry);
643 ReferenceQueue<Object> queue, ReferenceEntry<Object, Object> entry) {
920 static final Queue<? extends Object> DISCARDING_QUEUE = new AbstractQueue<Object>() {
948 * Queue that discards all elements.
951 static <E> Queue<E> discardingQueue()
[all...] |
| /external/openfst/src/include/fst/ |
| minimize.h | 29 #include <queue>
42 #include <fst/queue.h>
128 template <class A, class Queue>
226 // allocate arc iterator queue
233 // Prep priority queue. Open arc iterator for each state in C, and
234 // insert into priority queue.
242 // Now pop arc iterator from queue, split entering equivalence class
243 // re-insert updated iterator into queue.
291 Queue L_;
296 // Priority queue of open arc iterators for all states in the 'splitter
[all...] |
| queue.h | 0 // queue.h
38 // class Queue {
43 // Queue(...);
44 // // Returns the head of the queue
48 // // Removes the head of the queue
52 // // Does the queue contain no elements?
54 // // Remove all states from queue
58 // State queue types.
60 TRIVIAL_QUEUE = 0, // Single state queue
61 FIFO_QUEUE = 1, // First-in, first-out queue
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| minimize.h | 23 #include <queue>
35 #include "fst/lib/queue.h"
115 template <class A, class Queue>
213 // allocate arc iterator queue
220 // Prep priority queue. Open arc iterator for each state in C, and
221 // insert into priority queue.
229 // Now pop arc iterator from queue, split entering equivalence class
230 // re-insert updated iterator into queue.
278 Queue L_;
283 // Priority queue of open arc iterators for all states in the 'splitter
[all...] |
| /packages/apps/Phone/src/com/android/phone/ |
| DTMFTwelveKeyDialer.java | 42 import java.util.Queue;
70 // Queue to queue the short dtmf characters.
71 private Queue<Character> mDTMFQueue = new LinkedList<Character>();
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/formatting/ |
| AndroidXmlFormattingStrategy.java | 68 import java.util.Queue;
84 private final Queue<IDocument> mDocuments = new LinkedList<IDocument>();
|
| /external/webkit/Tools/Scripts/webkitpy/layout_tests/layout_package/ |
| test_runner.py | 44 import Queue
233 self._result_queue = Queue.Queue()
730 except Queue.Empty:
[all...] |
| /external/clang/lib/Sema/ |
| SemaLookup.cpp | 155 SmallVector<DeclContext*,4> queue; local
163 queue.push_back(NS);
167 if (queue.empty())
170 DC = queue.back();
171 queue.pop_back();
[all...] |
| SemaAccess.cpp | 269 SmallVector<const CXXRecordDecl*, 8> Queue; // actually a stack
297 Queue.push_back(RD);
300 if (Queue.empty()) break;
302 Derived = Queue.back();
303 Queue.pop_back();
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 46 #include <queue>
85 std::priority_queue<std::pair<unsigned, unsigned> > Queue;
367 // Unassigned virtreg is probably in the priority queue.
377 // Register is assigned, put it back on the queue for reassignment.
406 // The queue holds (size, reg) pairs.
431 Queue.push(std::make_pair(Prio, ~Reg));
435 if (Queue.empty())
437 LiveInterval *LI = &LIS->getInterval(~Queue.top().second);
438 Queue.pop();
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/refactorings/extractstring/ |
| ExtractStringRefactoring.java | 98 import java.util.Queue;
[all...] |
| /external/guava/guava/src/com/google/common/cache/ |
| LocalCache.java | 66 import java.util.Queue;
110 * This implementation uses a per-segment queue to record a memento of the additions, removals,
111 * and accesses that were performed on the map. The queue is drained on writes and when it exceeds
146 * the cleanup queue and both reference queues.
204 final Queue<RemovalNotification<K, V>> removalNotificationQueue;
651 ValueReference<K, V> copyFor(ReferenceQueue<V> queue, ReferenceEntry<K, V> entry);
697 ReferenceQueue<Object> queue, ReferenceEntry<Object, Object> entry) {
787 * Returns the next entry in the access queue.
792 * Sets the next entry in the access queue.
797 * Returns the previous entry in the access queue
[all...] |
| /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
| Iterators.java | 40 import java.util.Queue;
[all...] |
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/ |
| Spatial.java | 46 import com.jme3.renderer.queue.RenderQueue;
47 import com.jme3.renderer.queue.RenderQueue.Bucket;
48 import com.jme3.renderer.queue.RenderQueue.ShadowMode;
1060 * @see Spatial#setShadowMode(com.jme3.renderer.queue.RenderQueue.ShadowMode)
1467 Queue<Spatial> queue = new LinkedList<Spatial>(); local
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/compiler/ |
| TemplateTranslator.java | 80 import java.util.Queue;
148 private final Queue<MacroInfo> macroQueue = new LinkedList<MacroInfo>();
[all...] |
