Lines Matching refs:idx
1416 uint idx = 0;
1417 while( use->in(idx) != old ) idx++;
1424 cfg = prev->in(idx); // NOT in block of Phi itself
1426 _igvn.replace_input_of(use, idx, C->top());
1442 if( idx == 0 ) { // Updating control edge?
1455 if( idx == 0 ) { // Updating control edge?
1464 if( idx != 0 ) {
1476 _igvn.replace_input_of(use, idx, phi);
1852 uint idx = 0;
1868 nstack.push(n, idx);
1878 if (idx < n->outcnt()) {
1879 Node* use = n->raw_out(idx);
1880 idx++;
1883 nstack.push(n, idx);
1885 idx = 0;
1893 idx = nstack.index();
2019 // Insert phi(lp_entry_val, back_edge_val) at use->in(idx) for loop lp if phi does not already exist
2020 void PhaseIdealLoop::insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp ) {
2033 _igvn.replace_input_of(use, idx, phi);