| /external/libtextclassifier/ |
| types.h | 310 NEXT = 1,
|
| /external/libxml2/ |
| uri.c | 124 * Skip to next pointer char, handle escaped sequences
127 #define NEXT(p) ((*p == '%')? p += 3 : p++)
257 NEXT(cur);
293 NEXT(cur);
365 NEXT(cur);
478 NEXT(cur);
562 NEXT(cur);
[all...] |
| pattern.c | 109 struct _xmlStreamCtxt *next;/* link to next sub pattern if | */ member in struct:_xmlStreamCtxt
167 struct _xmlPattern *next; /* next pattern if | is used */ member in struct:_xmlPattern
237 if (comp->next != NULL)
238 xmlFreePattern(comp->next);
274 comp = comp->next;
275 cur->next = NULL;
562 lst = lst->next;
723 while (IS_BLANK_CH(CUR)) NEXT
1793 xmlStreamCtxtPtr next; local
[all...] |
| xpointer.c | 149 for (i = 0;cur != NULL;cur = cur->next) {
194 for (i = 0;i <= no;cur = cur->next) {
860 * NXT(n) returns the n'th next xmlChar. Same as CUR is should be used only
866 * NEXT Skip to the next character, this does the proper decoding
877 while (IS_BLANK_CH(*(ctxt->cur))) NEXT
880 #define NEXT ((*ctxt->cur) ? ctxt->cur++: ctxt->cur)
963 NEXT;
980 NEXT;
987 NEXT;
[all...] |
| catalog.c | 135 struct _xmlCatalogEntry *next; member in struct:_xmlCatalogEntry
285 ret->next = NULL;
367 xmlCatalogEntryPtr next; local
370 next = ret->next;
372 ret = next;
387 xmlCatalogEntryPtr children, next; local
394 next = children->next;
398 children = next;
[all...] |
| /external/oj-libjdwp/src/share/back/ |
| eventHandler.c | 170 #define NEXT(node) (PRIVATE_DATA(node)->private_next)
193 NEXT(node) = oldHead;
210 node = NEXT(node);
233 chain->first = NEXT(node);
235 if (NEXT(node) != NULL) {
236 PREV(NEXT(node)) = PREV(node);
239 NEXT(PREV(node)) = NEXT(node);
264 node = NEXT(node);
309 * is recorded in the ThreadNode. If the next event for the threa
492 HandlerNode *next = NEXT(node); local
653 HandlerNode *next = NEXT(node); local
1336 HandlerNode *next; local
1379 HandlerNode *next = NEXT(node); \/* allows node removal *\/ local
1404 HandlerNode *next = NEXT(node); \/* allows node removal *\/ local
[all...] |
| /external/python/cpython2/Modules/cjkcodecs/ |
| cjkcodecs.h | 109 #define NEXT(i, o) \
|
| /external/python/cpython2/RISCOS/Modules/ |
| drawfmodule.c | 14 #define NEXT(d) ((drawfile_object*)((char*)(d)+(d)->size))
64 d=NEXT(d);
72 for(;n>0;n--) d=NEXT(d);
401 d=NEXT(d);
420 for(;(char*)d<end;d=NEXT(d))
454 for(;q>0;q--) e=NEXT(e);
518 d=NEXT(d);
568 d=NEXT(d);
|
| /external/python/cpython3/Modules/cjkcodecs/ |
| cjkcodecs.h | 109 #define NEXT(i, o) \
|
| /external/scapy/scapy/ |
| automaton.py | 341 NEXT = "NEXT"
736 elif c.type == _ATMT_Command.NEXT:
743 state = next(iterator)
801 next_timeout,timeout_func = next(expirations)
904 def next(self): member in class:Automaton
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 124 * - There is exactly one (last) Node with a null next reference,
183 volatile Node<E> next; field in class:ConcurrentLinkedQueue.Node
201 U.putOrderedObject(node, NEXT, val);
205 return U.compareAndSwapObject(node, NEXT, cmp, val);
214 * - (tmp = head).next != tmp || tmp != head
224 * node with node.next == null) can be reached in O(1) time.
232 * - tail.next may or may not be self-pointing to tail.
294 * Returns the successor of p, or the head node if p.next has been
299 Node<E> next = p.next; local
477 Node<E> next, pred = null; local
731 public E next() { method in class:ConcurrentLinkedQueue.Itr
[all...] |
| ConcurrentLinkedDeque.java | 114 * ("prev") and successor ("next") nodes:
116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
125 * "last" node terminating any chain of next references starting at
130 * next reference in the first or last node to a fresh node
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)
169 * any time, the set of live nodes maintained by prev and next
170 * links are identical, that is, the live nodes found via next
294 volatile Node<E> next; field in class:ConcurrentLinkedDeque.Node
424 final Node<E> next = x.next; local
687 Node<E> next = x.next; local
1411 public E next() { method in class:ConcurrentLinkedDeque.AbstractItr
[all...] |
| LinkedTransferQueue.java | 158 * first unmatched node on match and CASing the next field of the
209 * pointer updates: Threads may sometimes shortcut the "next" link
215 * of costly-to-reclaim garbage caused by the sequential "next"
223 * pointer, we set the "next" link of the previous head to point
227 * adds some further complexity to traversal: If any "next"
356 * to be removed, we can unsplice s by CASing the next field of
361 * (i.e., with null next), then it is pinned as the target node
454 volatile Node next; field in class:LinkedTransferQueue.Node
459 return U.compareAndSwapObject(this, NEXT, cmp, val);
481 U.putObject(this, NEXT, this)
759 Node next = p.next; local
1002 public final E next() { method in class:LinkedTransferQueue.Itr
[all...] |
| SynchronousQueue.java | 141 * except that nodes that appear to be the next ones to become
235 volatile SNode next; // next node in stack field in class:SynchronousQueue.TransferStack.SNode
249 return cmp == next &&
250 U.compareAndSwapObject(this, NEXT, cmp, val);
288 private static final long NEXT;
294 NEXT = U.objectFieldOffset
295 (SNode.class.getDeclaredField("next"));
317 static SNode snode(SNode s, Object e, SNode next, int mode) {
320 s.next = next
537 volatile QNode next; \/\/ next node in queue field in class:SynchronousQueue.TransferQueue.QNode
[all...] |
| ConcurrentSkipListMap.java | 138 * Nodes next v v v v v
150 * basic idea in these lists is to mark the "next" pointers of
158 * use direct CAS'able next pointers. On deletion, instead of
172 * algorithm of changing the next-pointer of a deleted node so
208 * n's next pointer.
210 * 2. CAS n's next pointer to point to a new marker node.
218 * 3. CAS b's next pointer over both n and its marker.
233 * just (b, n, f), although the next field of a marker is
234 * immutable, and once a next field is CAS'ed to point to a
245 * Index levels are maintained as lists with volatile next fields
419 volatile Node<K,V> next; field in class:ConcurrentSkipListMap.Node
2271 Node<K,V> next; field in class:ConcurrentSkipListMap.Iter
2319 public V next() { method in class:ConcurrentSkipListMap.ValueIterator
2327 public K next() { method in class:ConcurrentSkipListMap.KeyIterator
2335 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.EntryIterator
3083 Node<K,V> next; field in class:ConcurrentSkipListMap.SubMap.SubMapIter
3172 action.accept(next()); method
3180 action.accept(next()); method
3190 public V next() { method in class:ConcurrentSkipListMap.SubMap.SubMapValueIterator
3201 public K next() { method in class:ConcurrentSkipListMap.SubMap.SubMapKeyIterator
3216 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.SubMap.SubMapEntryIterator
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/regex/ |
| regcomp.c | 109 const char *next; /* next character in RE */ local
182 #define PEEK() (*p->next)
183 #define PEEK2() (*(p->next+1))
184 #define MORE() (p->next < p->end)
185 #define MORE2() (p->next+1 < p->end)
188 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
190 #define NEXT() (p->next++)
191 #define NEXT2() (p->next += 2
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| RelativeDateTimeFormatter.java | 36 * <li>relative dates without a quantity e.g "next Tuesday"</li>
54 * fmt.format(1, Direction.NEXT, RelativeUnit.DAYS); // "in 1 day"
55 * fmt.format(3, Direction.NEXT, RelativeUnit.DAYS); // "in 3 days"
60 * fmt.format(Direction.NEXT, AbsoluteUnit.SUNDAY); // "next Sunday"
65 * fmt.format(Direction.NEXT, AbsoluteUnit.DAY); // "tomorrow"
225 * Represents a direction for an absolute unit e.g "Next Tuesday"
245 * Next
247 NEXT,
262 * or "next year
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| RelativeDateTimeFormatter.java | 35 * <li>relative dates without a quantity e.g "next Tuesday"</li>
53 * fmt.format(1, Direction.NEXT, RelativeUnit.DAYS); // "in 1 day"
54 * fmt.format(3, Direction.NEXT, RelativeUnit.DAYS); // "in 3 days"
59 * fmt.format(Direction.NEXT, AbsoluteUnit.SUNDAY); // "next Sunday"
64 * fmt.format(Direction.NEXT, AbsoluteUnit.DAY); // "tomorrow"
251 * Represents a direction for an absolute unit e.g "Next Tuesday"
275 * Next
278 NEXT,
295 * or "next year
[all...] |
| /external/llvm/lib/Support/ |
| regcomp.c | 65 char *next; /* next character in RE */ member in struct:parse
122 #define PEEK() (*p->next)
123 #define PEEK2() (*(p->next+1))
124 #define MORE() (p->next < p->end)
125 #define MORE2() (p->next+1 < p->end)
128 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
130 #define NEXT() (p->next++)
131 #define NEXT2() (p->next += 2
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| regcomp.c | 57 char *next; /* next character in RE */ member in struct:parse
114 #define PEEK() (*p->next)
115 #define PEEK2() (*(p->next+1))
116 #define MORE() (p->next < p->end)
117 #define MORE2() (p->next+1 < p->end)
120 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
122 #define NEXT() (p->next++)
123 #define NEXT2() (p->next += 2
[all...] |
| /external/swiftshader/third_party/llvm-subzero/lib/Support/ |
| regcomp.c | 65 char *next; /* next character in RE */ member in struct:parse
122 #define PEEK() (*p->next)
123 #define PEEK2() (*(p->next+1))
124 #define MORE() (p->next < p->end)
125 #define MORE2() (p->next+1 < p->end)
128 #define EAT(c) ((SEE(c)) ? (NEXT(), 1) : 0)
130 #define NEXT() (p->next++)
131 #define NEXT2() (p->next += 2
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedSynchronizer.java | 72 * mechanical sense that when a shared mode acquire succeeds, the next
342 * <p>We also use "next" links to implement blocking mechanics.
344 * predecessor signals the next node to wake up by traversing
345 * next link to determine which thread it is. Determination of
347 * the "next" fields of their predecessors. This is solved
350 * (Or, said differently, the next-links are an optimization
393 * waitStatus value to indicate the next acquireShared should
452 * assign next field of a predecessor until after attachment,
453 * so seeing a null next field does not necessarily mean that
454 * node is at end of queue. However, if a next field appear
460 volatile Node next; field in class:AbstractQueuedSynchronizer.Node
807 Node next = node.next; local
1906 Node next = first.nextWaiter; local
1931 Node next = t.nextWaiter; local
[all...] |
| /external/flatbuffers/src/ |
| idl_parser.cpp | 60 #define NEXT() ECHECK(Next())
242 CheckedError Parser::Next() {
420 // Check if a given token is next.
429 // Expect a given token to be next, consume it, or error if not present.
435 NEXT();
441 NEXT();
487 NEXT();
490 NEXT();
493 NEXT();
1181 const char *next = attribute_.c_str(); local
[all...] |
| /external/opencv/cv/src/ |
| mycvHaarDetectObjects.cpp | 93 struct MyCvHidHaarStageClassifier* next; member in struct:MyCvHidHaarStageClassifier
277 hid_stage_classifier->next = (stage_classifier->next == -1)
278 ? NULL : out->stage_classifier + stage_classifier->next;
282 out->is_tree |= hid_stage_classifier->next != NULL;
456 #define NEXT(n, i) (((n) + (i)/(n)) >> 1)
460 unsigned int n1 = NEXT(n, (unsigned int)number);
464 n1 = NEXT(n, number);
540 // while( ptr && ptr->next == NULL ) ptr = ptr->parent;
546 // ptr = ptr->next;
[all...] |
| /packages/screensavers/PhotoTable/src/com/android/dreams/phototable/ |
| PhotoTable.java | 80 private static final int NEXT = 1;
226 if (hasSelection() && mOnDeck[NEXT] != null) {
228 mSelection = mOnDeck[NEXT];
229 mOnDeck[NEXT] = null;
241 placeOnDeck(mSelection, NEXT);
503 log("load natural %s", (mSlot == NEXT ? "next" : "previous"));
508 if (mSlot == NEXT) {
522 log("natural %s being rendered", (mSlot == NEXT ? "next" : "previous"))
[all...] |
