nicvf_queues.h 9.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322
  1. /*
  2. * Copyright (C) 2015 Cavium, Inc.
  3. *
  4. * This program is free software; you can redistribute it and/or modify it
  5. * under the terms of version 2 of the GNU General Public License
  6. * as published by the Free Software Foundation.
  7. */
  8. #ifndef NICVF_QUEUES_H
  9. #define NICVF_QUEUES_H
  10. #include <linux/netdevice.h>
  11. #include "q_struct.h"
  12. #define MAX_QUEUE_SET 128
  13. #define MAX_RCV_QUEUES_PER_QS 8
  14. #define MAX_RCV_BUF_DESC_RINGS_PER_QS 2
  15. #define MAX_SND_QUEUES_PER_QS 8
  16. #define MAX_CMP_QUEUES_PER_QS 8
  17. /* VF's queue interrupt ranges */
  18. #define NICVF_INTR_ID_CQ 0
  19. #define NICVF_INTR_ID_SQ 8
  20. #define NICVF_INTR_ID_RBDR 16
  21. #define NICVF_INTR_ID_MISC 18
  22. #define NICVF_INTR_ID_QS_ERR 19
  23. #define for_each_cq_irq(irq) \
  24. for (irq = NICVF_INTR_ID_CQ; irq < NICVF_INTR_ID_SQ; irq++)
  25. #define for_each_sq_irq(irq) \
  26. for (irq = NICVF_INTR_ID_SQ; irq < NICVF_INTR_ID_RBDR; irq++)
  27. #define for_each_rbdr_irq(irq) \
  28. for (irq = NICVF_INTR_ID_RBDR; irq < NICVF_INTR_ID_MISC; irq++)
  29. #define RBDR_SIZE0 0ULL /* 8K entries */
  30. #define RBDR_SIZE1 1ULL /* 16K entries */
  31. #define RBDR_SIZE2 2ULL /* 32K entries */
  32. #define RBDR_SIZE3 3ULL /* 64K entries */
  33. #define RBDR_SIZE4 4ULL /* 126K entries */
  34. #define RBDR_SIZE5 5ULL /* 256K entries */
  35. #define RBDR_SIZE6 6ULL /* 512K entries */
  36. #define SND_QUEUE_SIZE0 0ULL /* 1K entries */
  37. #define SND_QUEUE_SIZE1 1ULL /* 2K entries */
  38. #define SND_QUEUE_SIZE2 2ULL /* 4K entries */
  39. #define SND_QUEUE_SIZE3 3ULL /* 8K entries */
  40. #define SND_QUEUE_SIZE4 4ULL /* 16K entries */
  41. #define SND_QUEUE_SIZE5 5ULL /* 32K entries */
  42. #define SND_QUEUE_SIZE6 6ULL /* 64K entries */
  43. #define CMP_QUEUE_SIZE0 0ULL /* 1K entries */
  44. #define CMP_QUEUE_SIZE1 1ULL /* 2K entries */
  45. #define CMP_QUEUE_SIZE2 2ULL /* 4K entries */
  46. #define CMP_QUEUE_SIZE3 3ULL /* 8K entries */
  47. #define CMP_QUEUE_SIZE4 4ULL /* 16K entries */
  48. #define CMP_QUEUE_SIZE5 5ULL /* 32K entries */
  49. #define CMP_QUEUE_SIZE6 6ULL /* 64K entries */
  50. /* Default queue count per QS, its lengths and threshold values */
  51. #define DEFAULT_RBDR_CNT 1
  52. #define SND_QSIZE SND_QUEUE_SIZE2
  53. #define SND_QUEUE_LEN (1ULL << (SND_QSIZE + 10))
  54. #define MAX_SND_QUEUE_LEN (1ULL << (SND_QUEUE_SIZE6 + 10))
  55. #define SND_QUEUE_THRESH 2ULL
  56. #define MIN_SQ_DESC_PER_PKT_XMIT 2
  57. /* Since timestamp not enabled, otherwise 2 */
  58. #define MAX_CQE_PER_PKT_XMIT 1
  59. /* Keep CQ and SQ sizes same, if timestamping
  60. * is enabled this equation will change.
  61. */
  62. #define CMP_QSIZE CMP_QUEUE_SIZE2
  63. #define CMP_QUEUE_LEN (1ULL << (CMP_QSIZE + 10))
  64. #define CMP_QUEUE_CQE_THRESH (NAPI_POLL_WEIGHT / 2)
  65. #define CMP_QUEUE_TIMER_THRESH 80 /* ~2usec */
  66. #define RBDR_SIZE RBDR_SIZE0
  67. #define RCV_BUF_COUNT (1ULL << (RBDR_SIZE + 13))
  68. #define MAX_RCV_BUF_COUNT (1ULL << (RBDR_SIZE6 + 13))
  69. #define RBDR_THRESH (RCV_BUF_COUNT / 2)
  70. #define DMA_BUFFER_LEN 2048 /* In multiples of 128bytes */
  71. #define RCV_FRAG_LEN (SKB_DATA_ALIGN(DMA_BUFFER_LEN + NET_SKB_PAD) + \
  72. SKB_DATA_ALIGN(sizeof(struct skb_shared_info)))
  73. #define MAX_CQES_FOR_TX ((SND_QUEUE_LEN / MIN_SQ_DESC_PER_PKT_XMIT) * \
  74. MAX_CQE_PER_PKT_XMIT)
  75. /* Calculate number of CQEs to reserve for all SQEs.
  76. * Its 1/256th level of CQ size.
  77. * '+ 1' to account for pipelining
  78. */
  79. #define RQ_CQ_DROP ((256 / (CMP_QUEUE_LEN / \
  80. (CMP_QUEUE_LEN - MAX_CQES_FOR_TX))) + 1)
  81. /* Descriptor size in bytes */
  82. #define SND_QUEUE_DESC_SIZE 16
  83. #define CMP_QUEUE_DESC_SIZE 512
  84. /* Buffer / descriptor alignments */
  85. #define NICVF_RCV_BUF_ALIGN 7
  86. #define NICVF_RCV_BUF_ALIGN_BYTES (1ULL << NICVF_RCV_BUF_ALIGN)
  87. #define NICVF_CQ_BASE_ALIGN_BYTES 512 /* 9 bits */
  88. #define NICVF_SQ_BASE_ALIGN_BYTES 128 /* 7 bits */
  89. #define NICVF_ALIGNED_ADDR(ADDR, ALIGN_BYTES) ALIGN(ADDR, ALIGN_BYTES)
  90. /* Queue enable/disable */
  91. #define NICVF_SQ_EN BIT_ULL(19)
  92. /* Queue reset */
  93. #define NICVF_CQ_RESET BIT_ULL(41)
  94. #define NICVF_SQ_RESET BIT_ULL(17)
  95. #define NICVF_RBDR_RESET BIT_ULL(43)
  96. enum CQ_RX_ERRLVL_E {
  97. CQ_ERRLVL_MAC,
  98. CQ_ERRLVL_L2,
  99. CQ_ERRLVL_L3,
  100. CQ_ERRLVL_L4,
  101. };
  102. enum CQ_RX_ERROP_E {
  103. CQ_RX_ERROP_RE_NONE = 0x0,
  104. CQ_RX_ERROP_RE_PARTIAL = 0x1,
  105. CQ_RX_ERROP_RE_JABBER = 0x2,
  106. CQ_RX_ERROP_RE_FCS = 0x7,
  107. CQ_RX_ERROP_RE_TERMINATE = 0x9,
  108. CQ_RX_ERROP_RE_RX_CTL = 0xb,
  109. CQ_RX_ERROP_PREL2_ERR = 0x1f,
  110. CQ_RX_ERROP_L2_FRAGMENT = 0x20,
  111. CQ_RX_ERROP_L2_OVERRUN = 0x21,
  112. CQ_RX_ERROP_L2_PFCS = 0x22,
  113. CQ_RX_ERROP_L2_PUNY = 0x23,
  114. CQ_RX_ERROP_L2_MAL = 0x24,
  115. CQ_RX_ERROP_L2_OVERSIZE = 0x25,
  116. CQ_RX_ERROP_L2_UNDERSIZE = 0x26,
  117. CQ_RX_ERROP_L2_LENMISM = 0x27,
  118. CQ_RX_ERROP_L2_PCLP = 0x28,
  119. CQ_RX_ERROP_IP_NOT = 0x41,
  120. CQ_RX_ERROP_IP_CSUM_ERR = 0x42,
  121. CQ_RX_ERROP_IP_MAL = 0x43,
  122. CQ_RX_ERROP_IP_MALD = 0x44,
  123. CQ_RX_ERROP_IP_HOP = 0x45,
  124. CQ_RX_ERROP_L3_ICRC = 0x46,
  125. CQ_RX_ERROP_L3_PCLP = 0x47,
  126. CQ_RX_ERROP_L4_MAL = 0x61,
  127. CQ_RX_ERROP_L4_CHK = 0x62,
  128. CQ_RX_ERROP_UDP_LEN = 0x63,
  129. CQ_RX_ERROP_L4_PORT = 0x64,
  130. CQ_RX_ERROP_TCP_FLAG = 0x65,
  131. CQ_RX_ERROP_TCP_OFFSET = 0x66,
  132. CQ_RX_ERROP_L4_PCLP = 0x67,
  133. CQ_RX_ERROP_RBDR_TRUNC = 0x70,
  134. };
  135. enum CQ_TX_ERROP_E {
  136. CQ_TX_ERROP_GOOD = 0x0,
  137. CQ_TX_ERROP_DESC_FAULT = 0x10,
  138. CQ_TX_ERROP_HDR_CONS_ERR = 0x11,
  139. CQ_TX_ERROP_SUBDC_ERR = 0x12,
  140. CQ_TX_ERROP_MAX_SIZE_VIOL = 0x13,
  141. CQ_TX_ERROP_IMM_SIZE_OFLOW = 0x80,
  142. CQ_TX_ERROP_DATA_SEQUENCE_ERR = 0x81,
  143. CQ_TX_ERROP_MEM_SEQUENCE_ERR = 0x82,
  144. CQ_TX_ERROP_LOCK_VIOL = 0x83,
  145. CQ_TX_ERROP_DATA_FAULT = 0x84,
  146. CQ_TX_ERROP_TSTMP_CONFLICT = 0x85,
  147. CQ_TX_ERROP_TSTMP_TIMEOUT = 0x86,
  148. CQ_TX_ERROP_MEM_FAULT = 0x87,
  149. CQ_TX_ERROP_CK_OVERLAP = 0x88,
  150. CQ_TX_ERROP_CK_OFLOW = 0x89,
  151. CQ_TX_ERROP_ENUM_LAST = 0x8a,
  152. };
  153. enum RQ_SQ_STATS {
  154. RQ_SQ_STATS_OCTS,
  155. RQ_SQ_STATS_PKTS,
  156. };
  157. struct rx_tx_queue_stats {
  158. u64 bytes;
  159. u64 pkts;
  160. } ____cacheline_aligned_in_smp;
  161. struct q_desc_mem {
  162. dma_addr_t dma;
  163. u64 size;
  164. u16 q_len;
  165. dma_addr_t phys_base;
  166. void *base;
  167. void *unalign_base;
  168. };
  169. struct rbdr {
  170. bool enable;
  171. u32 dma_size;
  172. u32 frag_len;
  173. u32 thresh; /* Threshold level for interrupt */
  174. void *desc;
  175. u32 head;
  176. u32 tail;
  177. struct q_desc_mem dmem;
  178. } ____cacheline_aligned_in_smp;
  179. struct rcv_queue {
  180. bool enable;
  181. struct rbdr *rbdr_start;
  182. struct rbdr *rbdr_cont;
  183. bool en_tcp_reassembly;
  184. u8 cq_qs; /* CQ's QS to which this RQ is assigned */
  185. u8 cq_idx; /* CQ index (0 to 7) in the QS */
  186. u8 cont_rbdr_qs; /* Continue buffer ptrs - QS num */
  187. u8 cont_qs_rbdr_idx; /* RBDR idx in the cont QS */
  188. u8 start_rbdr_qs; /* First buffer ptrs - QS num */
  189. u8 start_qs_rbdr_idx; /* RBDR idx in the above QS */
  190. u8 caching;
  191. struct rx_tx_queue_stats stats;
  192. } ____cacheline_aligned_in_smp;
  193. struct cmp_queue {
  194. bool enable;
  195. u16 thresh;
  196. spinlock_t lock; /* lock to serialize processing CQEs */
  197. void *desc;
  198. struct q_desc_mem dmem;
  199. int irq;
  200. } ____cacheline_aligned_in_smp;
  201. struct snd_queue {
  202. bool enable;
  203. u8 cq_qs; /* CQ's QS to which this SQ is pointing */
  204. u8 cq_idx; /* CQ index (0 to 7) in the above QS */
  205. u16 thresh;
  206. atomic_t free_cnt;
  207. u32 head;
  208. u32 tail;
  209. u64 *skbuff;
  210. void *desc;
  211. #define TSO_HEADER_SIZE 128
  212. /* For TSO segment's header */
  213. char *tso_hdrs;
  214. dma_addr_t tso_hdrs_phys;
  215. cpumask_t affinity_mask;
  216. struct q_desc_mem dmem;
  217. struct rx_tx_queue_stats stats;
  218. } ____cacheline_aligned_in_smp;
  219. struct queue_set {
  220. bool enable;
  221. bool be_en;
  222. u8 vnic_id;
  223. u8 rq_cnt;
  224. u8 cq_cnt;
  225. u64 cq_len;
  226. u8 sq_cnt;
  227. u64 sq_len;
  228. u8 rbdr_cnt;
  229. u64 rbdr_len;
  230. struct rcv_queue rq[MAX_RCV_QUEUES_PER_QS];
  231. struct cmp_queue cq[MAX_CMP_QUEUES_PER_QS];
  232. struct snd_queue sq[MAX_SND_QUEUES_PER_QS];
  233. struct rbdr rbdr[MAX_RCV_BUF_DESC_RINGS_PER_QS];
  234. } ____cacheline_aligned_in_smp;
  235. #define GET_RBDR_DESC(RING, idx)\
  236. (&(((struct rbdr_entry_t *)((RING)->desc))[idx]))
  237. #define GET_SQ_DESC(RING, idx)\
  238. (&(((struct sq_hdr_subdesc *)((RING)->desc))[idx]))
  239. #define GET_CQ_DESC(RING, idx)\
  240. (&(((union cq_desc_t *)((RING)->desc))[idx]))
  241. /* CQ status bits */
  242. #define CQ_WR_FULL BIT(26)
  243. #define CQ_WR_DISABLE BIT(25)
  244. #define CQ_WR_FAULT BIT(24)
  245. #define CQ_CQE_COUNT (0xFFFF << 0)
  246. #define CQ_ERR_MASK (CQ_WR_FULL | CQ_WR_DISABLE | CQ_WR_FAULT)
  247. void nicvf_config_vlan_stripping(struct nicvf *nic,
  248. netdev_features_t features);
  249. int nicvf_set_qset_resources(struct nicvf *nic);
  250. int nicvf_config_data_transfer(struct nicvf *nic, bool enable);
  251. void nicvf_qset_config(struct nicvf *nic, bool enable);
  252. void nicvf_cmp_queue_config(struct nicvf *nic, struct queue_set *qs,
  253. int qidx, bool enable);
  254. void nicvf_sq_enable(struct nicvf *nic, struct snd_queue *sq, int qidx);
  255. void nicvf_sq_disable(struct nicvf *nic, int qidx);
  256. void nicvf_put_sq_desc(struct snd_queue *sq, int desc_cnt);
  257. void nicvf_sq_free_used_descs(struct net_device *netdev,
  258. struct snd_queue *sq, int qidx);
  259. int nicvf_sq_append_skb(struct nicvf *nic, struct sk_buff *skb);
  260. struct sk_buff *nicvf_get_rcv_skb(struct nicvf *nic, struct cqe_rx_t *cqe_rx);
  261. void nicvf_rbdr_task(unsigned long data);
  262. void nicvf_rbdr_work(struct work_struct *work);
  263. void nicvf_enable_intr(struct nicvf *nic, int int_type, int q_idx);
  264. void nicvf_disable_intr(struct nicvf *nic, int int_type, int q_idx);
  265. void nicvf_clear_intr(struct nicvf *nic, int int_type, int q_idx);
  266. int nicvf_is_intr_enabled(struct nicvf *nic, int int_type, int q_idx);
  267. /* Register access APIs */
  268. void nicvf_reg_write(struct nicvf *nic, u64 offset, u64 val);
  269. u64 nicvf_reg_read(struct nicvf *nic, u64 offset);
  270. void nicvf_qset_reg_write(struct nicvf *nic, u64 offset, u64 val);
  271. u64 nicvf_qset_reg_read(struct nicvf *nic, u64 offset);
  272. void nicvf_queue_reg_write(struct nicvf *nic, u64 offset,
  273. u64 qidx, u64 val);
  274. u64 nicvf_queue_reg_read(struct nicvf *nic,
  275. u64 offset, u64 qidx);
  276. /* Stats */
  277. void nicvf_update_rq_stats(struct nicvf *nic, int rq_idx);
  278. void nicvf_update_sq_stats(struct nicvf *nic, int sq_idx);
  279. int nicvf_check_cqe_rx_errs(struct nicvf *nic, struct cqe_rx_t *cqe_rx);
  280. int nicvf_check_cqe_tx_errs(struct nicvf *nic, struct cqe_send_t *cqe_tx);
  281. #endif /* NICVF_QUEUES_H */