| /external/glide/library/src/main/java/com/bumptech/glide/util/ |
| ExceptionCatchingInputStream.java | 7 import java.util.Queue;
18 private static final Queue<ExceptionCatchingInputStream> QUEUE = Util.createQueue(0);
25 synchronized (QUEUE) {
26 result = QUEUE.poll();
37 while (!QUEUE.isEmpty()) {
38 QUEUE.remove();
134 synchronized (QUEUE) {
135 QUEUE.offer(this);
|
| /external/blktrace/ |
| act_mask.c | 20 DECLARE_MASK_MAP(QUEUE),
|
| /hardware/bsp/intel/peripheral/libupm/src/wt5001/ |
| wt5001.h | 87 QUEUE = 0xa8,
227 * @param index File number to queue
230 bool queue(uint16_t index);
|
| wt5001.cxx | 310 bool WT5001::queue(uint16_t index) function in class:WT5001
313 WT5001_OPCODE_T opcode = QUEUE;
|
| /external/blktrace/btreplay/doc/ |
| btreplay.tex | 71 the only traces you are interested in are \emph{QUEUE} requests --
73 specify the \texttt{-a queue} command line option to \texttt{blktrace}.
129 As noted above, \texttt{btrecord} extracts \texttt{QUEUE} operations from
130 \texttt{blktrace} output. These \texttt{QUEUE} operations indicate the
|
| /packages/apps/Music/src/com/android/music/ |
| MusicUtils.java | 89 public final static int QUEUE = 12;
408 * should be created, and QUEUE if the "current playlist" was
427 sub.add(1, Defs.QUEUE, 0, R.string.queue);
[all...] |
| AlbumBrowserActivity.java | 308 case QUEUE: {
|
| ArtistAlbumBrowserActivity.java | 397 case QUEUE: {
[all...] |
| TrackBrowserActivity.java | 391 // When showing the queue, position the selection on the currently playing track
690 case QUEUE: {
803 // remove track from queue
[all...] |
| /external/clang/include/clang/AST/ |
| RecursiveASTVisitor.h | 138 /// A queue used for performing data recursion over statements.
164 bool TraverseStmt(Stmt *S, DataRecursionQueue *Queue = nullptr);
257 bool TraverseLambdaBody(LambdaExpr *LE, DataRecursionQueue *Queue = nullptr);
264 DataRecursionQueue *Queue = nullptr);
286 // data recursion queue, pass it on; otherwise, discard it. Note that the
288 // class can take a queue, so if we're taking the second arm, make the first
290 #define TRAVERSE_STMT_BASE(NAME, CLASS, VAR, QUEUE) \
299 .Traverse##NAME(static_cast<CLASS *>(VAR), QUEUE) \
307 if (!TRAVERSE_STMT_BASE(Stmt, Stmt, S, Queue)) \
315 bool Traverse##CLASS(CLASS *S, DataRecursionQueue *Queue = nullptr)
[all...] |
