Lines Matching defs:le
69 CountedLoopEndNode* le = l->loopexit();
70 if (le != NULL &&
71 le->proj_out(1 /* true */) == l->in(LoopNode::LoopBackControl)) {
73 Node* exit = le->proj_out(0 /* false */);
77 le->loopnode() == l && le->stride_is_con()) {
420 (bt == BoolTest::le || bt == BoolTest::lt) && stride_con < 0 ||
465 bool incl_limit = (bt == BoolTest::le || bt == BoolTest::ge);
509 bol = new (C) BoolNode(cmp_limit, BoolTest::le);
569 if (bt == BoolTest::le)
605 case BoolTest::le: // Maybe convert to '<' case
720 IfNode *le = lex->as_If();
722 set_idom(le, le->in(0), dd); // Update dominance for loop exit
723 set_loop(le, loop);
730 Node *ift2=_igvn.register_new_node_with_optimizer(new (C) IfTrueNode (le));
731 Node *iff2=_igvn.register_new_node_with_optimizer(new (C) IfFalseNode(le));
747 iffalse->set_req_X( 0, le, &_igvn );
748 iftrue ->set_req_X( 0, le, &_igvn );
751 set_idom(iftrue, le, dd+1);
752 set_idom(iffalse, le, dd+1);
754 lazy_replace( iff, le ); // fix 'get_ctrl'
772 Node *sfpt2 = le->in(0);