HomeSort by relevance Sort by last modified time
    Searched refs:growth (Results 1 - 25 of 64) sorted by null

1 2 3

  /external/google-breakpad/src/client/
minidump_file_writer.cc 226 size_t growth = aligned_size; local
230 if (growth < minimal_growth)
231 growth = minimal_growth;
233 size_t new_size = size_ + growth;
  /prebuilts/go/darwin-x86/doc/progs/
slices.go 16 // allocate double what's needed, for future growth.
  /prebuilts/go/linux-x86/doc/progs/
slices.go 16 // allocate double what's needed, for future growth.
  /toolchain/binutils/binutils-2.25/gas/
write.c 2204 offsetT growth; local
2489 offsetT growth = 0; local
    [all...]
  /external/libcxxabi/test/
test_fallback_malloc.pass.cpp 30 container alloc_series ( size_t sz, float growth ) {
36 sz *= growth;
  /ndk/sources/cxx-stl/llvm-libc++abi/libcxxabi/test/
test_fallback_malloc.pass.cpp 30 container alloc_series ( size_t sz, float growth ) {
36 sz *= growth;
  /prebuilts/go/darwin-x86/src/runtime/
stack_test.go 141 // analysis and place x on stack (and subsequently stack growth update the pointer).
160 // test stack growth at chan op
171 // test stack growth at map op
182 // test stack growth at goroutine creation
236 // stack growth does not invalidate a later attempt.
slice.go 47 // growslice handles slice growth during append.
stack1.go 137 // The pool is required to prevent unlimited growth of per-thread caches.
595 throw("stack growth not allowed in system call")
661 // Stack growth is multiplicative, for constant amortized cost.
669 throw("stack growth after fork")
728 gp.waitreason = "stack growth"
mgc.go 298 // trigger based on the heap growth and GC CPU utilization each cycle.
299 // This algorithm optimizes for heap growth to match GOGC and for CPU
381 // triggerRatio is the heap growth ratio at which the garbage
411 // the appropriate growth from heap_marked, even though the
502 // growth and GC CPU utilization. We compute the actual heap
503 // growth during this cycle and scale that by how far off from
505 // growth if we had the desired CPU utilization). The
507 // heap growth is the error.
510 // heap_marked, which means the actual growth ratio
    [all...]
  /prebuilts/go/linux-x86/src/runtime/
stack_test.go 141 // analysis and place x on stack (and subsequently stack growth update the pointer).
160 // test stack growth at chan op
171 // test stack growth at map op
182 // test stack growth at goroutine creation
236 // stack growth does not invalidate a later attempt.
slice.go 47 // growslice handles slice growth during append.
stack1.go 137 // The pool is required to prevent unlimited growth of per-thread caches.
595 throw("stack growth not allowed in system call")
661 // Stack growth is multiplicative, for constant amortized cost.
669 throw("stack growth after fork")
728 gp.waitreason = "stack growth"
mgc.go 298 // trigger based on the heap growth and GC CPU utilization each cycle.
299 // This algorithm optimizes for heap growth to match GOGC and for CPU
381 // triggerRatio is the heap growth ratio at which the garbage
411 // the appropriate growth from heap_marked, even though the
502 // growth and GC CPU utilization. We compute the actual heap
503 // growth during this cycle and scale that by how far off from
505 // growth if we had the desired CPU utilization). The
507 // heap growth is the error.
510 // heap_marked, which means the actual growth ratio
    [all...]
  /toolchain/binutils/binutils-2.25/gas/config/
tc-epiphany.c 691 long growth = 0;
713 growth = relax_frag (segment, fragP, stretch);
715 return growth;
724 The guess for fr_var is ACTUALLY the growth beyond fr_fix.
684 long growth = 0; local
tc-mep.c 1457 int growth; member in struct:__anon75608
    [all...]
tc-m32r.c 1647 long growth = 0; local
    [all...]
tc-tic54x.c 5246 int growth = 0; local
    [all...]
  /external/v8/test/mjsunit/regress/
regress-2073.js 28 // Running this test with --trace_gc will show heap size growth due to
regress-231.js 29 // A stack growth during a look-ahead could restore a pointer to the old stack.
  /external/v8/src/
utils.h 681 int growth = current_length * (growth_factor - 1); local
682 if (growth > max_growth) {
683 growth = max_growth;
685 new_capacity = current_length + growth;
687 new_capacity = min_capacity + growth;
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/
cursesf.h 206 // For a dynamic field you may set the maximum growth limit.
207 // A zero means unlimited growth.
208 inline void set_maximum_growth(int growth = 0) {
209 OnError(::set_max_field(field,growth));
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/
cursesf.h 206 // For a dynamic field you may set the maximum growth limit.
207 // A zero means unlimited growth.
208 inline void set_maximum_growth(int growth = 0) {
209 OnError(::set_max_field(field,growth));
  /external/pcre/dist/
pcrecpp_unittest.cc 120 const double growth = double(final_size - initial_size) / final_size;
121 printf("Growth: %0.2f%%", growth * 100);
122 CHECK(growth < 0.02); // Allow < 2% growth
    [all...]
  /prebuilts/go/darwin-x86/src/runtime/debug/
garbage.go 120 // stack growth.

Completed in 1399 milliseconds

1 2 3