/openjdk9/hotspot/src/share/vm/opto/ |
H A D | node.cpp | 1138 Node* Node::find_exact_control(Node* ctrl) { argument 1139 if (ctrl == NULL && this->is_Region()) 1140 ctrl = this->as_Region()->is_copy(); 1142 if (ctrl != NULL && ctrl->is_CatchProj()) { 1143 if (ctrl->as_CatchProj()->_con == CatchProjNode::fall_through_index) 1144 ctrl = ctrl->in(0); 1145 if (ctrl != NULL && !ctrl 1951 collect_nodes(GrowableArray<Node*> *ns, int d, bool ctrl, bool data) const argument [all...] |
H A D | loopTransform.cpp | 293 Node *ctrl = phase->get_ctrl(test->in(1)); local 294 if (ctrl->is_top()) 299 if( !is_member(phase->get_loop(ctrl)) && 972 bool PhaseIdealLoop::cast_incr_before_loop(Node* incr, Node* ctrl, Node* loop) { argument 974 castii->set_req(0, ctrl); 975 register_new_node(castii, ctrl); 1431 Node *ctrl = loop_head->in(LoopNode::EntryControl); local 1446 opaq = ctrl->in(0)->in(1)->in(1)->in(2); 1558 register_new_node( adj_limit, ctrl ); // adjust amount 1560 register_new_node( adj_cmp, ctrl ); 2047 Node *ctrl = cl->in(LoopNode::EntryControl); local 2431 Node* ctrl = rce_cl->in(LoopNode::EntryControl); local 2519 Node *ctrl = cl->in(LoopNode::EntryControl); local [all...] |
H A D | idealKit.cpp | 89 IfNode* iff = delay_transform(new IfNode(ctrl(), bol, prob, cnt))->as_If(); 182 assert(ctrl()->is_IfTrue(), "true branch stays in loop"); 235 reg->init_req(slot, ctrl()); 507 call->init_req( TypeFunc::Control, ctrl() ); 553 call->init_req( TypeFunc::Control, ctrl() );
|
H A D | parseHelper.cpp | 201 Node* ctrl= control(); local 208 set_control(ctrl); // Then Don't Do It, just fall into the normal checking 377 Node* ctrl = control(); local 382 Node* cnt = make_load(ctrl, adr_iic_node, TypeInt::INT, T_INT, adr_type, MemNode::unordered); 388 store_to_memory(ctrl, adr_iic_node, incr, T_INT, adr_type, MemNode::unordered);
|
H A D | machnode.cpp | 586 Node* ctrl = in(0); local 587 if (ctrl == NULL) return NULL; // node is dead 588 const TypePtr* adr_type = ctrl->adr_type();
|
H A D | callnode.hpp | 865 AllocateNode(Compile* C, const TypeFunc *atype, Node *ctrl, Node *mem, Node *abio, 943 AllocateArrayNode(Compile* C, const TypeFunc *atype, Node *ctrl, Node *mem, Node *abio, argument 947 : AllocateNode(C, atype, ctrl, mem, abio, size, klass_node, 992 bool find_matching_unlock(const Node* ctrl, LockNode* lock,
|
H A D | doCall.cpp | 758 Node* ctrl = _gvn.transform( new CatchProjNode(catch_, i+1,handler_bci)); local 760 if (ctrl == top()) continue; 761 set_control(ctrl); 765 Node *ex_oop = _gvn.transform(new CreateExNode(extypes->at(i), ctrl, i_o));
|
H A D | memnode.hpp | 257 bool is_instance_field_load_with_local_phi(Node* ctrl); 791 Node* ctrl = in(0); local 792 if (ctrl == NULL) return NULL; // node is dead 793 return ctrl->in(MemNode::Memory)->adr_type(); 1093 ClearArrayNode( Node *ctrl, Node *arymem, Node *word_cnt, Node *base, bool is_large) argument 1094 : Node(ctrl,arymem,word_cnt,base), _is_large(is_large) {
|
H A D | lcm.cpp | 245 Node* ctrl = mach->in(0); local 246 if (ctrl != NULL && !(ctrl == not_null_block->head() || 247 get_block_for_node(ctrl)->dominates(not_null_block))) { 288 // Check ctrl input to see if the null-check dominates the memory op
|
H A D | loopnode.cpp | 550 // Update ctrl. 1020 assert(n_ctrl == NULL || n_ctrl == region, "ctrl parameter must be region"); 2458 if( has_ctrl(n) ) { // We have control; verify has loop or ctrl 2574 Node *ctrl = cl->in(LoopNode::EntryControl); local 2575 assert( ctrl->Opcode() == Op_IfTrue || ctrl->Opcode() == Op_IfFalse, "" ); 2576 Node *iff = ctrl->in(0); 3235 Node* ctrl = cl->in(LoopNode::EntryControl); local 3236 if (ctrl == NULL || (!ctrl [all...] |
H A D | machnode.hpp | 671 MachNullCheckNode( Node *ctrl, Node *memop, uint vidx ) : MachBranchNode(), _vidx(vidx) { argument 673 add_req(ctrl);
|
H A D | superword.hpp | 353 Node* ctrl(Node* n) const { return _phase->has_ctrl(n) ? _phase->get_ctrl(n) : n; } function in class:SuperWord 356 bool in_bb(Node* n) { return n != NULL && n->outcnt() > 0 && ctrl(n) == _bb; }
|
H A D | matcher.cpp | 2452 // Get the Ideal Proj node, ctrl, that can be used to iterate forward 2453 Node* ctrl = NULL; 2459 ctrl = p; 2463 assert((ctrl != NULL), "missing control projection"); 2465 for (DUIterator_Fast jmax, j = ctrl->fast_outs(jmax); j < jmax; j++) { 2466 Node *x = ctrl->fast_out(j);
|
H A D | memnode.cpp | 563 Node* ctrl = in(MemNode::Control); local 1081 bool LoadNode::is_instance_field_load_with_local_phi(Node* ctrl) { argument 1082 if( in(Memory)->is_Phi() && in(Memory)->in(0) == ctrl && 1509 Node* ctrl = in(MemNode::Control); 1515 if( ctrl != NULL && ctrl->Opcode() == Op_SafePoint && 1517 ctrl = ctrl->in(0); 1518 set_req(MemNode::Control,ctrl);
|
H A D | node.hpp | 955 Node* find_exact_control(Node* ctrl); 1115 void collect_nodes(GrowableArray<Node*> *ns, int d, bool ctrl, bool data) const; 1119 void collect_nodes_in_all_data(GrowableArray<Node*> *ns, bool ctrl) const;
|
H A D | compile.hpp | 1326 Node* ctrl = NULL); 1328 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check) 1329 static Node* constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl);
|
H A D | compile.cpp | 4091 Node* Compile::conv_I2X_index(PhaseGVN* phase, Node* idx, const TypeInt* sizetype, Node* ctrl) { argument 4106 idx = constrained_convI2L(phase, idx, iidxtype, ctrl); 4111 // Convert integer value to a narrowed long type dependent on ctrl (for example, a range check) 4112 Node* Compile::constrained_convI2L(PhaseGVN* phase, Node* value, const TypeInt* itype, Node* ctrl) { argument 4113 if (ctrl != NULL) { 4120 value->set_req(0, ctrl);
|
H A D | library_call.cpp | 2211 __ ctrl(), 3000 post_barrier(ideal.ctrl(), load_store, base, adr, alias_idx, newval, T_OBJECT, true); 6411 Node* ctrl = control(); local 6413 return ctrl; 6471 Node* ctrl = control(); local 6473 return ctrl; 6755 Node* ctrl = control(); local 6757 return ctrl;
|
H A D | loopopts.cpp | 2131 // still dominate the same set of control nodes, that the ctrl() relation 2745 Node *ctrl = get_ctrl(iff->in(1)); local 2746 if (ctrl->is_top()) return false; // Dead test on live IF. 2748 if( loop->is_member(get_loop(ctrl)) &&
|
/openjdk9/jdk/src/java.desktop/macosx/native/libjsound/ |
H A D | PLATFORM_API_MacOSX_Ports.cpp | 155 for (PortControl *ctrl = mixer->portControls; ctrl != NULL; ctrl = ctrl->next) { 156 for (int i = 0; i < ctrl->controlCount; i++) { 159 if (ctrl->audioControls[i]->controlID == controlIDs[j]) {
|
/openjdk9/jdk/src/java.desktop/share/classes/java/awt/geom/ |
H A D | QuadCurve2D.java | 1060 double c1, double ctrl, double c2) { 1070 vals[j++] = c1*u*u + 2*ctrl*t*u + c2*t*t; 1056 evalQuadratic(double vals[], int num, boolean include0, boolean include1, double inflect[], double c1, double ctrl, double c2) argument
|