Home
last modified time | relevance | path

Searched refs:c2 (Results 1 - 25 of 797) sorted by relevance

12345678910>>...32

/third_party/node/deps/openssl/openssl/crypto/bn/asm/
H A Dx86_64-gcc.c309 /* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */
310 /* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
311 /* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
313 * sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number
314 * c=(c2,c1,c0)
323 # define mul_add_c(a,b,c0,c1,c2) do { \
328 c1 += hi; c2
395 BN_ULONG c1, c2, c3; bn_mul_comba8() local
498 BN_ULONG c1, c2, c3; bn_mul_comba4() local
537 BN_ULONG c1, c2, c3; bn_sqr_comba8() local
612 BN_ULONG c1, c2, c3; bn_sqr_comba4() local
[all...]
H A Ds390x.S365 #define c2 %r5 define
368 #define mul_add_c(ai,bi,c1,c2,c3) \
372 alcgr c2,%r6; \
383 lghi c2,0
387 mul_add_c(0,0,c1,c2,c3);
391 mul_add_c(0,1,c2,c3,c1);
392 mul_add_c(1,0,c2,c3,c1);
393 stg c2,1*8(%r2)
394 lghi c2,0
396 mul_add_c(2,0,c3,c1,c2);
[all...]
H A Dco-586.pl28 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
48 &adc($c2,0);
56 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
77 &adc($c2,0);
85 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
104 &adc($c2,0);
109 &adc($c2,0);
118 local($a,$b,$c0,$c1,$c2);
126 $c2="ebp";
158 &xor($c2,
[all...]
H A Dsparcv8plus.S678 mulx a_0,b_0,t_1 !mul_add_c(a[0],b[0],c1,c2,c3);
683 mulx a_0,b_1,t_1 !mul_add_c(a[0],b[1],c2,c3,c1);
689 mulx a_1,b_0,t_1 !=!mul_add_c(a[1],b[0],c2,c3,c1);
694 stuw t_1,rp(1) !r[1]=c2;
697 mulx a_2,b_0,t_1 !mul_add_c(a[2],b[0],c3,c1,c2);
703 mulx a_1,b_1,t_1 !mul_add_c(a[1],b[1],c3,c1,c2);
708 mulx a_0,b_2,t_1 !mul_add_c(a[0],b[2],c3,c1,c2);
716 mulx a_0,b_3,t_1 !mul_add_c(a[0],b[3],c1,c2,c3);
721 mulx a_1,b_2,t_1 !=!mul_add_c(a[1],b[2],c1,c2,c3);
726 mulx a_2,b_1,t_1 !mul_add_c(a[2],b[1],c1,c2,c
[all...]
/third_party/openssl/crypto/bn/asm/
H A Dx86_64-gcc.c309 /* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */
310 /* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
311 /* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
313 * sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number
314 * c=(c2,c1,c0)
323 # define mul_add_c(a,b,c0,c1,c2) do { \
328 c1 += hi; c2
395 BN_ULONG c1, c2, c3; bn_mul_comba8() local
498 BN_ULONG c1, c2, c3; bn_mul_comba4() local
537 BN_ULONG c1, c2, c3; bn_sqr_comba8() local
612 BN_ULONG c1, c2, c3; bn_sqr_comba4() local
[all...]
H A Ds390x.S365 #define c2 %r5 define
368 #define mul_add_c(ai,bi,c1,c2,c3) \
372 alcgr c2,%r6; \
383 lghi c2,0
387 mul_add_c(0,0,c1,c2,c3);
391 mul_add_c(0,1,c2,c3,c1);
392 mul_add_c(1,0,c2,c3,c1);
393 stg c2,1*8(%r2)
394 lghi c2,0
396 mul_add_c(2,0,c3,c1,c2);
[all...]
H A Dco-586.pl28 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
48 &adc($c2,0);
56 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
77 &adc($c2,0);
85 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
104 &adc($c2,0);
109 &adc($c2,0);
118 local($a,$b,$c0,$c1,$c2);
126 $c2="ebp";
158 &xor($c2,
[all...]
/third_party/python/Modules/cjkcodecs/
H A D_codecs_jp.c25 unsigned char c1, c2; in ENCODER() local
62 c2 = code & 0xff; in ENCODER()
63 c2 = (((c1 - 0x21) & 1) ? 0x5e : 0) + (c2 - 0x21); in ENCODER()
66 OUTBYTE2(c2 < 0x3f ? c2 + 0x40 : c2 + 0x41); in ENCODER()
71 c2 = (Py_UCS4)(c - 0xe000) % 188; in ENCODER()
73 OUTBYTE2(c2 < 0x3f ? c2 in ENCODER()
87 unsigned char c = INBYTE1, c2; DECODER() local
183 Py_UCS4 c2 = INCHAR2; ENCODER() local
255 unsigned char c2; DECODER() local
267 unsigned char c2, c3; DECODER() local
289 unsigned char c2; DECODER() local
396 unsigned char c2; DECODER() local
408 unsigned char c2, c3; DECODER() local
422 unsigned char c2; DECODER() local
454 unsigned char c1, c2; ENCODER() local
522 unsigned char c1, c2; DECODER() local
569 int c1, c2; ENCODER() local
674 unsigned char c1, c2; DECODER() local
[all...]
H A Demu_jisx0213_2000.h30 #define EMULATE_JISX0213_2000_DECODE_PLANE1(assi, c1, c2) \
32 (((c1) == 0x2E && (c2) == 0x21) || \
33 ((c1) == 0x2F && (c2) == 0x7E) || \
34 ((c1) == 0x4F && (c2) == 0x54) || \
35 ((c1) == 0x4F && (c2) == 0x7E) || \
36 ((c1) == 0x74 && (c2) == 0x27) || \
37 ((c1) == 0x7E && (c2) == 0x7A) || \
38 ((c1) == 0x7E && (c2) == 0x7B) || \
39 ((c1) == 0x7E && (c2) == 0x7C) || \
40 ((c1) == 0x7E && (c2)
[all...]
/third_party/python/Parser/
H A Dtoken.c110 PyToken_TwoChars(int c1, int c2) in PyToken_TwoChars() argument
114 switch (c2) { in PyToken_TwoChars()
119 switch (c2) { in PyToken_TwoChars()
124 switch (c2) { in PyToken_TwoChars()
129 switch (c2) { in PyToken_TwoChars()
135 switch (c2) { in PyToken_TwoChars()
140 switch (c2) { in PyToken_TwoChars()
146 switch (c2) { in PyToken_TwoChars()
152 switch (c2) { in PyToken_TwoChars()
157 switch (c2) { in PyToken_TwoChars()
194 PyToken_ThreeChars(int c1, int c2, int c3) PyToken_ThreeChars() argument
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_asm.c440 /* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */
441 /* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
442 /* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
444 * sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number
445 * c=(c2,c1,c0)
453 # define mul_add_c(a,b,c0,c1,c2) do { \
459 c1 = (c1+hi)&BN_MASK2; c2
593 BN_ULONG c1, c2, c3; bn_mul_comba8() local
696 BN_ULONG c1, c2, c3; bn_mul_comba4() local
735 BN_ULONG c1, c2, c3; bn_sqr_comba8() local
810 BN_ULONG c1, c2, c3; bn_sqr_comba4() local
[all...]
/third_party/openssl/crypto/bn/
H A Dbn_asm.c440 /* mul_add_c(a,b,c0,c1,c2) -- c+=a*b for three word number c=(c2,c1,c0) */
441 /* mul_add_c2(a,b,c0,c1,c2) -- c+=2*a*b for three word number c=(c2,c1,c0) */
442 /* sqr_add_c(a,i,c0,c1,c2) -- c+=a[i]^2 for three word number c=(c2,c1,c0) */
444 * sqr_add_c2(a,i,c0,c1,c2) -- c+=2*a[i]*a[j] for three word number
445 * c=(c2,c1,c0)
453 # define mul_add_c(a,b,c0,c1,c2) do { \
459 c1 = (c1+hi)&BN_MASK2; c2
593 BN_ULONG c1, c2, c3; bn_mul_comba8() local
696 BN_ULONG c1, c2, c3; bn_mul_comba4() local
735 BN_ULONG c1, c2, c3; bn_sqr_comba8() local
810 BN_ULONG c1, c2, c3; bn_sqr_comba4() local
[all...]
/third_party/pcre2/pcre2/src/
H A Dpcre2_string_utils.c104 PCRE2_UCHAR c1, c2; in strcmp() local
108 c2 = *str2++; in strcmp()
109 if (c1 != c2) return ((c1 > c2) << 1) - 1; in strcmp()
132 PCRE2_UCHAR c1, c2; in strcmp_c8() local
136 c2 = *str2++; in strcmp_c8()
137 if (c1 != c2) return ((c1 > c2) << 1) - 1; in strcmp_c8()
159 PCRE2_UCHAR c1, c2; in strncmp() local
163 c2 in strncmp()
188 PCRE2_UCHAR c1, c2; strncmp_c8() local
[all...]
/third_party/icu/icu4c/source/common/
H A Dutrie.h185 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \
194 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
223 /** Internal next-post-increment: get the next code point (c, c2) and its data */
224 #define _UTRIE_NEXT(trie, data, src, limit, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \
227 (c2)=0; \
229 } else if((src)!=(limit) && U16_IS_TRAIL((c2)=*(src))) { \
231 _UTRIE_GET_FROM_PAIR((trie), data, (c), (c2), (result), resultType); \
234 (c2)=0; \
239 /** Internal previous: get the previous code point (c, c2) and its data */
240 #define _UTRIE_PREVIOUS(trie, data, start, src, c, c2, resul
[all...]
H A Dunormcmp.cpp64 * get one code unit c2 from s2 (-1 if end of source)
69 * if(c1==c2) {
73 * // c1!=c2
74 * try to decompose/case-fold c1/c2, and continue if one does;
76 * // still c1!=c2 and neither decomposes/case-folds, return result
77 * return c1-c2;
169 UChar32 c1, c2, cp1, cp2; in unorm_cmpEquivFold() local
205 c1=c2=-1; in unorm_cmpEquivFold()
237 if(c2<0) { in unorm_cmpEquivFold()
240 if(s2==limit2 || ((c2 in unorm_cmpEquivFold()
[all...]
/third_party/node/deps/icu-small/source/common/
H A Dutrie.h185 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \
194 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
223 /** Internal next-post-increment: get the next code point (c, c2) and its data */
224 #define _UTRIE_NEXT(trie, data, src, limit, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \
227 (c2)=0; \
229 } else if((src)!=(limit) && U16_IS_TRAIL((c2)=*(src))) { \
231 _UTRIE_GET_FROM_PAIR((trie), data, (c), (c2), (result), resultType); \
234 (c2)=0; \
239 /** Internal previous: get the previous code point (c, c2) and its data */
240 #define _UTRIE_PREVIOUS(trie, data, start, src, c, c2, resul
[all...]
H A Dunormcmp.cpp64 * get one code unit c2 from s2 (-1 if end of source)
69 * if(c1==c2) {
73 * // c1!=c2
74 * try to decompose/case-fold c1/c2, and continue if one does;
76 * // still c1!=c2 and neither decomposes/case-folds, return result
77 * return c1-c2;
169 UChar32 c1, c2, cp1, cp2; in unorm_cmpEquivFold() local
205 c1=c2=-1; in unorm_cmpEquivFold()
237 if(c2<0) { in unorm_cmpEquivFold()
240 if(s2==limit2 || ((c2 in unorm_cmpEquivFold()
[all...]
/third_party/skia/third_party/externals/icu/source/common/
H A Dutrie.h185 #define _UTRIE_GET_FROM_PAIR(trie, data, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \
194 (result)=_UTRIE_GET_RAW((trie), data, __offset, (c2)&0x3ff); \
223 /** Internal next-post-increment: get the next code point (c, c2) and its data */
224 #define _UTRIE_NEXT(trie, data, src, limit, c, c2, result, resultType) UPRV_BLOCK_MACRO_BEGIN { \
227 (c2)=0; \
229 } else if((src)!=(limit) && U16_IS_TRAIL((c2)=*(src))) { \
231 _UTRIE_GET_FROM_PAIR((trie), data, (c), (c2), (result), resultType); \
234 (c2)=0; \
239 /** Internal previous: get the previous code point (c, c2) and its data */
240 #define _UTRIE_PREVIOUS(trie, data, start, src, c, c2, resul
[all...]
H A Dunormcmp.cpp64 * get one code unit c2 from s2 (-1 if end of source)
69 * if(c1==c2) {
73 * // c1!=c2
74 * try to decompose/case-fold c1/c2, and continue if one does;
76 * // still c1!=c2 and neither decomposes/case-folds, return result
77 * return c1-c2;
169 UChar32 c1, c2, cp1, cp2; in unorm_cmpEquivFold() local
205 c1=c2=-1; in unorm_cmpEquivFold()
237 if(c2<0) { in unorm_cmpEquivFold()
240 if(s2==limit2 || ((c2 in unorm_cmpEquivFold()
[all...]
/third_party/python/Tools/unicode/
H A Dgenmap_japanese.py95 for c2, code in m.items():
97 sjisencmap[code >> 8][code & 0xff] = c1 << 8 | c2
99 for c2, code in m.items():
102 cp932encmap[code >> 8][code & 0xff] = c1 << 8 | c2
104 for c2, code in m.copy().items():
105 if c1 in sjisencmap and c2 in sjisencmap[c1] and sjisencmap[c1][c2] == code:
106 del cp932encmap[c1][c2]
114 for c2, modifier in m2.items():
115 jisx0213pairencmap.append((unibody, modifier, c1 << 8 | c2))
[all...]
/third_party/typescript/tests/baselines/reference/
H A DcommentsInheritance.js50 class c2 {
51 /** c2 c2_p1*/
53 /** c2 c2_f1*/
56 /** c2 c2_prop*/
66 /** c2 p1*/
68 /** c2 f1*/
71 /** c2 prop*/
81 /** c2 constructor*/
86 class c3 extends c2 {
106 var c2_i = new c2(1
[all...]
H A DaugmentedTypesClass2a.js3 class c2 { public foo() { } } // error
4 function c2() { } // error function
5 var c2 = () => { }
9 var c2 = /** @class */ (function () {
10 function c2() {
12 c2.prototype.foo = function () { };
13 return c2;
15 function c2() { } // error
16 var c2 = function () { };
H A DmethodSignaturesWithOverloads2.js18 var c2: { variable
28 c2.func4 = c2.func5;
29 c2.func5 = c2.func4;
37 var c2; variable
39 c2.func4 = c2.func5;
40 c2.func5 = c2
[all...]
/third_party/ffmpeg/libavformat/
H A Durldecode.c54 char c2 = url[s++]; in ff_urldecode() local
56 if (av_isxdigit(c2) && av_isxdigit(c3)) { in ff_urldecode()
57 c2 = av_tolower(c2); in ff_urldecode()
60 if (c2 <= '9') in ff_urldecode()
61 c2 = c2 - '0'; in ff_urldecode()
63 c2 = c2 - 'a' + 10; in ff_urldecode()
70 dest[d++] = 16 * c2 in ff_urldecode()
[all...]
/third_party/musl/libc-test/src/functionalext/supplement/ctype/
H A Dtoascii.c27 char c2 = toascii(c1); in toascii_0100() local
28 if (c2 != 'a') { in toascii_0100()
29 t_error("%s toascii failed. c2 id %c", __func__, c2); in toascii_0100()
41 char c2 = toascii(c1); in toascii_0200() local
42 if (c2 != '!') { in toascii_0200()
43 t_error("%s toascii failed. c2 id %c", __func__, c2); in toascii_0200()
55 char c2 = toascii(c1); in toascii_0300() local
56 if (c2 ! in toascii_0300()
[all...]

Completed in 13 milliseconds

12345678910>>...32