src/hotspot/share/opto/cfgnode.hpp

rev 52801 : Upstream/backport Shenandoah to JDK11u
* * *
[backport] 8237570: Shenandoah: cleanup uses of allocation/free threshold in static heuristics
Reviewed-by: rkennke

*** 301,311 ****
    static bool is_dominator_unc(CallStaticJavaNode* dom_unc, CallStaticJavaNode* unc);
  
  protected:
    ProjNode* range_check_trap_proj(int& flip, Node*& l, Node*& r);
    Node* Ideal_common(PhaseGVN *phase, bool can_reshape);
-   Node* dominated_by(Node* prev_dom, PhaseIterGVN* igvn);
    Node* search_identical(int dist);
  
  public:
  
    // Degrees of branch prediction probability by order of magnitude:
--- 301,310 ----
*** 389,398 ****
--- 388,398 ----
    virtual const Type* Value(PhaseGVN* phase) const;
    virtual int required_outcnt() const { return 2; }
    virtual const RegMask &out_RegMask() const;
    Node* fold_compares(PhaseIterGVN* phase);
    static Node* up_one_dom(Node* curr, bool linear_only = false);
+   Node* dominated_by(Node* prev_dom, PhaseIterGVN* igvn);
  
    // 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);