/openjdk7/hotspot/src/share/vm/libadt/ |
H A D | vectset.cpp | 338 // Sort the elements for the next forall statement 360 uint next(void) { ++vsi; return vsi.elem; } function in class:VSetI_ 369 //------------------------------next------------------------------------------- 370 // Find and return the next element of a vector set, or return garbage and 372 uint VectorSetI::next(void) function in class:VectorSetI 381 j++; // Skip to next bit 384 j = 0; // No more bits in word; setup for next word
|
/openjdk7/hotspot/src/share/vm/memory/ |
H A D | binaryTreeDictionary.hpp | 154 Chunk* next() const { return Chunk::next(); } function in class:TreeChunk
|
H A D | heap.hpp | 156 // returns the next block given a block p or NULL 157 void* next(void* p) const { return next_free(next_block(block_start(p))); } function in class:CodeHeap
|
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | fieldStreams.hpp | 117 void next() { function in class:FieldStreamBase
|
H A D | instanceRefKlass.cpp | 81 // i.e. if next is non-NULL. 96 // field for the pending list, an inactive ref (next != NULL) 98 oop next = oopDesc::load_decode_heap_oop(next_addr); local 100 assert(oopDesc::is_null(next) || oopDesc::is_null(discovered), 105 // treat next as normal oop. next is a link in the reference queue. 108 gclog_or_tty->print_cr(" Process next as normal " INTPTR_FORMAT, next_addr); 161 // i.e. if next is non-NULL. 176 // field for the pending list, an inactive ref (next != NULL) 178 T next local 402 oop next = oopDesc::load_decode_heap_oop(next_addr); local 502 oop next = java_lang_ref_Reference::next(obj); local [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | runtime.hpp | 86 NamedCounter* next() const { return _next; } function in class:NamedCounter 87 void set_next(NamedCounter* next) { argument 89 _next = next;
|
/openjdk7/jdk/src/share/classes/com/sun/jmx/remote/security/ |
H A D | MBeanServerFileAccessController.java | 316 final Principal p = (Principal) i.next(); 473 next(); 499 next(); 507 // Advance c and i to the next character, unless already at EOS. 508 private void next() { method in class:MBeanServerFileAccessController.Parser 520 next(); 529 next();
|
/openjdk7/jdk/src/share/classes/com/sun/jndi/ldap/ |
H A D | LdapNamingEnumeration.java | 58 * Record the next set of entries and/or referrals. 106 return next(); 125 * Retrieve the next set of entries and/or referrals. 194 * Retrieve the next entry. 196 public Object next() throws NamingException { method in class:LdapNamingEnumeration 211 // to fetch the next batch to determine 250 * Retrieve the next entry.
|
/openjdk7/jdk/src/share/classes/com/sun/jndi/rmi/registry/ |
H A D | RegistryContext.java | 503 public Object next() throws NamingException { method in class:NameClassPairEnumeration 523 return next(); 539 * The actual registry lookups are performed when next() is called. It would 567 public Object next() throws NamingException { method in class:BindingEnumeration 589 return next();
|
/openjdk7/jdk/src/share/classes/com/sun/org/apache/xml/internal/security/keys/keyresolver/ |
H A D | KeyResolver.java | 386 public KeyResolverSpi next() { method in class:KeyResolver.ResolverIterator 387 KeyResolver resolver = it.next();
|
/openjdk7/jdk/src/share/classes/com/sun/tools/jdi/ |
H A D | LinkedHashMap.java | 230 for (Entry e = tab[index]; e != null; e = e.next) 234 for (Entry e = tab[0]; e != null; e = e.next) 267 for (Entry e = tab[index]; e != null; e = e.next) 271 for (Entry e = tab[0]; e != null; e = e.next) 298 e.next = newMap[index]; 366 for (Entry e = tab[index] ; e != null ; e = e.next) { 374 for (Entry e = tab[0] ; e != null ; e = e.next) { 465 prev = e, e = e.next) { 469 prev.next = e.next; 741 Entry next; field in class:LinkedHashMap.Entry 747 Entry(int hash, Object key, Object value, Entry next) argument 815 public Object next() { method in class:LinkedHashMap.HashIterator [all...] |
/openjdk7/jdk/src/share/classes/java/awt/ |
H A D | CardLayout.java | 237 * If the card was visible on top, the next card underneath it is shown. 246 // if we remove current component we should show next one 248 next(comp.getParent()); 433 * Flips to the next card of the specified container. If the 439 public void next(Container parent) { method in class:CardLayout 463 * @see java.awt.CardLayout#next 527 Component next = null; 532 next = card.comp; 537 if ((next != null) && !next [all...] |
H A D | MediaTracker.java | 317 cur = cur.next; 336 cur = cur.next; 357 cur = cur.next; 369 cur = cur.next; 471 cur = cur.next; 537 cur = cur.next; 560 cur = cur.next; 586 cur = cur.next; 600 cur = cur.next; 707 cur = cur.next; 815 MediaEntry next; field in class:MediaEntry [all...] |
H A D | Polygon.java | 609 * traversal, to the next segment of the path when there are 612 public void next() { method in class:Polygon.PolygonPathIterator
|
/openjdk7/hotspot/src/os/windows/vm/ |
H A D | attachListener_windows.cpp | 143 Win32AttachOperation* next() const { return _next; } function in class:Win32AttachOperation 144 void set_next(Win32AttachOperation* next) { _next = next; } argument 206 set_available(op->next()); 243 set_head(op->next());
|
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
H A D | Properties.java | 320 public Property next() { method in class:Properties.PropertiesIterator
|
/openjdk7/jdk/make/tools/src/build/tools/charsetmapping/ |
H A D | Utils.java | 102 public Entry next() throws Exception { method in class:Utils.Parser 103 return next(new Entry()); 107 public Entry next(Entry mapping) throws Exception { method in class:Utils.Parser
|
/openjdk7/jdk/src/share/back/ |
H A D | commonRef.c | 240 gdata->objectsByID[slot] = node->next; 242 prev->next = node->next; 249 node = node->next; 278 prev->next = node->next; 279 node->next = gdata->objectsByID[slot]; 284 node = node->next; 309 node->next = gdata->objectsByID[slot]; 347 RefNode *next; local 383 RefNode *next; local [all...] |
/openjdk7/hotspot/src/share/vm/prims/ |
H A D | jvmtiEnvThreadState.hpp | 133 JvmtiEnvThreadState* next() { return _next; } function in class:JvmtiEnvThreadState
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | frame.hpp | 77 address _pc; // program counter (the next instruction after the call) 95 // It must point at the beginning of the next instruction to execute. 542 // for(StackFrameStream fst(thread); !fst.is_done(); fst.next()) { 556 void next() { if (!_is_done) _fr = _fr.sender(&_reg_map); } function in class:StackFrameStream
|
H A D | mutex.hpp | 223 debug_only(Monitor *next() const { return _next; }) function in class:Monitor 224 debug_only(void set_next(Monitor *next) { _next = next; })
|
H A D | vframeArray.hpp | 176 // Accessors for next 177 vframeArray* next() const { return _next; } function in class:vframeArray
|
/openjdk7/hotspot/src/share/vm/services/ |
H A D | diagnosticArgument.hpp | 117 GenDCmdArgument* next() { function in class:GenDCmdArgument
|
H A D | diagnosticFramework.cpp | 61 bool DCmdArgIter::next(TRAPS) { function in class:DCmdArgIter 153 while (o->next() != NULL) { 154 o = o->next(); 172 while (a->next() != NULL) { 173 a = a->next(); 188 bool cont = iter.next(CHECK); 198 next_argument = next_argument->next(); 213 cont = iter.next(CHECK); 225 arg = arg->next(); 239 arg = arg->next(); [all...] |
H A D | memPtrArray.hpp | 70 // return the next pointer and advance current position 71 virtual MemPointer* next() = 0; 72 // return next pointer without advancing current position 105 virtual MemPointer* next() { function in class:MemPointerArrayIteratorImpl
|