| /art/compiler/optimizing/ |
| D | code_generator.cc | 49 for (size_t i = 0, e = blocks.Size(); i < e; ++i) { in CompileBaseline() local
78 for (size_t i = 0, e = blocks.Size(); i < e; ++i) { in CompileOptimized() local
96 for (size_t i = 0, e = slow_paths_.Size(); i < e; ++i) { in GenerateSlowPaths() local
150 for (size_t i = 0, e = GetNumberOfRegisters(); i < e; ++i) { in AllocateRegistersLocally() local
155 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in AllocateRegistersLocally() local
164 for (size_t i = 0, e = locations->GetTempCount(); i < e; ++i) { in AllocateRegistersLocally() local
176 for (size_t i = 0, e = locations->GetInputCount(); i < e; ++i) { in AllocateRegistersLocally() local
198 for (size_t i = 0, e = locations->GetTempCount(); i < e; ++i) { in AllocateRegistersLocally() local
236 for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { in InitLocations() local
|
| D | register_allocator.cc | 52 for (size_t i = 0, e = graph.GetBlocks().Size(); i < e; ++i) { in CanAllocateRegistersFor() local
215 for (size_t i = 0, e = physical_register_intervals_.Size(); i < e; ++i) { in ValidateInternal() local
244 for (size_t i = 0, e = intervals.Size(); i < e; ++i) { in ValidateIntervals() local
378 for (size_t i = 0, e = inactive_.Size(); i < e; ++i) { in TryAllocateFreeReg() local
388 for (size_t i = 0, e = active_.Size(); i < e; ++i) { in TryAllocateFreeReg() local
446 for (size_t i = 0, e = active_.Size(); i < e; ++i) { in AllocateBlockedReg() local
463 for (size_t i = 0, e = inactive_.Size(); i < e; ++i) { in AllocateBlockedReg() local
502 for (size_t i = 0, e = active_.Size(); i < e; ++i) { in AllocateBlockedReg() local
603 for (size_t e = spill_slots_.Size(); slot < e; ++slot) { in AllocateTwoSpillSlots() local
632 for (size_t e = spill_slots_.Size(); slot < e; ++slot) { in AllocateOneSpillSlot() local
[all …]
|
| D | ssa_liveness_analysis.cc | 175 for (size_t i = 0, e = block->GetSuccessors().Size(); i < e; ++i) { in ComputeLiveRanges() local
205 for (size_t i = 0, e = current->InputCount(); i < e; ++i) { in ComputeLiveRanges() local
218 for (size_t i = 0, e = environment->Size(); i < e; ++i) { in ComputeLiveRanges() local
277 for (size_t i = 0, e = block.GetSuccessors().Size(); i < e; ++i) { in UpdateLiveOut() local
|
| D | find_loops_test.cc | 48 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) { in TEST() local
60 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) { in TEST() local
75 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) { in TEST() local
91 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) { in TEST() local
105 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) { in TEST() local
|
| D | graph_visualizer.cc | 87 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in PrintPredecessors() local
97 for (size_t i = 0, e = block->GetSuccessors().Size(); i < e; ++i) { in PrintSuccessors() local
126 for (size_t i = 0, e = instruction->NumMoves(); i < e; ++i) { in VisitParallelMove() local
|
| D | ssa_type_propagation.cc | 41 for (size_t i = 0, e = phi->InputCount(); i < e; ++i) { in UpdateType() local
|
| D | ssa_test.cc | 67 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) { in ReNumberInstructions() local
91 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) { in TestCode() local
|
| D | ssa_builder.cc | 92 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in VisitBasicBlock() local
|
| D | nodes.cc | 168 for (size_t pred = 0, e = info->GetBackEdges().Size(); pred < e; ++pred) { in SimplifyLoop() local
241 for (size_t i = 0, e = block->GetPredecessors().Size(); i < e; ++i) { in PopulateRecursive() local
|
| D | dominator_test.cc | 36 for (size_t i = 0, e = blocks_length; i < e; ++i) { in TestCode() local
|
| /art/test/404-optimizing-allocator/src/ |
| D | Main.java | 85 int e = 0; in $opt$reg$TestMultipleLive() local
118 int e = 0; in $opt$reg$testSpillInIf() local
129 public static int $opt$reg$TestAgressiveLive1(int a, int b, int c, int d, int e, int f, int g) { in $opt$reg$TestAgressiveLive1()
150 public static int $opt$reg$TestAgressiveLive2(int a, int b, int c, int d, int e, int f, int g) { in $opt$reg$TestAgressiveLive2()
|
| /art/test/405-optimizing-long-allocator/src/ |
| D | Main.java | 91 long e = 0; in $opt$TestMultipleLive() local
124 long e = 0; in $opt$testSpillInIf() local
135 …public static long $opt$TestAgressiveLive1(long a, long b, long c, long d, long e, long f, long g)… in $opt$TestAgressiveLive1()
156 …public static long $opt$TestAgressiveLive2(long a, long b, long c, long d, long e, long f, long g)… in $opt$TestAgressiveLive2()
|
| /art/test/105-invoke/src/ |
| D | Main.java | 35 int virI_IIIII(int a, int b, int c, int d, int e) { in virI_IIIII()
39 int virI_IIIIII(int a, int b, int c, int d, int e, int f) { in virI_IIIIII()
59 static int statI_IIIII(int a, int b, int c, int d, int e) { in statI_IIIII()
63 static int statI_IIIIII(int a, int b, int c, int d, int e, int f) { in statI_IIIIII()
|
| /art/test/401-optimizing-compiler/src/ |
| D | Main.java | 128 static int $opt$TestInvokeWith5Parameters(int a, int b, int c, int d, int e) { in $opt$TestInvokeWith5Parameters()
132 static int $opt$TestInvokeWith7Parameters(int a, int b, int c, int d, int e, int f, int g) { in $opt$TestInvokeWith7Parameters()
176 public static void printStaticMethodWith5Args(int a, int b, int c, int d, int e) { in printStaticMethodWith5Args()
181 public static void printStaticMethodWith7Args(int a, int b, int c, int d, int e, int f, int g) { in printStaticMethodWith7Args()
|
| /art/test/050-sync-test/src/ |
| D | ThreadDeathHandler.java | 29 public void uncaughtException(Thread t, Throwable e) { in uncaughtException()
|
| /art/test/054-uncaught/src/ |
| D | ThreadDeathHandler.java | 29 public void uncaughtException(Thread t, Throwable e) { in uncaughtException()
|
| /art/test/NonStaticLeafMethods/ |
| D | NonStaticLeafMethods.java | 37 int sum(int a, int b, int c, int d, int e) { in sum()
52 double sum(double a, double b, double c, double d, double e) { in sum()
|
| /art/test/StaticLeafMethods/ |
| D | StaticLeafMethods.java | 35 static int sum(int a, int b, int c, int d, int e) { in sum()
50 static double sum(double a, double b, double c, double d, double e) { in sum()
|
| /art/runtime/mirror/ |
| D | art_field.cc | 67 for (int32_t i = 0, e = instance_fields->GetLength(); i < e; ++i) { in FindInstanceFieldWithOffset() local
|
| /art/test/022-interface/src/ |
| D | Main.java | 81 public CharSequence subSequence(int s, int e) { in subSequence()
|
| /art/test/067-preemptive-unpark/src/ |
| D | Main.java | 70 int e = 0; in clearStack() local
|
| /art/test/071-dexfile/src/ |
| D | Main.java | 100 Enumeration<String> e = (Enumeration<String>) DexFile_entries.invoke(dexFile); in testDexFile() local
|
| /art/test/027-arithmetic/src/ |
| D | Main.java | 57 long e = 0x55; in shiftTest2() local
|
| /art/test/106-exceptions2/src/ |
| D | Main.java | 148 Main e = null; in nullCheckTestThrow() local
|
| /art/runtime/ |
| D | stack_map.h | 268 for (size_t i = 0, e = GetNumberOfStackMaps(); i < e; ++i) { in GetStackMapForDexPc() local
280 for (size_t i = 0, e = GetNumberOfStackMaps(); i < e; ++i) { in GetStackMapForNativePc() local
|