/haiku/headers/cpp/ |
H A D | alloc.h | 31 using __STD::alloc;
|
H A D | bvector.h | 34 #include <alloc.h>
|
H A D | deque.h | 31 #include <alloc.h>
|
H A D | hashtable.h | 36 #include <alloc.h>
|
H A D | list.h | 31 #include <alloc.h>
|
H A D | ropeimpl.h | 874 (_CharT*)alloc::allocate(__len * sizeof(_CharT)); 878 alloc::deallocate(__buffer, __len * sizeof(_CharT)); 880 __STL_UNWIND((alloc::deallocate(__buffer,
|
H A D | slist.h | 19 #include <alloc.h>
|
H A D | stl_alloc.h | 94 // objects of the right type. We do that here explicitly for alloc. 134 // Malloc-based allocator. Typically slower than default alloc below. 286 typedef malloc_alloc alloc; typedef 296 // DISAPPEAR in the future. Clients should just use alloc for now. 455 typedef __default_alloc_template<__NODE_ALLOCATOR_THREADS, 0> alloc; typedef 717 static alloc __node_allocator_dummy_instance; 734 typedef alloc _Alloc; // The underlying allocator. 800 // Allocator adaptor to turn an SGI-style allocator (e.g. alloc, malloc_alloc) 802 // *not* assume that all objects of the underlying alloc class are 803 // identical, nor does it assume that all of the underlying alloc' [all...] |
H A D | stl_bvector.h | 804 typedef vector<bool, alloc> bit_vector;
|
H A D | stl_config.h | 315 # define __STL_DEFAULT_ALLOCATOR(T) alloc
|
H A D | stl_hashtable.h | 57 class _ExtractKey, class _EqualKey, class _Alloc = alloc>
|
H A D | strstream.h | 41 void init_dynamic(_IO_alloc_type alloc, _IO_free_type free,
|
H A D | tree.h | 36 #include <alloc.h>
|
H A D | vector.h | 31 #include <alloc.h>
|
/haiku/headers/cpp/std/ |
H A D | bastring.cc | 97 alloc (basic_string::size_type __size, bool __save) function in class:basic_string
|
/haiku/headers/libs/agg/ |
H A D | agg_renderer_scanline.h | 154 SpanAllocator& alloc, SpanGenerator& span_gen) 167 typename BaseRenderer::color_type* colors = alloc.allocate(len); 181 SpanAllocator& alloc, SpanGenerator& span_gen) 189 render_scanline_aa(sl, ren, alloc, span_gen); 206 alloc_type& alloc, 209 m_alloc(&alloc), 213 alloc_type& alloc, 217 m_alloc = &alloc; 349 SpanAllocator& alloc, SpanGenerator& span_gen) 360 typename BaseRenderer::color_type* colors = alloc 153 render_scanline_aa(const Scanline& sl, BaseRenderer& ren, SpanAllocator& alloc, SpanGenerator& span_gen) argument 180 render_scanlines_aa(Rasterizer& ras, Scanline& sl, BaseRenderer& ren, SpanAllocator& alloc, SpanGenerator& span_gen) argument 205 renderer_scanline_aa(base_ren_type& ren, alloc_type& alloc, span_gen_type& span_gen) argument 212 attach(base_ren_type& ren, alloc_type& alloc, span_gen_type& span_gen) argument 348 render_scanline_bin(const Scanline& sl, BaseRenderer& ren, SpanAllocator& alloc, SpanGenerator& span_gen) argument 371 render_scanlines_bin(Rasterizer& ras, Scanline& sl, BaseRenderer& ren, SpanAllocator& alloc, SpanGenerator& span_gen) argument 396 renderer_scanline_bin(base_ren_type& ren, alloc_type& alloc, span_gen_type& span_gen) argument 403 attach(base_ren_type& ren, alloc_type& alloc, span_gen_type& span_gen) argument 486 render_scanlines_compound(Rasterizer& ras, ScanlineAA& sl_aa, ScanlineBin& sl_bin, BaseRenderer& ren, SpanAllocator& alloc, StyleHandler& sh) argument [all...] |
/haiku/headers/os/drivers/ |
H A D | locked_pool.h | 46 void *(*alloc)(locked_pool_cookie pool); member in struct:__anon257
|
/haiku/src/add-ons/kernel/bus_managers/scsi/ |
H A D | ccb.cpp | 34 ccb = (scsi_ccb *)locked_pool->alloc(device->bus->ccb_pool);
|
H A D | scatter_gather.cpp | 112 ccb->sg_list = temp_sg = (physical_entry*)locked_pool->alloc(temp_sg_pool);
|
/haiku/src/libs/stdc++/legacy/ |
H A D | stlinst.cc | 4 #include <alloc.h>
|
H A D | strstream.cc | 75 void strstreambuf::init_dynamic(_IO_alloc_type alloc, _IO_free_type free, argument 79 _s._allocate_buffer = alloc ? alloc : default_alloc;
|
/haiku/src/system/libroot/posix/glibc/regex/ |
H A D | regcomp.c | 2970 if *alloc == 0. */ 3157 /* Use realloc since array is NULL if *alloc == 0. */ 3440 /* Use realloc since the array is NULL if *alloc == 0. */ 3493 /* Use realloc since array is NULL if *alloc == 0. */ 3559 int alloc = 0; 3590 mbcset, &alloc, 3550 int alloc = 0; local
|
H A D | regex_internal.c | 959 set->alloc = size; 971 set->alloc = 1; 976 set->alloc = set->nelem = 0; 987 set->alloc = 2; 1020 dest->alloc = dest->nelem; 1021 dest->elems = re_malloc (int, dest->alloc); 1024 dest->alloc = dest->nelem = 0; 1036 Note: We assume dest->elems is NULL, when dest->alloc is 0. */ 1049 if (src1->nelem + src2->nelem + dest->nelem > dest->alloc) 1051 int new_alloc = src1->nelem + src2->nelem + dest->alloc; [all...] |
H A D | regex_internal.h | 185 int alloc; member in struct:__anon5494 517 int alloc; member in struct:re_state_table_entry 526 int alloc; member in struct:__anon5499 611 int alloc; member in struct:re_fail_stack_t
|
H A D | regexec.c | 1354 if (fs->num == fs->alloc) 1358 * fs->alloc * 2)); 1361 fs->alloc *= 2; 1414 fs->stack = re_malloc (struct re_fail_stack_ent_t, fs->alloc); 1822 if (!state->inveclosure.alloc) 2890 if (BE (path->alloc < last_str + mctx->max_mb_elem_len + 1, 0)) 2893 int old_alloc = path->alloc; 2894 path->alloc += last_str + mctx->max_mb_elem_len + 1; 2895 new_array = re_realloc (path->array, re_dfastate_t *, path->alloc); 2898 path->alloc [all...] |