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

  /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-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++)
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++)
  /src/external/gpl3/gcc/dist/libgfortran/caf/
libcaf.h 150 size_t item_size; member in struct:caf_reference_t
  /src/external/gpl3/gcc.old/dist/libgfortran/caf/
libcaf.h 150 size_t item_size; member in struct:caf_reference_t
  /src/external/bsd/jemalloc.old/dist/src/
jemalloc.c 1684 size_t item_size; member in struct:dynamic_opts_s
1695 dynamic_opts->item_size = 0;
1784 * This function is just num_items * item_size, except that we may have
1790 *size = dopts->item_size;
1797 *size = dopts->item_size * dopts->num_items;
1800 return (dopts->num_items != 0 && dopts->item_size != 0);
1809 if (likely((high_bits & (dopts->num_items | dopts->item_size)) == 0)) {
1812 if (likely(*size / dopts->item_size == dopts->num_items)) {
2023 UTRACE(NULL, dopts->num_items * dopts->item_size, NULL);
2068 dopts.item_size = size
    [all...]
  /src/external/bsd/jemalloc/dist/src/
jemalloc.c 2298 size_t item_size; member in struct:dynamic_opts_s
2310 dynamic_opts->item_size = 0;
2471 * This function is just num_items * item_size, except that we may have
2477 *size = dopts->item_size;
2484 *size = dopts->item_size * dopts->num_items;
2487 return (dopts->num_items != 0 && dopts->item_size != 0);
2496 if (likely((high_bits & (dopts->num_items | dopts->item_size)) == 0)) {
2499 if (likely(*size / dopts->item_size == dopts->num_items)) {
2690 UTRACE(NULL, dopts->num_items * dopts->item_size, NULL);
2747 dopts.item_size = size
    [all...]

Completed in 70 milliseconds