blob: 3ffc8e85cc15d43415a110ac8f0ede56ea740aca (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
|
// **********************************************************************
//
// Copyright (c) 2001
// Mutable Realms, Inc.
// Huntsville, AL, USA
//
// All Rights Reserved
//
// **********************************************************************
package IceInternal;
final class BufferManager
{
BufferManager()
{
_head = null;
}
java.nio.ByteBuffer
allocate(int size)
{
java.nio.ByteBuffer buf = getBuffer(size);
if(buf == null)
{
try
{
//buf = java.nio.ByteBuffer.allocateDirect(size);
buf = java.nio.ByteBuffer.allocate(size);
}
catch(OutOfMemoryError ex)
{
Ice.MemoryLimitException e = new Ice.MemoryLimitException();
e.initCause(ex);
throw e;
}
buf.order(java.nio.ByteOrder.LITTLE_ENDIAN);
}
return buf;
}
java.nio.ByteBuffer
reallocate(java.nio.ByteBuffer old, int size)
{
java.nio.ByteBuffer buf = getBuffer(size);
if(buf == null)
{
try
{
//buf = java.nio.ByteBuffer.allocateDirect(size);
buf = java.nio.ByteBuffer.allocate(size);
}
catch(OutOfMemoryError ex)
{
Ice.MemoryLimitException e = new Ice.MemoryLimitException();
e.initCause(ex);
throw e;
}
buf.order(java.nio.ByteOrder.LITTLE_ENDIAN);
}
old.position(0);
buf.put(old);
reclaim(old);
return buf;
}
synchronized void
reclaim(java.nio.ByteBuffer buf)
{
BufferNode node;
if(_nodeCache == null)
{
node = new BufferNode();
}
else
{
node = _nodeCache;
_nodeCache = _nodeCache.next;
}
node.buf = buf;
node.capacity = buf.capacity();
node.next = _head;
_head = node;
}
private synchronized java.nio.ByteBuffer
getBuffer(int size)
{
BufferNode node = _head;
BufferNode prev = null;
while(node != null)
{
if(size <= node.capacity)
{
break;
}
prev = node;
node = node.next;
}
if(node != null)
{
if(prev != null)
{
prev.next = node.next;
}
else
{
_head = node.next;
}
node.next = _nodeCache;
_nodeCache = node;
node.buf.clear();
return node.buf;
}
else
{
return null;
}
}
private static final class BufferNode
{
java.nio.ByteBuffer buf;
int capacity;
BufferNode next;
}
private BufferNode _head;
private BufferNode _nodeCache;
}
|
