| /prebuilts/ndk/android-ndk-r7/platforms/android-14/arch-arm/usr/include/asm/ |
| memory.h | 67 #define arch_adjust_zones(node,size,holes) do { } while (0)
|
| /prebuilts/ndk/android-ndk-r7/platforms/android-3/arch-arm/usr/include/asm/ |
| memory.h | 67 #define arch_adjust_zones(node,size,holes) do { } while (0)
|
| /prebuilts/ndk/android-ndk-r7/platforms/android-4/arch-arm/usr/include/asm/ |
| memory.h | 67 #define arch_adjust_zones(node,size,holes) do { } while (0)
|
| /prebuilts/ndk/android-ndk-r7/platforms/android-5/arch-arm/usr/include/asm/ |
| memory.h | 67 #define arch_adjust_zones(node,size,holes) do { } while (0)
|
| /prebuilts/ndk/android-ndk-r7/platforms/android-8/arch-arm/usr/include/asm/ |
| memory.h | 67 #define arch_adjust_zones(node,size,holes) do { } while (0)
|
| /prebuilts/ndk/android-ndk-r7/platforms/android-9/arch-arm/usr/include/asm/ |
| memory.h | 67 #define arch_adjust_zones(node,size,holes) do { } while (0)
|
| /dalvik/vm/test/ |
| TestIndirectRefTable.cpp | 197 * is still 4 (i.e. holes are getting filled). Remove #1 and #3, verify
322 irt.dump("table with 20 entries, 19 of them holes");
323 /* because of removal order, should have 20 entries, 19 of them holes */
325 ALOGE("Expected %d entries (with holes), found %d",
|
| /external/iptables/extensions/ |
| libipt_NETMAP.c | 42 return -1; /* holes in netmask */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
| cramfs_fs.h | 74 #define CRAMFS_FLAG_HOLES 0x00000100 /* support for holes */
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| cramfs_fs.h | 74 #define CRAMFS_FLAG_HOLES 0x00000100 /* support for holes */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
| cramfs_fs.h | 74 #define CRAMFS_FLAG_HOLES 0x00000100 /* support for holes */
|
| /external/genext2fs/ |
| genext2fs.8 | 75 .BI "\-z, \-\-allow\-holes"
76 Make files with holes.
|
| /bionic/libc/kernel/arch-arm/asm/ |
| memory.h | 70 #define arch_adjust_zones(node,size,holes) do { } while (0)
|
| /external/dbus/test/name-test/ |
| tmp-session-like-system.conf | 26 <!-- Holes must be punched in service configuration files for
|
| /external/v8/test/mjsunit/ |
| array-splice.js | 28 // Check that splicing array of holes keeps it as array of holes
244 // Now check the case with array of holes and some elements on prototype.
294 // Now check the case with array of holes and some elements on prototype.
|
| array-indexing.js | 67 // Find undefined, not holes.
134 // Find undefined, not holes.
|
| array-elements-from-array-prototype.js | 93 // Slice must keep intact a and reify holes at indices 0--2 and 4--6.
|
| /external/valgrind/main/none/tests/x86-linux/ |
| seg_override.c | 93 /* stop valgrind yelping about initialised holes in this struct. */
|
| /external/chromium/chrome/browser/extensions/ |
| extension_toolbar_model.cc | 169 // have holes.
171 // 3. Remove holes from the sorted vector and append the unsorted vector.
|
| /dalvik/vm/ |
| IndirectRefTable.cpp | 265 // Top-most entry. Scan up and consume holes.
291 ALOGV("+++ left hole at %d, holes=%d", index, segmentState.parts.numHoles);
|
| /external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
| TryListBuilder.java | 198 list. We also need to create a new range for any "holes" in the existing ranges*/
332 list. We also need to create a new range for any "holes" in the existing ranges*/
|
| /external/webkit/Source/WebKit2/WebProcess/WebPage/ |
| FindController.cpp | 307 // Draw white frames around the holes.
319 // Clear out the holes.
|
| /libcore/luni/src/test/java/org/apache/harmony/security/tests/java/security/ |
| SecureRandom2Test.java | 301 * as it tends to be error prone and open up security holes.
328 * be error prone and open up security holes. See {@link SecureRandom}
|
| /external/qemu/distrib/sdl-1.2.12/src/video/quartz/ |
| SDL_QuartzWindow.m | 68 /* make the alpha channel opaque so anim won't have holes in it */
|
| /external/v8/src/ |
| objects-debug.cc | 796 int holes = 0; local
801 if (e->get(i) == heap->the_hole_value()) holes++;
803 info->number_of_fast_used_elements_ += len - holes;
804 info->number_of_fast_unused_elements_ += holes;
|
