/external/chromium_org/third_party/mesa/src/src/glsl/ |
H A D | opt_copy_propagation_elements.cpp | 57 acp_entry(ir_variable *lhs, ir_variable *rhs, int write_mask, int swizzle[4]) argument 59 this->lhs = lhs; 67 this->lhs = a->lhs; 73 ir_variable *lhs; member in class:__anon14266::acp_entry 169 ir_dereference_variable *lhs = ir->lhs->as_dereference_variable(); local 170 ir_variable *var = ir->lhs->variable_referenced(); 175 if (lhs) [all...] |
H A D | opt_dead_code_local.cpp | 48 assignment_entry(ir_variable *lhs, ir_assignment *ir) argument 50 assert(lhs); 52 this->lhs = lhs; 57 ir_variable *lhs; member in class:__anon14267::assignment_entry 76 if (entry->lhs == var) { 79 printf("kill %s (0x%01x - 0x%01x)\n", entry->lhs->name, 86 printf("kill %s\n", entry->lhs->name); 164 array_index_visit::run(ir->lhs, &v); 165 var = ir->lhs [all...] |
/external/mesa3d/src/glsl/ |
H A D | opt_copy_propagation_elements.cpp | 57 acp_entry(ir_variable *lhs, ir_variable *rhs, int write_mask, int swizzle[4]) argument 59 this->lhs = lhs; 67 this->lhs = a->lhs; 73 ir_variable *lhs; member in class:__anon27677::acp_entry 169 ir_dereference_variable *lhs = ir->lhs->as_dereference_variable(); local 170 ir_variable *var = ir->lhs->variable_referenced(); 175 if (lhs) [all...] |
H A D | opt_dead_code_local.cpp | 48 assignment_entry(ir_variable *lhs, ir_assignment *ir) argument 50 assert(lhs); 52 this->lhs = lhs; 57 ir_variable *lhs; member in class:__anon27678::assignment_entry 76 if (entry->lhs == var) { 79 printf("kill %s (0x%01x - 0x%01x)\n", entry->lhs->name, 86 printf("kill %s\n", entry->lhs->name); 164 array_index_visit::run(ir->lhs, &v); 165 var = ir->lhs [all...] |
/external/chromium_org/components/rappor/ |
H A D | byte_vector_utils_unittest.cc | 30 ByteVector lhs(2); 31 lhs[1] = 0x12; 35 EXPECT_EQ(0x02, (*ByteVectorAnd(lhs, &rhs))[1]); 39 ByteVector lhs(2); 40 lhs[1] = 0x12; 44 EXPECT_EQ(0x13, (*ByteVectorOr(lhs, &rhs))[1]); 48 ByteVector lhs(2); 49 lhs[1] = 0x33; 55 EXPECT_EQ(0x35, (*ByteVectorMerge(mask, lhs, &rhs))[1]);
|
/external/chromium_org/storage/browser/fileapi/ |
H A D | file_system_url.cc | 160 bool FileSystemURL::Comparator::operator()(const FileSystemURL& lhs, argument 162 DCHECK(lhs.is_valid_ && rhs.is_valid_); 163 if (lhs.origin_ != rhs.origin_) 164 return lhs.origin_ < rhs.origin_; 165 if (lhs.type_ != rhs.type_) 166 return lhs.type_ < rhs.type_; 167 if (lhs.filesystem_id_ != rhs.filesystem_id_) 168 return lhs.filesystem_id_ < rhs.filesystem_id_; 169 return lhs.path_ < rhs.path_;
|
/external/chromium_org/ui/gfx/geometry/ |
H A D | quad_f.h | 92 inline bool operator==(const QuadF& lhs, const QuadF& rhs) { argument 94 lhs.p1() == rhs.p1() && lhs.p2() == rhs.p2() && 95 lhs.p3() == rhs.p3() && lhs.p4() == rhs.p4(); 98 inline bool operator!=(const QuadF& lhs, const QuadF& rhs) { argument 99 return !(lhs == rhs); 103 GFX_EXPORT QuadF operator+(const QuadF& lhs, const Vector2dF& rhs); 106 GFX_EXPORT QuadF operator-(const QuadF& lhs, const Vector2dF& rhs);
|
H A D | rect.h | 79 inline bool operator==(const Rect& lhs, const Rect& rhs) { argument 80 return lhs.origin() == rhs.origin() && lhs.size() == rhs.size(); 83 inline bool operator!=(const Rect& lhs, const Rect& rhs) { argument 84 return !(lhs == rhs); 87 GFX_EXPORT Rect operator+(const Rect& lhs, const Vector2d& rhs); 88 GFX_EXPORT Rect operator-(const Rect& lhs, const Vector2d& rhs); 90 inline Rect operator+(const Vector2d& lhs, const Rect& rhs) { argument 91 return rhs + lhs;
|
/external/eigen/Eigen/src/Core/products/ |
H A D | GeneralMatrixMatrixTriangular_MKL.h | 52 static EIGEN_STRONG_INLINE void run(Index size, Index depth,const Scalar* lhs, Index lhsStride, \ 55 if (lhs==rhs) { \ 57 ::run(size,depth,lhs,lhsStride,rhs,rhsStride,res,resStride,alpha); \ 63 ::run(size,depth,lhs,lhsStride,rhs,rhsStride,res,resStride,alpha); \ 82 static EIGEN_STRONG_INLINE void run(Index size, Index depth,const EIGTYPE* lhs, Index lhsStride, \ 94 MKLFUNC(&uplo, &trans, &n, &k, &alpha_, lhs, &lda, &beta_, res, &ldc); \ 107 static EIGEN_STRONG_INLINE void run(Index size, Index depth,const EIGTYPE* lhs, Index lhsStride, \ 125 Map<const MatrixType, 0, OuterStride<> > mapA(lhs,n,k,OuterStride<>(lhsStride)); \ 129 } else a_ptr=lhs; \
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/ |
H A D | TypeResolver.java | 80 PExpression lhs = node.getLeft(); 82 if (isNumeric(lhs) || isNumeric(rhs)) { 83 node.replaceBy(new ANumericAddExpression(lhs, rhs)); 90 PExpression lhs = node.getLeft(); 92 if (isNumeric(lhs) || isNumeric(rhs)) { 93 node.replaceBy(new ANumericEqExpression(lhs, rhs)); 100 PExpression lhs = node.getLeft(); 102 if (isNumeric(lhs) || isNumeric(rhs)) { 103 node.replaceBy(new ANumericNeExpression(lhs, rhs));
|
/external/eigen/Eigen/src/SparseCore/ |
H A D | SparseSparseProductWithPruning.h | 20 static void sparse_sparse_product_with_pruning_impl(const Lhs& lhs, const Rhs& rhs, ResultType& res, const typename ResultType::RealScalar& tolerance) argument 22 // return sparse_sparse_product_with_pruning_impl2(lhs,rhs,res); 28 Index rows = lhs.innerSize(); 30 //Index size = lhs.outerSize(); 31 eigen_assert(lhs.outerSize() == rhs.innerSize()); 38 // of the lhs differs in average of one non zeros, thus the number of non zeros for 39 // the product of a rhs column with the lhs is X+Y where X is the average number of non zero 40 // per column of the lhs. 41 // Therefore, we have nnz(lhs*rhs) = nnz(lhs) 88 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument 100 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument 114 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument 127 run(const Lhs& lhs, const Rhs& rhs, ResultType& res, const RealScalar& tolerance) argument [all...] |
H A D | SparseDenseProduct.h | 93 EIGEN_STRONG_INLINE SparseDenseOuterProduct(const Lhs& lhs, const Rhs& rhs) argument 94 : m_lhs(lhs), m_rhs(rhs) 99 EIGEN_STRONG_INLINE SparseDenseOuterProduct(const Rhs& rhs, const Lhs& lhs) argument 100 : m_lhs(lhs), m_rhs(rhs) 108 EIGEN_STRONG_INLINE const _LhsNested& lhs() const { return m_lhs; } function in class:Eigen::SparseDenseOuterProduct 123 : Base(prod.lhs(), 0), m_outer(outer), m_factor(get(prod.rhs(), outer, typename internal::traits<Rhs>::StorageKind() )) 173 static void run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha) argument 177 Index n = lhs.outerSize(); 181 for(LhsInnerIterator it(lhs,j); it ;++it) 197 static void run(const SparseLhsType& lhs, cons argument 219 run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha) argument 238 run(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const typename Res::Scalar& alpha) argument 250 sparse_time_dense_product(const SparseLhsType& lhs, const DenseRhsType& rhs, DenseResType& res, const AlphaType& alpha) argument 264 SparseTimeDenseProduct(const Lhs& lhs, const Rhs& rhs) argument 294 DenseTimeSparseProduct(const Lhs& lhs, const Rhs& rhs) argument [all...] |
/external/chromium_org/net/base/ |
H A D | int128.h | 94 inline bool operator==(const uint128& lhs, const uint128& rhs) { argument 95 return (Uint128Low64(lhs) == Uint128Low64(rhs) && 96 Uint128High64(lhs) == Uint128High64(rhs)); 98 inline bool operator!=(const uint128& lhs, const uint128& rhs) { argument 99 return !(lhs == rhs); 126 inline bool operator op(const uint128& lhs, const uint128& rhs) { \ 127 return (Uint128High64(lhs) == Uint128High64(rhs)) ? \ 128 (Uint128Low64(lhs) op Uint128Low64(rhs)) : \ 129 (Uint128High64(lhs) op Uint128High64(rhs)); \ 162 inline uint128 operator op(const uint128& lhs, cons 256 operator +(const uint128& lhs, const uint128& rhs) argument 260 operator -(const uint128& lhs, const uint128& rhs) argument 264 operator *(const uint128& lhs, const uint128& rhs) argument [all...] |
/external/bison/src/ |
H A D | nullable.c | 108 && ! nullable[rules_ruleno->lhs->number - ntokens]) 110 nullable[rules_ruleno->lhs->number - ntokens] = true; 111 *s2++ = rules_ruleno->lhs->number; 121 if (r->useful && ! nullable[r->lhs->number - ntokens]) 123 nullable[r->lhs->number - ntokens] = true; 124 *s2++ = r->lhs->number;
|
H A D | derives.c | 80 symbol_number lhs = rules[r].lhs->number; local 83 p->next = dset[lhs - ntokens]; 85 dset[lhs - ntokens] = p;
|
/external/chromium_org/chrome/browser/ui/zoom/ |
H A D | zoom_controller_browsertest.cc | 25 bool operator==(const ZoomController::ZoomChangedEventData& lhs, argument 27 return lhs.web_contents == rhs.web_contents && 28 lhs.old_zoom_level == rhs.old_zoom_level && 29 lhs.new_zoom_level == rhs.new_zoom_level && 30 lhs.zoom_mode == rhs.zoom_mode && 31 lhs.can_show_bubble == rhs.can_show_bubble;
|
/external/chromium_org/media/cast/net/ |
H A D | cast_transport_config.h | 177 inline bool operator==(RtcpSenderInfo lhs, RtcpSenderInfo rhs) { argument 178 return lhs.ntp_seconds == rhs.ntp_seconds && 179 lhs.ntp_fraction == rhs.ntp_fraction && 180 lhs.rtp_timestamp == rhs.rtp_timestamp && 181 lhs.send_packet_count == rhs.send_packet_count && 182 lhs.send_octet_count == rhs.send_octet_count;
|
/external/lldb/include/lldb/Core/ |
H A D | VMRange.h | 172 bool operator== (const VMRange& lhs, const VMRange& rhs); 173 bool operator!= (const VMRange& lhs, const VMRange& rhs); 174 bool operator< (const VMRange& lhs, const VMRange& rhs); 175 bool operator<= (const VMRange& lhs, const VMRange& rhs); 176 bool operator> (const VMRange& lhs, const VMRange& rhs); 177 bool operator>= (const VMRange& lhs, const VMRange& rhs);
|
/external/chromium_org/chrome/browser/chromeos/device/ |
H A D | input_service_proxy_browsertest.cc | 83 static bool Equals(const InputDeviceInfo& lhs, const InputDeviceInfo& rhs) { argument 84 return lhs.id == rhs.id && lhs.name == rhs.name && 85 lhs.subsystem == rhs.subsystem && 86 lhs.type == rhs.type && 87 lhs.is_accelerometer == rhs.is_accelerometer && 88 lhs.is_joystick == rhs.is_joystick && lhs.is_key == rhs.is_key && 89 lhs.is_keyboard == rhs.is_keyboard && lhs [all...] |
/external/libcxx/test/utilities/optional/optional.comp_with_t/ |
H A D | equal.pass.cpp | 28 constexpr bool operator == ( const X &lhs, const X &rhs ) argument 29 { return lhs.i_ == rhs.i_ ; }
|
H A D | less_than.pass.cpp | 28 constexpr bool operator < ( const X &lhs, const X &rhs ) argument 29 { return lhs.i_ < rhs.i_ ; }
|
/external/lldb/include/lldb/Symbol/ |
H A D | LineEntry.h | 129 /// @param[in] lhs 136 /// @li -1 if lhs < rhs 137 /// @li 0 if lhs == rhs 138 /// @li 1 if lhs > rhs 141 Compare (const LineEntry& lhs, const LineEntry& rhs); 161 /// @param[in] lhs 168 /// Returns \b true if lhs < rhs, false otherwise. 170 bool operator<(const LineEntry& lhs, const LineEntry& rhs);
|
/external/eigen/unsupported/Eigen/src/Skyline/ |
H A D | SkylineProduct.h | 76 EIGEN_STRONG_INLINE SkylineProduct(const Lhs& lhs, const Rhs& rhs) argument 77 : m_lhs(lhs), m_rhs(rhs) { 78 eigen_assert(lhs.cols() == rhs.rows()); 105 EIGEN_STRONG_INLINE const _LhsNested& lhs() const { function in class:Eigen::internal::SkylineProduct 122 EIGEN_DONT_INLINE void skyline_row_major_time_dense_product(const Lhs& lhs, const Rhs& rhs, Dest& dst) { argument 139 for (Index row = 0; row < lhs.rows(); row++) { 140 dst(row, col) = lhs.coeffDiag(row) * rhs(row, col); 144 for (Index row = 0; row < lhs.rows(); row++) { 145 typename _Lhs::InnerLowerIterator lIt(lhs, row); 164 for (Index lhscol = 0; lhscol < lhs 185 skyline_col_major_time_dense_product(const Lhs& lhs, const Rhs& rhs, Dest& dst) argument 256 run(const Lhs& lhs, const Rhs& rhs, ResultType & res) argument 265 run(const Lhs& lhs, const Rhs& rhs, ResultType & res) argument [all...] |
/external/chromium_org/cc/test/ |
H A D | begin_frame_args_test.cc | 55 bool operator==(const BeginFrameArgs& lhs, const BeginFrameArgs& rhs) { argument 56 return (lhs.frame_time == rhs.frame_time) && (lhs.deadline == rhs.deadline) && 57 (lhs.interval == rhs.interval);
|
/external/chromium_org/chrome/browser/ui/views/ |
H A D | accelerator_table_unittest.cc | 21 bool operator()(const AcceleratorMapping& lhs, argument 23 if (lhs.keycode != rhs.keycode) 24 return lhs.keycode < rhs.keycode; 25 return lhs.modifiers < rhs.modifiers;
|