Sat, 07 Nov 2020 10:30:02 +0800
Added tag mips-jdk8u275-b01 for changeset fdbe50121f48
aoqi@0 | 1 | /* |
aoqi@0 | 2 | * Copyright (c) 1997, 2012, Oracle and/or its affiliates. All rights reserved. |
aoqi@0 | 3 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
aoqi@0 | 4 | * |
aoqi@0 | 5 | * This code is free software; you can redistribute it and/or modify it |
aoqi@0 | 6 | * under the terms of the GNU General Public License version 2 only, as |
aoqi@0 | 7 | * published by the Free Software Foundation. Oracle designates this |
aoqi@0 | 8 | * particular file as subject to the "Classpath" exception as provided |
aoqi@0 | 9 | * by Oracle in the LICENSE file that accompanied this code. |
aoqi@0 | 10 | * |
aoqi@0 | 11 | * This code is distributed in the hope that it will be useful, but WITHOUT |
aoqi@0 | 12 | * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or |
aoqi@0 | 13 | * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
aoqi@0 | 14 | * version 2 for more details (a copy is included in the LICENSE file that |
aoqi@0 | 15 | * accompanied this code). |
aoqi@0 | 16 | * |
aoqi@0 | 17 | * You should have received a copy of the GNU General Public License version |
aoqi@0 | 18 | * 2 along with this work; if not, write to the Free Software Foundation, |
aoqi@0 | 19 | * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
aoqi@0 | 20 | * |
aoqi@0 | 21 | * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
aoqi@0 | 22 | * or visit www.oracle.com if you need additional information or have any |
aoqi@0 | 23 | * questions. |
aoqi@0 | 24 | */ |
aoqi@0 | 25 | |
aoqi@0 | 26 | package com.sun.xml.internal.org.jvnet.staxex; |
aoqi@0 | 27 | |
aoqi@0 | 28 | /** |
aoqi@0 | 29 | * @author Kohsuke Kawaguchi |
aoqi@0 | 30 | */ |
aoqi@0 | 31 | class Base64Encoder { |
aoqi@0 | 32 | private static final char[] encodeMap = initEncodeMap(); |
aoqi@0 | 33 | |
aoqi@0 | 34 | private static char[] initEncodeMap() { |
aoqi@0 | 35 | char[] map = new char[64]; |
aoqi@0 | 36 | int i; |
aoqi@0 | 37 | for( i= 0; i<26; i++ ) map[i] = (char)('A'+i); |
aoqi@0 | 38 | for( i=26; i<52; i++ ) map[i] = (char)('a'+(i-26)); |
aoqi@0 | 39 | for( i=52; i<62; i++ ) map[i] = (char)('0'+(i-52)); |
aoqi@0 | 40 | map[62] = '+'; |
aoqi@0 | 41 | map[63] = '/'; |
aoqi@0 | 42 | |
aoqi@0 | 43 | return map; |
aoqi@0 | 44 | } |
aoqi@0 | 45 | |
aoqi@0 | 46 | public static char encode( int i ) { |
aoqi@0 | 47 | return encodeMap[i&0x3F]; |
aoqi@0 | 48 | } |
aoqi@0 | 49 | |
aoqi@0 | 50 | public static byte encodeByte( int i ) { |
aoqi@0 | 51 | return (byte)encodeMap[i&0x3F]; |
aoqi@0 | 52 | } |
aoqi@0 | 53 | |
aoqi@0 | 54 | public static String print(byte[] input, int offset, int len) { |
aoqi@0 | 55 | char[] buf = new char[((len+2)/3)*4]; |
aoqi@0 | 56 | int ptr = print(input,offset,len,buf,0); |
aoqi@0 | 57 | assert ptr==buf.length; |
aoqi@0 | 58 | return new String(buf); |
aoqi@0 | 59 | } |
aoqi@0 | 60 | |
aoqi@0 | 61 | /** |
aoqi@0 | 62 | * Encodes a byte array into a char array by doing base64 encoding. |
aoqi@0 | 63 | * |
aoqi@0 | 64 | * The caller must supply a big enough buffer. |
aoqi@0 | 65 | * |
aoqi@0 | 66 | * @return |
aoqi@0 | 67 | * the value of {@code ptr+((len+2)/3)*4}, which is the new offset |
aoqi@0 | 68 | * in the output buffer where the further bytes should be placed. |
aoqi@0 | 69 | */ |
aoqi@0 | 70 | public static int print(byte[] input, int offset, int len, char[] buf, int ptr) { |
aoqi@0 | 71 | for( int i=offset; i<len; i+=3 ) { |
aoqi@0 | 72 | switch( len-i ) { |
aoqi@0 | 73 | case 1: |
aoqi@0 | 74 | buf[ptr++] = encode(input[i]>>2); |
aoqi@0 | 75 | buf[ptr++] = encode(((input[i])&0x3)<<4); |
aoqi@0 | 76 | buf[ptr++] = '='; |
aoqi@0 | 77 | buf[ptr++] = '='; |
aoqi@0 | 78 | break; |
aoqi@0 | 79 | case 2: |
aoqi@0 | 80 | buf[ptr++] = encode(input[i]>>2); |
aoqi@0 | 81 | buf[ptr++] = encode( |
aoqi@0 | 82 | ((input[i]&0x3)<<4) | |
aoqi@0 | 83 | ((input[i+1]>>4)&0xF)); |
aoqi@0 | 84 | buf[ptr++] = encode((input[i+1]&0xF)<<2); |
aoqi@0 | 85 | buf[ptr++] = '='; |
aoqi@0 | 86 | break; |
aoqi@0 | 87 | default: |
aoqi@0 | 88 | buf[ptr++] = encode(input[i]>>2); |
aoqi@0 | 89 | buf[ptr++] = encode( |
aoqi@0 | 90 | ((input[i]&0x3)<<4) | |
aoqi@0 | 91 | ((input[i+1]>>4)&0xF)); |
aoqi@0 | 92 | buf[ptr++] = encode( |
aoqi@0 | 93 | ((input[i+1]&0xF)<<2)| |
aoqi@0 | 94 | ((input[i+2]>>6)&0x3)); |
aoqi@0 | 95 | buf[ptr++] = encode(input[i+2]&0x3F); |
aoqi@0 | 96 | break; |
aoqi@0 | 97 | } |
aoqi@0 | 98 | } |
aoqi@0 | 99 | return ptr; |
aoqi@0 | 100 | } |
aoqi@0 | 101 | } |