< prev index next >

src/hotspot/share/opto/cfgnode.hpp

Print this page
@@ -130,11 +130,10 @@
    virtual const Type* Value(PhaseGVN* phase) const;
    virtual Node* Identity(PhaseGVN* phase);
    virtual Node* Ideal(PhaseGVN* phase, bool can_reshape);
    void remove_unreachable_subgraph(PhaseIterGVN* igvn);
    virtual const RegMask &out_RegMask() const;
-   bool try_clean_mem_phi(PhaseGVN* phase);
    bool optimize_trichotomy(PhaseIterGVN* igvn);
    NOT_PRODUCT(virtual void dump_spec(outputStream* st) const;)
  };
  
  //------------------------------JProjNode--------------------------------------

@@ -249,10 +248,13 @@
             inst_id()     == id     &&
             inst_index()  == index  &&
             inst_offset() == offset &&
             type()->higher_equal(tp);
    }
+   Node* try_clean_mem_phi(PhaseGVN *phase);
+ 
+   InlineTypeNode* push_inline_types_through(PhaseGVN* phase, bool can_reshape, ciInlineKlass* vk, bool is_init);
  
    virtual const Type* Value(PhaseGVN* phase) const;
    virtual Node* Identity(PhaseGVN* phase);
    virtual Node *Ideal(PhaseGVN *phase, bool can_reshape);
    virtual const RegMask &out_RegMask() const;

@@ -431,10 +433,12 @@
    // Takes the type of val and filters it through the test represented
    // by if_proj and returns a more refined type if one is produced.
    // Returns null is it couldn't improve the type.
    static const TypeInt* filtered_int_type(PhaseGVN* phase, Node* val, Node* if_proj);
  
+   bool is_flat_array_check(PhaseTransform* phase, Node** array = nullptr);
+ 
  #ifndef PRODUCT
    virtual void dump_spec(outputStream *st) const;
  #endif
  };
  

@@ -666,10 +670,11 @@
  // the effects on its arguments, and would be finally matched to nothing.
  class BlackholeNode : public MultiNode {
  public:
    BlackholeNode(Node* ctrl) : MultiNode(1) {
      init_req(TypeFunc::Control, ctrl);
+     init_class_id(Class_Blackhole);
    }
    virtual int   Opcode() const;
    virtual uint ideal_reg() const { return 0; } // not matched in the AD file
    virtual const Type* bottom_type() const { return TypeTuple::MEMBAR; }
  
< prev index next >