common.h 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356
  1. /*
  2. * This program is free software; you can redistribute it and/or
  3. * modify it under the terms of the GNU General Public License version 2
  4. * as published by the Free Software Foundation; or, when distributed
  5. * separately from the Linux kernel or incorporated into other
  6. * software packages, subject to the following license:
  7. *
  8. * Permission is hereby granted, free of charge, to any person obtaining a copy
  9. * of this source file (the "Software"), to deal in the Software without
  10. * restriction, including without limitation the rights to use, copy, modify,
  11. * merge, publish, distribute, sublicense, and/or sell copies of the Software,
  12. * and to permit persons to whom the Software is furnished to do so, subject to
  13. * the following conditions:
  14. *
  15. * The above copyright notice and this permission notice shall be included in
  16. * all copies or substantial portions of the Software.
  17. *
  18. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  19. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  20. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  21. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  22. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  23. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  24. * IN THE SOFTWARE.
  25. */
  26. #ifndef __XEN_NETBACK__COMMON_H__
  27. #define __XEN_NETBACK__COMMON_H__
  28. #define pr_fmt(fmt) KBUILD_MODNAME ":%s: " fmt, __func__
  29. #include <linux/module.h>
  30. #include <linux/interrupt.h>
  31. #include <linux/slab.h>
  32. #include <linux/ip.h>
  33. #include <linux/in.h>
  34. #include <linux/io.h>
  35. #include <linux/netdevice.h>
  36. #include <linux/etherdevice.h>
  37. #include <linux/wait.h>
  38. #include <linux/sched.h>
  39. #include <xen/interface/io/netif.h>
  40. #include <xen/interface/grant_table.h>
  41. #include <xen/grant_table.h>
  42. #include <xen/xenbus.h>
  43. #include <xen/page.h>
  44. #include <linux/debugfs.h>
  45. typedef unsigned int pending_ring_idx_t;
  46. #define INVALID_PENDING_RING_IDX (~0U)
  47. struct pending_tx_info {
  48. struct xen_netif_tx_request req; /* tx request */
  49. /* Callback data for released SKBs. The callback is always
  50. * xenvif_zerocopy_callback, desc contains the pending_idx, which is
  51. * also an index in pending_tx_info array. It is initialized in
  52. * xenvif_alloc and it never changes.
  53. * skb_shinfo(skb)->destructor_arg points to the first mapped slot's
  54. * callback_struct in this array of struct pending_tx_info's, then ctx
  55. * to the next, or NULL if there is no more slot for this skb.
  56. * ubuf_to_vif is a helper which finds the struct xenvif from a pointer
  57. * to this field.
  58. */
  59. struct ubuf_info callback_struct;
  60. };
  61. #define XEN_NETIF_TX_RING_SIZE __CONST_RING_SIZE(xen_netif_tx, XEN_PAGE_SIZE)
  62. #define XEN_NETIF_RX_RING_SIZE __CONST_RING_SIZE(xen_netif_rx, XEN_PAGE_SIZE)
  63. struct xenvif_rx_meta {
  64. int id;
  65. int size;
  66. int gso_type;
  67. int gso_size;
  68. };
  69. #define GSO_BIT(type) \
  70. (1 << XEN_NETIF_GSO_TYPE_ ## type)
  71. /* Discriminate from any valid pending_idx value. */
  72. #define INVALID_PENDING_IDX 0xFFFF
  73. #define MAX_BUFFER_OFFSET XEN_PAGE_SIZE
  74. #define MAX_PENDING_REQS XEN_NETIF_TX_RING_SIZE
  75. /* The maximum number of frags is derived from the size of a grant (same
  76. * as a Xen page size for now).
  77. */
  78. #define MAX_XEN_SKB_FRAGS (65536 / XEN_PAGE_SIZE + 1)
  79. /* It's possible for an skb to have a maximal number of frags
  80. * but still be less than MAX_BUFFER_OFFSET in size. Thus the
  81. * worst-case number of copy operations is MAX_XEN_SKB_FRAGS per
  82. * ring slot.
  83. */
  84. #define MAX_GRANT_COPY_OPS (MAX_XEN_SKB_FRAGS * XEN_NETIF_RX_RING_SIZE)
  85. #define NETBACK_INVALID_HANDLE -1
  86. /* To avoid confusion, we define XEN_NETBK_LEGACY_SLOTS_MAX indicating
  87. * the maximum slots a valid packet can use. Now this value is defined
  88. * to be XEN_NETIF_NR_SLOTS_MIN, which is supposed to be supported by
  89. * all backend.
  90. */
  91. #define XEN_NETBK_LEGACY_SLOTS_MAX XEN_NETIF_NR_SLOTS_MIN
  92. /* Queue name is interface name with "-qNNN" appended */
  93. #define QUEUE_NAME_SIZE (IFNAMSIZ + 5)
  94. /* IRQ name is queue name with "-tx" or "-rx" appended */
  95. #define IRQ_NAME_SIZE (QUEUE_NAME_SIZE + 3)
  96. struct xenvif;
  97. struct xenvif_stats {
  98. /* Stats fields to be updated per-queue.
  99. * A subset of struct net_device_stats that contains only the
  100. * fields that are updated in netback.c for each queue.
  101. */
  102. unsigned int rx_bytes;
  103. unsigned int rx_packets;
  104. unsigned int tx_bytes;
  105. unsigned int tx_packets;
  106. /* Additional stats used by xenvif */
  107. unsigned long rx_gso_checksum_fixup;
  108. unsigned long tx_zerocopy_sent;
  109. unsigned long tx_zerocopy_success;
  110. unsigned long tx_zerocopy_fail;
  111. unsigned long tx_frag_overflow;
  112. };
  113. struct xenvif_queue { /* Per-queue data for xenvif */
  114. unsigned int id; /* Queue ID, 0-based */
  115. char name[QUEUE_NAME_SIZE]; /* DEVNAME-qN */
  116. struct xenvif *vif; /* Parent VIF */
  117. /* Use NAPI for guest TX */
  118. struct napi_struct napi;
  119. /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
  120. unsigned int tx_irq;
  121. /* Only used when feature-split-event-channels = 1 */
  122. char tx_irq_name[IRQ_NAME_SIZE]; /* DEVNAME-qN-tx */
  123. struct xen_netif_tx_back_ring tx;
  124. struct sk_buff_head tx_queue;
  125. struct page *mmap_pages[MAX_PENDING_REQS];
  126. pending_ring_idx_t pending_prod;
  127. pending_ring_idx_t pending_cons;
  128. u16 pending_ring[MAX_PENDING_REQS];
  129. struct pending_tx_info pending_tx_info[MAX_PENDING_REQS];
  130. grant_handle_t grant_tx_handle[MAX_PENDING_REQS];
  131. struct gnttab_copy tx_copy_ops[MAX_PENDING_REQS];
  132. struct gnttab_map_grant_ref tx_map_ops[MAX_PENDING_REQS];
  133. struct gnttab_unmap_grant_ref tx_unmap_ops[MAX_PENDING_REQS];
  134. /* passed to gnttab_[un]map_refs with pages under (un)mapping */
  135. struct page *pages_to_map[MAX_PENDING_REQS];
  136. struct page *pages_to_unmap[MAX_PENDING_REQS];
  137. /* This prevents zerocopy callbacks to race over dealloc_ring */
  138. spinlock_t callback_lock;
  139. /* This prevents dealloc thread and NAPI instance to race over response
  140. * creation and pending_ring in xenvif_idx_release. In xenvif_tx_err
  141. * it only protect response creation
  142. */
  143. spinlock_t response_lock;
  144. pending_ring_idx_t dealloc_prod;
  145. pending_ring_idx_t dealloc_cons;
  146. u16 dealloc_ring[MAX_PENDING_REQS];
  147. struct task_struct *dealloc_task;
  148. wait_queue_head_t dealloc_wq;
  149. atomic_t inflight_packets;
  150. /* Use kthread for guest RX */
  151. struct task_struct *task;
  152. wait_queue_head_t wq;
  153. /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
  154. unsigned int rx_irq;
  155. /* Only used when feature-split-event-channels = 1 */
  156. char rx_irq_name[IRQ_NAME_SIZE]; /* DEVNAME-qN-rx */
  157. struct xen_netif_rx_back_ring rx;
  158. struct sk_buff_head rx_queue;
  159. unsigned int rx_queue_max;
  160. unsigned int rx_queue_len;
  161. unsigned long last_rx_time;
  162. bool stalled;
  163. struct gnttab_copy grant_copy_op[MAX_GRANT_COPY_OPS];
  164. /* We create one meta structure per ring request we consume, so
  165. * the maximum number is the same as the ring size.
  166. */
  167. struct xenvif_rx_meta meta[XEN_NETIF_RX_RING_SIZE];
  168. /* Transmit shaping: allow 'credit_bytes' every 'credit_usec'. */
  169. unsigned long credit_bytes;
  170. unsigned long credit_usec;
  171. unsigned long remaining_credit;
  172. struct timer_list credit_timeout;
  173. u64 credit_window_start;
  174. bool rate_limited;
  175. /* Statistics */
  176. struct xenvif_stats stats;
  177. };
  178. enum state_bit_shift {
  179. /* This bit marks that the vif is connected */
  180. VIF_STATUS_CONNECTED,
  181. };
  182. struct xenvif_mcast_addr {
  183. struct list_head entry;
  184. struct rcu_head rcu;
  185. u8 addr[6];
  186. };
  187. #define XEN_NETBK_MCAST_MAX 64
  188. struct xenvif {
  189. /* Unique identifier for this interface. */
  190. domid_t domid;
  191. unsigned int handle;
  192. u8 fe_dev_addr[6];
  193. struct list_head fe_mcast_addr;
  194. unsigned int fe_mcast_count;
  195. /* Frontend feature information. */
  196. int gso_mask;
  197. int gso_prefix_mask;
  198. u8 can_sg:1;
  199. u8 ip_csum:1;
  200. u8 ipv6_csum:1;
  201. u8 multicast_control:1;
  202. /* Is this interface disabled? True when backend discovers
  203. * frontend is rogue.
  204. */
  205. bool disabled;
  206. unsigned long status;
  207. unsigned long drain_timeout;
  208. unsigned long stall_timeout;
  209. /* Queues */
  210. struct xenvif_queue *queues;
  211. unsigned int num_queues; /* active queues, resource allocated */
  212. unsigned int stalled_queues;
  213. struct xenbus_watch credit_watch;
  214. spinlock_t lock;
  215. #ifdef CONFIG_DEBUG_FS
  216. struct dentry *xenvif_dbg_root;
  217. #endif
  218. /* Miscellaneous private stuff. */
  219. struct net_device *dev;
  220. };
  221. struct xenvif_rx_cb {
  222. unsigned long expires;
  223. int meta_slots_used;
  224. };
  225. #define XENVIF_RX_CB(skb) ((struct xenvif_rx_cb *)(skb)->cb)
  226. static inline struct xenbus_device *xenvif_to_xenbus_device(struct xenvif *vif)
  227. {
  228. return to_xenbus_device(vif->dev->dev.parent);
  229. }
  230. void xenvif_tx_credit_callback(unsigned long data);
  231. struct xenvif *xenvif_alloc(struct device *parent,
  232. domid_t domid,
  233. unsigned int handle);
  234. int xenvif_init_queue(struct xenvif_queue *queue);
  235. void xenvif_deinit_queue(struct xenvif_queue *queue);
  236. int xenvif_connect(struct xenvif_queue *queue, unsigned long tx_ring_ref,
  237. unsigned long rx_ring_ref, unsigned int tx_evtchn,
  238. unsigned int rx_evtchn);
  239. void xenvif_disconnect(struct xenvif *vif);
  240. void xenvif_free(struct xenvif *vif);
  241. int xenvif_xenbus_init(void);
  242. void xenvif_xenbus_fini(void);
  243. int xenvif_schedulable(struct xenvif *vif);
  244. int xenvif_queue_stopped(struct xenvif_queue *queue);
  245. void xenvif_wake_queue(struct xenvif_queue *queue);
  246. /* (Un)Map communication rings. */
  247. void xenvif_unmap_frontend_rings(struct xenvif_queue *queue);
  248. int xenvif_map_frontend_rings(struct xenvif_queue *queue,
  249. grant_ref_t tx_ring_ref,
  250. grant_ref_t rx_ring_ref);
  251. /* Check for SKBs from frontend and schedule backend processing */
  252. void xenvif_napi_schedule_or_enable_events(struct xenvif_queue *queue);
  253. /* Prevent the device from generating any further traffic. */
  254. void xenvif_carrier_off(struct xenvif *vif);
  255. int xenvif_tx_action(struct xenvif_queue *queue, int budget);
  256. int xenvif_kthread_guest_rx(void *data);
  257. void xenvif_kick_thread(struct xenvif_queue *queue);
  258. int xenvif_dealloc_kthread(void *data);
  259. void xenvif_rx_queue_tail(struct xenvif_queue *queue, struct sk_buff *skb);
  260. void xenvif_carrier_on(struct xenvif *vif);
  261. /* Callback from stack when TX packet can be released */
  262. void xenvif_zerocopy_callback(struct ubuf_info *ubuf, bool zerocopy_success);
  263. /* Unmap a pending page and release it back to the guest */
  264. void xenvif_idx_unmap(struct xenvif_queue *queue, u16 pending_idx);
  265. static inline pending_ring_idx_t nr_pending_reqs(struct xenvif_queue *queue)
  266. {
  267. return MAX_PENDING_REQS -
  268. queue->pending_prod + queue->pending_cons;
  269. }
  270. irqreturn_t xenvif_interrupt(int irq, void *dev_id);
  271. extern bool separate_tx_rx_irq;
  272. extern unsigned int rx_drain_timeout_msecs;
  273. extern unsigned int rx_stall_timeout_msecs;
  274. extern unsigned int xenvif_max_queues;
  275. #ifdef CONFIG_DEBUG_FS
  276. extern struct dentry *xen_netback_dbg_root;
  277. #endif
  278. void xenvif_skb_zerocopy_prepare(struct xenvif_queue *queue,
  279. struct sk_buff *skb);
  280. void xenvif_skb_zerocopy_complete(struct xenvif_queue *queue);
  281. /* Multicast control */
  282. bool xenvif_mcast_match(struct xenvif *vif, const u8 *addr);
  283. void xenvif_mcast_addr_list_free(struct xenvif *vif);
  284. #endif /* __XEN_NETBACK__COMMON_H__ */