HomeSort by relevance Sort by last modified time
    Searched full:num_entries (Results 1 - 25 of 361) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/llvm/test/CodeGen/ARM/Windows/
alloca.ll 3 declare arm_aapcs_vfpcc i32 @num_entries()
8 %call = call arm_aapcs_vfpcc i32 @num_entries()
15 ; CHECK: bl num_entries
  /external/autotest/client/common_lib/cros/graphite/
stats_es_functionaltest.py 41 num_entries=10,
46 @param num_entries: number of metadata entries to insert
58 self._run_one_test_metadata(test_type, num_entries, keys)
61 def _run_one_test_metadata(self, test_type, num_entries, keys):
65 % (num_entries, keys))
74 num_entries=num_entries,
75 print_interval=num_entries/5)
92 %(num_entries, num_entries_found))
93 if num_entries_found != num_entries
    [all...]
  /external/v8/src/compiler/
node-cache.cc 38 size_t num_entries = size_ + kLinearProbe; local
39 entries_ = zone->NewArray<Entry>(num_entries);
40 memset(entries_, 0, sizeof(Entry) * num_entries);
68 size_t num_entries = kInitialSize + kLinearProbe; local
69 entries_ = zone->NewArray<Entry>(num_entries);
71 memset(entries_, 0, sizeof(Entry) * num_entries);
  /development/tools/yuv420sp2rgb/
debug.h 53 static inline void *CALLOC(unsigned int num_entries, unsigned int entry_size) {
54 void *m = calloc(num_entries, entry_size);
55 FAILIF(NULL == m, "calloc(%d, %d) failed!\n", num_entries, entry_size);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/resize_policy/
hash_load_check_resize_trigger_imp.hpp 108 notify_inserted(size_type num_entries)
110 m_resize_needed = (num_entries >= m_next_grow_size);
111 size_base::set_size(num_entries);
118 notify_erased(size_type num_entries)
120 size_base::set_size(num_entries);
121 m_resize_needed = num_entries <= m_next_shrink_size;
137 is_grow_needed(size_type /*size*/, size_type num_entries) const
140 return num_entries >= m_next_grow_size;
sample_resize_trigger.hpp 101 /// the table is num_entries.
103 notify_inserted(size_type num_entries);
107 notify_erased(size_type num_entries);
128 is_grow_needed(size_type size, size_type num_entries) const;
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/resize_policy/
hash_load_check_resize_trigger_imp.hpp 108 notify_inserted(size_type num_entries)
110 m_resize_needed = (num_entries >= m_next_grow_size);
111 size_base::set_size(num_entries);
118 notify_erased(size_type num_entries)
120 size_base::set_size(num_entries);
121 m_resize_needed = num_entries <= m_next_shrink_size;
137 is_grow_needed(size_type /*size*/, size_type num_entries) const
140 return num_entries >= m_next_grow_size;
sample_resize_trigger.hpp 101 /// the table is num_entries.
103 notify_inserted(size_type num_entries);
107 notify_erased(size_type num_entries);
128 is_grow_needed(size_type size, size_type num_entries) const;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/resize_policy/
hash_load_check_resize_trigger_imp.hpp 108 notify_inserted(size_type num_entries)
110 m_resize_needed = (num_entries >= m_next_grow_size);
111 size_base::set_size(num_entries);
118 notify_erased(size_type num_entries)
120 size_base::set_size(num_entries);
121 m_resize_needed = num_entries <= m_next_shrink_size;
137 is_grow_needed(size_type /*size*/, size_type num_entries) const
140 return num_entries >= m_next_grow_size;
sample_resize_trigger.hpp 101 /// the table is num_entries.
103 notify_inserted(size_type num_entries);
107 notify_erased(size_type num_entries);
128 is_grow_needed(size_type size, size_type num_entries) const;
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/resize_policy/
hash_load_check_resize_trigger_imp.hpp 108 notify_inserted(size_type num_entries)
110 m_resize_needed = (num_entries >= m_next_grow_size);
111 size_base::set_size(num_entries);
118 notify_erased(size_type num_entries)
120 size_base::set_size(num_entries);
121 m_resize_needed = num_entries <= m_next_shrink_size;
137 is_grow_needed(size_type /*size*/, size_type num_entries) const
140 return num_entries >= m_next_grow_size;
sample_resize_trigger.hpp 101 /// the table is num_entries.
103 notify_inserted(size_type num_entries);
107 notify_erased(size_type num_entries);
128 is_grow_needed(size_type size, size_type num_entries) const;
  /system/core/libziparchive/
zip_archive_private.h 37 uint16_t num_entries; member in struct:ZipArchive
50 num_entries(0),
  /external/google-breakpad/src/common/
simple_string_dictionary.h 63 static const size_t num_entries = NumEntries; member in class:google_breakpad::NonAllocatingMap
88 while (current_ < map_.num_entries) {
114 assert(other.num_entries == num_entries);
116 other.num_entries == num_entries) {
135 for (size_t i = 0; i < num_entries; ++i) {
180 for (size_t i = 0; i < num_entries; ++i) {
199 for (size_t i = 0; i < num_entries; ++i) {
239 for (size_t i = 0; i < num_entries; ++i)
    [all...]
  /external/libavc/common/
ih264_list.c 83 WORD32 ih264_list_size(WORD32 num_entries, WORD32 entry_size)
91 clz = CLZ(num_entries);
92 num_entries = 1 << (32 - clz);
94 size += num_entries * entry_size;
252 WORD32 num_entries,
274 /* Ensure num_entries is power of two */
275 ASSERT(0 == (num_entries & (num_entries - 1)));
278 ASSERT((num_entries * entry_size) <= buf_size);
285 ps_list->i4_log2_buf_max_idx = 32 - CLZ(num_entries);
    [all...]
ih264_list.h 80 WORD32 ih264_list_size(WORD32 num_entries, WORD32 entry_size);
83 WORD32 num_entries,
  /system/media/camera/tests/
camera_metadata_tests.cpp 1082 size_t num_entries = 5; local
    [all...]
  /external/mesa3d/src/gallium/state_trackers/clover/api/
platform.cpp 28 clGetPlatformIDs(cl_uint num_entries, cl_platform_id *platforms,
30 if ((!num_entries && platforms) ||
  /toolchain/binutils/binutils-2.25/gold/testsuite/
plugin_section_order.c 119 int num_entries = 0; variable
168 num_entries++;
180 if (num_entries == 3)
182 update_section_order(section_list, num_entries);
184 section_list, num_entries);
  /external/mesa3d/src/gallium/drivers/softpipe/
sp_tile_cache.h 78 #define NUM_ENTRIES 50
88 union tile_address tile_addrs[NUM_ENTRIES];
89 struct softpipe_cached_tile *entries[NUM_ENTRIES];
  /art/compiler/optimizing/
nodes_x86.h 82 int32_t num_entries,
88 num_entries_(num_entries) {
  /development/ndk/platforms/android-3/include/linux/netfilter_arp/
arp_tables.h 115 unsigned int num_entries; member in struct:arpt_getinfo
127 unsigned int num_entries; member in struct:arpt_replace
  /frameworks/native/libs/binder/
PersistableBundle.cpp 272 size_t num_entries = size(); local
273 if (num_entries > std::numeric_limits<int32_t>::max()) {
275 num_entries);
278 RETURN_IF_FAILED(parcel->writeInt32(static_cast<int32_t>(num_entries)));
362 int32_t num_entries; local
363 RETURN_IF_FAILED(parcel->readInt32(&num_entries));
365 for (; num_entries > 0; --num_entries) {
  /prebuilts/ndk/current/platforms/android-12/arch-arm/usr/include/linux/netfilter_arp/
arp_tables.h 115 unsigned int num_entries; member in struct:arpt_getinfo
127 unsigned int num_entries; member in struct:arpt_replace
  /prebuilts/ndk/current/platforms/android-12/arch-mips/usr/include/linux/netfilter_arp/
arp_tables.h 115 unsigned int num_entries; member in struct:arpt_getinfo
127 unsigned int num_entries; member in struct:arpt_replace

Completed in 1517 milliseconds

1 2 3 4 5 6 7 8 91011>>