Home
last modified time | relevance | path

Searched refs:alloc (Results 1 – 13 of 13) sorted by relevance

/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector.bool/
Dconstruct_iter_iter_alloc.pass.cpp36 std::allocator<bool> alloc; in main() local
37 … test<std::vector<bool> >(input_iterator<const bool*>(a), input_iterator<const bool*>(an), alloc); in main()
38 …st<std::vector<bool> >(forward_iterator<const bool*>(a), forward_iterator<const bool*>(an), alloc); in main()
39 …or<bool> >(bidirectional_iterator<const bool*>(a), bidirectional_iterator<const bool*>(an), alloc); in main()
40 …or<bool> >(random_access_iterator<const bool*>(a), random_access_iterator<const bool*>(an), alloc); in main()
41 test<std::vector<bool> >(a, an, alloc); in main()
/ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/vector/vector.cons/
Dconstruct_iter_iter_alloc.pass.cpp36 std::allocator<int> alloc; in main() local
37 test<std::vector<int> >(input_iterator<const int*>(a), input_iterator<const int*>(an), alloc); in main()
38 … test<std::vector<int> >(forward_iterator<const int*>(a), forward_iterator<const int*>(an), alloc); in main()
39 …ector<int> >(bidirectional_iterator<const int*>(a), bidirectional_iterator<const int*>(an), alloc); in main()
40 …ector<int> >(random_access_iterator<const int*>(a), random_access_iterator<const int*>(an), alloc); in main()
41 test<std::vector<int> >(a, an, alloc); in main()
/ndk/sources/host-tools/ndk-stack/elff/
Delf_alloc.cc34 void* ElfAllocator::alloc(size_t size) { in alloc() function in ElfAllocator
61 return elf->allocator()->alloc(size); in operator new()
Delf_alloc.h95 void* alloc(size_t size);
/ndk/sources/host-tools/sed-4.2.1/sed/
Dexecute.c91 size_t alloc; /* Allocated space for active. */ member
215 if (inactive > lb->alloc * 2)
218 lb->alloc += lb->active - lb->text;
222 if (lb->alloc > len)
226 lb->alloc *= 2;
227 if (lb->alloc < len)
228 lb->alloc = len;
229 if (lb->alloc < INITIAL_BUFFER_SIZE)
230 lb->alloc = INITIAL_BUFFER_SIZE;
232 lb->text = REALLOC(lb->text, inactive + lb->alloc, char);
[all …]
/ndk/sources/host-tools/sed-4.2.1/lib/
Dregex_internal.c972 set->alloc = size; in re_node_set_alloc()
984 set->alloc = 1; in re_node_set_init_1()
989 set->alloc = set->nelem = 0; in re_node_set_init_1()
1000 set->alloc = 2; in re_node_set_init_2()
1033 dest->alloc = dest->nelem; in re_node_set_init_copy()
1034 dest->elems = re_malloc (Idx, dest->alloc); in re_node_set_init_copy()
1037 dest->alloc = dest->nelem = 0; in re_node_set_init_copy()
1062 if (src1->nelem + src2->nelem + dest->nelem > dest->alloc) in re_node_set_add_intersect()
1064 Idx new_alloc = src1->nelem + src2->nelem + dest->alloc; in re_node_set_add_intersect()
1069 dest->alloc = new_alloc; in re_node_set_add_intersect()
[all …]
Dregex_internal.h227 Idx alloc; member
561 Idx alloc; member
570 Idx alloc; member
655 Idx alloc; member
Dregexec.c1396 if (fs->num == fs->alloc) in push_fail_stack()
1400 * fs->alloc * 2)); in push_fail_stack()
1403 fs->alloc *= 2; in push_fail_stack()
1456 fs->stack = re_malloc (struct re_fail_stack_ent_t, fs->alloc); in set_regs()
1864 if (!state->inveclosure.alloc) in add_epsilon_src_nodes()
2934 if (BE (path->alloc < last_str + mctx->max_mb_elem_len + 1, 0)) in check_arrival()
2937 Idx old_alloc = path->alloc; in check_arrival()
2946 path->alloc = new_alloc; in check_arrival()
2948 sizeof (re_dfastate_t *) * (path->alloc - old_alloc)); in check_arrival()
Dregcomp.c3583 Idx alloc = 0; in build_charclass_op() local
3614 mbcset, &alloc, in build_charclass_op()
/ndk/sources/cxx-stl/stlport/src/
Dsparc_atomic.s1 .section ".text",#alloc,#execinstr
Dsparc_atomic64.s1 .section ".text",#alloc,#execinstr
/ndk/sources/host-tools/sed-4.2.1/
DChangeLog1349 if buffer.alloc==0 we may have malloc()'d 1 byte anyway,
3113 multiply append.alloc by 2 instead of adding
/ndk/sources/host-tools/make-3.81/
DChangeLog186 strcache, so there's never any need to alloc/free them.