Fixed month calculating issue of calendars(#7666)

src/mscorlib/corefx/System/Globalization/GregorianCalendar.cs

@@ -214,7 +214,7 @@ internal virtual int GetDatePart(long ticks, int part)
             int[] days = leapYear ? DaysToMonth366 : DaysToMonth365;
             // All months have less than 32 days, so n >> 5 is a good conservative
             // estimate for the month
-            int m = n >> 5 + 1;
+            int m = (n >> 5) + 1;
             // m = 1-based month number
             while (n >= days[m]) m++;
             // If month was requested, return it

src/mscorlib/corefx/System/Globalization/GregorianCalendarHelper.cs

@@ -248,7 +248,7 @@ internal virtual int GetDatePart(long ticks, int part)
             int[] days = leapYear ? DaysToMonth366 : DaysToMonth365;
             // All months have less than 32 days, so n >> 5 is a good conservative
             // estimate for the month
-            int m = n >> 5 + 1;
+            int m = (n >> 5) + 1;
             // m = 1-based month number
             while (n >= days[m]) m++;
             // If month was requested, return it

src/mscorlib/corefx/System/Globalization/JulianCalendar.cs

@@ -193,7 +193,7 @@ internal static int GetDatePart(long ticks, int part)
             int[] days = leapYear ? s_daysToMonth366 : s_daysToMonth365;
             // All months have less than 32 days, so n >> 5 is a good conservative
             // estimate for the month
-            int m = n >> 5 + 1;
+            int m = (n >> 5) + 1;
             // m = 1-based month number
             while (n >= days[m]) m++;
             // If month was requested, return it

src/mscorlib/src/System/DateTime.cs

@@ -775,7 +775,7 @@ private int GetDatePart(int part) {
             int[] days = leapYear? DaysToMonth366: DaysToMonth365;
             // All months have less than 32 days, so n >> 5 is a good conservative
             // estimate for the month
-            int m = n >> 5 + 1;
+            int m = (n >> 5) + 1;
             // m = 1-based month number
             while (n >= days[m]) m++;
             // If month was requested, return it

src/mscorlib/src/System/Globalization/GregorianCalendar.cs

@@ -217,7 +217,7 @@ internal virtual int GetDatePart(long ticks, int part)
             int[] days = leapYear? DaysToMonth366: DaysToMonth365;
             // All months have less than 32 days, so n >> 5 is a good conservative
             // estimate for the month
-            int m = n >> 5 + 1;
+            int m = (n >> 5) + 1;
             // m = 1-based month number
             while (n >= days[m]) m++;
             // If month was requested, return it

src/mscorlib/src/System/Globalization/GregorianCalendarHelper.cs

@@ -243,7 +243,7 @@ internal virtual int GetDatePart(long ticks, int part)
             int[] days = leapYear? DaysToMonth366: DaysToMonth365;
             // All months have less than 32 days, so n >> 5 is a good conservative
             // estimate for the month
-            int m = n >> 5 + 1;
+            int m = (n >> 5) + 1;
             // m = 1-based month number
             while (n >= days[m]) m++;
             // If month was requested, return it

src/mscorlib/src/System/Globalization/JulianCalendar.cs

@@ -204,7 +204,7 @@ static internal int GetDatePart(long ticks, int part)
             int[] days = leapYear? DaysToMonth366: DaysToMonth365;
             // All months have less than 32 days, so n >> 5 is a good conservative
             // estimate for the month
-            int m = n >> 5 + 1;
+            int m = (n >> 5) + 1;
             // m = 1-based month number
             while (n >= days[m]) m++;
             // If month was requested, return it