All Downloads are FREE. Search and download functionalities are using the official Maven repository.

net.sf.ehcache.distribution.PayloadUtil Maven / Gradle / Ivy

Go to download

This is the ehcache core module. Pair it with other modules for added functionality.

There is a newer version: 2.6.11
Show newest version
/**
 *  Copyright 2003-2010 Terracotta, Inc.
 *
 *  Licensed under the Apache License, Version 2.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.apache.org/licenses/LICENSE-2.0
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 */

package net.sf.ehcache.distribution;

import java.io.ByteArrayInputStream;
import java.io.ByteArrayOutputStream;
import java.io.IOException;
import java.rmi.RemoteException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.List;

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;
import java.util.zip.GZIPInputStream;
import java.util.zip.GZIPOutputStream;

/**
 * This class provides utility methods for assembling and disassembling a heartbeat payload.
 * 

* Care is taken to fit the payload into the MTU of ethernet, which is 1500 bytes. The algorithms in this class are capable of creating * payloads for CacheManagers containing approximately 500 cache peers to be replicated. * * @author Greg Luck * @version $Id: PayloadUtil.java 4124 2011-06-17 19:42:55Z jvoegele $ */ final class PayloadUtil { /** * The maximum transmission unit. This varies by link layer. For ethernet, fast ethernet and * gigabit ethernet it is 1500 bytes, the value chosen. *

* Payloads are limited to this so that there is no fragmentation and no necessity for a complex reassembly protocol. */ public static final int MTU = 1500; /** * Delmits URLS sent via heartbeats over sockets */ public static final String URL_DELIMITER = "|"; /** * {@link #URL_DELIMITER} as a regular expression. Package protected, used in tests only */ static final String URL_DELIMITER_REGEXP = "\\|"; private static final Logger LOG = LoggerFactory.getLogger(PayloadUtil.class.getName()); /** * Utility class therefore precent construction */ private PayloadUtil() { // noop } /** * Creates a list of compressed (using gzip) url list. Breaks up the list of urlList such that size of each compressed entry in the list * does not exceed the {@link #MTU} and the number of url's in each compressed entry does not exceed the maximumPeersPerSend parameter * * @param localCachePeers * List containing the peers * @param maximumPeersPerSend * The maximum number of peers that can be present in one compressed entry * @return List of compressed entries containing the peers urlList */ public static List createCompressedPayloadList(final List localCachePeers, final int maximumPeersPerSend) { List rv = new ArrayList(); int iters = (int) Math.ceil((double) localCachePeers.size() / maximumPeersPerSend); for (int i = 0; i < iters; i++) { int fromIndex = maximumPeersPerSend * i; int toIndex = Math.min(maximumPeersPerSend * (i + 1), localCachePeers.size()); List subList = localCachePeers.subList(fromIndex, toIndex); rv.addAll(createCompressedPayload(subList, MTU)); } return rv; } /** * Generates a list of compressed urlList's for the input CachePeers list. Each compressed payload is limited by size by the * maxSizePerPayload parameter and will break up into multiple payloads if necessary to limit the payload size * * @param list The list of CachePeers whose payload needs to be generated * @param maxSizePerPayload The maximum size each payload can have * @return A list of compressed urlList's, each compressed entry not exceeding maxSizePerPayload */ private static List createCompressedPayload(final List list, final int maxSizePerPayload) { List rv = new ArrayList(); byte[] compressed = gzip(assembleUrlList(list)); if (compressed.length <= maxSizePerPayload) { // valid compression rv.add(compressed); } else { // byte[] exceeds MTU, break up till we get under limit size if (list.size() == 1) { // only one cache, and the compressed size is bigger than MTU, must be some absurd very long cacheName String url = null; try { url = list.get(0).getUrl(); } catch (RemoteException e) { LOG.error("This should never be thrown as it is called locally"); } LOG.error("The replicated cache url is too long. Unless configured with a smaller name, " + "heartbeat won't work for this cache. " + "Compressed url size: " + compressed.length + " MTU: " + maxSizePerPayload + " URL: " + url); return Collections.EMPTY_LIST; } List list1 = list.subList(0, list.size() / 2); List list2 = list.subList(list.size() / 2, list.size()); rv.addAll(createCompressedPayload(list1, maxSizePerPayload)); rv.addAll(createCompressedPayload(list2, maxSizePerPayload)); } return rv; } /** * Assembles a list of URLs * * @param localCachePeers * @return an uncompressed payload with catenated rmiUrls. */ public static byte[] assembleUrlList(List localCachePeers) { StringBuilder sb = new StringBuilder(); for (int i = 0; i < localCachePeers.size(); i++) { CachePeer cachePeer = (CachePeer) localCachePeers.get(i); String rmiUrl = null; try { rmiUrl = cachePeer.getUrl(); } catch (RemoteException e) { LOG.error("This should never be thrown as it is called locally"); } if (i != localCachePeers.size() - 1) { sb.append(rmiUrl).append(URL_DELIMITER); } else { sb.append(rmiUrl); } } LOG.debug("Cache peers for this CacheManager to be advertised: {}", sb); return sb.toString().getBytes(); } /** * Gzips a byte[]. For text, approximately 10:1 compression is achieved. * * @param ungzipped * the bytes to be gzipped * @return gzipped bytes */ public static byte[] gzip(byte[] ungzipped) { final ByteArrayOutputStream bytes = new ByteArrayOutputStream(); try { final GZIPOutputStream gzipOutputStream = new GZIPOutputStream(bytes); gzipOutputStream.write(ungzipped); gzipOutputStream.close(); } catch (IOException e) { LOG.error("Could not gzip " + Arrays.toString(ungzipped)); } return bytes.toByteArray(); } /** * The fastest Ungzip implementation. See PageInfoTest in ehcache-constructs. * A high performance implementation, although not as fast as gunzip3. * gunzips 100000 of ungzipped content in 9ms on the reference machine. * It does not use a fixed size buffer and is therefore suitable for arbitrary * length arrays. * * @param gzipped * @return a plain, uncompressed byte[] */ public static byte[] ungzip(final byte[] gzipped) { byte[] ungzipped = new byte[0]; try { final GZIPInputStream inputStream = new GZIPInputStream(new ByteArrayInputStream(gzipped)); ByteArrayOutputStream byteArrayOutputStream = new ByteArrayOutputStream(gzipped.length); final byte[] buffer = new byte[PayloadUtil.MTU]; int bytesRead = 0; while (bytesRead != -1) { bytesRead = inputStream.read(buffer, 0, PayloadUtil.MTU); if (bytesRead != -1) { byteArrayOutputStream.write(buffer, 0, bytesRead); } } ungzipped = byteArrayOutputStream.toByteArray(); inputStream.close(); byteArrayOutputStream.close(); } catch (IOException e) { LOG.error("Could not ungzip. Heartbeat will not be working. " + e.getMessage()); } return ungzipped; } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy