/external/chromium_org/v8/test/mjsunit/ |
elide-double-hole-check-8.js | 33 var arr = [0.0,,2.5]; variable 34 assertEquals(0.5, f1(arr, 0)); 35 assertEquals(0.5, f1(arr, 0)); 37 assertEquals(0.5, f1(arr, 0)); 40 assertEquals(2, f1(arr, 1));
|
elide-double-hole-check-9.js | 42 var arr = [0.0,,2.5]; variable 43 assertEquals(0.5, f(arr, 0)); 44 assertEquals(0.5, f(arr, 0)); 46 assertEquals(0.5, f(arr, 0)); 48 assertEquals(2, f(arr, 1));
|
/external/chromium_org/v8/test/mjsunit/regress/ |
regress-1849.js | 33 var arr = new Array(count); 34 assertFalse(%HasFastDoubleElements(arr)); 36 arr[i] = 0; 38 assertFalse(%HasFastDoubleElements(arr)); 39 assertTrue(%HasFastSmiElements(arr));
|
regress-100702.js | 39 var arr = [1]; variable 40 arr.forEach("".isThatMe, str); 41 arr.filter("".isThatMe, str); 42 arr.some("".isThatMe, str); 43 arr.every("".isThatMe, str); 44 arr.map("".isThatMe, str);
|
regress-1582.js | 31 var arr; 33 arr = rest; 35 arr = arguments; 37 var i = arr.length; 38 while (--i >= 0) arr[i]; 39 var arrIsArguments = (arr[1] !== rest);
|
/external/v8/test/mjsunit/regress/ |
regress-1849.js | 33 var arr = new Array(count); 34 assertFalse(%HasFastDoubleElements(arr)); 36 arr[i] = 0; 38 assertFalse(%HasFastDoubleElements(arr)); 39 assertTrue(%HasFastSmiOnlyElements(arr));
|
regress-100702.js | 39 var arr = [1]; variable 40 arr.forEach("".isThatMe, str); 41 arr.filter("".isThatMe, str); 42 arr.some("".isThatMe, str); 43 arr.every("".isThatMe, str); 44 arr.map("".isThatMe, str);
|
regress-1582.js | 31 var arr; 33 arr = rest; 35 arr = arguments; 37 var i = arr.length; 38 while (--i >= 0) arr[i]; 39 var arrIsArguments = (arr[1] !== rest);
|
/external/clang/test/CodeGen/ |
aarch64-arguments.c | 118 struct s29 { int arr[4]; }; member in struct:s29 122 struct s30 { int arr[4]; char c;}; member in struct:s30 126 struct s31 { double arr[4]; }; member in struct:s31 130 struct s32 { float arr[5]; }; member in struct:s32 135 struct s33 { float arr[3]; float a; }; member in struct:s33 179 struct s41 { int arr[5]; }; member in struct:s41
|
/external/clang/test/Sema/ |
designated-initializers.c | 158 int arr[10]; member in struct:foo 162 [1] .arr [1] = 2, 163 [4] .arr [2] = 4 168 float *arr[10]; member in struct:bar 173 .f.arr[3] = 1, 174 .arr = { &f }
|
pragma-ms_struct.c | 60 static int arr[sizeof(PackOddity) == 40 ? 1 : -1]; variable
|
/external/jmonkeyengine/engine/src/core/com/jme3/animation/ |
CompactArray.java | 171 * @param arr the array
175 protected float[] ensureCapacity(float[] arr, int size) {
176 if (arr == null) {
178 } else if (arr.length >= size) {
179 return arr;
182 System.arraycopy(arr, 0, tmp, 0, arr.length);
184 //return Arrays.copyOf(arr, size);
|
/libcore/luni/src/main/java/org/apache/harmony/security/provider/cert/ |
Cache.java | 165 * @param arr the byte array containing at least prefix_size leading bytes 169 public long getHash(byte[] arr) { 172 hash += (arr[i] & 0xFF); 314 // @param arr - the array containing at least prefix_size trailing bytes 316 private long getSuffHash(byte[] arr) { 318 for (int i=arr.length-1; i>arr.length - prefix_size; i--) { 319 hash_addon += (arr[i] & 0xFF);
|
/art/runtime/native/ |
dalvik_system_VMDebug.cc | 249 jlong* arr = reinterpret_cast<jlong*>(env->GetPrimitiveArrayCritical(data, 0)); local 250 if (arr == NULL || env->GetArrayLength(data) < 9) { 294 arr[j++] = allocSize; 295 arr[j++] = allocUsed; 296 arr[j++] = allocFree; 297 arr[j++] = zygoteSize; 298 arr[j++] = zygoteUsed; 299 arr[j++] = zygoteFree; 300 arr[j++] = largeObjectsSize; 301 arr[j++] = largeObjectsUsed [all...] |
/dalvik/dexgen/src/com/android/dexgen/dex/code/ |
PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz]; local 99 arr[at] = new PositionList.Entry(insn.getAddress(), pos); 107 result.set(i, arr[i]);
|
/dalvik/dx/src/com/android/dx/dex/code/ |
PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz]; local 99 arr[at] = new PositionList.Entry(insn.getAddress(), pos); 107 result.set(i, arr[i]);
|
/external/chromium_org/v8/test/webkit/ |
sort-randomly.js | 29 var arr = []; 31 arr[i] = i; 32 arr.sort(function() { return 0.5 - Math.random(); }); 41 var arr = []; 43 arr[i] = new RandomObject; 44 arr.sort();
|
/external/clang/test/SemaTemplate/ |
instantiate-self.cpp | 67 typedef int arr[f(T())]; 71 typedef int arr[g(T())]; 83 typedef int arr[g(T())];
|
/external/dexmaker/src/dx/java/com/android/dx/dex/code/ |
PositionList.java | 76 PositionList.Entry[] arr = new PositionList.Entry[sz]; local 99 arr[at] = new PositionList.Entry(insn.getAddress(), pos); 107 result.set(i, arr[i]);
|
/cts/tests/tests/util/src/android/util/cts/ |
EventLogTest.java | 50 Object[] arr = (Object[]) events.get(3).getData(); local 51 assertEquals(3, arr.length); 52 assertEquals(12345, arr[0]); 53 assertEquals(23456L, arr[1]); 54 assertEquals("Test", arr[2]); 122 Object[] arr = (Object[]) events.get(1).getData(); local 123 assertEquals(2, arr.length); 124 assertEquals(12345, arr[0]); 125 assertEquals("NULL", arr[1]);
|
/development/tools/idegen/src/com/android/idegen/ |
ModuleIndexes.java | 60 String[] arr = line.split(":"); 61 if (arr.length < 2) { 65 String makeFile = arr[0]; 66 String moduleName = arr[1];
|
/external/clang/test/CodeGenCXX/ |
global-array-destruction.cpp | 14 S arr[2][1]; variable
|
template-instantiation.cpp | 151 static const int arr[]; member in struct:PR10001::S 160 template <typename T> const int S<T>::arr[] = { 1, 2, foo() }; // possible side effects member in class:PR10001::S 162 template <typename T> const int S<T>::x = sizeof(arr) / sizeof(arr[0]);
|
/external/clang/test/SemaCXX/ |
default-constructor-initializers.cpp | 60 const S arr[2] = { { 42 } }; member in namespace:PR7948
|
i-c-e-cxx.cpp | 66 int arr[nonconst]; // expected-warning {{folded to constant array as an extension}} expected-note {{initializer of 'nonconst' is not a constant expression}} variable
|