| /art/compiler/optimizing/ |
| H A D | bounds_check_elimination.cc | 669 } else if (cond == kCondGE) {
780 } else if (cond == kCondGT || cond == kCondGE) {
794 int32_t compensation = (cond == kCondGE) ? -1 : 0; // upper bound is inclusive
959 if (cmp == kCondGT || cmp == kCondGE ||
|
| H A D | bounds_check_elimination_test.cc | 362 IfCondition cond = kCondGE) {
395 if (cond == kCondGE) {
623 if (cond == kCondGE) {
657 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 0, 1, kCondGE);
665 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 1, 1, kCondGE);
681 HInstruction* bounds_check = BuildSSAGraph3(graph_, &allocator_, 1, 8, kCondGE);
690 IfCondition cond = kCondGE) {
724 if (cond == kCondGE) {
358 BuildSSAGraph1(HGraph* graph, ArenaAllocator* allocator, int initial, int increment, IfCondition cond = kCondGE) argument
687 BuildSSAGraph4(HGraph* graph, ArenaAllocator* allocator, int initial, IfCondition cond = kCondGE) argument
|
| H A D | code_generator_arm.cc | 686 case kCondGE: return GE;
705 case kCondGE: return HS;
727 case kCondGE: return gt_bias ? CS /* unordered */ : GE;
1294 case kCondGE:
|
| H A D | code_generator_arm64.cc | 86 case kCondGE: return ge;
107 case kCondGE: return gt_bias ? cs /* unordered */ : ge;
|
| H A D | code_generator_mips.cc | 2652 case kCondGE:
2662 if (cond == kCondGE) {
2774 case kCondGE:
2805 case kCondGE:
2866 case kCondGE:
2912 case kCondGE:
2993 case kCondGE:
3086 case kCondGE:
3131 case kCondGE:
3179 case kCondGE
[all...] |
| H A D | code_generator_mips64.cc | 2281 case kCondGE:
2291 if (cond == kCondGE) {
2408 case kCondGE:
2438 case kCondGE:
2504 case kCondGE:
2550 case kCondGE:
|
| H A D | code_generator_x86.cc | 703 case kCondGE: return kGreaterEqual;
722 case kCondGE: return kAboveEqual;
1214 case kCondGE:
|
| H A D | code_generator_x86_64.cc | 722 case kCondGE: return kGreaterEqual;
740 case kCondGE: return kAboveEqual;
|
| H A D | codegen_test.cc | 880 case kCondGE:
917 TestComparison(kCondGE, i, j, Primitive::kPrimInt, target_isa);
945 TestComparison(kCondGE, i, j, Primitive::kPrimLong, target_isa);
|
| H A D | induction_var_analysis.cc | 608 case kCondLE: VisitCondition(loop, b, a, type, kCondGE); break;
610 case kCondGE: VisitCondition(loop, b, a, type, kCondLE); break;
628 (stride_value == -1 && IsTaken(lower_expr, upper_expr, kCondGE)))) {
643 (stride_value < 0 && (cmp == kCondGT || cmp == kCondGE))) {
714 case kCondGE: op = kGE; break;
741 case kCondGE:
768 case kCondGE:
788 } else if (cmp == kCondGE) {
|
| H A D | nodes.cc | 2521 case kCondGE: replacement = new (allocator) HGreaterThanOrEqual(lhs, rhs); break;
|
| H A D | nodes.h | 95 kCondGE, // >= enumerator in enum:art::IfCondition
3071 return ((if_cond == kCondGT) || (if_cond == kCondGE)) && IsGtBias();
3232 return kCondGE;
3339 return kCondGE;
|
| /art/compiler/utils/mips/ |
| H A D | assembler_mips.cc | 767 case kCondGE:
785 case kCondGE:
1519 case kCondGE:
1554 case kCondGE:
1612 return kCondGE;
1613 case kCondGE:
2207 Bcond(label, kCondGE, rs, rt);
2208 } else if (Branch::IsUncond(kCondGE, rs, rt)) {
|
| H A D | assembler_mips.h | 575 kCondGE, enumerator in enum:art::mips::FINAL::BranchCondition
|
| /art/compiler/utils/mips64/ |
| H A D | assembler_mips64.cc | 642 case kCondGE:
1211 case kCondGE:
1247 case kCondGE:
1295 return kCondGE;
1296 case kCondGE:
1760 Bcond(label, kCondGE, rs, rt);
|
| H A D | assembler_mips64.h | 497 kCondGE, enumerator in enum:art::mips64::FINAL::BranchCondition
|