< prev index next >

src/share/vm/opto/opaquenode.hpp

Print this page

        

*** 46,56 **** // Put it on the Macro nodes list to removed during macro nodes expansion. init_flags(Flag_is_macro); C->add_macro_node(this); } Node* original_loop_limit() { return req()==3 ? in(2) : NULL; } ! virtual int Opcode() const; virtual const Type *bottom_type() const { return TypeInt::INT; } virtual Node* Identity(PhaseGVN* phase); }; //------------------------------Opaque2Node------------------------------------ --- 46,56 ---- // Put it on the Macro nodes list to removed during macro nodes expansion. init_flags(Flag_is_macro); C->add_macro_node(this); } Node* original_loop_limit() { return req()==3 ? in(2) : NULL; } ! virtual Opcodes Opcode() const; virtual const Type *bottom_type() const { return TypeInt::INT; } virtual Node* Identity(PhaseGVN* phase); }; //------------------------------Opaque2Node------------------------------------
*** 69,79 **** Opaque2Node( Compile* C, Node *n ) : Node(0,n) { // Put it on the Macro nodes list to removed during macro nodes expansion. init_flags(Flag_is_macro); C->add_macro_node(this); } ! virtual int Opcode() const; virtual const Type *bottom_type() const { return TypeInt::INT; } }; //------------------------------Opaque3Node------------------------------------ // A node to prevent unwanted optimizations. Will be optimized only during --- 69,79 ---- Opaque2Node( Compile* C, Node *n ) : Node(0,n) { // Put it on the Macro nodes list to removed during macro nodes expansion. init_flags(Flag_is_macro); C->add_macro_node(this); } ! virtual Opcodes Opcode() const; virtual const Type *bottom_type() const { return TypeInt::INT; } }; //------------------------------Opaque3Node------------------------------------ // A node to prevent unwanted optimizations. Will be optimized only during
*** 81,91 **** class Opaque3Node : public Opaque2Node { int _opt; // what optimization it was used for public: enum { RTM_OPT }; Opaque3Node(Compile* C, Node *n, int opt) : Opaque2Node(C, n), _opt(opt) {} ! virtual int Opcode() const; bool rtm_opt() const { return (_opt == RTM_OPT); } }; //------------------------------ProfileBooleanNode------------------------------- // A node represents value profile for a boolean during parsing. --- 81,91 ---- class Opaque3Node : public Opaque2Node { int _opt; // what optimization it was used for public: enum { RTM_OPT }; Opaque3Node(Compile* C, Node *n, int opt) : Opaque2Node(C, n), _opt(opt) {} ! virtual Opcodes Opcode() const; bool rtm_opt() const { return (_opt == RTM_OPT); } }; //------------------------------ProfileBooleanNode------------------------------- // A node represents value profile for a boolean during parsing.
*** 105,115 **** uint false_count() const { return _false_cnt; } uint true_count() const { return _true_cnt; } void consume() { _consumed = true; } ! virtual int Opcode() const; virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); virtual Node* Identity(PhaseGVN* phase); virtual const Type *bottom_type() const { return TypeInt::BOOL; } }; --- 105,115 ---- uint false_count() const { return _false_cnt; } uint true_count() const { return _true_cnt; } void consume() { _consumed = true; } ! virtual Opcodes Opcode() const; virtual Node *Ideal(PhaseGVN *phase, bool can_reshape); virtual Node* Identity(PhaseGVN* phase); virtual const Type *bottom_type() const { return TypeInt::BOOL; } };
< prev index next >