Mercurial > hg > truffle

comparison src/share/vm/opto/lcm.cpp @ 20311:b1bc1af04c6e

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
8052081: Optimize generated by C2 code for Intel's Atom processor Summary: Allow to execute vectorization and crc32 optimization on Atom. Enable UseFPUForSpilling by default on x86. Reviewed-by: roland
author kvn
date Tue, 05 Aug 2014 15:02:10 -0700
parents 62c54fcc0a35
children 7024b693c8f9
comparison
equal deleted inserted replaced
20310:bfba6779654b 20311:b1bc1af04c6e
482 if( n->is_Proj() || // Projections always win 482 if( n->is_Proj() || // Projections always win
483 n->Opcode()== Op_Con || // So does constant 'Top' 483 n->Opcode()== Op_Con || // So does constant 'Top'
484 iop == Op_CreateEx || // Create-exception must start block 484 iop == Op_CreateEx || // Create-exception must start block
485 iop == Op_CheckCastPP 485 iop == Op_CheckCastPP
486 ) { 486 ) {
487 worklist.map(i,worklist.pop()); 487 // select the node n
488 // remove n from worklist and retain the order of remaining nodes
489 worklist.remove((uint)i);
488 return n; 490 return n;
489 } 491 }
490 492
491 // Final call in a block must be adjacent to 'catch' 493 // Final call in a block must be adjacent to 'catch'
492 Node *e = block->end(); 494 Node *e = block->end();
568 } // End of for all ready nodes in worklist 570 } // End of for all ready nodes in worklist
569 571
570 assert(idx >= 0, "index should be set"); 572 assert(idx >= 0, "index should be set");
571 Node *n = worklist[(uint)idx]; // Get the winner 573 Node *n = worklist[(uint)idx]; // Get the winner
572 574
573 worklist.map((uint)idx, worklist.pop()); // Compress worklist 575 // select the node n
576 // remove n from worklist and retain the order of remaining nodes
577 worklist.remove((uint)idx);
574 return n; 578 return n;
575 } 579 }
576 580
577 581
578 //------------------------------set_next_call---------------------------------- 582 //------------------------------set_next_call----------------------------------