Searched refs:number_of_sux (Results 1 - 14 of 14) sorted by relevance

/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_IR.cpp287 int nos = be->number_of_sux();
557 assert(parent->number_of_sux() == 1 && parent->sux_at(0) == cur,
578 for (i = cur->number_of_sux() - 1; i >= 0; i--) {
617 assert(loop_end->number_of_sux() == 1, "incorrect number of successors");
696 for (i = cur->number_of_sux() - 1; i >= 0; i--) {
740 if (cur->number_of_sux() == 1) {
857 assert(osr_entry->number_of_sux() == 1, "osr entry must have exactly one successor");
889 int num_sux = cur->number_of_sux();
991 if (cur->number_of_sux() > 0) {
993 for (int j = 0; j < cur->number_of_sux();
[all...]
H A Dc1_Instruction.cpp530 for (int i = 0; i < end->number_of_sux(); i++) {
562 for (int s = 0; s < from->number_of_sux();) {
582 for (int s = 0; s < number_of_sux(); s++) {
589 for (int i = 0; i < number_of_sux(); i++) {
700 { for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_preorder(mark, closure); }
710 { for (int i = e->number_of_sux () - 1; i >= 0; i--) e->sux_at (i)->iterate_postorder(mark, closure); }
938 BlockList* sux = new BlockList(_begin->number_of_sux());
939 for (int i = 0; i < _begin->number_of_sux(); i++) {
H A Dc1_Instruction.hpp1662 int number_of_sux() const;
1763 int number_of_sux() const { return _sux != NULL ? _sux->length() : 0; }
1765 BlockBegin* default_sux() const { return sux_at(number_of_sux() - 1); }
1866 assert(number_of_sux() == 2, "wrong number of successors");
1925 assert(number_of_sux() == 2, "wrong number of successors");
1951 int length() const { return number_of_sux() - 1; }
2049 BlockBegin* osr_entry() const { return number_of_sux() < 2 ? NULL : sux_at(0); }
2449 inline int BlockBegin::number_of_sux() const { assert(_end == NULL || _end->number_of_sux() == _successors.length(), "mismatch"); return _successors.length(); }
H A Dc1_CFGPrinter.cpp294 for (i = 0; i < block->number_of_sux(); i++) {
H A Dc1_Canonicalizer.cpp751 } else if (x->number_of_sux() == 1) {
758 } else if (x->number_of_sux() == 2) {
782 } else if (x->number_of_sux() == 1) {
789 } else if (x->number_of_sux() == 2) {
H A Dc1_InstructionPrinter.cpp596 if (end != NULL && end->number_of_sux() > 0) {
598 for (int i = 0; i < end->number_of_sux(); i++) {
782 if (x->number_of_sux() > 1) {
H A Dc1_Optimizer.cpp335 assert(end->number_of_sux() == 1, "end must have exactly one successor");
831 for (i = 0; i < e->number_of_sux(); i++) {
1167 for (int s = end->number_of_sux(); s-- > 0; ) {
H A Dc1_LinearScan.cpp774 int n = block->number_of_sux();
1720 if (from_block->number_of_sux() <= 1) {
1766 if (block->number_of_preds() == 1 && block->number_of_sux() == 1 && block->number_of_exception_handlers() == 0) {
1799 int num_sux = from_block->number_of_sux();
2172 if (block->number_of_sux() <= 1 && op_id == block->last_lir_instruction_id()) {
2797 if (block->number_of_sux() == 1 && op_id == block->last_lir_instruction_id()) {
3488 for (int i = 0; i < block->number_of_sux(); i++) {
5810 if (block->number_of_sux() == 2) {
5907 if (pred->number_of_sux() != 1) {
5913 assert(pred->number_of_sux()
[all...]
H A Dc1_LIR.cpp1602 if (x->number_of_sux() > 0) {
1604 for (int i = 0; i < x->number_of_sux(); i ++) {
H A Dc1_GraphBuilder.cpp406 for (int i = block->number_of_sux() - 1; i >= 0; i--) {
465 if (cur->number_of_sux() > 0) {
467 for (int j = 0; j < cur->number_of_sux(); j++) {
2726 for (int i = end->number_of_sux() - 1; i >= 0; i--) {
H A Dc1_LIRGenerator.cpp1014 if (bb->number_of_sux() == 1) {
/openjdk7/hotspot/src/cpu/x86/vm/
H A Dc1_LinearScan_x86.cpp1149 int number_of_sux = block->number_of_sux(); local
1151 if (number_of_sux == 1 && block->sux_at(0)->number_of_preds() > 1) {
1197 for (int i = 0; i < number_of_sux; i++) {
1228 for (int i = 0; i < number_of_sux; i++) {
H A Dc1_LIRGenerator_x86.cpp1201 assert(x->number_of_sux() == 2, "inconsistency");
/openjdk7/hotspot/src/cpu/sparc/vm/
H A Dc1_LIRGenerator_sparc.cpp1061 assert(x->number_of_sux() == 2, "inconsistency");

Completed in 483 milliseconds