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

12345678

/external/libcxx/test/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.inv/
H A DAndroid.mk17 test_makefile := external/libcxx/test/utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.inv/Android.mk
19 test_name := utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.inv/invoke_int_0
23 test_name := utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.inv/invoke_void_0
27 test_name := utilities/function.objects/func.wrap/func.wrap.func/func.wrap.func.inv/invoke
/external/chromium_org/chrome/browser/resources/
H A Dabout_invalidations.js76 var inv = allInvalidations[i];
77 if (inv.hasOwnProperty('objectId')) {
80 quote(inv.objectId.name) +
82 quote((inv.isUnknownVersion ? 'Unknown' : inv.version)) +
84 quote(inv.payload);
88 logToTable(inv, isInvalidation);
/external/ceres-solver/internal/ceres/
H A Dloss_function.cc73 const double inv = 1.0 / sum; local
74 // 'sum' and 'inv' are always positive, assuming that 's' is.
76 rho[1] = std::max(std::numeric_limits<double>::min(), inv);
77 rho[2] = - c_ * (inv * inv);
82 const double inv = 1 / sum; local
83 // 'sum' and 'inv' are always positive.
85 rho[1] = std::max(std::numeric_limits<double>::min(), inv);
86 rho[2] = -2.0 * s * b_ * (inv * inv);
[all...]
/external/eigen/test/
H A Dprec_inverse_4x4.cpp21 MatrixType inv = m.inverse(); local
22 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/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/chromium_org/third_party/skia/experimental/Intersection/
H A DDataTypes.h287 double inv = 1 / denom; local
288 return approximately_equal(x * inv, a.x * inv) && approximately_equal(y * inv, a.y * inv);
296 double inv = 1 / denom; local
297 return approximately_equal(x * inv, a.fX * inv) && approximately_equal(y * inv, a.fY * inv);
305 double inv = 1 / denom; local
[all...]
/external/skia/experimental/Intersection/
H A DDataTypes.h287 double inv = 1 / denom; local
288 return approximately_equal(x * inv, a.x * inv) && approximately_equal(y * inv, a.y * inv);
296 double inv = 1 / denom; local
297 return approximately_equal(x * inv, a.fX * inv) && approximately_equal(y * inv, a.fY * inv);
305 double inv = 1 / denom; local
[all...]
/external/chromium_org/chrome/browser/policy/cloud/
H A Dcloud_policy_invalidator_unittest.cc544 syncer::Invalidation inv = FireUnknownVersionInvalidation(POLICY_OBJECT_A); local
551 EXPECT_TRUE(IsInvalidationAcknowledged(inv));
573 syncer::Invalidation inv = FireUnknownVersionInvalidation(POLICY_OBJECT_A); local
574 EXPECT_FALSE(IsInvalidationAcknowledged(inv));
577 EXPECT_TRUE(IsInvalidationAcknowledged(inv));
597 syncer::Invalidation inv = local
605 EXPECT_FALSE(IsInvalidationAcknowledged(inv));
609 EXPECT_TRUE(IsInvalidationAcknowledged(inv));
618 syncer::Invalidation inv = FireUnknownVersionInvalidation(POLICY_OBJECT_A); local
627 EXPECT_FALSE(IsInvalidationAcknowledged(inv));
716 syncer::Invalidation inv = FireUnknownVersionInvalidation(POLICY_OBJECT_A); local
745 syncer::Invalidation inv = FireInvalidation(POLICY_OBJECT_A, V(3), "test"); local
761 syncer::Invalidation inv = FireInvalidation(POLICY_OBJECT_A, V(3), "test"); local
813 syncer::Invalidation inv = FireInvalidation(POLICY_OBJECT_A, V(1), "test"); local
1033 syncer::Invalidation inv = local
[all...]
/external/chromium_org/components/invalidation/
H A Dunacked_invalidation_set_unittest.cc84 Invalidation inv = Invalidation::Init(kObjectId_, i, "payload"); local
85 unacked_invalidations_.Add(inv);
100 Invalidation inv = Invalidation::Init(kObjectId_, i, "payload"); local
101 unacked_invalidations_.Add(inv);
118 Invalidation inv = Invalidation::Init(kObjectId_, i, "payload"); local
119 unacked_invalidations_.Add(inv);
201 Invalidation inv = Invalidation::Init(kObjectId_, 10, "payload"); local
202 unacked_invalidations_.Add(inv);
/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.cc354 bool inv = false;
356 case 1: c = "▟"; inv = true; break;
357 case 2: c = "▙"; inv = true; break;
358 case 4: c = "▖"; inv = false; break;
359 case 8: c = "▗"; inv = false; break;
360 case 9: c = "▚"; inv = false; break;
361 case 6: c = "▞"; inv = false; break;
362 case 7: c = "▜"; inv = true; break;
363 case 11: c = "▜"; inv = true; break;
364 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/libvpx/source/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/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 );
/external/valgrind/main/exp-sgcheck/
H A Dsg_main.c900 Invar* inv, Addr ea )
908 switch (inv->tag) {
913 block = inv->Inv.Stack0.addr;
914 szB = inv->Inv.Stack0.szB;
917 block = inv->Inv.StackN.nd->addr;
918 szB = inv->Inv.StackN.nd->szB;
921 block = inv->Inv.Global.nd->addr;
922 szB = inv->Inv.Global.nd->szB;
945 static void show_Invar( HChar* buf, Word nBuf, Invar* inv, Word depth ) argument
950 switch (inv
898 gen_delta_str( HChar* buf, UWord* absDelta, Invar* inv, Addr ea ) argument
1003 Invar inv; member in struct:__anon32811
1246 preen_global_Invar( Invar* inv, Addr a, SizeT len ) argument
1508 classify_address( Invar* inv, ThreadId tid, Addr ea, Addr sp, Addr fp, UWord szB, XArray* thisInstrBlocks ) argument
1770 Invar* inv; local
[all...]
/external/eigen/unsupported/test/
H A DFFTW.cpp107 fft.inv( tbuf2 , freqBuf);
115 fft.inv( tbuf3 , freqBuf);
128 fft.inv( tbuf2 , freqBuf);
156 fft.inv( buf3 , outbuf);
163 fft.inv( buf4 , outbuf);
170 fft.inv( buf3 , outbuf);
224 in1 = fft.inv(out1);

Completed in 734 milliseconds

12345678