| /external/v8/test/webkit/ |
| array-holes.js | 30 // Check if we can see through the hole into another room.
44 string += "hole";
76 shouldBe("var a = []; a.length = 1; showHoles(a)", "'[hole]'");
78 shouldBe("var a = []; a[0] = undefined; delete a[0]; showHoles(a)", "'[hole]'");
80 shouldBe("showHoles([0, , 2])", "'[0, hole, 2]'");
81 shouldBe("showHoles([0, 1, ,])", "'[0, 1, hole]'");
82 shouldBe("showHoles([0, , 2].concat([3, , 5]))", "'[0, hole, 2, 3, hole, 5]'");
83 shouldBe("showHoles([0, , 2, 3].reverse())", "'[3, 2, hole, 0]'");
84 shouldBe("a = [0, , 2, 3]; a.shift(); showHoles(a)", "'[hole, 2, 3]'")
[all...] |
| /external/mesa3d/src/gallium/winsys/radeon/drm/ |
| radeon_drm_bo.c | 201 struct radeon_bo_va_hole *hole, *n; local
205 /* first look for a hole */
206 LIST_FOR_EACH_ENTRY_SAFE(hole, n, &mgr->va_holes, list) {
207 offset = hole->offset;
214 if (offset >= (hole->offset + hole->size)) {
217 if (!waste && hole->size == size) {
218 offset = hole->offset;
219 list_del(&hole->list);
220 FREE(hole);
266 struct radeon_bo_va_hole *hole; local
276 struct radeon_bo_va_hole *hole, *n; local
303 struct radeon_bo_va_hole *hole; local
[all...] |
| /external/v8/test/mjsunit/regress/ |
| regress-crbug-233737.js | 35 function hole(i) { function
39 assertEquals(1, hole(0));
40 assertEquals(1, hole(0));
41 %OptimizeFunctionOnNextCall(hole);
42 assertEquals(0, hole(1));
|
| regress-convert-hole2.js | 29 // Test adding undefined from hole in double-holey to string.
42 // Test double-hole going through a phi to a string-add.
61 // Test converting smi-hole to double-hole.
75 // Test converting double-hole to tagged-hole.
|
| consolidated-holey-load.js | 40 assertEquals(undefined, foo(c)); // Elided hole check will leak the hole.
|
| regress-copy-hole-to-field.js | 30 // Copy a hole from HOLEY_DOUBLE to double field.
45 // Copy a hole from HOLEY_SMI to smi field.
|
| regress-1213575.js | 29 // to pass 'the hole' to a defined setter.
|
| regress-binop.js | 170 // Assert that the hole is not truncated to nan for string add.
180 // There comes the hole
|
| regress-234101.js | 32 // was changed to allow special double values (-0, NaN, hole). So we should
|
| regress-123512.js | 31 // elements (which will contain the hole at non-constant positions) will
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| IncludeOverlayTest.java | 54 for (Rectangle hole : holes) {
55 if (hole.contains(x, y)) {
|
| /external/skia/src/core/ |
| SkTSort.h | 31 * Sinks a hole from array[root] to leaf and then sifts the original array[root] element
124 T* hole = next; local
125 while (left < hole && lessThan(insert, *(hole - 1))) {
126 *hole = *(hole - 1);
127 --hole;
129 *hole = insert;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| IncludeOverlay.java | 95 * that the result is a list of rectangles that cover everything that is not a hole.
107 for (Rectangle hole : holes) {
110 if (hole.intersects(r)) {
111 // Clip the hole to fit the rectangle bounds
112 Rectangle h = hole.intersection(r);
|
| /external/v8/test/mjsunit/es6/ |
| array-iterator.js | 167 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN];
184 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN];
201 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN];
222 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN];
|
| /cts/suite/cts/deviceTests/browserbench/assets/octane/ |
| earley-boyer.js | 367 (peephole (hole 2 "parseInt(" x "/" y ")")))
586 (peephole (hole 2 "new sc_Pair(" car ", " cdr ")")))
615 (peephole (hole 2 p ".car = " val)))
622 (peephole (hole 2 p ".cdr = " val)))
1189 (peephole (hole 2 c1 ".val === " c2 ".val")))
1194 (peephole (hole 2 c1 ".val < " c2 ".val")))
1199 (peephole (hole 2 c1 ".val > " c2 ".val")))
1204 (peephole (hole 2 c1 ".val <= " c2 ".val")))
1209 (peephole (hole 2 c1 ".val >= " c2 ".val")))
1214 (peephole (hole 2 c1 ".val.toLowerCase() === " c2 ".val.toLowerCase()"))
[all...] |
| /external/v8/benchmarks/ |
| earley-boyer.js | 367 (peephole (hole 2 "parseInt(" x "/" y ")")))
586 (peephole (hole 2 "new sc_Pair(" car ", " cdr ")")))
615 (peephole (hole 2 p ".car = " val)))
622 (peephole (hole 2 p ".cdr = " val)))
1189 (peephole (hole 2 c1 ".val === " c2 ".val")))
1194 (peephole (hole 2 c1 ".val < " c2 ".val")))
1199 (peephole (hole 2 c1 ".val > " c2 ".val")))
1204 (peephole (hole 2 c1 ".val <= " c2 ".val")))
1209 (peephole (hole 2 c1 ".val >= " c2 ".val")))
1214 (peephole (hole 2 c1 ".val.toLowerCase() === " c2 ".val.toLowerCase()"))
[all...] |
| /external/v8/test/mjsunit/ |
| array-splice.js | 260 // Second hole (at index 3) of array turns into
265 // ... but array[3] and array[7] is actually a hole:
308 // Second hole (at index 3) of array turns into
313 // ... but array[3] and array[7] is actually a hole:
|
| array-elements-from-array-prototype-chain.js | 57 assertEquals(undefined, a.shift(), 'hole should be returned as undefined')
148 // a hole at a0[7]
176 // reifying at7 into a0[8] and keeping a hole at a0[7].
|
| array-elements-from-array-prototype.js | 57 assertEquals(undefined, a.shift(), 'hole should be returned as undefined')
148 // a hole at a0[7]
176 // reifying at7 into a0[8] and keeping a hole at a0[7].
|
| array-elements-from-object-prototype.js | 57 assertEquals(undefined, a.shift(), 'hole should be returned as undefined')
148 // a hole at a0[7]
176 // reifying at7 into a0[8] and keeping a hole at a0[7].
|
| array-sort.js | 281 // expected (inherited) object: [undef1,...undefdepth,hole,1,...,depth,0,hole]
284 // expected result: [0,1,...,depth,undef1,...,undefdepth,undef,hole]
|
| unbox-double-arrays.js | 221 // Test the hole for the default runtime implementation.
229 // Test the keyed load IC implementation when the value is the hole.
253 // Make sure Crankshaft code handles the hole correctly (bailout)
|
| keyed-call-generic.js | 113 testException([zero, one, /* hole */ ], [0, 1, 2], [false, false, true]);
|
| elements-transition.js | 67 // Set the element to an integer but leave a hole at length-7.
|
| /external/squashfs-tools/squashfs-tools/ |
| unsquashfs.c | 875 int write_block(int file_fd, char *buffer, int size, long long hole, int sparse)
877 off_t off = hole;
879 if(hole) {
895 int blocks = (hole + block_size -1) / block_size;
897 for(i = 0; i < blocks; i++, hole -= avail_bytes) {
898 avail_bytes = hole > block_size ? block_size :
899 hole;
2002 long long hole = 0; local
[all...] |
