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

Lines Matching refs:_nodes
62   assert( _cfg->_broot->_nodes.size() == 0, "" );
76   const StartNode *start = entry->_nodes[0]->as_Start();
80   entry->_nodes.map( 0, prolog );
147       for (uint j = 0; j < bb->_nodes.size(); j++) {
148         Node *n = bb->_nodes[j];
225     for ( uint j = 0;  j < b->_nodes.size();  ++j ) {
226       Node *n = b->_nodes[j];
255           b->_nodes.insert( j, zap );
383     uint last_inst = b->_nodes.size();
386       Node* nj = b->_nodes[j];
481       MachNode* mach = (idx == -1) ? NULL: b->_nodes[idx]->as_Mach();
487         for (j = b->_nodes.size()-1; j>=0; j--) {
488           Node* n = b->_nodes[j];
492         assert(j >= 0 && j == idx && b->_nodes[j] == (Node*)mach, "sanity");
526           b->_nodes.map(idx, replacement);
1108       for (uint j = 0; j < b->_nodes.size(); j++) {
1109         Node* n = b->_nodes[j];
1267     uint last_inst = b->_nodes.size();
1274       Node* n = b->_nodes[j];
1328           b->_nodes.insert(j++, nop);
1414                 b->_nodes.insert(j++, nop);
1427               b->_nodes.map(j, replacement);
1459               if( b->_nodes[i4] == oop_store ) break;
1568         b->_nodes.insert( b->_nodes.size(), nop );
1678     for( j = b->_nodes.size()-1; j>=0; j-- ) {
1679       n = b->_nodes[j];
1695       while( b->_nodes[--j]->is_MachProj() ) ;
1696       assert( b->_nodes[j]->is_MachCall(), "CatchProj must follow call" );
1805   _next_node = bb->_nodes[bb->_nodes.size()-1];
1900     Node *use = bb->_nodes[j];
2303   // not in the bb->_nodes array.  This happens for debug-info-only BoxLocks.
2313     if( bb->_nodes[bb->_nodes.size()-1] != n ) {
2357   for( uint i=0; i < bb->_nodes.size(); i++ )
2358     assert( _uses[bb->_nodes[i]->_idx] == 0, "_use array not clean" );
2364     _uses[bb->_nodes[k]->_idx] = 1;
2365   for( uint l = _bb_end; l < bb->_nodes.size(); l++ )
2366     _uses[bb->_nodes[l]->_idx] = 1;
2371     Node *n = bb->_nodes[j];
2425       for (uint j = 0; j < bb->_nodes.size(); j++)
2426         bb->_nodes[j]->dump();
2451     // or Top.  bb->_nodes[_bb_start] is the first schedulable instruction.
2452     _bb_end = bb->_nodes.size()-1;
2454       Node *n = bb->_nodes[_bb_start];
2474     Node *last = bb->_nodes[_bb_end];
2478       last = bb->_nodes[--_bb_end];
2485       while( !bb->_nodes[--_bb_end]->is_MachCall() ) {
2486         assert( bb->_nodes[_bb_end]->is_MachProj(), "skipping projections after expected call" );
2495       } while (mem != bb->_nodes[_bb_end]);
2523       Node *n = bb->_nodes[l];
2534       bb->_nodes.map(k, _scheduled[_bb_end-k-1]);
2540       for (uint j = 0; j < bb->_nodes.size(); j++) {
2541         Node *n = bb->_nodes[j];
2606   for( uint i = b->_nodes.size()-1; i >= _bb_start; i-- ) {
2607     Node *n = b->_nodes[i];
2740       b->_nodes.insert(b->find_node(use)+1,pinch);
2793   Node* end_node         = (_bb_end-1 >= _bb_start) ? b->_nodes[last_safept] : NULL;
2796     Node *n = b->_nodes[i];
2845     Node *m = b->_nodes[i];
2862       if( b->_nodes[last_safept] != last_safept_node ) {
2866         Node *mach = b->_nodes[j];