/third_party/boost/boost/interprocess/mem_algo/ |
D | rbtree_best_fit.hpp | 113 size_type m_size : sizeof(size_type)*CHAR_BIT - 2; 123 { this->m_size = 0; this->m_allocated = 0, this->m_prev_allocated = 0; } in block_ctrl() 126 { return a.m_size < b.m_size; } in operator <() 128 { return a.m_size == b.m_size; } in operator ==() 134 { return size < block.m_size; } in operator ()() 137 { return block.m_size < size; } in operator ()() 159 size_type m_size; member 388 first_big_block->m_size = segment_size/Alignment - EndCtrlBlockUnits; in priv_add_segment() 389 BOOST_ASSERT(first_big_block->m_size >= BlockCtrlUnits); in priv_add_segment() 393 (new (reinterpret_cast<char*>(addr) + first_big_block->m_size*Alignment)SizeHolder); in priv_add_segment() [all …]
|
/third_party/boost/boost/geometry/srs/projections/ |
D | par_data.hpp | 90 : m_size(0) in towgs84() 114 : m_size(3) in towgs84() 122 : m_size(7) in towgs84() 135 BOOST_GEOMETRY_ASSERT(m_size < static_capacity); in push_back() 136 m_data[m_size] = v; in push_back() 137 ++m_size; in push_back() 143 for (m_size = 0 ; first != last && m_size < 7 ; ++first, ++m_size) in assign() 144 m_data[m_size] = *first; in assign() 156 BOOST_GEOMETRY_ASSERT(i < m_size); in operator []() 162 BOOST_GEOMETRY_ASSERT(i < m_size); in operator []() [all …]
|
/third_party/boost/boost/geometry/index/detail/ |
D | varray.hpp | 219 : m_size(0) in varray() 237 : m_size(0) in varray() 258 : m_size(0) in varray() 282 : m_size(0) in varray() 299 : m_size(other.size()) in varray() 321 : m_size(other.size()) in varray() 408 : m_size(other.m_size) in varray() 559 if ( count < m_size ) in resize() 569 m_size = count; // update end in resize() 590 if ( count < m_size ) in resize() [all …]
|
/third_party/boost/boost/spirit/home/support/iterators/detail/ |
D | fixed_size_queue.hpp | 27 BOOST_ASSERT(((m_tail + N + 1) - m_head) % (N+1) == m_size % (N+1)) \ 193 return m_size == 0; in empty() 198 return m_size == N; in full() 223 return m_size; in size() 243 std::size_t m_size; member in boost::spirit::detail::fixed_size_queue 252 , m_size(0) in fixed_size_queue() 254 BOOST_ASSERT(m_size <= N+1); in fixed_size_queue() 265 , m_size(x.m_size) in fixed_size_queue() 268 BOOST_ASSERT(m_size <= N+1); in fixed_size_queue() 282 m_size = x.m_size; in operator =() [all …]
|
/third_party/boost/boost/spirit/home/classic/iterator/ |
D | fixed_size_queue.hpp | 24 BOOST_SPIRIT_ASSERT(((m_tail + N + 1) - m_head) % (N+1) == m_size % (N+1)) \ 200 return m_size == 0; in empty() 205 return m_size == N; in full() 230 return m_size; in size() 250 std::size_t m_size; member in boost::spirit::fixed_size_queue 259 , m_size(0) in fixed_size_queue() 261 BOOST_SPIRIT_ASSERT(m_size <= N+1); in fixed_size_queue() 272 , m_size(x.m_size) in fixed_size_queue() 275 BOOST_SPIRIT_ASSERT(m_size <= N+1); in fixed_size_queue() 289 m_size = x.m_size; in operator =() [all …]
|
/third_party/boost/boost/geometry/iterators/ |
D | closing_iterator.hpp | 65 , m_size(static_cast<difference_type>(boost::size(range))) in closing_iterator() 74 , m_size(static_cast<difference_type>(boost::size(range))) in closing_iterator() 75 , m_index((m_size == 0) ? 0 : m_size + 1) in closing_iterator() 81 , m_size(0) in closing_iterator() 106 if (++m_index < m_size) in increment() 118 if (m_index-- < m_size) in decrement() 130 if (m_index < m_size && m_index + n < m_size) in advance() 144 this->m_iterator = m_index <= m_size in update_iterator() 145 ? boost::begin(*m_range) + (m_index % m_size) in update_iterator() 153 difference_type m_size; member
|
D | ever_circling_iterator.hpp | 123 , m_size(boost::size(range)) in ever_circling_range_iterator() 130 , m_size(0) in ever_circling_range_iterator() 159 if (m_index >= 0 && m_index < m_size) in increment() 172 if (m_index >= 0 && m_index < m_size) in decrement() 184 if (m_index >= 0 && m_index < m_size in advance() 185 && m_index + n >= 0 && m_index + n < m_size) in advance() 201 m_index += m_size; in update_iterator() 203 m_index = m_index % m_size; in update_iterator() 209 difference_type m_size; member
|
/third_party/wayland-ivi-extension/ivi-layermanagement-examples/EGLWLMockNavigation/src/ |
D | Car.cpp | 33 , m_size(size) in Car() 44 m_vertex[1].x = 0.1 * m_size.x; in Car() 46 m_vertex[1].z = -m_size.z; in Car() 48 m_vertex[2].x = 0.9 * m_size.x; in Car() 50 m_vertex[2].z = -m_size.z; in Car() 52 m_vertex[3].x = m_size.x; in Car() 59 , m_size(size) in Car() 72 m_vertex[1].z = -m_size.z; in Car() 74 m_vertex[2].x = m_size.x; in Car() 76 m_vertex[2].z = -m_size.z; in Car() [all …]
|
D | Street.cpp | 35 , m_size(size) in Street() 52 m_vertex[1].x = m_position.x + m_size.x; in Street() 56 m_vertex[2].x = m_position.x + m_size.x; in Street() 58 m_vertex[2].z = m_position.z + m_size.z; in Street() 62 m_vertex[3].z = m_position.z + m_size.z; in Street() 72 float z_to_x = m_size.z / m_size.x; in Street() 73 float x_to_z = m_size.x / m_size.z; in Street()
|
D | Ground.cpp | 34 , m_size(size) in Ground() 51 m_vertex[1].x = m_position.x + m_size.x; in Ground() 55 m_vertex[2].x = m_position.x + m_size.x; in Ground() 57 m_vertex[2].z = m_position.z + m_size.z; in Ground() 61 m_vertex[3].z = m_position.z + m_size.z; in Ground()
|
/third_party/boost/boost/interprocess/mem_algo/detail/ |
D | mem_algo_common.hpp | 287 size_type old_size = first->m_size; in allocate_aligned() 294 first->m_size = first_min_units; in allocate_aligned() 295 second->m_size = old_size - first->m_size; in allocate_aligned() 296 BOOST_ASSERT(second->m_size >= MinBlockUnits); in allocate_aligned() 323 BOOST_ASSERT(pos <= (reinterpret_cast<char*>(first) + first->m_size*Alignment)); in allocate_aligned() 324 BOOST_ASSERT(first->m_size >= 2*MinBlockUnits); in allocate_aligned() 326 (reinterpret_cast<char*>(first) + first->m_size*Alignment)); in allocate_aligned() 328 size_type old_size = first->m_size; in allocate_aligned() 329 …first->m_size = (size_type)(reinterpret_cast<char*>(second) - reinterpret_cast<char*>(first))/Ali… in allocate_aligned() 346 if((old_size - first->m_size) >= (second_min_units + MinBlockUnits)){ in allocate_aligned() [all …]
|
D | simple_seq_fit_impl.hpp | 98 size_type m_size; member in boost::interprocess::ipcdetail::simple_seq_fit_impl::block_ctrl 101 { return this->m_size*Alignment - BlockCtrlBytes; } in get_user_bytes() 104 { return this->m_size*Alignment; } in get_total_bytes() 119 size_type m_size; member 314 ipcdetail::get_truncated_size(m_header.m_size + this_disalignment, Alignment) in priv_block_end_offset() 326 m_header.m_size = segment_size; in simple_seq_fit_impl() 335 m_header.m_root.m_next->m_size = (segment_size - block1_off)/Alignment; in simple_seq_fit_impl() 354 m_header.m_size += extra_size; in grow() 357 if((m_header.m_size - old_end) < MinBlockSize){ in grow() 368 new_block->m_size = (m_header.m_size - old_end)/Alignment; in grow() [all …]
|
/third_party/boost/libs/container/bench/detail/ |
D | varray.hpp | 285 : m_size(0) in varray() 303 : m_size(0) in varray() 324 : m_size(0) in varray() 348 : m_size(0) in varray() 363 : m_size(other.size()) in varray() 385 : m_size(other.size()) in varray() 477 : m_size(other.m_size) in varray() 628 if ( count < m_size ) in resize() 638 m_size = count; // update end in resize() 659 if ( count < m_size ) in resize() [all …]
|
/third_party/boost/boost/compute/container/ |
D | vector.hpp | 122 : m_size(0), in vector() 142 : m_size(count), in vector() 159 : m_size(count), in vector() 182 : m_size(detail::iterator_range_size(first, last)), in vector() 185 m_data = m_allocator.allocate((std::max)(m_size, _minimum_capacity())); in vector() 193 : m_size(other.m_size), in vector() 196 m_data = m_allocator.allocate((std::max)(m_size, _minimum_capacity())); in vector() 215 : m_size(other.size()), in vector() 218 m_data = m_allocator.allocate((std::max)(m_size, _minimum_capacity())); in vector() 230 : m_size(vector.size()), in vector() [all …]
|
D | dynamic_bitset.hpp | 54 m_size(size) in dynamic_bitset() 63 m_size(other.m_size) in dynamic_bitset() 72 m_size = other.m_size; in operator =() 86 return m_size; in size() 142 m_size = num_bits; in resize() 231 size_type m_size; member in boost::compute::dynamic_bitset
|
/third_party/boost/boost/serialization/ |
D | binary_object.hpp | 43 std::size_t m_size; member 46 ar.save_binary(m_t, m_size); in save() 50 ar.load_binary(const_cast<void *>(m_t), m_size); in load() 55 m_size = rhs.m_size; in BOOST_SERIALIZATION_SPLIT_MEMBER() 60 m_size(size) in binary_object() 64 m_size(rhs.m_size) in binary_object()
|
/third_party/boost/boost/move/detail/ |
D | destruct_n.hpp | 35 : m_ptr(raw), m_size() in destruct_n() 40 ++m_size; in incr() 45 m_size += n; in incr() 50 m_size = 0u; in release() 55 while(m_size--){ in ~destruct_n() 56 m_ptr[m_size].~T(); in ~destruct_n() 61 std::size_t m_size; member in boost::movelib::destruct_n
|
/third_party/boost/libs/interprocess/test/ |
D | expand_bwd_test_allocator.hpp | 78 : mp_buffer(buf), m_size(sz) in expand_bwd_test_allocator() 83 : mp_buffer(other.mp_buffer), m_size(other.m_size) in expand_bwd_test_allocator() 89 : mp_buffer(other.mp_buffer), m_size(other.m_size) in expand_bwd_test_allocator() 112 { return m_size; } in max_size() 117 ::boost::adl_move_swap(alloc1.m_size, alloc2.m_size); in swap() 132 if((m_offset + limit_size) > m_size){ in allocation_command() 139 if(limit_size > m_size){ in allocation_command() 154 { (void)p; return m_size; } in size() 169 size_type m_size; member in boost::interprocess::test::expand_bwd_test_allocator
|
/third_party/boost/boost/compute/memory/ |
D | local_buffer.hpp | 40 : m_size(size) in local_buffer() 46 : m_size(other.m_size) in local_buffer() 54 m_size = other.m_size; in operator =() 68 return m_size; in size() 72 size_t m_size; member in boost::compute::local_buffer
|
/third_party/boost/libs/container/test/ |
D | expand_bwd_test_allocator.hpp | 83 : mp_buffer(buffer), m_size(sz) in expand_bwd_test_allocator() 88 : mp_buffer(other.mp_buffer), m_size(other.m_size) in expand_bwd_test_allocator() 94 : mp_buffer(other.mp_buffer), m_size(other.m_size) in expand_bwd_test_allocator() 117 { return m_size; } in max_size() 122 boost::adl_move_swap(alloc1.m_size, alloc2.m_size); in swap() 138 if((m_offset + limit_size) > m_size){ in allocation_command() 146 if(limit_size > m_size){ in allocation_command() 161 { (void)p; return m_size; } in size() 176 size_type m_size; member in boost::container::test::expand_bwd_test_allocator
|
/third_party/boost/boost/move/algo/detail/ |
D | merge.hpp | 42 : m_ptr(), m_size(0), m_capacity(0) in adaptive_xbuf() 46 : m_ptr(raw_memory), m_size(0), m_capacity(capacity) in adaptive_xbuf() 52 if(n <= m_size){ in move_assign() 54 size_type size = m_size; in move_assign() 58 m_size = n; in move_assign() 61 RandRawIt result = boost::move(first, first+m_size, m_ptr); in move_assign() 62 boost::uninitialized_move(first+m_size, first+n, result); in move_assign() 63 m_size = n; in move_assign() 70 BOOST_ASSERT(m_capacity - m_size >= n); in push_back() 71 boost::uninitialized_move(first, first+n, m_ptr+m_size); in push_back() [all …]
|
/third_party/boost/boost/interprocess/ |
D | mapped_region.hpp | 145 : m_base(0), m_size(0) in mapped_region() 150 : m_base(0), m_size(0), m_page_offset(0), m_mode(read_only), m_is_xsi(false) in mapped_region() 251 std::size_t m_size; member in boost::interprocess::mapped_region 279 { return m_size; } in get_size() 291 { return m_size + m_page_offset; } in priv_map_size() 300 if(mapping_offset >= m_size || numbytes > (m_size - size_t(mapping_offset))){ in priv_flush_param_check() 306 numbytes = m_size - mapping_offset; in priv_flush_param_check() 317 if(m_base == 0 || bytes > m_size){ in priv_shrink_param_check() 320 else if(bytes == m_size){ in priv_shrink_param_check() 327 const std::size_t new_pages = (m_size + m_page_offset - bytes - 1)/page_size + 1; in priv_shrink_param_check() [all …]
|
/third_party/boost/boost/container/ |
D | vector.hpp | 310 : allocator_type(), m_start(), m_size(), m_capacity() in BOOST_NOEXCEPT_IF() 316 : allocator_type(boost::forward<AllocConvertible>(a)), m_start(), m_size(), m_capacity() in vector_alloc_holder() 325 , m_size(static_cast<stored_size_type>(initial_size)) in vector_alloc_holder() 341 , m_size(static_cast<stored_size_type>(initial_size)) in vector_alloc_holder() 355 , m_size(holder.m_size) in vector_alloc_holder() 359 holder.m_size = holder.m_capacity = 0; in vector_alloc_holder() 366 , m_size() in vector_alloc_holder() 375 , m_size() in vector_alloc_holder() 428 BOOST_ASSERT(additional_objects > size_type(this->m_capacity - this->m_size)); in next_capacity() 432 …nst size_type min_additional_cap = additional_objects - size_type(this->m_capacity - this->m_size); in next_capacity() [all …]
|
/third_party/ltp/testcases/realtime/func/matrix_mult/ |
D | matrix_mult.c | 115 void matrix_mult(int m_size) in matrix_mult() argument 117 double A[m_size][m_size]; in matrix_mult() 118 double B[m_size][m_size]; in matrix_mult() 119 double C[m_size][m_size]; in matrix_mult() 123 for (i = 0; i < m_size; i++) { in matrix_mult() 124 int i_m = m_size - i; in matrix_mult() 125 for (j = 0; j < m_size; j++) { in matrix_mult() 127 for (k = 0; k < m_size; k++) in matrix_mult() 134 void matrix_mult_record(int m_size, int index) in matrix_mult_record() argument
|
/third_party/boost/boost/test/tools/detail/ |
D | it_pair.hpp | 37 it_pair( It const& b, It const& e ) : m_begin( b ), m_size( 0 ) in it_pair() 40 while( tmp != e ) { ++m_size; ++tmp; } in it_pair() 44 It end() const { return m_begin + m_size; } in end() 45 size_t size() const { return m_size; } in size() 49 size_t m_size; member
|