--- old/src/share/vm/opto/loopTransform.cpp 2017-06-26 18:37:23.000000000 -0700 +++ new/src/share/vm/opto/loopTransform.cpp 2017-06-26 18:37:22.000000000 -0700 @@ -1,5 +1,5 @@ /* - * Copyright (c) 2000, 2016, Oracle and/or its affiliates. All rights reserved. + * Copyright (c) 2000, 2017, Oracle and/or its affiliates. All rights reserved. * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. * * This code is free software; you can redistribute it and/or modify it @@ -208,7 +208,7 @@ // inv1 - (x + inv2) => ( inv1 - inv2) - x // Node* IdealLoopTree::reassociate_add_sub(Node* n1, PhaseIdealLoop *phase) { - if (!n1->is_Add() && !n1->is_Sub() || n1->outcnt() == 0) return NULL; + if ((!n1->is_Add() && !n1->is_Sub()) || n1->outcnt() == 0) return NULL; if (is_invariant(n1)) return NULL; int inv1_idx = is_invariant_addition(n1, phase); if (!inv1_idx) return NULL; @@ -729,8 +729,8 @@ // After unroll limit will be adjusted: new_limit = limit-stride. // Bailout if adjustment overflow. const TypeInt* limit_type = phase->_igvn.type(limit_n)->is_int(); - if (stride_con > 0 && ((limit_type->_hi - stride_con) >= limit_type->_hi) || - stride_con < 0 && ((limit_type->_lo - stride_con) <= limit_type->_lo)) + if ((stride_con > 0 && ((limit_type->_hi - stride_con) >= limit_type->_hi)) || + (stride_con < 0 && ((limit_type->_lo - stride_con) <= limit_type->_lo))) return false; // overflow // Adjust body_size to determine if we unroll or not @@ -1516,8 +1516,8 @@ limit = new Opaque2Node( C, limit ); register_new_node( limit, opaq_ctrl ); } - if (stride_con > 0 && (java_subtract(limit_type->_lo, stride_con) < limit_type->_lo) || - stride_con < 0 && (java_subtract(limit_type->_hi, stride_con) > limit_type->_hi)) { + if ((stride_con > 0 && (java_subtract(limit_type->_lo, stride_con) < limit_type->_lo)) || + (stride_con < 0 && (java_subtract(limit_type->_hi, stride_con) > limit_type->_hi))) { // No underflow. new_limit = new SubINode(limit, stride); } else {