/external/libdrm/amdgpu/ |
amdgpu_vamgr.c | 60 struct amdgpu_bo_va_hole *hole, *tmp; local 61 LIST_FOR_EACH_ENTRY_SAFE(hole, tmp, &mgr->va_holes, list) { 62 list_del(&hole->list); 63 free(hole); 72 struct amdgpu_bo_va_hole *hole, *n; local 83 /* first look for a hole */ 84 LIST_FOR_EACH_ENTRY_SAFE(hole, n, &mgr->va_holes, list) { 86 if(hole->offset > base_required || 87 (hole->offset + hole->size) < (base_required + size) 160 struct amdgpu_bo_va_hole *hole; local [all...] |
/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.
|
regress-4388.js | 7 // Tests that TurboFan emits a dynamic hole-check for the temporal dead zone at 22 // Tests that TurboFan emits a dynamic hole-check for the temporal dead zone at
|
regress-3926.js | 9 // Switch statements should disable hole check elimination 11 // Ensure that both reads and writes encounter the hole check 29 // Ensure that hole checks are done even in subordinate scopes 42 // Ensure that inner functions and eval don't skip hole checks
|
regress-4380.js | 19 // Verify that loading the hole doesn't cause deoptimization.
|
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-binop.js | 170 // Assert that the hole is not truncated to nan for string add. 180 // There comes the hole
|
regress-1213575.js | 29 // to pass 'the hole' to a defined setter.
|
regress-234101.js | 32 // was changed to allow special double values (-0, NaN, hole). So we should
|
/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;
|
/system/firewalld/ |
iptables.cc | 140 std::set<Hole>* holes, 152 Hole hole = std::make_pair(port, interface); local 153 if (holes->find(hole) != holes->end()) { 154 // We have already punched a hole for |port| on |interface|. 160 LOG(INFO) << "Punching hole for " << sprotocol << " port " << port 168 // Track the hole we just punched. 169 holes->insert(hole); 176 std::set<Hole>* holes, 183 Hole hole = std::make_pair(port, interface) local [all...] |
/external/v8/test/mjsunit/ |
array-shift4.js | 8 // encounters the hole on the copy step.
|
array-splice.js | 320 // Second hole (at index 3) of array turns into 325 // ... but array[3] and array[7] is actually a hole: 368 // Second hole (at index 3) of array turns into 373 // ... 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].
|
/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 | 179 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN]; 196 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN]; 213 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN]; 234 var array = [0, 'a', true, false, null, /* hole */, undefined, NaN];
|
/external/iproute2/tc/ |
f_flower.c | 312 bool hole = false; local 319 if (hole) 323 hole = true;
|
/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...] |