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

12

/openjdk7/hotspot/src/share/vm/opto/
H A Dmultnode.cpp39 Node *MultiNode::match( const ProjNode *proj, const Matcher *m ) { return proj->clone(); } argument
49 assert(p == this && this->is_Start(), "else must be proj");
52 ProjNode *proj = p->as_Proj(); local
53 if( proj->_con == which_proj ) {
54 assert(Opcode() != Op_If || proj->Opcode() == (which_proj?Op_IfTrue:Op_IfFalse), "bad if #2");
55 return proj;
H A Dlcm.cpp58 // The proj is the control projection for the not-null case.
61 void Block::implicit_null_check(PhaseCFG *cfg, Node *proj, Node *val, int allowed_reasons) { argument
69 if( proj->Opcode() == Op_IfTrue ) f = 1.0f - f;
76 Block* not_null_block; // this one goes with the proj
78 if (_nodes[_nodes.size()-1] == proj) {
82 assert(_nodes[_nodes.size()-2] == proj, "proj is one or the other");
359 // proj==Op_True --> ne test; proj==Op_False --> eq test.
366 if( proj
558 add_call_kills(MachProjNode *proj, RegMask& regs, const char* save_policy, bool exclude_soe) argument
615 MachProjNode *proj = new (matcher.C) MachProjNode( mcall, r_cnt+1, RegMask::Empty, MachProjNode::fat_proj ); local
842 MachProjNode *proj = new (matcher.C) MachProjNode( n, 1, RegMask::Empty, MachProjNode::fat_proj ); local
[all...]
H A DloopUnswitch.cpp164 ProjNode* proj= unswitch_iff->fast_out(i)->as_Proj(); local
166 for (DUIterator_Fast jmax, j = proj->fast_outs(jmax); j < jmax; j++) {
167 Node* use = proj->fast_out(j);
172 ProjNode* invar_proj = invar_iff->proj_out(proj->_con)->as_Proj();
H A Dmultnode.hpp47 virtual Node *match( const ProjNode *proj, const Matcher *m );
H A Dcallnode.cpp71 Node *StartNode::match( const ProjNode *proj, const Matcher *match ) { argument
72 switch (proj->_con) {
76 return new (match->C) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj);
78 return new (match->C) MachProjNode(this,proj->_con,Matcher::c_frame_ptr_mask, Op_RegP);
80 return new (match->C) MachProjNode(this,proj->_con,match->_return_addr_mask,Op_RegP);
83 uint parm_num = proj->_con - TypeFunc::Parms;
84 const Type *t = _domain->field_at(proj->_con);
89 return new (match->C) MachProjNode(this,proj->_con,rm,ideal_reg);
621 Node *CallNode::match( const ProjNode *proj, const Matcher *match ) { argument
622 switch (proj
1180 Node* proj = proj_out(TypeFunc::Control); local
1478 ProjNode* proj = if_node->as_If()->proj_out(!if_true); local
[all...]
H A DloopPredicate.cpp45 // Return true if proj is the form of "proj->[region->..]call_uct"
46 bool PhaseIdealLoop::is_uncommon_trap_proj(ProjNode* proj, Deoptimization::DeoptReason reason) { argument
48 assert(proj, "invalid argument");
49 Node* out = proj;
71 // Return true for "if(test)-> proj -> ...
77 bool PhaseIdealLoop::is_uncommon_trap_if_pattern(ProjNode *proj, Deoptimization::DeoptReason reason) { argument
78 Node *in0 = proj->in(0);
92 ProjNode* other_proj = iff->proj_out(1-proj->_con)->as_Proj();
755 // Create list of if-projs such that a newer proj dominate
773 ProjNode* proj = if_proj_list.pop()->as_Proj(); local
[all...]
H A Difnode.cpp231 Node* proj = PhaseIdealLoop::find_predicate(r->in(ii)); local
232 if (proj != NULL) {
234 predicate_proj = proj;
343 Node *proj = NULL; local
348 proj = r->in(i3);
352 proj = v->in(0); // Controlling projection
358 if( proj->Opcode() == Op_IfTrue ) {
529 static void adjust_check(Node* proj, Node* range, Node* index, argument
533 Node *iff = proj->in(0);
537 DEBUG_ONLY( if( !bol->is_Bool() ) { proj
701 Node* proj = proj_out(i); local
[all...]
H A Dblock.cpp415 Node *proj = np->in(idx);
416 const Node *x = proj->is_block_proj();
421 g->set_req(0, proj);
423 x = proj = g;
427 Node *p = proj;
429 proj = p; // Update pointer to last Control
437 proj->set_req(0, r); // Insert RegionNode in the way
478 if( !_bbs.lookup(proj->_idx) ) {
479 assert( x != proj, "" );
481 _bbs.map(proj
[all...]
H A Dloopopts.cpp538 Node *proj = region->in(j); local
540 if (get_ctrl(inp) == proj) { // Found local op
545 if (get_ctrl(inp->in(k)) == proj)
609 Node *proj = region->in(j); local
611 if (get_ctrl(inp) == proj) { // Found local op
1648 // other-proj proj (arg)
1654 // | * proj-clone
1656 // other-proj v
1660 // * new-proj pro
1663 insert_if_before_proj(Node* left, bool Signed, BoolTest::mask relop, Node* right, ProjNode* proj) argument
1720 insert_region_before_proj(ProjNode* proj) argument
[all...]
H A Ddivnode.hpp168 virtual Node *match( const ProjNode *proj, const Matcher *m );
181 virtual Node *match( const ProjNode *proj, const Matcher *m );
H A Ddivnode.cpp1300 Node *DivModINode::match( const ProjNode *proj, const Matcher *match ) { argument
1301 uint ideal_reg = proj->ideal_reg();
1303 if (proj->_con == div_proj_num) {
1306 assert(proj->_con == mod_proj_num, "must be div or mod projection");
1309 return new (match->C)MachProjNode(this, proj->_con, rm, ideal_reg);
1315 Node *DivModLNode::match( const ProjNode *proj, const Matcher *match ) { argument
1316 uint ideal_reg = proj->ideal_reg();
1318 if (proj->_con == div_proj_num) {
1321 assert(proj->_con == mod_proj_num, "must be div or mod projection");
1324 return new (match->C)MachProjNode(this, proj
[all...]
H A Dmatcher.cpp1307 MachProjNode *proj = new (C) MachProjNode( mcall, r_cnt+10000, RegMask::Empty, MachProjNode::fat_proj ); local
1312 proj->_rout.Insert(OptoReg::Name(i));
1314 if( proj->_rout.is_NotEmpty() )
1315 _proj_list.push(proj);
2207 void Matcher::collect_null_checks( Node *proj, Node *orig_proj ) {
2208 Node *iff = proj->in(0);
2221 if( proj->Opcode() == Op_IfTrue ) {
2228 assert( proj->Opcode() == Op_IfFalse, "" );
2234 _null_check_tests.push(proj);
2316 ctrl = mem->fast_out(i); // Throw out-of-bounds if proj no
[all...]
H A Dloopnode.hpp875 // Return true if proj is for "proj->[region->..]call_uct"
876 static bool is_uncommon_trap_proj(ProjNode* proj, Deoptimization::DeoptReason reason);
877 // Return true for "if(test)-> proj -> ...
881 static bool is_uncommon_trap_if_pattern(ProjNode* proj, Deoptimization::DeoptReason reason);
994 RegionNode* insert_region_before_proj(ProjNode* proj);
996 ProjNode* insert_if_before_proj(Node* left, bool Signed, BoolTest::mask relop, Node* right, ProjNode* proj);
H A Dmatcher.hpp184 void collect_null_checks( Node *proj, Node *orig_proj );
H A Dblock.hpp262 // %%%%% add a proj after every goto
285 void add_call_kills(MachProjNode *proj, RegMask& regs, const char* save_policy, bool exclude_soe);
299 void implicit_null_check(PhaseCFG *cfg, Node *proj, Node *val, int allowed_reasons);
H A Dcallnode.hpp81 virtual Node *match( const ProjNode *proj, const Matcher *m );
550 virtual Node *match( const ProjNode *proj, const Matcher *m );
H A Dmacro.cpp2160 Node* proj = transform_later( new (C) SCMemProjNode(cas)); local
2161 fast_lock_mem_phi->init_req(2, proj);
2199 proj = transform_later( new (C) SCMemProjNode(cas));
2203 mem_phi->init_req(4, proj);
2211 slow_mem->init_req(1, proj);
H A Dgcm.cpp1328 Node *proj = matcher._null_check_tests[i ]; local
1330 _bbs[proj->_idx]->implicit_null_check(this, proj, val, allowed_reasons);
H A Dcfgnode.cpp2149 Node *proj = in(0)->in(1); // Expect a proj feeding CatchNode
2152 !(proj->is_Proj() && // AND NOT a rethrow
2153 proj->in(0)->is_Call() &&
2154 (call = proj->in(0)->as_Call()) &&
H A Dparse1.cpp2032 Node *proj = control(); local
2035 if( proj->is_Proj() ) {
2036 Node *n0 = proj->in(0);
H A Dcompile.cpp2767 Node* proj = NULL; local
2772 proj = use;
2776 assert(proj != NULL, "must be found");
2777 p->subsume_by(proj, this);
H A Dmemnode.hpp910 virtual Node *match( const ProjNode *proj, const Matcher *m );
H A Dmemnode.cpp2907 Node *MemBarNode::match( const ProjNode *proj, const Matcher *m ) { argument
2908 switch (proj->_con) {
2911 return new (m->C) MachProjNode(this,proj->_con,RegMask::Empty,MachProjNode::unmatched_proj);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java88 Node proj = stack.pop();
89 Node parent = proj;
90 if (proj.isBlockProjection && proj.preds.size() > 0) {
91 parent = proj.preds.get(0);
103 if (proj != parent && proj.succs.size() == 1 && proj.succs.contains(root)) {
105 proj.block = block;
108 Node p = proj;
[all...]
/openjdk7/jdk/test/java/lang/invoke/
H A DRicochetTest.java374 MethodHandle proj = id; // lambda(..., vret x,...){x}
377 proj = dropArguments(proj, j, Object.class);
379 assert(proj.type().parameterCount() == len);
380 // proj: (Object*, pos: vret, Object*)->ret
381 assertEquals(vret, proj.type().parameterType(pos));
384 x = filterArguments(proj, pos, vgFilter).invokeWithArguments(new Object[len]);
391 MethodHandle proj = id; // lambda(ret x, ...){x}
392 if (ret == void.class) proj = constant(Object.class, null);
395 proj
[all...]

Completed in 161 milliseconds

12