Searched refs:BoolNode (Results 1 - 25 of 26) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/opto/
H A Dsubnode.cpp1077 uint BoolNode::hash() const { return (Node::hash() << 3)|(_test._test+1); }
1078 uint BoolNode::size_of() const { return sizeof(BoolNode); }
1081 uint BoolNode::cmp( const Node &n ) const {
1082 const BoolNode *b = (const BoolNode *)&n; // Cast up
1093 return new (gvn->C) BoolNode( ncmp, test );
1097 Node* BoolNode::make_predicate(Node* test_value, PhaseGVN* phase) {
1103 BoolNode* bol = test_value->in(CMoveNode::Condition)->as_Bool();
1116 Node* bol = new (C) BoolNode(cm
[all...]
H A Difnode.cpp77 BoolNode *b = i1->as_Bool();
287 Node *b_c = phase->transform(new (igvn->C) BoolNode(cmp_c,b->_test._test));
288 Node *b_x = phase->transform(new (igvn->C) BoolNode(cmp_x,b->_test._test));
451 BoolNode* bn = b->as_Bool();
536 // bail (or bomb[ASSERT/DEBUG]) if NOT projection-->IfNode-->BoolNode
537 DEBUG_ONLY( if( !bol->is_Bool() ) { proj->dump(3); fatal("Expect projection-->IfNode-->BoolNode"); } )
553 Node *new_bol = gvn->transform( new (gvn->C) BoolNode( new_cmp, bol->as_Bool()->_test._test ) );
611 BoolNode* bol = iff->in(1)->as_Bool();
682 BoolNode* this_bool = in(1)->as_Bool();
712 BoolNode* dom_boo
[all...]
H A DloopUnswitch.cpp87 BoolNode* bol = iff->in(1)->as_Bool();
152 BoolNode* bol = unswitch_iff->in(1)->as_Bool();
H A DloopPredicate.cpp593 const BoolNode *bol = iff->in(1)->as_Bool();
645 BoolNode* PhaseIdealLoop::rc_predicate(IdealLoopTree *loop, Node* ctrl,
692 BoolNode* bol = new (C) BoolNode(cmp, BoolTest::lt);
797 BoolNode* bol = test->as_Bool();
803 BoolNode* new_predicate_bol = invar.clone(bol, ctrl)->as_Bool();
808 new_predicate_bol = new (C) BoolNode(new_predicate_bol->in(1), new_predicate_bol->_test.negate());
H A Dconnode.cpp123 BoolNode* b = in(Condition)->as_Bool();
124 BoolNode* b2 = b->negate(phase);
133 Node *CMoveNode::is_cmove_id( PhaseTransform *phase, Node *cmp, Node *t, Node *f, BoolNode *b ) {
173 BoolNode *b = in(Condition)->as_Bool();
231 BoolNode* b = in(Condition)->as_Bool();
232 BoolNode* b2 = b->negate(phase);
248 BoolNode *bol = in(1)->as_Bool();
291 BoolNode *bol = in(1)->as_Bool();
347 BoolNode *bol = in(1)->as_Bool();
H A DloopTransform.cpp947 Node *zer_bol = new (C) BoolNode( zer_cmp, b_test );
1022 Node *min_bol = new (C) BoolNode( min_cmp, b_test );
1098 BoolNode* new_bol0 = new (C) BoolNode(pre_bol->in(1), new_test);
1104 BoolNode* new_bol1 = new (C) BoolNode(min_bol->in(1), new_test);
1109 BoolNode* main_bol = main_end->in(CountedLoopEndNode::TestValue)->as_Bool();
1110 BoolNode* new_bol2 = new (C) BoolNode(main_bol->in(1), new_test);
1305 Node* adj_bool = new (C) BoolNode(adj_cm
[all...]
H A Dsubnode.hpp281 //------------------------------BoolNode---------------------------------------
283 class BoolNode : public Node { class in inherits:Node
289 BoolNode( Node *cc, BoolTest::mask t): _test(t), Node(0,cc) { function in class:BoolNode
297 BoolNode* negate(PhaseGVN* phase);
H A Dlibrary_call.cpp901 Node* bol_lt = _gvn.transform( new (C) BoolNode(cmp_lt, BoolTest::lt) );
920 Node* bol_le = _gvn.transform( new (C) BoolNode(cmp_le, le_or_eq) );
958 Node* bol_lt = _gvn.transform( new (C) BoolNode(cmp_lt, BoolTest::lt) );
1086 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::eq));
1101 Node* bol = _gvn.transform(new (C) BoolNode(cmp, BoolTest::ne));
1140 Node* bol = _gvn.transform( new(C) BoolNode(cmp, BoolTest::ne) );
1354 Node* bol = _gvn.transform( new(C) BoolNode(cmp, BoolTest::gt) );
1364 bol = _gvn.transform( new(C) BoolNode(cmp, BoolTest::eq) );
1540 Node *bol = _gvn.transform( new (C) BoolNode( cmp, BoolTest::lt ) );
1590 Node* bolisnum = _gvn.transform(new (C) BoolNode(cmpisna
[all...]
H A Dcfgnode.cpp291 BoolNode *bool1 = i1->as_Bool();
663 Node *boo = gvn->register_new_node_with_optimizer(new (phase->C) BoolNode( cmp, BoolTest::lt ));
669 boo = gvn->register_new_node_with_optimizer(new (phase->C) BoolNode( cmp, BoolTest::gt ));
1102 BoolNode* b = iff->in(1)->as_Bool();
1224 BoolNode *b = (BoolNode*)iff->in(1);
1280 BoolNode* b = iff->in(1)->as_Bool();
1339 BoolNode *bol = phi_root->in(0)->in(1)->in(0)->in(1)->as_Bool();
H A DparseHelper.cpp179 Node* bol = _gvn.transform(new (C) BoolNode( cmp, BoolTest::eq ));
327 Node *tst = _gvn.transform( new (C) BoolNode( chk, btest) );
H A Ddivnode.cpp888 Node *bol1 = phase->transform( new (phase->C) BoolNode( cmp1, BoolTest::ge ) );
893 Node *bol2 = phase->transform( new (phase->C) BoolNode( cmp2, BoolTest::ge ) );
1061 Node *bol1 = phase->transform( new (phase->C) BoolNode( cmp1, BoolTest::ge ) );
1066 Node *bol2 = phase->transform( new (phase->C) BoolNode( cmp2, BoolTest::ge ) );
H A DgenerateOptoStub.cpp251 Node* bo = _gvn.transform( new (C) BoolNode(cmp, BoolTest::ne) );
H A DidealKit.hpp188 Node* Bool(Node* cmp, BoolTest::mask relop) { return transform(new (C) BoolNode(cmp, relop)); }
H A DgraphKit.cpp500 Node* tst = _gvn.transform( new (C) BoolNode(chk, BoolTest::eq) );
1240 BoolNode *btst = new (C) BoolNode( chk, btest);
2329 Node* bol = _gvn.transform( new(C) BoolNode(cmp, BoolTest::eq) );
2373 Node *bol1 = _gvn.transform( new (C) BoolNode( cmp1, BoolTest::eq ) );
2403 Node *bol2 = _gvn.transform( new (C) BoolNode( cmp2, BoolTest::ne ) );
2412 Node *bol3 = _gvn.transform( new (C) BoolNode( cmp3, BoolTest::eq ) );
2442 Node *bol4 = _gvn.transform( new (C) BoolNode( cmp4, BoolTest::ne ) );
2510 Node* bol = _gvn.transform( new(C) BoolNode(cmp, BoolTest::eq) );
3174 Node* bol_lh = _gvn.transform( new(C) BoolNode(cmp_l
[all...]
H A Dloopopts.cpp1080 BoolNode *PhaseIdealLoop::clone_iff( PhiNode *phi, IdealLoopTree *loop ) {
1142 return (BoolNode*)b;
1503 BoolNode *b = clone_iff( iff->in(1)->as_Phi(), loop );
1542 BoolNode* bl = iff->in(1)->as_Bool();
1679 BoolNode* bol = new (C)BoolNode(cmp, relop);
1789 BoolNode* bol = if_cmpu->in(1)->as_Bool();
1975 // marks the method as not compilable. For example, if a "BoolNode"
H A Dparse2.cpp133 tst = _gvn.transform( new (C) BoolNode(chk, btest) );
170 Node *tst = _gvn.transform( new (C) BoolNode( cmp, mask));
448 Node* tst = _gvn.transform( new (C) BoolNode(cmp, BoolTest::ge) );
934 BoolNode* bol = phi->in(0)->in(1)->in(0)->in(1)->as_Bool();
1001 Node *tst = _gvn.transform( new (C) BoolNode( c, btest ) );
1093 Node* tst0 = new (C) BoolNode(c, btest);
H A Dloopnode.hpp906 BoolNode* rc_predicate(IdealLoopTree *loop, Node* ctrl,
1002 BoolNode *clone_iff( PhiNode *phi, IdealLoopTree *loop );
H A Dmacro.cpp111 Node* bol = transform_later(new (C) BoolNode(cmp, BoolTest::ne));
1114 initial_slow_test = BoolNode::make_predicate(initial_slow_test, &_igvn);
1213 Node *needgc_bol = new (C) BoolNode(needgc_cmp, BoolTest::ge);
1260 Node *contention_check = new (C) BoolNode(store_eden_top, BoolTest::ne);
1639 Node *need_pf_bol = new (C) BoolNode( need_pf_cmp, BoolTest::ge );
H A Dconnode.hpp169 static Node *is_cmove_id( PhaseTransform *phase, Node *cmp, Node *t, Node *f, BoolNode *b );
H A Dstringopts.cpp150 BoolNode* b = value->in(0)->in(1)->in(0)->in(1)->as_Bool();
767 BoolNode* b = iff->in(1)->isa_Bool();
H A DgraphKit.hpp334 Node* Bool(Node* cmp, BoolTest::mask relop) { return _gvn.transform(new (C) BoolNode(cmp, relop)); }
H A Dparse1.cpp151 Node* tst = _gvn.transform( new (C) BoolNode(chk, BoolTest::eq) );
1930 Node* test = _gvn.transform(new (C) BoolNode(check, BoolTest::ne));
H A Dnode.hpp46 class BoolNode;
H A Dloopnode.cpp298 BoolNode *test = iff->in(1)->as_Bool();
509 bol = new (C) BoolNode(cmp_limit, BoolTest::le);
512 bol = new (C) BoolNode(cmp_limit, BoolTest::ge);
H A Dmatcher.cpp2119 // BoolNode::match_edge always returns a zero.
2211 BoolNode *b = iff->in(1)->as_Bool();

Completed in 234 milliseconds

12