| /libcore/jsr166-tests/src/test/java/jsr166/ |
| AtomicLongArrayTest.java | 29 * constructor creates array of given size with all elements zero
32 AtomicLongArray aa = new AtomicLongArray(SIZE);
33 for (int i = 0; i < SIZE; i++)
49 * constructor with array is of same size and has all elements
63 AtomicLongArray aa = new AtomicLongArray(SIZE);
64 for (int index : new int[] { -1, SIZE }) {
100 AtomicLongArray aa = new AtomicLongArray(SIZE);
101 for (int i = 0; i < SIZE; i++) {
115 AtomicLongArray aa = new AtomicLongArray(SIZE);
116 for (int i = 0; i < SIZE; i++)
[all...] |
| LinkedListTest.java | 32 * Returns a new queue of given size containing consecutive
41 assertEquals(n, q.size());
49 assertEquals(0, new LinkedList().size());
66 Integer[] ints = new Integer[SIZE];
67 for (int i = 0; i < SIZE; ++i)
70 for (int i = 0; i < SIZE; ++i)
89 * size changes when elements added and removed
92 LinkedList q = populatedQueue(SIZE);
93 for (int i = 0; i < SIZE; ++i) {
94 assertEquals(SIZE - i, q.size())
[all...] |
| LinkedBlockingDequeTest.java | 37 return new LinkedBlockingDeque(SIZE);
54 * Returns a new deque of given size containing consecutive
65 assertEquals(n, q.size());
84 * size changes when elements added and removed
87 LinkedBlockingDeque q = populatedDeque(SIZE);
88 for (int i = 0; i < SIZE; ++i) {
89 assertEquals(SIZE - i, q.size());
92 for (int i = 0; i < SIZE; ++i) {
93 assertEquals(i, q.size());
[all...] |
| LinkedBlockingQueueTest.java | 40 // return new LinkedBlockingQueue(SIZE);
57 * Returns a new queue of given size containing consecutive
68 assertEquals(n, q.size());
77 assertEquals(SIZE, new LinkedBlockingQueue(SIZE).remainingCapacity());
105 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
117 Integer[] ints = new Integer[SIZE];
118 for (int i = 0; i < SIZE - 1; ++i)
131 Integer[] ints = new Integer[SIZE];
132 for (int i = 0; i < SIZE; ++i
[all...] |
| ArrayDequeTest.java | 33 * Returns a new deque of given size containing consecutive
42 assertEquals(n, q.size());
50 assertEquals(0, new ArrayDeque().size());
68 new ArrayDeque(Arrays.asList(new Integer[SIZE]));
77 Integer[] ints = new Integer[SIZE];
78 for (int i = 0; i < SIZE - 1; ++i)
90 Integer[] ints = new Integer[SIZE];
91 for (int i = 0; i < SIZE; ++i)
94 for (int i = 0; i < SIZE; ++i)
113 * size changes when elements added and remove
633 int size = q.size(); local
666 int size = q.size(); local
[all...] |
| ConcurrentLinkedDequeTest.java | 36 * Returns a new deque of given size containing consecutive
45 assertEquals(n, q.size());
54 assertEquals(0, new ConcurrentLinkedDeque().size());
72 new ConcurrentLinkedDeque(Arrays.asList(new Integer[SIZE]));
81 Integer[] ints = new Integer[SIZE];
82 for (int i = 0; i < SIZE - 1; ++i)
94 Integer[] ints = new Integer[SIZE];
95 for (int i = 0; i < SIZE; ++i)
98 for (int i = 0; i < SIZE; ++i)
117 * size() changes when elements added and remove
[all...] |
| ConcurrentHashMap8Test.java | 52 assertEquals(5, map.size());
173 assertEquals(n, a.size());
183 assertEquals(elements.length, a.size());
219 assertEquals(set2.size(), map.size());
220 assertEquals(set1.size(), map.size());
236 assertEquals(6, full.size());
238 assertEquals(6, full.size());
249 assertEquals(5, full.size());
404 int size = 20; local
500 int size = 20; local
519 int size = 20; local
553 int size = 20; local
[all...] |
| LinkedTransferQueueTest.java | 62 * Constructor builds new queue with size being zero and empty
66 assertEquals(0, new LinkedTransferQueue().size());
86 Collection<Integer> elements = Arrays.asList(new Integer[SIZE]);
98 Integer[] ints = new Integer[SIZE];
99 for (int i = 0; i < SIZE - 1; ++i)
112 Integer[] ints = new Integer[SIZE];
113 for (int i = 0; i < SIZE; ++i) {
119 assertEquals(q.size(), intList.size());
125 assertTrue(Arrays.equals(q.toArray(new Object[SIZE]),
[all...] |
| DelayQueueTest.java | 136 * Returns a new queue of given size containing consecutive
148 assertEquals(n, q.size());
174 new DelayQueue(Arrays.asList(new PDelay[SIZE]));
183 PDelay[] a = new PDelay[SIZE];
184 for (int i = 0; i < SIZE - 1; ++i)
196 PDelay[] ints = new PDelay[SIZE];
197 for (int i = 0; i < SIZE; ++i)
200 for (int i = 0; i < SIZE; ++i)
223 BlockingQueue q = populatedQueue(SIZE);
224 for (int i = 0; i < SIZE; ++i)
[all...] |
| /cts/hostsidetests/security/securityPatch/Bug-33039685/ |
| poc.c | 32 #define SIZE 64
36 ret = write(fd, str, SIZE);
55 char buf[SIZE] = {0};
66 char buf[SIZE] = {0};
79 char buf[SIZE] = {0};
92 char buf[SIZE] = {0};
|
| /external/toybox/scripts/ |
| bloatcheck | 42 SIZE=$(printf "%d" "0x$b")
45 OLD=$(($OLD+$SIZE))
46 SIZE=$((-1*$SIZE))
48 NEW=$(($NEW+$SIZE))
50 DELTA=$(($DELTA+$SIZE))
64 nm --size-sort "$1" | sort -k3,3 > $DIFF1
65 nm --size-sort "$2" | sort -k3,3 > $DIFF2
|
| /external/okhttp/okio/okio/src/test/java/okio/ |
| RealBufferedSourceTest.java | 36 source.writeUtf8(repeat('b', Segment.SIZE));
41 assertEquals(Segment.SIZE + 2, source.size());
45 assertEquals(Segment.SIZE - 1, in.available());
46 assertEquals(2, source.size());
49 byte[] data = new byte[Segment.SIZE * 2];
50 assertEquals(Segment.SIZE - 1, in.read(data, 0, data.length));
51 assertEquals(repeat('b', Segment.SIZE - 1), new String(data, 0, Segment.SIZE - 1, UTF_8));
52 assertEquals(2, source.size());
[all...] |
| BufferTest.java | 43 assertEquals(2, buffer.size());
45 assertEquals(6, buffer.size());
47 assertEquals(2, buffer.size());
49 assertEquals(0, buffer.size());
64 buffer.writeUtf8(repeat('a', Segment.SIZE * 4));
65 assertEquals(Segment.SIZE * 4, buffer.completeSegmentByteCount());
70 buffer.writeUtf8(repeat('a', Segment.SIZE * 4 - 10));
71 assertEquals(Segment.SIZE * 3, buffer.completeSegmentByteCount());
76 assertEquals("Buffer[size=0]", buffer.toString());
82 assertEquals("Buffer[size=16 data=a1b2c3d4e5f61a2b3c4d5e6f10203040]", buffer.toString())
141 int size = (Segment.SIZE \/ 2) - 1; local
147 int size = (Segment.SIZE \/ 2) + 1; local
153 int size = 3 * Segment.SIZE + 1; local
[all...] |
| /frameworks/compile/mclinker/include/mcld/LD/ |
| ELFObjectWriter.h | 50 template <size_t SIZE>
59 template <size_t SIZE>
65 template <size_t SIZE>
84 template <size_t SIZE>
90 template <size_t SIZE>
96 template <size_t SIZE>
106 template <size_t SIZE>
|
| /prebuilts/misc/common/swig/include/2.0.11/typemaps/ |
| cstrings.swg | 17 /* %cstring_input_binary(TYPEMAP, SIZE)
20 * a size. For example:
22 * %cstring_input_binary(Char *buff, int size);
23 * void foo(Char *buff, int size) {
28 %define Name ## _input_binary(TYPEMAP, SIZE)
29 %typemap(in,noblock=1,fragment=#SWIG_AsCharPtrAndSize) (TYPEMAP, SIZE)
30 (int res, Char *buf = 0, size_t size = 0, int alloc = 0) {
31 res = SWIG_AsCharPtrAndSize($input, &buf, &size, &alloc);
33 %argument_fail(res, "(TYPEMAP, SIZE)", $symname, $argnum);
36 $2 = ($2_ltype) size - 1;
[all...] |
| /hardware/intel/common/utils/ituxd/jni/ |
| thermalJNI.cpp | 38 static int readFromFile(const char *path, char* buf, size_t size, bool throwError)
51 ssize_t count = read(fd, buf, size);
66 const int SIZE = 20;
68 char value[SIZE];
79 len = snprintf(value, SIZE, "%d\n", val);
88 const int SIZE = 128;
89 char buf[SIZE];
90 char full_path[SIZE];
94 snprintf(full_path, SIZE, "%s%d/type", base_path, count);
100 if (readFromFile(full_path, buf, SIZE, false) < 0) break
[all...] |
| /test/vts-testcase/security/poc/target/kernel_sound/28838221/ |
| poc.cpp | 13 #define SIZE 32
25 char buf[SIZE] = {0};
35 ret = write(fd, buf, SIZE);
|
| /system/extras/ext4_utils/ |
| mkuserimg_mke2fs.sh | 8 mkuserimg.sh [-s] SRC_DIR OUTPUT_FILE EXT_VARIANT MOUNT_POINT SIZE [-j <journal_size>]
44 SIZE=$5
51 MKE2FS_OPTS+="-J size=$2"
109 # stride should be the max of 8kb and the logical block size
149 if [ -z $SIZE ]; then
150 echo "Need size of filesystem"
154 # Round down the filesystem length to be a multiple of the block size
155 SIZE=$((SIZE / BLOCKSIZE))
165 MAKE_EXT4FS_CMD="mke2fs $MKE2FS_OPTS -t $EXT_VARIANT -b $BLOCKSIZE $OUTPUT_FILE $SIZE"
[all...] |
| /toolchain/binutils/binutils-2.25/binutils/testsuite/binutils-all/ |
| size.exp | 24 if {[which $SIZE] == 0} then {
25 perror "$SIZE does not exist"
30 send_user "Version [binutil_version $SIZE]"
46 # Test size with no arguments
48 set got [binutils_run $SIZE "$SIZEFLAGS $testfile"]
53 fail "size (no arguments)"
59 fail "size (no arguments)"
61 pass "size (no arguments)"
65 # Test size -A
67 set got [binutils_run $SIZE "$SIZEFLAGS -A ${testfile}"
[all...] |
| /external/clang/test/SemaCXX/ |
| cxx11-call-to-deleted-constructor.cpp | 18 template <class VT, unsigned int SIZE> using Vector = Matrix<VT, SIZE, 1>;
|
| /external/valgrind/none/tests/ |
| sigstackgrowth.c | 29 #define SIZE (4*1024*1024)
48 deep = &here - SIZE;
|
| /prebuilts/misc/common/swig/include/2.0.11/python/ |
| pybuffer.i | 3 /* %pybuffer_mutable_binary(TYPEMAP, SIZE)
5 * Macro for functions accept mutable buffer pointer with a size.
8 * %pybuffer_mutable_binary(char *buff, int size);
9 * void foo(char *buff, int size) {
10 * for(int i=0; i<size; ++i)
15 %define %pybuffer_mutable_binary(TYPEMAP, SIZE)
16 %typemap(in) (TYPEMAP, SIZE)
17 (int res, Py_ssize_t size = 0, void *buf = 0) {
18 res = PyObject_AsWriteBuffer($input, &buf, &size);
21 %argument_fail(res, "(TYPEMAP, SIZE)", $symname, $argnum)
[all...] |
| /external/ltp/testcases/kernel/fs/fs_di/ |
| fs_di | 24 # 1. Creates a data file of specified or random size and copies
29 # 2. Creates a datafile of size half of the partition size. Creates
67 usage: ./${0##*/} -d TMPDIR [-h] [-l # of LOOPS ] [-s SIZE in Mb][-S partition SIZE in Mb]
72 -s SIZE in Mb The size of the data file to create. Default=30Mb. A "0" means random sizes from 10-500Mb.
73 -S SIZE in Mb Size of usable partition (in MBs) on which the testing is carried out (needs to be passed
118 SIZE=3
[all...] |
| /frameworks/av/services/audiopolicy/common/managerdefinitions/src/ |
| AudioGain.cpp | 103 const size_t SIZE = 256;
104 char buffer[SIZE];
107 snprintf(buffer, SIZE, "%*sGain %d:\n", spaces, "", index+1);
109 snprintf(buffer, SIZE, "%*s- mode: %08x\n", spaces, "", mGain.mode);
111 snprintf(buffer, SIZE, "%*s- channel_mask: %08x\n", spaces, "", mGain.channel_mask);
113 snprintf(buffer, SIZE, "%*s- min_value: %d mB\n", spaces, "", mGain.min_value);
115 snprintf(buffer, SIZE, "%*s- max_value: %d mB\n", spaces, "", mGain.max_value);
117 snprintf(buffer, SIZE, "%*s- default_value: %d mB\n", spaces, "", mGain.default_value);
119 snprintf(buffer, SIZE, "%*s- step_value: %d mB\n", spaces, "", mGain.step_value);
121 snprintf(buffer, SIZE, "%*s- min_ramp_ms: %d ms\n", spaces, "", mGain.min_ramp_ms)
[all...] |
| /hardware/libhardware_legacy/audio/ |
| AudioHardwareStub.cpp | 101 const size_t SIZE = 256;
102 char buffer[SIZE];
105 snprintf(buffer, SIZE, "\tmMicMute: %s\n", mMicMute? "true": "false");
107 ::write(fd, result.string(), result.size());
143 const size_t SIZE = 256;
144 char buffer[SIZE];
146 snprintf(buffer, SIZE, "AudioStreamOutStub::dump\n");
147 snprintf(buffer, SIZE, "\tsample rate: %d\n", sampleRate());
148 snprintf(buffer, SIZE, "\tbuffer size: %d\n", bufferSize())
[all...] |
