Searched refs:phi (Results 1 - 25 of 42) sorted by relevance

12

/openjdk7/hotspot/src/share/vm/opto/
H A Dloopopts.cpp51 Node *phi; local
56 phi = new (C) PhiNode(region, type, NULL, iid, index, offset);
58 phi = PhiNode::make_blank(region, n);
69 // Alter data node to use pre-phi inputs
92 // therefore, the only top we can split thru a phi is on a backedge of
130 phi->set_req( i, x );
134 _igvn.remove_dead_node(phi);
139 register_new_node( phi, region );
141 for (uint i2 = 1; i2 < phi->req(); i2++) {
142 Node *x = phi
268 Node *phi = n->in(i); local
500 PhiNode* phi = out->as_Phi(); local
595 PhiNode* phi = NULL; local
860 Node *phi = split_thru_phi( n, n_ctrl, policy ); local
1080 clone_iff( PhiNode *phi, IdealLoopTree *loop ) argument
1150 clone_bool( PhiNode *phi, IdealLoopTree *loop ) argument
1440 Node *phi; local
1511 Node *phi = b->in(1); local
1555 Node* phi = cmp1; local
1571 Node* phi = add->in(1); local
2021 Node *phi = PhiNode::make(lp, back_edge_val); local
2726 Node *phi = cl->phi(); local
[all...]
H A Dcfgnode.cpp82 assert(!r->as_Region()->has_phi(), "no phi users");
86 // igvn->hash_delete( phi );
100 // Node *phi = region->out(k);
101 // if( phi->is_Phi() ) {
102 // phi->add_req(phi->in(i));
122 Node* phi = fast_out(i); local
123 if (phi->is_Phi()) { // Check for Phi users
124 assert(phi->in(0) == (Node*)this, "phi use
139 Node* phi = fast_out(i); local
157 check_phi_clipping( PhiNode *phi, ConNode * &min, uint &min_idx, ConNode * &max, uint &max_idx, Node * &val, uint &val_idx ) argument
249 check_convf2i_clipping( PhiNode *phi, uint idx, ConvF2INode * &convf2i, Node *min, Node *max) argument
317 Node* phi = raw_out(i); local
386 PhiNode* phi = has_unique_phi(); local
633 PhiNode* phi = has_unique_phi(); local
1214 is_x2logic( PhaseGVN *phase, PhiNode *phi, int true_path ) argument
1273 is_cond_add(PhaseGVN *phase, PhiNode *phi, int true_path) argument
1403 split_once(PhaseIterGVN *igvn, Node *phi, Node *val, Node *n, Node *newn) argument
1427 split_flow_path(PhaseGVN *phase, PhiNode *phi) argument
1888 Node* phi = mms.memory(); local
1897 Node* phi = mms.memory(); local
1905 Node* phi = mms.memory(); local
[all...]
H A Dsplit_if.cpp169 // Get memory-phi anti-dep loads will be using
198 Node *phi = PhiNode::make_blank(blk1, n); local
213 phi->init_req( j, x );
215 // Announce phi to optimizer
216 register_new_node(phi, blk1);
218 // Remove cloned-up value from optimizer; use phi instead
219 _igvn.replace_node( n, phi );
331 // the "while( phi->outcnt() )" loop.
339 // Normal (non-phi) use
363 // far below the merge point can't always be split up (e.g., phi
498 Node* phi = region->out(k); local
[all...]
H A DidealKit.cpp223 // creating phi's to merge values. If bind is true and
233 // If this is last predecessor, then don't force phi creation
240 // reaching the label, or a phi that merges multiples values reaching
242 // a phi whose control input is the region node for the label.
247 // If the var went unused no need for a phi
251 // Only one unique value "m" is known to reach this label so a phi
258 // Record the phi/value used for this var in the label's cvstate
262 // a create a phi if one does not already exist.
267 // Record in the phi, the var's value from the current state
277 assert(!was_promoted_to_phi(n, reg), "n already promoted to phi o
448 PhiNode* phi; local
472 PhiNode* phi; local
[all...]
H A Dparse1.cpp1592 PhiNode* phi; local
1594 phi = m->as_Phi();
1596 phi = NULL;
1604 assert(phi == NULL, "the merge contains phis, not vice versa");
1608 if (phi == NULL) {
1619 phi = ensure_phi(j, nophi);
1626 // - there is no phi (because TypeFlow detected a conflict), or
1628 // It is a bug if we create a phi which sees a garbage value on a live path.
1630 if (phi != NULL) {
1632 assert(phi
1701 PhiNode* phi; local
1791 Node* phi = mms.memory(); local
1856 PhiNode* phi = PhiNode::make(region, o, t); local
1873 PhiNode* phi; local
1994 Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type); local
2008 Node* phi = _exits.argument(0); local
[all...]
H A Dreg_split.cpp475 PhiNode *phi; local
512 // them to a single Def at the phi. The pointer is updated for each
557 // Check for need to insert a new phi
559 // info for each spilled LRG. If they are identical, no phi is
560 // needed. If they differ, check for a phi, and insert if missing,
562 // be either the phi's or the reaching def, as appropriate.
611 // For each LRG, decide if a phi is necessary
615 // See if the phi has mismatched inputs, UP vs. DOWN
632 // bail if this is not a phi
633 phi
1269 Node *phi = phis->at(insidx); local
1334 Node *phi = phis->at(insidx); local
[all...]
H A Difnode.cpp82 PhiNode *phi = i1->as_Phi();
83 if( phi->is_copy() ) return NULL;
89 for( i4 = 1; i4 < phi->req(); i4++ ) {
90 con1 = phi->in(i4);
98 if( i4 >= phi->req() ) return NULL; // Found no constants
114 if( phi->region() != r ) return NULL;
137 if( u != phi ) {
145 Node* v = u->fast_out(k); // User of the phi
228 if (phi->in(ii) == con1) {
245 Node *phi_x = PhiNode::make_blank(region_x, phi);
[all...]
H A Dpostaloc.cpp420 Node *phi = b->_nodes[phi_dex]; local
421 if( !phi->is_Phi() )
432 // Remove copies along phi edges
501 Node *phi = b->_nodes[j]; local
502 uint pidx = n2lidx(phi);
503 OptoReg::Name preg = lrgs(n2lidx(phi)).reg();
505 // Remove copies remaining on edges. Check for junk phi.
507 for( k=1; k<phi->req(); k++ ) {
508 Node *x = phi->in(k);
509 if( phi !
[all...]
H A Dloopnode.cpp47 this->as_Phi()->region()->as_CountedLoop()->phi() == this) {
72 Node* phi = l->phi(); local
75 phi != NULL && phi->is_Phi() &&
76 phi->in(LoopNode::LoopBackControl) == l->incr() &&
368 PhiNode *phi = xphi->as_Phi();
371 if (phi->region() != x)
373 if (trunc1 == NULL && phi->in(LoopNode::LoopBackControl) != incr ||
374 trunc1 != NULL && phi
1081 Node* phi = n->as_Phi(); local
1289 Node *phi = PhiNode::make_blank(outer, old_phi); local
1409 Node *phi = new (phase->C) PhiNode(r, n->type(), n->adr_type()); local
1501 Node* phi = _head->fast_out(i); local
1723 Node *phi = cl->phi(); local
[all...]
H A DloopTransform.cpp679 Node* phi = cl->phi(); local
680 if (phi != NULL) {
681 assert(phi->is_Phi() && phi->in(0) == _head, "Counted loop should have iv phi.");
682 const TypeInt* iv_type = phase->_igvn.type(phi)->is_int();
760 Node *trip_counter = cl->phi();
1414 Node* phi = loop_head->fast_out(j); local
1415 if( phi
2159 Node *phi = cl->phi(); local
[all...]
H A Dloopnode.hpp180 Node *phi() const;
260 Node *phi() const { Node *tmp = incr (); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; } function in class:CountedLoopEndNode
261 Node *init_trip() const { Node *tmp = phi (); return (tmp && tmp->req()==3) ? tmp->in(1) : NULL; }
269 if (phi() == NULL) {
272 Node *ln = phi()->in(0);
299 inline Node *CountedLoopNode::phi() const { return loopexit() ? loopexit()->phi() : NULL; } function in class:CountedLoopNode
961 // Has use internal to the vector set (ie. not in a phi at the loop head)
968 // Insert phi(lp_entry_val, back_edge_val) at use->in(idx) for loop lp if phi doe
[all...]
H A DgraphKit.cpp382 Node* phi = mms.force_memory()->as_Phi()->slice_memory(adr_type); local
383 assert(phi->as_Phi()->region() == mms.base_memory()->in(0), "");
384 mms.set_memory(phi);
385 // Prepare to append interesting stuff onto the newly sliced phi:
386 while (phi->req() > orig_width) phi->del_req(phi->req()-1);
402 PhiNode* phi; local
404 dst = phi = PhiNode::make(region, dst, _gvn.type(dst));
405 record_for_igvn(phi);
2237 PhiNode* phi; local
2608 Node* phi = new(C) PhiNode(region, TypeInt::BOOL); local
2711 Node* phi = new (C) PhiNode(region, toop); local
[all...]
H A Daddnode.cpp90 PhiNode *phi; local
91 // Check for tight loop increments: Loop-phi of Add of loop-phi
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
[all...]
H A Dstringopts.cpp149 // phi->region->if_proj->ifnode->bool
1004 Node *phi = new (C) PhiNode(r, TypeInt::INT); local
1005 kit.gvn().set_type(phi, TypeInt::INT);
1014 phi->init_req(1, __ SubI(__ intcon(0), arg));
1017 phi->init_req(2, arg);
1021 C->record_for_igvn(phi);
1043 Node* limit = __ CmpI(phi, value);
1371 Node *phi = new (C) PhiNode(r, type); local
1372 kit.gvn().set_type(phi, phi
[all...]
H A Dlibrary_call.cpp1082 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); local
1091 phi->init_req(2, intcon(1));
1107 phi->init_req(3, intcon(0));
1143 phi->init_req(4, intcon(0));
1151 phi->init_req(1, equals);
1160 set_result(_gvn.transform(phi));
1531 Node* phi = new (C) PhiNode(r, Type::DOUBLE); local
1546 phi->init_req(2, n);
1570 phi->init_req(1, slow_result);
1575 n = _gvn.transform(phi);
1684 Node *phi = new (C) PhiNode(r, Type::DOUBLE); local
1744 Node *phi = new (C) PhiNode(r, TypeLong::LONG); local
1773 Node *phi = new (C) PhiNode(r, Type::DOUBLE); local
3174 PhiNode* phi = new (C) PhiNode(region, return_type); local
3316 Node* phi = new (C) PhiNode(region, TypeInt::BOOL); local
3996 Node *phi = new (C) PhiNode(r, TypeLong::LONG); local
4037 Node *phi = new (C) PhiNode(r, TypeInt::INT); local
[all...]
H A Descape.hpp561 Node* phi = _node_map[idx]; local
562 return (phi == NULL) ? NULL : phi->as_Phi();
/openjdk7/hotspot/src/share/vm/shark/
H A DsharkNativeWrapper.cpp125 PHINode *phi; local
152 phi = builder()->CreatePHI(box_type, "boxed_object");
153 phi->addIncoming(ConstantPointerNull::get(box_type), null);
154 phi->addIncoming(box, not_null);
155 box = phi;
308 PHINode *phi = builder()->CreatePHI(SharkType::oop_type(), "result"); local
309 phi->addIncoming(LLVMValue::null(), null);
310 phi->addIncoming(unboxed_result, not_null);
311 result = phi;
H A DsharkValue.cpp236 PHINode *phi = builder->CreatePHI(SharkType::to_stackType(type()), name); local
237 phi->addIncoming(this->generic_value(), this_block);
238 phi->addIncoming(other->generic_value(), other_block);
239 return SharkValue::create_generic(type(), phi, zero_checked());
H A DsharkState.cpp134 PHINode *phi = builder()->CreatePHI(SharkType::methodOop_type(), "method"); local
135 phi->addIncoming(this_method, this_block);
136 phi->addIncoming(other_method, other_block);
137 set_method(phi);
145 PHINode *phi = builder()->CreatePHI(SharkType::oop_type(), "oop_tmp"); local
146 phi->addIncoming(this_oop_tmp, this_block);
147 phi->addIncoming(other_oop_tmp, other_block);
148 set_oop_tmp(phi);
H A DsharkValue.hpp155 llvm::PHINode* phi,
244 SharkPHIValue(ciType* type, llvm::PHINode* phi, const SharkPHIValue *parent) argument
245 : SharkNormalValue(type, phi, parent && parent->zero_checked()),
334 llvm::PHINode* phi,
336 return new SharkPHIValue(type, phi, parent);
333 create_phi(ciType* type, llvm::PHINode* phi, const SharkPHIValue* parent) argument
H A DsharkIntrinsics.cpp174 PHINode *phi = builder()->CreatePHI(a->getType(), "result"); local
175 phi->addIncoming(a, return_a);
176 phi->addIncoming(b, return_b);
181 phi,
/openjdk7/jdk/src/share/classes/sun/security/rsa/
H A DRSAKeyPairGenerator.java38 * We generate two random primes until we find two where phi is relative
145 // phi = (p - 1) * (q - 1) must be relative prime to e
149 BigInteger phi = p1.multiply(q1);
152 if (e.gcd(phi).equals(BigInteger.ONE) == false) {
156 // private exponent d is the inverse of e mod phi
157 BigInteger d = e.modInverse(phi);
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_InstructionPrinter.cpp109 Phi* phi = v ? v->as_Phi() : NULL; local
110 if (phi && phi->is_illegal()) {
118 Phi* phi = v ? v->as_Phi() : NULL; local
119 return phi && phi->block() == b;
226 Phi* phi = value->as_Phi(); local
227 if (phi != NULL) {
228 if (phi->operand()->is_valid()) {
230 phi
288 Phi* phi = v->as_Phi(); local
[all...]
H A Dc1_ValueStack.cpp177 assert(stack_at(index)->as_Phi() == NULL || stack_at(index)->as_Phi()->block() != b, "phi function already created");
180 Value phi = new Phi(t, b, -index - 1); local
181 _stack[index] = phi;
187 assert(local_at(index)->as_Phi() == NULL || local_at(index)->as_Phi()->block() != b, "phi function already created");
190 Value phi = new Phi(t, b, index); local
191 store_local(index, phi);
/openjdk7/jdk/src/share/classes/sun/java2d/pisces/
H A DHelpers.java124 final double phi = 1.0/3 * acos(-q / sqrt(-cb_p));
127 pts[ off+0 ] = (float)( t * cos(phi));
128 pts[ off+1 ] = (float)(-t * cos(phi + PI / 3));
129 pts[ off+2 ] = (float)(-t * cos(phi - PI / 3));

Completed in 139 milliseconds

12