| /dalvik/vm/mterp/x86-atom/ |
| OP_REM_FLOAT.S | 43 FINISH 2 # jump to next instruction
|
| OP_REM_FLOAT_2ADDR.S | 44 FINISH 1 # jump to next instruction
|
| OP_RSUB_INT.S | 39 FINISH 2 # jump to next instruction
|
| OP_SHL_LONG.S | 40 FINISH 2 # jump to next instruction
|
| OP_SHL_LONG_2ADDR.S | 41 FINISH 1 # jump to next instruction
|
| OP_USHR_LONG.S | 39 FINISH 2 # jump to next instruction
|
| OP_USHR_LONG_2ADDR.S | 41 FINISH 1 # jump to next instruction
|
| binopWide2addr.S | 41 FINISH 1 # jump to next instruction
|
| /development/ndk/platforms/android-3/include/linux/ |
| proc_fs.h | 47 struct proc_dir_entry *next, *parent, *subdir; member in struct:proc_dir_entry
57 struct kcore_list *next; member in struct:kcore_list
|
| /external/apache-harmony/support/src/test/java/tests/support/ |
| Support_ListTest.java | 119 elem = li.next();
130 assertTrue("listIterator(1)", li.next() == list.get(1));
152 assertTrue("list iterator next(): " + i, li.next() == list
158 assertTrue("list iterator next() exception: " + i, exception);
160 assertTrue("list iterator next() exception: " + i, !exception);
194 Object next = li.next(); local
195 assertTrue("list iterator add(), next(): " + next, next == list.get(1))
[all...] |
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| BreakIteratorTest.java | 133 * Class under test for int next(int)
136 assertEquals(BreakIterator.DONE, iterator.next(3));
138 assertEquals(4, iterator.next(3));
139 assertEquals(24, iterator.next(20));
140 assertEquals(23, iterator.next(-1));
141 assertEquals(-1, iterator.next(TEXT.length()));
285 n = bi.next();
286 assertEquals("Assert 0: next() returns incorrect value ", 4, n);
288 assertEquals(BreakIterator.DONE, iterator.next());
290 assertEquals(2, iterator.next());
[all...] |
| /external/apache-http/src/org/apache/http/impl/client/ |
| BasicCookieStore.java | 89 if (cookieComparator.compare(cookie, it.next()) == 0) {
142 if (it.next().isExpired(date)) {
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMAxisIterNodeList.java | 113 while (((node = m_iter.next()) != DTMAxisIterator.END)
135 while ((node = m_iter.next()) != DTMAxisIterator.END) {
|
| DTMAxisIteratorBase.java | 67 * i.e. subsequent call to next() should return END.
142 while (next() != END);
272 while ((node = next()) != DTMAxisIterator.END) {
|
| /external/bluetooth/glib/glib/ |
| gslice.h | 68 #define g_slice_free_chain(type, mem_chain, next) do { \
70 (mem_chain), G_STRUCT_OFFSET (type, next)); \
|
| /external/chromium/base/debug/ |
| leak_tracker.h | 37 // Next, when we believe all instances of net::URLRequest have been deleted:
87 node = node->next()) {
115 node = node->next()) {
|
| /external/chromium/chrome/browser/sync/engine/ |
| change_reorder_buffer.cc | 164 int64 next = to_visit.front(); local
168 i = operations_.find(next);
171 record.id = next;
183 // Now add the children of |next| to |to_visit|.
184 if (parents_of_position_changes.find(next) ==
188 Traversal::LinkSet::const_iterator j = traversal.begin_children(next);
189 Traversal::LinkSet::const_iterator end = traversal.end_children(next);
191 CHECK(j->first == next);
197 syncable::Entry parent(trans, syncable::GET_BY_HANDLE, next);
|
| /external/chromium/testing/gtest/samples/ |
| sample3_unittest.cc | 106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
|
| /external/clang/test/SemaCXX/ |
| uninit-variables.cpp | 76 virtual double *foo(Rdar9188004B *next) const {
77 double *values = next->foo(0);
|
| /external/e2fsprogs/intl/ |
| bindtextdom.c | 116 for (binding = _nl_domain_bindings; binding != NULL; binding = binding->next)
301 new_binding->next = _nl_domain_bindings;
307 while (binding->next != NULL
308 && strcmp (domainname, binding->next->domainname) > 0)
309 binding = binding->next;
311 new_binding->next = binding->next;
312 binding->next = new_binding;
|
| /external/e2fsprogs/lib/ext2fs/ |
| brel.h | 55 errcode_t (*next)(ext2_brel brel, blk_t *old, member in struct:ext2_block_relocation_table
82 #define ext2fs_brel_next(brel, old, ent) ((brel)->next((brel), old, ent))
|
| /external/emma/core/java12/com/vladium/util/ |
| IntIntMap.java | 224 final Entry next = entry.m_next; local
229 buckets [bucketIndex] = next;
231 prev.m_next = next;
238 entry = next;
266 Entry (final int key, final int value, final Entry next)
270 m_next = next;
300 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry local
310 entry = next;
|
| ObjectIntMap.java | 220 final Entry next = entry.m_next; local
225 buckets [bucketIndex] = next;
227 prev.m_next = next;
234 entry = next;
262 Entry (final Object key, final int value, final Entry next)
266 m_next = next;
296 final Entry next = entry.m_next; // remember next pointer because we are going to reuse this entry local
306 entry = next;
|
| XProperties.java | 50 final String n = (String) i.next ();
69 final String n = (String) i.next ();
|
| /external/freetype/src/sfnt/ |
| ttkern.c | 199 FT_Byte* next = base; local
209 next = base + length;
211 if ( next > p_limit ) /* handle broken table */
212 next = p_limit;
217 if ( p + 8 > next )
223 if ( ( next - p ) < 6 * (int)num_pairs ) /* handle broken count */
224 num_pairs = (FT_UInt)( ( next - p ) / 6 );
298 p = next;
|
