| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
| co-586.pl | 18 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
38 &adc($c2,0);
46 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
67 &adc($c2,0);
75 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
94 &adc($c2,0);
99 &adc($c2,0);
108 local($a,$b,$c0,$c1,$c2);
116 $c2="ebp";
148 &xor($c2,$c2) if ($j == $bs)
[all...] |
| bn-mips.S | 759 multu $12,$8 # mul_add_c(a[0],b[0],c1,c2,c3);
769 multu $12,$9 # mul_add_c(a[0],b[1],c2,c3,c1);
778 multu $13,$8 # mul_add_c(a[1],b[0],c2,c3,c1);
787 multu $14,$8 # mul_add_c(a[2],b[0],c3,c1,c2);
791 sw $3,4($4) # r[1]=c2;
797 multu $13,$9 # mul_add_c(a[1],b[1],c3,c1,c2);
804 multu $12,$10 # mul_add_c(a[0],b[2],c3,c1,c2);
812 multu $12,$11 # mul_add_c(a[0],b[3],c1,c2,c3);
823 multu $13,$10 # mul_add_c(a[1],b[2],c1,c2,c3);
831 multu $14,$9 # mul_add_c(a[2],b[1],c1,c2,c3)
[all...] |
| /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/x86/ |
| comba.pl | 6 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
26 &adc($c2,0);
34 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
55 &adc($c2,0);
63 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
82 &adc($c2,0);
87 &adc($c2,0);
96 local($a,$b,$c0,$c1,$c2);
104 $c2="ebp";
136 &xor($c2,$c2) if ($j == $bs)
[all...] |
| /external/openssl/crypto/bn/asm/ |
| co-586.pl | 18 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
38 &adc($c2,0);
46 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
67 &adc($c2,0);
75 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
94 &adc($c2,0);
99 &adc($c2,0);
108 local($a,$b,$c0,$c1,$c2);
116 $c2="ebp";
148 &xor($c2,$c2) if ($j == $bs)
[all...] |
| bn-mips.S | 759 multu $12,$8 # mul_add_c(a[0],b[0],c1,c2,c3);
769 multu $12,$9 # mul_add_c(a[0],b[1],c2,c3,c1);
778 multu $13,$8 # mul_add_c(a[1],b[0],c2,c3,c1);
787 multu $14,$8 # mul_add_c(a[2],b[0],c3,c1,c2);
791 sw $3,4($4) # r[1]=c2;
797 multu $13,$9 # mul_add_c(a[1],b[1],c3,c1,c2);
804 multu $12,$10 # mul_add_c(a[0],b[2],c3,c1,c2);
812 multu $12,$11 # mul_add_c(a[0],b[3],c1,c2,c3);
823 multu $13,$10 # mul_add_c(a[1],b[2],c1,c2,c3);
831 multu $14,$9 # mul_add_c(a[2],b[1],c1,c2,c3)
[all...] |
| /external/openssl/crypto/bn/asm/x86/ |
| comba.pl | 6 local($a,$ai,$b,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
26 &adc($c2,0);
34 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
55 &adc($c2,0);
63 local($r,$a,$ai,$bi,$c0,$c1,$c2,$pos,$i,$na,$nb)=@_;
82 &adc($c2,0);
87 &adc($c2,0);
96 local($a,$b,$c0,$c1,$c2);
104 $c2="ebp";
136 &xor($c2,$c2) if ($j == $bs)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/platform/text/ |
| BidiContext.cpp | 100 bool operator==(const BidiContext& c1, const BidiContext& c2)
102 if (&c1 == &c2)
104 if (c1.level() != c2.level() || c1.override() != c2.override() || c1.dir() != c2.dir() || c1.source() != c2.source())
107 return !c2.parent();
108 return c2.parent() && *c1.parent() == *c2.parent();
|
| /external/lzma/CPP/Common/ |
| MyString.cpp | 141 wchar_t c2 = *s2++;
143 wchar_t u2 = MyCharUpper(c2);
159 unsigned char c2 = (unsigned char)*s2++;
local
160 if (c1 < c2) return -1;
161 if (c1 > c2) return 1;
171 wchar_t c2 = *s2++;
local
172 if (c1 < c2) return -1;
173 if (c1 > c2) return 1;
183 wchar_t c2 = *s2++;
local
184 if (c1 != c2)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| move.pass.cpp | 31 std::deque<MoveOnly, A> c2(A(2));
33 c2.push_back(MoveOnly(*p));
35 assert(c2 == c3);
46 std::deque<MoveOnly, A> c2(A(2));
48 c2.push_back(MoveOnly(*p));
50 assert(c2 == c3);
62 std::deque<MoveOnly, A> c2(A{});
64 c2.push_back(MoveOnly(*p));
66 assert(c2 == c3);
|
| move_alloc.pass.cpp | 31 std::deque<MoveOnly, A> c2(A(1));
33 c2.push_back(MoveOnly(*p));
35 assert(c2 == c3);
46 std::deque<MoveOnly, A> c2(A(1));
48 c2.push_back(MoveOnly(*p));
50 assert(c2 == c3);
61 std::deque<MoveOnly, A> c2(A(1));
63 c2.push_back(MoveOnly(*p));
65 assert(c2 == c3);
77 std::deque<MoveOnly, A> c2(A{})
[all...] |
| move_assign.pass.cpp | 31 std::deque<MoveOnly, A> c2(A(5));
33 c2.push_back(MoveOnly(*p));
36 assert(c2 == c3);
47 std::deque<MoveOnly, A> c2(A(5));
49 c2.push_back(MoveOnly(*p));
52 assert(c2 == c3);
63 std::deque<MoveOnly, A> c2(A(5));
65 c2.push_back(MoveOnly(*p));
68 assert(c2 == c3);
80 std::deque<MoveOnly, A> c2(A{})
[all...] |
| /external/embunit/src/ |
| stdImpl.c | 103 char c1,c2; local
106 c2 = *s2++;
107 } while ((c1) && (c2) && (c1==c2));
108 return c1 - c2;
|
| /external/chromium_org/third_party/icu/source/common/ |
| unormcmp.cpp | 64 * 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;
170 UChar32 c1, c2, cp1, cp2; local
211 c1=c2=-1;
243 if(c2<0) {
246 if(s2==limit2 || ((c2=*s2)==0 && (limit2==NULL || (options&_STRNCMP_STYLE))))
[all...] |
| /external/icu4c/common/ |
| unormcmp.cpp | 64 * 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;
170 UChar32 c1, c2, cp1, cp2; local
211 c1=c2=-1;
243 if(c2<0) {
246 if(s2==limit2 || ((c2=*s2)==0 && (limit2==NULL || (options&_STRNCMP_STYLE))))
[all...] |
| /art/runtime/ |
| dex_instruction_visitor_test.cc | 55 const uint16_t c2[] = { 0, 0 }; local
56 v2.Visit(c2, sizeof(c2));
|
| /external/chromium_org/third_party/openssl/openssl/crypto/ |
| o_str.c | 105 const unsigned char *c1=v1,*c2=v2; local
108 while(n && (ret=*c1-*c2)==0) n--,c1++,c2++;
|
| /external/clang/test/CodeGen/ |
| atomics-inlining.c | 7 unsigned char c1, c2; variable
23 (void)__atomic_load(&c1, &c2, memory_order_seq_cst);
24 (void)__atomic_store(&c1, &c2, memory_order_seq_cst);
|
| /external/openssl/crypto/ |
| o_str.c | 105 const unsigned char *c1=v1,*c2=v2; local
108 while(n && (ret=*c1-*c2)==0) n--,c1++,c2++;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/template.bitset/bitset.members/ |
| count.pass.cpp | 33 std::size_t c2 = 0; local
36 ++c2;
37 assert(c1 == c2);
|
| /external/bison/lib/ |
| strverscmp.c | 65 unsigned char c1, c2; local
99 c2 = *p2++;
103 while ((diff = c1 - c2) == 0 && c1 != '\0')
107 c2 = *p2++;
111 state = result_type[state << 2 | ((c2 == '0') + (ISDIGIT (c2) != 0))];
|
| /external/blktrace/ |
| strverscmp.c | 93 unsigned char c1, c2;
local
127 c2 = *p2++;
131 while ((diff = c1 - c2) == 0 && c1 != '\0')
135 c2 = *p2++;
139 state = result_type[state << 2 | (((c2 == '0') + (isdigit (c2) != 0)))];
|
| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| strverscmp.c | 67 unsigned char c1, c2; local
101 c2 = *p2++;
105 while ((diff = c1 - c2) == 0 && c1 != '\0')
109 c2 = *p2++;
113 state = result_type[state << 2 | ((c2 == '0') + (ISDIGIT (c2) != 0))];
|
| /external/eigen/test/ |
| block.cpp | 38 Index c2 = internal::random<Index>(c1,cols-1); local
50 m1.col(c1) += s1 * m1_copy.col(c2);
51 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + s1 * m1_copy.col(c2));
52 m1.col(c1).col(0) += s1 * m1_copy.col(c2);
53 VERIFY_IS_APPROX(m1.col(c1), m1_copy.col(c1) + Scalar(2) * s1 * m1_copy.col(c2));
64 m1.block(r1,c1,r2-r1+1,c2-c1+1) = s1 * m2.block(0, 0, r2-r1+1,c2-c1+1);
65 m1.block(r1,c1,r2-r1+1,c2-c1+1)(r2-r1,c2-c1) = m2.block(0, 0, r2-r1+1,c2-c1+1)(0,0)
194 Index c2 = internal::random<Index>(c1,cols-1); local
[all...] |
| /external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/cert/ |
| CertificateTest.java | 67 Certificate c2 = new MyCertificate("TEST_TYPE", testEncoding); local
69 assertTrue(c1.hashCode() == c2.hashCode());
78 Certificate c2 = new MyCertificate("TEST_TYPE", testEncoding); local
80 assertTrue((c1.hashCode() == c2.hashCode()) && c1.equals(c2));
109 Certificate c2 = new MyCertificate("TEST_TYPE", testEncoding); local
110 assertTrue(c1.equals(c2) && c2.equals(c1));
|
| /external/apache-http/src/org/apache/http/cookie/ |
| CookiePathComparator.java | 66 public int compare(final Cookie c1, final Cookie c2) {
68 String path2 = normalizePath(c2);
|
