3044 if (iff->outcnt() == 2) { // Ignore dead tests
3045 Node *bol = iff->in(1);
3046 if (bol && bol->req() > 1 && bol->in(1) &&
3047 ((bol->in(1)->Opcode() == Op_CompareAndExchangeB) ||
3048 (bol->in(1)->Opcode() == Op_CompareAndExchangeS) ||
3049 (bol->in(1)->Opcode() == Op_CompareAndExchangeI) ||
3050 (bol->in(1)->Opcode() == Op_CompareAndExchangeL) ||
3051 (bol->in(1)->Opcode() == Op_CompareAndExchangeP) ||
3052 (bol->in(1)->Opcode() == Op_CompareAndExchangeN) ||
3053 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapB) ||
3054 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapS) ||
3055 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapI) ||
3056 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapL) ||
3057 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapP) ||
3058 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapN) ||
3059 (bol->in(1)->Opcode() == Op_CompareAndSwapB) ||
3060 (bol->in(1)->Opcode() == Op_CompareAndSwapS) ||
3061 (bol->in(1)->Opcode() == Op_CompareAndSwapI) ||
3062 (bol->in(1)->Opcode() == Op_CompareAndSwapL) ||
3063 (bol->in(1)->Opcode() == Op_CompareAndSwapP) ||
3064 (bol->in(1)->Opcode() == Op_CompareAndSwapN) ||
3065 (bol->in(1)->Opcode() == Op_ShenandoahCompareAndExchangeP) ||
3066 (bol->in(1)->Opcode() == Op_ShenandoahCompareAndExchangeN) ||
3067 (bol->in(1)->Opcode() == Op_ShenandoahWeakCompareAndSwapP) ||
3068 (bol->in(1)->Opcode() == Op_ShenandoahWeakCompareAndSwapN) ||
3069 (bol->in(1)->Opcode() == Op_ShenandoahCompareAndSwapP) ||
3070 (bol->in(1)->Opcode() == Op_ShenandoahCompareAndSwapN)))
3071 return; // Allocation loops RARELY take backedge
3072 // Find the OTHER exit path from the IF
3073 Node* ex = iff->proj_out(1-test_con);
3074 float p = iff->_prob;
3075 if (!phase->is_member(this, ex) && iff->_fcnt == COUNT_UNKNOWN) {
3076 if (top == Op_IfTrue) {
3077 if (p < (PROB_FAIR + PROB_UNLIKELY_MAG(3))) {
3078 iff->_prob = PROB_STATIC_FREQUENT;
3079 }
3080 } else {
3081 if (p > (PROB_FAIR - PROB_UNLIKELY_MAG(3))) {
3082 iff->_prob = PROB_STATIC_INFREQUENT;
3083 }
3084 }
3085 }
3086 }
3087 }
3088 test = phase->idom(test);
3089 }
3090 }
|
3044 if (iff->outcnt() == 2) { // Ignore dead tests
3045 Node *bol = iff->in(1);
3046 if (bol && bol->req() > 1 && bol->in(1) &&
3047 ((bol->in(1)->Opcode() == Op_CompareAndExchangeB) ||
3048 (bol->in(1)->Opcode() == Op_CompareAndExchangeS) ||
3049 (bol->in(1)->Opcode() == Op_CompareAndExchangeI) ||
3050 (bol->in(1)->Opcode() == Op_CompareAndExchangeL) ||
3051 (bol->in(1)->Opcode() == Op_CompareAndExchangeP) ||
3052 (bol->in(1)->Opcode() == Op_CompareAndExchangeN) ||
3053 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapB) ||
3054 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapS) ||
3055 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapI) ||
3056 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapL) ||
3057 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapP) ||
3058 (bol->in(1)->Opcode() == Op_WeakCompareAndSwapN) ||
3059 (bol->in(1)->Opcode() == Op_CompareAndSwapB) ||
3060 (bol->in(1)->Opcode() == Op_CompareAndSwapS) ||
3061 (bol->in(1)->Opcode() == Op_CompareAndSwapI) ||
3062 (bol->in(1)->Opcode() == Op_CompareAndSwapL) ||
3063 (bol->in(1)->Opcode() == Op_CompareAndSwapP) ||
3064 (bol->in(1)->Opcode() == Op_CompareAndSwapN)))
3065 return; // Allocation loops RARELY take backedge
3066 // Find the OTHER exit path from the IF
3067 Node* ex = iff->proj_out(1-test_con);
3068 float p = iff->_prob;
3069 if (!phase->is_member(this, ex) && iff->_fcnt == COUNT_UNKNOWN) {
3070 if (top == Op_IfTrue) {
3071 if (p < (PROB_FAIR + PROB_UNLIKELY_MAG(3))) {
3072 iff->_prob = PROB_STATIC_FREQUENT;
3073 }
3074 } else {
3075 if (p > (PROB_FAIR - PROB_UNLIKELY_MAG(3))) {
3076 iff->_prob = PROB_STATIC_INFREQUENT;
3077 }
3078 }
3079 }
3080 }
3081 }
3082 test = phase->idom(test);
3083 }
3084 }
|