Home
last modified time | relevance | path

Searched refs:C2 (Results 1 – 25 of 308) sorted by relevance

12345678910>>...13

/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DRow.java15 public class Row<C0, C1, C2, C3, C4> implements java.lang.Comparable, Cloneable,
16 Freezable<Row<C0, C1, C2, C3, C4>>{
26 public static <C0, C1, C2> R3<C0,C1,C2> of(C0 p0, C1 p1, C2 p2) { in of()
27 return new R3<C0,C1,C2>(p0,p1,p2); in of()
29 public static <C0, C1, C2, C3> R4<C0,C1,C2,C3> of(C0 p0, C1 p1, C2 p2, C3 p3) { in of()
30 return new R4<C0,C1,C2,C3>(p0,p1,p2,p3); in of()
32 public static <C0, C1, C2, C3, C4> R5<C0,C1,C2,C3,C4> of(C0 p0, C1 p1, C2 p2, C3 p3, C4 p4) { in of()
33 return new R5<C0,C1,C2,C3,C4>(p0,p1,p2,p3,p4); in of()
41 public static class R3<C0, C1, C2> extends Row<C0, C1, C2, C2, C2> {
42 public R3(C0 a, C1 b, C2 c) { in R3()
[all …]
/external/libcxxabi/test/
Dcatch_class_03.pass.cpp43 struct C2 struct
48 explicit C2(int id) : B(id-2), id_(id) {count++;} in C2() argument
49 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2() function
50 ~C2() {count--;} in ~C2() argument
53 int C2::count = 0;
56 : C1, C2
60 explicit A(int id) : C1(id-1), C2(id-2), id_(id) {count++;} in A()
61 A(const A& a) : C1(a.id_-1), C2(a.id_-2), id_(a.id_) {count++;} in A()
71 assert(C2::count == 0); in f1()
76 assert(C2::count == 1); in f1()
[all …]
Dcatch_class_04.pass.cpp43 struct C2 struct
48 explicit C2(int id) : B(id-2), id_(id) {count++;} in C2() argument
49 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2() function
50 ~C2() {count--;} in ~C2() argument
53 int C2::count = 0;
56 : C1, C2
60 explicit A(int id) : C1(id-1), C2(id-2), B(id+3), id_(id) {count++;} in A()
61 A(const A& a) : C1(a.id_-1), C2(a.id_-2), B(a.id_+3), id_(a.id_) {count++;} in A()
71 assert(C2::count == 0); in f1()
76 assert(C2::count == 1); in f1()
[all …]
Dcatch_ptr.pass.cpp43 struct C2 struct
48 explicit C2(int id) : B(id-2), id_(id) {count++;} in C2() argument
49 C2(const C2& a) : B(a.id_-2), id_(a.id_) {count++;} in C2() function
50 ~C2() {count--;} in ~C2() argument
53 int C2::count = 0;
56 : C1, C2
60 explicit A(int id) : C1(id-1), C2(id-2), B(id+3), id_(id) {count++;} in A()
61 A(const A& a) : C1(a.id_-1), C2(a.id_-2), B(a.id_+3), id_(a.id_) {count++;} in A()
86 assert(static_cast<const C2*>(a)->id_ == 3); in f2()
94 catch (const C2*) in f2()
[all …]
/external/clang/test/SemaCXX/
Dnested-name-spec.cpp28 class C2 { class
38 void C2::m() const { } // expected-error{{out-of-line definition of 'm' does not match any declarat… in m()
40 void C2::f(int) { } // expected-error{{out-of-line definition of 'f' does not match any declaration… in f()
42 void C2::m() { in m()
101 typedef void C2::f5(int); // expected-error{{typedef declarator cannot be qualified}}
319 typedef int C2; typedef
326 struct C2 { static const unsigned N1 = 1; }; struct
334 struct S1a { int f(C1::C2); };
335 struct S1b { int f(C1:C2); }; // expected-error{{unexpected ':' in nested name specifier; did you …
338 C1::C2 f(C1::C2);
[all …]
/external/guava/guava-gwt/src-super/java/util/super/java/util/concurrent/
DTimeUnit.java21 public long toMillis(long d) { return d/(C2/C0); } in toMillis()
27 int excessNanos(long d, long m) { return (int)(d - (m*C2)); } in excessNanos()
32 public long toMillis(long d) { return d/(C2/C1); } in toMillis()
38 int excessNanos(long d, long m) { return (int)((d*C1) - (m*C2)); } in excessNanos()
41 public long toNanos(long d) { return x(d, C2/C0, MAX/(C2/C0)); } in toNanos()
42 public long toMicros(long d) { return x(d, C2/C1, MAX/(C2/C1)); } in toMicros()
44 public long toSeconds(long d) { return d/(C3/C2); } in toSeconds()
45 public long toMinutes(long d) { return d/(C4/C2); } in toMinutes()
46 public long toHours(long d) { return d/(C5/C2); } in toHours()
47 public long toDays(long d) { return d/(C6/C2); } in toDays()
[all …]
/external/mesa3d/src/gallium/drivers/nv50/
Dnv50_formats.c160 C4A(B8G8R8A8_UNORM, BGRA8_UNORM, C2, C1, C0, C3, UNORM, 8_8_8_8, TDV, 1),
161 F3A(B8G8R8X8_UNORM, BGRX8_UNORM, C2, C1, C0, xx, UNORM, 8_8_8_8, TD),
162 C4A(B8G8R8A8_SRGB, BGRA8_SRGB, C2, C1, C0, C3, UNORM, 8_8_8_8, TD, 1),
163 F3A(B8G8R8X8_SRGB, BGRX8_SRGB, C2, C1, C0, xx, UNORM, 8_8_8_8, TD),
164 C4A(R8G8B8A8_UNORM, RGBA8_UNORM, C0, C1, C2, C3, UNORM, 8_8_8_8, TBV, 0),
165 F3A(R8G8B8X8_UNORM, RGBX8_UNORM, C0, C1, C2, xx, UNORM, 8_8_8_8, TB),
166 C4A(R8G8B8A8_SRGB, RGBA8_SRGB, C0, C1, C2, C3, UNORM, 8_8_8_8, TB, 0),
179 F3B(B5G6R5_UNORM, B5G6R5_UNORM, C2, C1, C0, xx, UNORM, 5_6_5, T),
180 C4B(B5G5R5A1_UNORM, BGR5_A1_UNORM, C2, C1, C0, C3, UNORM, 5_5_5_1, TB),
181 F3B(B5G5R5X1_UNORM, BGR5_X1_UNORM, C2, C1, C0, xx, UNORM, 5_5_5_1, TB),
[all …]
/external/valgrind/none/tests/s390x/
Dicm.stdout.exp1 …C2 00 00 C3 C2 00 C3 00 00 00 C3 00 95 00 C3 00 C2 00 C3 00 C2 00 C3 C2 00 00 C3 C2 97 00 C3 C2 C1…
/external/llvm/test/Transforms/InstSimplify/
Dapint-or.ll5 ;; If we have: ((V + N) & C1) | (V & C2)
6 ;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
8 %C1 = xor i39 274877906943, -1 ;; C2 = 274877906943
23 ;; If we have: ((V + N) & C1) | (V & C2)
24 ;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
26 %C1 = xor i399 274877906943, -1 ;; C2 = 274877906943
/external/clang/test/CodeGenCXX/
Dvtable-layout-extreme.cpp15 class C2 class
24 , public C2
32 : public C2
41 , public C2
61 , virtual public C2
72 , public C2
198 , public C2
/external/llvm/include/llvm/IR/
DConstants.h863 static Constant *getAdd(Constant *C1, Constant *C2,
865 static Constant *getFAdd(Constant *C1, Constant *C2);
866 static Constant *getSub(Constant *C1, Constant *C2,
868 static Constant *getFSub(Constant *C1, Constant *C2);
869 static Constant *getMul(Constant *C1, Constant *C2,
871 static Constant *getFMul(Constant *C1, Constant *C2);
872 static Constant *getUDiv(Constant *C1, Constant *C2, bool isExact = false);
873 static Constant *getSDiv(Constant *C1, Constant *C2, bool isExact = false);
874 static Constant *getFDiv(Constant *C1, Constant *C2);
875 static Constant *getURem(Constant *C1, Constant *C2);
[all …]
/external/google-breakpad/src/common/
Dscoped_ptr.h154 template <class C2> bool operator==(scoped_ptr<C2> const& p2) const;
155 template <class C2> bool operator!=(scoped_ptr<C2> const& p2) const;
259 template <class C2> bool operator==(scoped_array<C2> const& p2) const;
260 template <class C2> bool operator!=(scoped_array<C2> const& p2) const;
377 template <class C2, class GP>
378 bool operator==(scoped_ptr_malloc<C2, GP> const& p) const;
379 template <class C2, class GP>
380 bool operator!=(scoped_ptr_malloc<C2, GP> const& p) const;
/external/llvm/test/Transforms/InstCombine/
Dapint-xor2.ll9 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
47 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2
Dapint-xor1.ll8 ;; (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
46 ;; (A | C1) ^ C2 -> (A | C1) & ~C2 iff (C1&C2) == C2
Dapint-or2.ll25 ;; If we have: ((V + N) & C1) | (V & C2)
26 ;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
28 %C1 = xor i399 274877906943, -1 ;; C2 = 274877906943
Dapint-or1.ll26 ;; If we have: ((V + N) & C1) | (V & C2)
27 ;; .. and C2 = ~C1 and C2 is 0+1+ and (N & C2) == 0
29 %C1 = xor i39 274877906943, -1 ;; C2 = 274877906943
Dfast-math.ll40 ; (C1 - X) + (C2 - Y) => (C1+C2) - (X + Y)
51 ; (X + C1) + C2 => X + (C1 + C2)
99 ; Let C3 = C1 + C2. (f1 + C1) + (f2 + C2) => (f1 + f2) + C3 instead of
185 ; ((X*C1) + C2) * C3 => (X * (C1*C3)) + (C2*C3) (i.e. distribution)
196 ; (X/C1 + C2) * C3 => X/(C1/C3) + C2*C3
221 ; ((X*C1) + C2) * C3 => (X * (C1*C3)) + (C2*C3) (i.e. distribution)
232 ; C1/X * C2 => (C1*C2) / X
241 ; X/C1 * C2 => X * (C2/C1) is disabled if X/C1 has multiple uses
253 ; X/C1 * C2 => X * (C2/C1) (if C2/C1 is normal Fp)
278 ; Rule "X/C1 * C2 => X * (C2/C1) is not applicable if C2/C1 is either a special
[all …]
/external/llvm/test/CodeGen/Hexagon/intrinsics/
Dcr.ll20 declare i32 @llvm.hexagon.C2.any8(i32)
22 %z = call i32@llvm.hexagon.C2.any8(i32 %a)
27 declare i32 @llvm.hexagon.C2.all8(i32)
29 %z = call i32@llvm.hexagon.C2.all8(i32 %a)
36 declare i32 @llvm.hexagon.C2.and(i32, i32)
38 %z = call i32@llvm.hexagon.C2.and(i32 %a, i32 %b)
50 declare i32 @llvm.hexagon.C2.or(i32, i32)
52 %z = call i32@llvm.hexagon.C2.or(i32 %a, i32 %b)
64 declare i32 @llvm.hexagon.C2.xor(i32, i32)
66 %z = call i32@llvm.hexagon.C2.xor(i32 %a, i32 %b)
[all …]
/external/pdfium/third_party/base/
Dnonstd_unique_ptr.h167 template <class C2> bool operator==(unique_ptr<C2> const& p2) const;
168 template <class C2> bool operator!=(unique_ptr<C2> const& p2) const;
212 template <class C2> bool operator==(unique_ptr<C2> const& p2) const;
213 template <class C2> bool operator!=(unique_ptr<C2> const& p2) const;
/external/v8/test/mjsunit/
Dsetter-on-constructor-prototype.js46 function C2() { class in RunTest
49 C2.prototype = { }; class
50 C2.prototype.__proto__ = { set x(value) { this.y = 23; } };
52 %ToFastProperties(C2.prototype.__proto__)
56 var c2 = new C2();
/external/llvm/lib/IR/
DConstantFold.cpp912 Constant *C1, Constant *C2) { in ConstantFoldBinaryInstruction() argument
914 if (isa<UndefValue>(C1) || isa<UndefValue>(C2)) { in ConstantFoldBinaryInstruction()
917 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) in ConstantFoldBinaryInstruction()
926 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) // undef & undef -> undef in ConstantFoldBinaryInstruction()
931 if (isa<UndefValue>(C1) && isa<UndefValue>(C2)) in ConstantFoldBinaryInstruction()
935 if (match(C1, m_APInt(CV)) || match(C2, m_APInt(CV))) in ConstantFoldBinaryInstruction()
946 return C2; in ConstantFoldBinaryInstruction()
949 if (match(C2, m_Zero()) || match(C2, m_One())) in ConstantFoldBinaryInstruction()
956 if (match(C2, m_Undef())) in ConstantFoldBinaryInstruction()
957 return C2; in ConstantFoldBinaryInstruction()
[all …]
/external/ceres-solver/include/ceres/internal/
Dscoped_ptr.h136 template <class C2> bool operator==(scoped_ptr<C2> const& p2) const;
137 template <class C2> bool operator!=(scoped_ptr<C2> const& p2) const;
264 template <class C2> bool operator==(scoped_array<C2> const& p2) const;
265 template <class C2> bool operator!=(scoped_array<C2> const& p2) const;
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/engines/
DAESEngine.java334 private int C0, C1, C2, C3; field in AESEngine
435 C2 = (bytes[index++] & 0xff); in unpackBlock()
436 C2 |= (bytes[index++] & 0xff) << 8; in unpackBlock()
437 C2 |= (bytes[index++] & 0xff) << 16; in unpackBlock()
438 C2 |= bytes[index++] << 24; in unpackBlock()
462 bytes[index++] = (byte)C2; in packBlock()
463 bytes[index++] = (byte)(C2 >> 8); in packBlock()
464 bytes[index++] = (byte)(C2 >> 16); in packBlock()
465 bytes[index++] = (byte)(C2 >> 24); in packBlock()
478 int t2 = this.C2 ^ KW[0][2]; in encryptBlock()
[all …]
/external/llvm/test/CodeGen/PowerPC/
Dvsx-fma-m.ll51 ; CHECK-DAG: li [[C2:[0-9]+]], 16
57 ; CHECK-DAG: stxsdx 1, 8, [[C2]]
69 ; CHECK-FISL-DAG: li [[C2:[0-9]+]], 16
70 ; CHECK-FISL-DAG: stxsdx 1, 8, [[C2]]
92 ; CHECK-DAG: li [[C2:[0-9]+]], 16
104 ; CHECK-DAG: stxsdx 1, 8, [[C2]]
116 ; CHECK-FISL-DAG: li [[C2:[0-9]+]], 16
117 ; CHECK-FISL-DAG: stxsdx 1, 8, [[C2]]
141 ; CHECK-DAG: li [[C2:[0-9]+]], 16
154 ; CHECK-DAG: stxsdx 1, 8, [[C2]]
[all …]
/external/eigen/Eigen/src/LU/arch/
DInverse_SSE.h182 __m128d A1, A2, B1, B2, C1, C2, D1, D2;
189 …C2 = matrix.template packet<MatrixAlignment>(12); D2 = matrix.template packet<MatrixAlignment>(14);
195 …A2 = matrix.template packet<MatrixAlignment>( 4); C2 = matrix.template packet<MatrixAlignment>( 6);
200 C1 = _mm_unpacklo_pd(C1,C2);
201 C2 = _mm_unpackhi_pd(tmp,C2);
234 dC = _mm_shuffle_pd(C2, C2, 1);
244 DC2 = _mm_mul_pd(C2, _mm_shuffle_pd(D1,D1,0));
245 DC1 = _mm_sub_pd(DC1, _mm_mul_pd(C2, _mm_shuffle_pd(D1,D1,3)));
256 iD2 = _mm_mul_pd(AB1, _mm_shuffle_pd(C2,C2,0));
258 iD2 = _mm_add_pd(iD2, _mm_mul_pd(AB2, _mm_shuffle_pd(C2,C2,3)));
[all …]

12345678910>>...13