Searched defs:next (Results 626 - 650 of 702) sorted by relevance

<<212223242526272829

/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DheapRegionRemSet.cpp45 // next pointer for free/allocated 'all' list
51 // next pointer in collision list
201 PerRegionTable* nxt = fl->next();
216 PerRegionTable* next() const { return _next; } function in class:PerRegionTable
217 void set_next(PerRegionTable* next) { _next = next; } argument
233 void set_collision_list_next(PerRegionTable* next) { argument
234 _collision_list_next = next;
246 cur = cur->next();
307 assert(prt->next()
[all...]
/openjdk7/hotspot/src/share/vm/gc_implementation/parNew/
H A DparNewGeneration.cpp905 // Inform the next generation that a promotion failure occurred.
948 // If the next generation is too full to accommodate worst-case promotion
949 // from this generation, pass on collection; let the next generation
1235 // Length field used as index of next element to be scanned.
1353 // Length field used as index of next element to be scanned.
1410 // field keeps track of the "grey boundary" at which the next
1591 oop next = oop(cur->klass_or_null()); local
1606 cur = next;
1629 false); // write barrier for next field updates
/openjdk7/hotspot/src/share/vm/memory/
H A Duniverse.cpp702 int next; local
704 next = (int)Atomic::add(-1, &_preallocated_out_of_memory_error_avail_count);
705 assert(next < (int)PreallocatedOutOfMemoryErrorCount, "avail count is corrupt");
707 next = -1;
709 if (next < 0) {
716 oop exc = preallocated_out_of_memory_errors()->obj_at(next);
718 preallocated_out_of_memory_errors()->obj_at_put(next, NULL);
/openjdk7/hotspot/src/share/vm/oops/
H A DconstantPoolOop.hpp795 SymbolHashMapEntry* next() const { return _next; } function in class:SymbolHashMapEntry
796 void set_next(SymbolHashMapEntry* next) { _next = next; } argument
872 SymbolHashMapEntry* next; local
874 for (SymbolHashMapEntry* cur = bucket(i); cur != NULL; cur = next) {
875 next = cur->next();
H A DmethodOop.cpp407 while ((bc = bcs.next()) >= 0) {
1191 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1218 for(SignatureStream ss(signature); !ss.is_done(); ss.next()) {
1391 while (s.next() >= 0) BytecodeTracer::trace(mh, s.bcp(), st);
1425 jubyte next = read_byte(); local
1427 if (next == 0) return false;
1428 if (next == 0xFF) {
1434 _bci += next >> 3;
1435 _line += next & 0x7;
1443 for (; bp != NULL; bp = bp->next()) {
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dchaitin.cpp898 while((lidx = elements.next()) != 0) {
980 while ((neighbor = elements.next()) != 0) {
1023 while ((datum = elements.next()) != 0) {
1038 while ((neighbor = elements.next()) != 0) {
1052 uint next = n->_next; local
1053 if( prev ) lrgs(prev)._next = next;
1054 else _hi_degree = next;
1055 lrgs(next)._prev = prev;
1080 // in -Xcomp of Java2Demo). So just choose this guy to simplify next.
1119 uint next local
[all...]
H A Dgcm.cpp218 // Get parent node and next input's index from stack's top.
251 nstack.push(n, i); // Save parent node and next input's index.
275 // Process next node on the worklist 'roots'.
278 // Get saved parent node and next input's index.
760 Node *next();
780 Node *Node_Backward_Iterator::next() { function in class:Node_Backward_Iterator
790 // children next.
859 while (n = iter.next()) {
1128 while (self = iter.next()) {
1215 // Must clone guys stay next t
[all...]
H A Dmemnode.hpp987 // Isolation of object setup after an AllocateNode and before next safepoint.
1147 // "empty" slice. See is_empty, is_empty2, and next below.
1229 assert(_mem, "must call next 1st");
1241 assert(_mem, "must call next 1st");
1246 assert(_mem2, "must call next 1st");
1283 bool next() { return next(false); } function in class:MergeMemStream
1284 bool next2() { return next(true); }
1291 // find the next item, which might be empty
1292 bool next(boo function in class:MergeMemStream
[all...]
H A Dnode.hpp286 // Grow the actual input array to the next larger power-of-2 bigger than len.
288 // Grow the output array to the next larger power-of-2 bigger than len.
797 // Nodes, next block selector Nodes (block enders), and next block
1276 // for (SimpleDUIterator i(n); i.has_next(); i.next()) {
1287 void next() { i++; } function in class:SimpleDUIterator
1355 uint _clock_index; // Index in list where to pop from next
1408 uint indx; // Index of next node's child
/openjdk7/jdk/src/share/classes/com/sun/java/swing/plaf/gtk/
H A DMetacity.java1820 String next = tokenizer.peek();
1821 if ("+".equals(next) ||
1822 "-".equals(next) ||
1823 "`max`".equals(next) ||
1824 "`min`".equals(next)) {
1827 if ("+".equals(next)) {
1829 } else if ("-".equals(next)) {
1831 } else if ("`max`".equals(next)) {
1833 } else if ("`min`".equals(next)) {
1847 String next
2122 public void next() { method in class:Metacity.RoundRectClipShape.RoundishRectIterator
[all...]
/openjdk7/jdk/src/share/classes/com/sun/rowset/
H A DJdbcRowSetImpl.java807 * <code>next</code> makes the first row the current row; the
811 * to the method <code>next</code> will
821 public boolean next() throws SQLException { method in class:JdbcRowSetImpl
824 boolean b = rs.next();
838 * re-executed, or is used to retrieve the next result from a
1124 * read prior to getting the value of any other column. The next
1157 * read prior to getting the value of any other column. The next
1188 * read prior to getting the value of any other column. The next
1435 * read prior to getting the value of any other column. The next
1465 * read prior to getting the value of any other column. The next
[all...]
/openjdk7/jdk/src/share/classes/com/sun/rowset/internal/
H A DSyncResolverImpl.java452 * If an input stream is open for the current row, a call to the method next will
462 * The next() method will hop from
465 * Internally do a crs.next() until
466 * next conflict.
471 while(crsSync.next()) {
493 } // end next() method
990 * <code>next</code> moves the cursor to the first row, making it
1004 public boolean next() throws SQLException { method in class:SyncResolverImpl
1009 * Moves this <code>CachedRowSetImpl</code> object's cursor to the next
1017 * that has been deleted, this method moves the cursor to the next
[all...]
/openjdk7/hotspot/src/os/bsd/dtrace/
H A Dlibjvm_db.c46 uint64_t new_fp; /* fp for the next frame */
47 uint64_t new_pc; /* pc for the next frame */
48 uint64_t new_sp; /* "raw" sp for the next frame (includes extension by interpreter/adapter */
696 uint8_t next = 0; local
704 err = ps_pread(J->P, (*buffer)++, &next, sizeof(uint8_t));
707 if (next == 0) {
709 fprintf(stderr, "\t\t read_pair: END: next == 0\n");
712 if (next == 0xFF) {
714 fprintf(stderr, "\t\t read_pair: END: next == 0xFF\n");
735 *bci += next >>
[all...]
/openjdk7/hotspot/src/os/solaris/dtrace/
H A Dlibjvm_db.c46 uint64_t new_fp; /* fp for the next frame */
47 uint64_t new_pc; /* pc for the next frame */
48 uint64_t new_sp; /* "raw" sp for the next frame (includes extension by interpreter/adapter */
696 uint8_t next = 0; local
704 err = ps_pread(J->P, (*buffer)++, &next, sizeof(uint8_t));
707 if (next == 0) {
709 fprintf(stderr, "\t\t read_pair: END: next == 0\n");
712 if (next == 0xFF) {
714 fprintf(stderr, "\t\t read_pair: END: next == 0xFF\n");
735 *bci += next >>
[all...]
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_Instruction.hpp292 int _use_count; // the number of instructions refering to this value (w/o prev/next); only roots can have use count = 0 or > 1
295 Instruction* _next; // the next instruction if any (NULL for BlockEnd instructions)
407 Instruction* next() const { return _next; } function in class:Instruction
429 Instruction* set_next(Instruction* next) { argument
430 assert(next->has_printable_bci(), "_printable_bci should have been set");
431 assert(next != NULL, "must not be NULL");
432 assert(as_BlockEnd() == NULL, "BlockEnd instructions must have no next");
433 assert(next->can_be_linked(), "shouldn't link these instructions into list");
435 next->set_flag(Instruction::IsLinkedInBlockFlag, true);
436 _next = next;
440 set_next(Instruction* next, int bci) argument
[all...]
H A Dc1_Optimizer.cpp111 Instruction* t_cur = t_block->next();
112 Instruction* f_cur = f_block->next();
119 t_cur = t_cur->next();
123 f_cur = f_cur->next();
371 Instruction* next = sux->next(); local
373 prev->set_next(next);
417 while (prev != NULL && prev->next() != if_) {
418 prev = prev->next();
436 assert(prev->next()
808 BlockBegin* next = block->exception_handler_at(i); local
832 BlockBegin* next = e->sux_at(i); local
1168 BlockBegin* next = end->sux_at(s); local
[all...]
/openjdk7/jdk/src/share/back/
H A DthreadControl.c83 struct ThreadNode *next; member in struct:ThreadNode
130 struct DeferredEventMode *next; member in struct:DeferredEventMode
212 for (node = list->first; node != NULL; node = node->next) {
266 ThreadNode *next; local
269 next = node->next;
271 prev->next = next;
273 if ( next != NULL ) {
274 next
481 DeferredEventMode *next; local
516 DeferredEventMode *next = eventMode->next; local
[all...]
/openjdk7/jdk/src/share/classes/com/sun/imageio/plugins/jpeg/
H A DJPEGImageReader.java515 * positioned such that the next byte to be read is the first
516 * byte of the next image. For JPEG, this means that we read
577 * that the next one can be identified from Java.
1182 if (iter.next() instanceof SOSMarkerSegment) {
1705 theNext = producers.next().getType();
1711 public ImageTypeSpecifier next() { method in class:ImageTypeIterator
/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiEnvBase.cpp100 for (JvmtiEnvBase* env = it.first(); env != NULL; env = it.next(env)) {
281 env = it.next(env);
285 env = it.next(env);
433 for (JvmtiEnvBase* env = it.first(); env != NULL; env = it.next(env)) {
1185 struct StackInfoNode *next; member in struct:StackInfoNode
1201 node->next = head();
1255 for (struct StackInfoNode *sin = head(); sin != NULL; sin = sin->next) {
1297 for (JavaThread *jt = Threads::first(); jt != NULL; jt = jt->next()) {
1434 // It is cleared when next step event is posted.
/openjdk7/hotspot/src/share/vm/runtime/
H A Dfprofiler.cpp280 ProfilerNode* next() { return _next; } function in class:ProfilerNode
670 for(ProfilerNode* node = prev; node; node = node->next()) {
687 for(ProfilerNode* node = prev; node; node = node->next()) {
704 for(ProfilerNode* node = prev; node; node = node->next()) {
721 for(ProfilerNode* node = prev; node; node = node->next()) {
738 for(ProfilerNode* node = prev; node; node = node->next()) {
756 for(ProfilerNode* node = prev; node; node = node->next()) {
779 for(ProfilerNode* node = prev; node; node = node->next()) {
857 for (JavaThread* tp = Threads::first(); tp != NULL; tp = tp->next()) {
870 // external suspension - so it will stop at its next transitio
[all...]
H A Dframe.cpp491 BasicObjectLock* next = (BasicObjectLock*) (((intptr_t*) current) + interpreter_frame_monitor_size()); local
492 return next;
H A DobjectMonitor.cpp438 // time -- such as next time some thread encounters contention but has
640 // in the next iteration.
2331 ObjectWaiter* next = node->_next; local
2332 if (next == node) {
2338 assert(next->_prev == node, "invariant check");
2339 next->_prev = prev;
2340 prev->_next = next;
2342 _WaitSet = next;
/openjdk7/hotspot/src/share/vm/services/
H A DthreadService.hpp238 ThreadSnapshot* next() const { return _next; } function in class:ThreadSnapshot
313 ThreadConcurrentLocks* next() { return _next; } function in class:ThreadConcurrentLocks
351 void set_next(ThreadDumpResult* next) { _next = next; } argument
352 ThreadDumpResult* next() { return _next; } function in class:ThreadDumpResult
368 DeadlockCycle* next() { return _next; } function in class:DeadlockCycle
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkTopLevelBlock.cpp57 iter()->next();
304 // If this block falls through to the next then it won't have been
471 for (; !str.is_done(); str.next()) {
954 // All propagation of state from one block to the next (via
1133 BasicBlock *next = function()->CreateBlock("next"); local
1203 got_entry, next);
1205 builder()->SetInsertPoint(next);
1210 itable_entry_addr->addIncoming(next_entry, next);
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/rngom/parse/xml/
H A DSchemaParser.java121 final PrefixMapping next; field in class:SchemaParser.PrefixMapping
123 PrefixMapping(String prefix, String uri, PrefixMapping next) { argument
126 this.next = next;
143 for (PrefixMapping p = prefixMapping; p != null; p = p.next)
151 for (PrefixMapping p = prefixMapping; p != null; p = p.next) {
209 context.prefixMapping = context.prefixMapping.next;
1636 for (PrefixMapping tem = context.prefixMapping; tem != null; tem = tem.next)
1646 for (PrefixMapping p = context.prefixMapping; p != null; p = p.next)

Completed in 2771 milliseconds

<<212223242526272829