Home
last modified time | relevance | path

Searched refs:h1 (Results 1 – 3 of 3) sorted by relevance

/art/compiler/optimizing/
Dload_store_analysis.cc32 static bool CanIntegerRangesOverlap(int64_t l1, int64_t h1, int64_t l2, int64_t h2) { in CanIntegerRangesOverlap() argument
33 return std::max(l1, l2) <= std::min(h1, h2); in CanIntegerRangesOverlap()
58 int64_t h1 = l1 + (vector_length1 - 1); in CanBinaryOpAndIndexAlias() local
60 return CanIntegerRangesOverlap(l1, h1, l2, h2); in CanBinaryOpAndIndexAlias()
89 int64_t h1 = l1 + (vector_length1 - 1); in CanBinaryOpsAlias() local
91 return CanIntegerRangesOverlap(l1, h1, l2, h2); in CanBinaryOpsAlias()
231 int64_t h1 = l1 + (vector_length1 - 1); in CanArrayElementsAlias() local
233 return CanIntegerRangesOverlap(l1, h1, l2, h2); in CanArrayElementsAlias()
Doptimizing_unit_test.h670 void FillHandlers(First h1) { in FillHandlers() argument
674 handlers_[type] = GetWrapper(type, h1); in FillHandlers()
678 void FillHandlers(First h1, Inst... handlers) { in FillHandlers() argument
679 FillHandlers(h1); in FillHandlers()
/art/test/561-shared-slowpaths/src/
DMain.java27 private static void init(int[] x, int [] y, int l1, int h1, int l2, int h2) { in init() argument
28 for (int i = l1; i < h1; i++) { in init()