HomeSort by: relevance | last modified time | path
    Searched defs:avail (Results 1 - 25 of 187) sorted by relevancy

1 2 3 4 5 6 7 8

  /src/external/bsd/libarchive/dist/libarchive/test/
test_archive_read.c 37 ssize_t avail; local
47 assert(NULL != __archive_read_ahead(ar, sizeof(buf) - 1, &avail));
48 assertEqualInt(sizeof(buf), avail); local
51 assert(NULL == __archive_read_ahead(ar, sizeof(buf) + 1, &avail));
52 assertEqualInt(sizeof(buf), avail); local
55 assert(NULL == __archive_read_ahead(ar, sizeof(buf) + 1, &avail));
56 assertEqualInt(sizeof(buf), avail); local
59 assert(NULL != __archive_read_ahead(ar, sizeof(buf), &avail));
60 assertEqualInt(sizeof(buf), avail); local
  /src/external/bsd/libarchive/dist/libarchive/
archive_read_support_filter_grzip.c 83 ssize_t avail; local
87 p = __archive_read_filter_ahead(filter, sizeof(grzip_magic), &avail);
88 if (p == NULL || avail == 0)
archive_read_support_filter_lrzip.c 82 ssize_t avail, len; local
89 p = __archive_read_filter_ahead(filter, len, &avail);
90 if (p == NULL || avail == 0)
archive_read_support_format_raw.c 132 ssize_t avail; local
146 *buff = __archive_read_ahead(a, 1, &avail);
147 if (avail > 0) {
149 *size = avail;
152 info->unconsumed = avail;
154 } else if (0 == avail) {
164 return ((int)avail);
archive_read_support_filter_bzip2.c 116 ssize_t avail; local
122 buffer = __archive_read_filter_ahead(filter, 14, &avail);
  /src/external/bsd/jemalloc/dist/include/jemalloc/internal/
edata_cache.h 17 edata_avail_t avail; member in struct:edata_cache_s
  /src/external/bsd/jemalloc/include/jemalloc/internal/
edata_cache.h 17 edata_avail_t avail; member in struct:edata_cache_s
base_structs.h 49 extent_heap_t avail[NSIZES]; member in struct:base_s
  /src/external/ibm-public/postfix/dist/src/master/
master_proto.h 31 int avail; /* availability */ member in struct:MASTER_STATUS
  /src/external/lgpl3/gmp/dist/printf/
snprntffuns.c 66 size_t step, alloc, avail; local
72 avail = d->size;
73 if (avail > 1)
76 ret = vsnprintf (d->buf, avail, fmt, ap);
80 step = MIN (ret, avail-1);
84 if (ret != avail-1)
  /src/sbin/fsck_lfs/
pass5.c 63 daddr_t avail; /* blocks available for writing */ local
77 avail = 0;
120 avail += lfs_segtod(fs, 1);
141 avail = nclean * lfs_segtod(fs, 1);
142 avail -= nsb * lfs_btofsb(fs, LFS_SBPAD);
143 avail -= labelcorrect;
144 avail += curr;
145 avail -= mfs;
148 avail -= lfs_btofsb(fs, locked_queue_bytes);
151 pwarn("avail := clean %jd*%jd - sb %jd*%jd - lbl %jd
    [all...]
  /src/usr.sbin/sysinst/
partitions.c 179 size_t i, avail; local
197 for (avail = i = 0; i < all_cnt; i++) {
201 avail++;
204 if (avail == 0)
207 num_available_part_schemes = avail;
209 * (avail+1));
  /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/
base_structs.h 49 extent_heap_t avail[NSIZES]; member in struct:base_s
cache_bin.h 58 * To make use of adjacent cacheline prefetch, the items in the avail
59 * stack goes to higher address for newer allocations. avail points
61 * avail[-ncached, ... -1] are available items and the lowest item will
64 void **avail; member in struct:cache_bin_s
99 * null stored on the avail stack (which is unknown to the compiler),
104 ret = *(bin->avail - bin->ncached);
  /src/external/bsd/jemalloc.old/include/jemalloc/internal/
base_structs.h 49 extent_heap_t avail[NSIZES]; member in struct:base_s
cache_bin.h 58 * To make use of adjacent cacheline prefetch, the items in the avail
59 * stack goes to higher address for newer allocations. avail points
61 * avail[-ncached, ... -1] are available items and the lowest item will
64 void **avail; member in struct:cache_bin_s
99 * null stored on the avail stack (which is unknown to the compiler),
104 ret = *(bin->avail - bin->ncached);
  /src/sys/arch/xen/xenbus/
xenbus_comms.c 128 unsigned int avail; local
145 dst = get_output_chunk(cons, prod, intf->req, &avail);
146 if (avail == 0)
148 if (avail > len)
149 avail = len;
151 memcpy(dst, data, avail);
152 data = (const char *)data + avail;
153 len -= avail;
157 intf->req_prod += avail;
175 unsigned int avail; local
    [all...]
  /src/usr.bin/systat/
swap.c 162 int col, blk_div, i, avail, used, xsize, swp_free; local
167 swp_free = avail = 0;
180 avail += xsize;
188 used = avail - swp_free;
190 "Total", hlen, avail / blk_div, used / blk_div);
192 whline(wnd, 'X', (100 * used / avail + 1) / 2);
  /src/crypto/external/apache2/openssl/dist/include/internal/
ring_buf.h 80 size_t avail, idx, l; local
84 avail = ring_buf_avail(r);
87 > safe_add_u64(r->head_offset, avail, &err)
117 size_t pushed = 0, avail, idx, l; local
121 avail = ring_buf_avail(r);
122 if (buf_len > avail)
123 buf_len = avail;
  /src/external/ibm-public/postfix/dist/src/global/
recipient_list.h 54 int avail; member in struct:RECIPIENT_LIST
  /src/sys/arch/usermode/dev/
if_veth.c 204 int s, avail; local
207 avail = thunk_pollin_tap(sc->sc_tapfd, 0);
208 if (avail == 0)
212 uimin(avail, sizeof(sc->sc_rx_buf)));
  /src/sys/dev/ata/
ata_subr.c 292 printf(" que: flags 0x%x avail 0x%x used 0x%x\n",
304 uint32_t avail, mask; local
316 avail = ffs32(chq->queue_xfers_avail & mask);
317 if (avail == 0)
320 KASSERT(avail > 0);
321 KASSERT(avail <= drv_openings);
323 *c_slot = avail - 1;
  /src/sys/dev/dtv/
dtv_buffer.c 55 size_t resid = buflen, avail; local
73 avail = uimin(db->db_length - db->db_bytesused, resid);
75 db->db_offset + db->db_bytesused, avail, &sio)) {
77 db->db_bytesused += (avail - sio.sio_resid);
78 offset += (avail - sio.sio_resid);
79 resid -= (avail - sio.sio_resid);
dtv_demux.c 584 int brem, avail; local
676 avail = uimin(sec->sec_length - sec->sec_bytesused, brem);
677 if (avail < 0)
679 memcpy(&sec->sec_buf[sec->sec_bytesused], p, avail);
680 sec->sec_bytesused += avail;
  /src/sys/dev/wscons/
wsevent.c 404 size_t avail, i; local
409 avail = ev->get - ev->put;
411 avail = WSEVENT_QSIZE - (ev->put - ev->get);
412 KASSERT(avail <= WSEVENT_QSIZE);
415 if (avail < nevents)

Completed in 48 milliseconds

1 2 3 4 5 6 7 8