| /external/clang/lib/AST/ |
| D | Decl.cpp | 131 static bool hasExplicitVisibilityAlready(LVComputationKind computation) { in hasExplicitVisibilityAlready() argument
132 return ((unsigned(computation) & IgnoreExplicitVisibilityBit) != 0); in hasExplicitVisibilityAlready()
226 getLVForType(const Type &T, LVComputationKind computation) { in getLVForType() argument
227 if (computation == LVForLinkageOnly) in getLVForType()
237 LVComputationKind computation) { in getLVForTemplateParameterList() argument
254 LV.merge(getLVForType(*NTTP->getType(), computation)); in getLVForTemplateParameterList()
275 computation)); in getLVForTemplateParameterList()
283 TTP->getExpansionTemplateParameters(i), computation)); in getLVForTemplateParameterList()
292 LVComputationKind computation);
311 LVComputationKind computation) { in getLVForTemplateArgumentList() argument
[all …]
|
| /external/linux-tools-perf/src/tools/perf/Documentation/ |
| D | perf-diff.txt | 77 Differential computation selection - delta,ratio,wdiff (default is delta).
86 Show formula for given computation.
97 is found, specified computation is made and result is displayed.
101 and possible computation results (delta) in their related column.
109 x - computation takes place for pair
|
| /external/libhevc/common/arm/ |
| D | ihevc_itrans_recon_4x4_ttype1.s | 142 @ first stage computation starts
173 @ first stage computation ends
175 @ second stage computation starts : copy pasting 1st stage
212 @ second stage computation ends
|
| D | ihevc_itrans_recon_4x4.s | 151 @ first stage computation starts
211 @ second stage computation ends
|
| /external/llvm/test/Analysis/CostModel/ARM/ |
| D | gep.ll | 20 ; computation.
27 ; Cost of vector geps should be one. We cannot fold the address computation.
|
| /external/deqp/doc/testspecs/GLES3/ |
| D | functional.texture.mipmap.txt | 26 + Lod computation verification
47 OpenGL ES specification allows approximating both derivate- and lod computation.
|
| D | functional.fbo.msaa.txt | 32 + Coverage value computation in primitive rasterization
|
| /external/eigen/doc/ |
| D | TutorialLinearAlgebra.dox | 119 So Eigen lets you do this computation for yourself, if you want to, as in this example:
135 The computation of eigenvalues and eigenvectors does not necessarily converge, but such failure to …
184 to implement any linear least squares computation on top of Eigen.
186 \section TutorialLinAlgSeparateComputation Separating the computation from the construction
195 \li all decompositions have a compute(matrix) method that does the computation, and that may be cal…
237 Of course, any rank computation depends on the choice of an arbitrary threshold, since practically …
|
| D | TutorialMatrixArithmetic.dox | 61 perform any computation by themselves, they just return an "expression object" describing the compu…
62 performed. The actual computation happens later, when the whole expression is evaluated, typically …
|
| /external/libvorbis/doc/ |
| D | 07-floor1.tex | 35 \item floor computation produces two new line segments, one running from
74 pattern should be clear; we complete the floor computation as follows:
88 algorithm splits Y value computation and line plotting into two steps
237 \paragraph{curve computation} \label{vorbis:spec:floor1-synth}
239 Curve computation is split into two logical steps; the first step
244 conditionally skipped during final line computation in step two.
|
| D | 06-floor0.tex | 91 required for curve computation. For example, if the VQ codebook used
104 \subsubsection{curve computation} \label{vorbis:spec:floor0-synth}
|
| /external/llvm/docs/ |
| D | GetElementPtr.rst | 61 computation. The first operand to the GEP instruction must be a value of a
131 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:
223 are different (0 and 1), therefore the address computation diverges with that
292 However, for the underlying integer computation implied, there is no
299 You don't. The integer computation implied by a GEP is target-independent.
346 valid to compute arbitrary element indices, as the computation only depends on
387 underlying integer computation. They need not correspond with the actual type of
402 The underlying integer computation is sufficiently defined; null has a defined
434 What happens if a GEP computation overflows?
[all …]
|
| /external/llvm/test/CodeGen/X86/ |
| D | lea-2.ll | 10 ; The above computation of %tmp4 should match a single lea, without using
|
| D | avoid_complex_am.ll | 5 ; Therefore, LSR currently prefers to fold as much computation as possible
|
| /external/llvm/test/Transforms/IndVarSimplify/ |
| D | lftr_simple.ll | 1 ; LFTR should eliminate the need for the computation of i*i completely. It
|
| /external/llvm/test/Transforms/SimplifyCFG/ |
| D | PhiEliminate.ll | 2 ; be able to fold PHI nodes into computation in common cases. Folding the PHI
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | 2008-11-18-Stride1.ll | 9 ; be teaching it how to use a more elaborate trip count computation.
|
| D | trip-count3.ll | 5 ; be teaching it how to use a more elaborate trip count computation.
|
| /external/llvm/test/CodeGen/PowerPC/ |
| D | fast-isel-load-store-vsx.ll | 5 ;; address computation will use zero regardless of the content of R0. If used as
|
| /external/eigen/unsupported/Eigen/ |
| D | MatrixFunctions | 25 * \brief This module aims to provide various methods for the computation of
128 The cost of the computation is approximately \f$ 20 n^3 \f$ for
190 which uses direct computation for 1-by-1 and 2-by-2 blocks and an
403 (though the computation time in practice is likely more than this
420 The computation is the same as in the real case, except that the
|
| /external/llvm/test/Transforms/LoopVectorize/ |
| D | induction.ll | 71 ; Make sure that the loop exit count computation does not overflow for i8 and
73 ; induction variable to a bigger type the exit count computation will overflow
|
| D | safegep.ll | 5 ; We can vectorize this code because if the address computation would wrap then
|
| /external/llvm/test/Transforms/LoopStrengthReduce/ |
| D | address-space-loop.ll | 29 ; Host %t2 computation outside the loop.
|
| D | uglygep-address-space.ll | 29 ; Host %t2 computation outside the loop.
|
| /external/llvm/test/Transforms/LoopStrengthReduce/X86/ |
| D | ivchain-X86.ll | 13 ; no other address computation in the preheader
21 ; no expensive address computation in the preheader
61 ; expensive address computation in the preheader
|