KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > org > mr > core > util > byteable > NetOutByteBufferPool


1 /*
2  * Copyright 2002 by
3  * <a HREF="http://www.coridan.com">Coridan</a>
4  * <a HREF="mailto: support@coridan.com ">support@coridan.com</a>
5  *
6  * The contents of this file are subject to the Mozilla Public License Version
7  * 1.1 (the "License"); you may not use this file except in compliance with the
8  * License. You may obtain a copy of the License at
9  * http://www.mozilla.org/MPL/
10  *
11  * Software distributed under the License is distributed on an "AS IS" basis,
12  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
13  * for the specific language governing rights and limitations under the
14  * License.
15  *
16  * The Original Code is "MantaRay" (TM).
17  *
18  * The Initial Developer of the Original Code is Amir Shevat.
19  * Portions created by the Initial Developer are Copyright (C) 2006
20  * Coridan Inc. All Rights Reserved.
21  *
22  * Contributor(s): all the names of the contributors are added in the source
23  * code where applicable.
24  *
25  * Alternatively, the contents of this file may be used under the terms of the
26  * LGPL license (the "GNU LESSER GENERAL PUBLIC LICENSE"), in which case the
27  * provisions of LGPL are applicable instead of those above. If you wish to
28  * allow use of your version of this file only under the terms of the LGPL
29  * License and not to allow others to use your version of this file under
30  * the MPL, indicate your decision by deleting the provisions above and
31  * replace them with the notice and other provisions required by the LGPL.
32  * If you do not delete the provisions above, a recipient may use your version
33  * of this file under either the MPL or the GNU LESSER GENERAL PUBLIC LICENSE.
34  
35  *
36  * This library is free software; you can redistribute it and/or modify it
37  * under the terms of the MPL as stated above or under the terms of the GNU
38  * Lesser General Public License as published by the Free Software Foundation;
39  * either version 2.1 of the License, or any later version.
40  *
41  * This library is distributed in the hope that it will be useful, but WITHOUT
42  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
43  * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public
44  * License for more details.
45  */
46 /*
47  * Created on 22/02/2004
48  * Manta LTD
49  */
50 package org.mr.core.util.byteable;
51
52 import java.nio.ByteBuffer JavaDoc;
53
54 //import java.nio.HeapByteBuffer;
55
56
57
58 import org.mr.core.util.SynchronizedQueue;
59
60
61 /**
62  * a pool of ByteBuffer for network use (network messages and headers)
63  * @since 22/02/2004
64  * @version 1.0
65  * @author Amir Shevat
66  * ByteBufferPool
67  *
68  */
69 public class NetOutByteBufferPool {
70     static final int SMALL_SIZE_BUFFER = 2048;
71     static final int MEDIUM_SIZE_BUFFER = 6120;
72     static final int LARGE_SIZE_BUFFER = 10240;
73     
74     private static NetOutByteBufferPool instance = new NetOutByteBufferPool();
75     private SynchronizedQueue small = new SynchronizedQueue();
76     private SynchronizedQueue medium = new SynchronizedQueue();
77     private SynchronizedQueue large = new SynchronizedQueue();
78     
79     
80     
81     public final static NetOutByteBufferPool getInstance(){
82         return instance;
83     }//getInstance
84
85
86     /**
87      * Constructor
88      */
89     private NetOutByteBufferPool() {
90         
91         for (int i = 0; i < ByteBufferPool.numInSmallPool; i++) {
92             small.enqueue(ByteBuffer.allocate(ByteBufferPool.SMALL_SIZE_BUFFER));
93         }//for
94
95         for (int i = 0; i < ByteBufferPool.numInMediumPool; i++) {
96             medium.enqueue(ByteBuffer.allocate(ByteBufferPool.MEDIUM_SIZE_BUFFER));
97         }//for
98
99         for (int i = 0; i < ByteBufferPool.numInLargePool; i++) {
100             large.enqueue(ByteBuffer.allocate(ByteBufferPool.LARGE_SIZE_BUFFER));
101         }//for
102 }//ByteBufferPool
103
104     
105     public final ByteBuffer JavaDoc getBuffer(int size){
106         
107         ByteBuffer JavaDoc result = null;
108         if(size <= ByteBufferPool.SMALL_SIZE_BUFFER){
109             result= (ByteBuffer JavaDoc)small.dequeue();
110         }else if(size <= ByteBufferPool.MEDIUM_SIZE_BUFFER){
111             result= (ByteBuffer JavaDoc)medium.dequeue();
112         }else if(size <= ByteBufferPool.LARGE_SIZE_BUFFER){
113             result= (ByteBuffer JavaDoc)large.dequeue();
114         }else{
115 // this buffer can not be found in pool return new
116 result= ByteBuffer.allocate(size);
117         }
118
119         result.limit(size);
120         return result;
121     }//getBuffer
122
123     
124     public final void release(ByteBuffer JavaDoc buffer){
125
126         // we do not need bad buffers here in our pool
127 if(buffer==null)
128             return;
129         
130         buffer.position(0);
131         buffer.limit(buffer.capacity());
132         buffer.mark();
133         int size = buffer.capacity();
134         
135         if(size == ByteBufferPool.SMALL_SIZE_BUFFER && small.size() < ByteBufferPool.numInSmallPool)
136             small.enqueue(buffer);
137         else if(size == ByteBufferPool.MEDIUM_SIZE_BUFFER)
138             medium.enqueue(buffer);
139         else if(size == ByteBufferPool.LARGE_SIZE_BUFFER)
140             large.enqueue(buffer);
141     }//release
142 }
143
144
Popular Tags