Searched refs:inv (Results 1 - 25 of 149) sorted by relevance

123456

/external/ceres-solver/internal/ceres/
H A Dloss_function.cc73 const double inv = 1 / sum; local
74 // 'sum' and 'inv' are always positive, assuming that 's' is.
76 rho[1] = inv;
77 rho[2] = - c_ * (inv * inv);
82 const double inv = 1 / sum; local
83 // 'sum' and 'inv' are always positive.
85 rho[1] = inv;
86 rho[2] = -2 * s * b_ * (inv * inv);
[all...]
/external/chromium_org/chrome/browser/invalidation/
H A Dfake_invalidation_service.cc74 syncer::Invalidation inv; local
75 inv.version = version;
76 inv.payload = payload;
77 inv.ack_handle = syncer::AckHandle::CreateUnique();
79 invalidation_map.insert(std::make_pair(object_id, inv));
81 AckHandleList::value_type(inv.ack_handle, object_id));
85 return inv.ack_handle;
/external/chromium_org/third_party/skia/src/pathops/
H A DSkPathOpsPoint.h108 double inv = 1 / denom; local
109 return approximately_equal(fX * inv, a.fX * inv)
110 && approximately_equal(fY * inv, a.fY * inv);
124 double inv = 1 / denom; local
125 return approximately_equal_half(fX * inv, a.fX * inv)
126 && approximately_equal_half(fY * inv, a.fY * inv);
[all...]
/external/skia/src/pathops/
H A DSkPathOpsPoint.h108 double inv = 1 / denom; local
109 return approximately_equal(fX * inv, a.fX * inv)
110 && approximately_equal(fY * inv, a.fY * inv);
124 double inv = 1 / denom; local
125 return approximately_equal_half(fX * inv, a.fX * inv)
126 && approximately_equal_half(fY * inv, a.fY * inv);
[all...]
/external/eigen/test/
H A Dprec_inverse_4x4.cpp22 MatrixType inv = m.inverse(); local
23 double error = double( (m*inv-MatrixType::Identity()).norm() / NumTraits<Scalar>::epsilon() );
43 MatrixType inv = m.inverse(); local
44 double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / NumTraits<Scalar>::epsilon() );
/external/chromium_org/third_party/skia/src/core/
H A DSkBitmapShader16BilerpTemplate.h27 const SkMatrix& inv = this->getTotalInverse(); local
40 SkPerspIter iter(inv, SkIntToScalar(x) + SK_ScalarHalf,
84 this->getInverseMapPtProc()(inv, SkIntToScalar(x) + SK_ScalarHalf,
91 (void)inv.fixedStepInX(SkIntToScalar(y), &dx, &dy);
94 dx = SkScalarToFixed(inv.getScaleX());
95 dy = SkScalarToFixed(inv.getSkewY());
136 const SkMatrix& inv = this->getTotalInverse(); local
149 SkPerspIter iter(inv, SkIntToScalar(x) + SK_ScalarHalf,
192 this->getInverseMapPtProc()(inv, SkIntToScalar(x) + SK_ScalarHalf,
199 (void)inv
[all...]
H A DSkBitmapShaderTemplate.h58 const SkMatrix& inv = this->getUnitInverse(); local
61 const SkMatrix& inv = this->getTotalInverse(); local
75 SkPerspIter iter(inv, SkIntToScalar(x) + SK_ScalarHalf,
117 invProc(inv, SkIntToScalar(x) + SK_ScalarHalf,
124 (void)inv.fixedStepInX(SkIntToScalar(y), &dx, &dy);
127 dx = SkScalarToFixed(inv.getScaleX());
128 dy = SkScalarToFixed(inv.getSkewY());
202 const SkMatrix& inv = this->getUnitInverse(); local
205 const SkMatrix& inv = this->getTotalInverse(); local
219 SkPerspIter iter(inv, SkIntToScala
[all...]
H A DARGB32_Clamp_Bilinear_BitmapShader.h71 const SkMatrix& inv = this->getTotalInverse(); local
82 SkPerspIter iter(inv, SkIntToScalar(x) + SK_ScalarHalf,
120 this->getInverseMapPtProc()(inv, SkIntToScalar(x) + SK_ScalarHalf,
128 (void)inv.fixedStepInX(SkIntToScalar(y), &dx, &dy);
131 dx = SkScalarToFixed(inv.getScaleX());
132 dy = SkScalarToFixed(inv.getSkewY());
/external/skia/src/core/
H A DSkBitmapShader16BilerpTemplate.h27 const SkMatrix& inv = this->getTotalInverse(); local
40 SkPerspIter iter(inv, SkIntToScalar(x) + SK_ScalarHalf,
84 this->getInverseMapPtProc()(inv, SkIntToScalar(x) + SK_ScalarHalf,
91 (void)inv.fixedStepInX(SkIntToScalar(y), &dx, &dy);
94 dx = SkScalarToFixed(inv.getScaleX());
95 dy = SkScalarToFixed(inv.getSkewY());
136 const SkMatrix& inv = this->getTotalInverse(); local
149 SkPerspIter iter(inv, SkIntToScalar(x) + SK_ScalarHalf,
192 this->getInverseMapPtProc()(inv, SkIntToScalar(x) + SK_ScalarHalf,
199 (void)inv
[all...]
H A DSkBitmapShaderTemplate.h58 const SkMatrix& inv = this->getUnitInverse(); local
61 const SkMatrix& inv = this->getTotalInverse(); local
75 SkPerspIter iter(inv, SkIntToScalar(x) + SK_ScalarHalf,
117 invProc(inv, SkIntToScalar(x) + SK_ScalarHalf,
124 (void)inv.fixedStepInX(SkIntToScalar(y), &dx, &dy);
127 dx = SkScalarToFixed(inv.getScaleX());
128 dy = SkScalarToFixed(inv.getSkewY());
202 const SkMatrix& inv = this->getUnitInverse(); local
205 const SkMatrix& inv = this->getTotalInverse(); local
219 SkPerspIter iter(inv, SkIntToScala
[all...]
/external/iptables/extensions/
H A Dlibip6t_ah.c57 const char *inv = invert ? "!" : ""; local
61 printf("%s:%s%u", name, inv, min);
63 printf("%ss:%s%u:%u", name, inv, min, max);
70 const char *inv = invert ? "!" : ""; local
73 printf("%s:%s%u", name, inv, len);
H A Dlibipt_ah.c39 const char *inv = invert ? "!" : ""; local
44 printf(":%s", inv);
47 printf("s:%s", inv);
H A Dlibxt_esp.c39 const char *inv = invert ? "!" : ""; local
43 printf(" %s:%s%u", name, inv, min);
45 printf(" %ss:%s%u:%u", name, inv, min, max);
/external/ceres-solver/examples/
H A Dfields_of_experts.cc81 const double inv = 1.0 / sum; local
82 // 'sum' and 'inv' are always positive, assuming that 's' is.
84 rho[1] = alpha_ * c * inv;
85 rho[2] = - alpha_ * c * c * inv * inv;
/external/eigen/test/eigen2/
H A Deigen2_prec_inverse_4x4.cpp41 MatrixType inv = m.inverse(); local
42 double error = double( (m*inv-MatrixType::Identity()).norm() / epsilon<Scalar>() );
61 MatrixType inv = m.inverse(); local
62 double error = double( (m*inv-MatrixType::Identity()).norm() * absdet / epsilon<Scalar>() );
/external/eigen/unsupported/Eigen/src/FFT/
H A Dei_fftw_impl.h65 void inv(complex_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
75 void inv(scalar_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
108 void inv(complex_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
118 void inv(scalar_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
149 void inv(complex_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
159 void inv(scalar_type * dst,complex_type * src,int nfft) { function in struct:Eigen::internal::fftw_plan
211 void inv(Complex * dst,const Complex *src,int nfft) function in struct:Eigen::internal::fftw_impl
213 get_plan(nfft,true,dst,src).inv(fftw_cast(dst), fftw_cast(src),nfft );
218 void inv( Scalar * dst,const Complex * src,int nfft) function in struct:Eigen::internal::fftw_impl
220 get_plan(nfft,true,dst,src).inv(fftw_cas
[all...]
/external/harfbuzz_ng/util/
H A Dansi-print.cc342 bool inv = false;
344 case 1: c = "▟"; inv = true; break;
345 case 2: c = "▙"; inv = true; break;
346 case 4: c = "▖"; inv = false; break;
347 case 8: c = "▗"; inv = false; break;
348 case 9: c = "▚"; inv = false; break;
349 case 6: c = "▞"; inv = false; break;
350 case 7: c = "▜"; inv = true; break;
351 case 11: c = "▜"; inv = true; break;
352 case 13: c = "▙"; inv
[all...]
/external/chromium_org/third_party/mesa/src/src/mesa/program/
H A Dprog_optimize.c856 append_interval(struct interval_list *list, const struct interval *inv) argument
858 list->Intervals[list->Num++] = *inv;
862 /** Insert interval inv into list, sorted by interval end */
864 insert_interval_by_end(struct interval_list *list, const struct interval *inv) argument
868 while (i >= 0 && list->Intervals[i].End > inv->End) {
872 list->Intervals[i + 1] = *inv;
888 remove_interval(struct interval_list *list, const struct interval *inv) argument
893 if (list->Intervals[k].Reg == inv->Reg) {
895 ASSERT(list->Intervals[k].Start == inv->Start);
896 ASSERT(list->Intervals[k].End == inv
1077 struct interval inv; local
1091 const struct interval *inv = liveIntervals->Intervals + i; local
1174 const struct interval *inv = activeIntervals.Intervals + j; local
[all...]
/external/mesa3d/src/mesa/program/
H A Dprog_optimize.c856 append_interval(struct interval_list *list, const struct interval *inv) argument
858 list->Intervals[list->Num++] = *inv;
862 /** Insert interval inv into list, sorted by interval end */
864 insert_interval_by_end(struct interval_list *list, const struct interval *inv) argument
868 while (i >= 0 && list->Intervals[i].End > inv->End) {
872 list->Intervals[i + 1] = *inv;
888 remove_interval(struct interval_list *list, const struct interval *inv) argument
893 if (list->Intervals[k].Reg == inv->Reg) {
895 ASSERT(list->Intervals[k].Start == inv->Start);
896 ASSERT(list->Intervals[k].End == inv
1077 struct interval inv; local
1091 const struct interval *inv = liveIntervals->Intervals + i; local
1174 const struct interval *inv = activeIntervals.Intervals + j; local
[all...]
/external/chromium_org/third_party/openssl/openssl/crypto/ecdsa/
H A Decs_locl.h72 const BIGNUM *inv, const BIGNUM *rp, EC_KEY *eckey);
/external/libvpx/libvpx/vp8/common/
H A Dfindnearmv.c140 static void invert_and_clamp_mvs(int_mv *inv, int_mv *src, MACROBLOCKD *xd) argument
142 inv->as_mv.row = src->as_mv.row * -1;
143 inv->as_mv.col = src->as_mv.col * -1;
144 vp8_clamp_mv2(inv, xd);
/external/openssl/crypto/ecdsa/
H A Decs_locl.h72 const BIGNUM *inv, const BIGNUM *rp, EC_KEY *eckey);
/external/chromium_org/third_party/mesa/src/src/mesa/main/
H A Dclip.c47 ctx->ProjectionMatrixStack.Top->inv);
82 ctx->ModelviewMatrixStack.Top->inv );
/external/clang/test/Analysis/
H A Darray-struct.c156 void inv(struct s1 *);
162 inv(&t);
/external/mesa3d/src/mesa/main/
H A Dclip.c47 ctx->ProjectionMatrixStack.Top->inv);
82 ctx->ModelviewMatrixStack.Top->inv );

Completed in 1340 milliseconds

123456