Searched refs:ctrl (Results 1 - 25 of 46) sorted by relevance

12

/openjdk9/hotspot/test/native/gc/g1/
H A Dtest_g1IHOPControl.cpp30 static void test_update(G1IHOPControl* ctrl, double alloc_time, argument
34 ctrl->update_allocation_info(alloc_time, alloc_amount, young_size);
35 ctrl->update_marking_length(mark_time);
48 G1StaticIHOPControl ctrl(initial_ihop);
49 ctrl.update_target_occupancy(100);
51 size_t threshold = ctrl.get_conc_mark_start_threshold();
54 ctrl.update_allocation_info(100.0, 100, 100);
55 threshold = ctrl.get_conc_mark_start_threshold();
58 ctrl.update_marking_length(1000.0);
59 threshold = ctrl
[all...]
/openjdk9/hotspot/src/share/vm/opto/
H A DmacroArrayCopy.cpp34 void PhaseMacroExpand::insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent) { argument
36 mb->init_req(TypeFunc::Control, *ctrl);
39 *ctrl = new ProjNode(mb,TypeFunc::Control);
40 transform_later(*ctrl);
65 Node* PhaseMacroExpand::make_leaf_call(Node* ctrl, Node* mem, argument
75 call->init_req(TypeFunc::Control, ctrl);
107 Node* PhaseMacroExpand::generate_guard(Node** ctrl, Node* test, RegionNode* region, float true_prob) { argument
108 if ((*ctrl)->is_top()) {
119 IfNode* iff = new IfNode(*ctrl, test, true_prob, COUNT_UNKNOWN);
132 *ctrl
137 generate_slow_guard(Node** ctrl, Node* test, RegionNode* region) argument
141 generate_negative_guard(Node** ctrl, Node* index, RegionNode* region) argument
153 generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region) argument
171 generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative) argument
186 finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type) argument
273 generate_arraycopy(ArrayCopyNode *ac, AllocateArrayNode* alloc, Node** ctrl, MergeMemNode* mem, Node** io, const TypePtr* adr_type, BasicType basic_elem_type, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool disjoint_bases, bool length_never_negative, RegionNode* slow_region) argument
756 generate_clear_array(Node* ctrl, MergeMemNode* merge_mem, const TypePtr* adr_type, Node* dest, BasicType basic_elem_type, Node* slice_idx, Node* slice_len, Node* dest_size) argument
861 generate_block_arraycopy(Node** ctrl, MergeMemNode** mem, Node* io, const TypePtr* adr_type, BasicType basic_elem_type, AllocateNode* alloc, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* dest_size, bool dest_uninitialized) argument
931 generate_slow_arraycopy(ArrayCopyNode *ac, Node** ctrl, Node* mem, Node** io, const TypePtr* adr_type, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
984 generate_checkcast_arraycopy(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type, Node* dest_elem_klass, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
1023 generate_generic_arraycopy(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
1049 generate_unchecked_arraycopy(Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type, BasicType basic_elem_type, bool disjoint_bases, Node* src, Node* src_offset, Node* dest, Node* dest_offset, Node* copy_length, bool dest_uninitialized) argument
1079 Node* ctrl = ac->in(TypeFunc::Control); local
[all...]
H A Dmacro.hpp105 void insert_mem_bar(Node** ctrl, Node** mem, int opcode, Node* precedent = NULL);
108 Node* make_leaf_call(Node* ctrl, Node* mem,
118 Node* generate_guard(Node** ctrl, Node* test, RegionNode* region, float true_prob);
119 Node* generate_slow_guard(Node** ctrl, Node* test, RegionNode* region);
120 void generate_negative_guard(Node** ctrl, Node* index, RegionNode* region);
121 void generate_limit_guard(Node** ctrl, Node* offset, Node* subseq_length, Node* array_length, RegionNode* region);
124 Node* generate_nonpositive_guard(Node** ctrl, Node* index, bool never_negative);
125 void finish_arraycopy_call(Node* call, Node** ctrl, MergeMemNode** mem, const TypePtr* adr_type);
134 Node** ctrl, MergeMemNode* mem, Node** io,
143 void generate_clear_array(Node* ctrl, MergeMemNod
[all...]
H A Dlocknode.hpp82 FastLockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) { argument
83 init_req(0,ctrl);
113 FastUnlockNode(Node *ctrl, Node *oop, Node *box) : CmpNode(oop,box) { argument
114 init_req(0,ctrl);
H A Drootnode.cpp65 HaltNode::HaltNode( Node *ctrl, Node *frameptr ) : Node(TypeFunc::Parms) { argument
67 init_req(TypeFunc::Control, ctrl );
H A Drootnode.hpp54 HaltNode( Node *ctrl, Node *frameptr );
H A DloopPredicate.cpp64 // ctrl ctrl
270 Node* ctrl = iff->in(0); local
279 loop_phase->register_new_node(opq, ctrl);
280 loop_phase->register_new_node(bol, ctrl);
486 void clone_nodes(Node* n, Node* ctrl) { argument
496 _phase->register_new_node(n_cl, ctrl);
559 Node* clone(Node* n, Node* ctrl) { argument
560 assert(ctrl->is_CFG(), "must be");
563 clone_nodes(n, ctrl);
631 rc_predicate(IdealLoopTree *loop, Node* ctrl, int scale, Node* offset, Node* init, Node* limit, jint stride, Node* range, bool upper, bool &overflow) argument
875 Node* ctrl = new_predicate_proj->in(0)->as_If()->in(0); local
924 Node *ctrl = predicate_proj->in(0)->as_If()->in(0); local
[all...]
H A Dvectornode.hpp128 ReductionNode(Node *ctrl, Node* in1, Node* in2) : Node(ctrl, in1, in2) {} argument
130 static ReductionNode* make(int opc, Node *ctrl, Node* in1, Node* in2, BasicType bt);
139 AddReductionVINode(Node * ctrl, Node* in1, Node* in2) : ReductionNode(ctrl, in1, in2) {} argument
149 AddReductionVLNode(Node *ctrl, Node* in1, Node* in2) : ReductionNode(ctrl, in1, in2) {} argument
159 AddReductionVFNode(Node *ctrl, Node* in1, Node* in2) : ReductionNode(ctrl, in1, in2) {} argument
169 AddReductionVDNode(Node *ctrl, Nod argument
275 MulReductionVINode(Node *ctrl, Node* in1, Node* in2) argument
285 MulReductionVLNode(Node *ctrl, Node* in1, Node* in2) argument
295 MulReductionVFNode(Node *ctrl, Node* in1, Node* in2) argument
305 MulReductionVDNode(Node *ctrl, Node* in1, Node* in2) argument
[all...]
H A Dcastnode.hpp140 CastP2XNode( Node *ctrl, Node *n ) : Node(ctrl, n) {} argument
H A Dstringopts.cpp191 void add_control(Node* ctrl) { argument
192 assert(!_control.contains(ctrl), "only push once");
193 _control.push(ctrl);
393 Node* ctrl = worklist.pop(); local
394 if (StringConcat::is_SB_toString(ctrl)) {
395 CallStaticJavaNode* csj = ctrl->as_CallStaticJava();
398 if (ctrl->in(0) != NULL && !_visited.test_set(ctrl->in(0)->_idx)) {
399 worklist.push(ctrl->in(0));
401 if (ctrl
796 Node* ctrl = curr->in(0); local
[all...]
H A Dcfgnode.hpp105 JProjNode( Node* ctrl, uint idx ) : ProjNode(ctrl,idx) {} argument
258 CProjNode( Node *ctrl, uint idx ) : ProjNode(ctrl,idx) {} argument
290 bool is_ctrl_folds(Node* ctrl, PhaseIterGVN* igvn);
470 PCTableNode( Node *ctrl, Node *idx, uint size ) : MultiBranchNode(2), _size(size) { argument
472 init_req(0, ctrl);
532 CatchNode( Node *ctrl, Node *idx, uint size ) : PCTableNode(ctrl,idx,size){ argument
595 NeverBranchNode( Node *ctrl )
[all...]
H A Dphase.hpp133 static Node* gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, MergeMemNode* mem, PhaseGVN* gvn);
H A Dcallnode.cpp1329 Node *ctrl, Node *mem, Node *abio,
1340 init_req( TypeFunc::Control , ctrl );
1582 static Node *next_control(Node *ctrl) { argument
1583 if (ctrl == NULL)
1586 if (ctrl->is_Region()) {
1587 RegionNode *r = ctrl->as_Region();
1592 ctrl = n;
1593 } else if (ctrl->is_Proj()) {
1594 Node *in0 = ctrl->in(0);
1596 ctrl
1328 AllocateNode(Compile* C, const TypeFunc *atype, Node *ctrl, Node *mem, Node *abio, Node *size, Node *klass_node, Node *initial_test) argument
1610 find_matching_unlock(const Node* ctrl, LockNode* lock, GrowableArray<AbstractLockNode*> &lock_ops) argument
1634 Node *ctrl = next_control(unlock->in(0)); local
1810 Node *ctrl = next_control(in(0)); local
[all...]
H A Dvectornode.cpp519 ReductionNode* ReductionNode::make(int opc, Node *ctrl, Node* n1, Node* n2, BasicType bt) { argument
527 case Op_AddReductionVI: return new AddReductionVINode(ctrl, n1, n2);
528 case Op_AddReductionVL: return new AddReductionVLNode(ctrl, n1, n2);
529 case Op_AddReductionVF: return new AddReductionVFNode(ctrl, n1, n2);
530 case Op_AddReductionVD: return new AddReductionVDNode(ctrl, n1, n2);
531 case Op_MulReductionVI: return new MulReductionVINode(ctrl, n1, n2);
532 case Op_MulReductionVL: return new MulReductionVLNode(ctrl, n1, n2);
533 case Op_MulReductionVF: return new MulReductionVFNode(ctrl, n1, n2);
534 case Op_MulReductionVD: return new MulReductionVDNode(ctrl, n1, n2);
H A Dloopnode.hpp658 Node *find_non_split_ctrl( Node *ctrl ) const {
659 if (ctrl != NULL) {
660 if (ctrl->is_MultiBranch()) {
661 ctrl = ctrl->in(0);
663 assert(ctrl->is_CFG(), "CFG");
665 return ctrl;
668 bool cast_incr_before_loop(Node* incr, Node* ctrl, Node* loop);
684 void set_ctrl( Node *n, Node *ctrl ) {
686 assert( ctrl
691 set_ctrl_and_loop(Node* n, Node* ctrl) argument
[all...]
H A Dmacro.cpp111 Node* PhaseMacroExpand::opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path) { argument
120 IfNode* iff = new IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN );
139 void PhaseMacroExpand::copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call) { argument
141 call->init_req( TypeFunc::Control, ctrl );
1334 Node* ctrl = alloc->in(TypeFunc::Control); local
1341 assert(ctrl != NULL, "must have control");
1371 Node *toobig_false = ctrl;
1381 IfNode *toobig_iff = new IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
1390 toobig_false = ctrl;
1417 Node *eden_end = make_load(ctrl, me
1588 Node* ctrl = new ProjNode(init,TypeFunc::Control); local
2248 Node* ctrl = alock->in(TypeFunc::Control); local
2305 Node* ctrl = lock->in(TypeFunc::Control); local
2543 Node* ctrl = unlock->in(TypeFunc::Control); local
[all...]
H A DgraphKit.hpp639 Node* ctrl = NULL);
858 Node* ctrl = control(); local
859 Node* n = Phase::gen_subtype_check(subklass, superklass, &ctrl, mem, &_gvn);
860 set_control(ctrl);
884 Node* load_String_length(Node* ctrl, Node* str);
885 Node* load_String_value(Node* ctrl, Node* str);
886 Node* load_String_coder(Node* ctrl, Node* str);
887 void store_String_value(Node* ctrl, Node* str, Node* value);
888 void store_String_coder(Node* ctrl, Node* str, Node* value);
895 IfNode* create_and_map_if(Node* ctrl, Nod argument
903 create_and_xform_if(Node* ctrl, Node* tst, float prob, float cnt) argument
[all...]
H A Difnode.cpp737 bool IfNode::is_ctrl_folds(Node* ctrl, PhaseIterGVN* igvn) { argument
738 return ctrl != NULL &&
739 ctrl->is_Proj() &&
740 ctrl->in(0) != NULL &&
741 ctrl->in(0)->Opcode() == Op_If &&
742 ctrl->in(0)->outcnt() == 2 &&
743 ctrl->in(0)->as_If()->cmpi_folds(igvn) &&
745 ctrl->in(0)->in(1)->in(1)->in(1) != NULL &&
746 ctrl->in(0)->in(1)->in(1)->in(1) == in(1)->in(1)->in(1);
1110 Node* ctrl local
1253 Node* ctrl = in(0); local
[all...]
H A Dmultnode.cpp105 Node* ctrl = in(0); local
106 if (ctrl == NULL) return NULL; // node is dead
107 const TypePtr* adr_type = ctrl->adr_type();
H A DgraphKit.cpp1662 const TypeInt* sizetype, Node* ctrl) {
1675 idx = Compile::conv_I2X_index(&_gvn, idx, sizetype, ctrl);
1940 Node* ctrl = control(); local
1941 Node* cnt = make_load(ctrl, counter_addr, TypeInt::INT, T_INT, adr_type, MemNode::unordered);
1943 store_to_memory(ctrl, counter_addr, incr, T_INT, adr_type, MemNode::unordered);
2524 static IfNode* gen_subtype_check_compare(Node* ctrl, Node* in1, Node* in2, BoolTest::mask test, float p, PhaseGVN* gvn, BasicType bt) { argument
2533 IfNode* iff = new IfNode(ctrl, bol, p, COUNT_UNKNOWN);
2548 Node* Phase::gen_subtype_check(Node* subklass, Node* superklass, Node** ctrl, MergeMemNode* mem, PhaseGVN* gvn) { argument
2551 if ((*ctrl)->is_top()) {
2577 Node* always_fail = *ctrl;
1661 array_element_address(Node* ary, Node* idx, BasicType elembt, const TypeInt* sizetype, Node* ctrl) argument
4313 load_String_length(Node* ctrl, Node* str) argument
4320 load_String_value(Node* ctrl, Node* str) argument
4338 load_String_coder(Node* ctrl, Node* str) argument
4351 store_String_value(Node* ctrl, Node* str, Node* value) argument
4360 store_String_coder(Node* ctrl, Node* str, Node* value) argument
[all...]
H A DidealKit.hpp153 Node* ctrl() { return _cvstate->in(TypeFunc::Control); } function in class:IdealKit
154 void set_ctrl(Node* ctrl) { _cvstate->set_req(TypeFunc::Control, ctrl); } argument
/openjdk9/jdk/src/java.desktop/share/native/libjsound/
H A DPortMixer.c173 jobject ctrl = NULL; local
205 CHECK_NULL_RETURN(typeString, (void*) ctrl);
206 ctrl = (*creator->env)->NewObject(creator->env, creator->boolCtrlClass,
209 if (!ctrl) {
210 ERROR0("PORT_NewBooleanControl: ctrl is NULL\n");
216 return (void*) ctrl;
221 jobject ctrl = NULL; local
260 CHECK_NULL_RETURN(typeString, (void*) ctrl);
261 ctrl = (*creator->env)->NewObject(creator->env, creator->compCtrlClass,
264 if (!ctrl) {
277 jobject ctrl = NULL; local
[all...]
/openjdk9/jdk/src/java.desktop/share/classes/com/sun/media/sound/
H A DDLSInstrument.java243 ModelSource ctrl = null;
257 ctrl = s;
292 if (ctrl != null) {
293 ((ModelStandardTransform)ctrl.getTransform())
296 ((ModelStandardTransform)ctrl.getTransform())
329 if (ctrl != null) {
337 ((ModelStandardTransform)ctrl.getTransform())
339 ((ModelStandardTransform)ctrl.getTransform())
341 ((ModelStandardTransform)ctrl.getTransform())
354 if (ctrl !
[all...]
/openjdk9/jdk/src/jdk.internal.le/share/classes/jdk/internal/jline/console/
H A DConsoleKeys.java237 if (keyName.contains("control-") || keyName.contains("c-") || keyName.contains("ctrl-")) {
266 boolean ctrl = str.regionMatches(i, "\\C-", 0, 3)|| str.regionMatches(i, "\\M-\\C-", 0, 6);
268 i += (meta ? 3 : 0) + (ctrl ? 3 : 0) + (!meta && !ctrl ? 1 : 0);
276 if (ctrl) {
279 if (!meta && !ctrl) {
H A DKeyMap.java253 Object[] ctrl = new Object[] {
288 System.arraycopy( ctrl, 0, map, 0, ctrl.length );
372 Object[] ctrl = new Object[] {
407 System.arraycopy( ctrl, 0, map, 0, ctrl.length );

Completed in 235 milliseconds

12