/openjdk7/jdk/src/solaris/native/sun/awt/ |
H A D | awt_xembed_server.c | 114 struct _xembed_server_data * next; member in struct:_xembed_server_data 126 temp = temp->next; 140 temp = temp->next; 159 temp = temp->next; 177 data->next = xembed_list; 190 *temp = (*temp)->next; 196 temp = &(*temp)->next;
|
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/processing/ |
H A D | JavacProcessingEnvironment.java | 369 public Processor next() { method in class:JavacProcessingEnvironment.ServiceIterator 371 return (Processor)(iterator.next()); 420 String processorName = names.next(); 449 public Processor next() { method in class:JavacProcessingEnvironment.NameProcessIterator 605 public ProcessorState next() { method in class:JavacProcessingEnvironment.DiscoveredProcessors.ProcessorStateIterator 608 return innerIter.next(); 614 ProcessorState ps = new ProcessorState(psi.processorIterator.next(), 642 ProcessorState ps = innerIter.next(); 707 ProcessorState ps = psi.next(); 910 /** Create the next roun 911 Round next(Set<JavaFileObject> newSourceFiles, Map<String, JavaFileObject> newClassFiles) { method in class:JavacProcessingEnvironment.Round [all...] |
/openjdk7/langtools/src/share/classes/com/sun/tools/javac/util/ |
H A D | Names.java | 140 public final Name next; field in class:Names 256 next = fromString("next");
|
/openjdk7/jdk/src/share/demo/jvmti/hprof/ |
H A D | hprof_table.c | 57 * reference to the first TableIndex in the hash bucket, the next 58 * field of the TableElement takes you to the next item in the hash 106 TableIndex next; /* The next TableElement in the hash bucket chain. */ member in struct:TableElement 234 i = prev_e->next; 238 ltable->hash_buckets[bucket] = element->next; 240 prev_e->next = element->next; 242 element->next = 0; 398 element->next 441 TableIndex next; local [all...] |
/openjdk7/jdk/src/share/native/sun/java2d/cmm/lcms/ |
H A D | lcms2_internal.h | 240 struct _cmsSubAllocator_chunk_st* next; member in struct:_cmsSubAllocator_chunk_st
|
/openjdk7/jdk/src/share/demo/jvmti/heapTracker/ |
H A D | heapTracker.c | 138 /* The next TraceInfo in the hash bucket chain */ 139 struct TraceInfo *next; member in struct:TraceInfo 223 tinfo->next = gdata->hashBuckets[hashIndex]; 273 prev->next = tinfo->next; 274 tinfo->next = gdata->hashBuckets[hashIndex]; 281 tinfo = tinfo->next; 699 tinfo = tinfo->next; 851 char *next; local 862 next [all...] |
/openjdk7/jdk/src/share/classes/sun/java2d/loops/ |
H A D | ProcessPath.java | 1526 * NaN and Infinity values. Skipping next path segment in 1681 pi.next(); 1705 public Point next; field in class:ProcessPath.Point 1721 Edge next; field in class:ProcessPath.Edge 1782 Point np = pnt.next; 1820 ne.next = head; 1830 Edge nextp = e.next; 1832 prevp.next = nextp; 1857 while (s != head.next && wasSwap) { 1859 q = p.next; [all...] |
H A D | SurfaceType.java | 386 private SurfaceType next; field in class:SurfaceType 391 next = parent; 398 next = parent; 426 return next;
|
/openjdk7/jdk/src/share/classes/sun/net/ftp/impl/ |
H A D | FtpClient.java | 1195 * @param offset the offset in the remote file at which to start the next 1841 public FtpDirEntry next() { method in class:FtpClient.FtpFileIterator 2117 * pre-allocate the specified number of bytes for the next transfer.
|
/openjdk7/jdk/src/share/native/sun/security/pkcs11/wrapper/ |
H A D | pkcs11wrapper.h | 419 /* Pointer to the next node in the list. */ 420 struct NotifyListNode *next; member in struct:NotifyListNode
|
/openjdk7/jaxp/src/com/sun/org/apache/xalan/internal/xsltc/dom/ |
H A D | SAXImpl.java | 196 while ((anode = ancestors.next()) != DTM.NULL) { 200 while ((nsnode = namespaces.next()) != DTM.NULL) { 280 return makeNode(iter.next()); 335 * Get the next node in the iteration. 337 * @return The next node handle in the iteration, or END. 339 public int next() { method in class:SAXImpl.TypedNamespaceIterator 344 for (node = super.next(); node != END; node = super.next()) { 412 public int next() method in class:SAXImpl.NodeValueIterator 415 while ((node = _source.next()) ! 1328 public int next() { method in class:SAXImpl.NamespaceWildcardIterator 1435 public int next() { method in class:SAXImpl.NamespaceChildrenIterator 1517 public int next() { method in class:SAXImpl.NamespaceAttributeIterator [all...] |
H A D | SimpleResultTreeImpl.java | 103 public int next() method in class:SimpleResultTreeImpl.SimpleIterator 203 public int next() method in class:SimpleResultTreeImpl.SingletonIterator 228 public int next() { return DTM.NULL; } 449 while ((node = nodes.next()) != DTM.NULL)
|
/openjdk7/jaxp/src/com/sun/org/apache/xerces/internal/impl/ |
H A D | XMLDocumentFragmentScannerImpl.java | 231 /** Debug driver next */ 234 /** Debug driver next */ 437 * that the scanner should only scan the next portion 451 int event = next(); 508 //System.out.println("here in before calling next"); 509 event = next(); 510 //System.out.println("here in after calling next"); 531 /** return the next state on the input 535 public int next() throws IOException, XNIException { method in class:XMLDocumentFragmentScannerImpl 536 return fDriver.next(); 2060 public Element next; field in class:XMLDocumentFragmentScannerImpl.Element 2070 Element(QName qname, Element next) argument 2547 public int next() throws IOException, XNIException; method in interface:XMLDocumentFragmentScannerImpl.Driver 2682 public int next() throws IOException, XNIException { method in class:XMLDocumentFragmentScannerImpl.FragmentContentDriver [all...] |
/openjdk7/hotspot/agent/src/share/classes/sun/jvm/hotspot/oops/ |
H A D | GenerateOopMap.java | 172 private RetTableEntry _next; // Link to next entry 174 RetTableEntry(int target, RetTableEntry next) { argument 177 _next = next; 199 RetTableEntry next() { return _next; } method in class:GenerateOopMap.RetTableEntry 210 for (;(entry != null) && (entry.targetBci() != target_bci); entry = entry.next()); 228 while( (bytecode = i.next()) >= 0) { 243 cur = cur.next(); 256 cur = cur.next(); 665 while( (bytecode = bcs.next()) >= 0) { 791 itr.next(); // rea [all...] |
/openjdk7/jdk/src/share/classes/javax/swing/text/html/ |
H A D | HTMLDocument.java | 745 Element next; 747 while ((next = it.next()) != null) { 748 AttributeSet attr = next.getAttributes(); 756 return next; 1871 * Move the iterator forward to the next occurrence 1874 public abstract void next(); method in class:HTMLDocument.Iterator 1900 next(); 1946 * Moves the iterator forward to the next occurrence 1949 public void next() { method in class:HTMLDocument.LeafIterator [all...] |
/openjdk7/jdk/src/share/classes/java/io/ |
H A D | ObjectInputStream.java | 452 * @throws OptionalDataException if primitive data is next in stream 809 * called when the ObjectInputStream expects a class descriptor as the next 2190 Callback next; field in class:ObjectInputStream.ValidationList.Callback 2193 Callback(ObjectInputValidation obj, int priority, Callback next, argument 2198 this.next = next; 2226 cur = cur.next; 2230 prev.next = new Callback(obj, priority, cur, acc); 2254 list = list.next; 2288 * Peeks at next byt [all...] |
/openjdk7/jdk/src/share/classes/java/util/ |
H A D | Collections.java | 158 i.next(); 220 i.next(); 316 obj = i.next(); 430 Object tmp = fwd.next(); 511 it.next(); 564 itr.next(); 599 di.next(); 600 di.set(si.next()); 628 T candidate = i.next(); 631 T next 3006 public E next() { throw new NoSuchElementException(); } method in class:Collections.EmptyIterator [all...] |
H A D | TreeMap.java | 1096 Entry<K,V> next; field in class:TreeMap.PrivateEntryIterator 1103 next = first; 1107 return next != null; 1111 Entry<K,V> e = next; 1116 next = successor(e); 1122 Entry<K,V> e = next; 1127 next = predecessor(e); 1139 next = lastReturned; 1150 public Map.Entry<K,V> next() { method in class:TreeMap.EntryIterator 1159 public V next() { method in class:TreeMap.ValueIterator 1168 public K next() { method in class:TreeMap.KeyIterator 1177 public K next() { method in class:TreeMap.DescendingKeyIterator 1573 TreeMap.Entry<K,V> next; field in class:TreeMap.NavigableSubMap.SubMapIterator 1641 public Map.Entry<K,V> next() { method in class:TreeMap.NavigableSubMap.SubMapEntryIterator 1654 public K next() { method in class:TreeMap.NavigableSubMap.SubMapKeyIterator 1668 public Map.Entry<K,V> next() { method in class:TreeMap.NavigableSubMap.DescendingSubMapEntryIterator 1681 public K next() { method in class:TreeMap.NavigableSubMap.DescendingSubMapKeyIterator [all...] |
/openjdk7/jdk/src/share/classes/java/util/concurrent/ |
H A D | ConcurrentSkipListMap.java | 118 * Nodes next v v v v v 130 * basic idea in these lists is to mark the "next" pointers of 138 * use direct CAS'able next pointers. On deletion, instead of 152 * algorithm of changing the next-pointer of a deleted node so 188 * n's next pointer. 190 * 2. CAS n's next pointer to point to a new marker node. 198 * 3. CAS b's next pointer over both n and its marker. 213 * just (b, n, f), although the next field of a marker is 214 * immutable, and once a next field is CAS'ed to point to a 225 * Index levels are maintained as lists with volatile next field 397 volatile Node<K,V> next; field in class:ConcurrentSkipListMap.Node 402 Node(K key, Object value, Node<K,V> next) argument 415 Node(Node<K,V> next) argument 2199 Node<K,V> next; field in class:ConcurrentSkipListMap.Iter 2251 public V next() { method in class:ConcurrentSkipListMap.ValueIterator 2259 public K next() { method in class:ConcurrentSkipListMap.KeyIterator 2267 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.EntryIterator 3004 Node<K,V> next; field in class:ConcurrentSkipListMap.SubMap.SubMapIter 3081 public V next() { method in class:ConcurrentSkipListMap.SubMap.SubMapValueIterator 3089 public K next() { method in class:ConcurrentSkipListMap.SubMap.SubMapKeyIterator 3097 public Map.Entry<K,V> next() { method in class:ConcurrentSkipListMap.SubMap.SubMapEntryIterator [all...] |
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciTypeFlow.cpp | 400 str.next()) { 670 for( ; !sigstr.at_return_type(); sigstr.next()) { 1537 // ciTypeFlow::SuccIter::next 1539 void ciTypeFlow::SuccIter::next() { function in class:ciTypeFlow::SuccIter 1541 int next = _index + 1; local 1542 if (next < succ_ct) { 1543 _index = next; 1544 _succ = _pred->successors()->at(next); 1547 for (int i = next - succ_ct; i < _pred->exceptions()->length(); i++) { 1552 _index = next; 2401 void ciTypeFlow::PostorderLoops::next() { function in class:ciTypeFlow::PostorderLoops 2417 void ciTypeFlow::PreorderLoops::next() { function in class:ciTypeFlow::PreorderLoops 2725 Block* next = blk->rpo_next(); local [all...] |
/openjdk7/hotspot/src/share/vm/classfile/ |
H A D | classLoader.cpp | 393 for (ClassPathEntry* entry = _first_entry; entry != NULL; entry = entry->next()) { 559 e = e->next(); 597 e = e->next(); 660 PackageInfo* next() { function in class:PackageInfo 661 return (PackageInfo*)BasicHashtableEntry<mtClass>::next(); 693 for (PackageInfo* pp = bucket(index); pp != NULL; pp = pp->next()) { 731 for (PackageInfo* pp = bucket(i); pp != NULL; pp = pp->next()) { 753 pp = pp->next()) { 769 pp = pp->next()) { 902 e = e->next(); 1137 real_jzfile13 *next; /* next zip file in search list */ member in struct:real_jzfile13 1156 struct real_jzentry12 *next; /* next entry in hash table */ member in struct:real_jzentry12 1170 jzfile *next; /* next zip file in search list */ member in struct:real_jzfile12 [all...] |
/openjdk7/hotspot/src/share/vm/code/ |
H A D | dependencies.cpp | 586 bool Dependencies::DepStream::next() { function in class:Dependencies::DepStream 1562 for (ContextStream str(*this); str.next(); ) { 1598 bool DepChange::ContextStream::next() { function in class:DepChange::ContextStream 1640 for (ContextStream str(*this); str.next(); ) { 1650 for (ContextStream str(*this); str.next(); ) {
|
H A D | nmethod.hpp | 57 ExceptionCache* next() { return _next; } function in class:ExceptionCache
|
H A D | relocInfo.hpp | 507 // while (iter.next()) { 512 // while (iter.next()) { 577 // get next reloc info, return !eos 578 bool next() { function in class:RelocIterator
|
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/ |
H A D | heapRegion.hpp | 267 // next region in the young "generation" region set 307 // "next" is the top at the start of the in-progress marking (if any.) 399 // The number of bytes counted in the next marking. 401 // The number of bytes live wrt the next marking. 533 // Getter and setter for the next field used to link regions into 535 HeapRegion* next() { return _next; } function in class:HeapRegion 537 void set_next(HeapRegion* next) { _next = next; } argument 616 // all fields related to the next marking info. 620 // (now finalized) next markin [all...] |