Lines Matching defs:bd_num

1779 				    unsigned int bd_num)
1786 bd_size[bd_num++] = HNS3_MAX_BD_SIZE;
1789 if (bd_num > HNS3_MAX_TSO_BD_NUM)
1790 return bd_num;
1794 bd_size[bd_num++] = size;
1795 if (bd_num > HNS3_MAX_TSO_BD_NUM)
1796 return bd_num;
1806 bd_size[bd_num++] = HNS3_MAX_BD_SIZE;
1809 if (bd_num > HNS3_MAX_TSO_BD_NUM)
1810 return bd_num;
1813 bd_size[bd_num++] = size;
1814 if (bd_num > HNS3_MAX_TSO_BD_NUM)
1815 return bd_num;
1818 return bd_num;
1822 u8 max_non_tso_bd_num, unsigned int bd_num,
1838 bd_num = hns3_skb_bd_num(skb, bd_size, bd_num);
1839 if (!skb_has_frag_list(skb) || bd_num > HNS3_MAX_TSO_BD_NUM)
1840 return bd_num;
1843 bd_num = hns3_tx_bd_num(frag_skb, bd_size, max_non_tso_bd_num,
1844 bd_num, recursion_level + 1);
1845 if (bd_num > HNS3_MAX_TSO_BD_NUM)
1846 return bd_num;
1849 return bd_num;
1867 unsigned int bd_num, u8 max_non_tso_bd_num)
1885 for (i = 0; i < bd_num - max_non_tso_bd_num; i++) {
1906 unsigned int bd_num)
1908 /* 'bd_num == UINT_MAX' means the skb' fraglist has a
1911 if (bd_num == UINT_MAX) {
1940 unsigned int bd_num;
1942 bd_num = hns3_tx_bd_num(skb, bd_size, max_non_tso_bd_num, 0, 0);
1943 if (unlikely(bd_num > max_non_tso_bd_num)) {
1944 if (bd_num <= HNS3_MAX_TSO_BD_NUM && skb_is_gso(skb) &&
1945 !hns3_skb_need_linearized(skb, bd_size, bd_num,
1951 if (hns3_skb_linearize(ring, skb, bd_num))
1954 bd_num = hns3_tx_bd_count(skb->len);
1960 if (likely(ring_space(ring) >= bd_num))
1961 return bd_num;
1970 if (ring_space(ring) >= bd_num && netif_carrier_ok(netdev) &&
1973 return bd_num;
2025 int i, ret, bd_num = 0;
2031 bd_num += ret;
2040 bd_num += ret;
2049 bd_num += ret;
2052 return bd_num;
2088 __le64 bd_num = cpu_to_le64((u64)ring->pending_buf);
2096 &bd_num, 1);
2162 int bd_num = 0;
2189 bd_num += hns3_fill_desc(ring, dma, size);
2197 bd_num += ret;
2205 return bd_num;
2214 int bd_num = 0;
2253 bd_num += hns3_fill_desc(ring, sg_dma_address(sgt->sgl + i),
2257 return bd_num;