Searched refs:has_next (Results 1 - 20 of 20) sorted by relevance

/openjdk7/hotspot/src/share/vm/gc_implementation/shared/
H A DgcTimer.cpp172 bool TimePartitionPhasesIterator::has_next() { function in class:TimePartitionPhasesIterator
177 assert(has_next(), "Must have phases left");
215 assert(!iter.has_next(), "Too many elements");
233 assert(!iter.has_next(), "Too many elements");
251 assert(!iter.has_next(), "Too many elements");
275 assert(!iter.has_next(), "Too many elements");
304 assert(!iter.has_next(), "Too many elements");
342 assert(!iter.has_next(), "Too many elements");
H A DgcTimer.hpp129 virtual bool has_next() = 0;
179 virtual bool has_next();
H A DgcTraceSend.cpp277 while (iter.has_next()) {
/openjdk7/hotspot/src/share/vm/gc_implementation/g1/
H A DsparsePRT.hpp208 bool has_next(size_t& card_index);
327 bool has_next(size_t& card_index) { function in class:SparsePRTIter
328 return RSHashTableIter::has_next(card_index);
H A DheapRegionRemSet.hpp414 bool has_next(size_t& card_index);
H A DheapRegionRemSet.cpp889 while (iter.has_next(card_index)) {
1029 bool HeapRegionRemSetIterator::has_next(size_t& card_index) { function in class:HeapRegionRemSetIterator
1032 if (_sparse_iter.has_next(card_index)) {
1216 while (iter.has_next(card_index)) {
H A Dg1RemSet.cpp180 for (size_t current_card = 0; iter->has_next(card_index); current_card++) {
H A DsparsePRT.cpp335 bool RSHashTableIter::has_next(size_t& card_index) { function in class:RSHashTableIter
H A Dg1CollectedHeap.cpp5499 while (iter.has_next()) {
/openjdk7/hotspot/src/share/vm/opto/
H A Descape.cpp1156 for (EdgeIterator i(ptn); i.has_next(); i.next()) {
1213 for (UseIterator i(jobj); i.has_next(); i.next()) {
1253 for (EdgeIterator i(use); i.has_next(); i.next()) {
1283 for (BaseIterator i(field); i.has_next(); i.next()) {
1290 for (UseIterator j(base); j.has_next(); j.next()) {
1293 for (UseIterator k(arycp); k.has_next(); k.next()) {
1310 for (UseIterator j(base); j.has_next(); j.next()) {
1329 for (EdgeIterator i(base); i.has_next(); i.next()) {
1353 for (BaseIterator i(field); i.has_next(); i.next()) {
1388 for (EdgeIterator i(pta); i.has_next();
[all...]
H A Descape.hpp292 // for (EdgeIterator i(n); i.has_next(); i.next()) {
301 inline bool has_next() const { return i < cnt; } function in class:PointsToIterator
406 for (UseIterator i(pt); i.has_next(); i.next())
H A Dstringopts.cpp86 for (SimpleDUIterator i(endprojs.resproj); i.has_next(); i.next()) {
331 for (SimpleDUIterator i(projs.catchall_catchproj); i.has_next(); i.next()) {
454 for (SimpleDUIterator i(result); i.has_next(); i.next()) {
678 for (SimpleDUIterator i(use); i.has_next(); i.next()) {
692 for (SimpleDUIterator i(use); i.has_next(); i.next()) {
901 for (SimpleDUIterator i(result); i.has_next(); i.next()) {
913 for (SimpleDUIterator j(use); j.has_next(); j.next()) {
H A Dnode.hpp1276 // for (SimpleDUIterator i(n); i.has_next(); i.next()) {
1286 bool has_next() { return i < imax; } function in class:SimpleDUIterator
H A DloopTransform.cpp2587 for (SimpleDUIterator iter(n); iter.has_next(); iter.next()) {
H A Dcompile.cpp2769 for (SimpleDUIterator i(p->in(0)); i.has_next(); i.next()) {
H A DgraphKit.cpp1841 for (SimpleDUIterator i(final_mem); i.has_next(); i.next()) {
/openjdk7/hotspot/src/share/vm/memory/
H A DreferenceProcessor.cpp559 while (iter.has_next()) {
598 while (iter.has_next()) {
635 while (iter.has_next()) {
678 while (iter.has_next()) {
995 while (iter.has_next()) {
1374 while (iter.has_next()) {
H A DreferenceProcessor.hpp133 inline bool has_next() const { return _ref != NULL; } function in class:DiscoveredListIterator
/openjdk7/hotspot/src/share/vm/services/
H A DdiagnosticFramework.hpp75 bool has_next() { return _cursor < _len; } function in class:DCmdIter
/openjdk7/hotspot/src/share/vm/runtime/
H A DsharedRuntime.cpp2302 bool has_next() { function in class:AdapterHandlerTableIterator
2885 while (iter.has_next()) {
2894 while (iter.has_next()) {

Completed in 165 milliseconds