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

1 2 3 4 5 6 7 8 91011>>

  /external/ltp/testcases/kernel/tracing/ftrace_test/ftrace_stress/
ftrace_buffer_size_kb.sh 30 new_size=1
33 echo $new_size > "$TRACING_PATH"/buffer_size_kb
34 new_size=$(( $new_size + $step ))
40 new_size=$(( $new_size - $step ))
41 echo $new_size > "$TRACING_PATH"/buffer_size_kb
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/ov_tree_map_/
insert_fn_imps.hpp 51 reallocate_metadata(Node_Update_* , size_type new_size)
53 metadata_pointer a_new_metadata_vec =(new_size == 0) ? 0 : s_metadata_alloc.allocate(new_size);
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/ov_tree_map_/
insert_fn_imps.hpp 51 reallocate_metadata(Node_Update_* , size_type new_size)
53 metadata_pointer a_new_metadata_vec =(new_size == 0) ? 0 : s_metadata_alloc.allocate(new_size);
  /bionic/libc/bionic/
mremap.cpp 39 void* mremap(void* old_address, size_t old_size, size_t new_size, int flags, ...) {
41 size_t rounded = __BIONIC_ALIGN(new_size, PAGE_SIZE);
42 if (rounded < new_size || rounded > PTRDIFF_MAX) {
56 return ___mremap(old_address, old_size, new_size, flags, new_address);
  /external/compiler-rt/lib/tsan/rtl/
tsan_stack_trace.cc 26 void VarSizeStackTrace::ResizeBuffer(uptr new_size) {
31 (new_size > 0)
33 new_size * sizeof(trace_buffer[0]))
36 size = new_size;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/cc_hash_table_map_/
resize_fn_imps.hpp 79 resize_imp(size_type new_size)
82 if (new_size == m_num_e)
89 ranged_hash_fn_base::notify_resized(new_size);
94 a_p_entries_resized = s_entry_pointer_allocator.allocate(new_size);
95 m_num_e = new_size;
104 resize_imp_no_exceptions(new_size, a_p_entries_resized, old_size);
105 Resize_Policy::notify_resized(new_size);
112 resize_imp_no_exceptions(size_type new_size, entry_pointer_array a_p_entries_resized, size_type old_size)
124 m_num_e = new_size;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/cc_hash_table_map_/
resize_fn_imps.hpp 79 resize_imp(size_type new_size)
82 if (new_size == m_num_e)
89 ranged_hash_fn_base::notify_resized(new_size);
94 a_p_entries_resized = s_entry_pointer_allocator.allocate(new_size);
95 m_num_e = new_size;
104 resize_imp_no_exceptions(new_size, a_p_entries_resized, old_size);
105 Resize_Policy::notify_resized(new_size);
112 resize_imp_no_exceptions(size_type new_size, entry_pointer_array a_p_entries_resized, size_type old_size)
124 m_num_e = new_size;
  /external/protobuf/src/google/protobuf/
repeated_field.cc 47 int new_size = current_size_ + extend_amount; local
48 if (total_size_ >= new_size) {
50 // total_size must be non-zero since it is lower-bounded by new_size.
55 new_size = std::max(kMinRepeatedFieldAllocationSize,
56 std::max(total_size_ * 2, new_size));
57 GOOGLE_CHECK_LE(new_size,
63 new char[kRepHeaderSize + sizeof(old_rep->elements[0]) * new_size]);
67 kRepHeaderSize + sizeof(old_rep->elements[0]) * new_size));
69 total_size_ = new_size;
83 void RepeatedPtrFieldBase::Reserve(int new_size) {
    [all...]
  /external/eigen/Eigen/src/StlSupport/
StdVector.h 80 void resize(size_type new_size)
81 { resize(new_size, T()); }
85 void resize(size_type new_size, const value_type& x)
87 if (vector_base::size() < new_size)
88 vector_base::_Insert_n(vector_base::end(), new_size - vector_base::size(), x);
89 else if (new_size < vector_base::size())
90 vector_base::erase(vector_base::begin() + new_size, vector_base::end());
97 void insert(const_iterator position, size_type new_size, const value_type& x)
98 { vector_base::insert(position, new_size, x); }
102 void resize(size_type new_size, const value_type& x
    [all...]
StdDeque.h 80 void resize(size_type new_size)
81 { resize(new_size, T()); }
85 void resize(size_type new_size, const value_type& x)
87 if (deque_base::size() < new_size)
88 deque_base::_Insert_n(deque_base::end(), new_size - deque_base::size(), x);
89 else if (new_size < deque_base::size())
90 deque_base::erase(deque_base::begin() + new_size, deque_base::end());
99 void insert(const_iterator position, size_type new_size, const value_type& x)
100 { deque_base::insert(position, new_size, x); }
103 void resize(size_type new_size, const value_type& x
    [all...]
  /toolchain/binutils/binutils-2.27/gold/
mremap.c 52 gold_mremap (void *old_address, size_t old_size, size_t new_size,
57 ret = mmap (0, new_size, PROT_READ | PROT_WRITE,
62 old_size < new_size ? old_size : new_size);
80 size_t new_size ATTRIBUTE_UNUSED,
  /external/pdfium/core/fxcrt/
cfx_binarybuf.cpp 47 FX_SAFE_SIZE_T new_size = m_DataSize; local
48 new_size += add_size;
49 if (m_AllocSize >= new_size.ValueOrDie())
54 new_size += alloc_step - 1; // Quantize, don't combine these lines.
55 new_size /= alloc_step;
56 new_size *= alloc_step;
57 m_AllocSize = new_size.ValueOrDie();
  /external/syslinux/gpxe/src/interface/efi/
efi_umalloc.c 38 * @v new_size Requested size
44 static userptr_t efi_urealloc ( userptr_t old_ptr, size_t new_size ) {
55 if ( new_size ) {
56 new_pages = ( EFI_SIZE_TO_PAGES ( new_size ) + 1 );
68 &new_size, sizeof ( new_size ) );
75 * is valid, or (b) new_size is 0; either way, the memcpy() is
82 ( (old_size < new_size) ? old_size : new_size ));
  /external/python/cpython2/Lib/ctypes/test/
test_varsize_struct.py 17 new_size = sizeof(X) + sizeof(c_int) * 1
18 resize(x, new_size)
19 self.assertEqual(sizeof(x), new_size)
23 new_size = sizeof(X) + sizeof(c_int) * 9
24 resize(x, new_size)
25 self.assertEqual(sizeof(x), new_size)
29 new_size = sizeof(X) + sizeof(c_int) * 1
30 resize(x, new_size)
31 self.assertEqual(sizeof(x), new_size)
  /external/python/cpython3/Lib/ctypes/test/
test_varsize_struct.py 17 new_size = sizeof(X) + sizeof(c_int) * 1
18 resize(x, new_size)
19 self.assertEqual(sizeof(x), new_size)
23 new_size = sizeof(X) + sizeof(c_int) * 9
24 resize(x, new_size)
25 self.assertEqual(sizeof(x), new_size)
29 new_size = sizeof(X) + sizeof(c_int) * 1
30 resize(x, new_size)
31 self.assertEqual(sizeof(x), new_size)
  /prebuilts/gdb/darwin-x86/lib/python2.7/ctypes/test/
test_varsize_struct.py 17 new_size = sizeof(X) + sizeof(c_int) * 1
18 resize(x, new_size)
19 self.assertEqual(sizeof(x), new_size)
23 new_size = sizeof(X) + sizeof(c_int) * 9
24 resize(x, new_size)
25 self.assertEqual(sizeof(x), new_size)
29 new_size = sizeof(X) + sizeof(c_int) * 1
30 resize(x, new_size)
31 self.assertEqual(sizeof(x), new_size)
  /prebuilts/gdb/linux-x86/lib/python2.7/ctypes/test/
test_varsize_struct.py 17 new_size = sizeof(X) + sizeof(c_int) * 1
18 resize(x, new_size)
19 self.assertEqual(sizeof(x), new_size)
23 new_size = sizeof(X) + sizeof(c_int) * 9
24 resize(x, new_size)
25 self.assertEqual(sizeof(x), new_size)
29 new_size = sizeof(X) + sizeof(c_int) * 1
30 resize(x, new_size)
31 self.assertEqual(sizeof(x), new_size)
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ctypes/test/
test_varsize_struct.py 17 new_size = sizeof(X) + sizeof(c_int) * 1
18 resize(x, new_size)
19 self.assertEqual(sizeof(x), new_size)
23 new_size = sizeof(X) + sizeof(c_int) * 9
24 resize(x, new_size)
25 self.assertEqual(sizeof(x), new_size)
29 new_size = sizeof(X) + sizeof(c_int) * 1
30 resize(x, new_size)
31 self.assertEqual(sizeof(x), new_size)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ctypes/test/
test_varsize_struct.py 17 new_size = sizeof(X) + sizeof(c_int) * 1
18 resize(x, new_size)
19 self.assertEqual(sizeof(x), new_size)
23 new_size = sizeof(X) + sizeof(c_int) * 9
24 resize(x, new_size)
25 self.assertEqual(sizeof(x), new_size)
29 new_size = sizeof(X) + sizeof(c_int) * 1
30 resize(x, new_size)
31 self.assertEqual(sizeof(x), new_size)
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
resize_fn_imps.hpp 79 resize_imp(size_type new_size)
85 if (new_size == m_num_e)
93 a_entries_resized = s_entry_allocator.allocate(new_size);
95 ranged_probe_fn_base::notify_resized(new_size);
96 m_num_e = new_size;
107 erase_all_valid_entries(a_entries_resized, new_size);
109 s_entry_allocator.deallocate(a_entries_resized, new_size);
119 Resize_Policy::notify_resized(new_size);
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/
resize_fn_imps.hpp 79 resize_imp(size_type new_size)
85 if (new_size == m_num_e)
93 a_entries_resized = s_entry_allocator.allocate(new_size);
95 ranged_probe_fn_base::notify_resized(new_size);
96 m_num_e = new_size;
107 erase_all_valid_entries(a_entries_resized, new_size);
109 s_entry_allocator.deallocate(a_entries_resized, new_size);
119 Resize_Policy::notify_resized(new_size);
  /external/syslinux/gpxe/src/arch/i386/interface/pcbios/
memtop_umalloc.c 131 * @v new_size Requested size
137 static userptr_t memtop_urealloc ( userptr_t ptr, size_t new_size ) {
161 extmem.used = ( new_size > 0 );
166 new = userptr_add ( ptr, - ( new_size - extmem.size ) );
168 new_size += align;
174 user_to_phys ( new, new_size ));
175 memmove_user ( new, 0, ptr, 0, ( ( extmem.size < new_size ) ?
176 extmem.size : new_size ) );
177 extmem.size = new_size;
181 if ( new_size > extmem.size )
    [all...]
  /hardware/qcom/msm8998/json-c/
arraylist.c 62 int new_size; local
65 new_size = arr->size << 1;
66 if (new_size < max)
67 new_size = max;
68 if(!(t = realloc(arr->array, new_size*sizeof(void*)))) return -1;
70 (void)memset(arr->array + arr->size, 0, (new_size-arr->size)*sizeof(void*));
71 arr->size = new_size;
  /external/tensorflow/tensorflow/contrib/boosted_trees/lib/quantiles/
weighted_quantiles_summary_test.cc 95 for (int new_size = 9; new_size >= 2; --new_size) {
98 summary.Compress(new_size);
102 EXPECT_TRUE(summary.Size() >= new_size && summary.Size() <= new_size + 2);
103 EXPECT_LE(summary.ApproximationError(), 1.0 / new_size);
115 for (int new_size = 9; new_size >= 2; new_size -= 2)
149 int new_size = std::max(rand.Uniform(size), 2u); local
    [all...]
  /external/sfntly/cpp/src/sample/subtly/
debug_main.cc 59 int32_t new_size = TotalFontSize(new_font); local
61 original_size, new_size,
62 static_cast<double>(new_size) / original_size * 100);

Completed in 684 milliseconds

1 2 3 4 5 6 7 8 91011>>