| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/ext/ |
| opt_random.h | 50 __m128i __y = _mm_srli_epi32(__b, __sr1); local
56 __y = _mm_and_si128(__y, _mm_set_epi32(__msk4, __msk3, __msk2, __msk1));
58 return _mm_xor_si128(__z, __y);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/ext/ |
| opt_random.h | 50 __m128i __y = _mm_srli_epi32(__b, __sr1); local
56 __y = _mm_and_si128(__y, _mm_set_epi32(__msk4, __msk3, __msk2, __msk1));
58 return _mm_xor_si128(__z, __y);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/ext/ |
| opt_random.h | 50 __m128i __y = _mm_srli_epi32(__b, __sr1); local
56 __y = _mm_and_si128(__y, _mm_set_epi32(__msk4, __msk3, __msk2, __msk1));
58 return _mm_xor_si128(__z, __y);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/ext/ |
| opt_random.h | 50 __m128i __y = _mm_srli_epi32(__b, __sr1); local
56 __y = _mm_and_si128(__y, _mm_set_epi32(__msk4, __msk3, __msk2, __msk1));
58 return _mm_xor_si128(__z, __y);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/32/ext/ |
| opt_random.h | 50 __m128i __y = _mm_srli_epi32(__b, __sr1); local
56 __y = _mm_and_si128(__y, _mm_set_epi32(__msk4, __msk3, __msk2, __msk1));
58 return _mm_xor_si128(__z, __y);
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/ext/ |
| opt_random.h | 50 __m128i __y = _mm_srli_epi32(__b, __sr1); local
56 __y = _mm_and_si128(__y, _mm_set_epi32(__msk4, __msk3, __msk2, __msk1));
58 return _mm_xor_si128(__z, __y);
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 62 _Rb_tree_node_base* __y = __x->_M_right; local
63 __x->_M_right = __y->_M_left;
64 if (__y->_M_left != 0)
65 __y->_M_left->_M_parent = __x;
66 __y->_M_parent = __x->_M_parent;
69 __root = __y;
71 __x->_M_parent->_M_left = __y;
73 __x->_M_parent->_M_right = __y;
74 __y->_M_left = __x;
75 __x->_M_parent = __y;
81 _Rb_tree_node_base* __y = __x->_M_left; local
103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local
121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local
147 _Rb_tree_node_base* __y = __z; local
285 _Base_ptr __y = _M_node->_M_parent; local
301 _Base_ptr __y = _M_node->_M_parent; local
388 _Base_ptr __y = &this->_M_header._M_data; local
406 _Base_ptr __y = &this->_M_header._M_data; local
637 _Base_ptr __y = _M_clone_node(__x); local
659 _Base_ptr __y = _S_left(__x); local
[all...] |
| _tree.h | 549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local
554 __y = __x, __x = _S_left(__x);
558 if (__y != &this->_M_header._M_data) {
559 if (_M_key_compare(__k, _S_key(__y))) {
560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data);
563 return __y;
568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local
573 __y = __x, __x = _S_left(__x);
577 return __y;
582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local
[all...] |
| concept_checks.h | 143 __ret (*__y)( const __first&, const __second& ) = \
146 __y = __y; __x = __x; } while (0)
250 _TypeY __y = __x; local
251 __sink_unused_warning(__y);
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/32/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/x86_64-linux/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/32/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/x86_64-w64-mingw32/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/libs/x86/include/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/libs/x86_64/include/bits/ |
| opt_random.h | 193 result_type __x, __y, __r2; local
201 __y = result_type(2.0) * __aurng() - 1.0;
202 __r2 = __x * __x + __y * __y;
209 *__f = __y * __mult * __param.stddev() + __param.mean();
|
| /prebuilts/ndk/current/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 62 _Rb_tree_node_base* __y = __x->_M_right; local
63 __x->_M_right = __y->_M_left;
64 if (__y->_M_left != 0)
65 __y->_M_left->_M_parent = __x;
66 __y->_M_parent = __x->_M_parent;
69 __root = __y;
71 __x->_M_parent->_M_left = __y;
73 __x->_M_parent->_M_right = __y;
74 __y->_M_left = __x;
75 __x->_M_parent = __y;
81 _Rb_tree_node_base* __y = __x->_M_left; local
103 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_right; local
121 _Rb_tree_node_base* __y = __x->_M_parent->_M_parent->_M_left; local
147 _Rb_tree_node_base* __y = __z; local
285 _Base_ptr __y = _M_node->_M_parent; local
301 _Base_ptr __y = _M_node->_M_parent; local
388 _Base_ptr __y = &this->_M_header._M_data; local
406 _Base_ptr __y = &this->_M_header._M_data; local
637 _Base_ptr __y = _M_clone_node(__x); local
659 _Base_ptr __y = _S_left(__x); local
[all...] |
| _tree.h | 549 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); // Last node which is not less than __k. local
554 __y = __x, __x = _S_left(__x);
558 if (__y != &this->_M_header._M_data) {
559 if (_M_key_compare(__k, _S_key(__y))) {
560 __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data);
563 return __y;
568 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is not less than __k. */ local
573 __y = __x, __x = _S_left(__x);
577 return __y;
582 _Base_ptr __y = __CONST_CAST(_Base_ptr, &this->_M_header._M_data); /* Last node which is greater than __k. * local
[all...] |
| concept_checks.h | 143 __ret (*__y)( const __first&, const __second& ) = \
146 __y = __y; __x = __x; } while (0)
250 _TypeY __y = __x; local
251 __sink_unused_warning(__y);
|
| /external/opencv3/modules/calib3d/test/ |
| test_undistort.cpp | 536 double __y = _y; local
543 __y = _y*(1+_distCoeffs->data.db[0]*r2+_distCoeffs->data.db[1]*r2*r2)+
548 __y+=_y*_distCoeffs->data.db[4]*r2*r2*r2;
554 _dst->data.db[2*i+1] = __y*_cameraMatrix->data.db[4]+_cameraMatrix->data.db[5];
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_tree.h | 311 const _Rb_tree_const_iterator<_Val>& __y)
312 { return __x._M_node == __y._M_node; }
317 const _Rb_tree_const_iterator<_Val>& __y)
318 { return __x._M_node != __y._M_node; }
592 _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v);
595 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
599 _M_insert_lower(_Base_ptr __y, _Arg&& __v);
612 _M_insert_(_Base_ptr __x, _Base_ptr __y,
618 _M_insert_lower(_Base_ptr __y, const value_type& __v);
631 _M_lower_bound(_Link_type __x, _Link_type __y,
1070 _Link_type __y = _M_end(); local
1099 _Link_type __y = _M_clone_node(__x); local
1126 _Link_type __y = _S_left(__x); local
1206 _Link_type __y = _M_end(); local
1237 _Const_Link_type __y = _M_end(); local
1319 _Link_type __y = _M_end(); local
1351 _Link_type __y = _M_end(); local
1604 _Link_type __y = _M_end(); local
1742 _Link_type __y = local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_tree.h | 311 const _Rb_tree_const_iterator<_Val>& __y)
312 { return __x._M_node == __y._M_node; }
317 const _Rb_tree_const_iterator<_Val>& __y)
318 { return __x._M_node != __y._M_node; }
592 _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v);
595 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
599 _M_insert_lower(_Base_ptr __y, _Arg&& __v);
612 _M_insert_(_Base_ptr __x, _Base_ptr __y,
618 _M_insert_lower(_Base_ptr __y, const value_type& __v);
631 _M_lower_bound(_Link_type __x, _Link_type __y,
1070 _Link_type __y = _M_end(); local
1099 _Link_type __y = _M_clone_node(__x); local
1126 _Link_type __y = _S_left(__x); local
1206 _Link_type __y = _M_end(); local
1237 _Const_Link_type __y = _M_end(); local
1319 _Link_type __y = _M_end(); local
1351 _Link_type __y = _M_end(); local
1604 _Link_type __y = _M_end(); local
1742 _Link_type __y = local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_tree.h | 311 const _Rb_tree_const_iterator<_Val>& __y)
312 { return __x._M_node == __y._M_node; }
317 const _Rb_tree_const_iterator<_Val>& __y)
318 { return __x._M_node != __y._M_node; }
592 _M_insert_(_Base_ptr __x, _Base_ptr __y, _Arg&& __v);
595 _M_insert_node(_Base_ptr __x, _Base_ptr __y, _Link_type __z);
599 _M_insert_lower(_Base_ptr __y, _Arg&& __v);
612 _M_insert_(_Base_ptr __x, _Base_ptr __y,
618 _M_insert_lower(_Base_ptr __y, const value_type& __v);
631 _M_lower_bound(_Link_type __x, _Link_type __y,
1070 _Link_type __y = _M_end(); local
1099 _Link_type __y = _M_clone_node(__x); local
1126 _Link_type __y = _S_left(__x); local
1206 _Link_type __y = _M_end(); local
1237 _Const_Link_type __y = _M_end(); local
1319 _Link_type __y = _M_end(); local
1351 _Link_type __y = _M_end(); local
1604 _Link_type __y = _M_end(); local
1742 _Link_type __y = local
[all...] |
