| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/formatting/ |
| AndroidXmlFormattingStrategy.java | 67 import java.util.Queue;
83 private final Queue<IDocument> mDocuments = new LinkedList<IDocument>();
|
| /external/libppp/src/ |
| mp.c | 265 memset(mp->link.Queue, '\0', sizeof mp->link.Queue);
334 memset(mp->link.Queue, '\0', sizeof mp->link.Queue);
456 * the queue.
555 * Stuff our fragment back at the front of the queue and zap
723 * MP level link compression, queue outbound traffic directly via that
[all...] |
| physical.c | 194 memset(p->link.Queue, '\0', sizeof p->link.Queue);
604 memset(p->link.Queue, '\0', sizeof p->link.Queue);
|
| /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/authoring/builder/ |
| SyncSampleIntersectFinderImpl.java | 268 Queue<TimeToSampleBox.Entry> timeQueue = new LinkedList<TimeToSampleBox.Entry>(track.getDecodingTimeEntries());
|
| FragmentedMp4Builder.java | 317 Queue<TimeToSampleBox.Entry> timeQueue = new LinkedList<TimeToSampleBox.Entry>(track.getDecodingTimeEntries());
328 Queue<CompositionTimeToSample.Entry> compositionTimeQueue =
|
| /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 | 276 SmallVector<const CXXRecordDecl*, 8> Queue; // actually a stack
304 Queue.push_back(RD);
307 if (Queue.empty()) break;
309 Derived = Queue.back();
310 Queue.pop_back();
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| MapConstraintsTest.java | 40 import java.util.Queue;
420 private static class QueueSupplier implements Supplier<Queue<Integer>> {
422 public Queue<Integer> get() {
|
| /external/openfst/src/include/fst/ |
| 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/clang/tools/libclang/ |
| RecursiveASTVisitor.h | 118 /// Stmts are traversed internally using a data queue to avoid a stack overflow
268 StmtQueue.queue(S->getSubExpr()); \
288 StmtQueue.queue(S->getLHS()); \
289 StmtQueue.queue(S->getRHS()); \
415 NewQueueRAII(StmtsTy &queue, RecursiveASTVisitor &RAV) : RAV(RAV) {
416 RAV.Queues.push_back(&queue);
435 void queue(Stmt *S) { function in class:clang::cxindex::RecursiveASTVisitor::StmtQueueAction
449 StmtsTy Queue, StmtsToEnqueu;
450 Queue.push_back(S);
453 while (!Queue.empty())
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocGreedy.cpp | 46 #include <queue>
84 std::priority_queue<std::pair<unsigned, unsigned> > Queue;
359 // Unassigned virtreg is probably in the priority queue.
368 // Register is assigned, put it back on the queue for reassignment.
396 // The queue holds (size, reg) pairs.
421 Queue.push(std::make_pair(Prio, ~Reg));
425 if (Queue.empty())
427 LiveInterval *LI = &LIS->getInterval(~Queue.top().second);
428 Queue.pop();
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/refactorings/extractstring/ |
| ExtractStringRefactoring.java | 100 import java.util.Queue;
[all...] |
| /external/oprofile/events/i386/nehalem/ |
| 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.
|
| /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/src/com/google/common/collect/ |
| 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/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...] |
| /external/sonivox/jet_tools/JetCreator/ |
| JetAudition.py | 325 """ Loads up the displayed queue list """
356 Queue(self.jet, self.queueSegs[index])
385 Queue(self.jet, self.queueSegs[index])
413 #MAC has a 'pop' when clearing the queue; not sure why so this avoids it
|
| /external/blktrace/btt/doc/ |
| btt.tex | 37 information about request queue operations up to user space.
113 queue. This is the average time from when the IO enters the block
114 IO layer (queue trace) until it is inserted (insert trace).
128 queue (insert trace).
133 amount of time between the queue trace and the merge trace.
135 \item Time spent on the request queue. The average time from when
136 the IO is inserted or merged onto the request queue, until it is
154 \item \emph{Q2Q} which measures the time between queue traces
162 = {Q2C}$ however, typically there are multiple queue traces that
164 currently average the queue-to-insert and queue-to-merge times
[all...] |
| /external/v8/tools/ |
| test.py | 44 from Queue import Queue, Empty
59 self.queue = Queue(len(cases))
61 self.queue.put_nowait(case)
109 test = self.queue.get_nowait()
[all...] |
| /packages/apps/VideoEditor/src/com/android/videoeditor/ |
| VideoEditorActivity.java | 22 import java.util.Queue;
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
| org.eclipse.core.jobs_3.5.1.R36x_v20100824.jar | |
