Searched defs:hi (Results 1 - 14 of 14) sorted by relevance

/art/test/921-hello-failure/src/
H A DTransform4.java19 public Transform4(String hi) { argument
20 greeting = hi;
/art/runtime/arch/
H A Dinstruction_set.h246 static inline TwoWordReturn GetTwoWordSuccessValue(uintptr_t hi, uintptr_t lo) { argument
249 uint64_t hi64 = static_cast<uint64_t>(hi);
256 uintptr_t hi; member in struct:art::TwoWordReturn
267 static inline TwoWordReturn GetTwoWordSuccessValue(uintptr_t hi, uintptr_t lo) { argument
270 ret.hi = hi;
/art/runtime/interpreter/
H A Dinterpreter_common.h454 int hi = size - 1; local
455 while (lo <= hi) {
456 int mid = (lo + hi) / 2;
459 hi = mid - 1;
/art/runtime/interpreter/mterp/
H A Dmterp.cc97 int hi = size - 1; local
98 while (lo <= hi) {
99 int mid = (lo + hi) >> 1;
103 hi = mid - 1;
/art/test/530-checker-loops2/src/
H A DMain.java397 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 Dinduction_var_range_test.cc209 /** 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 Dloop_optimization.cc656 HInstruction* hi,
669 // for (i = lo; i < hi; i += step)
671 HInstruction* cond = new (global_allocator_) HAboveOrEqual(vector_phi_, hi);
652 GenerateNewLoop(LoopNode* node, HBasicBlock* block, HBasicBlock* new_preheader, HInstruction* lo, HInstruction* hi, HInstruction* step) argument
H A Dintrinsics_arm.cc547 Register hi = invoke->GetLocations()->Out().AsRegisterPairHigh<Register>(); local
549 __ ldr(hi, Address(addr, 4));
553 __ ldr(hi, Address(addr, 4));
H A Dintrinsics_arm_vixl.cc887 vixl32::Register hi = HighRegisterFrom(invoke->GetLocations()->Out()); local
889 __ Ldr(hi, MemOperand(addr, 4));
893 __ Ldr(hi, MemOperand(addr, 4));
1590 __ B(hi, &loop, /* far_target */ false);
1693 __ B(hi, &different_compression_loop, /* far_target */ false);
1823 __ B(hi, &loop, /* far_target */ false);
H A Dcode_generator_arm.cc3298 // out.hi = -C
3302 // out.hi = out.hi - in.hi
3990 // The algorithm is wrong if out.hi is either in1.lo or in2.lo:
3997 // formula: out.hi : out.lo = (in1.lo * in2.hi + in1.hi * in2.lo)* 2^32 + in1.lo * in2.lo
3998 // parts: out.hi = in1.lo * in2.hi
5455 Register hi = locations->GetTemp(1).AsRegister<Register>(); local
[all...]
H A Dcode_generator_arm_vixl.cc1384 case kCondA: return hi;
1399 case kCondGT: return hi;
1404 case kCondA: return hi;
1421 case kCondGT: return gt_bias ? hi /* unordered */ : gt;
3355 // out.hi = -C
3357 // out.hi = out.hi - in.hi
3991 // The algorithm is wrong if out.hi is either in1.lo or in2.lo:
3998 // formula: out.hi
5456 vixl32::Register hi = RegisterFrom(locations->GetTemp(1)); local
[all...]
/art/runtime/
H A Ddex_file.cc689 int32_t hi = NumFieldIds() - 1; local
690 while (hi >= lo) {
691 int32_t mid = (hi + lo) / 2;
696 hi = mid - 1;
701 hi = mid - 1;
706 hi = mid - 1;
724 int32_t hi = NumMethodIds() - 1; local
725 while (hi >= lo) {
726 int32_t mid = (hi + lo) / 2;
731 hi
753 int32_t hi = NumStringIds() - 1; local
772 int32_t hi = NumTypeIds() - 1; local
792 int32_t hi = NumStringIds() - 1; local
811 int32_t hi = NumTypeIds() - 1; local
830 int32_t hi = NumProtoIds() - 1; local
[all...]
/art/tools/dmtracedump/
H A Dtracedump.cc976 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 Dmethod_verifier.cc2290 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local
2291 work_line_->SetRegisterTypeWide(this, inst->VRegA_21s(), lo, hi);
2297 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local
2298 work_line_->SetRegisterTypeWide(this, inst->VRegA_31i(), lo, hi);
2304 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local
2305 work_line_->SetRegisterTypeWide(this, inst->VRegA_51l(), lo, hi);
2311 const RegType& hi = reg_types_.FromCat2ConstHi(static_cast<int32_t>(val >> 32), true); local
2312 work_line_->SetRegisterTypeWide(this, inst->VRegA_21h(), lo, hi);

Completed in 1911 milliseconds