| /external/elfutils/libasm/ |
| asm_addint16.c | 15 #define SIZE 16
|
| asm_addint32.c | 15 #define SIZE 32
|
| asm_addint64.c | 15 #define SIZE 64
|
| asm_adduint16.c | 15 #define SIZE 16
|
| asm_adduint32.c | 15 #define SIZE 32
|
| asm_adduint64.c | 15 #define SIZE 64
|
| asm_adduint8.c | 21 #ifndef SIZE
22 # define SIZE 8
25 #define UFCT(size) _UFCT(size)
26 #define _UFCT(size) asm_adduint##size
27 #define FCT(size) _FCT(size)
28 #define _FCT(size) asm_addint##size
[all...] |
| asm_addint8.c | 26 #ifndef SIZE
27 # define SIZE 8
30 #define FCT(size) _FCT(size)
31 #define _FCT(size) asm_addint##size
32 #define TYPE(size) _TYPE(size)
33 #define _TYPE(size) int##size##_
[all...] |
| /external/webkit/WebCore/platform/graphics/win/ |
| IntSizeWin.cpp | 33 IntSize::IntSize(const SIZE& s)
39 IntSize::operator SIZE() const
41 SIZE s = {m_width, m_height};
|
| /frameworks/base/core/java/android/provider/ |
| OpenableColumns.java | 36 public static final String SIZE = "_size";
|
| /system/extras/ext4_utils/ |
| mkuserimg.sh | 8 mkuserimg.sh SRC_DIR OUTPUT_FILE EXT_VARIANT MOUNT_POINT SIZE
28 SIZE=$5
40 if [ -z $SIZE ]; then
41 SIZE=128M
44 echo "make_ext4fs -l $SIZE -a $MOUNT_POINT $OUTPUT_FILE $SRC_DIR"
45 make_ext4fs -s -l $SIZE -a $MOUNT_POINT $OUTPUT_FILE $SRC_DIR
|
| /external/bluetooth/glib/tests/ |
| qsort-test.c | 6 #define SIZE 100000
8 guint32 array[SIZE];
21 for (i = 0; i < SIZE; i++)
24 g_qsort_with_data (array, SIZE, sizeof (guint32), sort, NULL);
26 for (i = 0; i < SIZE - 1; i++)
|
| /frameworks/base/core/tests/coretests/src/android/database/ |
| DatabasePerformanceTests.java | 197 private static final int SIZE = 1000;
199 private String[] statements = new String[SIZE];
206 for (int i = 0; i < SIZE; i++) {
219 for (int i = 0; i < SIZE; i++) {
230 private static final int SIZE = 1000;
232 private String[] statements = new String[SIZE];
239 for (int i = 0; i < SIZE; i++) {
253 for (int i = 0; i < SIZE; i++) {
264 private static final int SIZE = 100;
267 private String[] where = new String[SIZE];
[all...] |
| NewDatabasePerformanceTests.java | 108 private static final int SIZE = 10 * kMultiplier;
110 private String[] statements = new String[SIZE];
117 for (int i = 0; i < SIZE; i++) {
129 for (int i = 0; i < SIZE; i++) {
140 private static final int SIZE = 10 * kMultiplier;
142 private String[] statements = new String[SIZE];
149 for (int i = 0; i < SIZE; i++) {
162 for (int i = 0; i < SIZE; i++) {
173 private static final int SIZE = 1 * kMultiplier;
176 private String[] where = new String[SIZE];
[all...] |
| /libcore/luni/src/test/java/tests/api/java/util/concurrent/ |
| PriorityQueueTest.java | 28 * Create a queue of given size containing consecutive
39 assertEquals(n, q.size());
47 assertEquals(0, new PriorityQueue(SIZE).size());
75 Integer[] ints = new Integer[SIZE];
86 Integer[] ints = new Integer[SIZE];
87 for (int i = 0; i < SIZE-1; ++i)
98 Integer[] ints = new Integer[SIZE];
99 for (int i = 0; i < SIZE; ++i)
102 for (int i = 0; i < SIZE; ++i
[all...] |
| ConcurrentLinkedQueueTest.java | 22 * Create a queue of given size containing consecutive
31 assertEquals(n, q.size());
39 assertEquals(0, new ConcurrentLinkedQueue().size());
57 Integer[] ints = new Integer[SIZE];
68 Integer[] ints = new Integer[SIZE];
69 for (int i = 0; i < SIZE-1; ++i)
80 Integer[] ints = new Integer[SIZE];
81 for (int i = 0; i < SIZE; ++i)
84 for (int i = 0; i < SIZE; ++i)
103 * size changes when elements added and remove
[all...] |
| ArrayBlockingQueueTest.java | 23 * Create a queue of given size containing consecutive
33 assertEquals(n, q.size());
41 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity());
69 Integer[] ints = new Integer[SIZE];
70 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
80 Integer[] ints = new Integer[SIZE];
81 for (int i = 0; i < SIZE-1; ++i)
83 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints));
93 Integer[] ints = new Integer[SIZE];
[all...] |
| AtomicIntegerArrayTest.java | 23 * constructor creates array of given size with all elements zero
26 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE);
27 for (int i = 0; i < SIZE; ++i)
43 * constructor with array is of same size and has all elements
57 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE);
59 ai.get(SIZE);
69 ai.set(SIZE, 0);
84 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE);
85 for (int i = 0; i < SIZE; ++i) {
99 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE);
[all...] |
| AtomicLongArrayTest.java | 22 * constructor creates array of given size with all elements zero
25 AtomicLongArray ai = new AtomicLongArray(SIZE);
26 for (int i = 0; i < SIZE; ++i)
42 * constructor with array is of same size and has all elements
56 AtomicLongArray ai = new AtomicLongArray(SIZE);
58 ai.get(SIZE);
68 ai.set(SIZE, 0);
83 AtomicLongArray ai = new AtomicLongArray(SIZE);
84 for (int i = 0; i < SIZE; ++i) {
98 AtomicLongArray ai = new AtomicLongArray(SIZE);
[all...] |
| LinkedBlockingQueueTest.java | 24 * Create a queue of given size containing consecutive
34 assertEquals(n, q.size());
43 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity());
72 Integer[] ints = new Integer[SIZE];
83 Integer[] ints = new Integer[SIZE];
84 for (int i = 0; i < SIZE-1; ++i)
95 Integer[] ints = new Integer[SIZE];
96 for (int i = 0; i < SIZE; ++i)
99 for (int i = 0; i < SIZE; ++i
[all...] |
| LinkedBlockingDequeTest.java | 21 * Create a deque of given size containing consecutive
31 assertEquals(n, q.size());
50 * size changes when elements added and removed
53 LinkedBlockingDeque q = populatedDeque(SIZE);
54 for (int i = 0; i < SIZE; ++i) {
55 assertEquals(SIZE-i, q.size());
58 for (int i = 0; i < SIZE; ++i) {
59 assertEquals(i, q.size());
97 LinkedBlockingDeque q = populatedDeque(SIZE);
[all...] |
| ArrayDequeTest.java | 19 * Create a queue of given size containing consecutive
28 assertEquals(n, q.size());
36 assertEquals(0, new ArrayDeque().size());
54 Integer[] ints = new Integer[SIZE];
55 for (int i = 0; i < SIZE; ++i)
58 for (int i = 0; i < SIZE; ++i)
77 * size changes when elements added and removed
80 ArrayDeque q = populatedDeque(SIZE);
81 for (int i = 0; i < SIZE; ++i) {
82 assertEquals(SIZE-i, q.size())
[all...] |
| PriorityBlockingQueueTest.java | 32 * Create a queue of given size containing consecutive
44 assertEquals(n, q.size());
52 assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity());
80 Integer[] ints = new Integer[SIZE];
91 Integer[] ints = new Integer[SIZE];
92 for (int i = 0; i < SIZE-1; ++i)
103 Integer[] ints = new Integer[SIZE];
104 for (int i = 0; i < SIZE; ++i)
107 for (int i = 0; i < SIZE; ++i)
116 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp)
306 final int size = 4; local
315 assertEquals(q.size(), size); local
[all...] |
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.0/lib/gcc/arm-eabi/4.4.0/plugin/include/config/arm/ |
| unknown-elf.h | 60 #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \
72 ASM_OUTPUT_SKIP (FILE, SIZE ? (int)(SIZE) : 1); \
77 #define ASM_OUTPUT_ALIGNED_DECL_LOCAL(FILE, DECL, NAME, SIZE, ALIGN) \
87 fprintf (FILE, "\t.space\t%d\n", SIZE ? (int)(SIZE) : 1); \
|
| /prebuilt/linux-x86/toolchain/arm-eabi-4.4.3/lib/gcc/arm-eabi/4.4.3/plugin/include/config/arm/ |
| unknown-elf.h | 60 #define ASM_OUTPUT_ALIGNED_BSS(FILE, DECL, NAME, SIZE, ALIGN) \
72 ASM_OUTPUT_SKIP (FILE, SIZE ? (int)(SIZE) : 1); \
77 #define ASM_OUTPUT_ALIGNED_DECL_LOCAL(FILE, DECL, NAME, SIZE, ALIGN) \
87 fprintf (FILE, "\t.space\t%d\n", SIZE ? (int)(SIZE) : 1); \
|
