Searched refs:IfNode (Results 1 - 23 of 23) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A DloopUnswitch.cpp75 IfNode* PhaseIdealLoop::find_unswitching_candidate(const IdealLoopTree *loop) const {
79 IfNode* unswitch_iff = NULL;
85 IfNode* iff = n_dom->as_If();
112 IfNode* unswitch_iff = find_unswitching_candidate((const IdealLoopTree *)loop);
150 IfNode* invar_iff = proj_true->in(0)->as_If();
189 IfNode* unswitch_iff_clone = old_new[unswitch_iff->_idx]->as_If();
230 IfNode* iff = new (C) IfNode(entry, bol, PROB_MAX, COUNT_UNKNOWN);
H A Difnode.cpp45 const Type *IfNode::Value( PhaseTransform *phase ) const {
61 const RegMask &IfNode::out_RegMask() const {
69 static Node* split_if(IfNode *iff, PhaseIterGVN *igvn) {
151 continue; // CastPP/II of the IfNode is OK
289 // Make the IfNode
290 IfNode *iff_c = new (igvn->C) IfNode(region_c,b_c,iff->_prob,iff->_fcnt);
295 IfNode *iff_x = new (igvn->C) IfNode(region_x,b_x,iff->_prob, iff->_fcnt);
448 int IfNode
[all...]
H A DloopPredicate.cpp82 IfNode* iff = in0->as_If();
151 IfNode* iff = cont_proj->in(0)->as_If();
185 IfNode *new_iff = iff->clone()->as_If();
239 IfNode* iff = cont_proj->in(0)->as_If();
262 IfNode *new_iff = iff->clone()->as_If();
307 IfNode* iff = new_predicate_proj->in(0)->as_If();
404 IfNode* iff = entry->in(0)->as_If();
586 bool IdealLoopTree::is_range_check_if(IfNode *iff, PhaseIdealLoop *phase, Invariance& invar) const {
774 IfNode* iff = proj->in(0)->as_If();
812 IfNode* new_predicate_if
[all...]
H A Dcfgnode.hpp45 class IfNode;
260 //------------------------------IfNode-----------------------------------------
262 class IfNode : public MultiBranchNode { class in inherits:MultiBranchNode
336 IfNode( Node *control, Node *b, float p, float fcnt ) function in class:IfNode
366 IfTrueNode( IfNode *ifnode ) : CProjNode(ifnode,1) {
375 IfFalseNode( IfNode *ifnode ) : CProjNode(ifnode,0) {
H A DgraphKit.hpp312 Node* IfTrue(IfNode* iff) { return _gvn.transform(new (C) IfTrueNode(iff)); }
313 Node* IfFalse(IfNode* iff) { return _gvn.transform(new (C) IfFalseNode(iff)); }
768 Node* fast_and_slow(Node* in, const Type *result_type, Node* null_result, IfNode* fast_test, Node* fast_result, address slow_call, const TypeFunc *slow_call_type, Node* slow_arg, klassOop ex_klass, Node* slow_result);
816 IfNode* create_and_map_if(Node* ctrl, Node* tst, float prob, float cnt) {
817 IfNode* iff = new (C) IfNode(ctrl, tst, prob, cnt);// New IfNode's
824 IfNode* create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) {
825 IfNode* iff = new (C) IfNode(ctr
[all...]
H A Dloopnode.hpp246 class CountedLoopEndNode : public IfNode {
251 : IfNode( control, test, prob, cnt) {
462 bool is_range_check_if(IfNode *iff, PhaseIdealLoop *phase, Invariance& invar) const;
942 IfNode* find_unswitching_candidate(const IdealLoopTree *loop) const;
985 IfNode* insert_cmpi_loop_exit(IfNode* if_cmpu, IdealLoopTree *loop);
986 void remove_cmpi_loop_exit(IfNode* if_cmp, IdealLoopTree *loop);
990 ProjNode* proj_clone(ProjNode* p, IfNode* iff);
992 Node* short_circuit_if(IfNode* iff, ProjNode* live_proj);
1026 // Mark an IfNode a
[all...]
H A Dparse.hpp542 IfNode* jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask);
544 void jump_if_true_fork(IfNode *ifNode, int dest_bci_if_true, int prof_table_index);
545 void jump_if_false_fork(IfNode *ifNode, int dest_bci_if_false, int prof_table_index);
H A Dstringopts.cpp766 IfNode* iff = ptr->in(0)->as_If();
988 IfNode* iff = kit.create_and_map_if(kit.control(),
1010 IfNode* iff = kit.create_and_map_if(kit.control(), p, PROB_FAIR, COUNT_UNKNOWN);
1045 IfNode* iff2 = kit.create_and_map_if(kit.control(), limitb, PROB_MIN, COUNT_UNKNOWN);
1076 IfNode* iff = kit.create_and_map_if(kit.control(),
1114 IfNode* iff = kit.create_and_map_if(kit.control(),
1174 IfNode* iff = kit.create_and_map_if(head, __ Bool(__ CmpI(q, __ intcon(0)), BoolTest::ne),
1199 IfNode* iff = kit.create_and_map_if(kit.control(),
1350 IfNode* iff = kit.create_and_map_if(kit.control(), p, PROB_MIN, COUNT_UNKNOWN);
1374 IfNode* if
[all...]
H A DidealKit.hpp175 Node* IfTrue(IfNode* iff) { return transform(new (C) IfTrueNode(iff)); }
176 Node* IfFalse(IfNode* iff) { return transform(new (C) IfFalseNode(iff)); }
H A Dloopopts.cpp221 // If I dont have a reachable TRUE and FALSE path following the IfNode then
481 IfNode *iff = lp_c->as_If();
990 // Such nodes should only have ProjNodes as outs, e.g. IfNode
1622 ProjNode* PhaseIdealLoop::proj_clone(ProjNode* p, IfNode* iff) {
1630 Node* PhaseIdealLoop::short_circuit_if(IfNode* iff, ProjNode* live_proj) {
1664 IfNode* iff = proj->in(0)->as_If();
1682 IfNode* new_if = new (C)IfNode(proj2, bol, iff->_prob, iff->_fcnt);
1721 IfNode* iff = proj->in(0)->as_If();
1737 IfNode* dum_i
[all...]
H A Dcfgnode.cpp212 static bool check_if_clipping( const RegionNode *region, IfNode * &bot_if, IfNode * &top_if ) {
236 top_if = (IfNode*)in1000;
237 bot_if = (IfNode*)in10;
288 static bool check_compare_clipping( bool less_than, IfNode *iff, ConNode *limit, Node * & input ) {
643 IfNode *top_if;
644 IfNode *bot_if;
664 IfNode *iff = (IfNode*)gvn->register_new_node_with_optimizer(new (phase->C) IfNode( top_i
[all...]
H A Dparse2.cpp142 // See IfNode::Ideal, is_range_check, adjust_check.
167 // returns IfNode
168 IfNode* Parse::jump_if_fork_int(Node* a, Node* b, BoolTest::mask mask) {
171 IfNode *iff = create_and_map_if( control(), tst, ((mask == BoolTest::eq) ? PROB_STATIC_INFREQUENT : PROB_FAIR), COUNT_UNKNOWN );
189 void Parse::jump_if_true_fork(IfNode *iff, int dest_bci_if_true, int prof_table_index) {
203 void Parse::jump_if_false_fork(IfNode *iff, int dest_bci_if_true, int prof_table_index) {
449 IfNode* iff = create_and_map_if( control(), tst, PROB_FAIR, COUNT_UNKNOWN);
560 IfNode *iff_ne = jump_if_fork_int(key_val, test_val, BoolTest::ne);
575 IfNode *iff_le = jump_if_fork_int(key_val, test_val, BoolTest::le);
587 IfNode *iff_g
[all...]
H A Dmacro.cpp112 IfNode* iff = new (C) IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN );
1138 IfNode *toobig_iff = new (C) IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
1215 IfNode *needgc_iff = new (C) IfNode(contended_region, needgc_bol, PROB_UNLIKELY_MAG(4), COUNT_UNKNOWN);
1266 IfNode *contention_iff = new (C) IfNode (needgc_false, contention_check, PROB_MIN, COUNT_UNKNOWN);
1641 IfNode *need_pf_iff = new (C) IfNode( needgc_fals
[all...]
H A DidealKit.cpp89 IfNode* iff = delay_transform(new (C) IfNode(ctrl(), bol, prob, cnt))->as_If();
H A DloopTransform.cpp39 // Given an IfNode, return the loop-exiting projection or NULL if both
44 // Test is an IfNode, has 2 projections. If BOTH are in the loop
133 IfNode* back_if = back->in(0)->as_If();
141 IfNode *iff = n->as_If();
319 // IfNode was dominated by version in peeled loop body
799 // Test is an IfNode, has 2 projections. If BOTH are in the loop
952 // Build the IfNode
953 IfNode *zer_iff = new (C) IfNode( new_main_exit, zer_bol, PROB_FAIR, COUNT_UNKNOWN );
1027 // Build the IfNode (assum
[all...]
H A DgenerateOptoStub.cpp252 IfNode *iff = create_and_map_if(control(), bo, PROB_MIN, COUNT_UNKNOWN);
H A DgraphKit.cpp668 IfNode* iff = kit->create_and_map_if(outer_map->control(), p, prob, cnt);
1268 cfg = IfNode::up_one_dom(cfg, /*linear_only=*/ true);
1306 IfNode* iff = create_and_map_if(control(), tst, ok_prob, COUNT_UNKNOWN);
1954 IfNode *iff = i0->as_If();
2124 // Optimize the fast-check IfNode. Set the fast-path region slot 2.
2127 IfNode *opt_iff = _gvn.transform(iff)->as_If();
2330 IfNode* iff = create_and_xform_if(control(), bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
2374 IfNode *iff1 = create_and_xform_if( control(), bol1, PROB_LIKELY(0.83f), COUNT_UNKNOWN );
2404 IfNode *iff2 = create_and_xform_if( control(), bol2, PROB_LIKELY(0.63f), COUNT_UNKNOWN );
2413 IfNode *iff
[all...]
H A Dlibrary_call.cpp870 IfNode* iff = create_and_map_if(control(), test, true_prob, COUNT_UNKNOWN);
1542 IfNode *iff = create_and_xform_if(control(),bol, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
1604 IfNode* iff = create_and_xform_if(control(), bolisnum, PROB_STATIC_FREQUENT, COUNT_UNKNOWN);
1694 IfNode *if1 = create_and_xform_if(control(),bol1, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN);
1718 IfNode *if2 = create_and_xform_if(complex_path,bol2, PROB_STATIC_INFREQUENT, COUNT_UNKNOWN);
1742 IfNode *ifyplus1 = create_and_xform_if(ylong_path,bolyplus1, PROB_FAIR, COUNT_UNKNOWN);
1771 IfNode *ifyeven = create_and_xform_if(ylong_path,bol3, PROB_FAIR, COUNT_UNKNOWN);
1897 // Some should be inside IfNode, and there to be a more reliable
1941 for (; dom != NULL; dom = IfNode::up_one_dom(dom, true)) {
2993 IfNode* iff_bi
[all...]
H A DparseHelper.cpp227 IfNode* iff = create_and_map_if(control(), tst, PROB_ALWAYS, COUNT_UNKNOWN);
H A Dloopnode.cpp503 IfNode* check_iff = limit_check_proj->in(0)->as_If();
718 // Replace the old IfNode with a new LoopEndNode
720 IfNode *le = lex->as_If();
1124 const TypeInt* if_t = IfNode::filtered_int_type(&_igvn, val, pred);
1159 IfNode::dump_spec(st);
1314 IfNode *iff;
3684 // computed_idom() will return n->in(0) when idom(n) is an IfNode (or
H A Dparse1.cpp152 IfNode* iff = create_and_map_if(control(), tst, PROB_MAX, COUNT_UNKNOWN);
1932 IfNode* iff = create_and_map_if(control(), test, PROB_MAX, COUNT_UNKNOWN);
H A Dnode.hpp69 class IfNode;
/openjdk7/hotspot/src/share/vm/runtime/
H A DvmStructs.cpp1754 declare_c2_type(IfNode, MultiBranchNode) \
1829 declare_c2_type(CountedLoopEndNode, IfNode) \

Completed in 191 milliseconds