Home
last modified time | relevance | path

Searched refs:n (Results 1 – 25 of 5658) sorted by relevance

12345678910>>...227

/external/webkit/Source/JavaScriptCore/tests/mozilla/js1_5/Regress/
Dregress-80981.js57 var n = new Array (i2); variable
82 for (i=0; i<i2; i++) {n[i] = 0;}
89 case 0: if (n[0]++ > 0) check ('a string 0'); break;
90 case 1: if (n[1]++ > 0) check ('a string 1'); break;
91 case 2: if (n[2]++ > 0) check ('a string 2'); break;
92 case 3: if (n[3]++ > 0) check ('a string 3'); break;
93 case 4: if (n[4]++ > 0) check ('a string 4'); break;
94 case 5: if (n[5]++ > 0) check ('a string 5'); break;
95 case 6: if (n[6]++ > 0) check ('a string 6'); break;
96 case 7: if (n[7]++ > 0) check ('a string 7'); break;
[all …]
/external/flac/libFLAC/
Dwindow.c52 FLAC__int32 n; in FLAC__window_bartlett() local
55 for (n = 0; n <= N/2; n++) in FLAC__window_bartlett()
56 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett()
57 for (; n <= N; n++) in FLAC__window_bartlett()
58 window[n] = 2.0f - 2.0f * n / (float)N; in FLAC__window_bartlett()
61 for (n = 0; n <= L/2-1; n++) in FLAC__window_bartlett()
62 window[n] = 2.0f * n / (float)N; in FLAC__window_bartlett()
63 for (; n <= N; n++) in FLAC__window_bartlett()
64 window[n] = 2.0f - 2.0f * (N-n) / (float)N; in FLAC__window_bartlett()
71 FLAC__int32 n; in FLAC__window_bartlett_hann() local
[all …]
/external/valgrind/main/none/tests/ppc64/
Dtwi_tdi.c32 static void twi_0_neg100 ( long n ) { in twi_0_neg100() argument
34 : /*out*/ : /*in*/ "r" (n) ); in twi_0_neg100()
36 static void twi_1_neg100 ( long n ) { in twi_1_neg100() argument
38 : /*out*/ : /*in*/ "r" (n) ); in twi_1_neg100()
40 static void twi_2_neg100 ( long n ) { in twi_2_neg100() argument
42 : /*out*/ : /*in*/ "r" (n) ); in twi_2_neg100()
44 static void twi_3_neg100 ( long n ) { in twi_3_neg100() argument
46 : /*out*/ : /*in*/ "r" (n) ); in twi_3_neg100()
48 static void twi_4_neg100 ( long n ) { in twi_4_neg100() argument
50 : /*out*/ : /*in*/ "r" (n) ); in twi_4_neg100()
[all …]
Dtw_td.c33 static void tw_0 ( long n, long m ) { in tw_0() argument
35 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_0()
37 static void tw_1 ( long n, long m ) { in tw_1() argument
39 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_1()
41 static void tw_2 ( long n, long m ) { in tw_2() argument
43 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_2()
45 static void tw_3 ( long n, long m ) { in tw_3() argument
47 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_3()
49 static void tw_4 ( long n, long m ) { in tw_4() argument
51 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_4()
[all …]
/external/valgrind/main/none/tests/ppc32/
Dtwi.c32 static void twi_0_neg100 ( long n ) { in twi_0_neg100() argument
34 : /*out*/ : /*in*/ "r" (n) ); in twi_0_neg100()
36 static void twi_1_neg100 ( long n ) { in twi_1_neg100() argument
38 : /*out*/ : /*in*/ "r" (n) ); in twi_1_neg100()
40 static void twi_2_neg100 ( long n ) { in twi_2_neg100() argument
42 : /*out*/ : /*in*/ "r" (n) ); in twi_2_neg100()
44 static void twi_3_neg100 ( long n ) { in twi_3_neg100() argument
46 : /*out*/ : /*in*/ "r" (n) ); in twi_3_neg100()
48 static void twi_4_neg100 ( long n ) { in twi_4_neg100() argument
50 : /*out*/ : /*in*/ "r" (n) ); in twi_4_neg100()
[all …]
Dtw.c33 static void tw_0 ( long n, long m ) { in tw_0() argument
35 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_0()
37 static void tw_1 ( long n, long m ) { in tw_1() argument
39 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_1()
41 static void tw_2 ( long n, long m ) { in tw_2() argument
43 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_2()
45 static void tw_3 ( long n, long m ) { in tw_3() argument
47 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_3()
49 static void tw_4 ( long n, long m ) { in tw_4() argument
51 : /*out*/ : /*in*/ "r" (n), "r" (m) ); in tw_4()
[all …]
/external/clang/test/SemaCXX/
Dswitch-implicit-fallthrough.cpp4 int fallthrough(int n) { in fallthrough() argument
5 switch (n / 10) { in fallthrough()
6 if (n - 1) { in fallthrough()
7 n = 100; in fallthrough()
8 } else if (n - 2) { in fallthrough()
9 n = 101; in fallthrough()
10 } else if (n - 3) { in fallthrough()
11 n = 102; in fallthrough()
18 n += 100 ; in fallthrough()
20 if (n > 0) in fallthrough()
[all …]
Dswitch-implicit-fallthrough-cxx98.cpp7 int fallthrough(int n) { in fallthrough() argument
8 switch (n / 10) { in fallthrough()
9 if (n - 1) { in fallthrough()
10 n = 100; in fallthrough()
11 } else if (n - 2) { in fallthrough()
12 n = 101; in fallthrough()
13 } else if (n - 3) { in fallthrough()
14 n = 102; in fallthrough()
21 n += 100 ; in fallthrough()
23 if (n > 0) in fallthrough()
[all …]
/external/jmonkeyengine/engine/src/android/jme3tools/android/
DFixed.java91 for (int n = 2; n < QUARTER_CIRCLE + 1; n++) {
92 …SINE_TABLE[n] = (int) (((long) SINE_TABLE[n - 1] * COS_PRECALC) >> TABLE_SHIFT) - SINE_TABLE[n - 2…
95 for (int n = 0; n < QUARTER_CIRCLE + 1; n++) {
96 …SINE_TABLE[n] = SINE_TABLE[n] + (1 << (TABLE_SHIFT - FIXED_POINT - 1)) >> TABLE_SHIFT - FIXED_POIN…
113 for (int n = 0; n < QUARTER_CIRCLE; n++) {
114 lut[n] = tan(n) >> rotl;
119 for (byte n = 0; n < QUARTER_CIRCLE - 1; n++) {
120 int min = lut[n];
121 int max = lut[n + 1];
123 ATAN_TABLE[i] = n;
[all …]
/external/openssl/crypto/modes/
Dcfb128.c71 unsigned int n; in CRYPTO_cfb128_encrypt() local
76 n = *num; in CRYPTO_cfb128_encrypt()
81 while (n && len) { in CRYPTO_cfb128_encrypt()
82 *(out++) = ivec[n] ^= *(in++); in CRYPTO_cfb128_encrypt()
84 n = (n+1) % 16; in CRYPTO_cfb128_encrypt()
92 for (; n<16; n+=sizeof(size_t)) { in CRYPTO_cfb128_encrypt()
93 *(size_t*)(out+n) = in CRYPTO_cfb128_encrypt()
94 *(size_t*)(ivec+n) ^= *(size_t*)(in+n); in CRYPTO_cfb128_encrypt()
99 n = 0; in CRYPTO_cfb128_encrypt()
104 out[n] = ivec[n] ^= in[n]; in CRYPTO_cfb128_encrypt()
[all …]
Dcbc128.c70 size_t n; in CRYPTO_cbc128_encrypt() local
79 for(n=0; n<16; ++n) in CRYPTO_cbc128_encrypt()
80 out[n] = in[n] ^ iv[n]; in CRYPTO_cbc128_encrypt()
89 for(n=0; n<16; n+=sizeof(size_t)) in CRYPTO_cbc128_encrypt()
90 *(size_t*)(out+n) = in CRYPTO_cbc128_encrypt()
91 *(size_t*)(in+n) ^ *(size_t*)(iv+n); in CRYPTO_cbc128_encrypt()
101 for(n=0; n<16 && n<len; ++n) in CRYPTO_cbc128_encrypt()
102 out[n] = in[n] ^ iv[n]; in CRYPTO_cbc128_encrypt()
103 for(; n<16; ++n) in CRYPTO_cbc128_encrypt()
104 out[n] = iv[n]; in CRYPTO_cbc128_encrypt()
[all …]
Dctr128.c67 u32 n=16; in ctr128_inc() local
71 --n; in ctr128_inc()
72 c = counter[n]; in ctr128_inc()
74 counter[n] = c; in ctr128_inc()
76 } while (n); in ctr128_inc()
81 size_t *data,c,n; in ctr128_inc_aligned() local
90 n = 16/sizeof(size_t); in ctr128_inc_aligned()
92 --n; in ctr128_inc_aligned()
93 c = data[n]; in ctr128_inc_aligned()
95 data[n] = c; in ctr128_inc_aligned()
[all …]
/external/icu4c/data/translit/
DHan_Latin.txt19 [㛺㞄㫨㸩䀂䅖䢿侒媕安峖庵桉氨痷盦盫腤菴萻葊蓭誝諳谙鞌鞍韽馣鵪鶕鹌����������������������]→ān;
20 [䜙儑啽玵雸������]→án;
21 [㜝㽢俺唵垵埯揞罯銨铵隌��������������]→ǎn;
22 [㟁㱘䅁䬓䮗䯥堓婩岸按晻暗案洝犴胺荌豻錌闇鮟黯��������������������������������]→àn;
42 [䃑䈲扳搬攽斑斒班瘢癍般螌褩辬頒颁鳻������������������������������������]→bān;
43 [䉽䬳坂岅昄板版瓪粄舨蝂鈑钣闆阪魬��������]→bǎn;
44 [㚘㪵伴办半坢姅怑拌柈湴瓣秚絆绊辦鉡靽��������������������]→bàn;
58 [奔栟泍犇贲錛锛��������]→bēn;
59 [㡷㮺奙本楍畚翉苯��]→běn;
60 [㤓㨧㮥䬱倴坋坌捹撪桳渀獖笨輽逩������������]→bèn;
[all …]
/external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Expressions/
D11.4.8.js79 function ToInteger( n ) { argument
80 n = Number( n );
81 var sign = ( n < 0 ) ? -1 : 1;
83 if ( n != n ) {
86 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
87 return n;
89 return ( sign * Math.floor(Math.abs(n)) );
91 function ToInt32( n ) { argument
92 n = Number( n );
93 var sign = ( n < 0 ) ? -1 : 1;
[all …]
D11.7.1.js86 function ToInteger( n ) { argument
87 n = Number( n );
88 var sign = ( n < 0 ) ? -1 : 1;
90 if ( n != n ) {
93 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
94 return n;
96 return ( sign * Math.floor(Math.abs(n)) );
98 function ToInt32( n ) { argument
99 n = Number( n );
100 var sign = ( n < 0 ) ? -1 : 1;
[all …]
D11.7.3.js91 function ToInteger( n ) { argument
92 n = Number( n );
93 var sign = ( n < 0 ) ? -1 : 1;
95 if ( n != n ) {
98 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
99 return n;
101 return ( sign * Math.floor(Math.abs(n)) );
103 function ToInt32( n ) { argument
104 n = Number( n );
105 var sign = ( n < 0 ) ? -1 : 1;
[all …]
D11.7.2.js100 function ToInteger( n ) { argument
101 n = Number( n );
102 var sign = ( n < 0 ) ? -1 : 1;
104 if ( n != n ) {
107 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) {
108 return n;
110 return ( sign * Math.floor(Math.abs(n)) );
112 function ToInt32( n ) { argument
113 n = Number( n );
114 var sign = ( n < 0 ) ? -1 : 1;
[all …]
/external/v8/test/mjsunit/
Darray-iteration.js42 assertArrayEquals([0], a.filter(function(n) { return n == 0; })); argument
48 assertArrayEquals([42,42], a.filter(function(n) { return this.value == n }, o)) argument
52 …assertArrayEquals([42,42], a.filter(function(n, index, array) { array[index] = 43; return 42 == n;… argument
58 assertArrayEquals([], a.filter(function(n, index, array) { array.push(n+1); return n == 2; })); argument
67 var a = a.filter(function(n) { count++; return n == 2; }); argument
81 a.forEach(function(n) { count++; }); argument
87 a.forEach(function(n) { result.push(this.value); }, o); argument
93 a.forEach(function(n, index, array) { array[index] = n + 1; count++; }); argument
101 a.forEach(function(n, index, array) { array.push(n+1); count++; }); argument
109 a.forEach(function(n) { count++; }); argument
[all …]
/external/openssl/crypto/aes/
Daes_ige.c83 size_t n; in AES_ige_encrypt() local
105 for(n=0 ; n < N_WORDS; ++n) in AES_ige_encrypt()
106 outp->data[n] = inp->data[n] ^ ivp->data[n]; in AES_ige_encrypt()
108 for(n=0 ; n < N_WORDS; ++n) in AES_ige_encrypt()
109 outp->data[n] ^= iv2p->data[n]; in AES_ige_encrypt()
131 for(n=0 ; n < N_WORDS; ++n) in AES_ige_encrypt()
132 tmp2.data[n] = tmp.data[n] ^ iv.data[n]; in AES_ige_encrypt()
134 for(n=0 ; n < N_WORDS; ++n) in AES_ige_encrypt()
135 tmp2.data[n] ^= iv2.data[n]; in AES_ige_encrypt()
161 for(n=0 ; n < N_WORDS; ++n) in AES_ige_encrypt()
[all …]
/external/valgrind/main/massif/tests/
Dalloc-fns.c3 void a4(int n) { malloc(n); } in a4() argument
4 void a3(int n) { a4(n); } in a3() argument
5 void a2(int n) { a3(n); } in a2() argument
6 void a1(int n) { a2(n); } in a1() argument
8 void b4(int n) { malloc(n); } in b4() argument
9 void b3(int n) { b4(n); } in b3() argument
10 void b2(int n) { b3(n); } in b2() argument
11 void b1(int n) { b2(n); } in b1() argument
13 void c4(int n) { malloc(n); } in c4() argument
14 void c3(int n) { c4(n); } in c3() argument
[all …]
/external/clang/test/Analysis/
Dmalloc-overflow.c7 void * f1(int n) in f1() argument
9 …return malloc(n * sizeof(int)); // expected-warning {{the computation of the size of the memory a… in f1()
12 void * f2(int n) in f2() argument
14 …return malloc(sizeof(int) * n); // // expected-warning {{the computation of the size of the memory… in f2()
24 int n; member
29 …return malloc(s->n * sizeof(int)); // expected-warning {{the computation of the size of the memory… in f4()
35 …return malloc(s2.n * sizeof(int)); // expected-warning {{the computation of the size of the memory… in f5()
38 void * f6(int n) in f6() argument
40 …return malloc((n + 1) * sizeof(int)); // expected-warning {{the computation of the size of the mem… in f6()
45 void * f7(int n) in f7() argument
[all …]
/external/skia/src/core/
DSkPackBits.cpp13 const void* SK_RESTRICT src, int n) { in small_memcpy() argument
14 SkASSERT(n > 0 && n <= 15); in small_memcpy()
17 switch (n) { in small_memcpy()
37 static inline void small_memset(void* dst, uint8_t value, int n) { in small_memset() argument
38 SkASSERT(n > 0 && n <= 15); in small_memset()
40 switch (n) { in small_memset()
87 static void register_memset_count(int n) { in register_memset_count() argument
88 SkASSERT((unsigned)n <= 128); in register_memset_count()
89 gMemSetBuckets[n] += 1; in register_memset_count()
101 static void register_memcpy_count(int n) { in register_memcpy_count() argument
[all …]
/external/skia/legacy/src/core/
DSkPackBits.cpp13 const void* SK_RESTRICT src, int n) { in small_memcpy() argument
14 SkASSERT(n > 0 && n <= 15); in small_memcpy()
17 switch (n) { in small_memcpy()
37 static inline void small_memset(void* dst, uint8_t value, int n) { in small_memset() argument
38 SkASSERT(n > 0 && n <= 15); in small_memset()
40 switch (n) { in small_memset()
87 static void register_memset_count(int n) { in register_memset_count() argument
88 SkASSERT((unsigned)n <= 128); in register_memset_count()
89 gMemSetBuckets[n] += 1; in register_memset_count()
101 static void register_memcpy_count(int n) { in register_memcpy_count() argument
[all …]
/external/oprofile/libpp/
Dname_storage.cpp28 stored_filename const & n = get(id); in basename() local
29 if (n.base_filename.empty()) in basename()
30 n.base_filename = op_basename(n.filename); in basename()
31 return n.base_filename; in basename()
39 stored_filename const & n = get(id); in get_name() local
41 return n.filename; in get_name()
45 if (n.extra_images_uid == 0) { in get_name()
48 n.real_base_filename = op_basename(n.real_filename); in get_name()
50 return n.real_base_filename; in get_name()
52 if (n.extra_images_uid == 0) { in get_name()
[all …]
/external/clang/test/Parser/
Dfor.cpp4 int n; in f1() local
6 for (n = 0; n < 10; n++); in f1()
8 for (n = 0 n < 10; n++); // expected-error {{expected ';' in 'for'}} in f1()
9 for (n = 0; n < 10 n++); // expected-error {{expected ';' in 'for'}} in f1()
11 for (int n = 0 n < 10; n++); // expected-error {{expected ';' in 'for'}} in f1() local
12 for (int n = 0; n < 10 n++); // expected-error {{expected ';' in 'for'}} in f1() local
14 for (n = 0 bool b = n < 10; n++); // expected-error {{expected ';' in 'for'}} in f1()
15 for (n = 0; bool b = n < 10 n++); // expected-error {{expected ';' in 'for'}} in f1()
17 for (n = 0 n < 10 n++); // expected-error 2{{expected ';' in 'for'}} in f1()

12345678910>>...227