| /bionic/libc/upstream-netbsd/lib/libc/include/isc/ |
| list.h | 28 #define LINK(type) struct { type *prev, *next; }
31 (elt)->link.prev = (type *)(-1); \
36 #define LINKED(elt, link) ((void *)((elt)->link.prev) != (void *)(-1) && \
47 (list).head->link.prev = (elt); \
50 (elt)->link.prev = NULL; \
62 (elt)->link.prev = (list).tail; \
71 (elt)->link.next->link.prev = (elt)->link.prev; \
74 (list).tail = (elt)->link.prev; \
76 if ((elt)->link.prev != NULL)
[all...] |
| /external/pdfium/core/fxcodec/jbig2/ |
| JBig2_ArithIntDecoder.cpp | 28 int* prev,
34 JBig2ArithCtx* pCX = &(*context)[*prev];
36 *prev = ShiftOr(*prev, D);
39 return RecursiveDecode(decoder, context, prev, depth + 1);
55 int PREV = 1;
56 const int S = pArithDecoder->DECODE(&m_IAx[PREV]);
57 PREV = ShiftOr(PREV, S);
60 RecursiveDecode(pArithDecoder, &m_IAx, &PREV, 0)
[all...] |
| /external/oj-libjdwp/src/share/back/ |
| eventHandler.c | 171 #define PREV(node) (PRIVATE_DATA(node)->private_prev)
194 PREV(node) = NULL;
197 PREV(oldHead) = node;
236 PREV(NEXT(node)) = PREV(node);
238 if (PREV(node) != NULL) {
239 NEXT(PREV(node)) = NEXT(node);
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 114 * ("prev") and successor ("next") nodes:
116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
123 * prev reference that terminates any chain of prev references
129 * A new element is added atomically by CASing the null prev or
137 * A "self-link" is a next or prev reference that is the same node:
138 * p.prev == p or p.next == p
145 * (p.prev == null && p.next != p) ||
146 * (p.next == null && p.prev != p)
151 * following prev pointers from head; likewise for tail. However
292 volatile Node<E> prev; field in class:ConcurrentLinkedDeque.Node
423 final Node<E> prev = x.prev; local
656 Node<E> prev = x.prev; local
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedSynchronizer.java | 322 * +------+ prev +-----+ +-----+
335 * <p>The "prev" links (not used in original CLH locks), are mainly
445 volatile Node prev; field in class:AbstractQueuedSynchronizer.Node
455 * to be null, we can scan prev's from the tail to
495 Node p = prev;
529 static final long PREV;
536 PREV = U.objectFieldOffset
537 (Node.class.getDeclaredField("prev"));
618 U.putObject(node, Node.PREV, oldTail);
641 U.putObject(node, Node.PREV, oldTail)
[all...] |
| /packages/screensavers/PhotoTable/src/com/android/dreams/phototable/ |
| PhotoTable.java | 81 private static final int PREV = 0;
227 placeOnDeck(mSelection, PREV);
240 if (hasSelection() && mOnDeck[PREV] != null) {
242 mSelection = mOnDeck[PREV];
243 mOnDeck[PREV] = null;
528 photo.setX(mSlot == PREV ? -2 * width : mWidth + 2 * width);
[all...] |
| /external/libxml2/ |
| xmlregexp.c | 61 * Need PREV to check on a '-' within a Character Group. May only be used
64 #define PREV (ctxt->cur[-1])
561 int stateno, atomno, targetno, prev; local
594 prev = transitions[stateno * (nbatoms + 1) + atomno + 1];
595 if (prev != 0) {
596 if (prev != targetno + 1) {
601 printf(" previous to is %d\n", prev);
[all...] |
| /prebuilts/tools/common/m2/repository/jdom/jdom/1.0/ |
| jdom-1.0.jar | |
| /prebuilts/tools/common/m2/repository/itext/itext/2.0.8/ |
| itext-2.0.8.jar | |
| /prebuilts/misc/common/robolectric/android-all/ |
| android-all-7.0.0_r1-robolectric-0.jar | |
| android-all-7.0.0_r1-robolectric-r1.jar | |
| android-all-7.1.0_r7-robolectric-0.jar | |
| android-all-7.1.0_r7-robolectric-r1.jar | |
