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