Lines Matching defs:next
177 // Save it for next time:
340 for( uint next = 0; next < useful.size(); ++next ) {
341 assert( next < unique(), "Unique useful nodes < total nodes");
342 Node *n = useful.at(next);
384 uint next = 0;
385 while (next < useful.size()) {
386 Node *n = useful.at(next++);
524 // Record the buffer blob for next time.
1653 // Fill the cache for next time.
2769 for (SimpleDUIterator i(p->in(0)); i.has_next(); i.next()) {
2933 nstack.push(n, i); // put on stack parent and next input's index
2945 nstack.pop(); // Shift to the next node on stack
2949 // Skip next transformation if compressed oops are not used.
3389 // Align size up to the next section start (which is insts; see
3522 for (uint next = 0; next < useful.size(); ++next) {
3523 Node* n = useful.at(next);
3596 // Then sort the list so that similar nodes are next to each other
3617 // Sort to bring similar nodes next to each other and clear the