/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_ValueStack.cpp | 177 assert(stack_at(index)->as_Phi() == NULL || stack_at(index)->as_Phi()->block() != b, "phi function already created"); 187 assert(local_at(index)->as_Phi() == NULL || local_at(index)->as_Phi()->block() != b, "phi function already created");
|
H A D | c1_Instruction.cpp | 821 assert(existing_value->as_Phi() != NULL && existing_value->as_Phi()->block() == this, "phi function required"); 824 assert(existing_value == new_state->local_at(index) || (existing_value->as_Phi() != NULL && existing_value->as_Phi()->as_Phi()->block() == this), "phi function required"); 834 Phi* existing_phi = existing_value->as_Phi(); 845 Phi* existing_phi = existing_value->as_Phi();
|
H A D | c1_ValueStack.hpp | 319 Phi* v_phi = value->as_Phi(); \ 327 Phi* v_phi = value->as_Phi(); \
|
H A D | c1_InstructionPrinter.cpp | 109 Phi* phi = v ? v->as_Phi() : NULL; 118 Phi* phi = v ? v->as_Phi() : NULL; 226 Phi* phi = value->as_Phi(); 288 Phi* phi = v->as_Phi();
|
H A D | c1_Optimizer.cpp | 157 if (sux_phi == NULL || sux_phi->as_Phi() == NULL || sux_phi->as_Phi()->block() != sux) return; 233 if (sux_phi->as_Phi()->operand_count() == 1) { 234 assert(sux_phi->as_Phi()->operand_at(0) == result, "screwed up phi");
|
H A D | c1_LIRGenerator.cpp | 392 if (instr->is_pinned() && instr->as_Phi() == NULL || instr->operand()->is_valid()) { 397 // assert(instr->use_count() > 0 || instr->as_Phi() != NULL, "leaf instruction must have a use"); 755 if (src_declared_type == NULL && (phi = src->as_Phi()) != NULL) { 760 if (dst_declared_type == NULL && (phi = dst->as_Phi()) != NULL) { 997 Phi* phi = sux_val->as_Phi(); 1328 assert(x->as_Phi() || x->as_Local() != NULL, "only for Phi and Local");
|
H A D | c1_Instruction.hpp | 415 bool can_be_linked() { return as_Local() == NULL && as_Phi() == NULL; } 462 virtual Phi* as_Phi() { return NULL; } function in class:Instruction
|
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | idealKit.cpp | 452 if (join_slice->is_Phi() && join_slice->as_Phi()->region() == join_region) { 453 phi = join_slice->as_Phi(); 473 if (join_io->is_Phi() && join_io->as_Phi()->region() == join_region) { 474 phi = join_io->as_Phi();
|
H A D | parse1.cpp | 1593 if (m->is_Phi() && m->as_Phi()->region() == r) 1594 phi = m->as_Phi(); 1705 if (p->is_Phi() && p->as_Phi()->region() == r) 1706 phi = p->as_Phi(); 1792 if (phi->is_Phi() && phi->as_Phi()->region() == r) { 1798 if (n->is_Phi() && n->as_Phi()->region() == r) { 1820 if (o->is_Phi() && o->as_Phi()->region() == region) { 1821 return o->as_Phi(); 1874 if (o->is_Phi() && o->as_Phi()->region() == region) { 1875 phi = o->as_Phi(); [all...] |
H A D | cfgnode.cpp | 125 return phi->as_Phi(); // this one is good enough 143 only_phi = phi->as_Phi(); 330 if (phi->as_Phi()->simple_data_loop_check(phi->in(1)) >= PhiNode::Unsafe) 588 if( n->as_Phi()->is_unsafe_data_reference(in) ) 785 PhiNode *phi2 = use->as_Phi(); 800 PhiNode *ophi = stack.node()->as_Phi(); 804 nphi = node_map[ophi->_idx]->as_Phi(); 810 PhiNode *optphi = opt->is_Phi() ? opt->as_Phi() : NULL; 847 np->as_Phi()->verify_adr_type(visited, at); 1475 if( phi2->is_Phi() && phi2->as_Phi() ! [all...] |
H A D | addnode.cpp | 92 if( in1->is_Phi() && (phi = in1->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add) 94 if( in2->is_Phi() && (phi = in2->as_Phi()) && !phi->is_copy() && phi->region()->is_Loop() && phi->in(2)==add){ 165 !(add1->in(1)->is_Phi() && add1->in(1)->as_Phi()->is_tripcount()) ) { 183 !(add2->in(1)->is_Phi() && add2->in(1)->as_Phi()->is_tripcount()) ) {
|
H A D | escape.cpp | 426 const Type* t = n->as_Phi()->type(); 613 const Type* t = n->as_Phi()->type(); 2316 C->get_alias_index(phi->as_Phi()->adr_type()) == alias_idx) { 2318 return phi->as_Phi(); 2364 PhiNode *newphi = create_split_phi(mem->as_Phi(), alias_idx, orig_phi_worklist, new_phi_created); 2370 phi = mem->as_Phi(); 2488 tp = use->as_Phi()->adr_type()->isa_ptr(); 2567 C->get_alias_index(result->as_Phi()->adr_type()) != alias_idx) { 2568 Node *un = result->as_Phi()->unique_input(igvn); 2570 orig_phis.append_if_missing(result->as_Phi()); [all...] |
H A D | loopnode.cpp | 45 if (this->is_Phi() && !this->as_Phi()->is_copy() && 46 this->as_Phi()->region()->is_CountedLoop() && 47 this->as_Phi()->region()->as_CountedLoop()->phi() == this) { 333 if (incr->as_Phi()->region() != x || incr->req() != 3) 368 PhiNode *phi = xphi->as_Phi(); 704 phi = nphi->as_Phi(); 1081 Node* phi = n->as_Phi(); 1203 PhiNode* old_phi = oj->as_Phi(); 1287 PhiNode *old_phi = out->as_Phi(); 1406 PhiNode* n = out->as_Phi(); [all...] |
H A D | escape.hpp | 562 return (phi == NULL) ? NULL : phi->as_Phi();
|
H A D | loopopts.cpp | 500 PhiNode* phi = out->as_Phi(); 599 phi = out->as_Phi(); 1087 _igvn.replace_input_of(phi, i, clone_iff( b->as_Phi(), loop )); 1156 _igvn.replace_input_of(phi, i, clone_bool( b->as_Phi(), loop )); 1503 BoolNode *b = clone_iff( iff->in(1)->as_Phi(), loop );
|
H A D | superword.hpp | 264 _iv = lp->as_CountedLoop()->phi()->as_Phi(); }
|
H A D | ifnode.cpp | 82 PhiNode *phi = i1->as_Phi(); 774 PhiNode *phi = i1->as_Phi();
|
H A D | graphKit.cpp | 382 Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type); 383 assert(phi->as_Phi()->region() == mms.base_memory()->in(0), ""); 2238 if (new_slice->is_Phi() && new_slice->as_Phi()->region() == region) { 2239 phi = new_slice->as_Phi(); 2241 if (old_slice->is_Phi() && old_slice->as_Phi()->region() == region)
|
H A D | memnode.cpp | 161 PhiNode *mphi = result->as_Phi(); 1113 phi->as_Phi()->is_same_inst_field(this_type, this_id, this_index, this_offset)) { 4088 phi_base = new_base->as_Phi(); 4155 PhiNode* phi_mem = new_mem->as_Phi(); 4222 PhiNode* phi = base_memory()->as_Phi(); 4427 while (n->is_Phi() && (n = n->as_Phi()->is_copy()) != NULL) {
|
H A D | chaitin.cpp | 1596 base->as_Phi()->set_type(t); 1659 if( phi->is_Phi() && phi->as_Phi()->region()->is_Loop() ) {
|
H A D | reg_split.cpp | 633 phi = n1->is_Phi() ? n1->as_Phi() : NULL;
|
H A D | stringopts.cpp | 147 int true_path = value->as_Phi()->is_diamond_phi();
|
H A D | subnode.cpp | 116 !(phi=inc->in(1)->as_Phi()) ||
|
H A D | macro.cpp | 395 phi->as_Phi()->is_same_inst_field(phi_type, instance_id, alias_idx, offset)) {
|
H A D | parse2.cpp | 928 PhiNode* phi = cmp->in(1)->as_Phi();
|