| /bionic/libc/kernel/common/linux/ |
| interrupt.h | 14 *** Any manual change here will be lost the next time this script will
72 struct irqaction *next; member in struct:irqaction
111 struct tasklet_struct *next; member in struct:tasklet_struct
|
| ioport.h | 14 *** Any manual change here will be lost the next time this script will
34 struct resource_list *next; member in struct:resource_list
|
| proc_fs.h | 14 *** Any manual change here will be lost the next time this script will
55 struct proc_dir_entry *next, *parent, *subdir; member in struct:proc_dir_entry
66 struct kcore_list *next; member in struct:kcore_list
|
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/location/ |
| LocationModeTestActivity.java | 92 next(); method
197 protected void next() { method in class:LocationModeTestActivity
223 next(); method
231 next(); method
242 next(); method
249 next(); method
256 next(); method
263 next(); method
|
| /cts/tools/tradefed-host/src/com/android/cts/tradefed/testtype/ |
| TestPackageXmlParser.java | 122 classNameBuilder.append(iter.next());
|
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BasicBlocker.java | 228 * target and next instruction begin new blocks.)
231 // Fall through to next case...
234 int next = offset + length; local
236 addWorkIfNecessary(next, true);
237 targetLists[offset] = IntList.makeImmutable(next, target);
276 for (int at = 0, next; /*at*/; at = next) {
277 next = Bits.findFirst(blockSet, at + 1);
278 if (next < 0) {
286 * there isn't any, then "next" is the sole target
428 int next = offset + length; local
[all...] |
| /dalvik/vm/interp/ |
| Jit.h | 117 unsigned int next; member in struct:JitTraceProfCounters
134 u2 chain; /* Index of next in chain */
|
| /development/ndk/platforms/android-3/include/linux/ |
| interrupt.h | 61 struct irqaction *next; member in struct:irqaction
100 struct tasklet_struct *next; member in struct:tasklet_struct
|
| ioport.h | 27 struct resource_list *next; member in struct:resource_list
|
| personality.h | 74 struct exec_domain *next; member in struct:exec_domain
|
| 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
|
| /development/tools/elftree/ |
| elftree.c | 53 struct seen *next; member in struct:seen
65 for (s = t->seen; s; s = s->next) {
78 s->next = t->seen;
94 struct search_dir *next; member in struct:search_dir
102 dir->next = dirs;
156 for (dir = dirs; dir; dir = dir->next) {
|
| /development/tools/recovery_l10n/src/com/android/recovery_l10n/ |
| Main.java | 84 private Runnable next; field in class:Main.TextCapture
86 TextCapture(Locale thisLocale, Locale nextLocale, Runnable next) {
89 this.next = next;
100 if (next != null) {
101 mText.postDelayed(next, 200);
|
| /external/aac/libFDK/include/ |
| FDK_tools_rom.h | 254 const struct element_list *next[2]; member in struct:element_list
|
| /external/antlr/antlr-3.4/runtime/C/include/ |
| antlr3commontreenodestream.h | 67 /// Get tree node at current input pointer + i ahead where i=1 is next node.
231 /// this node yet; next consume() request will set currentIndex to 0.
236 /// IntStream.next is hence 1 + this value. Size will be same.
274 pANTLR3_BASE_TREE (*next) (struct ANTLR3_COMMON_TREE_NODE_STREAM_struct * ctns); member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
|
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| token.rb | 299 defines methods #next and #each, which provide basic
313 def next method in class:ANTLR3.TokenSource
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
| RubyTarget.java | 55 add( "def" ); add( "next" ); add( "unless" );
148 char next; local
156 next = value.charAt( i + 1 );
161 if ( Character.isDigit( next ) || Character.isWhitespace( next ) ) {
163 } else if ( Character.isLowerCase( cur ) && Character.isUpperCase( next ) ) {
166 } else if ( ( i < cliff - 1 ) && Character.isUpperCase( cur ) && Character.isUpperCase( next ) ) {
171 /* if next is the start of word (indicated when peek is lowercase)
178 if ( Character.isLetter( next ) ) {
245 char next; local
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
| AbstractSequentialListTest.java | 183 public Object next() { method in class:AbstractSequentialListTest.MockListIterator
|
| ServiceLoaderTest.java | 86 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()).myNameIs())
[all...] |
| /external/apache-harmony/text/src/test/java/org/apache/harmony/text/tests/java/text/ |
| AttributedStringTest.java | 39 while ((ch = it.next()) != CharacterIterator.DONE)
105 public char next() { method in class:AttributedStringTest.testAttributedCharacterIterator
|
| CollationElementIteratorTest.java | 51 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/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 204 * Traverse to the next node after the current node.
209 * @return the next node in the iteration, or DTM.NULL.
211 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AncestorTraverser
217 * Traverse to the next node after the current node that is matched
224 * @return the next node in the iteration, or DTM.NULL.
226 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AncestorTraverser
276 ? context : next(context, context, expandedTypeID);
287 * Traverse to the next node after the current node.
292 * @return the next node in the iteration, or DTM.NULL.
294 public int next(int context, int current method in class:DTMDefaultBaseTraversers.AttributeTraverser
310 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AttributeTraverser
460 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.ChildTraverser
475 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ChildTraverser
558 int next = findElementFromIndex(nsIndex, lnIndex, nextPotential); local
701 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.DescendantTraverser
730 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.DescendantTraverser
805 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AllFromNodeTraverser
926 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.FollowingTraverser
958 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.FollowingTraverser
994 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.FollowingSiblingTraverser
1009 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.FollowingSiblingTraverser
1036 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.NamespaceDeclsTraverser
1054 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.NamespaceDeclsTraverser
1087 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.NamespaceTraverser
1105 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.NamespaceTraverser
1183 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.ParentTraverser
1201 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.ParentTraverser
1245 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingTraverser
1274 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingTraverser
1309 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingAndAncestorTraverser
1337 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingAndAncestorTraverser
1370 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.PrecedingSiblingTraverser
1385 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.PrecedingSiblingTraverser
1443 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.SelfTraverser
1458 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.SelfTraverser
1504 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1530 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.AllFromRootTraverser
1579 public int next(int context, int current) method in class:DTMDefaultBaseTraversers.RootTraverser
1594 public int next(int context, int current, int expandedTypeID) method in class:DTMDefaultBaseTraversers.RootTraverser
[all...] |
| ExpandedNameTable.java | 46 /** Next available extended type */
199 for (HashEntry e = m_table[index]; e != null; e = e.next)
260 old = old.next;
266 e.next = m_table[newIndex];
372 * The field next points to the next entry which is hashed into
380 HashEntry next; field in class:ExpandedNameTable.HashEntry
382 protected HashEntry(ExtendedType key, int value, int hash, HashEntry next)
387 this.next = next;
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| SuballocatedIntVector.java | 176 // Cache the current row of m_map. Next m_blocksize-1
364 int[] next=m_map[index+1]; local
365 if(next!=null)
366 block[m_blocksize-1]=(next!=null) ? next[0] : 0;
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| AxesWalker.java | 101 * Do a deep clone of this walker, including next and previous walkers.
256 * Set the next walker in the location step chain.
267 * Get the next walker in the location step chain.
302 * This is simply a way to bottle-neck the return of the next node, for
316 * Get the next node in document order on the axes.
318 * @return the next node in document order on the axes, or null.
335 m_currentNode = m_traverser.next(m_root, m_currentNode);
345 * Moves the <code>TreeWalker</code> to the next visible node in document
347 * current node has no next node, or if the search for nextNode attempts
351 * next node in the TreeWalker's logical view
439 int next; local
[all...] |
