Searched refs:PROB_MIN (Results 1 - 10 of 10) sorted by relevance

/openjdk7/hotspot/src/share/vm/opto/
H A Dgcm.cpp1434 uct->_freq = PROB_MIN;
1437 if (pb->_num_succs == 1 && pb->_freq > PROB_MIN) {
1681 if (exits_sum < PROB_MIN) exits_sum = PROB_MIN;
1893 if (p > PROB_MIN) {
1894 p = PROB_MIN;
H A DgenerateOptoStub.cpp252 IfNode *iff = create_and_map_if(control(), bo, PROB_MIN, COUNT_UNKNOWN);
H A Dparse2.cpp812 prob = (0+PROB_MIN) / 2;
818 if (prob < PROB_MIN) prob = PROB_MIN;
827 if (prob <= PROB_MIN) prob_str = (prob == PROB_MIN) ? "min" : "never";
888 return prob < PROB_MIN;
H A Dcfgnode.hpp277 // Although PROB_NEVER == PROB_MIN and PROB_ALWAYS == PROB_MAX
280 // The name PROB_MAX (PROB_MIN) is for probabilities which correspond to
292 #define PROB_MIN PROB_UNLIKELY_MAG(6) macro
H A Dstringopts.cpp1045 IfNode* iff2 = kit.create_and_map_if(kit.control(), limitb, PROB_MIN, COUNT_UNKNOWN);
1350 IfNode* iff = kit.create_and_map_if(kit.control(), p, PROB_MIN, COUNT_UNKNOWN);
1374 IfNode* iff = kit.create_and_map_if(kit.control(), p, PROB_MIN, COUNT_UNKNOWN);
1408 PROB_MIN, COUNT_UNKNOWN);
H A DcallGenerator.cpp575 if (hit_prob < PROB_MIN) hit_prob = PROB_MIN;
H A Dmacro.cpp112 IfNode* iff = new (C) IfNode( ctrl, bol, PROB_MIN, COUNT_UNKNOWN );
1138 IfNode *toobig_iff = new (C) IfNode(ctrl, initial_slow_test, PROB_MIN, COUNT_UNKNOWN);
1266 IfNode *contention_iff = new (C) IfNode (needgc_false, contention_check, PROB_MIN, COUNT_UNKNOWN);
H A Dlibrary_call.cpp902 Node* is_neg = generate_guard(bol_lt, region, PROB_MIN);
921 Node* is_notp = generate_guard(bol_le, NULL, PROB_MIN);
959 Node* is_over = generate_guard(bol_lt, region, PROB_MIN);
1103 Node* inst_false = generate_guard(bol, NULL, PROB_MIN);
5602 Node* instof_false = generate_guard(bool_instof, NULL, PROB_MIN);
5617 Node* src_dest_conjoint = generate_guard(bool_src_dest, NULL, PROB_MIN);
H A DloopTransform.cpp147 if (exit_prob > PROB_MIN) {
H A DgraphKit.cpp1958 iff->_prob = PROB_MIN;

Completed in 87 milliseconds