/external/webkit/JavaScriptCore/tests/mozilla/js1_5/Regress/ |
D | regress-80981.js | 57 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/icu4c/data/rbnf/ |
D | ga.txt | 13 "%default:\n" 14 "-x: míneas >>;\n" 15 "x.x: << pointe >>;\n" 16 "a náid; a haon; a dó; a trí; a ceathair; a cúig;\n" 17 "a sé; a seacht; a hocht; a naoi; a deich;\n" 18 "a haon déag; a dó dhéag;\n" 19 ">> déag;\n" 20 "20: fiche[ >>];\n" 21 "30: tríocha[ >>];\n" 22 "40: daichead[ >>];\n" [all …]
|
D | he.txt | 15 "%%tunits:\n" 16 "\u05d0\u05e4\u05e1;\n" 17 "\u05d0\u05d7\u05ea;\n" 18 "\u05e9\u05ea\u05d9\u05d9\u05dd;\n" 19 "\u05e9\u05dc\u05d5\u05e9\u05ea;\n" 20 "\u05d0\u05e8\u05d1\u05e2\u05ea;\n" 21 "\u05d7\u05de\u05e9\u05ea;\n" 22 "\u05e9\u05e9\u05ea;\n" 23 "\u05e9\u05d1\u05e2\u05ea;\n" 24 "\u05e9\u05de\u05d5\u05e0\u05ea;\n" [all …]
|
D | sv.txt | 19 "%year:\n" 20 "=%neutrum=;\n" 21 "1000>: <%neutrum<hundra[\u00ad>>];\n" 22 "10,000: =%neutrum=;\n" 24 "%neutrum:\n" 25 "-x: minus >>;\n" 26 "x.x: << komma >>;\n" 27 "noll; ett; tv\u00e5; tre; fyra; fem; sex; sju; \u00e5tta; nio;\n" 28 "tio; elva; tolv; tretton; fjorton; femton; sexton; sjutton; arton; nitton;\n" 29 "20: tjugo[>>];\n" [all …]
|
D | it.txt | 36 "%main:\n" 37 "-x: meno >>;\n" 38 "x.x: << virgola >>;\n" 39 "zero; uno; due; tre; quattro; cinque; sei; sette; otto; nove;\n" 40 "dieci; undici; dodici; tredici; quattordici; quindici; sedici;\n" 41 " diciasette; diciotto; diciannove;\n" 42 "20: venti; vent>%%with-i>;\n" 43 "30: trenta; trent>%%with-a>;\n" 44 "40: quaranta; quarant>%%with-a>;\n" 45 "50: cinquanta; cinquant>%%with-a>;\n" [all …]
|
D | pt.txt | 11 "%main:\n" 12 "-x: menos >>;\n" 13 "x.x: << ponto >>;\n" 14 "zero; um; dois; tr\u00EAs; quatro; cinco; seis; sete; oito; nove;\n" 16 " dezassete; dezoito; dezanove;\n" 17 "20: vinte[ e >>];\n" 18 "30: trinta[ e >>];\n" 19 "40: quarenta[ e >>];\n" 20 "50: cinquenta[ e >>];\n" 21 "60: sessenta[ e >>];\n" [all …]
|
/external/opencore/build_config/opencore_dynamic/ |
D | pv_config_selected.mk | 15 shoutcast_support=n 21 pv_so=n 29 asf_streaming_support=n 32 fasttrack_download_support=n 34 asflocal_support=n 35 janus_support=n 36 wmdrmplat_support=n 37 wmdrmdev_support=n 38 wmdrmsysclk_support=n 39 mtp_db_support=n [all …]
|
/external/icu4c/data/translit/ |
D | Han_Latin.txt | 18 [侒媕安峎峖庵氨痷盦盫腌腤菴萻葊蓭誝諳谙銨铵鞌鞍馣鵪鶕鹌]>ān; 19 [䜙啽玵雸]>án; 20 [㜝㽢䁆䅖俺唵垵埯揞晻罯隌]>ǎn; 21 [㟁㱘㸩䅁䎏䎨䬓䮗䯥儑匎堓岸按暗案桉洝犴荌錌闇鮟黬黯]>àn; 39 [扳搬攽斑斒朌班瘢癍般虨螌褩辬頒颁]>bān; 40 [㩯㸞㺜䉽䬳坂岅昄板版粄舨蝂鈑钣闆阪]>bǎn; 41 [㚘㪵䕰伴办半姅怑拌湴瓣秚絆绊辦鉡靽]>bàn; 54 [奔泍渀犇錛锛]>bēn; 55 [㡷㮺夲奙本楍畚苯]>běn; 56 [㤓㨧㱵䬱倴坌捹撪桳笨輽逩]>bèn; [all …]
|
/external/webkit/JavaScriptCore/tests/mozilla/ecma/Expressions/ |
D | 11.4.8.js | 79 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 …]
|
D | 11.7.3.js | 91 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 …]
|
D | 11.7.1.js | 86 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 …]
|
D | 11.7.2.js | 100 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 …]
|
D | 11.10-1.js | 88 function ToInteger( n ) { argument 89 n = Number( n ); 90 var sign = ( n < 0 ) ? -1 : 1; 92 if ( n != n ) { 95 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) { 96 return n; 98 return ( sign * Math.floor(Math.abs(n)) ); 100 function ToInt32( n ) { argument 101 n = Number( n ); 102 var sign = ( n < 0 ) ? -1 : 1; [all …]
|
D | 11.10-2.js | 87 function ToInteger( n ) { argument 88 n = Number( n ); 89 var sign = ( n < 0 ) ? -1 : 1; 91 if ( n != n ) { 94 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) { 95 return n; 97 return ( sign * Math.floor(Math.abs(n)) ); 99 function ToInt32( n ) { argument 100 n = Number( n ); 101 var sign = ( n < 0 ) ? -1 : 1; [all …]
|
D | 11.10-3.js | 87 function ToInteger( n ) { argument 88 n = Number( n ); 89 var sign = ( n < 0 ) ? -1 : 1; 91 if ( n != n ) { 94 if ( Math.abs( n ) == 0 || Math.abs( n ) == Number.POSITIVE_INFINITY ) { 95 return n; 97 return ( sign * Math.floor(Math.abs(n)) ); 99 function ToInt32( n ) { argument 100 n = Number( n ); 101 var sign = ( n < 0 ) ? -1 : 1; [all …]
|
/external/openssl/crypto/aes/ |
D | aes_cfb.c | 128 unsigned int n; in AES_cfb128_encrypt() local 134 n = *num; in AES_cfb128_encrypt() 138 if (n == 0) { in AES_cfb128_encrypt() 141 ivec[n] = *(out++) = *(in++) ^ ivec[n]; in AES_cfb128_encrypt() 142 n = (n+1) % AES_BLOCK_SIZE; in AES_cfb128_encrypt() 146 if (n == 0) { in AES_cfb128_encrypt() 150 *(out++) = *(in++) ^ ivec[n]; in AES_cfb128_encrypt() 151 ivec[n] = c; in AES_cfb128_encrypt() 152 n = (n+1) % AES_BLOCK_SIZE; in AES_cfb128_encrypt() 156 *num=n; in AES_cfb128_encrypt() [all …]
|
D | aes_ige.c | 83 unsigned long 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 …]
|
D | aes_cbc.c | 66 unsigned long n; in AES_cbc_encrypt() local 76 for(n=0; n < AES_BLOCK_SIZE; ++n) in AES_cbc_encrypt() 77 out[n] = in[n] ^ iv[n]; in AES_cbc_encrypt() 85 for(n=0; n < len; ++n) in AES_cbc_encrypt() 86 out[n] = in[n] ^ iv[n]; in AES_cbc_encrypt() 87 for(n=len; n < AES_BLOCK_SIZE; ++n) in AES_cbc_encrypt() 88 out[n] = iv[n]; in AES_cbc_encrypt() 96 for(n=0; n < AES_BLOCK_SIZE; ++n) in AES_cbc_encrypt() 97 out[n] ^= iv[n]; in AES_cbc_encrypt() 105 for(n=0; n < len; ++n) in AES_cbc_encrypt() [all …]
|
/external/openssl/crypto/camellia/ |
D | cmll_cfb.c | 131 unsigned int n; in Camellia_cfb128_encrypt() local 137 n = *num; in Camellia_cfb128_encrypt() 143 if (n == 0) in Camellia_cfb128_encrypt() 147 ivec[n] = *(out++) = *(in++) ^ ivec[n]; in Camellia_cfb128_encrypt() 148 n = (n+1) % CAMELLIA_BLOCK_SIZE; in Camellia_cfb128_encrypt() 155 if (n == 0) in Camellia_cfb128_encrypt() 160 *(out++) = *(in++) ^ ivec[n]; in Camellia_cfb128_encrypt() 161 ivec[n] = c; in Camellia_cfb128_encrypt() 162 n = (n+1) % CAMELLIA_BLOCK_SIZE; in Camellia_cfb128_encrypt() 166 *num=n; in Camellia_cfb128_encrypt() [all …]
|
/external/webkit/WebCore/xml/ |
D | XPathStep.cpp | 90 for (Node* n = context->firstChild(); n; n = n->nextSibling()) in nodesInAxis() local 91 if (nodeMatches(n)) in nodesInAxis() 92 nodes.append(n); in nodesInAxis() 98 for (Node* n = context->firstChild(); n; n = n->traverseNextNode(context)) in nodesInAxis() local 99 if (nodeMatches(n)) in nodesInAxis() 100 nodes.append(n); in nodesInAxis() 104 Node* n = static_cast<Attr*>(context)->ownerElement(); in nodesInAxis() local 105 if (nodeMatches(n)) in nodesInAxis() 106 nodes.append(n); in nodesInAxis() 108 Node* n = context->parentNode(); in nodesInAxis() local [all …]
|
/external/icu4c/data/unidata/ |
D | PropertyValueAliases.txt | 26 # If there is no abbreviated name available, the field is marked with "n/a". 60 age; n/a ; 1.1 61 age; n/a ; 2.0 62 age; n/a ; 2.1 63 age; n/a ; 3.0 64 age; n/a ; 3.1 65 age; n/a ; 3.2 66 age; n/a ; 4.0 67 age; n/a ; 4.1 68 age; n/a ; 5.0 [all …]
|
/external/skia/src/core/ |
D | SkPackBits.cpp | 6 const void* SK_RESTRICT src, int n) { in small_memcpy() argument 7 SkASSERT(n > 0 && n <= 15); in small_memcpy() 10 switch (n) { in small_memcpy() 30 static inline void small_memset(void* dst, uint8_t value, int n) { in small_memset() argument 31 SkASSERT(n > 0 && n <= 15); in small_memset() 33 switch (n) { in small_memset() 80 static void register_memset_count(int n) { in register_memset_count() argument 81 SkASSERT((unsigned)n <= 128); in register_memset_count() 82 gMemSetBuckets[n] += 1; in register_memset_count() 94 static void register_memcpy_count(int n) { in register_memcpy_count() argument [all …]
|
/external/openssl/crypto/bn/ |
D | bn_mul.c | 396 int n=n2/2,c1,c2; in bn_mul_recursive() local 397 int tna=n+dna, tnb=n+dnb; in bn_mul_recursive() 431 c1=bn_cmp_part_words(a,&(a[n]),tna,n-tna); in bn_mul_recursive() 432 c2=bn_cmp_part_words(&(b[n]),b,tnb,tnb-n); in bn_mul_recursive() 437 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */ in bn_mul_recursive() 438 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */ in bn_mul_recursive() 444 bn_sub_part_words(t, &(a[n]),a, tna,tna-n); /* - */ in bn_mul_recursive() 445 bn_sub_part_words(&(t[n]),&(b[n]),b, tnb,tnb-n); /* + */ in bn_mul_recursive() 454 bn_sub_part_words(t, a, &(a[n]),tna,n-tna); /* + */ in bn_mul_recursive() 455 bn_sub_part_words(&(t[n]),b, &(b[n]),tnb,n-tnb); /* - */ in bn_mul_recursive() [all …]
|
/external/opencore/codecs_v2/video/m4v_h263/enc/src/ |
D | rate_control.cpp | 60 Int n; in RC_Initialize() local 62 for (n = 0; n < numLayers; n++) in RC_Initialize() 65 rc[n]->fine_frame_skip = encParams->FineFrameSkip_Enabled; in RC_Initialize() 66 rc[n]->no_frame_skip = encParams->NoFrameSkip_Enabled; in RC_Initialize() 67 rc[n]->no_pre_skip = encParams->NoPreSkip_Enabled; in RC_Initialize() 68 rc[n]->skip_next_frame = 0; /* must be initialized */ in RC_Initialize() 71 rc[n]->Bs = video->encParams->BufferSize[n]; in RC_Initialize() 72 rc[n]->TMN_W = 0; in RC_Initialize() 73 rc[n]->VBV_fullness = (Int)(rc[n]->Bs * 0.5); /* rc[n]->Bs */ in RC_Initialize() 74 rc[n]->encoded_frames = 0; in RC_Initialize() [all …]
|
/external/gtest/scripts/ |
D | gen_gtest_pred_impl.py | 65 def HeaderPreamble(n): argument 76 'command' : '%s %s' % (os.path.basename(sys.argv[0]), n), 77 'n' : n 164 def Arity(n): argument 167 if n < 0: 169 elif n <= 3: 170 return ['nullary', 'unary', 'binary', 'ternary'][n] 172 return '%s-ary' % n 183 def OneTo(n): argument 186 return range(1, n + 1) [all …]
|