| /llvm-project/clang/test/SemaHLSL/ |
| H A D | valid-shader-stages.hlsl | 8 [shader("intersection")] void intersection() {}
|
| /llvm-project/llvm-libgcc/ |
| H A D | generate_version_script.py | 43 def intersection(llvm, gcc): function
122 versioned_symbols = intersection(llvm, gcc)
|
| /llvm-project/llvm/test/Transforms/InstSimplify/ |
| H A D | icmp-abs-nabs.ll | 60 ; Negative test - range intersection is not subset.
133 ; Negative test - range intersection is not empty.
216 ; Negative test - range intersection is not subset.
272 ; Negative test - range intersection is not subset.
369 ; Negative test - intersection does not equal absolute value range.
387 ; Negative test - intersection does not equal absolute value range.
|
| /llvm-project/llvm/docs/ |
| H A D | DirectXUsage.rst | 64 ``intersection`` Ray intersection (ray tracing)
|
| /llvm-project/flang/lib/Lower/ |
| H A D | IterationSpace.cpp | 98 if (x.Rank() > 0 || intersection(x.subscript())) { in find()
106 intersection(x.subscript()))) { in find()
130 bool intersection(const A &subscripts) { in intersection() function in __anon406dfda30411::ArrayBaseFinder
|
| /llvm-project/llvm/test/tools/llvm-objcopy/COFF/ |
| H A D | only-section.test | 6 Adding another section stripping option makes it return the intersection of
|
| /llvm-project/mlir/lib/Analysis/Presburger/ |
| H A D | Barvinok.cpp | 237 /// in, is the intersection of the regions that these are active in,
256 // If R_j has a full-dimensional intersection with an existing chamber R_i, in computeChamberDecomposition()
258 // 1. the intersection R_i \cap R_j, where the generating function is in computeChamberDecomposition()
272 PresburgerSet intersection = currentRegion.intersect(region); in computeChamberDecomposition() local
274 // If the intersection is not full-dimensional, we do not modify in computeChamberDecomposition()
276 if (!intersection.isFullDim()) { in computeChamberDecomposition()
281 // If it is, we add the intersection and the difference as chambers. in computeChamberDecomposition()
282 newChambers.emplace_back(intersection, in computeChamberDecomposition()
366 // If a vertex is formed by the intersection of more than d facets, we in computePolytopeGeneratingFunction()
440 // property that no two of them have a full-dimensional intersection, in computePolytopeGeneratingFunction()
[all...] |
| H A D | PresburgerRelation.cpp | 140 // Return the intersection of this set with the given set.
162 IntegerRelation intersection = csA.intersect(csB); in intersect() local
163 if (!intersection.isEmpty()) in intersect()
164 result.unionInPlace(intersection); in intersect()
315 /// In the following, U denotes union, /\ denotes intersection, \ denotes set
340 /// says that the intersection is empty. If it is, then subtracting this
|
| /llvm-project/llvm/test/CodeGen/RISCV/ |
| H A D | machine-combiner-mir.ll | 46 ; Verify flags intersection
67 ; Verify flags intersection
|
| /llvm-project/mlir/include/mlir/Interfaces/ |
| H A D | InferIntRangeInterface.h | 92 ConstantIntRanges intersection(const ConstantIntRanges &other) const;
|
| /llvm-project/llvm/test/Analysis/ScopedNoAliasAA/ |
| H A D | alias-scope-merging.ll | 3 ; Alias scopes are merged by taking the intersection of domains, then the union of the scopes withi…
|
| /llvm-project/libc/cmake/modules/ |
| H A D | CheckCompilerFeatures.cmake | 48 # Computes the intersection between two lists.
|
| H A D | LLVMLibCCheckCpuFeatures.cmake | 42 # Computes the intersection between two lists.
|
| /llvm-project/mlir/lib/Interfaces/Utils/ |
| H A D | InferIntRangeCommon.cpp | 208 return urange.intersection(srange); in inferAdd()
240 return urange.intersection(srange); in inferSub()
275 return urange.intersection(srange); in inferMul()
623 return urange.intersection(srange);
|
| /llvm-project/llvm/utils/ |
| H A D | update_mca_test_checks.py | 173 common_to_all = set.intersection(*all_sets)
344 common_values = set.intersection(*pruned_sets[i])
|
| /llvm-project/clang/test/Analysis/ |
| H A D | MismatchedDeallocator-checker-test.mm | 180 // Check for intersection with unix.Malloc bounded with
218 // Check for intersection with cplusplus.NewDelete bounded with
|
| /llvm-project/llvm/test/CodeGen/PowerPC/ |
| H A D | asym-regclass-copy.ll | 5 ; This tests that the GPRC/GPRC_NOR0 intersection subclass relationship with
|
| /llvm-project/llvm/test/Transforms/IRCE/ |
| H A D | empty_ranges.ll | 8 ; The intersection with safe iteration space is the empty range [60, 10).
|
| /llvm-project/compiler-rt/lib/lsan/ |
| H A D | lsan_common.cpp | 637 InternalMmapVector<Region> intersection; in ClassifyAllChunks()
638 Intersect(mapped_regions, regions, intersection); in ClassifyAllChunks()
640 for (const Region &r : intersection) { in ClassifyAllChunks()
554 InternalMmapVector<Region> intersection; ScanRootRegions() local
|
| /llvm-project/mlir/unittests/Analysis/Presburger/ |
| H A D | PresburgerSetTest.cpp | 47 PresburgerSet intersection = s.intersect(t); in testIntersectAtPoints() local
51 bool inIntersection = intersection.containsPoint(point); in testIntersectAtPoints()
|
| /llvm-project/mlir/lib/Interfaces/ |
| H A D | InferIntRangeInterface.cpp | 102 ConstantIntRanges::intersection(const ConstantIntRanges &other) const { in intersection()
100 ConstantIntRanges::intersection(const ConstantIntRanges &other) const { intersection() function in ConstantIntRanges
|
| /llvm-project/llvm/test/Transforms/InstCombine/ |
| H A D | intersect-accessgroup.ll | |
| /llvm-project/bolt/ |
| H A D | CMakeLists.txt | 59 # Determine default set of targets to build -- the intersection of
|
| /llvm-project/mlir/lib/Dialect/GPU/IR/ |
| H A D | InferIntRangeInterfaceImpls.cpp | 257 argRange.intersection(getIndexRange(1, kMaxDim)); in inferResultRanges()
|
| /llvm-project/polly/test/ |
| H A D | update_check.py | 404 match = kind.intersection(check_include)
|