| /external/llvm/lib/Transforms/IPO/ |
| LowerTypeTests.cpp | 276 SmallVector<MDNode *, 2> Types;
278 Types.clear();
279 GlobalAndOffset.first->getMetadata(LLVMContext::MD_type, Types);
280 for (MDNode *Type : Types) {
807 SmallVector<MDNode *, 2> Types;
810 Types.clear();
811 GO->getMetadata(LLVMContext::MD_type, Types);
812 for (MDNode *Type : Types) {
[all...] |
| /external/llvm/tools/llvm-readobj/ |
| COFFDumper.cpp | 698 // Print types first to build CVUDTNames, then print symbols.
[all...] |
| /external/llvm/utils/unittest/googletest/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
95 // two types are equal.
106 // template Types. This allows us to simulate variadic templates
107 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
113 // represents a type list with N types (T1, T2, ..., and TN) in it.
114 // Except for Types0, every struct in the family has two member types:
717 // as that would require them to count the length. Types<...> is muc
[all...] |
| /external/mesa3d/src/gtest/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
94 // two types are equal.
105 // template Types. This allows us to simulate variadic templates
106 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
112 // represents a type list with N types (T1, T2, ..., and TN) in it.
113 // Except for Types0, every struct in the family has two member types:
716 // as that would require them to count the length. Types<...> is muc
[all...] |
| /external/protobuf/gtest/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
63 // two types are equal.
97 // template Types. This allows us to simulate variadic templates
98 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
104 // represents a type list with N types (T1, T2, ..., and TN) in it.
105 // Except for Types0, every struct in the family has two member types:
708 // as that would require them to count the length. Types<...> is much
711 // argument, even if it has the default value (this means Types<int>
712 // will appear as Types<int, None, None, ..., None> in the compiler
[all...] |
| /external/swiftshader/third_party/LLVM/utils/unittest/googletest/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
95 // two types are equal.
106 // template Types. This allows us to simulate variadic templates
107 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
113 // represents a type list with N types (T1, T2, ..., and TN) in it.
114 // Except for Types0, every struct in the family has two member types:
717 // as that would require them to count the length. Types<...> is muc
[all...] |
| /external/v8/testing/gtest/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
94 // two types are equal.
105 // template Types. This allows us to simulate variadic templates
106 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
112 // represents a type list with N types (T1, T2, ..., and TN) in it.
113 // Except for Types0, every struct in the family has two member types:
716 // as that would require them to count the length. Types<...> is muc
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
94 // two types are equal.
105 // template Types. This allows us to simulate variadic templates
106 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
113 // represents a type list with N types (T1, T2, ..., and TN) in it.
114 // Except for Types0, every struct in the family has two member types:
717 // as that would require them to count the length. Types<...> is muc
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 372 /// non-constant operands. The types of the arguments are ordinarily
448 // TODO: If one of the types get legalized by splitting, handle this
484 // Bitcast between types that are legalized to the same type are free.
634 // TODO: If one of the types get legalized by splitting, handle this
664 // Assuming that all loads of legal types cost 1.
816 SmallVector<Type *, 4> Types;
820 Types.push_back(VF == 1 ? OpTy : VectorType::get(OpTy, VF));
838 getIntrinsicInstrCost(IID, RetTy, Types, FMF, ScalarizationCost);
841 assert (VF == 1 && "Can't vectorize types here.");
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 372 /// non-constant operands. The types of the arguments are ordinarily
448 // TODO: If one of the types get legalized by splitting, handle this
484 // Bitcast between types that are legalized to the same type are free.
634 // TODO: If one of the types get legalized by splitting, handle this
664 // Assuming that all loads of legal types cost 1.
816 SmallVector<Type *, 4> Types;
820 Types.push_back(VF == 1 ? OpTy : VectorType::get(OpTy, VF));
838 getIntrinsicInstrCost(IID, RetTy, Types, FMF, ScalarizationCost);
841 assert (VF == 1 && "Can't vectorize types here.");
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 372 /// non-constant operands. The types of the arguments are ordinarily
448 // TODO: If one of the types get legalized by splitting, handle this
484 // Bitcast between types that are legalized to the same type are free.
634 // TODO: If one of the types get legalized by splitting, handle this
664 // Assuming that all loads of legal types cost 1.
816 SmallVector<Type *, 4> Types;
820 Types.push_back(VF == 1 ? OpTy : VectorType::get(OpTy, VF));
838 getIntrinsicInstrCost(IID, RetTy, Types, FMF, ScalarizationCost);
841 assert (VF == 1 && "Can't vectorize types here.");
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 372 /// non-constant operands. The types of the arguments are ordinarily
448 // TODO: If one of the types get legalized by splitting, handle this
484 // Bitcast between types that are legalized to the same type are free.
634 // TODO: If one of the types get legalized by splitting, handle this
664 // Assuming that all loads of legal types cost 1.
816 SmallVector<Type *, 4> Types;
820 Types.push_back(VF == 1 ? OpTy : VectorType::get(OpTy, VF));
838 getIntrinsicInstrCost(IID, RetTy, Types, FMF, ScalarizationCost);
841 assert (VF == 1 && "Can't vectorize types here.");
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/ |
| BasicTTIImpl.h | 425 /// non-constant operands. The types of the arguments are ordinarily
501 // TODO: If one of the types get legalized by splitting, handle this
537 // Bitcast between types that are legalized to the same type are free.
685 // TODO: If one of the types get legalized by splitting, handle this
715 // Assuming that all loads of legal types cost 1.
[all...] |
| /prebuilts/ndk/r16/sources/third_party/googletest/googletest/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
94 // two types are equal.
105 // template Types. This allows us to simulate variadic templates
106 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
112 // represents a type list with N types (T1, T2, ..., and TN) in it.
113 // Except for Types0, every struct in the family has two member types:
716 // as that would require them to count the length. Types<...> is muc
[all...] |
| /prebuilts/ndk/r16/sources/third_party/vulkan/src/tests/gtest-1.7.0/include/gtest/internal/ |
| gtest-type-util.h | 39 // Currently we support at most 50 types in a list, and at most 50
94 // two types are equal.
105 // template Types. This allows us to simulate variadic templates
106 // (e.g. Types<int>, Type<int, double>, and etc), which C++ doesn't
113 // represents a type list with N types (T1, T2, ..., and TN) in it.
114 // Except for Types0, every struct in the family has two member types:
717 // as that would require them to count the length. Types<...> is muc
[all...] |
| /external/guava/guava-tests/test/com/google/common/reflect/ |
| TypeTokenTest.java | 95 assertEquals(Types.newParameterizedType(Local.class, String.class),
107 assertEquals(Types.newParameterizedType(Local.class, String.class),
162 TypeToken<Object>.TypeSet types = new TypeToken<Object>() {}.getTypes();
163 assertThat(types).has().item(TypeToken.of(Object.class));
164 assertThat(types.rawTypes()).has().item(Object.class);
165 assertThat(types.interfaces()).isEmpty();
166 assertThat(types.interfaces().rawTypes()).isEmpty();
167 assertThat(types.classes()).has().item(TypeToken.of(Object.class));
168 assertThat(types.classes().rawTypes()).has().item(Object.class);
172 TypeToken<Interface1>.TypeSet types = new TypeToken<Interface1>() {}.getTypes()
[all...] |
| /external/clang/lib/CodeGen/ |
| CodeGenModule.h | 283 CodeGenTypes Types;
426 /// @name Cache for Objective-C runtime types
488 /// Mapping from canonical types to their metadata identifiers. We need to
624 CodeGenTypes &getTypes() { return Types; }
701 /// declarations, not types.
[all...] |
| /external/llvm/unittests/IR/ |
| MetadataTest.cpp | 970 Metadata *Types = MDTuple::get(Context, TypesOps);
972 DIType *D = DISubroutineType::getDistinct(Context, 0u, 0, Types);
979 TempDIType T = DISubroutineType::getTemporary(Context, 0u, 0, Types);
[all...] |
