487 _predicate_opaqs->append(n); |
487 _predicate_opaqs->append(n); |
488 } |
488 } |
489 // remove the opaque nodes that protect the predicates so that the unused checks and |
489 // remove the opaque nodes that protect the predicates so that the unused checks and |
490 // uncommon traps will be eliminated from the graph. |
490 // uncommon traps will be eliminated from the graph. |
491 void cleanup_loop_predicates(PhaseIterGVN &igvn); |
491 void cleanup_loop_predicates(PhaseIterGVN &igvn); |
|
492 bool is_predicate_opaq(Node * n) { |
|
493 return _predicate_opaqs->contains(n); |
|
494 } |
492 |
495 |
493 // Compilation environment. |
496 // Compilation environment. |
494 Arena* comp_arena() { return &_comp_arena; } |
497 Arena* comp_arena() { return &_comp_arena; } |
495 ciEnv* env() const { return _env; } |
498 ciEnv* env() const { return _env; } |
496 CompileLog* log() const { return _log; } |
499 CompileLog* log() const { return _log; } |