Searched defs:block_count (Results 1 - 5 of 5) sorted by relevance

/openjdk7/hotspot/src/share/vm/shark/
H A DsharkFunction.hpp75 int block_count() const { function in class:SharkFunction
76 return flow()->block_count();
79 assert(i < block_count(), "should be");
/openjdk7/hotspot/src/share/vm/gc_implementation/parallelScavenge/
H A DpsParallelCompact.hpp396 size_t block_count() const { return _block_count; } function in class:ParallelCompactData
621 assert(n < block_count(), "bad arg");
/openjdk7/hotspot/src/share/vm/opto/
H A Dparse.hpp366 int block_count() const { return _block_count; } function in class:Parse
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.hpp686 int rpo() const { assert(has_rpo(), ""); return outer()->block_count() - post_order() - 1; }
851 int block_count() const { assert(have_block_count(), ""); function in class:ciTypeFlow
853 Block* pre_order_at(int po) const { assert(0 <= po && po < block_count(), "out of bounds");
857 Block* rpo_at(int rpo) const { assert(0 <= rpo && rpo < block_count(), "out of bounds");
869 // Next Block::_pre_order. After mapping, doubles as block_count.
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LinearScan.hpp180 int block_count() const { assert(_cached_blocks.length() == ir()->linear_scan_order()->length(), "invalid cached block list"); return _cached_blocks.length(); } function in class:LinearScan
730 int block_count() const { return allocator()->block_count(); } function in class:LinearScanWalker

Completed in 64 milliseconds