Searched refs:next (Results 201 - 225 of 3487) sorted by relevance

1234567891011>>

/external/webkit/Source/JavaScriptCore/profiler/
H A DProfileGenerator.cpp153 for (ProfileNode* next = m_head.get(); next; next = next->firstChild())
154 currentNode = next;
168 for (ProfileNode* next = m_head.get(); next; next = next->lastChild())
169 currentNode = next;
[all...]
/external/webkit/Source/WebCore/inspector/front-end/UglifyJS/
H A Dparse-js.js17 function to fetch the next token.
272 function next(signal_eof) {
324 next();
330 ret += next();
375 var ch = next(true);
393 var digit = parseInt(next(true), 16);
403 var quote = next(), ret = "";
405 var ch = next(true);
415 next();
428 next();
[all...]
/external/e2fsprogs/lib/ext2fs/
H A Dio_manager.c25 char *next, *ptr, *options, *arg; local
42 next = strchr(ptr, '&');
43 if (next)
44 *next++ = 0;
53 ptr = next;
H A Dlink.c40 struct ext2_dir_entry *next; local
54 next = (struct ext2_dir_entry *) (buf + offset + curr_rec_len);
56 (next->inode == 0) &&
57 (offset + curr_rec_len + next->rec_len <= blocksize)) {
58 curr_rec_len += next->rec_len;
78 next = (struct ext2_dir_entry *) (buf + offset +
80 next->inode = 0;
81 next->name_len = 0;
82 ls->err = ext2fs_set_rec_len(ls->fs, rec_len, next);
/external/libsepol/src/
H A Dsidtab.c56 cur = cur->next;
74 newnode->next = prev->next;
75 prev->next = newnode;
77 newnode->next = s->htable[hvalue];
100 cur = cur->next;
107 s->htable[hvalue] = cur->next;
109 last->next = cur->next;
129 cur = cur->next;
[all...]
H A Debitmap.c37 n1 = n1->next;
38 n2 = n2->next;
42 n1 = n1->next;
46 n2 = n2->next;
49 new->next = 0;
51 prev->next = new;
161 n1 = n1->next;
162 n2 = n2->next;
187 new->next = 0;
189 prev->next
[all...]
/external/mdnsresponder/mDNSShared/
H A Ddnsextd.h47 struct DNSZone * next; member in struct:DNSZone
64 struct RRTableElem *next; member in struct:RRTableElem
81 struct AnswerListElem *next; member in struct:AnswerListElem
94 struct LLQEntry *next; member in struct:LLQEntry
115 struct EventSource * next; member in struct:EventSource
/external/libvpx/libvpx/vp8/encoder/
H A Dencodemb.c206 signed char next; member in struct:vp8_token_state
240 int next; local
285 tokens[eob][0].next = 16;
289 next = eob;
302 error0 = tokens[next][0].error;
303 error1 = tokens[next][1].error;
305 rate0 = tokens[next][0].rate;
306 rate1 = tokens[next][1].rate;
309 if (next < 16)
314 mb->token_costs[type][band][pt][tokens[next][
[all...]
/external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/
H A DCollationElementIteratorTest.java51 iterator.next();
62 int order = iterator.next();
66 order = iterator.next();
86 int order = iterator.next();
90 order = iterator.next();
106 int order = iterator.next();
109 order = iterator.next();
120 int order = iterator.next();
124 int order2 = iterator2.next();
135 int order = iterator.next();
[all...]
/external/zlib/src/test/
H A Dinfcover.c51 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
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/qemu/proxy/
H A Dproxy_common.c71 conn->next = NULL;
233 conn->next = after->next;
234 after->next->prev = conn;
235 after->next = conn;
242 conn->prev->next = conn->next;
243 conn->next->prev = conn->prev;
245 conn->next = conn->prev = conn;
263 s_connections->next
291 ProxyConnection* next = conn->next; local
435 ProxyConnection* next = conn->next; local
454 ProxyConnection* next = conn->next; local
[all...]
/external/openfst/src/include/fst/
H A Dpartition.h46 Element() : value(0), next(0), prev(0) {}
47 Element(T v) : value(v), next(0), prev(0) {}
50 Element* next; member in struct:fst::Partition::Element
70 // it current class and placing it at the head of the next class.
112 element->next = classes_[class_id];
126 if (element->next) element->next->prev = element->prev;
127 if (element->prev) element->prev->next = element->next;
128 else classes_[old_class_id] = element->next;
[all...]
/external/qemu/distrib/sdl-1.2.15/src/timer/
H A DSDL_timer.c46 struct _SDL_TimerID *next; member in struct:_SDL_TimerID
107 SDL_TimerID t, prev, next; local
113 for ( prev = NULL, t = SDL_timers; t; t = next ) {
116 next = t->next;
147 prev->next = next;
149 SDL_timers = next;
174 t->next = SDL_timers;
214 for (t = SDL_timers; t; prev=t, t = t->next ) {
[all...]
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dpartition.h41 Element() : value(0), next(0), prev(0) {}
42 Element(T v) : value(v), next(0), prev(0) {}
45 Element* next; member in struct:fst::Partition::Element
65 // it current class and placing it at the head of the next class.
107 element->next = classes_[class_id];
121 if (element->next) element->next->prev = element->prev;
122 if (element->prev) element->prev->next = element->next;
123 else classes_[old_class_id] = element->next;
[all...]
/external/wpa_supplicant_8/hostapd/src/eap_peer/
H A Deap_methods.c31 for (m = eap_methods; m; m = m->next) {
51 for (m = eap_methods; m; m = m->next) {
76 for (m = eap_methods; m; m = m->next) {
103 for (m = eap_methods; m; m = m->next) {
133 for (m = eap_methods; m; m = m->next)
140 for (m = eap_methods; m; m = m->next) {
168 for (m = eap_methods; m; m = m->next)
242 m = m->next;
249 prev->next = m->next;
[all...]
/external/wpa_supplicant_8/src/eap_peer/
H A Deap_methods.c31 for (m = eap_methods; m; m = m->next) {
51 for (m = eap_methods; m; m = m->next) {
76 for (m = eap_methods; m; m = m->next) {
103 for (m = eap_methods; m; m = m->next) {
133 for (m = eap_methods; m; m = m->next)
140 for (m = eap_methods; m; m = m->next) {
168 for (m = eap_methods; m; m = m->next)
242 m = m->next;
249 prev->next = m->next;
[all...]
/external/wpa_supplicant_8/wpa_supplicant/src/eap_peer/
H A Deap_methods.c31 for (m = eap_methods; m; m = m->next) {
51 for (m = eap_methods; m; m = m->next) {
76 for (m = eap_methods; m; m = m->next) {
103 for (m = eap_methods; m; m = m->next) {
133 for (m = eap_methods; m; m = m->next)
140 for (m = eap_methods; m; m = m->next) {
168 for (m = eap_methods; m; m = m->next)
242 m = m->next;
249 prev->next = m->next;
[all...]
/external/webkit/Source/JavaScriptCore/runtime/
H A DLiteralParser.cpp308 if (m_lexer.next() == TokRBracket) {
311 m_lexer.next();
329 m_lexer.next();
339 TokenType type = m_lexer.next();
344 if (m_lexer.next() != TokColon)
347 m_lexer.next();
353 m_lexer.next();
360 TokenType type = m_lexer.next();
366 if (m_lexer.next() != TokColon)
369 m_lexer.next();
[all...]
/external/guava/guava/src/com/google/common/collect/
H A DIterators.java70 public Object next() {
93 @Override public Object next() {
127 public T next() {
128 return iterator.next();
152 iterator.next();
165 if (iterator.next() == null) {
171 if (element.equals(iterator.next())) {
193 if (elementsToRemove.contains(removeFrom.next())) {
217 if (predicate.apply(removeFrom.next())) {
239 if (!elementsToRetain.contains(removeFrom.next())) {
1167 public E next() { method in class:Iterators.PeekingImpl
[all...]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DIterators.java68 public Object next() {
91 @Override public Object next() {
125 public T next() {
126 return iterator.next();
150 iterator.next();
163 if (iterator.next() == null) {
169 if (element.equals(iterator.next())) {
191 if (elementsToRemove.contains(removeFrom.next())) {
215 if (predicate.apply(removeFrom.next())) {
237 if (!elementsToRetain.contains(removeFrom.next())) {
1131 public E next() { method in class:Iterators.PeekingImpl
[all...]
/external/opencv/cv/src/
H A Dcvcontours.cpp83 /* 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
1212 tmp_prev->next
[all...]
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/
H A DServiceLoaderTest.java86 assertEquals("ImplementationOfService", itr.next().myNameIs());
98 assertEquals("ImplementationOfService", ((Service) itr.next())
111 itr.next();
137 itr.next();
161 itr.next();
187 assertEquals("ImplementationOfService", ((Service) itr.next())
196 itr.next();
207 .next()).myNameIs());
214 String name = ((ServiceMoreThanOne) itr.next()).myNameIs();
217 ((ServiceMoreThanOne) itr.next())
[all...]
/external/e2fsprogs/debugfs/
H A Dncheck.c105 goto next;
111 goto next;
114 goto next;
122 goto next;
131 goto next;
137 next:
/external/guava/guava/src/com/google/common/primitives/
H A DUnsignedBytes.java127 int next = toInt(array[i]);
128 if (next < min) {
129 min = next;
147 int next = toInt(array[i]);
148 if (next > max) {
149 max = next;
H A DUnsignedInts.java86 int next = flip(array[i]);
87 if (next < min) {
88 min = next;
106 int next = flip(array[i]);
107 if (next > max) {
108 max = next;

Completed in 4228 milliseconds

1234567891011>>