/*

 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.

 *

 * This code is free software; you can redistribute it and/or modify it

 * under the terms of the GNU General Public License version 2 only, as

 * published by the Free Software Foundation.  Oracle designates this

 * particular file as subject to the "Classpath" exception as provided

 * by Oracle in the LICENSE file that accompanied this code.

 *

 * This code is distributed in the hope that it will be useful, but WITHOUT

 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or

 * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License

 * version 2 for more details (a copy is included in the LICENSE file that

 * accompanied this code).

 *

 * You should have received a copy of the GNU General Public License version

 * 2 along with this work; if not, write to the Free Software Foundation,

 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.

 *

 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA

 * or visit www.oracle.com if you need additional information or have any

 * questions.

 */

package com.oracle.security.ucrypto;

import java.lang.ref.*;

import java.io.ByteArrayOutputStream;

import java.util.*;

import java.util.concurrent.ConcurrentSkipListSet;

import java.security.*;

/**

 *

 * @since 9

 */

    private final int digestLen;

    // field for ensuring native memory is freed

    private DigestContextRef pCtxt = null;

    private static class DigestContextRef extends PhantomReference<NativeDigest>

        implements Comparable<DigestContextRef> {

        private static ReferenceQueue<NativeDigest> refQueue =

            new ReferenceQueue<NativeDigest>();

        // Needed to keep these references from being GC'ed until when their

        // referents are GC'ed so we can do post-mortem processing

        private static Set<DigestContextRef> refList =

            new ConcurrentSkipListSet<DigestContextRef>();

        private final long id;

        private static void drainRefQueueBounded() {

            while (true) {

                DigestContextRef next = (DigestContextRef) refQueue.poll();

                if (next == null) break;

                next.dispose(true);

            }

        }

            super(nc, refQueue);

            this.id = id;

            this.mech = mech;

            refList.add(this);

            UcryptoProvider.debug("Resource: track Digest Ctxt " + this.id);

            drainRefQueueBounded();

        }

        public int compareTo(DigestContextRef other) {

            if (this.id == other.id) {

                return 0;

            } else {

                return (this.id < other.id) ? -1 : 1;

            }

        }

        void dispose(boolean needFree) {

            refList.remove(this);

            try {

                if (needFree) {

            } finally {

                this.clear();

            }

        }

    }

        this.digestLen = digestLen;

    }

    // see JCA spec

    protected int engineGetDigestLength() {

        return digestLen;

    }

    // see JCA spec

    protected synchronized void engineReset() {

        if (pCtxt != null) {

            pCtxt.dispose(true);

            pCtxt = null;

        }

    }

    // see JCA spec

    protected synchronized byte[] engineDigest() {

        byte[] digest = new byte[digestLen];

        try {

            int len = engineDigest(digest, 0, digestLen);

            if (len != digestLen) {

                throw new UcryptoException("Digest length mismatch." +

                    " Len: " + len + ". digestLen: " + digestLen);

            }

            return digest;

        } catch (DigestException de) {

            throw new UcryptoException("Internal error", de);

        }

    }

    // see JCA spec

    protected synchronized int engineDigest(byte[] out, int ofs, int len)

            throws DigestException {

        if (len < digestLen) {

            throw new DigestException("Output buffer must be at least " +

                          digestLen + " bytes long. Got: " + len);

        }

        if ((ofs < 0) || (len < 0) || (ofs > out.length - len)) {

            throw new DigestException("Buffer too short to store digest. " +

                "ofs: " + ofs + ". len: " + len + ". out.length: " + out.length);

        }

        if (pCtxt == null) {

        }

        try {

            if (status != 0) {

                throw new DigestException("Internal error: " + status);

            }

        } finally {

            pCtxt.dispose(false);

            pCtxt = null;

        }

        return digestLen;

    }

    // see JCA spec

    protected synchronized void engineUpdate(byte in) {

        byte[] temp = { in };

        engineUpdate(temp, 0, 1);

    }

    // see JCA spec

    protected synchronized void engineUpdate(byte[] in, int ofs, int len) {

        if (len == 0) {

            return;

        }

        if ((ofs < 0) || (len < 0) || (ofs > in.length - len)) {

            throw new ArrayIndexOutOfBoundsException("ofs: " + ofs + ". len: "

                + len + ". in.length: " + in.length);

        }

        if (pCtxt == null) {

        }

    }

    /**

     * Clone this digest.

     */

    public synchronized Object clone() throws CloneNotSupportedException {

    }

    // return pointer to the context

    // return status code; always 0

    // free the specified context

}