Home
last modified time | relevance | path

Searched refs:computation (Results 1 – 25 of 231) sorted by relevance

12345678910

/llvm-project/clang/lib/AST/
H A DLinkage.h110 LVComputationKind computation);
113 LVComputationKind computation);
117 LVComputationKind computation);
121 LVComputationKind computation);
125 LVComputationKind computation);
128 LVComputationKind computation,
132 LVComputationKind computation,
136 LVComputationKind computation);
139 LVComputationKind computation);
141 LinkageInfo getLVForType(const Type &T, LVComputationKind computation);
[all …]
H A DDecl.cpp157 /// Does this computation kind permit us to consider additional
159 static bool hasExplicitVisibilityAlready(LVComputationKind computation) {
160 return computation.IgnoreExplicitVisibility; in hasExplicitVisibilityAlready() argument
179 /// visibility computation?
240 LVComputationKind computation) { in getLVForType()
241 if (computation.IgnoreAllVisibility) in getLVForType() argument
250 const TemplateParameterList *Params, LVComputationKind computation) { in getLVForTemplateParameterList()
266 LV.merge(getLVForType(*NTTP->getType(), computation)); in getLVForTemplateParameterList()
287 computation)); in getLVForTemplateParameterList()
295 TTP->getExpansionTemplateParameters(i), computation)); in getLVForTemplateParameterList()
251 getLVForTemplateParameterList(const TemplateParameterList * Params,LVComputationKind computation) getLVForTemplateParameterList() argument
321 getLVForTemplateArgumentList(ArrayRef<TemplateArgument> Args,LVComputationKind computation) getLVForTemplateArgumentList() argument
369 getLVForTemplateArgumentList(const TemplateArgumentList & TArgs,LVComputationKind computation) getLVForTemplateArgumentList() argument
395 mergeTemplateLV(LinkageInfo & LV,const FunctionDecl * fn,const FunctionTemplateSpecializationInfo * specInfo,LVComputationKind computation) mergeTemplateLV() argument
420 hasDirectVisibilityAttribute(const NamedDecl * D,LVComputationKind computation) hasDirectVisibilityAttribute() argument
432 shouldConsiderTemplateVisibility(const ClassTemplateSpecializationDecl * spec,LVComputationKind computation) shouldConsiderTemplateVisibility() argument
468 mergeTemplateLV(LinkageInfo & LV,const ClassTemplateSpecializationDecl * spec,LVComputationKind computation) mergeTemplateLV() argument
501 shouldConsiderTemplateVisibility(const VarTemplateSpecializationDecl * spec,LVComputationKind computation) shouldConsiderTemplateVisibility() argument
525 mergeTemplateLV(LinkageInfo & LV,const VarTemplateSpecializationDecl * spec,LVComputationKind computation) mergeTemplateLV() argument
610 getLVForNamespaceScopeDecl(const NamedDecl * D,LVComputationKind computation,bool IgnoreVarTypeLinkage) getLVForNamespaceScopeDecl() argument
915 getLVForClassMember(const NamedDecl * D,LVComputationKind computation,bool IgnoreVarTypeLinkage) getLVForClassMember() argument
1310 getLVForClosure(const DeclContext * DC,Decl * ContextDecl,LVComputationKind computation) getLVForClosure() argument
1348 getLVForLocalDecl(const NamedDecl * D,LVComputationKind computation) getLVForLocalDecl() argument
1451 computeLVForDecl(const NamedDecl * D,LVComputationKind computation,bool IgnoreVarTypeLinkage) computeLVForDecl() argument
1569 getLVForDecl(const NamedDecl * D,LVComputationKind computation) getLVForDecl() argument
[all...]
H A DAPValue.cpp1123 LVComputationKind computation) { in getLVForValue()
1131 return MergeLV(getLVForValue(V, computation)); in getLVForValue()
1179 if (VD && MergeLV(getLVForDecl(VD, computation))) in getLVForValue()
1182 if (MergeLV(getLVForType(*TI.getType(), computation))) in getLVForValue()
1194 if (MergeLV(getLVForDecl(MTE->getExtendingDecl(), computation))) in getLVForValue()
1208 MergeLV(getLVForDecl(D, computation)); in getLVForValue()
1117 getLVForValue(const APValue & V,LVComputationKind computation) getLVForValue() argument
/llvm-project/flang/test/Fir/
H A Drebox-susbtring.fir19 // Only test the computation of the base address offset computation accounting for the substring
28 // More offset computation with descriptor strides and triplets that is not character specific ...
49 // Only test the computation of the base address offset computation accounting for the substring of…
58 // More offset computation with descriptor strides and triplets that is not character specific ...
/llvm-project/mlir/include/mlir/Dialect/Shape/Transforms/
H A DPasses.td14 def OutlineShapeComputation : Pass<"outline-shape-computation", "ModuleOp"> {
15 let summary = "Using shape.func to preserve shape computation";
17 This pass outlines the shape computation part in high level IR by adding
19 ShapeMappingAnalysis. The shape computation part is usually introduced by
80 For the above example, the shape computation is inlined in the input IR,
/llvm-project/compiler-rt/lib/nsan/
H A Dnsan_flags.inc21 "If true, we resume resume the computation from the original "
26 "If true, a suppression will also resume the computation from the FT"
/llvm-project/compiler-rt/test/sanitizer_common/TestCases/Posix/
H A Dprint-module-map.cpp29 int computation = value / 0; // Division by zero. in main() local
/llvm-project/mlir/docs/
H A DQuantization.md70 computation. Frequently, real values that will be encountered are not
72 is encountered during computation, and should thus be represented.
196 instrumentation points within the computation where runtime statistics
233 the computation. stats_ref ops are generally converted to statistical operations once
235 * coupled_ref : Declares points in the computation to be coupled from a type
257 flexibility to move the casts as it simplifies the computation and converts it
/llvm-project/llvm/docs/
H A DGetElementPtr.rst62 computation. The second operand to the GEP instruction must be a value of a
132 result in the computation of addresses that point to memory past the end of the
179 only involved in the computation of addresses. For example, consider this:
215 are different (0 and 1), therefore the address computation diverges with that
280 However, for the underlying integer computation implied, there is no
287 You don't. The integer computation implied by a GEP is target-independent.
334 valid to compute arbitrary element indices, as the computation only depends on
375 underlying integer computation. They need not correspond with the actual type of
390 The underlying integer computation is sufficiently defined; null has a defined
423 What happens if a GEP computation overflows?
[all …]
/llvm-project/polly/lib/External/isl/test_inputs/schedule/
H A Ddisjunctive_domain.sc1 # Check that the size computation used for loop coalescing avoidance
/llvm-project/mlir/test/Dialect/Shape/
H A Darg_with_shape.mlir1 // RUN: mlir-opt -outline-shape-computation -split-input-file %s 2>%t | FileCheck %s
/llvm-project/mlir/test/Integration/GPU/CUDA/TensorCore/sm80/
H A Dtransform-mma-sync-matmul-f32.mlir79 // Print the memrefs before computation.
132 // Print the result memref after computation.
/llvm-project/mlir/include/mlir/Dialect/Quant/
H A DQuantOps.td
/llvm-project/llvm/test/Instrumentation/AddressSanitizer/
H A Dforce-dynamic-shadow.ll16 ; Shadow address is loaded and added into the whole offset computation.
H A Dbasic-msvc64.ll15 ; Shadow address is loaded and added into the whole offset computation.
/llvm-project/llvm/test/Bitcode/
H A Dthinlto-deadstrip-flag.ll11 ; when option used to disable dead stripping computation.
/llvm-project/llvm/test/CodeGen/WebAssembly/
H A Dfast-isel-pr47040.ll4 ; triggered during FastISel's address computation. The issue was that
/llvm-project/llvm/test/Transforms/SLPVectorizer/RISCV/
H A Dstruct-gep.ll5 ; This shouldn't be vectorized as the extra address computation required for the
/llvm-project/llvm/test/CodeGen/AMDGPU/
H A Dat-least-one-def-value-assert.mir15 # LiveInterval computation, which was more confusing. The invalid
/llvm-project/mlir/include/mlir/Dialect/MLProgram/IR/
H A DMLProgramBase.td21 define computation ops common to such frameworks but establishes a common
/llvm-project/llvm/test/Transforms/IndVarSimplify/
H A Dlftr_disabled.ll4 ; LFTR should not eliminate the need for the computation of i*i completely
/llvm-project/llvm/test/Transforms/CodeGenPrepare/X86/
H A Dsink-addrmode-inseltpoison.ll9 ; Can we sink single addressing mode computation to use?
235 ; Make sure we can sink address computation even
268 ; address computation.
H A Dsink-addrmode.ll9 ; Can we sink single addressing mode computation to use?
235 ; Make sure we can sink address computation even
268 ; address computation.
/llvm-project/mlir/docs/Dialects/Linalg/
H A DOpDSL.md123 actual computation.
236 used to parameterize the computation performed by a structured operation, for
276 example, parts of floating point computation may require double precision
321 index `None`. The operation thus performs a scalar computation that trivially
322 extends to a multi-dimensional pointwise computation. As a result, we may use
/llvm-project/llvm/test/Transforms/SimplifyCFG/
H A DPhiEliminate.ll3 ; be able to fold PHI nodes into computation in common cases. Folding the PHI

12345678910