| /bionic/libc/bionic/ |
| mbstate.cpp | 35 (ps->__seq[2] != 0) ? 3 :
36 (ps->__seq[1] != 0) ? 2 :
37 (ps->__seq[0] != 0) ? 1 : 0;
41 ps->__seq[i] = static_cast<uint8_t>(byte);
45 return ps->__seq[n];
50 *(reinterpret_cast<uint32_t*>(ps->__seq)) = 0;
55 *(reinterpret_cast<uint32_t*>(ps->__seq)) = 0;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/debug/ |
| safe_unordered_base.h | 58 * by @p __seq. @p __constant is true when we are initializing a
60 * Note that @p __seq may be NULL, in which case the iterator will be
61 * singular. Otherwise, the iterator will reference @p __seq and
64 _Safe_local_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
65 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
91 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
94 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
|
| safe_base.h | 81 * by @p __seq. @p __constant is true when we are initializing a
83 * that @p __seq may be NULL, in which case the iterator will be
84 * singular. Otherwise, the iterator will reference @p __seq and
87 _Safe_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
89 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
115 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
118 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
129 bool _M_attached_to(const _Safe_sequence_base* __seq) const
130 { return _M_sequence == __seq; }
|
| formatter.h | 339 _Parameter(const _Safe_sequence<_Sequence>& __seq,
345 static_cast<const _Sequence*>(&__seq);
354 _Parameter(const _Sequence& __seq, const char* __name, _Is_sequence)
358 _M_variant._M_sequence._M_address = &__seq;
405 _M_sequence(const _Sequence& __seq, const char* __name = 0) const
408 _M_parameters[_M_num_parameters++] = _Parameter(__seq, __name,
|
| safe_local_iterator.h | 92 const _Sequence* __seq)
93 : _Safe_local_iterator_base(__seq, _M_constant()), _M_current(__i),
238 _M_attach(_Safe_sequence_base* __seq)
239 { _Safe_iterator_base::_M_attach(__seq, _M_constant()); }
243 _M_attach_single(_Safe_sequence_base* __seq)
244 { _Safe_iterator_base::_M_attach_single(__seq, _M_constant()); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/debug/ |
| safe_unordered_base.h | 58 * by @p __seq. @p __constant is true when we are initializing a
60 * Note that @p __seq may be NULL, in which case the iterator will be
61 * singular. Otherwise, the iterator will reference @p __seq and
64 _Safe_local_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
65 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
91 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
94 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
|
| safe_base.h | 81 * by @p __seq. @p __constant is true when we are initializing a
83 * that @p __seq may be NULL, in which case the iterator will be
84 * singular. Otherwise, the iterator will reference @p __seq and
87 _Safe_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
89 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
115 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
118 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
129 bool _M_attached_to(const _Safe_sequence_base* __seq) const
130 { return _M_sequence == __seq; }
|
| formatter.h | 339 _Parameter(const _Safe_sequence<_Sequence>& __seq,
345 static_cast<const _Sequence*>(&__seq);
354 _Parameter(const _Sequence& __seq, const char* __name, _Is_sequence)
358 _M_variant._M_sequence._M_address = &__seq;
405 _M_sequence(const _Sequence& __seq, const char* __name = 0) const
408 _M_parameters[_M_num_parameters++] = _Parameter(__seq, __name,
|
| safe_local_iterator.h | 92 const _Sequence* __seq)
93 : _Safe_local_iterator_base(__seq, _M_constant()), _M_current(__i),
238 _M_attach(_Safe_sequence_base* __seq)
239 { _Safe_iterator_base::_M_attach(__seq, _M_constant()); }
243 _M_attach_single(_Safe_sequence_base* __seq)
244 { _Safe_iterator_base::_M_attach_single(__seq, _M_constant()); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/debug/ |
| safe_unordered_base.h | 58 * by @p __seq. @p __constant is true when we are initializing a
60 * Note that @p __seq may be NULL, in which case the iterator will be
61 * singular. Otherwise, the iterator will reference @p __seq and
64 _Safe_local_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
65 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
91 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
94 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
|
| safe_base.h | 81 * by @p __seq. @p __constant is true when we are initializing a
83 * that @p __seq may be NULL, in which case the iterator will be
84 * singular. Otherwise, the iterator will reference @p __seq and
87 _Safe_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
89 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
115 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
118 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
129 bool _M_attached_to(const _Safe_sequence_base* __seq) const
130 { return _M_sequence == __seq; }
|
| formatter.h | 339 _Parameter(const _Safe_sequence<_Sequence>& __seq,
345 static_cast<const _Sequence*>(&__seq);
354 _Parameter(const _Sequence& __seq, const char* __name, _Is_sequence)
358 _M_variant._M_sequence._M_address = &__seq;
405 _M_sequence(const _Sequence& __seq, const char* __name = 0) const
408 _M_parameters[_M_num_parameters++] = _Parameter(__seq, __name,
|
| safe_local_iterator.h | 92 const _Sequence* __seq)
93 : _Safe_local_iterator_base(__seq, _M_constant()), _M_current(__i),
238 _M_attach(_Safe_sequence_base* __seq)
239 { _Safe_iterator_base::_M_attach(__seq, _M_constant()); }
243 _M_attach_single(_Safe_sequence_base* __seq)
244 { _Safe_iterator_base::_M_attach_single(__seq, _M_constant()); }
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/debug/ |
| safe_unordered_base.h | 58 * by @p __seq. @p __constant is true when we are initializing a
60 * Note that @p __seq may be NULL, in which case the iterator will be
61 * singular. Otherwise, the iterator will reference @p __seq and
64 _Safe_local_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
65 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
91 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
94 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
|
| safe_base.h | 81 * by @p __seq. @p __constant is true when we are initializing a
83 * that @p __seq may be NULL, in which case the iterator will be
84 * singular. Otherwise, the iterator will reference @p __seq and
87 _Safe_iterator_base(const _Safe_sequence_base* __seq, bool __constant)
89 { this->_M_attach(const_cast<_Safe_sequence_base*>(__seq), __constant); }
115 void _M_attach(_Safe_sequence_base* __seq, bool __constant);
118 void _M_attach_single(_Safe_sequence_base* __seq, bool __constant) throw ();
129 bool _M_attached_to(const _Safe_sequence_base* __seq) const
130 { return _M_sequence == __seq; }
|
| formatter.h | 341 _Parameter(const _Safe_sequence<_Sequence>& __seq,
347 static_cast<const _Sequence*>(&__seq);
356 _Parameter(const _Sequence& __seq, const char* __name, _Is_sequence)
360 _M_variant._M_sequence._M_address = &__seq;
407 _M_sequence(const _Sequence& __seq, const char* __name = 0) const
410 _M_parameters[_M_num_parameters++] = _Parameter(__seq, __name,
|
| safe_local_iterator.h | 89 _Safe_local_iterator(const _Iterator& __i, const _Sequence* __seq)
90 : _Safe_local_iterator_base(__seq, _M_constant()), _M_current(__i)
232 _M_attach(_Safe_sequence_base* __seq)
233 { _Safe_iterator_base::_M_attach(__seq, _M_constant()); }
237 _M_attach_single(_Safe_sequence_base* __seq)
238 { _Safe_iterator_base::_M_attach_single(__seq, _M_constant()); }
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| multiway_mergesort.h | 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++)
161 __sd->_M_pieces[__iam][__seq]._M_end
162 = __offsets[__seq] - __seqs[__seq].first;
165 __sd->_M_pieces[__iam][__seq]._M_end =
166 __sd->_M_starts[__seq + 1] - __sd->_M_starts[__seq];
171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++
[all...] |
| multiway_merge.h | 292 *__target = *__seq ## __a; \
295 ++__seq ## __a; \
297 if (__seq ## __a __c0 __seq ## __b) goto __s ## __a ## __b ## __c; \
298 if (__seq ## __a __c1 __seq ## __c) goto __s ## __b ## __a ## __c; \
381 if (__seq ## __d < __seq ## __a) \
383 if (__seq ## __d < __seq ## __b)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/ |
| multiway_mergesort.h | 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++)
161 __sd->_M_pieces[__iam][__seq]._M_end
162 = __offsets[__seq] - __seqs[__seq].first;
165 __sd->_M_pieces[__iam][__seq]._M_end =
166 __sd->_M_starts[__seq + 1] - __sd->_M_starts[__seq];
171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++
[all...] |
| multiway_merge.h | 292 *__target = *__seq ## __a; \
295 ++__seq ## __a; \
297 if (__seq ## __a __c0 __seq ## __b) goto __s ## __a ## __b ## __c; \
298 if (__seq ## __a __c1 __seq ## __c) goto __s ## __b ## __a ## __c; \
381 if (__seq ## __d < __seq ## __a) \
383 if (__seq ## __d < __seq ## __b)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| multiway_mergesort.h | 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++)
161 __sd->_M_pieces[__iam][__seq]._M_end
162 = __offsets[__seq] - __seqs[__seq].first;
165 __sd->_M_pieces[__iam][__seq]._M_end =
166 __sd->_M_starts[__seq + 1] - __sd->_M_starts[__seq];
171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++
[all...] |
| multiway_merge.h | 292 *__target = *__seq ## __a; \
295 ++__seq ## __a; \
297 if (__seq ## __a __c0 __seq ## __b) goto __s ## __a ## __b ## __c; \
298 if (__seq ## __a __c1 __seq ## __c) goto __s ## __b ## __a ## __c; \
381 if (__seq ## __d < __seq ## __a) \
383 if (__seq ## __d < __seq ## __b)
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| multiway_mergesort.h | 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++)
161 __sd->_M_pieces[__iam][__seq]._M_end
162 = __offsets[__seq] - __seqs[__seq].first;
165 __sd->_M_pieces[__iam][__seq]._M_end =
166 __sd->_M_starts[__seq + 1] - __sd->_M_starts[__seq];
171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++
[all...] |
| multiway_merge.h | 292 *__target = *__seq ## __a; \
295 ++__seq ## __a; \
297 if (__seq ## __a __c0 __seq ## __b) goto __s ## __a ## __b ## __c; \
298 if (__seq ## __a __c1 __seq ## __c) goto __s ## __b ## __a ## __c; \
381 if (__seq ## __d < __seq ## __a) \
383 if (__seq ## __d < __seq ## __b)
[all...] |
