Simplify case statement and avoid drop thru

git-svn-id: https://svn.apache.org/repos/asf/commons/proper/codec/trunk@674288 13f79535-47bb-0310-9956-ffa450edef68

Author: sebbASF

src/java/org/apache/commons/codec/binary/Base64.java

@@ -423,21 +423,20 @@ void decode(byte[] in, int inPos, int inAvail) {
             }
             byte b = in[inPos++];
             if (b == PAD) {
-                modulus = (++modulus) % 4;
                 x = x << 6;
                 switch (modulus) {
-                    case 3:
+                    case 2:
                         x = x << 6;
-                    case 0:
                         buf[pos++] = (byte) ((x >> 16) & MASK_8BITS);
-                        if (modulus == 0) {
-                            buf[pos++] = (byte) ((x >> 8) & MASK_8BITS);
-                        }
-                    default:
-                        // WE'RE DONE!!!!
-                        eof = true;
-                        return;
+                        break;
+                    case 3:
+                        buf[pos++] = (byte) ((x >> 16) & MASK_8BITS);
+                        buf[pos++] = (byte) ((x >> 8) & MASK_8BITS);
+                        break;
                 }
+                // WE'RE DONE!!!!
+                eof = true;
+                return;
             } else {
                 if (b >= 0 && b < base64ToInt.length) {
                     int result = base64ToInt[b];