Lines Matching refs:num
1415 mbuf_slab_alloc(void *arg, mcache_obj_t ***plist, unsigned int num, int wait)
1418 unsigned int need = num;
1482 m_alloc_cnt(class) += num - need;
1485 return (num - need);
1498 unsigned int num = 0;
1509 ++num;
1513 m_free_cnt(class) += num;
1599 cslab_alloc(mbuf_class_t class, mcache_obj_t ***plist, unsigned int num)
1601 unsigned int need = num;
1649 m_infree(class) -= (num - need);
1651 return (num - need);
1661 unsigned int num = 0;
1762 ++num;
1770 m_infree(class) += num;
1775 return (num);
1792 unsigned int num = 0, cnum = 0, want = needed;
1814 num = cslab_alloc(class, plist, needed);
1816 if (num == needed) {
1817 m_alloc_cnt(class) += num;
1829 needed -= num;
1952 if (num > 0 || cnum > 0) {
1955 m_alloc_cnt(class) += num + cnum;
1957 if ((num + cnum) < want)
1958 m_fail_cnt(class) += (want - (num + cnum));
1961 return (num + cnum);
1973 unsigned int num;
1980 num = cslab_free(class, list, purged);
1981 m_free_cnt(class) += num;
2076 m_clalloc(const u_int32_t num, const int wait, const u_int32_t bufsize)
2113 i = m_howmany(num, bufsize);
2336 if (m_infree(MC_CL) >= num)
2352 if (m_infree(MC_BIGCL) >= num)
2368 if (m_infree(MC_16KCL) >= num)
2378 freelist_populate(mbuf_class_t class, unsigned int num, int wait)
2406 i = m_clalloc(num, wait, m_maxsize(MC_CL));
2420 return (m_clalloc(num, wait, m_maxsize(class)) != 0);
2537 mbuf_steal(mbuf_class_t class, unsigned int num)
2558 MIN(num, m_infree(class)));
2571 return (tot == num);
2575 m_reclaim(mbuf_class_t class, unsigned int num, boolean_t comp)
2632 if (!mbuf_steal(m, num))
3167 unsigned int num = 0;
3258 while (num < needed) {
3272 num++;
3280 num++;
3285 ASSERT(num != *numlist || mp_list == NULL);
3287 if (num > 0) {
3288 mtype_stat_add(MT_DATA, num);
3289 mtype_stat_sub(MT_FREE, num);
3291 num /= nsegs;
3294 if (num == *numlist)
3398 ++num;
3399 if (nsegs == 1 || (num % nsegs) != 0 || resid == 0) {
3420 pkthdr = (nsegs == 1 || (num % nsegs) == 1);
3433 --num;
3440 if ((num % nsegs) == 0)
3445 if (num == needed)
3449 if (num > 0) {
3450 mtype_stat_add(MT_DATA, num);
3451 mtype_stat_sub(MT_FREE, num);
3454 num /= nsegs;
3457 if (num == *numlist) {
3472 *numlist = num;
4354 m_howmany(int num, size_t bufsize)
4375 if (bufsize == MCLBYTES && num > m_clfree) {
4377 "%d short\n", num - mbstat.m_clfree);
4391 if (num >= m_clfree)
4392 i = num - m_clfree;
4393 if (((m_clusters + num) >> 4) > m_clfree)
4394 j = ((m_clusters + num) >> 4) - m_clfree;
4408 if (num >= m_bigclfree)
4409 i = num - m_bigclfree;
4410 if (((m_bigclusters + num) >> 4) > m_bigclfree)
4411 j = ((m_bigclusters + num) >> 4) - m_bigclfree;
4426 if (num >= m_16kclfree)
4427 i = num - m_16kclfree;
4428 if (((m_16kclusters + num) >> 4) > m_16kclfree)
4429 j = ((m_16kclusters + num) >> 4) - m_16kclfree;
4775 mbuf_sleep(mbuf_class_t class, unsigned int num, int wait)
4788 m_reclaim(class, num, (wait & MCR_COMP));
5090 mcache_obj_t **con_list, size_t con_size, unsigned int num)
5097 ASSERT(num <= NMBPCL);
5109 for (i = 0; i < num; i++) {