Move GrowthLimit to a run-test.

Change-Id: I33853625e095f35cc0cf6310c5e4401980322623

3 files changed, 64 insertions, 0 deletions

diff --git a/test/104-growth-limit/expected.txt b/test/104-growth-limit/expected.txt
new file mode 100644
index 0000000..f75da10
--- /dev/null
+++ b/test/104-growth-limit/expected.txt
@@ -0,0 +1 @@
+Test complete
diff --git a/test/104-growth-limit/info.txt b/test/104-growth-limit/info.txt
new file mode 100644
index 0000000..adef4ed
--- /dev/null
+++ b/test/104-growth-limit/info.txt
@@ -0,0 +1,3 @@
+Tests that the growth limit, used to impose the small and large Android
+conventions, can be cleared and the resulting heap is at least as large
+as the growth limited heap.
diff --git a/test/104-growth-limit/src/Main.java b/test/104-growth-limit/src/Main.java
new file mode 100644
index 0000000..55469db
--- /dev/null
+++ b/test/104-growth-limit/src/Main.java
@@ -0,0 +1,60 @@
+/*
+ * Copyright (C) 2011 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ *      http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+import java.lang.reflect.Method;
+import java.util.ArrayList;
+import java.util.List;
+
+public class Main {
+
+    public static void main(String[] args) throws Exception {
+
+        int alloc1 = 1;
+        try {
+            List<byte[]> l = new ArrayList<byte[]>();
+            while (true) {
+                // Allocate a MB at a time
+                l.add(new byte[1048576]);
+                alloc1++;
+            }
+        } catch (OutOfMemoryError e) {
+        }
+        // Expand the heap to the maximum size.
+        // Reflective equivalent of: dalvik.system.VMRuntime.getRuntime().clearGrowthLimit();
+        Class<?> vm_runtime = Class.forName("dalvik.system.VMRuntime");
+        Method get_runtime = vm_runtime.getDeclaredMethod("getRuntime");
+        Object runtime = get_runtime.invoke(null);
+        Method clear_growth_limit = vm_runtime.getDeclaredMethod("clearGrowthLimit");
+        clear_growth_limit.invoke(runtime);
+
+        int alloc2 = 1;
+        try {
+            List<byte[]> l = new ArrayList<byte[]>();
+            while (true) {
+                // Allocate a MB at a time
+                l.add(new byte[1048576]);
+                alloc2++;
+            }
+        } catch (OutOfMemoryError e2) {
+            if (alloc1 > alloc2) {
+                System.out.println("ERROR: Allocated less memory after growth" +
+                    "limit cleared (" + alloc1 + " MBs > " + alloc2 + " MBs");
+                System.exit(1);
+            }
+        }
+        System.out.println("Test complete");
+    }
+}