Lines Matching +defs:val +defs:opt
157 static bool check_phi_clipping( PhiNode *phi, ConNode * &min, uint &min_idx, ConNode * &max, uint &max_idx, Node * &val, uint &val_idx ) {
160 val = NULL;
190 val = n;
197 return ( min && max && val && (min->get_int() <= 0) && (max->get_int() >=0) );
638 Node *val;
642 if( check_phi_clipping( phi, min, min_idx, max, max_idx, val, val_idx ) ) {
654 // Only remaining check is that bot_in == top_in == (Phi's val + mods)
809 Node *opt = MemNode::optimize_simple_memory_chain(in, at, igvn);
810 PhiNode *optphi = opt->is_Phi() ? opt->as_Phi() : NULL;
812 opt = node_map[optphi->_idx];
813 if (opt == NULL) {
823 nphi->set_req(i, opt);
1403 static void split_once(PhaseIterGVN *igvn, Node *phi, Node *val, Node *n, Node *newn) {
1408 if (phi->in(i) == val) { // Found a path with val?
1446 Node *val = phi->in(i); // Constant to split for
1454 if( phi->in(i) == val ) {
1470 split_once(igvn, phi, val, r, newr);
1477 split_once(igvn, phi, val, phi2, newphi);
1484 if( phi->in(i) == val ) {
1488 phi->add_req(val);
1686 Node* opt = NULL;
1693 opt = unsafe_id;
1696 if( opt == NULL )
1697 opt = is_x2logic(phase, this, true_path);
1700 if( opt == NULL )
1701 opt = is_absolute(phase, this, true_path);
1704 if( opt == NULL && can_reshape )
1705 opt = is_cond_add(phase, this, true_path);
1709 if( opt != NULL ) {
1710 if( opt == unsafe_id || is_unsafe_data_reference(opt) ) {
1721 return opt;
1728 opt = split_flow_path(phase, this);
1730 assert(opt == NULL || phase->eqv(opt, this), "do not elide phi");
1731 if (opt != NULL) return opt;