| /external/webkit/JavaScriptCore/tests/mozilla/js1_2/String/ |
| concat.js | 38 var count = 0; variable
45 testcases[count++] = new TestCase( SECTION, "aString.concat(' more')", "test string more", aString.concat(' more').toString());
46 testcases[count++] = new TestCase( SECTION, "aString.concat(bString)", "test string another ", aString.concat(bString).toString());
47 testcases[count++] = new TestCase( SECTION, "aString ", "test string", aString.toString());
48 testcases[count++] = new TestCase( SECTION, "bString ", " another ", bString.toString());
49 testcases[count++] = new TestCase( SECTION, "aString.concat(345) ", "test string345", aString.concat(345).toString());
50 testcases[count++] = new TestCase( SECTION, "aString.concat(true) ", "test stringtrue", aString.concat(true).toString());
51 testcases[count++] = new TestCase( SECTION, "aString.concat(null) ", "test stringnull", aString.concat(null).toString());
59 //testcases[count++] = new TestCase( SECTION, "aString.concat([]) ", "test string[]", aString.concat([]).toString());
60 //testcases[count++] = new TestCase( SECTION, "aString.concat([1,2,3])", "test string[1, 2, 3]", aString.concat( (…)
[all...] |
| charCodeAt.js | 38 var count = 0; variable
44 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt(-2)", NaN, aString.charCodeAt(-2));
45 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt(-1)", NaN, aString.charCodeAt(-1));
46 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt( 0)", 116, aString.charCodeAt( 0));
47 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt( 1)", 69, aString.charCodeAt( 1));
48 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt( 2)", 115, aString.charCodeAt( 2));
49 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt( 3)", 53, aString.charCodeAt( 3));
50 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt( 4)", NaN, aString.charCodeAt( 4));
51 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt( 5)", NaN, aString.charCodeAt( 5));
52 testcases[count++] = new TestCase( SECTION, "aString.charCodeAt( Infinity)", NaN, aString.charCodeAt( Infinity))
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/js1_2/statements/ |
| switch2.js | 41 var count = 0; variable
59 testcases[count++] = new TestCase(SECTION, 'switch statement',
62 testcases[count++] = new TestCase(SECTION, 'switch statement',
65 testcases[count++] = new TestCase(SECTION, 'switch statement',
68 testcases[count++] = new TestCase(SECTION, 'switch statement',
71 testcases[count++] = new TestCase(SECTION, 'switch statement',
88 testcases[count++] = new TestCase(SECTION, 'switch statement',
91 testcases[count++] = new TestCase(SECTION, 'switch statement',
94 testcases[count++] = new TestCase(SECTION, 'switch statement',
97 testcases[count++] = new TestCase(SECTION, 'switch statement'
[all...] |
| /external/chromium/third_party/icu/source/i18n/ |
| dtfmtsym.cpp | 201 static inline UnicodeString* newUnicodeStringArray(size_t count) {
202 return new UnicodeString[count ? count : 1];
431 int32_t count)
434 while (count>0)
436 --count;
437 if (array1[count] != array2[count]) return FALSE;
519 DateFormatSymbols::getEras(int32_t &count) const
521 count = fErasCount
[all...] |
| /external/icu4c/i18n/ |
| dtfmtsym.cpp | 203 static inline UnicodeString* newUnicodeStringArray(size_t count) {
204 return new UnicodeString[count ? count : 1];
433 int32_t count)
436 while (count>0)
438 --count;
439 if (array1[count] != array2[count]) return FALSE;
521 DateFormatSymbols::getEras(int32_t &count) const
523 count = fErasCount
[all...] |
| /dalvik/vm/test/ |
| TestHash.c | 36 int* count = (int*) arg; local
37 (*count)++;
42 int count = 0; local
45 dvmHashForeach(pTab, printFunc, &count);
46 if (count != kNumTestEntries) {
57 int count = 0; local
67 count++;
69 if (count != kNumTestEntries) {
158 int count = 0; local
163 count++
[all...] |
| /external/e2fsprogs/tests/f_lpffile/ |
| expect.1 | 16 Inode 12 ref count is 2, should be 1. Fix? yes
21 Inode 13 ref count is 2, should be 1. Fix? yes
26 Inode 14 ref count is 2, should be 1. Fix? yes
|
| /external/e2fsprogs/tests/f_reconnect/ |
| expect.1 | 8 Inode 12 ref count is 2, should be 1. Fix? yes
13 Inode 13 ref count is 2, should be 1. Fix? yes
18 Inode 14 ref count is 2, should be 1. Fix? yes
|
| /external/qemu/android/utils/ |
| system.h | 45 #define AARRAY_NEW(p,count) ((p) = android_alloc(sizeof(*p)*(count)))
46 #define AARRAY_NEW0(p,count) ((p) = android_alloc0(sizeof(*p)*(count)))
48 #define AARRAY_RENEW(p,count) ((p) = android_realloc((p),sizeof(*(p))*(count)))
50 #define AARRAY_COPY(dst,src,count) AMEM_COPY(dst,src,(count)*sizeof((dst)[0]))
51 #define AARRAY_MOVE(dst,src,count) AMEM_MOVE(dst,src,(count)*sizeof((dst)[0])
[all...] |
| /external/skia/src/core/ |
| SkTSearch.cpp | 27 int SkStrSearch(const char*const* base, int count, const char target[],
30 if (count <= 0)
36 int hi = count - 1;
63 int SkStrSearch(const char*const* base, int count, const char target[],
66 return SkStrSearch(base, count, target, strlen(target), elemSize);
69 int SkStrLCSearch(const char*const* base, int count, const char target[],
76 return SkStrSearch(base, count, tolc.lc(), len, elemSize);
79 int SkStrLCSearch(const char*const* base, int count, const char target[],
82 return SkStrLCSearch(base, count, target, strlen(target), elemSize);
176 void SkQSort(void* base, size_t count, size_t elemSize, SkQSortCompareProc compare
[all...] |
| /external/webkit/JavaScriptCore/tests/mozilla/js1_2/operator/ |
| strictEquality.js | 38 var count = 0; variable
42 testcases[count++] = new TestCase( SECTION, "('8' === 8) ",
45 testcases[count++] = new TestCase( SECTION, "(8 === 8) ",
48 testcases[count++] = new TestCase( SECTION, "(8 === true) ",
51 testcases[count++] = new TestCase( SECTION, "(new String('') === new String('')) ",
54 testcases[count++] = new TestCase( SECTION, "(new Boolean(true) === new Boolean(true))",
59 testcases[count++] = new TestCase( SECTION, "(anObject === anObject) ",
62 testcases[count++] = new TestCase( SECTION, "(anObject === { one:1 , two:2 }) ",
65 testcases[count++] = new TestCase( SECTION, "({ one:1 , two:2 } === anObject) ",
68 testcases[count++] = new TestCase( SECTION, "(null === null) "
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/luni/internal/net/www/protocol/http/ |
| AbstractHttpInputStream.java | 56 int count = read(buffer, 0, 1); local
57 return count == -1 ? -1 : buffer[0] & 0xff;
71 int count = read(skipBuffer, 0, (int) Math.min(n - total, skipBuffer.length)); local
72 if (count == -1) {
75 total += count;
80 protected final void checkBounds(byte[] buffer, int offset, int count) {
81 if (offset < 0 || offset > buffer.length || count < 0 || buffer.length - offset < count) {
83 "offset=" + offset + ", buffer.length=" + buffer.length + ", count=" + count);
[all...] |
| /system/extras/libpagemap/ |
| pm_map.c | 33 uint64_t count; local
51 &count);
55 usage.rss += (count >= 1) ? (map->proc->ker->pagesize) : (0);
56 usage.pss += (count >= 1) ? (map->proc->ker->pagesize / count) : (0);
57 usage.uss += (count == 1) ? (map->proc->ker->pagesize) : (0);
73 uint64_t count, flags; local
98 &count);
102 ws.rss += (count >= 1) ? (map->proc->ker->pagesize) : (0);
103 ws.pss += (count >= 1) ? (map->proc->ker->pagesize / count) : (0)
[all...] |
| /external/openssl/crypto/des/ |
| speed.c | 181 long count; local
203 count=10;
208 count*=2;
210 for (i=count; i; i--)
214 ca=count;
215 cb=count*3;
216 cc=count*3*8/BUFSIZE+1;
217 cd=count*8/BUFSIZE+1;
218 ce=count/20+1;
220 #define COND(d) (count != (d)
[all...] |
| /libcore/luni/src/main/java/java/io/ |
| BufferedWriter.java | 170 * Writes {@code count} characters starting at {@code offset} in
171 * {@code cbuf} to this writer. If {@code count} is greater than this
179 * @param count
182 * if {@code offset < 0} or {@code count < 0}, or if
183 * {@code offset + count} is greater than the size of
189 public void write(char[] cbuf, int offset, int count) throws IOException {
195 // made implicit null check explicit, used (offset | count) < 0
196 // instead of (offset < 0) || (count < 0) to safe one operation
200 if ((offset | count) < 0 || offset > cbuf.length - count) {
[all...] |
| /bionic/libc/kernel/arch-sh/asm/ |
| machvec.h | 40 void (*mv_insb)(unsigned long, void *dst, unsigned long count);
41 void (*mv_insw)(unsigned long, void *dst, unsigned long count);
42 void (*mv_insl)(unsigned long, void *dst, unsigned long count);
43 void (*mv_outsb)(unsigned long, const void *src, unsigned long count);
44 void (*mv_outsw)(unsigned long, const void *src, unsigned long count);
45 void (*mv_outsl)(unsigned long, const void *src, unsigned long count);
|
| /dalvik/dx/src/com/android/dx/util/ |
| Leb128Utils.java | 41 int count = 0; local
45 count++;
48 return count + 1;
62 int count = 0; local
72 count++;
75 return count;
|
| /external/e2fsprogs/tests/f_misstable/ |
| expect.1 | 21 Inode 2 ref count is 8, should be 4. Fix? yes
27 Free blocks count wrong for group #0 (7987, counted=7984).
30 Free blocks count wrong (11602, counted=11599).
36 Free inodes count wrong for group #0 (1493, counted=1489).
39 Directories count wrong for group #0 (2, counted=3).
42 Free inodes count wrong (2997, counted=2993).
|
| /external/easymock/src/org/easymock/internal/ |
| Range.java | 28 public Range(int count) {
29 this(count, count);
78 public boolean contains(int count) {
79 return minimum <= count && count <= maximum;
|
| /external/icu4c/layout/ |
| HanLayoutEngine.cpp | 54 le_int32 HanOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool /*rightToLeft*/,
61 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
66 glyphStorage.allocateGlyphArray(count, FALSE, success);
77 for (le_int32 i = 0; i < count; i += 1) {
81 return count;
|
| KhmerLayoutEngine.cpp | 43 // Returns: output character count
44 le_int32 KhmerOpenTypeLayoutEngine::characterProcessing(const LEUnicode chars[], le_int32 offset, le_int32 count, le_int32 max, le_bool rightToLeft,
51 if (chars == NULL || offset < 0 || count < 0 || max < 0 || offset >= max || offset + count > max) {
56 le_int32 worstCase = count * 3; // worst case is 3 for Khmer TODO check if 2 is enough
75 le_int32 outCharCount = KhmerReordering::reorder(&chars[offset], count, fScriptCode, outChars, glyphStorage);
|
| /external/icu4c/tools/genuca/ |
| genteststub.py | 35 count=10 variable
45 if (count==10):
47 count=0 variable
48 count=count+1 variable
49 if count!=1:
|
| /external/v8/test/mjsunit/ |
| arguments-enum.js | 29 var count = 0;
31 count++;
32 return count;
38 var count = 0;
40 count++;
41 return count;
|
| dont-enum-array-holes.js | 29 var count = 0; variable
30 for (var i in [,1,,3]) count++;
31 assertEquals(2, count);
33 count = 0;
34 for (var i in new Array(10)) count++;
35 assertEquals(0, count);
|
| /frameworks/base/media/java/android/drm/mobile1/ |
| DrmConstraintInfo.java | 26 * The constraint of count.
28 private int count; field in class:DrmConstraintInfo
49 count = -1;
56 * Get the count constraint.
58 * @return the count or -1 if no limit.
61 return count;
|
