/bionic/libc/upstream-freebsd/lib/libc/stdlib/ |
quick_exit.c | 38 struct quick_exit_handler *next; member in struct:quick_exit_handler 62 h->next = handlers; 77 for (h = handlers; NULL != h; h = h->next)
|
/cts/tools/dasm/src/java_cup/ |
lalr_transition.java | 22 * @param nxt next transition in linked list. 41 /** Constructor with null next. 70 /** Next transition in linked list of transitions out of a state */ 73 /** Next transition in linked list of transitions out of a state */ 74 public lalr_transition next() {return _next;} method in class:lalr_transition
|
/device/google/contexthub/firmware/os/inc/ |
list.h | 24 struct link_t *prev, *next; member in struct:link_t 28 for ((cur_link) = (list)->next, \ 29 (tmp_link) = (cur_link) ? (cur_link)->next : NULL; \ 31 (cur_link) = (tmp_link), (tmp_link) = (cur_link)->next) 34 link_t list = { .prev = &list, .next = &list } 38 list->prev = list->next = list; 43 if (!list->next) 47 item->next = list; 48 list->prev->next = item; 54 item->prev->next = item->next [all...] |
/device/google/marlin/camera/QCamera2/stack/common/ |
cam_list.h | 44 struct cam_list *next, *prev; member in struct:cam_list 49 ptr->next = ptr; 59 item->next = head; 61 prev->next = item; 67 item->next = node; 69 item->prev->next = item; 76 struct cam_list *next = ptr->next; local 78 next->prev = ptr->prev; 79 prev->next = ptr->next [all...] |
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/support/sym/ |
template.h | 11 struct _sym *next, *prev, **head, *scope;
member in struct:_sym
|
/external/annotation-tools/annotation-file-utilities/src/annotator/specification/ |
CriterionList.java | 31 private CriterionList next; field in class:CriterionList 37 next = null; 48 next = null; 53 next = n; 80 c = c.next; 90 for (CriterionList n = next; n.next != null ; n = n.next) {
|
/external/annotation-tools/asmx/src/org/objectweb/asm/ |
Handler.java | 67 * Next exception handler block info. 69 Handler next; field in class:Handler
|
/external/brotli/c/enc/ |
backward_references_hq.h | 53 |next| is assigned the offset to next node on the path. */ 57 /* Offset to the next node on the path. Equals to command_length() of the 58 next node on the path. For last node equals to BROTLI_UINT32_MAX */ 59 uint32_t next; member in union:ZopfliNode::__anon14414 60 /* Node position that provides next distance for distance cache. */
|
/external/clang/lib/Basic/ |
VersionTuple.cpp | 44 char next = input[0]; local 46 if (next < '0' || next > '9') return true; 47 value = (unsigned) (next - '0'); 50 next = input[0]; 51 if (next < '0' || next > '9') return false; 53 value = value * 10 + (unsigned) (next - '0');
|
/external/deqp/framework/delibs/decpp/ |
deDirectoryIterator.cpp | 66 void DirectoryIterator::next (void) function in class:de::DirectoryIterator 92 next(); 111 void DirectoryIterator::next (void)
|
/external/guava/guava/src/com/google/common/collect/ |
AbstractSequentialIterator.java | 27 * interface for sequences whose next element can always be derived from the 59 * {@link #next()} in order to compute the result of a <i>future</i> call to 60 * {@code next()}. 70 public final T next() { method in class:AbstractSequentialIterator
|
ForwardingIterator.java | 47 public T next() { method in class:ForwardingIterator 48 return delegate().next();
|
PeekingIterator.java | 37 * Returns the next element in the iteration, without advancing the iteration. 52 * #next()} are guaranteed to be equal to each other. 55 E next(); method in interface:PeekingIterator 61 * #peek()} has occurred since the most recent call to {@link #next()}. 64 * since the most recent call to {@link #next()} and this implementation
|
/external/hamcrest/hamcrest-core/src/main/java/org/hamcrest/internal/ |
ArrayIterator.java | 23 public Object next() { method in class:ArrayIterator
|
SelfDescribingValueIterator.java | 20 public SelfDescribing next() { method in class:SelfDescribingValueIterator 21 return new SelfDescribingValue<T>(values.next());
|
/external/icu/android_icu4j/src/main/java/android/icu/util/ |
RangeValueIterator.java | 40 * while (iterator.next(result)) { 91 * <p>Returns the next maximal result range with a common value and returns 99 public boolean next(Element element); method in interface:RangeValueIterator
|
ValueIterator.java | 29 * while (iterator.next(result)) { 42 * <p>The return result container of each iteration. Stores the next 71 * <p>Returns the next result for this iteration and returns 79 public boolean next(Element element); method in interface:ValueIterator 90 * <p>If setRange(start, end) is not performed before next(element) is 95 * implementation, next(element) will always return false.
|
/external/icu/icu4c/source/common/ |
usetiter.cpp | 41 * Returns the next element in the set. 49 UBool UnicodeSetIterator::next() { function in class:UnicodeSetIterator
|
/external/icu/icu4c/source/test/intltest/ |
tokiter.cpp | 28 UBool TokenIterator::next(UnicodeString& token, UErrorCode& ec) { function in class:TokenIterator 57 * Read the next token from 'this->line' and append it to 'token'.
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
UForwardCharacterIterator.java | 34 * <p>ForwardCharacterIterator provides next() to access 52 * while((c=it.next())!=UForwardCharacterIterator.DONE) { 69 * Returns the UTF16 code unit at index, and increments to the next 73 * @return the next UTF16 code unit, or DONE if the index is at the limit 77 public int next(); method in interface:UForwardCharacterIterator 80 * Returns the code point at index, and increments to the next code 83 * <code>next()</code>. Otherwise the iterator is incremented past 86 * @return the next codepoint in text, or DONE if the index is at
|
/external/javassist/src/main/javassist/convert/ |
Transformer.java | 34 private Transformer next; field in class:Transformer 37 next = t; 40 public Transformer getNext() { return next; }
|
/external/libevent/include/event2/ |
keyvalq_struct.h | 40 struct type *tqe_next; /* next element */ \ 41 struct type **tqe_prev; /* address of previous next element */ \ 59 TAILQ_ENTRY(evkeyval) next; member in struct:evkeyval
|
/external/libnl/python/netlink/ |
utils.h | 2 struct list_head *next; member in struct:list_head 10 return head->next == head; 15 new->next = head->next; 16 head->next = new; 21 prev->next = entry->next; 22 entry->next = entry; 26 for (n = (head), pos = (head)->next; pos != (head); \ 27 n = pos, pos = n->next) [all...] |
/external/ltp/utils/ffsb-6.0-rc2/ |
cirlist.h | 27 struct cnode *next; member in struct:cnode
|
/external/mesa3d/src/gallium/auxiliary/draw/ |
draw_vs_llvm.c | 15 * next paragraph) shall be included in all copies or substantial portions 72 struct draw_llvm_variant_list_item *next = next_elem(li); local 74 li = next;
|