| /external/chromium_org/chrome/browser/resources/chromeos/first_run/ |
| background.svg | 5 <rect id="rectangular-hole-pattern" class="hole transparent"/>
6 <circle id="round-hole-pattern" class="hole transparent"/>
|
| first_run.js | 88 this.rectangularHolePattern_ = $('rectangular-hole-pattern');
90 this.roundHolePattern_ = $('round-hole-pattern');
127 * Adds transparent rectangular hole to background.
128 * @param {number} x X coordinate of top-left corner of hole.
129 * @param {number} y Y coordinate of top-left corner of hole.
130 * @param {number} widht Width of hole.
131 * @param {number} height Height of hole.
134 var hole = this.rectangularHolePattern_.cloneNode();
135 hole.setAttribute('x', x);
136 hole.setAttribute('y', y)
[all...] |
| /external/chromium_org/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...] |
| array-holes-expected.txt | 29 PASS var a = []; a.length = 1; showHoles(a) is '[hole]'
31 PASS var a = []; a[0] = undefined; delete a[0]; showHoles(a) is '[hole]'
32 PASS showHoles([0, , 2]) is '[0, hole, 2]'
33 PASS showHoles([0, 1, ,]) is '[0, 1, hole]'
34 PASS showHoles([0, , 2].concat([3, , 5])) is '[0, hole, 2, 3, hole, 5]'
35 PASS showHoles([0, , 2, 3].reverse()) is '[3, 2, hole, 0]'
36 PASS a = [0, , 2, 3]; a.shift(); showHoles(a) is '[hole, 2, 3]'
37 PASS showHoles([0, , 2, 3].slice(0, 3)) is '[0, hole, 2]'
38 PASS showHoles([0, , 2, 3].sort()) is '[0, 2, 3, hole]'
[all...] |
| /external/chromium_org/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.
|
| /external/chromium_org/third_party/mesa/src/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/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/chromium_org/ui/base/cocoa/ |
| underlay_opengl_hosting_window.h | 13 // the window. Contains methods relating to hole punching so that the OpenGL
|
| /external/chromium_org/third_party/WebKit/ManualTests/ |
| inline-input-marking.html | 19 <p>This tests that the underlining of the inline input hole does not obscure the glyphs.</p>
24 <li>As you do so, check that glyphs in the inline hole are clearly readable</li>
|
| /external/chromium/chrome/browser/ui/cocoa/ |
| chrome_browser_window.h | 14 // theming and hole punching that are shared between framed and fullscreen
|
| fullscreen_window.h | 10 // FullscreenWindow derives from ChromeBrowserWindow to inherit hole punching,
|
| /external/chromium_org/chrome/browser/ui/cocoa/ |
| fullscreen_window.h | 10 // FullscreenWindow derives from ChromeBrowserWindow to inherit hole punching,
|
| /packages/wallpapers/Galaxy4/res/values/ |
| strings.xml | 18 <string name="wallpaper_label">Black Hole</string>
|
| /external/chromium_org/third_party/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;
|
| /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;
|
| /dalvik/vm/ |
| IndirectRefTable.cpp | 75 * the right spot. If there's a hole, find it and fill it; otherwise,
83 /* find the first hole; likely to be near the end of the list,
84 * we know the item at the topIndex is not a hole */
202 * and zap the corresponding entry, leaving a hole if it's not at the top.
269 ALOGV("+++ checking for hole at %d (cookie=0x%08x) val=%p",
274 ALOGV("+++ ate hole at %d", topIndex-1);
285 * Not the top-most entry. This creates a hole. We NULL out the
287 * the hole count.
291 ALOGV("+++ left hole at %d, holes=%d", index, segmentState.parts.numHoles);
|
| /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);
|
| /art/runtime/ |
| indirect_reference_table.cc | 122 // the right spot. If there's a hole, find it and fill it; otherwise,
128 // Find the first hole; likely to be near the end of the list.
211 // and zap the corresponding entry, leaving a hole if it's not at the top.
270 LOG(INFO) << "+++ checking for hole at " << topIndex-1
277 LOG(INFO) << "+++ ate hole at " << (topIndex - 1);
290 // Not the top-most entry. This creates a hole. We NULL out the
292 // the hole count.
304 LOG(INFO) << "+++ left hole at " << idx << ", holes=" << segment_state_.parts.numHoles;
|
| /external/chromium_org/chrome/browser/ui/webui/chromeos/first_run/ |
| first_run_actor.h | 77 // Adds rectangular hole to background with given position and dimensions.
80 // Adds round hole to background with given position and dimensions.
|
| /external/chromium_org/content/browser/loader/ |
| resource_buffer_unittest.cc | 75 // Create hole at the beginnning. Next allocation should go there.
132 // Still full, even if there is a small hole at the end.
|
| /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)) {
|
| /device/google/accessory/demokit/hardware/fab/shield/ |
| README.txt | 37 Through-hole leads should be trimmed flush.
|
