/haiku/headers/cpp/ |
H A D | defalloc.h | 42 inline T* allocate(ptrdiff_t size, T*) { function 72 pointer allocate(size_type n) { function in class:allocator 73 return ::allocate((difference_type)n, (pointer)0);
|
H A D | pthread_alloc | 22 // It is not an error to allocate memory in thread A and deallocate 81 // if it is inconvenient to allocate the requested number. 123 static void * allocate(size_t __n) 130 return(malloc_alloc::allocate(__n)); 218 /* We allocate memory in large chunks in order to avoid fragmenting */ 268 _S_start_free = (char *)malloc_alloc::allocate(__bytes_to_get); 272 _S_start_free = (char *)malloc_alloc::allocate(__bytes_to_get); 332 __result = allocate(__new_sz); 394 _Tp* allocate(size_type __n, const void* = 0) { 395 return __n != 0 ? static_cast<_Tp*>(_S_Alloc::allocate(__ [all...] |
H A D | ropeimpl.h | 874 (_CharT*)alloc::allocate(__len * sizeof(_CharT));
|
H A D | stl_alloc.h | 37 // The allocation primitives are intended to allocate individual objects, 159 static void* allocate(size_t __n) function in class:__malloc_alloc_template 231 static _Tp* allocate(size_t __n) function in class:simple_alloc 232 { return 0 == __n ? 0 : (_Tp*) _Alloc::allocate(__n * sizeof (_Tp)); } 233 static _Tp* allocate(void) function in class:simple_alloc 234 { return (_Tp*) _Alloc::allocate(sizeof (_Tp)); } 257 static void* allocate(size_t __n) function in class:debug_alloc 259 char* __result = (char*)_Alloc::allocate(__n + _S_extra); 301 // 2. In all other cases, we allocate an object of size exactly 308 // may use this allocator. It is safe to allocate a 405 static void* allocate(size_t __n) function in class:__default_alloc_template 758 _Tp* allocate(size_type __n, const void* = 0) { function in class:allocator 835 _Tp* allocate(size_type __n, const void* = 0) { function [all...] |
H A D | stl_bvector.h | 262 { return _M_data_allocator.allocate((__n + __WORD_BIT - 1)/__WORD_BIT); } 292 { return _Alloc_type::allocate((__n + __WORD_BIT - 1)/__WORD_BIT); } 336 { return _Alloc_type::allocate((__n + __WORD_BIT - 1)/__WORD_BIT); }
|
H A D | stl_deque.h | 265 // and destructor allocate (but don't initialize) storage. This makes 291 return node_allocator.allocate(__deque_buf_size(__bufsiz,sizeof(_Tp))); 297 { return map_allocator.allocate(__n); } 320 { return _Node_alloc_type::allocate(__deque_buf_size(__bufsiz, 326 { return _Map_alloc_type::allocate(__n); } 405 { return _Node_alloc_type::allocate(__deque_buf_size(__bufsiz, 411 { return _Map_alloc_type::allocate(__n); }
|
H A D | stl_hashtable.h | 213 _Node* _M_get_node() { return _M_node_allocator.allocate(1); } 222 _Node* _M_get_node() { return _M_node_allocator_type::allocate(1); }
|
H A D | stl_list.h | 144 { return _Node_allocator.allocate(1); } 168 _List_node<_Tp>* _M_get_node() { return _Alloc_type::allocate(1); } 222 _List_node<_Tp>* _M_get_node() { return _Alloc_type::allocate(1); }
|
H A D | stl_rope.h | 264 // instance used to allocate them. This is mostly redundant. 297 { return __name##Allocator(_M_data_allocator).allocate(__n); } \ 324 { return __name##Alloc::allocate(__n); } \ 361 { return __name##Alloc::allocate(__n); } \ 1184 { return __name##Allocator(_M_data_allocator).allocate(__n); } \ 1214 { return __name##Alloc::allocate(__n); } \ 1252 { return __name##Alloc::allocate(__n); } \ 1431 _RopeLeaf* __space = _LAllocator(__a).allocate(1); 1443 _RopeConcatenation* __space = _CAllocator(__a).allocate(1); 1454 _RopeFunction* __space = _FAllocator(__a).allocate( [all...] |
H A D | stl_slist.h | 194 { return _M_node_allocator.allocate(1); } 217 _Slist_node<_Tp>* _M_get_node() { return _Alloc_type::allocate(1); } 264 _Slist_node<_Tp>* _M_get_node() { return _Alloc_type::allocate(1); }
|
H A D | stl_tree.h | 454 { return _M_node_allocator.allocate(1); } 475 { return _Alloc_type::allocate(1); } 514 { return _Alloc_type::allocate(1); }
|
H A D | stl_vector.h | 44 // and destructor allocate (but don't initialize) storage. This makes 70 { return _M_data_allocator.allocate(__n); } 95 { return _Alloc_type::allocate(__n); } 147 { return _M_data_allocator::allocate(__n); }
|
H A D | streambuf.h | 380 int allocate() { // For AT&T compatibility function in struct:streambuf
|
/haiku/headers/cpp/std/ |
H A D | bastring.cc | 33 return Allocator::allocate(s + extra * sizeof (charT));
|
/haiku/headers/libs/agg/ |
H A D | agg_array.h | 116 m_array(pod_allocator<T>::allocate(size)), 121 m_array(pod_allocator<T>::allocate(v.m_size)), 132 m_array = pod_allocator<T>::allocate(m_size = size); 181 void allocate(unsigned size, unsigned extra_tail=0); 227 m_array = m_capacity ? pod_allocator<T>::allocate(m_capacity) : 0; 233 void pod_vector<T>::allocate(unsigned size, unsigned extra_tail) function in class:agg::pod_vector 248 T* data = pod_allocator<T>::allocate(new_size); 264 m_array(pod_allocator<T>::allocate(m_capacity)) {} 270 m_array(v.m_capacity ? pod_allocator<T>::allocate(v.m_capacity) : 0) 279 allocate( 826 int8u* allocate(unsigned size, unsigned alignment=1) function in class:agg::block_allocator [all...] |
H A D | agg_basics.h | 38 static T* allocate(unsigned num) { return new T [num]; } function in struct:agg::pod_allocator 43 // allocator. The difference is that it can only allocate a single 45 // In AGG there is no need to allocate an array of objects with 52 static T* allocate() { return new T; } function in struct:agg::obj_allocator
|
H A D | agg_blur.h | 126 m_buf.allocate(w, 128); 127 m_stack.allocate(div, 32); 386 stack.allocate(div); 453 stack.allocate(div); 566 stack.allocate(div); 670 stack.allocate(div); 824 stack.allocate(div); 945 stack.allocate(div); 1112 m_sum1.allocate(w); 1113 m_sum2.allocate( [all...] |
H A D | agg_font_cache_manager.h | 63 m_font_signature = (char*)m_allocator.allocate(strlen(font_signature) + 1); 98 (glyph_cache**)m_allocator.allocate(sizeof(glyph_cache*) * 256, 107 (glyph_cache*)m_allocator.allocate(sizeof(glyph_cache), 111 glyph->data = m_allocator.allocate(data_size); 149 m_fonts(pod_allocator<font_cache*>::allocate(max_fonts)), 165 m_fonts[idx] = obj_allocator<font_cache>::allocate(); 180 m_fonts[m_num_fonts] = obj_allocator<font_cache>::allocate();
|
H A D | agg_gamma_lut.h | 54 m_dir_gamma(pod_allocator<HiResT>::allocate(gamma_size)), 55 m_inv_gamma(pod_allocator<LoResT>::allocate(hi_res_size)) 71 m_dir_gamma(pod_allocator<HiResT>::allocate(gamma_size)), 72 m_inv_gamma(pod_allocator<LoResT>::allocate(hi_res_size))
|
H A D | agg_path_storage.h | 304 pod_allocator<T*>::allocate((m_max_blocks + block_pool) * 2); 326 pod_allocator<T>::allocate(block_size * 2 +
|
H A D | agg_rasterizer_cells_aa.h | 474 pod_allocator<cell_type*>::allocate(m_max_blocks + 487 pod_allocator<cell_type>::allocate(cell_block_size); 649 m_sorted_cells.allocate(m_num_cells, 16); 652 m_sorted_y.allocate(m_max_y - m_min_y + 1, 16);
|
H A D | agg_rasterizer_compound_aa.h | 449 m_styles.allocate(m_max_style - m_min_style + 2, 128); 492 m_cells.allocate(num_cells * 2, 256); // Each cell can have two styles 494 m_asm.allocate((num_styles + 7) >> 3, 8); 613 m_styles.allocate(m_max_style - m_min_style + 2, 128); 642 m_cover_buf.allocate(len, 256);
|
H A D | agg_renderer_scanline.h | 167 typename BaseRenderer::color_type* colors = alloc.allocate(len); 360 typename BaseRenderer::color_type* colors = alloc.allocate(len); 500 color_type* color_span = alloc.allocate(len * 2);
|
H A D | agg_rendering_buffer_dynarow.h | 110 int8u* p = pod_allocator<int8u>::allocate(m_byte_width);
|
H A D | agg_scanline_storage_aa.h | 105 s.ptr = pod_allocator<T>::allocate(num_cells); 146 dst.ptr = pod_allocator<T>::allocate(dst.len);
|