/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";
|
/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++)
|
list-test.c | 11 #define SIZE 50 16 static guint32 array[SIZE]; 41 for (i = 0; i < SIZE; i++) { 46 for (i = 0; i < SIZE - 1; i++) { 67 for (i = 0; i < SIZE; i++) { 72 for (i = 0; i < SIZE - 1; i++) { 93 for (i = 0; i < SIZE; i++) { 97 for (i = 0; i < SIZE - 1; i++) { 118 for (i = 0; i < SIZE; i++) { 125 for (i = 0; i < SIZE - 1; i++) [all...] |
/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...] |
/dalvik/libcore/concurrent/src/test/java/tests/api/java/util/concurrent/ |
PriorityQueueTest.java | 35 * Create a queue of given size containing consecutive 46 assertEquals(n, q.size()); 54 assertEquals(0, new PriorityQueue(SIZE).size()); 84 Integer[] ints = new Integer[SIZE]; 96 Integer[] ints = new Integer[SIZE]; 97 for (int i = 0; i < SIZE-1; ++i) 110 Integer[] ints = new Integer[SIZE]; 111 for (int i = 0; i < SIZE; ++i) 114 for (int i = 0; i < SIZE; ++i [all...] |
ConcurrentLinkedQueueTest.java | 27 * Create a queue of given size containing consecutive 36 assertEquals(n, q.size()); 44 assertEquals(0, new ConcurrentLinkedQueue().size()); 63 Integer[] ints = new Integer[SIZE]; 75 Integer[] ints = new Integer[SIZE]; 76 for (int i = 0; i < SIZE-1; ++i) 89 Integer[] ints = new Integer[SIZE]; 90 for (int i = 0; i < SIZE; ++i) 93 for (int i = 0; i < SIZE; ++i) 114 * size changes when elements added and remove [all...] |
ArrayBlockingQueueTest.java | 25 * Create a queue of given size containing consecutive 35 assertEquals(n, q.size()); 43 assertEquals(SIZE, new ArrayBlockingQueue(SIZE).remainingCapacity()); 73 Integer[] ints = new Integer[SIZE]; 74 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); 85 Integer[] ints = new Integer[SIZE]; 86 for (int i = 0; i < SIZE-1; ++i) 88 ArrayBlockingQueue q = new ArrayBlockingQueue(SIZE, false, Arrays.asList(ints)); 99 Integer[] ints = new Integer[SIZE]; [all...] |
LinkedBlockingQueueTest.java | 28 * Create a queue of given size containing consecutive 38 assertEquals(n, q.size()); 47 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity()); 78 Integer[] ints = new Integer[SIZE]; 90 Integer[] ints = new Integer[SIZE]; 91 for (int i = 0; i < SIZE-1; ++i) 104 Integer[] ints = new Integer[SIZE]; 105 for (int i = 0; i < SIZE; ++i) 108 for (int i = 0; i < SIZE; ++i [all...] |
AtomicIntegerArrayTest.java | 27 * constructor creates array of given size with all elements zero 30 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE); 31 for (int i = 0; i < SIZE; ++i) 49 * constructor with array is of same size and has all elements 63 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE); 65 ai.get(SIZE); 73 ai.set(SIZE, 0); 86 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE); 87 for (int i = 0; i < SIZE; ++i) { 101 AtomicIntegerArray ai = new AtomicIntegerArray(SIZE); [all...] |
AtomicLongArrayTest.java | 25 * constructor creates array of given size with all elements zero 28 AtomicLongArray ai = new AtomicLongArray(SIZE); 29 for (int i = 0; i < SIZE; ++i) 47 * constructor with array is of same size and has all elements 61 AtomicLongArray ai = new AtomicLongArray(SIZE); 63 ai.get(SIZE); 71 ai.set(SIZE, 0); 84 AtomicLongArray ai = new AtomicLongArray(SIZE); 85 for (int i = 0; i < SIZE; ++i) { 99 AtomicLongArray ai = new AtomicLongArray(SIZE); [all...] |
PriorityBlockingQueueTest.java | 38 * Create a queue of given size containing consecutive 50 assertEquals(n, q.size()); 58 assertEquals(NOCAP, new PriorityBlockingQueue(SIZE).remainingCapacity()); 88 Integer[] ints = new Integer[SIZE]; 100 Integer[] ints = new Integer[SIZE]; 101 for (int i = 0; i < SIZE-1; ++i) 114 Integer[] ints = new Integer[SIZE]; 115 for (int i = 0; i < SIZE; ++i) 118 for (int i = 0; i < SIZE; ++i) 130 PriorityBlockingQueue q = new PriorityBlockingQueue(SIZE, cmp) [all...] |
LinkedListTest.java | 25 * Create a queue of given size containing consecutive 34 assertEquals(n, q.size()); 42 assertEquals(0, new LinkedList().size()); 62 Integer[] ints = new Integer[SIZE]; 63 for (int i = 0; i < SIZE; ++i) 66 for (int i = 0; i < SIZE; ++i) 87 * size changes when elements added and removed 90 LinkedList q = populatedQueue(SIZE); 91 for (int i = 0; i < SIZE; ++i) { 92 assertEquals(SIZE-i, q.size()) [all...] |
DelayQueueTest.java | 118 * Create a queue of given size containing consecutive 130 assertEquals(n, q.size()); 157 PDelay[] ints = new PDelay[SIZE]; 169 PDelay[] ints = new PDelay[SIZE]; 170 for (int i = 0; i < SIZE-1; ++i) 183 PDelay[] ints = new PDelay[SIZE]; 184 for (int i = 0; i < SIZE; ++i) 187 for (int i = 0; i < SIZE; ++i) 210 * but size does 213 DelayQueue q = populatedQueue(SIZE); [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); \
|
/cts/tests/tests/database/src/android/database/cts/ |
CursorIndexOutOfBoundsExceptionTest.java | 45 int SIZE = 99; 47 String expected2 = "Index " + INDEX + " requested, with a size of " + SIZE; 63 throw new CursorIndexOutOfBoundsException(INDEX, SIZE);
|