Cross Reference: /openjdk7/hotspot/src/share/vm/opto/escape.cpp

Lines Matching refs:next
123   for( uint next = 0; next < ideal_nodes.size(); ++next ) {
124     Node* n = ideal_nodes.at(next);
182     for (int next = 0; next < ptnodes_length; ++next) {
183       PointsToNode* ptn = ptnodes_worklist.at(next);
207   for (int next = 0; next < non_escaped_length; next++) {
208     JavaObjectNode* ptn = non_escaped_worklist.at(next);
251     for (int next = 0; next < alloc_length; ++next) {
252       Node* n = alloc_worklist.at(next);
1047       for (int next = 0; next < java_objects_length; ++next) {
1048         JavaObjectNode* ptn = java_objects_worklist.at(next);
1064       for (int next = 0; next < fields_length; next++) {
1065         FieldNode* field = oop_fields_worklist.at(next);
1105   for (int next = 0; next < non_escaped_length; next++) {
1106     JavaObjectNode* ptn = non_escaped_worklist.at(next);
1136   for (int next = 0; next < ptnodes_length; ++next) {
1137     PointsToNode* ptn = ptnodes_worklist.at(next);
1156     for (EdgeIterator i(ptn); i.has_next(); i.next()) {
1195   for (int next = non_escaped_worklist.length()-1; next >= 0 ; --next) {
1196     JavaObjectNode* ptn = non_escaped_worklist.at(next);
1198       non_escaped_worklist.delete_at(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(); i.next()) {
1415   for (EdgeIterator i(pta); i.has_next(); i.next()) {
1475                 for (EdgeIterator j(val); j.has_next(); j.next()) {
1529   for (UseIterator i(jobj); i.has_next(); i.next()) {
1543     for (EdgeIterator j(use); j.has_next(); j.next()) {
1556   for (EdgeIterator j(jobj); j.has_next(); j.next()) {
1589     // but it will save us from incorrect optimizations in next cases:
1595       for (BaseIterator i(field); i.has_next(); i.next()) {
1620   for (int next = 0; next < java_objects_length; ++next) {
1621     JavaObjectNode* ptn = java_objects_worklist.at(next);
1634   for (int next = 0; next < addp_length; ++next ) {
1635     Node* n = addp_worklist.at(next);
1645         for (EdgeIterator i(ptn); i.has_next(); i.next()) {
1656         for (BaseIterator i(field); i.has_next(); i.next()) {
1658           tty->print_cr("----------field has next base---------------------");
1662             for (EdgeIterator j(base); j.has_next(); j.next()) {
1666             for (UseIterator j(base); j.has_next(); j.next()) {
1671         for (UseIterator i(field); i.has_next(); i.next()) {
1961   for (EdgeIterator i(ptn); i.has_next(); i.next()) {
1986   for (EdgeIterator i(this); i.has_next(); i.next()) {
2017   for (EdgeIterator i(ptn); i.has_next(); i.next()) {
2033   for (EdgeIterator i(this); i.has_next(); i.next()) {
2051   for (EdgeIterator i(this); i.has_next(); i.next()) {
2064   for (BaseIterator i(this); i.has_next(); i.next()) {
2254   // Do NOT remove the next line: ensure a new alias index is allocated
2408 // The next methods are derived from methods in MemNode.
2796         for (EdgeIterator e(ptn); e.has_next(); e.next()) {
3032   for( uint next = 0; next < length; ++next ) {
3033     MergeMemNode* nmm = _mergemem_worklist.at(next);
3201     for (BaseIterator i(f); i.has_next(); i.next()) {
3208   for (EdgeIterator i(this); i.has_next(); i.next()) {
3213   for (UseIterator i(this); i.has_next(); i.next()) {
3247       for (UseIterator j(ptn); j.has_next(); j.next()) {