available
xmlNodePtr available = xmlNewChild(root, NULL,
add_disk_to_xml, &available);
xmlNodePtr available = *((xmlNodePtr *)data);
available, NULL, (xmlChar *)ELEMENT_DISK, NULL);
boolean_t available;
if (mech_aliases[mech].available == B_FALSE)
mech_aliases[mek].available = B_TRUE;
boolean_t available;
if (mech_aliases[mech].available == B_FALSE)
mech_aliases[mek].available = B_TRUE;
DEFINE_STR_LEN(available);
SET_STR_LEN("available", available);
pgcnt_t allocated, reserved, available;
available = ai.ani_max - ai.ani_resv;
nicenum_scale(available, factor, numbuf, sizeof (numbuf), 0);
ctok(available));
int written, available;
available = TEXT_LENGTH; /* space available in buffer */
written = snprintf(string, available,
available -= written;
unsigned long available;
available = nds->pdu_size - nds->pdu_scan_offset;
while (available < NDR_RSP_HDR_SIZE) {
available += nbytes;
while (available < hdr->frag_length) {
available += nbytes;
uint64_t available, required, uval;
available = 0;
available += uval;
if (available < required) {
if (available > required) {
sess->state = available;
int available)
if (bytes.length <= available) {
available = available - bytes.length;
if (System.in.available() > 0) {
size_t available, copylen;
available = elemp->mnte_text_size - ieoffset;
copylen = MIN(len - written, available);
if (copylen == available) {
uint64_t available = dsl_dir_space_available(
available += (class_avail * 94) / 100;
if (available < vd->vdev_stat.vs_dspace + spa_get_slop_space(spa)) {
pci_regspec_t *available, *reg;
"available", (caddr_t)&available, &alen);
bcopy(available, newreg, alen);
kmem_free((caddr_t)available, alen);
if (!ub_priv->available ||
ub_priv->available = 1;
ubp, ub_priv->token, time, ub_priv->available,
ub_priv->available = 0;
uint8_t available;
hxgep->mmac.available;
hxgep->mmac.available--;
hxgep->mmac.available++;
hxgep->mmac.available = hxgep->mmac.total;
int available, len, left;
available = pktlen - hdrlen;
segnum = (available - 1) / mss + 1;
available,
left = available;
available, left, len, segnum, (int)MBLKL(nmp)));
available, left, len, segnum, (int)MBLKL(nmp)));
available, left, len, segnum, (int)MBLKL(nmp)));
available, left, len,
available, left, len,
available, left, len, (int)MBLKL(nmp)));
available, left, len, (int)MBLKL(nmp)));
available, left, len, (int)MBLKL(nmp)));
available, left, len, (int)MBLKL(nmp)));
boolean_t available;
available = emcop->emco_poll_response(enp);
return (available);
unsigned int available;
available = EFX_TXQ_LIMIT(SFXGE_TX_NDESCS) - level;
if (available < stp->st_n) {
ASSERT3U(available, >=, stp->st_n);
available = EFX_TXQ_LIMIT(SFXGE_TX_NDESCS) - level;
if (stp->st_n <= available &&
np_insert(struct available *fp, struct available *np)
np_add(struct available *fp)
struct available *np;
np_coalesce(struct available *np)
struct available *xp;
struct available *np;
struct available *np;
struct available *np, *fp;
struct available *np, *fp;
struct available *next;
struct available *prev;
static struct available seed = {
static struct available *nhead;
static struct available *
return (kmem_zalloc(sizeof (struct available), kmflag));
np_free(struct available *np)
kmem_free(np, sizeof (struct available));
np_unlink(struct available *np)
uint16_t available;
uint32_t available;
sp->available = count;
if (sp->available >= count) {
sp->available -= count;
} while (sp->available < count);
sp->available -= count;
sp->available += count;