| /llvm-project/clang-tools-extra/clangd/unittests/ |
| H A D | DexTests.cpp | 73 auto And = C.intersect(L1.iterator(), L0.iterator()); in TEST() 78 And = C.intersect(L0.iterator(), L1.iterator()); in TEST() 99 auto And = C.intersect(L0.iterator(), L1.iterator(), L2.iterator()); in TEST() 113 auto Empty1 = C.intersect(L1.iterator(), L2.iterator()); in TEST() 114 auto Empty2 = C.intersect(L1.iterator(), L2.iterator()); in TEST() 116 auto And = C.intersect(std::move(Empty1), std::move(Empty2)); in TEST() 216 auto Root = C.intersect( in TEST() 218 C.intersect(L0.iterator(), C.boost(L1.iterator(), 2U)), in TEST() 255 auto Tree = C.limit(C.intersect(std::move(I1), std::move(I2)), 10); in TEST() 277 C.intersect( in TEST() [all...] |
| /llvm-project/clang/test/CodeGenOpenCL/ |
| H A D | builtins-amdgcn-raytracing.cl | 7 // Test llvm.amdgcn.image.bvh.intersect.ray intrinsic. 22 // CHECK: call <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v3f32 32 // CHECK: call <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v3f16 42 // CHECK: call <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i64.v3f32 52 // CHECK: call <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i64.v3f16
|
| /llvm-project/clang-tools-extra/clangd/index/dex/ |
| H A D | Iterator.h | 145 intersect(std::vector<std::unique_ptr<Iterator>> Children) const; 178 std::unique_ptr<Iterator> intersect(Args... args) const { in intersect() function 181 return intersect(std::move(Children)); in intersect()
|
| /llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopPassManager.cpp | 123 PA.intersect(std::move(*PassPA)); in runWithLoopNestPasses() 131 // Finally, we intersect the final preserved analyses to compute the in runWithLoopNestPasses() 133 PA.intersect(std::move(*PassPA)); in runWithLoopNestPasses() 170 PA.intersect(std::move(*PassPA)); in runWithoutLoopNestPasses() 178 // Finally, we intersect the final preserved analyses to compute the in runWithoutLoopNestPasses() 180 PA.intersect(std::move(*PassPA)); in runWithoutLoopNestPasses() 334 // Then intersect the preserved set so that invalidation of module in run() 336 PA.intersect(std::move(PassPA)); in run()
|
| /llvm-project/clang/lib/StaticAnalyzer/Core/ |
| H A D | RangeConstraintManager.cpp | 474 RangeSet RangeSet::Factory::intersect(RangeSet What, llvm::APSInt Lower, in intersect() function in RangeSet::Factory 514 return intersect(*What.Impl, DummyContainer); in intersect() 517 RangeSet RangeSet::Factory::intersect(const RangeSet::ContainerType &LHS, in intersect() function in RangeSet::Factory 595 RangeSet RangeSet::Factory::intersect(RangeSet LHS, RangeSet RHS) { in intersect() function in RangeSet::Factory 601 return intersect(*LHS.Impl, *RHS.Impl); in intersect() 604 RangeSet RangeSet::Factory::intersect(RangeSet LHS, llvm::APSInt Point) { in intersect() function in RangeSet::Factory 861 return intersect(From, Upper, Lower); in deletePoint() 1108 [[nodiscard]] inline RangeSet intersect(RangeSet::Factory &F, RangeSet Head, 1131 [[nodiscard]] inline EndTy intersect(RangeSet::Factory &F, EndTy End) { in intersect() function 1138 intersect(RangeSe function 1148 [[nodiscard]] inline RangeSet intersect(RangeSet::Factory &F, RangeSet Head, intersect() function 1156 [[nodiscard]] inline RangeSet intersect(RangeSet::Factory &F, RangeSet Head, intersect() function 1191 intersect(RangeSet::Factory &F, HeadTy Head, SecondTy Second, intersect() function [all...] |
| /llvm-project/llvm/test/CodeGen/AMDGPU/ |
| H A D | llvm.amdgcn.intersect_ray.ll | 10 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i32.v4f32(uint node_ptr, float ray_extent, float3 ray_origin, float3 ray_dir, float3 ray_inv_dir, uint4 texture_descr) 11 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i32.v4f16(uint node_ptr, float ray_extent, float3 ray_origin, half3 ray_dir, half3 ray_inv_dir, uint4 texture_descr) 12 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i64.v4f32(ulong node_ptr, float ray_extent, float3 ray_origin, float3 ray_dir, float3 ray_inv_dir, uint4 texture_descr) 13 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i64.v4f16(ulong node_ptr, float ray_extent, float3 ray_origin, half3 ray_dir, half3 ray_inv_dir, uint4 texture_descr) 15 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v4f32(i32, float, <3 x float>, <3 x float>, <3 x float>, <4 x i32>) 16 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v4f16(i32, float, <3 x float>, <3 x half>, <3 x half>, <4 x i32>) 17 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i64.v4f32(i64, float, <3 x float>, <3 x float>, <3 x float>, <4 x i32>) 18 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i64.v4f16(i64, float, <3 x float>, <3 x half>, <3 x half>, <4 x i32>) 45 %v = call <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v4f32(i32 %node_ptr, float %ray_extent, <3 x float> %ray_origin, <3 x float> %ray_dir, <3 x float> %ray_inv_dir, <4 x i32> %tdescr) 134 %v = call <4 x i32> @llvm.amdgcn.image.bvh.intersect [all...] |
| /llvm-project/llvm/unittests/IR/ |
| H A D | PassManagerTest.cpp | 304 Intersected.intersect(PA1); in TEST() 313 Intersected.intersect(PreservedAnalyses::all()); in TEST() 322 Intersected.intersect(PA2); in TEST() 332 Intersected.intersect(PA1); in TEST() 341 Intersected.intersect(PreservedAnalyses::none()); in TEST() 351 Intersected.intersect(PA3); in TEST() 362 Intersected.intersect(std::move(Tmp)); in TEST() 372 Intersected.intersect(std::move(Tmp2)); in TEST() 381 Intersected.intersect(std::move(Tmp3)); in TEST() 910 PA.intersect(PassPA); in run()
|
| /llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | RangedConstraintManager.h | 185 RangeSet intersect(RangeSet LHS, RangeSet RHS); 197 RangeSet intersect(RangeSet What, llvm::APSInt Lower, llvm::APSInt Upper); 205 RangeSet intersect(RangeSet What, llvm::APSInt Point); 273 RangeSet intersect(const ContainerType &LHS, const ContainerType &RHS);
|
| /llvm-project/llvm/lib/CodeGen/ |
| H A D | MachinePassManager.cpp | 128 PA.intersect(std::move(PassPA)); in run() 153 PA.intersect(std::move(PassPA)); in run()
|
| H A D | RDFRegisters.cpp | 326 RegisterAggr &RegisterAggr::intersect(RegisterRef RR) { in intersect() function in llvm::rdf::RegisterAggr 327 return intersect(RegisterAggr(PRI).insert(RR)); in intersect() 330 RegisterAggr &RegisterAggr::intersect(const RegisterAggr &RG) { in intersect() function in llvm::rdf::RegisterAggr 346 T.insert(RR).intersect(*this); in intersectWith()
|
| /llvm-project/mlir/include/mlir/Analysis/Presburger/ |
| H A D | PresburgerRelation.h | 94 PresburgerRelation intersect(const PresburgerRelation &set) const; 260 PresburgerSet intersect(const PresburgerRelation &set) const;
|
| /llvm-project/mlir/lib/Analysis/Presburger/ |
| H A D | PresburgerRelation.cpp | 148 PresburgerRelation::intersect(const PresburgerRelation &set) const { in intersect() function in PresburgerRelation 162 IntegerRelation intersection = csA.intersect(csB); in intersect() 177 return intersect(other); in intersectRange() 188 return intersect(other); in intersectDomain() 260 unboundedDomain = unboundedDomain.intersect(s.unboundedDomain); in findSymbolicIntegerLexOpt() 1082 PresburgerSet PresburgerSet::intersect(const PresburgerRelation &set) const { in complement() 1083 return PresburgerSet(PresburgerRelation::intersect(set)); 1076 PresburgerSet PresburgerSet::intersect(const PresburgerRelation &set) const { intersect() function in PresburgerSet
|
| H A D | PWMAFunction.cpp | 290 PresburgerSet commonDomain = pieceA.domain.intersect(pieceB.domain); in isEqual() 298 assert(piece.domain.intersect(getDomain()).isIntegerEmpty() && in addPiece() 374 result = result.intersect(pieceA.domain).intersect(pieceB.domain); in tiebreakLex()
|
| /llvm-project/mlir/unittests/Analysis/Presburger/ |
| H A D | PresburgerSetTest.cpp | 47 PresburgerSet intersection = s.intersect(t); in testIntersectAtPoints() 442 expectEmpty(PresburgerSet(evens).intersect(PresburgerSet(odds))); in TEST() 449 expectEqual(multiples3.intersect(evens), multiples6); in TEST() 486 expectEmpty(PresburgerSet(evens).intersect(PresburgerSet(odds))); in TEST() 493 expectEqual(multiples3.intersect(evens), multiples6); in TEST()
|
| /llvm-project/llvm/test/CodeGen/AMDGPU/GlobalISel/ |
| H A D | llvm.amdgcn.intersect_ray.ll | 7 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i32.v4f32(uint node_ptr, float ray_extent, float3 ray_origin, float3 ray_dir, float3 ray_inv_dir, uint4 texture_descr) 8 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i32.v4f16(uint node_ptr, float ray_extent, float3 ray_origin, half3 ray_dir, half3 ray_inv_dir, uint4 texture_descr) 9 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i64.v4f32(ulong node_ptr, float ray_extent, float3 ray_origin, float3 ray_dir, float3 ray_inv_dir, uint4 texture_descr) 10 ; uint4 llvm.amdgcn.image.bvh.intersect.ray.i64.v4f16(ulong node_ptr, float ray_extent, float3 ray_origin, half3 ray_dir, half3 ray_inv_dir, uint4 texture_descr) 12 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v4f32(i32, float, <3 x float>, <3 x float>, <3 x float>, <4 x i32>) 13 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v4f16(i32, float, <3 x float>, <3 x half>, <3 x half>, <4 x i32>) 14 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i64.v4f32(i64, float, <3 x float>, <3 x float>, <3 x float>, <4 x i32>) 15 declare <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i64.v4f16(i64, float, <3 x float>, <3 x half>, <3 x half>, <4 x i32>) 25 %v = call <4 x i32> @llvm.amdgcn.image.bvh.intersect.ray.i32.v4f32(i32 %node_ptr, float %ray_extent, <3 x float> %ray_origin, <3 x float> %ray_dir, <3 x float> %ray_inv_dir, <4 x i32> %tdescr) 45 %v = call <4 x i32> @llvm.amdgcn.image.bvh.intersect [all...] |
| /llvm-project/llvm/include/llvm/IR/ |
| H A D | Analysis.h | 182 void intersect(const PreservedAnalyses &Arg) { in intersect() function 203 void intersect(PreservedAnalyses &&Arg) { in intersect() function
|
| H A D | DbgVariableFragmentInfo.h | 31 static DbgVariableFragmentInfo intersect(DbgVariableFragmentInfo A, in intersect() function
|
| /llvm-project/llvm/lib/Target/RISCV/ |
| H A D | RISCVInsertWriteVXRM.cpp | 91 VXRMInfo intersect(const VXRMInfo &Other) const { in intersect() function in __anon8d0590630111::VXRMInfo 279 Available = Available.intersect(BlockInfo[P->getNumber()].AvailableOut); in computeAvailable() 327 Anticipated.intersect(BlockInfo[S->getNumber()].AnticipatedIn); in emitWriteVXRM()
|
| /llvm-project/polly/lib/External/isl/ |
| H A D | isl_map_simplify.c | 3956 isl_bool intersect; in isl_map_plain_is_disjoint() local 3967 intersect = isl_map_plain_is_equal(map1, map2); in isl_map_plain_is_disjoint() 3968 if (intersect < 0 || intersect) in isl_map_plain_is_disjoint() 3969 return intersect < 0 ? isl_bool_error : isl_bool_false; in isl_map_plain_is_disjoint() 3997 isl_bool intersect; in isl_map_is_disjoint() local 4011 intersect = isl_map_plain_is_universe(map1); in isl_map_is_disjoint() 4012 if (intersect < 0 || intersect) in isl_map_is_disjoint() 4013 return isl_bool_not(intersect); in isl_map_is_disjoint() 4015 intersect = isl_map_plain_is_universe(map2); in isl_map_is_disjoint() 4016 if (intersect < 0 || intersect) in isl_map_is_disjoint() [all …]
|
| H A D | isl_multi_bind_templ.c | 55 bnd = FN(DOM,intersect)(bnd, bnd_i); in FN()
|
| /llvm-project/llvm/lib/Analysis/ |
| H A D | CGSCCPassManager.cpp | 98 PA.intersect(PassPA); in run() 118 // Before we mark all of *this* SCC's analyses as preserved below, intersect in run() 122 UR.CrossSCCPA.intersect(PA); in run() 286 UR.CrossSCCPA.intersect(PassPA); in run() 289 PA.intersect(PassPA); in run() 413 PA.intersect(PassPA); in run() 423 // Update the analysis manager with each run and intersect the total set in run() 550 // Then intersect the preserved set so that invalidation of module in run() 552 PA.intersect(std::move(PassPA)); in run()
|
| /llvm-project/llvm/test/DebugInfo/Generic/assignment-tracking/declare-to-assign/ |
| H A D | var-not-alloca-sized.ll | 6 ;; the fragment is truncated to represent the intersect between the store and 7 ;; the variable. If that intersect has exactly the same offset and size as the
|
| /llvm-project/llvm/lib/DebugInfo/MSF/ |
| H A D | MappedBlockStream.cpp | 38 static Interval intersect(const Interval &I1, const Interval &I2) { in intersect() function 133 Interval Intersection = intersect(CachedExtent, RequestExtent); in readBytes() 295 auto Intersection = intersect(WriteInterval, CachedInterval); in fixCacheAfterWrite()
|
| /llvm-project/mlir/lib/Analysis/ |
| H A D | AliasAnalysis.cpp | 96 result = result.intersect(aliasImpl->getModRef(op, location)); in getModRef()
|
| /llvm-project/llvm/include/llvm/Transforms/Scalar/ |
| H A D | SimpleLoopUnswitch.h | |