< prev index next >

src/hotspot/share/opto/cfgnode.hpp

Print this page

        

*** 1,7 **** /* ! * Copyright (c) 1997, 2015, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation. --- 1,7 ---- /* ! * Copyright (c) 1997, 2018, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License version 2 only, as * published by the Free Software Foundation.
*** 302,312 **** 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: --- 302,311 ----
*** 390,399 **** --- 389,399 ---- 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);
< prev index next >