/art/test/921-hello-failure/src/ |
H A D | Transform4.java | 19 public Transform4(String hi) { argument 20 greeting = hi;
|
/art/runtime/arch/ |
H A D | instruction_set.h | 265 static inline constexpr TwoWordReturn GetTwoWordSuccessValue(uintptr_t hi, uintptr_t lo) { argument 268 uint64_t hi64 = static_cast<uint64_t>(hi); 279 uintptr_t hi; member in struct:art::InstructionSet::TwoWordReturn 290 static inline TwoWordReturn GetTwoWordSuccessValue(uintptr_t hi, uintptr_t lo) { argument 293 ret.hi = hi;
|
/art/runtime/interpreter/ |
H A D | interpreter_common.h | 480 int hi = size - 1; local 481 while (lo <= hi) { 482 int mid = (lo + hi) / 2; 485 hi = mid - 1;
|
/art/runtime/interpreter/mterp/ |
H A D | mterp.cc | 99 int hi = size - 1; local 100 while (lo <= hi) { 101 int mid = (lo + hi) >> 1; 105 hi = mid - 1;
|
/art/test/530-checker-loops2/src/ |
H A D | Main.java | 397 private static void hiddenOOB2(int hi) { argument 399 for (int i = 0; i < hi; i++) { 401 // on index j of 5. When, for instance, hi and thus i = 2147483647, the upper bound 417 private static void hiddenOOB3(int hi) { argument 419 for (int i = -1; i <= hi; i++) { 610 private static int linearDynamicBCE1(int[] x, int lo, int hi) { argument 612 for (int i = lo; i < hi; i++) { 632 private static int linearDynamicBCE2(int[] x, int lo, int hi, int offset) { argument 634 for (int i = lo; i < hi; i++) { 702 static int dynamicBCEPossiblyInfiniteLoop(int[] x, int lo, int hi) { argument 722 noDynamicBCEPossiblyInfiniteLoop(int[] x, int lo, int hi) argument 742 noDynamicBCEMixedInductionTypes(int[] x, long lo, long hi) argument 799 dynamicBCEAndConstantIndices(int[] x, int[][] a, int lo, int hi) argument 848 dynamicBCEAndConstantIndicesAllPrimTypes(int[] q, boolean[] r, byte[] s, char[] t, short[] u, int[] v, long[] w, float[] x, double[] y, int lo, int hi) argument 883 dynamicBCEAndConstantIndexRefType(int[] q, Integer[] z, int lo, int hi) argument [all...] |
/art/compiler/optimizing/ |
H A D | induction_var_range_test.cc | 209 /** Constructs a range [lo, hi] using a periodic induction. */ 210 HInductionVarAnalysis::InductionInfo* CreateRange(int32_t lo, int32_t hi) { argument 214 CreateConst(hi), 232 HInductionVarAnalysis::InductionInfo* CreateWrapAround(int32_t initial, int32_t lo, int32_t hi) { argument 233 return CreateWrapAround(initial, CreateRange(lo, hi));
|
H A D | loop_optimization.cc | 1012 HInstruction* hi, 1026 // for (i = lo; i < hi; i += step) 1028 HInstruction* cond = new (global_allocator_) HAboveOrEqual(phi, hi); 1008 GenerateNewLoop(LoopNode* node, HBasicBlock* block, HBasicBlock* new_preheader, HInstruction* lo, HInstruction* hi, HInstruction* step, uint32_t unroll) argument
|
H A D | intrinsics_arm_vixl.cc | 873 vixl32::Register hi = HighRegisterFrom(invoke->GetLocations()->Out()); local 875 __ Ldr(hi, MemOperand(addr, 4)); 879 __ Ldr(hi, MemOperand(addr, 4)); 1619 __ B(hi, &loop, /* far_target */ false); 1722 __ B(hi, &different_compression_loop, /* far_target */ false); 1939 __ B(hi, &loop, /* far_target */ false);
|
H A D | code_generator_arm_vixl.cc | 1456 case kCondA: return hi; 1471 case kCondGT: return hi; 1476 case kCondA: return hi; 1493 case kCondGT: return gt_bias ? hi /* unordered */ : gt; 3730 // out.hi = -C 3732 // out.hi = out.hi - in.hi 4294 // The algorithm is wrong if out.hi is either in1.lo or in2.lo: 4301 // formula: out.hi 5767 vixl32::Register hi = RegisterFrom(locations->GetTemp(1)); local [all...] |
/art/libdexfile/dex/ |
H A D | dex_file.cc | 251 int32_t hi = NumFieldIds() - 1; local 252 while (hi >= lo) { 253 int32_t mid = (hi + lo) / 2; 258 hi = mid - 1; 263 hi = mid - 1; 268 hi = mid - 1; 286 int32_t hi = NumMethodIds() - 1; local 287 while (hi >= lo) { 288 int32_t mid = (hi + lo) / 2; 293 hi 315 int32_t hi = NumStringIds() - 1; local 334 int32_t hi = NumTypeIds() - 1; local 354 int32_t hi = NumStringIds() - 1; local 373 int32_t hi = NumTypeIds() - 1; local 392 int32_t hi = NumProtoIds() - 1; local [all...] |
/art/tools/dmtracedump/ |
H A D | tracedump.cc | 976 int32_t hi = pKeys->numMethods - 1; local 978 while (hi >= lo) { 979 int32_t mid = (hi + lo) / 2; 987 hi = mid - 1;
|
/art/runtime/verifier/ |
H A D | method_verifier.cc | 2244 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local 2245 work_line_->SetRegisterTypeWide(this, inst->VRegA_21s(), lo, hi); 2251 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local 2252 work_line_->SetRegisterTypeWide(this, inst->VRegA_31i(), lo, hi); 2258 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local 2259 work_line_->SetRegisterTypeWide(this, inst->VRegA_51l(), lo, hi); 2265 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local 2266 work_line_->SetRegisterTypeWide(this, inst->VRegA_21h(), lo, hi);
|
/art/compiler/utils/mips/ |
H A D | assembler_mips.cc | 4665 // |31 hi 16|15 mid 13-10|12-9 low 0| 4673 int16_t hi = High16Bits(tmp); local 4675 Aui(AT, base, hi); 4677 Lui(AT, hi);
|
/art/compiler/utils/mips64/ |
H A D | assembler_mips64.cc | 3500 // |63 top 48|47 hi 32|31 upper 16|15 mid 13-10|12-9 low 0| 3506 // `hi` is 1 when `offset` is close to +2GB and 0 otherwise. 3513 int16_t hi = Low16Bits(High32Bits(tmp)); local 3515 if (hi != 0) { 3516 CHECK_EQ(hi, 1); 3517 Dahi(AT, hi);
|