/freebsd-current/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Capacity.h | 9 // This file defines the capacity function that computes the amount of 23 // This default definition of capacity should work for things like std::vector 25 return x.capacity() * sizeof(typename T::value_type);
|
/freebsd-current/contrib/llvm-project/libcxx/include/__filesystem/ |
H A D | space_info.h | 26 uintmax_t capacity; member in struct:space_info
|
/freebsd-current/bin/sh/ |
H A D | expand.h | 36 int capacity; member in struct:arglist
|
/freebsd-current/contrib/unbound/sldns/ |
H A D | sbuffer.c | 19 sldns_buffer_new(size_t capacity) argument 27 buffer->_data = (uint8_t *) malloc(capacity); 34 buffer->_limit = buffer->_capacity = capacity; 74 sldns_buffer_set_capacity(sldns_buffer *buffer, size_t capacity) argument 79 assert(buffer->_position <= capacity && !buffer->_fixed); 81 data = (uint8_t *) realloc(buffer->_data, capacity); 87 buffer->_limit = buffer->_capacity = capacity;
|
/freebsd-current/contrib/ldns/ |
H A D | buffer.c | 16 ldns_buffer_new(size_t capacity) argument 24 buffer->_data = (uint8_t *) LDNS_XMALLOC(uint8_t, capacity); 31 buffer->_limit = buffer->_capacity = capacity; 60 ldns_buffer_set_capacity(ldns_buffer *buffer, size_t capacity) argument 65 assert(buffer->_position <= capacity); 68 data = (uint8_t *) LDNS_XREALLOC(buffer->_data, uint8_t, capacity); 74 buffer->_limit = buffer->_capacity = capacity;
|
/freebsd-current/contrib/elftoolchain/libelftc/ |
H A D | libelftc_vstr.c | 153 assert(v->capacity > 0); 155 tmp_cap = BUFFER_GROW(v->capacity); 157 assert(tmp_cap > v->capacity); 168 v->capacity = tmp_cap; 185 v->capacity = VECTOR_DEF_CAPACITY; 187 assert(v->capacity > 0); 189 if ((v->container = malloc(sizeof(char *) * v->capacity)) == NULL) 230 if (v->size == v->capacity && vector_str_grow(v) == false) 277 dst->capacity = tmp_cap; 318 dst->capacity [all...] |
H A D | _libelftc.h | 52 /** Total capacity */ 53 size_t capacity; member in struct:vector_str
|
/freebsd-current/sys/dev/bhnd/nvram/ |
H A D | bhnd_nvram_ioptr.c | 58 size_t capacity; /**< capacity at @p ptr */ member in struct:bhnd_nvram_ioptr 74 * @param capacity The maximum number of bytes that may be mapped 80 * @retval NULL the requested @p capacity is less than @p size. 83 bhnd_nvram_ioptr_new(const void *ptr, size_t size, size_t capacity, 88 /* Sanity check the capacity */ 89 if (size > capacity) 100 ioptr->capacity = capacity; 128 /* Can't exceed the actual capacity */ [all...] |
H A D | bhnd_nvram_iobuf.c | 59 size_t capacity; /**< capacity of @p buf */ member in struct:bhnd_nvram_iobuf 67 * buffer of @p size and @p capacity. 72 * If @p capacity is less than @p size, a capacity of @p size will be used. 75 * @param capacity The total capacity of the I/O context buffer; 77 * @p capacity via bhnd_nvram_io_setsize(). 81 * @retval NULL the requested @p capacity is less than 85 bhnd_nvram_iobuf_empty(size_t size, size_t capacity) [all...] |
H A D | bhnd_nvram_io.h | 49 struct bhnd_nvram_io *bhnd_nvram_iobuf_empty(size_t size, size_t capacity); 55 size_t capacity, uint32_t flags);
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
H A D | HashTable.h | 183 H.Capacity = capacity(); 209 uint32_t capacity() const { return Buckets.size(); } function in class:llvm::pdb::HashTable 219 uint32_t H = Traits.hashLookupKey(K) % capacity(); 237 I = (I + 1) % capacity(); 298 static uint32_t maxLoad(uint32_t capacity) { return capacity * 2 / 3 + 1; } argument 303 uint32_t MaxLoad = maxLoad(capacity()); 304 if (S < maxLoad(capacity())) 306 assert(capacity() != UINT32_MAX && "Can't grow Hash table!"); 308 uint32_t NewCapacity = (capacity() < [all...] |
/freebsd-current/usr.sbin/nscd/ |
H A D | hashtable.h | 52 size_t capacity; \ 80 (table)->entries[var].field.capacity = \ 127 ((entry)->field.capacity) 131 (entry)->field.capacity *= 2; \ 133 (entry)->field.capacity * sizeof(type)); \ 138 (entry)->field.capacity /= 2; \ 140 (entry)->field.capacity * sizeof(type)); \ 167 if (the_entry->field.size == the_entry->field.capacity) \
|
/freebsd-current/contrib/llvm-project/compiler-rt/lib/scudo/standalone/ |
H A D | vector.h | 19 // capacity, or in an external memory buffer if it grows bigger than that. May 35 DCHECK_LE(Size, capacity()); 36 if (Size == capacity()) { 53 constexpr uptr capacity() const { return CapacityBytes / sizeof(T); } function in class:scudo::VectorNoCtor 56 if (NewSize > capacity()) 79 if (InitialCapacity > capacity())
|
/freebsd-current/sbin/camcontrol/ |
H A D | depop.c | 39 * their health, whether they are in service, how much capacity the element is 103 uint64_t cap = scsi_8btou64(dtor_ptr[i].capacity); 117 int timeout, int verbosemode __unused, uint32_t elem, uint64_t capacity) 131 capacity, 208 uint64_t capacity = 0; local 213 capacity = strtoumax(optarg, &endptr, 0); 215 warnx("Invalid capacity: %s", optarg); 273 if (elem == 0 && capacity == 0) { 279 verbosemode, elem, capacity); 116 depop_remove(struct cam_device *device, int task_attr, int retry_count, int timeout, int verbosemode __unused, uint32_t elem, uint64_t capacity) argument
|
/freebsd-current/contrib/llvm-project/lldb/source/Utility/ |
H A D | VASprintf.cpp | 28 buf.resize(buf.capacity()); 29 // Write up to `capacity` bytes, ignoring the current size.
|
/freebsd-current/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/ |
H A D | TypeTableCollection.h | 31 uint32_t capacity() override;
|
H A D | TypeCollection.h | 31 virtual uint32_t capacity() = 0;
|
/freebsd-current/sys/contrib/ck/src/ |
H A D | ck_ht.c | 88 CK_HT_TYPE capacity; member in struct:ck_ht_map 170 map->capacity = n_entries; 171 map->step = ck_cc_ffsll(map->capacity); 172 map->mask = map->capacity - 1; 393 memset(map->probe_bound, 0, sizeof(CK_HT_WORD) * map->capacity); 402 size = sizeof(CK_HT_WORD) * map->capacity; 413 for (i = 0; i < map->capacity; i++) { 484 for (i = 0; i < map->capacity; i++) 616 if (i->offset >= map->capacity) 623 } while (++i->offset < map->capacity); 656 ck_ht_grow_spmc(struct ck_ht *table, CK_HT_TYPE capacity) argument [all...] |
H A D | ck_hs.c | 91 unsigned long capacity; member in struct:ck_hs_map 114 if (i->offset >= map->capacity) 130 } while (++i->offset < map->capacity); 230 map->capacity = n_entries; 255 ck_hs_reset_size(struct ck_hs *hs, unsigned long capacity) argument 260 map = ck_hs_map_create(hs, capacity); 275 return ck_hs_reset_size(hs, previous->capacity); 334 unsigned long capacity) 342 if (map->capacity > capacity) 333 ck_hs_grow(struct ck_hs *hs, unsigned long capacity) argument [all...] |
H A D | ck_rhs.c | 119 unsigned long capacity; member in struct:ck_rhs_map 260 map->max_entries = (map->capacity * (unsigned long)hs->load_factor) / 100; 262 if (ck_rhs_grow(hs, map->capacity << 1) == false) 284 if (i->offset >= map->capacity) 298 } while (++i->offset < map->capacity); 368 map->capacity = n_entries; 373 map->max_entries = (map->capacity * (unsigned long)hs->load_factor) / 100; 401 ck_rhs_reset_size(struct ck_rhs *hs, unsigned long capacity) argument 406 map = ck_rhs_map_create(hs, capacity); 421 return ck_rhs_reset_size(hs, previous->capacity); 494 ck_rhs_grow(struct ck_rhs *hs, unsigned long capacity) argument [all...] |
/freebsd-current/sys/dev/qlnx/qlnxe/ |
H A D | ecore_chain.h | 125 u32 capacity; member in struct:ecore_chain 240 return (u16)(p_chain->capacity - used); 259 return p_chain->capacity - used; 267 p_chain->capacity); 270 p_chain->capacity); 478 return p_chain->capacity; 583 for (i = 0; i < p_chain->capacity; i++) 630 p_chain->capacity = p_chain->usable_per_page * page_cnt; 769 (prod_idx - 1 + p_chain->capacity) % p_chain->capacity; [all...] |
/freebsd-current/contrib/ofed/opensm/complib/ |
H A D | cl_vector.c | 346 if (new_capacity <= p_vector->capacity) { 361 p_vector->capacity * sizeof(void *)); 371 * We have to add capacity to the array. Determine how many 374 new_elements = new_capacity - p_vector->capacity; 388 for (i = p_vector->capacity; i < new_capacity; i++) { 395 p_vector->capacity = new_capacity; 416 if (size >= p_vector->capacity) { 420 /* Calculate the new capacity, taking into account the grow size. */
|
H A D | cl_ptr_vector.c | 176 if (new_capacity <= p_vector->capacity) { 191 p_vector->capacity * sizeof(void *)); 201 p_vector->capacity = new_capacity; 220 if (size >= p_vector->capacity) { 224 /* Calculate the new capacity, taking into account the grow size. */
|
/freebsd-current/contrib/ofed/opensm/include/complib/ |
H A D | cl_ptr_vector.h | 183 size_t capacity; member in struct:_cl_ptr_vector 195 * capacity 307 * The cl_ptr_vector_get_capacity function returns the capacity of 318 return (p_vector->capacity); 324 * [in] Pointer to a cl_ptr_vector_t structure whose capacity to return. 330 * The capacity is the number of elements that the pointer vector can store, 599 * [in] Pointer to a cl_ptr_vector_t structure whose capacity to set. 606 * CL_SUCCESS if the capacity was successfully set. 612 * cl_ptr_vector_set_capacity increases the capacity of the pointer vector. 614 * capacity i [all...] |
/freebsd-current/contrib/llvm-project/lldb/source/API/ |
H A D | SBMemoryRegionInfoList.cpp | 35 void Reserve(size_t capacity) { return m_regions.reserve(capacity); } argument
|