Lines Matching refs:use
384 // Perform optimization to use the loop predicates for null checks and range checks.
502 // Pre-computed def-use info
574 bool verify_dominance(Node* n, Node* use, Node* LCA, Node* early);
579 // 1) only one use
580 // 2) a use is the same as the current LCA passed as 'n1'
686 // Nodes always have DU info now, so re-use the side array slot
695 assert( old_node->req() == 1, "use this for Projs" );
959 // Has a use in the vector set
961 // Has use internal to the vector set (ie. not in a phi at the loop head)
968 // Insert phi(lp_entry_val, back_edge_val) at use->in(idx) for loop lp if phi does not already exist
969 void insert_phi_for_loop( Node* use, uint idx, Node* lp_entry_val, Node* back_edge_val, LoopNode* lp );
976 bool is_valid_clone_loop_exit_use( IdealLoopTree *loop, Node* use, uint exit_idx);
1011 // Attempt to use a conditional move instead of a phi/branch
1053 Node *find_use_block( Node *use, Node *def, Node *old_false, Node *new_false, Node *old_true, Node *new_true );
1054 void handle_use( Node *use, Node *def, small_cache *cache, Node *region_dom, Node *new_false, Node *new_true, Node *old_false, Node *old_true );
1056 void sink_use( Node *use, Node *post_loop );