| /external/skia/bench/ |
| RectoriBench.cpp | 40 SkRect outer(inner);
41 // outer is always outset either 2x or 4x the blur radius (we go with 2x)
42 outer.outset(2*blurSigma, 2*blurSigma);
46 p.addRect(outer);
|
| /external/skqp/bench/ |
| RectoriBench.cpp | 40 SkRect outer(inner);
41 // outer is always outset either 2x or 4x the blur radius (we go with 2x)
42 outer.outset(2*blurSigma, 2*blurSigma);
46 p.addRect(outer);
|
| /art/compiler/optimizing/ |
| linear_order.cc | 32 static bool IsInnerLoop(HLoopInformation* outer, HLoopInformation* inner) {
33 return (inner != outer)
35 && (outer != nullptr)
36 && inner->IsIn(*outer);
|
| /prebuilts/go/darwin-x86/src/crypto/hmac/ |
| hmac.go | 41 outer, inner hash.Hash
47 h.outer.Reset()
48 h.outer.Write(h.opad)
49 h.outer.Write(in[origLen:])
50 return h.outer.Sum(in[:origLen])
72 hm.outer = h()
80 hm.outer.Write(key)
81 key = hm.outer.Sum(nil)
|
| /prebuilts/go/linux-x86/src/crypto/hmac/ |
| hmac.go | 41 outer, inner hash.Hash
47 h.outer.Reset()
48 h.outer.Write(h.opad)
49 h.outer.Write(in[origLen:])
50 return h.outer.Sum(in[:origLen])
72 hm.outer = h()
80 hm.outer.Write(key)
81 key = hm.outer.Sum(nil)
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseCwiseBinaryOp.h | 75 EIGEN_STRONG_INLINE InnerIterator(const binary_evaluator& aEval, Index outer)
76 : m_lhsIter(aEval.m_lhsImpl,outer), m_rhsIter(aEval.m_rhsImpl,outer), m_functor(aEval.m_functor)
113 EIGEN_STRONG_INLINE Index outer() const { return m_lhsIter.outer(); } function in class:Eigen::internal::binary_evaluator::InnerIterator
169 EIGEN_STRONG_INLINE InnerIterator(const binary_evaluator& aEval, Index outer)
170 : m_lhsEval(aEval.m_lhsImpl), m_rhsIter(aEval.m_rhsImpl,outer), m_functor(aEval.m_functor), m_value(0), m_id(-1), m_innerSize(aEval.m_expr.rhs().innerSize())
180 Scalar lhsVal = m_lhsEval.coeff(IsRowMajor?m_rhsIter.outer():m_id,
181 IsRowMajor?m_id:m_rhsIter.outer());
197 EIGEN_STRONG_INLINE Index outer() const { return m_rhsIter.outer();
[all...] |
| /external/eigen/Eigen/src/Core/ |
| AssignEvaluator.h | 200 outer = Index / DstXprType::InnerSizeAtCompileTime, enumerator in enum:Eigen::internal::copy_using_evaluator_DefaultTraversal_CompleteUnrolling::__anon19085
206 kernel.assignCoeffByOuterInner(outer, inner);
220 EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel, Index outer)
222 kernel.assignCoeffByOuterInner(outer, Index_);
223 copy_using_evaluator_DefaultTraversal_InnerUnrolling<Kernel, Index_+1, Stop>::run(kernel, outer);
266 outer = Index / DstXprType::InnerSizeAtCompileTime, enumerator in enum:Eigen::internal::copy_using_evaluator_innervec_CompleteUnrolling::__anon19086
274 kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, inner);
290 EIGEN_DEVICE_FUNC static EIGEN_STRONG_INLINE void run(Kernel &kernel, Index outer)
292 kernel.template assignPacketByOuterInner<DstAlignment, SrcAlignment, PacketType>(outer, Index_);
294 copy_using_evaluator_innervec_InnerUnrolling<Kernel, NextIndex, Stop, SrcAlignment, DstAlignment>::run(kernel, outer);
[all...] |
| Stride.h | 22 * It holds two values: the inner stride and the outer stride.
27 * The outer stride is the pointer increment between two consecutive rows of a row-major matrix or
34 * \tparam _OuterStrideAtCompileTime the outer stride, or Dynamic if you want to specify it at runtime.
72 : m_outer(other.outer()), m_inner(other.inner())
75 /** \returns the outer stride */
77 inline Index outer() const { return m_outer.value(); } function in class:Eigen::Stride
98 /** \brief Convenience specialization of Stride to specify only an outer stride
|
| /external/deqp/external/openglcts/modules/glesext/tessellation_shader/ |
| esextcTessellationShaderPoints.cpp | 722 memcpy(run.outer, levels.outer, sizeof(run.outer));
764 run.vertex_spacing, run.outer);
766 run_n_vertices = m_utils->getAmountOfVerticesGeneratedByTessellator(run.primitive_mode, run.inner, run.outer,
823 /* For isolines tessellation, outer[1] is subdivided as per specified vertex spacing as specified.
824 * outer[0] should be subdivided using equal vertex spacing.
828 * The *u==0* and *u==1* edges of the rectangle are subdivided according to the first outer
833 run.outer[0], gl_max_tess_gen_level_value,
838 actual_vs_mode, run.outer[1], gl_max_tess_gen_level_value, DE_NULL, /* out_clamped *
[all...] |
| esextcTessellationShaderQuads.cpp | 62 "Verifies that only a single triangle pair covering the outer rectangle"
63 " is generated, if both clamped inner and outer tessellation levels are "
153 * Round outer tesellation levels to 1 if necessary, since otherwise no geometry will
160 run.outer[0] = (float)((tess_level < 0) ? 1 : tess_level);
161 run.outer[1] = (float)((tess_level < 0) ? 1 : tess_level);
162 run.outer[2] = (float)((tess_level < 0) ? 1 : tess_level);
163 run.outer[3] = (float)((tess_level < 0) ? 1 : tess_level);
168 TESSELLATION_SHADER_PRIMITIVE_MODE_QUADS, run.inner, run.outer, run.vertex_spacing,
179 ", outer tess levels:"
181 << run.outer[0] << ", " << run.outer[1] << ", " << run.outer[2] << ",
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/ssa/ |
| likelyadjust.go | 13 outer *loop // loop containing this loop
29 // outerinner records that outer contains inner
30 func (sdom SparseTree) outerinner(outer, inner *loop) {
31 // There could be other outer loops found in some random order,
32 // locate the new outer loop appropriately among them.
34 // Outer loop headers dominate inner loop headers.
35 // Use this to put the "new" "outer" loop in the right place.
36 oldouter := inner.outer
37 for oldouter != nil && sdom.isAncestor(outer.header, oldouter.header) {
39 oldouter = inner.outer
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/ssa/ |
| likelyadjust.go | 13 outer *loop // loop containing this loop
29 // outerinner records that outer contains inner
30 func (sdom SparseTree) outerinner(outer, inner *loop) {
31 // There could be other outer loops found in some random order,
32 // locate the new outer loop appropriately among them.
34 // Outer loop headers dominate inner loop headers.
35 // Use this to put the "new" "outer" loop in the right place.
36 oldouter := inner.outer
37 for oldouter != nil && sdom.isAncestor(outer.header, oldouter.header) {
39 oldouter = inner.outer
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/rop/ |
| StdAttributeList.java | 72 outer: {
76 break outer; local
|
| /dalvik/dx/src/com/android/dx/cf/iface/ |
| StdAttributeList.java | 76 outer: {
80 break outer; local
|
| /external/clang/test/FixIt/ |
| typo.cpp | 103 namespace outer { namespace
104 namespace inner { // expected-note{{'outer::inner' declared here}} \
105 // expected-note{{namespace 'outer::inner' defined here}} \
111 using namespace outr::inner; // expected-error{{no namespace named 'inner' in namespace 'outr'; did you mean 'outer::inner'?}}
114 outr::inner::i = 3; // expected-error{{no member named 'inner' in namespace 'outr'; did you mean 'outer::inner'?}}
115 outer::innr::i = 4; // expected-error{{no member named 'innr' in namespace 'outer'; did you mean 'inner'?}}
|
| /external/icu/android_icu4j/src/main/java/android/icu/impl/locale/ |
| StringTokenIterator.java | 87 outer: while (idx < _text.length()) {
91 break outer; local
|
| /external/icu/icu4j/eclipse-build/plugins.template/com.ibm.icu.base/src/com/ibm/icu/impl/locale/ |
| StringTokenIterator.java | 83 outer: while (idx < _text.length()) {
87 break outer; local
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/locale/ |
| StringTokenIterator.java | 83 outer: while (idx < _text.length()) {
87 break outer; local
|
| /external/javassist/src/main/javassist/ |
| CtNewNestedClass.java | 40 private static void updateInnerEntry(int mod, String name, CtClass clazz, boolean outer) {
53 if (outName != null && outer)
|
| /external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
| Context.java | 32 static final int outer = 0; field in class:Context
39 int state = outer;
|
| /external/skia/gm/ |
| shapes.cpp | 128 const SkRRect& outer = fShapes[i]; variable
130 float s = 0.95f * SkTMin(outer.rect().width() / inner.rect().width(),
131 outer.rect().height() / inner.rect().height());
133 float dx = (rand.nextF() - 0.5f) * (outer.rect().width() - s * inner.rect().width());
134 float dy = (rand.nextF() - 0.5f) * (outer.rect().height() - s * inner.rect().height());
135 innerXform.setTranslate(outer.rect().centerX() + dx, outer.rect().centerY() + dy);
147 canvas->drawDRRect(outer, xformedInner, paint);
|
| /external/skia/src/core/ |
| SkColorFilter.cpp | 107 str->append(SkStringPrintf("SkComposeColorFilter: outer(%s) inner(%s)", outerS.c_str(),
144 SkComposeColorFilter(sk_sp<SkColorFilter> outer, sk_sp<SkColorFilter> inner,
146 : fOuter(std::move(outer))
159 auto outer = xformer->apply(fOuter.get()); variable
161 if (outer != fOuter || inner != fInner) {
162 return outer->makeComposed(inner);
177 sk_sp<SkColorFilter> outer(buffer.readColorFilter());
179 return outer ? outer->makeComposed(std::move(inner)) : inner;
|
| SkPathEffect.cpp | 83 and the the outer pathEffect (e.g. outer(inner(path)))
84 The reference counts for outer and inner are both incremented in the constructor,
87 static sk_sp<SkPathEffect> Make(sk_sp<SkPathEffect> outer, sk_sp<SkPathEffect> inner) {
88 if (!outer) {
92 return outer;
94 return sk_sp<SkPathEffect>(new SkComposePathEffect(outer, inner));
117 SkComposePathEffect(sk_sp<SkPathEffect> outer, sk_sp<SkPathEffect> inner)
118 : INHERITED(outer, inner) {}
215 sk_sp<SkPathEffect> SkPathEffect::MakeCompose(sk_sp<SkPathEffect> outer,
[all...] |
| /external/skqp/gm/ |
| shapes.cpp | 128 const SkRRect& outer = fShapes[i]; variable
130 float s = 0.95f * SkTMin(outer.rect().width() / inner.rect().width(),
131 outer.rect().height() / inner.rect().height());
133 float dx = (rand.nextF() - 0.5f) * (outer.rect().width() - s * inner.rect().width());
134 float dy = (rand.nextF() - 0.5f) * (outer.rect().height() - s * inner.rect().height());
135 innerXform.setTranslate(outer.rect().centerX() + dx, outer.rect().centerY() + dy);
147 canvas->drawDRRect(outer, xformedInner, paint);
|
| /external/skqp/src/core/ |
| SkPathEffect.cpp | 83 and the the outer pathEffect (e.g. outer(inner(path)))
84 The reference counts for outer and inner are both incremented in the constructor,
87 static sk_sp<SkPathEffect> Make(sk_sp<SkPathEffect> outer, sk_sp<SkPathEffect> inner) {
88 if (!outer) {
92 return outer;
94 return sk_sp<SkPathEffect>(new SkComposePathEffect(outer, inner));
117 SkComposePathEffect(sk_sp<SkPathEffect> outer, sk_sp<SkPathEffect> inner)
118 : INHERITED(outer, inner) {}
215 sk_sp<SkPathEffect> SkPathEffect::MakeCompose(sk_sp<SkPathEffect> outer,
[all...] |
