Searched defs:rhs (Results 1 - 25 of 256) sorted by relevance

1234567891011

/external/clang/test/CodeGen/
H A Darm-neon-fma.c11 float32x2_t test_fma_order(float32x2_t accum, float32x2_t lhs, float32x2_t rhs) { argument
12 return vfma_f32(accum, lhs, rhs);
13 // CHECK: call <2 x float> @llvm.fma.v2f32(<2 x float> %lhs, <2 x float> %rhs, <2 x float> %accum)
16 float32x4_t test_fmaq_order(float32x4_t accum, float32x4_t lhs, float32x4_t rhs) { argument
17 return vfmaq_f32(accum, lhs, rhs);
18 // CHECK: call <4 x float> @llvm.fma.v4f32(<4 x float> %lhs, <4 x float> %rhs, <4 x float> %accum)
H A Dconditional-gnu-ext.c33 _Complex int rhs; local
35 return getComplex(1+2i) ? : rhs;
/external/chromium/chrome/browser/history/
H A Dpage_usage_data.cc44 const PageUsageData* rhs) {
45 return lhs->GetScore() > rhs->GetScore();
43 Predicate(const PageUsageData* lhs, const PageUsageData* rhs) argument
/external/oprofile/libpp/
H A Dfilename_spec.cpp35 bool filename_spec::match(filename_spec const & rhs, argument
38 if (!tid.match(rhs.tid) || !cpu.match(rhs.cpu) ||
39 !tgid.match(rhs.tgid) || count != rhs.count ||
40 unitmask != rhs.unitmask || event != rhs.event) {
45 return image == rhs.image && lib_image == rhs.lib_image;
49 if (!rhs
[all...]
/external/ceres-solver/internal/ceres/
H A Dblock_structure.cc37 bool CellLessThan(const Cell& lhs, const Cell& rhs) { argument
38 return (lhs.block_id < rhs.block_id);
H A Ddense_normal_cholesky_solver.cc68 // rhs = A'b
69 Vector rhs = Aref.transpose() * ConstVectorRef(b, num_rows); local
77 lhs.selfadjointView<Eigen::Upper>().ldlt().solve(rhs);
/external/chromium/base/
H A Dversion_unittest.cc55 const char* rhs; member in struct:version_compare
71 scoped_ptr<Version> rhs(Version::GetVersionFromString(cases[i].rhs));
72 EXPECT_EQ(lhs->CompareTo(*rhs), cases[i].expected) <<
73 cases[i].lhs << " ? " << cases[i].rhs;
/external/chromium/chrome/browser/profiles/
H A Dprofile_keyed_service_factory.cc58 void ProfileKeyedServiceFactory::DependsOn(ProfileKeyedServiceFactory* rhs) { argument
59 dependency_manager_->AddEdge(rhs, this);
/external/chromium/chrome/common/extensions/
H A Dextension_extent.cc13 ExtensionExtent::ExtensionExtent(const ExtensionExtent& rhs) argument
14 : patterns_(rhs.patterns_) {
20 ExtensionExtent& ExtensionExtent::operator=(const ExtensionExtent& rhs) { argument
21 patterns_ = rhs.patterns_;
/external/chromium/sdch/open-vcdiff/src/gtest/internal/
H A Dgtest-filepath.h62 FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } argument
66 void Set(const FilePath& rhs) { argument
67 pathname_ = rhs.pathname_;
150 FilePath& operator=(const FilePath& rhs);
H A Dgtest-string.h115 static bool CStringEquals(const char* lhs, const char* rhs);
133 static bool WideCStringEquals(const wchar_t* lhs, const wchar_t* rhs);
142 const char* rhs);
185 // Returns < 0 if this is less than rhs, 0 if this is equal to rhs, or > 0
186 // if this is greater than rhs.
187 int Compare(const String& rhs) const;
234 const String& operator=(const String &rhs) { argument
235 *this = rhs.c_str_;
/external/chromium/testing/gtest/include/gtest/internal/
H A Dgtest-filepath.h62 FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } argument
72 FilePath& operator=(const FilePath& rhs) { argument
73 Set(rhs);
77 void Set(const FilePath& rhs) { argument
78 pathname_ = rhs.pathname_;
/external/gtest/include/gtest/internal/
H A Dgtest-filepath.h62 FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } argument
72 FilePath& operator=(const FilePath& rhs) { argument
73 Set(rhs);
77 void Set(const FilePath& rhs) { argument
78 pathname_ = rhs.pathname_;
/external/icu4c/i18n/
H A Dfpositer.cpp33 FieldPositionIterator::FieldPositionIterator(const FieldPositionIterator &rhs) argument
34 : UObject(rhs), data(NULL), pos(rhs.pos) {
36 if (rhs.data) {
39 data->assign(*rhs.data, status);
48 UBool FieldPositionIterator::operator==(const FieldPositionIterator &rhs) const {
49 if (&rhs == this) {
52 if (pos != rhs.pos) {
56 return rhs.data == NULL;
58 return rhs
[all...]
/external/libvpx/libvpx/third_party/googletest/src/include/gtest/internal/
H A Dgtest-filepath.h62 FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } argument
72 FilePath& operator=(const FilePath& rhs) { argument
73 Set(rhs);
77 void Set(const FilePath& rhs) { argument
78 pathname_ = rhs.pathname_;
/external/llvm/utils/unittest/googletest/include/gtest/internal/
H A Dgtest-filepath.h62 FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } argument
72 FilePath& operator=(const FilePath& rhs) { argument
73 Set(rhs);
77 void Set(const FilePath& rhs) { argument
78 pathname_ = rhs.pathname_;
/external/open-vcdiff/gtest/include/gtest/internal/
H A Dgtest-filepath.h62 FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } argument
72 FilePath& operator=(const FilePath& rhs) { argument
73 Set(rhs);
77 void Set(const FilePath& rhs) { argument
78 pathname_ = rhs.pathname_;
/external/oprofile/libutil++/
H A Dcverb.cpp76 verbose verbose::operator|(verbose const & rhs) argument
79 result.set = result.set || rhs.set;
84 verbose verbose::operator&(verbose const & rhs) argument
87 result.set = result.set && rhs.set;
H A Dgrowable_vector.h54 growable_vector<T> & operator+=(growable_vector<T> const & rhs) { argument
55 if (rhs.container.size() > container.size())
56 container.resize(rhs.container.size());
58 size_type min_size = min(container.size(), rhs.container.size());
60 container[i] += rhs.container[i];
68 * (iow: for each components lhs[i] >= rhs[i]
70 growable_vector<T> & operator-=(growable_vector<T> const & rhs) { argument
71 if (rhs.container.size() > container.size())
72 container.resize(rhs.container.size());
74 size_type min_size = min(container.size(), rhs
[all...]
H A Dsparse_array.h49 sparse_array & operator+=(sparse_array const & rhs) { argument
50 typename container_type::const_iterator it = rhs.container.begin();
51 typename container_type::const_iterator it_end = rhs.container.end();
61 * (iow: for each components lhs[i] >= rhs[i]
63 sparse_array & operator-=(sparse_array const & rhs) { argument
64 typename container_type::const_iterator it = rhs.container.begin();
65 typename container_type::const_iterator it_end = rhs.container.end();
/external/protobuf/gtest/include/gtest/internal/
H A Dgtest-filepath.h62 FilePath(const FilePath& rhs) : pathname_(rhs.pathname_) { } argument
72 FilePath& operator=(const FilePath& rhs) { argument
73 Set(rhs);
77 void Set(const FilePath& rhs) { argument
78 pathname_ = rhs.pathname_;
/external/webkit/Source/JavaScriptCore/wtf/unicode/
H A DCollatorDefault.cpp54 Collator::Result Collator::collate(const UChar* lhs, size_t lhsLength, const UChar* rhs, size_t rhsLength) const argument
58 while (l < lmin && *lhs == *rhs) {
60 rhs++;
65 return (*lhs > *rhs) ? Greater : Less;
/external/chromium/chrome/browser/password_manager/
H A Dpassword_form_data.cc40 bool operator==(const PasswordForm& lhs, const PasswordForm& rhs) { argument
41 return (lhs.scheme == rhs.scheme &&
42 lhs.signon_realm == rhs.signon_realm &&
43 lhs.origin == rhs.origin &&
44 lhs.action == rhs.action &&
45 lhs.submit_element == rhs.submit_element &&
46 lhs.username_element == rhs.username_element &&
47 lhs.password_element == rhs.password_element &&
48 lhs.username_value == rhs.username_value &&
49 lhs.password_value == rhs
[all...]
/external/eigen/Eigen/src/Core/products/
H A DTriangularSolverVector.h20 static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) argument
25 >::run(size, _lhs, lhsStride, rhs);
29 // forward and backward substitution, row-major, rhs is a vector
36 static void run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) argument
64 rhs + startCol, 1,
65 rhs + startRow, 1,
74 rhs[i] -= (cjLhs.row(i).segment(s,k).transpose().cwiseProduct(Map<const Matrix<RhsScalar,Dynamic,1> >(rhs+s,k))).sum();
77 rhs[i] /= cjLhs(i,i);
83 // forward and backward substitution, column-major, rhs i
90 run(Index size, const LhsScalar* _lhs, Index lhsStride, RhsScalar* rhs) argument
[all...]
/external/eigen/Eigen/src/SparseCore/
H A DSparseSparseProductWithPruning.h20 static void sparse_sparse_product_with_pruning_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, typename ResultType::RealScalar tolerance) argument
22 // return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res);
29 Index cols = rhs.outerSize();
31 eigen_assert(lhs.outerSize() == rhs.innerSize());
37 // given a rhs column containing Y non zeros, we assume that the respective Y columns
39 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero
41 // Therefore, we have nnz(lhs*rhs) = nnz(lhs) + nnz(rhs)
42 Index estimated_nnz_prod = lhs.nonZeros() + rhs.nonZeros();
51 double ratioColRes = double(estimated_nnz_prod)/double(lhs.rows()*rhs
88 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
100 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
114 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
127 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, RealScalar tolerance) argument
[all...]

Completed in 453 milliseconds

1234567891011