| /openbsd-src/gnu/llvm/clang/lib/AST/ |
| H A D | Linkage.h | 107 LVComputationKind computation); 110 LVComputationKind computation); 114 LVComputationKind computation); 118 LVComputationKind computation); 122 LVComputationKind computation); 125 LVComputationKind computation, 129 LVComputationKind computation, 133 LVComputationKind computation); 136 LVComputationKind computation); 138 LinkageInfo getLVForType(const Type &T, LVComputationKind computation); [all …]
|
| H A D | Decl.cpp | 160 static bool hasExplicitVisibilityAlready(LVComputationKind computation) { in hasExplicitVisibilityAlready() argument 161 return computation.IgnoreExplicitVisibility; in hasExplicitVisibilityAlready() 241 LVComputationKind computation) { in getLVForType() argument 242 if (computation.IgnoreAllVisibility) in getLVForType() 251 const TemplateParameterList *Params, LVComputationKind computation) { in getLVForTemplateParameterList() argument 267 LV.merge(getLVForType(*NTTP->getType(), computation)); in getLVForTemplateParameterList() 288 computation)); in getLVForTemplateParameterList() 296 TTP->getExpansionTemplateParameters(i), computation)); in getLVForTemplateParameterList() 321 LVComputationKind computation) { in getLVForTemplateArgumentList() argument 332 LV.merge(getLVForType(*Arg.getAsType(), computation)); in getLVForTemplateArgumentList() [all …]
|
| H A D | APValue.cpp | 1107 LVComputationKind computation) { in getLVForValue() argument 1115 return MergeLV(getLVForValue(V, computation)); in getLVForValue() 1163 if (VD && MergeLV(getLVForDecl(VD, computation))) in getLVForValue() 1166 if (MergeLV(getLVForType(*TI.getType(), computation))) in getLVForValue() 1178 if (MergeLV(getLVForDecl(MTE->getExtendingDecl(), computation))) in getLVForValue() 1192 MergeLV(getLVForDecl(D, computation)); in getLVForValue()
|
| /openbsd-src/gnu/llvm/llvm/docs/ |
| H A D | GetElementPtr.rst | 62 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 …]
|
| H A D | Lexicon.rst | 74 subexpression computation. For example ``(a+b)*(a+b)`` has two
|
| /openbsd-src/gnu/gcc/gcc/config/sh/ |
| H A D | sh4a.md | 174 ;; Single precision floating point computation FCMP/EQ, 196 ;; Double Precision floating point computation
|
| H A D | sh4.md | 200 ;; double precision computation. We want the 'default' latency to reflect 393 ;; Single precision floating point computation FCMP/EQ, 422 ;; Double Precision floating point computation
|
| /openbsd-src/gnu/llvm/clang/docs/ |
| H A D | UndefinedBehaviorSanitizer.rst | 162 result of a signed integer computation cannot be represented in its type. 165 lossy implicit conversions performed before the computation 171 the result of an unsigned integer computation cannot be represented in its 174 conversions performed before such a computation
|
| H A D | AutomaticReferenceCounting.rst | 319 It is undefined behavior if a computation history featuring a send of 322 semantics to a computation history in which these sends are removed. Note that 325 It is undefined behavior if a computation history features any use whatsoever 1636 non-contiguous subsequence of the computation history of the program. 1645 computation history beyond what is permitted by the general "as if" 1669 ARC makes no guarantees about the execution of a computation history 1702 time ``T`` in a computation history if: 1709 before the next store to ``S``, the computation history features a 1714 the end of the full-expression, the computation history depends 1727 A computation history depends on a pointer value ``P`` if it: [all …]
|
| H A D | DataFlowAnalysisIntro.md | 294 computation on all basic blocks until we reach a fixpoint. In other words, we 999 branches on user IDs, and almost certainly does not perform any computation
|
| H A D | ConstantInterpreter.rst | 373 argument evaluation should resume after the computation of an argument fails.
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/RISCV/ |
| H A D | RISCVSchedSiFive7.td | 27 // and floating point computation.
|
| /openbsd-src/gnu/gcc/gcc/config/stormy16/ |
| H A D | stormy-abi | 162 computation performed in the 'Calculation' column is ignored.
|
| /openbsd-src/gnu/gcc/gcc/ |
| H A D | timevar.def | 124 DEFTIMEVAR (TV_DOMINANCE , "dominance computation")
|
| /openbsd-src/gnu/llvm/llvm/include/llvm/Target/ |
| H A D | TargetInstrPredicate.td | 340 // computation. For example, STIPredicateFunction `isDependencyBreaking()` 341 // delegates to `isZeroIdiom()` part of its computation.
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/ARM/ |
| H A D | ARMPredicates.td | 201 // But only select them if more precision in FP computation is allowed, and when
|
| H A D | ARM.td | 215 // Fast computation of non-negative address offsets. 216 // True if processor does positive address offset computation faster. 218 "Enable fast computation of "
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/AArch64/ |
| H A D | AArch64InstrGISel.td | 21 // computation.
|
| /openbsd-src/gnu/usr.bin/binutils/gprof/ |
| H A D | README | 315 computation for the flat profile. 323 computation for the flat profile.
|
| /openbsd-src/gnu/usr.bin/binutils-2.17/gprof/ |
| H A D | README | 315 computation for the flat profile. 323 computation for the flat profile.
|
| /openbsd-src/gnu/llvm/llvm/docs/tutorial/MyFirstLanguageFrontend/ |
| H A D | LangImpl07.rst | 586 follow the "emit LHS, emit RHS, do computation" model. As such, it is 851 // Return the body computation. 862 dominance frontier" computation anywhere in sight.
|
| /openbsd-src/gnu/llvm/llvm/lib/Target/ |
| H A D | README.txt | 317 we don't eliminate the computation of the top half of effective_addr2 because 419 The PIC base computation (call+popl) is only used on one path through the 421 better to sink the picbase computation down into the block for the 563 exit value computation. 706 These functions perform the same computation, but produce different assembly.
|
| /openbsd-src/gnu/gcc/gcc/cp/ |
| H A D | cp-tree.def | 247 type of that larger expression. That computation would normally
|
| /openbsd-src/gnu/usr.bin/texinfo/doc/ |
| H A D | epsf.tex | 139 %%% Move size computation to \epsfsetsize which
|
| /openbsd-src/gnu/llvm/compiler-rt/lib/builtins/ |
| H A D | fp_div_impl.inc | 134 // NB: Using half-width iterations increases computation errors due to
|