Home
last modified time | relevance | path

Searched refs:C (Results 1 – 25 of 7003) sorted by relevance

12345678910>>...281

/external/libhevc/common/mips/
Dihevc_func_selector.h41 #define INTER_PRED_LUMA_COPY C
42 #define INTER_PRED_LUMA_HORZ C
43 #define INTER_PRED_LUMA_VERT C
44 #define INTER_PRED_LUMA_COPY_W16OUT C
45 #define INTER_PRED_LUMA_HORZ_W16OUT C
47 #define INTER_PRED_LUMA_VERT_W16OUT C
48 #define INTER_PRED_LUMA_VERT_W16INP C
49 #define INTER_PRED_LUMA_VERT_W16INP_W16OUT C
51 #define INTER_PRED_CHROMA_COPY C
52 #define INTER_PRED_CHROMA_HORZ C
[all …]
/external/libhevc/common/arm/
Dihevc_func_selector.h41 #define INTER_PRED_LUMA_COPY C
42 #define INTER_PRED_LUMA_HORZ C
43 #define INTER_PRED_LUMA_VERT C
44 #define INTER_PRED_LUMA_COPY_W16OUT C
45 #define INTER_PRED_LUMA_HORZ_W16OUT C
47 #define INTER_PRED_LUMA_VERT_W16OUT C
48 #define INTER_PRED_LUMA_VERT_W16INP C
49 #define INTER_PRED_LUMA_VERT_W16INP_W16OUT C
51 #define INTER_PRED_CHROMA_COPY C
52 #define INTER_PRED_CHROMA_HORZ C
[all …]
/external/libhevc/common/x86/
Dihevc_func_selector.h42 #define INTER_PRED_LUMA_COPY C
43 #define INTER_PRED_LUMA_HORZ C
44 #define INTER_PRED_LUMA_VERT C
45 #define INTER_PRED_LUMA_COPY_W16OUT C
46 #define INTER_PRED_LUMA_HORZ_W16OUT C
47 #define INTER_PRED_LUMA_VERT_W16OUT C
48 #define INTER_PRED_LUMA_VERT_W16INP C
49 #define INTER_PRED_LUMA_VERT_W16INP_W16OUT C
51 #define INTER_PRED_CHROMA_COPY C
52 #define INTER_PRED_CHROMA_HORZ C
[all …]
/external/chromium_org/sdch/open-vcdiff/src/
Dcodetable.cc58 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 19-34
59 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 35-50
60 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 51-66
61 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 67-82
62 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 83-98
63 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 99-114
64 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 115-130
65 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 131-146
66 C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, C, // opcodes 147-162
76 C, C, C, C, C, C, C, C, C }, // opcodes 247-255
[all …]
/external/valgrind/main/VEX/orig_ppc32/
Dmorefp.orig2 ==3289== Copyright (C) 2002-2004, and GNU GPL'd, by Nicholas Nethercote.
4 ==3289== Copyright (C) 2000-2004, and GNU GPL'd, by Julian Seward et al.
8 . 7C 23 0B 78 38 80 00 00 38 21 FF F0 90 81 00 00 4B FF 15 81
11 …C 08 02 A6 39 60 00 4B 94 21 FD 50 7D 69 03 A6 92 E1 02 8C 90 01 02 B4 7C 77 1B 78 93 01 02 90 38 …
20 . 7C E8 02 A6 3B 01 00 10 48 02 55 3D
26 …A6 81 87 00 00 81 0A 00 00 55 86 30 2E 7C C4 36 70 7C A8 38 50 39 01 00 30 7C E5 22 14 90 E1 00 10…
29 …20 6F FF 3F A0 6F FF 3F 80 6F FF 7C 0B 03 78 63 E6 FF FF 63 65 00 21 63 44 FD FF 63 23 FE 34 63 BD…
32 . 7D 48 01 2E 85 6A 00 08 2C 8B 00 00 40 86 FF D4
35 . 2C 0B 00 21 55 60 10 3A 40 81 00 18
38 . 7C 0B 30 50 28 80 00 0F 41 85 02 D8
[all …]
/external/chromium_org/third_party/cld/base/
Dscoped_ptr.h28 template <class C> class scoped_ptr;
29 template <class C, class Free> class scoped_ptr_malloc;
30 template <class C> class scoped_array;
32 template <class C>
33 scoped_ptr<C> make_scoped_ptr(C *);
44 template <class C>
49 typedef C element_type;
54 explicit scoped_ptr(C* p = NULL) : ptr_(p) { } in ptr_()
59 enum { type_must_be_complete = sizeof(C) }; in ~scoped_ptr()
66 void reset(C* p = NULL) {
[all …]
/external/ceres-solver/include/ceres/internal/
Dscoped_ptr.h46 template <class C> class scoped_ptr;
47 template <class C, class Free> class scoped_ptr_malloc;
48 template <class C> class scoped_array;
50 template <class C>
51 scoped_ptr<C> make_scoped_ptr(C *);
61 template <class C>
65 typedef C element_type;
70 explicit scoped_ptr(C* p = NULL) : ptr_(p) { } in ptr_()
75 enum { type_must_be_complete = sizeof(C) }; in ~scoped_ptr()
82 void reset(C* p = NULL) {
[all …]
/external/mesa3d/src/gallium/drivers/nv30/
Dnv30_format.c218 _(L8_UNORM , L8 , 0, C, C, C, 1, 0, 0, 0, x, NONE, ____),
219 _(L8_SNORM , L8 , 0, C, C, C, 1, 0, 0, 0, x, NONE, SSSS),
220 _(L8_SRGB , L8 , 0, C, C, C, 1, 0, 0, 0, x, SRGB, ____),
221 _(I8_UNORM , L8 , 0, C, C, C, C, 0, 0, 0, 0, NONE, ____),
222 _(I8_SNORM , L8 , 0, C, C, C, C, 0, 0, 0, 0, NONE, SSSS),
223 _(A8_UNORM , L8 , 0, 0, 0, 0, C, x, x, x, 0, NONE, ____),
224 _(A8_SNORM , L8 , 0, 0, 0, 0, C, x, x, x, 0, NONE, SSSS),
225 _(R8_UNORM , L8 , 0, C, 0, 0, 1, 0, x, x, x, NONE, ____),
226 _(R8_SNORM , L8 , 0, C, 0, 0, 1, 0, x, x, x, NONE, SSSS),
227 _(B5G5R5X1_UNORM , A1R5G5B5, 0, C, C, C, 1, 2, 1, 0, x, NONE, ____),
[all …]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv30/
Dnv30_format.c218 _(L8_UNORM , L8 , 0, C, C, C, 1, 0, 0, 0, x, NONE, ____),
219 _(L8_SNORM , L8 , 0, C, C, C, 1, 0, 0, 0, x, NONE, SSSS),
220 _(L8_SRGB , L8 , 0, C, C, C, 1, 0, 0, 0, x, SRGB, ____),
221 _(I8_UNORM , L8 , 0, C, C, C, C, 0, 0, 0, 0, NONE, ____),
222 _(I8_SNORM , L8 , 0, C, C, C, C, 0, 0, 0, 0, NONE, SSSS),
223 _(A8_UNORM , L8 , 0, 0, 0, 0, C, x, x, x, 0, NONE, ____),
224 _(A8_SNORM , L8 , 0, 0, 0, 0, C, x, x, x, 0, NONE, SSSS),
225 _(R8_UNORM , L8 , 0, C, 0, 0, 1, 0, x, x, x, NONE, ____),
226 _(R8_SNORM , L8 , 0, C, 0, 0, 1, 0, x, x, x, NONE, SSSS),
227 _(B5G5R5X1_UNORM , A1R5G5B5, 0, C, C, C, 1, 2, 1, 0, x, NONE, ____),
[all …]
/external/guava/guava/src/com/google/common/collect/
DRanges.java74 static <C extends Comparable<?>> Range<C> create( in create()
75 Cut<C> lowerBound, Cut<C> upperBound) { in create()
76 return new Range<C>(lowerBound, upperBound); in create()
86 public static <C extends Comparable<?>> Range<C> open(C lower, C upper) { in open()
97 public static <C extends Comparable<?>> Range<C> closed(C lower, C upper) { in closed()
108 public static <C extends Comparable<?>> Range<C> closedOpen( in closedOpen()
109 C lower, C upper) { in closedOpen()
120 public static <C extends Comparable<?>> Range<C> openClosed( in openClosed()
121 C lower, C upper) { in openClosed()
133 public static <C extends Comparable<?>> Range<C> range( in range()
[all …]
DCut.java37 abstract class Cut<C extends Comparable> implements Comparable<Cut<C>>, Serializable {
38 final C endpoint;
40 Cut(@Nullable C endpoint) { in Cut()
44 abstract boolean isLessThan(C value); in isLessThan()
49 abstract Cut<C> withLowerBoundType(BoundType boundType, DiscreteDomain<C> domain); in withLowerBoundType()
50 abstract Cut<C> withUpperBoundType(BoundType boundType, DiscreteDomain<C> domain); in withUpperBoundType()
55 abstract C leastValueAbove(DiscreteDomain<C> domain); in leastValueAbove()
56 abstract C greatestValueBelow(DiscreteDomain<C> domain); in greatestValueBelow()
62 Cut<C> canonical(DiscreteDomain<C> domain) { in canonical()
68 public int compareTo(Cut<C> that) { in compareTo()
[all …]
/external/chromium_org/third_party/harfbuzz-ng/src/
Dhb-ot-shape-complex-indic-table.cc96 /* 0910 */ _(VI,x), _(VI,x), _(VI,x), _(VI,x), _(VI,x), _(C,x), _(C,x), _(C,x),
97 /* 0918 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
98 /* 0920 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
99 /* 0928 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
100 /* 0930 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
101 /* 0938 */ _(C,x), _(C,x), _(M,T), _(M,R), _(N,x), _(A,x), _(M,R), _(M,L),
105 /* 0958 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
109 /* 0978 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
115 /* 0990 */ _(VI,x), _(x,x), _(x,x), _(VI,x), _(VI,x), _(C,x), _(C,x), _(C,x),
116 /* 0998 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
[all …]
/external/harfbuzz_ng/src/
Dhb-ot-shape-complex-indic-table.cc96 /* 0910 */ _(VI,x), _(VI,x), _(VI,x), _(VI,x), _(VI,x), _(C,x), _(C,x), _(C,x),
97 /* 0918 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
98 /* 0920 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
99 /* 0928 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
100 /* 0930 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
101 /* 0938 */ _(C,x), _(C,x), _(M,T), _(M,R), _(N,x), _(A,x), _(M,R), _(M,L),
105 /* 0958 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
109 /* 0978 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
115 /* 0990 */ _(VI,x), _(x,x), _(x,x), _(VI,x), _(VI,x), _(C,x), _(C,x), _(C,x),
116 /* 0998 */ _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x), _(C,x),
[all …]
/external/llvm/test/TableGen/
Dif.td5 // CHECK: class C
6 …C:y{3} }, 1, !if({ C:y{2} }, { C:x{0} }, !if({ C:y{1} }, { C:x{1} }, !if({ C:y{0} }, { C:x{2} }, ?…
7 class C<bits<3> x, bits<4> y, bit z> {
22 def C1 : C<{1, 0, 1}, {0, 1, 0, 1}, 0>;
23 def C2 : C<{0, 1, 0}, {1, 0, 1, 0}, 1>;
24 def C3 : C<{0, 0, 0}, {1, 0, 1, 0}, 0>;
25 def C4 : C<{0, 0, 0}, {0, 0, 0, 0}, 0>;
/external/chromium_org/third_party/icu/source/data/unidata/
DCaseFolding.txt38 # C: common case folding, common mappings shared by both simple and full mappings.
48 # A. To do a simple case folding, use the mappings with status C + S.
49 # B. To do a full case folding, use the mappings with status C + F.
59 # have the value C for the status field, and the code point itself for the mapping field.
61 # @missing: 0000..10FFFF; C; <code point>
64 0041; C; 0061; # LATIN CAPITAL LETTER A
65 0042; C; 0062; # LATIN CAPITAL LETTER B
66 0043; C; 0063; # LATIN CAPITAL LETTER C
67 0044; C; 0064; # LATIN CAPITAL LETTER D
68 0045; C; 0065; # LATIN CAPITAL LETTER E
[all …]
/external/icu/icu4c/source/data/unidata/
DCaseFolding.txt38 # C: common case folding, common mappings shared by both simple and full mappings.
48 # A. To do a simple case folding, use the mappings with status C + S.
49 # B. To do a full case folding, use the mappings with status C + F.
59 # have the value C for the status field, and the code point itself for the mapping field.
61 # @missing: 0000..10FFFF; C; <code point>
64 0041; C; 0061; # LATIN CAPITAL LETTER A
65 0042; C; 0062; # LATIN CAPITAL LETTER B
66 0043; C; 0063; # LATIN CAPITAL LETTER C
67 0044; C; 0064; # LATIN CAPITAL LETTER D
68 0045; C; 0065; # LATIN CAPITAL LETTER E
[all …]
/external/libcxx/test/containers/unord/unord.multimap/
Dtypes.pass.cpp39 typedef std::unordered_multimap<char, short> C; in main() typedef
40 static_assert((std::is_same<C::key_type, char>::value), ""); in main()
41 static_assert((std::is_same<C::mapped_type, short>::value), ""); in main()
42 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), ""); in main()
43 static_assert((std::is_same<C::key_equal, std::equal_to<C::key_type> >::value), ""); in main()
44 static_assert((std::is_same<C::allocator_type, std::allocator<C::value_type> >::value), ""); in main()
45 …static_assert((std::is_same<C::value_type, std::pair<const C::key_type, C::mapped_type> >::value),… in main()
46 static_assert((std::is_same<C::reference, C::value_type&>::value), ""); in main()
47 static_assert((std::is_same<C::const_reference, const C::value_type&>::value), ""); in main()
48 static_assert((std::is_same<C::pointer, C::value_type*>::value), ""); in main()
[all …]
/external/libcxx/test/containers/unord/unord.map/
Dtypes.pass.cpp39 typedef std::unordered_map<char, short> C; in main() typedef
40 static_assert((std::is_same<C::key_type, char>::value), ""); in main()
41 static_assert((std::is_same<C::mapped_type, short>::value), ""); in main()
42 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), ""); in main()
43 static_assert((std::is_same<C::key_equal, std::equal_to<C::key_type> >::value), ""); in main()
44 static_assert((std::is_same<C::allocator_type, std::allocator<C::value_type> >::value), ""); in main()
45 …static_assert((std::is_same<C::value_type, std::pair<const C::key_type, C::mapped_type> >::value),… in main()
46 static_assert((std::is_same<C::reference, C::value_type&>::value), ""); in main()
47 static_assert((std::is_same<C::const_reference, const C::value_type&>::value), ""); in main()
48 static_assert((std::is_same<C::pointer, C::value_type*>::value), ""); in main()
[all …]
/external/fio/crc/
Dsha1.c104 #define SHA_ROUND(t, input, fn, constant, A, B, C, D, E) do { \ argument
109 #define T_0_15(t, A, B, C, D, E) SHA_ROUND(t, SHA_SRC, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
110 #define T_16_19(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (((C^D)&B)^D) , 0x5a827999, A, B, C, D, E ) argument
111 #define T_20_39(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0x6ed9eba1, A, B, C, D, E ) argument
112 #define T_40_59(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, ((B&C)+(D&(B^C))) , 0x8f1bbcdc, A, B, C, D,… argument
113 #define T_60_79(t, A, B, C, D, E) SHA_ROUND(t, SHA_MIX, (B^C^D) , 0xca62c1d6, A, B, C, D, E ) argument
117 unsigned int A,B,C,D,E; in blk_SHA1Block() local
122 C = ctx->H[2]; in blk_SHA1Block()
127 T_0_15( 0, A, B, C, D, E); in blk_SHA1Block()
128 T_0_15( 1, E, A, B, C, D); in blk_SHA1Block()
[all …]
/external/clang/lib/StaticAnalyzer/Checkers/
DStreamChecker.cpp76 bool evalCall(const CallExpr *CE, CheckerContext &C) const;
77 void checkDeadSymbols(SymbolReaper &SymReaper, CheckerContext &C) const;
80 void Fopen(CheckerContext &C, const CallExpr *CE) const;
81 void Tmpfile(CheckerContext &C, const CallExpr *CE) const;
82 void Fclose(CheckerContext &C, const CallExpr *CE) const;
83 void Fread(CheckerContext &C, const CallExpr *CE) const;
84 void Fwrite(CheckerContext &C, const CallExpr *CE) const;
85 void Fseek(CheckerContext &C, const CallExpr *CE) const;
86 void Ftell(CheckerContext &C, const CallExpr *CE) const;
87 void Rewind(CheckerContext &C, const CallExpr *CE) const;
[all …]
/external/clang/test/CodeGenCXX/
Dmicrosoft-abi-vbtables.cpp9 struct C : virtual A { int c; }; struct
10 struct D : virtual B, virtual C { int d; };
33 struct C : virtual A { int c; }; argument
34 struct D : B, C { int d; };
54 struct C : virtual A, virtual B { int c; }; struct
55 C c;
64 struct C : B, virtual A { int c; }; struct
65 C c; // Force vbtable emission.
76 struct C : B { int c; }; argument
77 struct D : B, C { int d; };
[all …]
/external/libcxx/test/containers/unord/unord.set/
Dtypes.pass.cpp38 typedef std::unordered_set<short> C; in main() typedef
39 static_assert((std::is_same<C::value_type, short>::value), ""); in main()
40 static_assert((std::is_same<C::key_type, short>::value), ""); in main()
41 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), ""); in main()
42 static_assert((std::is_same<C::key_equal, std::equal_to<C::key_type> >::value), ""); in main()
43 static_assert((std::is_same<C::allocator_type, std::allocator<C::value_type> >::value), ""); in main()
44 static_assert((std::is_same<C::reference, C::value_type&>::value), ""); in main()
45 static_assert((std::is_same<C::const_reference, const C::value_type&>::value), ""); in main()
46 static_assert((std::is_same<C::pointer, C::value_type*>::value), ""); in main()
47 static_assert((std::is_same<C::const_pointer, const C::value_type*>::value), ""); in main()
[all …]
/external/libcxx/test/containers/unord/unord.multiset/
Dtypes.pass.cpp38 typedef std::unordered_multiset<short> C; in main() typedef
39 static_assert((std::is_same<C::value_type, short>::value), ""); in main()
40 static_assert((std::is_same<C::key_type, short>::value), ""); in main()
41 static_assert((std::is_same<C::hasher, std::hash<C::key_type> >::value), ""); in main()
42 static_assert((std::is_same<C::key_equal, std::equal_to<C::key_type> >::value), ""); in main()
43 static_assert((std::is_same<C::allocator_type, std::allocator<C::value_type> >::value), ""); in main()
44 static_assert((std::is_same<C::reference, C::value_type&>::value), ""); in main()
45 static_assert((std::is_same<C::const_reference, const C::value_type&>::value), ""); in main()
46 static_assert((std::is_same<C::pointer, C::value_type*>::value), ""); in main()
47 static_assert((std::is_same<C::const_pointer, const C::value_type*>::value), ""); in main()
[all …]
/external/openssl/crypto/md5/
Dmd5_dgst.c79 c->C=INIT_DATA_C; in fips_md_init()
91 register unsigned MD32_REG_T A,B,C,D,l; in md5_block_data_order() local
104 C=c->C; in md5_block_data_order()
111 R0(A,B,C,D,X( 0), 7,0xd76aa478L); HOST_c2l(data,l); X( 2)=l; in md5_block_data_order()
112 R0(D,A,B,C,X( 1),12,0xe8c7b756L); HOST_c2l(data,l); X( 3)=l; in md5_block_data_order()
113 R0(C,D,A,B,X( 2),17,0x242070dbL); HOST_c2l(data,l); X( 4)=l; in md5_block_data_order()
114 R0(B,C,D,A,X( 3),22,0xc1bdceeeL); HOST_c2l(data,l); X( 5)=l; in md5_block_data_order()
115 R0(A,B,C,D,X( 4), 7,0xf57c0fafL); HOST_c2l(data,l); X( 6)=l; in md5_block_data_order()
116 R0(D,A,B,C,X( 5),12,0x4787c62aL); HOST_c2l(data,l); X( 7)=l; in md5_block_data_order()
117 R0(C,D,A,B,X( 6),17,0xa8304613L); HOST_c2l(data,l); X( 8)=l; in md5_block_data_order()
[all …]
/external/stlport/test/eh/
Dtest_insert.h44 template <class C, class Iter>
45 size_t CountNewItems( const C&, const Iter& firstNew, in CountNewItems() argument
57 template <class C, class Iter>
58 size_t CountNewItems( const C& c, const Iter& firstNew, in CountNewItems()
64 template <class C, class Iter>
65 size_t CountNewItems( const C& c, const Iter& firstNew, in CountNewItems()
72 template <class C, class Iter, class KeyOfValue>
74 size_t CountUniqueItems_Aux( const C& original, const Iter& firstNew, in CountUniqueItems_Aux()
76 size_t CountUniqueItems_Aux( const C& original, Iter firstNew, in CountUniqueItems_Aux()
80 typedef typename C::key_type key; in CountUniqueItems_Aux()
[all …]

12345678910>>...281