/*
 * Copyright (c) 2016 Oracle and/or its affiliates. All rights reserved. This
 * code is released under a tri EPL/GPL/LGPL license. You can use it,
 * redistribute it and/or modify it under the terms of the:
 *
 * Eclipse Public License version 1.0
 * GNU General Public License version 2
 * GNU Lesser General Public License version 2.1
 *
 * Some logic copied from jruby.util.Pack
 *
 *  * Version: EPL 1.0/GPL 2.0/LGPL 2.1
 *
 * The contents of this file are subject to the Eclipse Public
 * License Version 1.0 (the "License"); you may not use this file
 * except in compliance with the License. You may obtain a copy of
 * the License at http://www.eclipse.org/legal/epl-v10.html
 *
 * Software distributed under the License is distributed on an "AS
 * IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
 * implied. See the License for the specific language governing
 * rights and limitations under the License.
 *
 * Copyright (C) 2002-2004 Jan Arne Petersen <jpetersen@uni-bonn.de>
 * Copyright (C) 2002-2004 Anders Bengtsson <ndrsbngtssn@yahoo.se>
 * Copyright (C) 2003-2004 Thomas E Enebo <enebo@acm.org>
 * Copyright (C) 2004 Charles O Nutter <headius@headius.com>
 * Copyright (C) 2004 Stefan Matthias Aust <sma@3plus4.de>
 * Copyright (C) 2005 Derek Berner <derek.berner@state.nm.us>
 * Copyright (C) 2006 Evan Buswell <ebuswell@gmail.com>
 * Copyright (C) 2007 Nick Sieger <nicksieger@gmail.com>
 * Copyright (C) 2009 Joseph LaFata <joe@quibb.org>
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either of the GNU General Public License Version 2 or later (the "GPL"),
 * or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
 * in which case the provisions of the GPL or the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of either the GPL or the LGPL, and not to allow others to
 * use your version of this file under the terms of the EPL, indicate your
 * decision by deleting the provisions above and replace them with the notice
 * and other provisions required by the GPL or the LGPL. If you do not delete
 * the provisions above, a recipient may use your version of this file under
 * the terms of any one of the EPL, the GPL or the LGPL.
 */
package org.jruby.truffle.core.format.read.bytes;

import com.oracle.truffle.api.CompilerDirectives.TruffleBoundary;
import com.oracle.truffle.api.dsl.NodeChild;
import com.oracle.truffle.api.dsl.NodeChildren;
import com.oracle.truffle.api.dsl.Specialization;
import com.oracle.truffle.api.frame.VirtualFrame;
import org.jcodings.specific.ASCIIEncoding;
import org.jruby.truffle.RubyContext;
import org.jruby.truffle.core.Layouts;
import org.jruby.truffle.core.format.FormatNode;
import org.jruby.truffle.core.format.exceptions.InvalidFormatException;
import org.jruby.truffle.core.format.read.SourceNode;
import org.jruby.truffle.core.rope.AsciiOnlyLeafRope;
import org.jruby.util.Pack;

import java.nio.ByteBuffer;
import java.util.Arrays;

@NodeChildren({
        @NodeChild(value = "value", type = SourceNode.class),
})
public abstract class ReadBase64StringNode extends FormatNode {

    public ReadBase64StringNode(RubyContext context) {
        super(context);
    }

    @Specialization
    public Object read(VirtualFrame frame, byte[] source) {
        final int position = getSourcePosition(frame);
        final int length = getSourceLength(frame);

        final ByteBuffer encode = ByteBuffer.wrap(source, position, length - position);

        final byte[] result = read(encode);

        setSourcePosition(frame, encode.position());

        return Layouts.STRING.createString(getContext().getCoreLibrary().getStringFactory(),
                new AsciiOnlyLeafRope(result, ASCIIEncoding.INSTANCE));
    }

    @TruffleBoundary
    private byte[] read(ByteBuffer encode) {
        int occurrences = encode.remaining();

        int length = encode.remaining()*3/4;
        byte[] lElem = new byte[length];
        int a = -1, b = -1, c = 0, d;
        int index = 0;
        int s = -1;

        if (occurrences == 0){
            if (encode.remaining()%4 != 0) {
                throw new InvalidFormatException("invalid base64");
            }
            while (encode.hasRemaining()) {
                // obtain a
                s = Pack.safeGet(encode);
                a = Pack.b64_xtable[s];
                if (a == -1) throw new InvalidFormatException("invalid base64");

                // obtain b
                s = Pack.safeGet(encode);
                b = Pack.b64_xtable[s];
                if (b == -1) throw new InvalidFormatException("invalid base64");

                // obtain c
                s = Pack.safeGet(encode);
                c = Pack.b64_xtable[s];
                if (s == '=') {
                    if (Pack.safeGet(encode) != '=') throw new InvalidFormatException("invalid base64");
                    break;
                }
                if (c == -1) throw new InvalidFormatException("invalid base64");

                // obtain d
                s = Pack.safeGet(encode);
                d = Pack.b64_xtable[s];
                if (s == '=') break;
                if (d == -1) throw new InvalidFormatException("invalid base64");

                // calculate based on a, b, c and d
                lElem[index++] = (byte)((a << 2 | b >> 4) & 255);
                lElem[index++] = (byte)((b << 4 | c >> 2) & 255);
                lElem[index++] = (byte)((c << 6 | d) & 255);
            }

            if (encode.hasRemaining()) throw new InvalidFormatException("invalid base64");

            if (a != -1) {
                if (c == -1) {
                    if ((b & 15) != 0) throw new InvalidFormatException("invalid base64");
                    lElem[index++] = (byte)((a << 2 | b >> 4) & 255);
                } else if(s == '=') {
                    if ((c & 3) != 0) throw new InvalidFormatException("invalid base64");
                    lElem[index++] = (byte)((a << 2 | b >> 4) & 255);
                    lElem[index++] = (byte)((b << 4 | c >> 2) & 255);
                }
            }
        }
        else {

            while (encode.hasRemaining()) {
                b = c = -1;

                // obtain a
                s = Pack.safeGet(encode);
                while (((a = Pack.b64_xtable[s]) == -1) && encode.hasRemaining()) {
                    s = Pack.safeGet(encode);
                }
                if (a == -1) break;

                // obtain b
                s = Pack.safeGet(encode);
                while (((b = Pack.b64_xtable[s]) == -1) && encode.hasRemaining()) {
                    s = Pack.safeGet(encode);
                }
                if (b == -1) break;

                // obtain c
                s = Pack.safeGet(encode);
                while (((c = Pack.b64_xtable[s]) == -1) && encode.hasRemaining()) {
                    if (s == '=') break;
                    s = Pack.safeGet(encode);
                }
                if ((s == '=') || c == -1) {
                    if (s == '=') {
                        encode.position(encode.position() - 1);
                    }
                    break;
                }

                // obtain d
                s = Pack.safeGet(encode);
                while (((d = Pack.b64_xtable[s]) == -1) && encode.hasRemaining()) {
                    if (s == '=') break;
                    s = Pack.safeGet(encode);
                }
                if ((s == '=') || d == -1) {
                    if (s == '=') {
                        encode.position(encode.position() - 1);
                    }
                    break;
                }

                // calculate based on a, b, c and d
                lElem[index++] = (byte)((a << 2 | b >> 4) & 255);
                lElem[index++] = (byte)((b << 4 | c >> 2) & 255);
                lElem[index++] = (byte)((c << 6 | d) & 255);
            }

            if (a != -1 && b != -1) {
                if (c == -1 && s == '=') {
                    lElem[index++] = (byte)((a << 2 | b >> 4) & 255);
                } else if(c != -1 && s == '=') {
                    lElem[index++] = (byte)((a << 2 | b >> 4) & 255);
                    lElem[index++] = (byte)((b << 4 | c >> 2) & 255);
                }
            }
        }

        return Arrays.copyOfRange(lElem, 0, index);
    }

}
