HomeSort by: relevance | last modified time | path
    Searched refs:item_size (Results 1 - 15 of 15) sorted by relevancy

  /src/external/mit/libcbor/dist/src/cbor/internal/
memory_utils.c 29 void* _cbor_alloc_multiple(size_t item_size, size_t item_count) {
30 if (_cbor_safe_to_multiply(item_size, item_count)) {
31 return _CBOR_MALLOC(item_size * item_count);
37 void* _cbor_realloc_multiple(void* pointer, size_t item_size,
39 if (_cbor_safe_to_multiply(item_size, item_count)) {
40 return _CBOR_REALLOC(pointer, item_size * item_count);
memory_utils.h 19 * @param item_size
21 * @return Region of item_size * item_count bytes, or NULL if the total size
24 void* _cbor_alloc_multiple(size_t item_size, size_t item_count);
31 * @param item_size
33 * @return Realloc'd of item_size * item_count bytes, or NULL if the total size
36 void* _cbor_realloc_multiple(void* pointer, size_t item_size,
  /src/external/cddl/osnet/dist/uts/common/fs/zfs/
bqueue.c 69 bqueue_enqueue(bqueue_t *q, void *data, uint64_t item_size)
71 ASSERT3U(item_size, >, 0);
72 ASSERT3U(item_size, <, q->bq_maxsize);
74 obj2node(q, data)->bqn_size = item_size;
75 while (q->bq_size + item_size > q->bq_maxsize) {
78 q->bq_size += item_size;
91 uint64_t item_size; local
97 item_size = obj2node(q, ret)->bqn_size;
98 q->bq_size -= item_size;
  /src/external/bsd/tmux/dist/
window-client.c 101 u_int item_size; member in struct:window_client_modedata
109 data->item_list = xreallocarray(data->item_list, data->item_size + 1,
111 item = data->item_list[data->item_size++] = xcalloc(1, sizeof *item);
172 for (i = 0; i < data->item_size; i++)
176 data->item_size = 0;
189 qsort(data->item_list, data->item_size, sizeof *data->item_list,
192 for (i = 0; i < data->item_size; i++) {
330 for (i = 0; i < data->item_size; i++)
window-buffer.c 107 u_int item_size; member in struct:window_buffer_modedata
121 data->item_list = xreallocarray(data->item_list, data->item_size + 1,
123 item = data->item_list[data->item_size++] = xcalloc(1, sizeof *item);
169 for (i = 0; i < data->item_size; i++)
173 data->item_size = 0;
183 qsort(data->item_list, data->item_size, sizeof *data->item_list,
192 for (i = 0; i < data->item_size; i++) {
403 for (i = 0; i < data->item_size; i++)
window-tree.c 131 u_int item_size; member in struct:window_tree_modedata
187 data->item_list = xreallocarray(data->item_list, data->item_size + 1,
189 item = data->item_list[data->item_size++] = xcalloc(1, sizeof *item);
406 data->item_size--;
460 data->item_size--;
477 for (i = 0; i < data->item_size; i++)
481 data->item_size = 0;
1036 for (i = 0; i < data->item_size; i++)
window-customize.c 107 u_int item_size; member in struct:window_customize_modedata
216 data->item_list = xreallocarray(data->item_list, data->item_size + 1,
218 item = data->item_list[data->item_size++] = xcalloc(1, sizeof *item);
537 for (i = 0; i < data->item_size; i++)
541 data->item_size = 0;
912 for (i = 0; i < data->item_size; i++)
  /src/external/mit/libcbor/dist/docs/doxygen/search/
all_0.js 3 ['_5fcbor_5falloc_5fmultiple',['_cbor_alloc_multiple',['../memory__utils_8c.html#a7bfbe0ac179b30f38bfeb9fe432ad4ec',1,'_cbor_alloc_multiple(size_t item_size, size_t item_count):&#160;memory_utils.c'],['../memory__utils_8h.html#a7bfbe0ac179b30f38bfeb9fe432ad4ec',1,'_cbor_alloc_multiple(size_t item_size, size_t item_count):&#160;memory_utils.c']]],
39 ['_5fcbor_5frealloc_5fmultiple',['_cbor_realloc_multiple',['../memory__utils_8c.html#afd7a22ccd3b44d6ff668e14c3a006e40',1,'_cbor_realloc_multiple(void *pointer, size_t item_size, size_t item_count):&#160;memory_utils.c'],['../memory__utils_8h.html#afd7a22ccd3b44d6ff668e14c3a006e40',1,'_cbor_realloc_multiple(void *pointer, size_t item_size, size_t item_count):&#160;memory_utils.c']]],
functions_0.js 3 ['_5fcbor_5falloc_5fmultiple',['_cbor_alloc_multiple',['../memory__utils_8c.html#a7bfbe0ac179b30f38bfeb9fe432ad4ec',1,'_cbor_alloc_multiple(size_t item_size, size_t item_count):&#160;memory_utils.c'],['../memory__utils_8h.html#a7bfbe0ac179b30f38bfeb9fe432ad4ec',1,'_cbor_alloc_multiple(size_t item_size, size_t item_count):&#160;memory_utils.c']]],
22 ['_5fcbor_5frealloc_5fmultiple',['_cbor_realloc_multiple',['../memory__utils_8c.html#afd7a22ccd3b44d6ff668e14c3a006e40',1,'_cbor_realloc_multiple(void *pointer, size_t item_size, size_t item_count):&#160;memory_utils.c'],['../memory__utils_8h.html#afd7a22ccd3b44d6ff668e14c3a006e40',1,'_cbor_realloc_multiple(void *pointer, size_t item_size, size_t item_count):&#160;memory_utils.c']]],
  /src/external/gpl3/gcc/dist/libgfortran/caf/
single.c 1226 dst_kind, src_kind, dst_size, ref->item_size, 1, stat);
1230 dst_kind, src_kind, dst_size, ref->item_size, 1, stat);
1242 dst_kind, src_kind, dst_size, ref->item_size, num,
1330 ds, sr + array_offset_src * ref->item_size,
1350 ds, sr + array_offset_src * ref->item_size,
1377 ds, sr + array_offset_src * ref->item_size,
1391 sr + array_offset_src * ref->item_size,
1409 ds, sr + array_offset_src * ref->item_size,
1429 ds, sr + array_offset_src * ref->item_size,
1479 ds, sr + array_offset_src * ref->item_size,
    [all...]
libcaf.h 150 size_t item_size; member in struct:caf_reference_t
  /src/external/gpl3/gcc.old/dist/libgfortran/caf/
single.c 1229 dst_kind, src_kind, dst_size, ref->item_size, 1, stat);
1233 dst_kind, src_kind, dst_size, ref->item_size, 1, stat);
1245 dst_kind, src_kind, dst_size, ref->item_size, num,
1333 ds, sr + array_offset_src * ref->item_size,
1353 ds, sr + array_offset_src * ref->item_size,
1380 ds, sr + array_offset_src * ref->item_size,
1394 sr + array_offset_src * ref->item_size,
1412 ds, sr + array_offset_src * ref->item_size,
1432 ds, sr + array_offset_src * ref->item_size,
1482 ds, sr + array_offset_src * ref->item_size,
    [all...]
libcaf.h 150 size_t item_size; member in struct:caf_reference_t
  /src/external/bsd/jemalloc/dist/src/
jemalloc.c 397 size_t item_size; member in struct:dynamic_opts_s
409 dynamic_opts->item_size = 0;
539 * This function is just num_items * item_size, except that we may have
545 *size = dopts->item_size;
552 *size = dopts->item_size * dopts->num_items;
555 return (dopts->num_items != 0 && dopts->item_size != 0);
564 if (likely((high_bits & (dopts->num_items | dopts->item_size)) == 0)) {
567 if (likely(*size / dopts->item_size == dopts->num_items)) {
758 UTRACE(NULL, dopts->num_items * dopts->item_size, NULL);
815 dopts.item_size = size
    [all...]
  /src/external/bsd/jemalloc.old/dist/src/
jemalloc.c 1391 size_t item_size; member in struct:dynamic_opts_s
1403 dynamic_opts->item_size = 0;
1533 * This function is just num_items * item_size, except that we may have
1539 *size = dopts->item_size;
1546 *size = dopts->item_size * dopts->num_items;
1549 return (dopts->num_items != 0 && dopts->item_size != 0);
1558 if (likely((high_bits & (dopts->num_items | dopts->item_size)) == 0)) {
1561 if (likely(*size / dopts->item_size == dopts->num_items)) {
1752 UTRACE(NULL, dopts->num_items * dopts->item_size, NULL);
1809 dopts.item_size = size
    [all...]

Completed in 99 milliseconds