| /llvm-project/llvm/unittests/ADT/ |
| H A D | CombinationGeneratorTest.cpp | 27 std::vector<std::vector<int>> Variants; in TEST() local
31 Variants.emplace_back(State); in TEST()
41 ASSERT_THAT(Variants, ::testing::SizeIs(NumVariants)); in TEST()
42 ASSERT_THAT(Variants, ::testing::ContainerEq(ExpectedVariants)); in TEST()
48 std::vector<std::vector<int>> Variants; in TEST() local
52 Variants.emplace_back(State); in TEST()
60 ASSERT_THAT(Variants, ::testing::SizeIs(NumVariants)); in TEST()
61 ASSERT_THAT(Variants, ::testing::ContainerEq(ExpectedVariants)); in TEST()
67 std::vector<std::vector<int>> Variants; in TEST() local
71 Variants.emplace_back(State); in TEST()
[all …]
|
| /llvm-project/mlir/lib/Reducer/ |
| H A D | ReductionNode.cpp | 12 // keep track of the different generated variants throughout a reduction pass in
49 /// If we haven't explored any variants from this node, we will create N
50 /// variants, N is the length of `ranges` if N > 1. Otherwise, we will split the
51 /// max element in `ranges` and create 2 new variants for each call.
61 // produce variants with range {{1, 3}} and {{4, 9}}. in generateNewVariants()
62 if (variants.empty() && getRanges().size() > 1) { in generateNewVariants()
66 variants.push_back(createNewNode(subRanges)); in generateNewVariants()
72 // At here, we have created the type of variants mentioned above. We would in generateNewVariants()
73 // like to split the max range into 2 to create 2 new variants. Continue on in generateNewVariants()
75 // create two variants with range {{1, 3}, {4, 6}} and {{1, 3}, {6, 9}}. The in generateNewVariants()
[all …]
|
| /llvm-project/clang/unittests/Driver/ |
| H A D | MultilibTest.cpp | 226 Variants: [] in TEST()
236 Variants: [] in TEST()
244 Variants: [] in TEST()
254 Variants: [] in TEST()
264 Variants: [] in TEST()
268 EXPECT_TRUE(StringRef(Diagnostic).contains("missing required key 'Variants'")) in TEST()
272 Variants: in TEST()
280 Variants: in TEST()
289 Variants: in TEST()
296 Variants in TEST()
[all...] |
| /llvm-project/mlir/include/mlir/Reducer/ |
| H A D | ReductionNode.h | 12 // track of the different generated variants throughout a reduction pass in the
75 /// Return the range set we are using to generate variants.
78 /// Return the generated variants(the child nodes).
79 ArrayRef<ReductionNode *> getVariants() const { return variants; } in getVariants()
81 /// Split the ranges and generate new variants.
149 /// The node we are reduced from. It means we will be in variants of parent
166 /// have more subset variants from `ranges`.
178 /// This points to the child variants that were created using this node as a
180 std::vector<ReductionNode *> variants; variable
|
| /llvm-project/clang/docs/ |
| H A D | Multilib.rst | 53 A ``multilib.yaml`` configuration file specifies which multilib variants are
77 #. Match flags against multilib variants. If the generated flags are a superset
81 the *last* matching multilib variant, or may use all matching variants,
84 the matching multilib variants, and generate ``-isystem`` and ``-L``
92 When Clang selects multilib variants, it may find that more than one variant
100 #. Use all matching variants, thereby layering them.
111 This behaviour permits multilib variants with only a partial set of files.
114 variants containing only files that are different to those in the base variant.
131 The multilib mechanism supports library variants that correspond to target,
134 variants ar
[all...] |
| /llvm-project/llvm/include/llvm/BinaryFormat/ |
| H A D | MsgPack.h | 32 /// Most significant bits used to identify "Fix" variants in MessagePack.
44 /// Mask of bits used to identify "Fix" variants in MessagePack.
57 /// The maximum value or size encodable in "Fix" variants of formats.
66 /// The exact size encodable in "Fix" variants of formats.
76 /// The minimum value or size encodable in "Fix" variants of formats.
|
| /llvm-project/llvm/lib/Support/Unix/ |
| H A D | README.txt | 5 are common to two or more variants of UNIX. For example, the directory
9 Posix - code that is specific to Posix variants of UNIX
11 SysV - code that is specific to System V variants of UNIX
|
| /llvm-project/llvm/test/Transforms/InstCombine/ |
| H A D | strlen-6.ll | 101 ; Exercise both variants of the GEP index.
123 ; Exercise both variants of the GEP index.
145 ; Exercise both variants of the GEP index.
167 ; Exercise both variants of the GEP index.
189 ; Exercise both variants of the GEP index.
211 ; Exercise both variants of the GEP index.
233 ; Exercise both variants of the GEP index.
|
| /llvm-project/lld/wasm/ |
| H A D | SymbolTable.cpp | 913 // Linear search through symbol variants. Should never be more than two in createUndefinedStub()
915 auto &variants = symVariants[CachedHashStringRef(sym->getName())]; in createUndefinedStub()
916 if (variants.empty()) in createUndefinedStub()
917 variants.push_back(sym); in createUndefinedStub()
919 for (Symbol* v : variants) { in createUndefinedStub()
936 variants.push_back(variant);
1040 // Push the initial symbol onto the list of variants.
1042 std::vector<Symbol *> &variants = pair.second;
1045 LLVM_DEBUG(dbgs() << "symbol with (" << variants.size()
1046 << ") variants
800 auto &variants = symVariants[CachedHashStringRef(sym->getName())]; getFunctionVariant() local
941 std::vector<Symbol *> &variants = pair.second; handleSymbolVariants() local
[all...] |
| /llvm-project/llvm/test/TableGen/ |
| H A D | GlobalISelEmitterFlags.td | |
| /llvm-project/llvm/utils/TableGen/Common/ |
| H A D | CodeGenSchedule.cpp | 573 for (const Record *Variant : RWDef->getValueAsListOfDefs("Variants")) { in addProcModel()
582 // More may be inferred later when inferring new SchedClasses from variants. in addProcModel()
1332 ConstRecVec Variants = SchedRW.TheDef->getValueAsListOfDefs("Variants");
1333 if (any_of(Variants, [PredDef](const Record *R) {
1338 // we're expanding. Consider following RW sequence with two variants
1370 getAllPredicates(ArrayRef<TransVariant> Variants, unsigned ProcId) { in mutuallyExclusive()
1372 for (auto &Variant : Variants) { in mutuallyExclusive()
1380 // Populate IntersectingVariants with any variants or aliased sequences of the in mutuallyExclusive()
1389 std::vector<TransVariant> Variants; in mutuallyExclusive()
1376 RecVec Variants = SchedRW.TheDef->getValueAsListOfDefs("Variants"); mutuallyExclusive() local
1413 getAllPredicates(ArrayRef<TransVariant> Variants,unsigned ProcId) getAllPredicates() argument
1433 std::vector<TransVariant> Variants; getIntersectingVariants() local
[all...] |
| /llvm-project/libclc/amdgcn/lib/math/ |
| H A D | ldexp.cl | 33 // This defines all the ldexp(floatN, intN) variants.
38 // This defines all the ldexp(doubleN, intN) variants.
|
| /llvm-project/llvm/test/CodeGen/AArch64/ |
| H A D | sink-addsub-of-const.ll | 7 ; Outer 'add' is commutative - 2 variants.
31 ; Outer 'add' is commutative - 2 variants.
55 ; Outer 'add' is commutative - 2 variants.
156 ; Outer 'add' is commutative - 2 variants.
184 ; Outer 'add' is commutative - 2 variants.
212 ; Outer 'add' is commutative - 2 variants.
|
| /llvm-project/libcxx/test/std/utilities/variant/variant.visit/ |
| H A D | robust_against_adl.pass.cpp | 12 // template <class Visitor, class... Variants>
13 // constexpr see below visit(Visitor&& vis, Variants&&... vars);
|
| /llvm-project/clang/include/clang/Analysis/ |
| H A D | IssueHash.h | 25 /// We may introduce more variants of issue hashes in the future
26 /// but older variants will still be available for compatibility.
|
| /llvm-project/clang/test/SemaObjC/ |
| H A D | protocols-suppress-conformance.m | 108 // Provide two variants of a base class, one that adopts ProtocolA and
113 // Provide two variants of a subclass that conform to ProtocolB. One
117 // From those, provide two variants that conformat to ProtocolB_Explicit
|
| /llvm-project/llvm/test/MC/AMDGPU/ |
| H A D | gfx1030_unsupported.s | 8 // Unsupported dpp variants.
15 // Unsupported sdwa variants.
|
| /llvm-project/lldb/test/API/test_utils/ |
| H A D | TestDecorators.py | 28 … Note: the "dwarf" test category is ignored, because we don't generate any debug info test variants
81 """Test that add_test_categories limits the kinds of debug info test variants"""
|
| /llvm-project/lldb/docs/resources/ |
| H A D | test.rst | 69 and different variants, which is described in more detail below, while shell
173 Another thing this enables is having different variants for the same test
182 of variants. It's very tempting to add more variants because it's an easy way
186 The test variants are most useful when developing a larger feature (e.g. support
196 For this reason, we recommend using test variants only while developing a new
206 variants mean that more general tests should be API tests, so that they can be
207 run against the different variants.
255 variants including ``gmodules``).
|
| /llvm-project/llvm/include/llvm/Target/ |
| H A D | TargetSchedule.td | 407 class SchedVariant<list<SchedVar> variants> {
408 list<SchedVar> Variants = variants;
420 class SchedWriteVariant<list<SchedVar> variants> : SchedWrite,
421 SchedVariant<variants> {
429 class SchedReadVariant<list<SchedVar> variants> : SchedRead,
430 SchedVariant<variants> {
|
| /llvm-project/compiler-rt/lib/asan_abi/ |
| H A D | asan_abi_shim.cpp | 109 // Functions concerning memory load and store reporting (experimental variants)
147 // Functions concerning memory load and store reporting (noabort variants)
203 // Functions concerning memory load and store (experimental variants)
241 // Functions concerning memory load and store (noabort variants)
412 // Functions concerning fake stack malloc (always variants)
|
| /llvm-project/clang/test/Analysis/ |
| H A D | unions.cpp | 21 // 2. RegionStore dutifully stored all the variants at the same offset; in CloneParseTree()
27 // Now (at the time this test was added), we instead treat all variants of in CloneParseTree()
|
| /llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMInstrCDE.td | 166 // Registers for single-register variants of CX* instructions
174 // Registers for single-register variants of CX* instructions
258 // Base class for floating-point variants of CDE VCX* instructions
264 // Base class for vector variants of CDE VCX* instruction
295 // VCX1/VCX1A, base class for FP variants
356 // VCX2/VCX2A, base class for FP variants
426 // VCX3/VCX3A, base class for FP variants
|
| /llvm-project/llvm/test/CodeGen/X86/ |
| H A D | sink-addsub-of-const.ll | 8 ; Outer 'add' is commutative - 2 variants.
50 ; Outer 'add' is commutative - 2 variants.
92 ; Outer 'add' is commutative - 2 variants.
258 ; Outer 'add' is commutative - 2 variants.
294 ; Outer 'add' is commutative - 2 variants.
330 ; Outer 'add' is commutative - 2 variants.
|
| /llvm-project/llvm/test/DebugInfo/COFF/ |
| H A D | dwarf-headers.ll | 14 ; There are 8 variants with 5 formats: v4 CU, v4 TU, v5 normal/partial CU,
15 ; v5 skeleton/split CU, v5 normal/split TU. Some v5 variants differ only
|