| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/ |
| H A D | ConcurrentLinkedQueue.java | 21 * The <em>tail</em> of the queue is that element that has been on the
23 * are inserted at the tail of the queue, and the queue retrieval
76 * reached in O(1) time from tail, but tail is merely an
100 * Both head and tail are permitted to lag. In fact, failing to
106 * Since head and tail are updated concurrently and independently,
107 * it is possible for tail to lag behind head (why not)?
122 * Both head and tail may or may not point to a Node with a
124 * be null. Upon creation, both head and tail refer to a dummy
125 * Node with null item. Both head and tail ar
200 private transient volatile Node<E> tail = head; field in class:ConcurrentLinkedQueue
[all...] |
| H A D | SynchronousQueue.java | 115 * cancelled. But if it may be pinned as the current tail, it must
540 transient volatile QNode tail; field in class:SynchronousQueue.TransferQueue
551 tail = h;
569 (TransferQueue.class, QNode.class, "tail");
572 * Tries to cas nt as new tail.
575 if (tail == t)
608 * advance head and tail on behalf of other stalled/slow
612 * seeing uninitialized head or tail values. This never
624 QNode t = tail;
631 if (t != tail) // inconsisten
[all...] |
| /dalvik/docs/ |
| H A D | prettify.js | 567 var tail = sourceCode; variable
569 while (tail.length) {
574 var patternParts = shortcuts[tail.charAt(0)];
576 match = tail.match(patternParts[1]);
587 match = tail.match(patternParts[1]);
597 token = tail.substring(0, 1);
603 tail = tail.substring(token.length);
|
| /dalvik/libcore/luni-kernel/src/main/java/java/lang/ |
| H A D | Class.java | 1534 * @param tail the second source array
1537 private static <T extends Object> T[] arraycopy(T[] result, T[] head, T[] tail) { argument
1539 System.arraycopy(tail, 0, result, head.length, tail.length);
|
| /dalvik/libcore/xml/src/main/java/org/apache/xpath/axes/ |
| H A D | WalkerFactory.java | 859 StepPattern tail = step;
935 tail = pat;
942 XNumber score = tail.getStaticScore();
943 tail.setRelativePathPattern(selfPattern);
944 tail.setStaticScore(score);
967 * @param tail The step that is the first step analyzed, but the last
968 * step in the relative match linked list, i.e. the tail.
980 int analysis, StepPattern tail, StepPattern head)
978 createDefaultStepPattern( Compiler compiler, int opPos, MatchPatternIterator mpi, int analysis, StepPattern tail, StepPattern head) argument
|
| /dalvik/vm/ |
| H A D | Init.c | 827 const char* tail; local
831 tail = argv[i] + 10;
833 tail = argv[i] + 15;
835 if (strncmp(tail, "help", 4) == 0 || !parseJdwpOptions(tail)) {
|
| /dalvik/libcore/concurrent/src/main/java/java/util/concurrent/locks/ |
| H A D | AbstractQueuedSynchronizer.java | 276 * tail. To dequeue, you just set the head field.
279 * head | | <---- | | <---- | | tail
284 * operation on "tail", so there is a simple atomic point of
305 * updated "tail" when a node's successor appears to be null.
320 * is constructed and head and tail pointers are set upon first
411 * to be null, we can scan prev's from the tail to
484 private transient volatile Node tail; field in class:AbstractQueuedSynchronizer
541 Node t = tail;
544 tail = head;
564 Node pred = tail;
[all...] |
| /dalvik/libcore/sql/src/main/native/ |
| H A D | sqlite_jni.c | 101 char *tail; /* tail SQL string */ member in struct:hvm
2709 const char *tail; local
2730 if (!v->tail) {
2737 ret = sqlite3_prepare_v2((sqlite3 *) v->h->sqlite, v->tail, -1,
2738 (sqlite3_stmt **) &svm, &tail);
2740 ret = sqlite3_prepare((sqlite3 *) v->h->sqlite, v->tail, -1,
2741 (sqlite3_stmt **) &svm, &tail);
2750 ret = sqlite_compile((sqlite *) v->h->sqlite, v->tail,
2751 &tail, (sqlite_v
2827 const char *tail; local
3009 const char *tail; local
3283 char *tail; local
3344 const jchar *sql16, *tail = 0; local
[all...] |