xiaoyan159/vtm
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

cleanup

Browse Source
This commit is contained in:
Hannes Janetzek 2013-01-25 00:21:15 +01:00
parent 5bcfafc7c7
commit b691c185f3
1 changed files with 7 additions and 33 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

40
src/org/oscim/renderer/BufferObject.java
View File

@ -36,7 +36,9 @@ public final class BufferObject {
counter--; counter--;
if (size != 0) { if (size != 0) {
// sort so that items larger than requested size are promoted in the list // find an item that has bound more than 'size' bytes.
// this has the advantage that either memory can be reused or
// a large unused block will be replaced by a smaller one.
BufferObject prev = null; BufferObject prev = null;
for (BufferObject bo = pool; bo != null; bo = bo.next) { for (BufferObject bo = pool; bo != null; bo = bo.next) {
if (bo.size > size) { if (bo.size > size) {
@ -46,7 +48,7 @@ public final class BufferObject {
prev.next = bo.next; prev.next = bo.next;
bo.next = null; bo.next = null;
Log.d(TAG, "requested: " + size + " got " + bo.size); //Log.d(TAG, "requested: " + size + " got " + bo.size);
return bo; return bo;
} }
prev = bo; prev = bo;
@ -58,38 +60,10 @@ public final class BufferObject {
return bo; return bo;
} }
// static synchronized BufferObject get(int size) {
// BufferObject bo, prev = null;
//
// if (pool == null) {
// return null;
// }
//
// int max = size * 4;
//
// for (bo = pool; bo != null; bo = bo.next) {
// if (bo.size > size && size < max)
// break;
//
// prev = bo;
// }
//
// if (prev != null && bo != null) {
// prev.next = bo.next;
// bo.next = null;
// return bo;
// }
//
// bo = pool;
// pool = pool.next;
// bo.next = null;
// return bo;
// }
public static synchronized void release(BufferObject bo) { public static synchronized void release(BufferObject bo) {
if (counter > 200) { //if (counter > 200) {
Log.d(TAG, "should clear some buffers " + counter); // Log.d(TAG, "should clear some buffers " + counter);
} //}
bo.next = pool; bo.next = pool;
pool = bo; pool = bo;