|
Java example source code file (Util.java)
The Util.java Java example source code/* * Copyright (c) 2000, 2013, 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 * 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 sun.nio.ch; import java.lang.ref.SoftReference; import java.lang.reflect.*; import java.io.IOException; import java.io.FileDescriptor; import java.nio.ByteBuffer; import java.nio.MappedByteBuffer; import java.nio.channels.*; import java.security.AccessController; import java.security.PrivilegedAction; import java.util.*; import sun.misc.Unsafe; import sun.misc.Cleaner; import sun.security.action.GetPropertyAction; public class Util { // -- Caches -- // The number of temp buffers in our pool private static final int TEMP_BUF_POOL_SIZE = IOUtil.IOV_MAX; // Per-thread cache of temporary direct buffers private static ThreadLocal<BufferCache> bufferCache = new ThreadLocal<BufferCache>() { @Override protected BufferCache initialValue() { return new BufferCache(); } }; /** * A simple cache of direct buffers. */ private static class BufferCache { // the array of buffers private ByteBuffer[] buffers; // the number of buffers in the cache private int count; // the index of the first valid buffer (undefined if count == 0) private int start; private int next(int i) { return (i + 1) % TEMP_BUF_POOL_SIZE; } BufferCache() { buffers = new ByteBuffer[TEMP_BUF_POOL_SIZE]; } /** * Removes and returns a buffer from the cache of at least the given * size (or null if no suitable buffer is found). */ ByteBuffer get(int size) { if (count == 0) return null; // cache is empty ByteBuffer[] buffers = this.buffers; // search for suitable buffer (often the first buffer will do) ByteBuffer buf = buffers[start]; if (buf.capacity() < size) { buf = null; int i = start; while ((i = next(i)) != start) { ByteBuffer bb = buffers[i]; if (bb == null) break; if (bb.capacity() >= size) { buf = bb; break; } } if (buf == null) return null; // move first element to here to avoid re-packing buffers[i] = buffers[start]; } // remove first element buffers[start] = null; start = next(start); count--; // prepare the buffer and return it buf.rewind(); buf.limit(size); return buf; } boolean offerFirst(ByteBuffer buf) { if (count >= TEMP_BUF_POOL_SIZE) { return false; } else { start = (start + TEMP_BUF_POOL_SIZE - 1) % TEMP_BUF_POOL_SIZE; buffers[start] = buf; count++; return true; } } boolean offerLast(ByteBuffer buf) { if (count >= TEMP_BUF_POOL_SIZE) { return false; } else { int next = (start + count) % TEMP_BUF_POOL_SIZE; buffers[next] = buf; count++; return true; } } boolean isEmpty() { return count == 0; } ByteBuffer removeFirst() { assert count > 0; ByteBuffer buf = buffers[start]; buffers[start] = null; start = next(start); count--; return buf; } } /** * Returns a temporary buffer of at least the given size */ public static ByteBuffer getTemporaryDirectBuffer(int size) { BufferCache cache = bufferCache.get(); ByteBuffer buf = cache.get(size); if (buf != null) { return buf; } else { // No suitable buffer in the cache so we need to allocate a new // one. To avoid the cache growing then we remove the first // buffer from the cache and free it. if (!cache.isEmpty()) { buf = cache.removeFirst(); free(buf); } return ByteBuffer.allocateDirect(size); } } /** * Releases a temporary buffer by returning to the cache or freeing it. */ public static void releaseTemporaryDirectBuffer(ByteBuffer buf) { offerFirstTemporaryDirectBuffer(buf); } /** * Releases a temporary buffer by returning to the cache or freeing it. If * returning to the cache then insert it at the start so that it is * likely to be returned by a subsequent call to getTemporaryDirectBuffer. */ static void offerFirstTemporaryDirectBuffer(ByteBuffer buf) { assert buf != null; BufferCache cache = bufferCache.get(); if (!cache.offerFirst(buf)) { // cache is full free(buf); } } /** * Releases a temporary buffer by returning to the cache or freeing it. If * returning to the cache then insert it at the end. This makes it * suitable for scatter/gather operations where the buffers are returned to * cache in same order that they were obtained. */ static void offerLastTemporaryDirectBuffer(ByteBuffer buf) { assert buf != null; BufferCache cache = bufferCache.get(); if (!cache.offerLast(buf)) { // cache is full free(buf); } } /** * Frees the memory for the given direct buffer */ private static void free(ByteBuffer buf) { ((DirectBuffer)buf).cleaner().clean(); } // -- Random stuff -- static ByteBuffer[] subsequence(ByteBuffer[] bs, int offset, int length) { if ((offset == 0) && (length == bs.length)) return bs; int n = length; ByteBuffer[] bs2 = new ByteBuffer[n]; for (int i = 0; i < n; i++) bs2[i] = bs[offset + i]; return bs2; } static <E> Set Other Java examples (source code examples)Here is a short list of links related to this Java Util.java source code file: |
... this post is sponsored by my books ... | |
#1 New Release! |
FP Best Seller |
Copyright 1998-2024 Alvin Alexander, alvinalexander.com
All Rights Reserved.
A percentage of advertising revenue from
pages under the /java/jwarehouse
URI on this website is
paid back to open source projects.