Searched refs:is_full (Results 1 - 13 of 13) sorted by relevance

/openjdk7/hotspot/src/share/vm/services/
H A DmemRecorder.hpp82 bool is_full() { return length() >= SIZE; } function in class:FixedSizeMemPointerArray
90 if (is_full()) return false;
235 inline bool is_full() const { function in class:MemRecorder
237 return _pointer_records->is_full();
H A DmemPtrArray.hpp51 virtual bool is_full() = 0;
190 bool is_full() { function in class:MemPointerArrayImpl
213 if (is_full()) {
222 if (is_full()) {
H A DmemTracker.cpp252 if (rc != NULL && rc->is_full()) {
/openjdk7/hotspot/src/share/vm/runtime/
H A Dsweeper.hpp98 static void handle_full_code_cache(bool is_full); // Called by compilers who fail to allocate
H A Dsweeper.cpp482 void NMethodSweeper::handle_full_code_cache(bool is_full) { argument
484 if (!is_full){
491 if (is_full) {
513 VM_HandleFullCodeCache op(is_full);
520 void NMethodSweeper::speculative_disconnect_nmethods(bool is_full) { argument
524 if ((!was_full()) && (is_full)) {
H A Dvm_operations.hpp269 VM_HandleFullCodeCache(bool is_full) { _is_full = is_full; } argument
/openjdk7/hotspot/src/share/vm/utilities/
H A Dstack.hpp108 inline bool is_full() const { return this->_full_seg_size >= this->max_size(); } function in class:Stack
111 // is_full() instead of size() == max_size(). Using a conditional here allows
H A Dstack.inline.hpp60 assert(!is_full(), "pushing onto a full stack");
H A DbitMap.hpp263 bool is_full() const;
H A DgrowableArray.hpp200 bool is_full() const { return _len == _max; } function in class:GrowableArray
H A DbitMap.cpp419 bool BitMap::is_full() const { function in class:BitMap
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsParallelCompact.hpp756 // single subclass that uses it to avoid making is_full() virtual, and thus
771 inline bool is_full() const;
816 inline bool ParMarkBitMapClosure::is_full() const {
H A DpsParallelCompact.cpp3364 if (closure.is_full()) {
3555 assert(is_full(), "sanity");
3607 return is_full() ? ParMarkBitMap::full : ParMarkBitMap::incomplete;

Completed in 132 milliseconds