< prev index next >

src/share/vm/opto/node.hpp

Print this page

        

*** 672,682 **** Flag_may_be_short_branch = Flag_is_dead_loop_safe << 1, Flag_avoid_back_to_back_before = Flag_may_be_short_branch << 1, Flag_avoid_back_to_back_after = Flag_avoid_back_to_back_before << 1, Flag_has_call = Flag_avoid_back_to_back_after << 1, Flag_is_reduction = Flag_has_call << 1, ! Flag_is_expensive = Flag_is_reduction << 1, _max_flags = (Flag_is_expensive << 1) - 1 // allow flags combination }; private: jushort _class_id; --- 672,683 ---- Flag_may_be_short_branch = Flag_is_dead_loop_safe << 1, Flag_avoid_back_to_back_before = Flag_may_be_short_branch << 1, Flag_avoid_back_to_back_after = Flag_avoid_back_to_back_before << 1, Flag_has_call = Flag_avoid_back_to_back_after << 1, Flag_is_reduction = Flag_has_call << 1, ! Flag_is_scheduled = Flag_is_reduction << 1, ! Flag_is_expensive = Flag_is_scheduled << 1, _max_flags = (Flag_is_expensive << 1) - 1 // allow flags combination }; private: jushort _class_id;
*** 859,868 **** --- 860,872 ---- // An arithmetic node which accumulates a data in a loop. // It must have the loop's phi as input and provide a def to the phi. bool is_reduction() const { return (_flags & Flag_is_reduction) != 0; } + // Used in lcm to mark nodes that have scheduled + bool is_scheduled() const { return (_flags & Flag_is_scheduled) != 0; } + //----------------- Optimization // Get the worst-case Type output for this Node. virtual const class Type *bottom_type() const;
< prev index next >