| /external/protobuf/src/google/protobuf/io/ |
| zero_copy_stream.h | 60 // input->Next(&buffer, &size);
78 // while (input->Next(&buffer, &size)) {
94 // while (output->Next(&buffer, &size)) {
143 // as repeatedly calling Next() eventually yields a buffer with non-zero
145 virtual bool Next(const void** data, int* size) = 0;
147 // Backs up a number of bytes, so that the next call to Next() returns
148 // data again that was already returned by the last call to Next(). This
150 // to a certain point in the input, then return. If Next() returns a
155 // * The last method called must have been Next()
[all...] |
| /system/extras/showslab/ |
| showslab.c | 21 struct slab_info *next; member in struct:slab_info
141 prev->next = p;
149 p->next = NULL;
163 struct slab_info *temp = list->next;
176 p->next = a;
178 a = a->next;
180 p->next = b;
182 b = b->next;
186 p->next = (a == NULL) ? b : a;
187 return list.next;
[all...] |
| /external/chromium_org/third_party/icu/source/test/intltest/ |
| itercoll.cpp | 45 * Test for CollationElementIterator previous and next for the whole set of
184 if (U_FAILURE(status) || iter->next(status) != UCOL_NULLORDER) {
234 int32_t c = iter2->next(status);
241 errln("iter2->next() returned an error.");
246 c = iter2->next(status);
277 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
283 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
349 int32_t e0 = i->next(status); // save the first collation element
353 errln("call to i->next() failed. err=%s", u_errorName(status));
365 i->next(status); // but only use up half of i
[all...] |
| /external/icu4c/test/intltest/ |
| itercoll.cpp | 45 * Test for CollationElementIterator previous and next for the whole set of
184 if (U_FAILURE(status) || iter->next(status) != UCOL_NULLORDER) {
234 int32_t c = iter2->next(status);
241 errln("iter2->next() returned an error.");
246 c = iter2->next(status);
277 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
283 || iter1->next(status) != (int32_t)UCOL_NULLORDER) {
349 int32_t e0 = i->next(status); // save the first collation element
353 errln("call to i->next() failed. err=%s", u_errorName(status));
365 i->next(status); // but only use up half of i
[all...] |
| /external/zlib/src/test/ |
| infcover.c | 51 allocation routines on the next zlib initialization
59 struct mem_item *next; /* pointer to next item in list, or NULL */ member in struct:mem_item
99 item->next = zone->first;
114 struct mem_item *item, *next; local
123 /* point next to the item that matches ptr, or NULL if not found -- remove
125 next = zone->first;
126 if (next) {
127 if (next->ptr == ptr)
128 zone->first = next->next; /* first one is it, remove from list *
203 struct mem_item *item, *next; local
248 unsigned next, val; local
449 static unsigned int next = 0; local
622 code *next, table[ENOUGH_DISTS]; local
[all...] |
| /external/opencv/cv/src/ |
| cvcontours.cpp | 83 /* retrieves next point of the chain curve and updates reader */
131 struct _CvContourInfo *next; /* next contour with the same mark value */ member in struct:_CvContourInfo
247 scanner->frame_info.next = 0;
637 writer.seq->first->next == writer.seq->first) );
826 writer.seq->first->next == writer.seq->first) );
932 cur = cur->next;
997 l_cinfo->next = scanner->cinfo_table[nbd - 2];
1128 struct CvLinkedRunPoint* next; member in struct:CvLinkedRunPoint
[all...] |
| /libcore/luni/src/main/java/java/util/ |
| Scanner.java | 306 * before the next line terminator.
397 * before the next line terminator.
524 * and the next token matches the given pattern. This method will block if the data is
529 * @return {@code true} if this {@code Scanner} has more tokens and the next token
539 // if the next token exists, set the match region, otherwise return
547 // check whether next token matches the specified pattern
559 * and the next token matches a pattern compiled from the given string. This method will
566 * next token, {@code false} otherwise.
575 * Returns whether the next token can be translated into a valid
578 * @return {@code true} if the next token can be translated into a vali
933 public String next() { method in class:Scanner
953 public String next(Pattern pattern) { method in class:Scanner
990 public String next(String pattern) { method in class:Scanner
[all...] |
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 87 * ("prev") and successor ("next") nodes:
89 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
98 * "last" node terminating any chain of next references starting at
103 * next reference in the first or last node to a fresh node
110 * A "self-link" is a next or prev reference that is the same node:
111 * p.prev == p or p.next == p
118 * (p.prev == null && p.next != p) ||
119 * (p.next == null && p.prev != p)
142 * any time, the set of live nodes maintained by prev and next
143 * links are identical, that is, the live nodes found via next
267 volatile Node<E> next; field in class:ConcurrentLinkedDeque.Node
401 final Node<E> next = x.next; local
664 Node<E> next = x.next; local
1333 public E next() { method in class:ConcurrentLinkedDeque.AbstractItr
[all...] |
| /external/llvm/test/Transforms/LoopVectorize/ |
| intrinsic.ll | 15 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry ]
21 %indvars.iv.next = add i64 %indvars.iv, 1
22 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
41 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry ]
47 %indvars.iv.next = add i64 %indvars.iv, 1
48 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
67 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry ]
73 %indvars.iv.next = add i64 %indvars.iv, 1
74 %lftr.wideiv = trunc i64 %indvars.iv.next to i32
93 %indvars.iv = phi i64 [ %indvars.iv.next, %for.body ], [ 0, %entry
[all...] |
| /system/extras/ext4_utils/ |
| allocate.c | 42 struct region *next; member in struct:region
66 struct xattr_list_element *next; member in struct:xattr_list_element
86 for (element = aux_info.xattrs; element != NULL; element = element->next) {
98 element->next = aux_info.xattrs;
105 reg->prev->next = reg->next;
107 if (reg->next)
108 reg->next->prev = reg->prev;
111 list->first = reg->next;
116 reg->next = NULL
627 struct region *next; local
800 struct region *next = reg->next; local
807 struct region *next = reg->next; local
[all...] |
| /external/llvm/test/Transforms/InstCombine/ |
| sub.ll | 53 ; CHECK-NEXT: xor i32 %B, -1
54 ; CHECK-NEXT: %D = and i32
55 ; CHECK-NEXT: ret i32 %D
226 ; CHECK-NEXT: = trunc i64 %A to i32
227 ; CHECK-NEXT: ret i32
237 ; CHECK-NEXT: ret i64 %A
247 ; CHECK-NEXT: sub i64 0, %A
248 ; CHECK-NEXT: ret i64
259 ; CHECK-NEXT: shl nuw i64 %A, 1
260 ; CHECK-NEXT: ret i64
[all...] |
| /external/wpa_supplicant_8/src/ap/ |
| ieee802_11_auth.c | 35 struct hostapd_cached_radius_acl *next; member in struct:hostapd_cached_radius_acl
51 struct hostapd_acl_query_data *next; member in struct:hostapd_acl_query_data
71 acl_cache = acl_cache->next;
92 copy_from = copy_from->next;
93 copy_to = &((*copy_to)->next);
111 for (entry = hapd->acl_cache; entry; entry = entry->next) {
296 query = query->next;
327 query->next = hapd->acl_queries;
353 prev->next = entry->next;
[all...] |
| /packages/experimental/procstatlog/ |
| procstatlog.c | 286 struct data *next = stats; local
290 read_data(next++, filename);
292 read_data(next++, filename);
296 next += read_proc_yaffs(next, stats + stats_count - next);
297 next += read_lines("/proc/net/dev", ':', NULL, 0, next, end - next);
298 next += read_lines("/proc/stat", ' ', NULL, 0, next, end - next)
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 42 for label, next in state.arcs.iteritems():
43 arcs.append((self.make_label(c, label), dfa.index(next)))
121 for label, next in state.arcs.iteritems():
185 for label, next in state.arcs:
187 addclosure(next, base)
192 for label, next in nfastate.arcs:
194 addclosure(next, arcs.setdefault(label, {}))
210 for label, next in state.arcs:
211 if next in todo:
212 j = todo.index(next)
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/pgen2/ |
| pgen.py | 42 for label, next in state.arcs.iteritems():
43 arcs.append((self.make_label(c, label), dfa.index(next)))
121 for label, next in state.arcs.iteritems():
185 for label, next in state.arcs:
187 addclosure(next, base)
192 for label, next in nfastate.arcs:
194 addclosure(next, arcs.setdefault(label, {}))
210 for label, next in state.arcs:
211 if next in todo:
212 j = todo.index(next)
[all...] |
| /external/tinyxml/ |
| tinyxml.cpp | 151 next = 0;
163 node = node->next;
184 node = node->next;
198 node->next = 0;
201 lastChild->next = node;
230 node->next = beforeThis;
234 beforeThis->prev->next = node;
257 node->next = afterThis->next;
258 if ( afterThis->next )
[all...] |
| /external/chromium_org/third_party/icu/source/common/unicode/ |
| strenum.h | 25 * method that returns the next UnicodeString since in C++ this can
38 * 'next' that you call. In general the StringEnumeration is
46 * <p>The pointers returned by next, unext, and snext become invalid
47 * upon any subsequent call to the enumeration's destructor, next,
100 * <p>Returns the next element as a NUL-terminated char*. If there
107 * deleted by the caller. The pointer is valid until the next call
108 * to next, unext, snext, reset, or the enumerator's destructor.</p>
128 virtual const char* next(int32_t *resultLength, UErrorCode& status);
131 * <p>Returns the next element as a NUL-terminated UChar*. If there
138 * deleted by the caller. The pointer is valid until the next cal
[all...] |
| /external/chromium_org/third_party/leveldatabase/src/util/ |
| cache.cc | 29 LRUHandle* next; member in struct:leveldb::__anon13680::LRUHandle
40 if (next == this) {
118 LRUHandle* next = h->next_hash; local
123 h = next;
164 // lru.prev is newest entry, lru.next is oldest entry.
173 lru_.next = &lru_;
178 for (LRUHandle* e = lru_.next; e != &lru_; ) {
179 LRUHandle* next = e->next; local
182 e = next;
[all...] |
| /external/libvpx/libvpx/vpx_mem/memory_manager/ |
| hmm_base.c | 29 to_remove->prev->next = to_remove->next;
31 if (to_remove->next)
32 to_remove->next->prev = to_remove->prev;
57 ptr_rec_ptr->next = bin_front_ptr->next;
58 bin_front_ptr->next = ptr_rec_ptr;
60 if (ptr_rec_ptr->next)
61 ptr_rec_ptr->next->prev = ptr_rec_ptr;
64 ptr_rec_ptr->next = 0
150 ptr_record *next = ptr_rec_ptr->next; variable
[all...] |
| /external/llvm/test/CodeGen/X86/ |
| vselect-minmax.ll | 11 %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
21 %index.next = add i64 %index, 16
22 %loop = icmp eq i64 %index.next, 16384
43 %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
53 %index.next = add i64 %index, 16
54 %loop = icmp eq i64 %index.next, 16384
75 %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body ]
85 %index.next = add i64 %index, 16
86 %loop = icmp eq i64 %index.next, 16384
107 %index = phi i64 [ 0, %vector.ph ], [ %index.next, %vector.body
[all...] |
| /external/qemu/ |
| console.h | 52 QTAILQ_ENTRY(QEMUPutKBDEntry) next; member in struct:QEMUPutKBDEntry
58 QTAILQ_ENTRY(QEMUPutLEDEntry) next; member in struct:QEMUPutLEDEntry
188 struct DisplayChangeListener *next; member in struct:DisplayChangeListener
200 struct DisplayUpdateListener *next; member in struct:DisplayUpdateListener
223 struct DisplayState *next; member in struct:DisplayState
270 dcl->next = ds->listeners;
277 dul->next = ds->update_listeners;
289 dcl = dcl->next;
295 dul = dul->next;
309 dcl = dcl->next;
[all...] |
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
| TryListBuilder.java | 50 firstTryRange.next = lastTryRange;
57 public TryRange next = null; field in class:TryListBuilder.TryRange
70 this.next = null;
75 /*we use a dummy last item, so this.next will always
77 this.next.previous = tryRange;
78 tryRange.next = this.next;
80 this.next = tryRange;
87 this.previous.next = tryRange;
91 tryRange.next = this
[all...] |
| /system/core/sh/ |
| nodes.c | 162 calcsize(n->nclist.next);
168 calcsize(n->narg.next);
176 calcsize(n->nfile.next);
181 calcsize(n->ndup.next);
186 calcsize(n->nhere.next);
203 lp = lp->next;
260 new->nclist.next = copynode(n->nclist.next);
266 new->narg.next = copynode(n->narg.next);
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ReverseAxesWalker.java | 70 * Get the next node in document order on the axes.
72 * @return the next node in document order on the axes, or null.
79 int next = m_iterator.next(); local
84 if (DTM.NULL == next)
87 return next;
150 int next; local
152 while (DTM.NULL != (next = clone.nextNode()))
213 int next; local
215 while (DTM.NULL != (next = clone.nextNode())
[all...] |
| /external/chromium/testing/gtest/samples/ |
| sample3-inl.h | 47 // type E and a pointer to the next node.
56 // Gets the next node in the queue.
57 QueueNode* next() { return next_; } function in class:QueueNode
58 const QueueNode* next() const { return next_; } function in class:QueueNode
61 // Creates a node with a given element value. The next pointer is
88 QueueNode<E>* next = node->next(); local
91 node = next;
93 next = node->next();
[all...] |
