Tabnine Logo
HeapMemoryManager$TrimmableHeapBuffer.checkDispose
Code IndexAdd Tabnine to your IDE (free)

How to use
checkDispose
method
in
org.glassfish.grizzly.memory.HeapMemoryManager$TrimmableHeapBuffer

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

origin: org.mule.glassfish.grizzly/grizzly-framework

@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();
}
origin: javaee/grizzly

@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();
}
origin: javaee/grizzly

@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();
}
origin: org.glassfish.grizzly/grizzly-websockets-server

@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();
}
origin: org.glassfish.grizzly/grizzly-http-server-core

@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();
}
origin: org.glassfish.grizzly/grizzly-core

@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();
}
origin: javaee/grizzly

@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();
}
origin: javaee/grizzly

@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();
}
origin: javaee/grizzly

@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();
}
origin: javaee/grizzly

@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();
}
origin: javaee/grizzly

@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();
}
origin: javaee/grizzly

@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();
}
org.glassfish.grizzly.memoryHeapMemoryManager$TrimmableHeapBuffercheckDispose

Popular methods of HeapMemoryManager$TrimmableHeapBuffer

  • <init>
  • flip
  • initialize
  • prepareDispose
  • recycle

Popular in Java

  • Reactive rest calls using spring rest template
  • startActivity (Activity)
  • orElseThrow (Optional)
    Return the contained value, if present, otherwise throw an exception to be created by the provided s
  • onRequestPermissionsResult (Fragment)
  • InputStream (java.io)
    A readable source of bytes.Most clients will use input streams that read data from the file system (
  • PrintStream (java.io)
    Fake signature of an existing Java class.
  • ConcurrentHashMap (java.util.concurrent)
    A plug-in replacement for JDK1.5 java.util.concurrent.ConcurrentHashMap. This version is based on or
  • Stream (java.util.stream)
    A sequence of elements supporting sequential and parallel aggregate operations. The following exampl
  • Reference (javax.naming)
  • Base64 (org.apache.commons.codec.binary)
    Provides Base64 encoding and decoding as defined by RFC 2045.This class implements section 6.8. Base
  • Top plugins for Android Studio
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now