org.glassfish.grizzly.memory.HeapMemoryManager$HeapBufferThreadLocalPool java code examples

Add the Codota plugin to your IDE and get smart completions

private void myMethod () {
 Charset c =String charsetName;Charset.forName(charsetName)
Charset.defaultCharset()
ContentType contentType;contentType.getCharset()
Smart code suggestions by Tabnine
}

/**
 * {@inheritDoc}
 */
@Override
public ThreadLocalPool createThreadLocalPool() {
  return new HeapBufferThreadLocalPool(this);
}

public void reset(final byte[] heap, final int offset, final int capacity) {
  if (pool != heap) {
    clearByteBufferCache();
    pool = heap;
  }
  leftPos = rightPos = start = offset;
  end = offset + capacity;
}

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

if (isLastAllocated(heapBuffer)) {
  rightPos -= heapBuffer.cap;
} else if (isReleasableLeft(heapBuffer)) {
  leftPos += heapBuffer.cap;
  if (leftPos == rightPos) {
} else if (wantReset(heapBuffer.cap)) {
  reset(heapBuffer);

@Override
public void trim() {
  checkDispose();
  final int sizeToReturn = cap - pos;
  if (sizeToReturn > 0) {
    final HeapBufferThreadLocalPool threadLocalCache =
        getHeapBufferThreadLocalPool();
    if (threadLocalCache != null) {
      if (threadLocalCache.isLastAllocated(this)) {
        flip();
        cap = lim;
        threadLocalCache.reduceLastAllocated(this);
        return;
      } else if (threadLocalCache.wantReset(sizeToReturn)) {
        flip();
        cap = lim;
        threadLocalCache.reset(heap, offset + cap, sizeToReturn);
        return;
      }
    }
  }
  super.trim();
}

@Override
public void trim() {
  checkDispose();
  final int sizeToReturn = cap - pos;
  if (sizeToReturn > 0) {
    final HeapBufferThreadLocalPool threadLocalCache =
        getHeapBufferThreadLocalPool();
    if (threadLocalCache != null) {
      if (threadLocalCache.isLastAllocated(this)) {
        flip();
        cap = lim;
        threadLocalCache.reduceLastAllocated(this);
        return;
      } else if (threadLocalCache.wantReset(sizeToReturn)) {
        flip();
        cap = lim;
        threadLocalCache.reset(heap, offset + cap, sizeToReturn);
        return;
      }
    }
  }
  super.trim();
}

@Override
public void trim() {
  checkDispose();
  final int sizeToReturn = cap - pos;
  if (sizeToReturn > 0) {
    final HeapBufferThreadLocalPool threadLocalCache =
        getHeapBufferThreadLocalPool();
    if (threadLocalCache != null) {
      if (threadLocalCache.isLastAllocated(this)) {
        flip();
        cap = lim;
        threadLocalCache.reduceLastAllocated(this);
        return;
      } else if (threadLocalCache.wantReset(sizeToReturn)) {
        flip();
        cap = lim;
        threadLocalCache.reset(heap, offset + cap, sizeToReturn);
        return;
      }
    }
  }
  super.trim();
}

@Override
public void trim() {
  checkDispose();
  final int sizeToReturn = cap - pos;
  if (sizeToReturn > 0) {
    final HeapBufferThreadLocalPool threadLocalCache =
        getHeapBufferThreadLocalPool();
    if (threadLocalCache != null) {
      if (threadLocalCache.isLastAllocated(this)) {
        flip();
        cap = lim;
        threadLocalCache.reduceLastAllocated(this);
        return;
      } else if (threadLocalCache.wantReset(sizeToReturn)) {
        flip();
        cap = lim;
        threadLocalCache.reset(heap, offset + cap, sizeToReturn);
        return;
      }
    }
  }
  super.trim();
}

@Override
public void trim() {
  checkDispose();
  final int sizeToReturn = cap - pos;
  if (sizeToReturn > 0) {
    final HeapBufferThreadLocalPool threadLocalCache =
        getHeapBufferThreadLocalPool();
    if (threadLocalCache != null) {
      if (threadLocalCache.isLastAllocated(this)) {
        flip();
        cap = lim;
        threadLocalCache.reduceLastAllocated(this);
        return;
      } else if (threadLocalCache.wantReset(sizeToReturn)) {
        flip();
        cap = lim;
        threadLocalCache.reset(heap, offset + cap, sizeToReturn);
        return;
      }
    }
  }
  super.trim();
}

@Override
public void trim() {
  checkDispose();
  final int sizeToReturn = cap - pos;
  if (sizeToReturn > 0) {
    final HeapBufferThreadLocalPool threadLocalCache =
        getHeapBufferThreadLocalPool();
    if (threadLocalCache != null) {
      if (threadLocalCache.isLastAllocated(this)) {
        flip();
        cap = lim;
        threadLocalCache.reduceLastAllocated(this);
        return;
      } else if (threadLocalCache.wantReset(sizeToReturn)) {
        flip();
        cap = lim;
        threadLocalCache.reset(heap, offset + cap, sizeToReturn);
        return;
      }
    }
  }
  super.trim();
}

Javadoc

Information about thread associated memory pool.

Most used methods

Popular in Java

Finding current android device location
putExtra (Intent)
onRequestPermissionsResult (Fragment)
getExternalFilesDir (Context)
File (java.io)
An "abstract" representation of a file system entity identified by a pathname. The pathname may be a
Arrays (java.util)
This class contains various methods for manipulating arrays (such as sorting and searching). This cl
TreeSet (java.util)
TreeSet is an implementation of SortedSet. All optional operations (adding and removing) are support
Semaphore (java.util.concurrent)
A counting semaphore. Conceptually, a semaphore maintains a set of permits. Each #acquire blocks if
Reference (javax.naming)
JPanel (javax.swing)
Top 17 PhpStorm Plugins

How to useHeapMemoryManager$HeapBufferThreadLocalPool in org.glassfish.grizzly.memory

Best Java code snippets using org.glassfish.grizzly.memory.HeapMemoryManager$HeapBufferThreadLocalPool (Showing top 20 results out of 315)

How to use
HeapMemoryManager$HeapBufferThreadLocalPool
in
org.glassfish.grizzly.memory