common.h 7.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232
  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. typedef unsigned int pending_ring_idx_t;
  44. #define INVALID_PENDING_RING_IDX (~0U)
  45. /* For the head field in pending_tx_info: it is used to indicate
  46. * whether this tx info is the head of one or more coalesced requests.
  47. *
  48. * When head != INVALID_PENDING_RING_IDX, it means the start of a new
  49. * tx requests queue and the end of previous queue.
  50. *
  51. * An example sequence of head fields (I = INVALID_PENDING_RING_IDX):
  52. *
  53. * ...|0 I I I|5 I|9 I I I|...
  54. * -->|<-INUSE----------------
  55. *
  56. * After consuming the first slot(s) we have:
  57. *
  58. * ...|V V V V|5 I|9 I I I|...
  59. * -----FREE->|<-INUSE--------
  60. *
  61. * where V stands for "valid pending ring index". Any number other
  62. * than INVALID_PENDING_RING_IDX is OK. These entries are considered
  63. * free and can contain any number other than
  64. * INVALID_PENDING_RING_IDX. In practice we use 0.
  65. *
  66. * The in use non-INVALID_PENDING_RING_IDX (say 0, 5 and 9 in the
  67. * above example) number is the index into pending_tx_info and
  68. * mmap_pages arrays.
  69. */
  70. struct pending_tx_info {
  71. struct xen_netif_tx_request req; /* coalesced tx request */
  72. pending_ring_idx_t head; /* head != INVALID_PENDING_RING_IDX
  73. * if it is head of one or more tx
  74. * reqs
  75. */
  76. };
  77. #define XEN_NETIF_TX_RING_SIZE __CONST_RING_SIZE(xen_netif_tx, PAGE_SIZE)
  78. #define XEN_NETIF_RX_RING_SIZE __CONST_RING_SIZE(xen_netif_rx, PAGE_SIZE)
  79. struct xenvif_rx_meta {
  80. int id;
  81. int size;
  82. int gso_type;
  83. int gso_size;
  84. };
  85. #define GSO_BIT(type) \
  86. (1 << XEN_NETIF_GSO_TYPE_ ## type)
  87. /* Discriminate from any valid pending_idx value. */
  88. #define INVALID_PENDING_IDX 0xFFFF
  89. #define MAX_BUFFER_OFFSET PAGE_SIZE
  90. #define MAX_PENDING_REQS 256
  91. struct xenvif {
  92. /* Unique identifier for this interface. */
  93. domid_t domid;
  94. unsigned int handle;
  95. /* Use NAPI for guest TX */
  96. struct napi_struct napi;
  97. /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
  98. unsigned int tx_irq;
  99. /* Only used when feature-split-event-channels = 1 */
  100. char tx_irq_name[IFNAMSIZ+4]; /* DEVNAME-tx */
  101. struct xen_netif_tx_back_ring tx;
  102. struct sk_buff_head tx_queue;
  103. struct page *mmap_pages[MAX_PENDING_REQS];
  104. pending_ring_idx_t pending_prod;
  105. pending_ring_idx_t pending_cons;
  106. u16 pending_ring[MAX_PENDING_REQS];
  107. struct pending_tx_info pending_tx_info[MAX_PENDING_REQS];
  108. /* Coalescing tx requests before copying makes number of grant
  109. * copy ops greater or equal to number of slots required. In
  110. * worst case a tx request consumes 2 gnttab_copy.
  111. */
  112. struct gnttab_copy tx_copy_ops[2*MAX_PENDING_REQS];
  113. /* Use kthread for guest RX */
  114. struct task_struct *task;
  115. wait_queue_head_t wq;
  116. /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
  117. unsigned int rx_irq;
  118. /* Only used when feature-split-event-channels = 1 */
  119. char rx_irq_name[IFNAMSIZ+4]; /* DEVNAME-rx */
  120. struct xen_netif_rx_back_ring rx;
  121. struct sk_buff_head rx_queue;
  122. /* Allow xenvif_start_xmit() to peek ahead in the rx request
  123. * ring. This is a prediction of what rx_req_cons will be
  124. * once all queued skbs are put on the ring.
  125. */
  126. RING_IDX rx_req_cons_peek;
  127. /* Given MAX_BUFFER_OFFSET of 4096 the worst case is that each
  128. * head/fragment page uses 2 copy operations because it
  129. * straddles two buffers in the frontend.
  130. */
  131. struct gnttab_copy grant_copy_op[2*XEN_NETIF_RX_RING_SIZE];
  132. struct xenvif_rx_meta meta[2*XEN_NETIF_RX_RING_SIZE];
  133. u8 fe_dev_addr[6];
  134. /* Frontend feature information. */
  135. int gso_mask;
  136. int gso_prefix_mask;
  137. u8 can_sg:1;
  138. u8 ip_csum:1;
  139. u8 ipv6_csum:1;
  140. /* Internal feature information. */
  141. u8 can_queue:1; /* can queue packets for receiver? */
  142. /* Transmit shaping: allow 'credit_bytes' every 'credit_usec'. */
  143. unsigned long credit_bytes;
  144. unsigned long credit_usec;
  145. unsigned long remaining_credit;
  146. struct timer_list credit_timeout;
  147. u64 credit_window_start;
  148. /* Statistics */
  149. unsigned long rx_gso_checksum_fixup;
  150. /* Miscellaneous private stuff. */
  151. struct net_device *dev;
  152. };
  153. static inline struct xenbus_device *xenvif_to_xenbus_device(struct xenvif *vif)
  154. {
  155. return to_xenbus_device(vif->dev->dev.parent);
  156. }
  157. struct xenvif *xenvif_alloc(struct device *parent,
  158. domid_t domid,
  159. unsigned int handle);
  160. int xenvif_connect(struct xenvif *vif, unsigned long tx_ring_ref,
  161. unsigned long rx_ring_ref, unsigned int tx_evtchn,
  162. unsigned int rx_evtchn);
  163. void xenvif_disconnect(struct xenvif *vif);
  164. void xenvif_free(struct xenvif *vif);
  165. int xenvif_xenbus_init(void);
  166. void xenvif_xenbus_fini(void);
  167. int xenvif_schedulable(struct xenvif *vif);
  168. int xenvif_rx_ring_full(struct xenvif *vif);
  169. int xenvif_must_stop_queue(struct xenvif *vif);
  170. /* (Un)Map communication rings. */
  171. void xenvif_unmap_frontend_rings(struct xenvif *vif);
  172. int xenvif_map_frontend_rings(struct xenvif *vif,
  173. grant_ref_t tx_ring_ref,
  174. grant_ref_t rx_ring_ref);
  175. /* Check for SKBs from frontend and schedule backend processing */
  176. void xenvif_check_rx_xenvif(struct xenvif *vif);
  177. /* Queue an SKB for transmission to the frontend */
  178. void xenvif_queue_tx_skb(struct xenvif *vif, struct sk_buff *skb);
  179. /* Notify xenvif that ring now has space to send an skb to the frontend */
  180. void xenvif_notify_tx_completion(struct xenvif *vif);
  181. /* Prevent the device from generating any further traffic. */
  182. void xenvif_carrier_off(struct xenvif *vif);
  183. /* Returns number of ring slots required to send an skb to the frontend */
  184. unsigned int xenvif_count_skb_slots(struct xenvif *vif, struct sk_buff *skb);
  185. int xenvif_tx_action(struct xenvif *vif, int budget);
  186. void xenvif_rx_action(struct xenvif *vif);
  187. int xenvif_kthread(void *data);
  188. extern bool separate_tx_rx_irq;
  189. #endif /* __XEN_NETBACK__COMMON_H__ */