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

/openjdk7/hotspot/src/share/vm/shark/
H A DsharkInvariants.cpp32 for (int i = 0; i < flow()->block_count(); i++) {
H A DsharkFunction.hpp75 int block_count() const { function in class:SharkFunction
76 return flow()->block_count();
79 assert(i < block_count(), "should be");
H A DsharkFunction.cpp66 _blocks = NEW_RESOURCE_ARRAY(SharkTopLevelBlock*, block_count());
67 for (int i = 0; i < block_count(); i++) {
84 for (int i = 0; i < block_count(); i++) {
123 for (int i = 0; i < block_count(); i++) {
127 if (i + 1 < block_count())
H A DsharkTopLevelBlock.cpp501 for (int i = 0; i < function()->block_count(); i++) {
680 for (int i = 0; i < function()->block_count(); i++)
/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.
H A DciTypeFlow.cpp2761 assert(block_ct == 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
H A Dc1_LinearScan.cpp431 int num_blocks = block_count();
505 int num_blocks = block_count();
572 int num_blocks = block_count();
754 int num_blocks = block_count();
1321 for (i = block_count() - 1; i >= 0; i--) {
1756 int num_blocks = block_count();
1973 int num_blocks = block_count();
3025 int num_blocks = block_count();
3134 for (i = 0; i < block_count(); i++) {
3268 for (int i = 0; i < block_count();
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dparse1.cpp615 for (int rpo = 0; rpo < block_count(); rpo++) {
693 blocks_seen += block_count();
698 for (int rpo = 0; rpo < block_count(); rpo++) {
1110 _block_count = flow()->block_count();
1117 for (rpo = 0; rpo < block_count(); rpo++) {
1123 for (rpo = 0; rpo < block_count(); rpo++) {
H A Dparse.hpp366 int block_count() const { return _block_count; } function in class:Parse
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dc1_LinearScan_x86.cpp53 const int num_blocks = block_count();
122 int num_blocks = allocator()->block_count();
/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");
H A DpsParallelCompact.cpp3460 size_t cur_block = sd.block_count();

Completed in 119 milliseconds