8286378: Address possibly lossy conversions in java.base

Reviewed-by: naoto, xuelei, bpb, alanb

Author: Roger Riggs

src/java.base/linux/classes/sun/nio/ch/EPollSelectorImpl.java

@@ -125,7 +125,7 @@ protected int doSelect(Consumer<SelectionKey> action, long timeout)
                 if (numEntries == IOStatus.INTERRUPTED && timedPoll) {
                     // timed poll interrupted so need to adjust timeout
                     long adjust = System.nanoTime() - startTime;
-                    to -= TimeUnit.MILLISECONDS.convert(adjust, TimeUnit.NANOSECONDS);
+                    to =- (int) TimeUnit.NANOSECONDS.toMillis(adjust);
                     if (to <= 0) {
                         // timeout expired so no retry
                         numEntries = 0;

src/java.base/share/classes/com/sun/crypto/provider/AESCrypt.java

@@ -217,7 +217,7 @@ private static final int[] expandToSubKey(int[][] kr, boolean decrypting) {
             for (t = 0; t < 8; t++) {
                 cox[i][t] = B[t];
                 for (j = 0; j < 8; j++) {
-                    cox[i][t] ^= A[t][j] * box[i][j];
+                    cox[i][t] ^= (byte)(A[t][j] * box[i][j]);
                 }
             }
         }
@@ -227,7 +227,7 @@ private static final int[] expandToSubKey(int[][] kr, boolean decrypting) {
         for (i = 0; i < 256; i++) {
             S[i] = (byte)(cox[i][0] << 7);
             for (t = 1; t < 8; t++) {
-                    S[i] ^= cox[i][t] << (7-t);
+                    S[i] ^= (byte)(cox[i][t] << (7-t));
             }
             Si[S[i] & 0xFF] = (byte) i;
         }
@@ -276,7 +276,7 @@ private static final int[] expandToSubKey(int[][] kr, boolean decrypting) {
             for (t = 0; t < 4; t++) {
                 if (i != t) {
                     for (j = i+1; j < 8; j++) {
-                        AA[t][j] ^= mul(AA[i][j], AA[t][i]);
+                        AA[t][j] ^= (byte)(mul(AA[i][j], AA[t][i]));
                     }
                     AA[t][i] = 0;
                 }

src/java.base/share/classes/com/sun/crypto/provider/Poly1305.java

@@ -246,9 +246,9 @@ private void setRSVals() {
         keyBytes[7] &= 15;
         keyBytes[11] &= 15;
         keyBytes[15] &= 15;
-        keyBytes[4] &= 252;
-        keyBytes[8] &= 252;
-        keyBytes[12] &= 252;
+        keyBytes[4] &= (byte)252;
+        keyBytes[8] &= (byte)252;
+        keyBytes[12] &= (byte)252;
 
         // Create IntegerModuloP elements from the r and s values
         r = ipl1305.getElement(keyBytes, 0, RS_LENGTH, (byte)0);

src/java.base/share/classes/java/io/BufferedInputStream.java

@@ -436,7 +436,7 @@ private long implSkip(long n) throws IOException {
         }
 
         long skipped = (avail < n) ? avail : n;
-        pos += skipped;
+        pos += (int)skipped;
         return skipped;
     }
 

src/java.base/share/classes/java/io/BufferedReader.java

@@ -475,7 +475,7 @@ private long implSkip(long n) throws IOException {
             }
             long d = nChars - nextChar;
             if (r <= d) {
-                nextChar += r;
+                nextChar += (int)r;
                 r = 0;
                 break;
             }

src/java.base/share/classes/java/io/ByteArrayInputStream.java

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1994, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1994, 2022, 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
@@ -228,7 +228,7 @@ public synchronized long skip(long n) {
             k = n < 0 ? 0 : n;
         }
 
-        pos += k;
+        pos += (int) k;
         return k;
     }
 

src/java.base/share/classes/java/io/CharArrayReader.java

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2022, 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
@@ -196,7 +196,7 @@ public long skip(long n) throws IOException {
             if (n < 0) {
                 return 0;
             }
-            pos += n;
+            pos += (int) n;
             return n;
         }
     }

src/java.base/share/classes/java/io/PushbackInputStream.java

@@ -323,7 +323,7 @@ public long skip(long n) throws IOException {
             if (n < pskip) {
                 pskip = n;
             }
-            pos += pskip;
+            pos += (int) pskip;
             n -= pskip;
         }
         if (n > 0) {

src/java.base/share/classes/java/io/PushbackReader.java

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1996, 2021, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1996, 2022, 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
@@ -251,7 +251,7 @@ public long skip(long n) throws IOException {
             int avail = buf.length - pos;
             if (avail > 0) {
                 if (n <= avail) {
-                    pos += n;
+                    pos += (int)n;
                     return n;
                 } else {
                     pos = buf.length;

src/java.base/share/classes/java/io/StringBufferInputStream.java

@@ -1,5 +1,5 @@
 /*
- * Copyright (c) 1995, 2020, Oracle and/or its affiliates. All rights reserved.
+ * Copyright (c) 1995, 2022, 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
@@ -145,7 +145,7 @@ public synchronized long skip(long n) {
         if (n > count - pos) {
             n = count - pos;
         }
-        pos += n;
+        pos += (int) n;
         return n;
     }