comparison src/share/vm/opto/macro.hpp @ 420:a1980da045cc

6462850: generate biased locking code in C2 ideal graph Summary: Inline biased locking code in C2 ideal graph during macro nodes expansion Reviewed-by: never
author kvn
date Fri, 07 Nov 2008 09:29:38 -0800
parents 02a35ad4adf8
children c18cbe5936b8
comparison
equal deleted inserted replaced
419:0bf25c4807f9 420:a1980da045cc
91 void expand_lock_node(LockNode *lock); 91 void expand_lock_node(LockNode *lock);
92 void expand_unlock_node(UnlockNode *unlock); 92 void expand_unlock_node(UnlockNode *unlock);
93 93
94 int replace_input(Node *use, Node *oldref, Node *newref); 94 int replace_input(Node *use, Node *oldref, Node *newref);
95 void copy_call_debug_info(CallNode *oldcall, CallNode * newcall); 95 void copy_call_debug_info(CallNode *oldcall, CallNode * newcall);
96 Node* opt_iff(Node* region, Node* iff); 96 Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false);
97 void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call); 97 void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call);
98 CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call, 98 CallNode* make_slow_call(CallNode *oldcall, const TypeFunc* slow_call_type, address slow_call,
99 const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1); 99 const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1);
100 void extract_call_projections(CallNode *call); 100 void extract_call_projections(CallNode *call);
101 101