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:
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:
15 * The above copyright notice and this permission notice shall be included in
16 * all copies or substantial portions of the Software.
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
27 #ifndef __XEN_NETBACK__COMMON_H__
28 #define __XEN_NETBACK__COMMON_H__
30 #define pr_fmt(fmt) KBUILD_MODNAME ":%s: " fmt, __func__
32 #include <linux/module.h>
33 #include <linux/interrupt.h>
34 #include <linux/slab.h>
38 #include <linux/netdevice.h>
39 #include <linux/etherdevice.h>
40 #include <linux/wait.h>
41 #include <linux/sched.h>
43 #include <xen/interface/io/netif.h>
44 #include <xen/interface/grant_table.h>
45 #include <xen/grant_table.h>
46 #include <xen/xenbus.h>
48 typedef unsigned int pending_ring_idx_t
;
49 #define INVALID_PENDING_RING_IDX (~0U)
51 /* For the head field in pending_tx_info: it is used to indicate
52 * whether this tx info is the head of one or more coalesced requests.
54 * When head != INVALID_PENDING_RING_IDX, it means the start of a new
55 * tx requests queue and the end of previous queue.
57 * An example sequence of head fields (I = INVALID_PENDING_RING_IDX):
59 * ...|0 I I I|5 I|9 I I I|...
60 * -->|<-INUSE----------------
62 * After consuming the first slot(s) we have:
64 * ...|V V V V|5 I|9 I I I|...
65 * -----FREE->|<-INUSE--------
67 * where V stands for "valid pending ring index". Any number other
68 * than INVALID_PENDING_RING_IDX is OK. These entries are considered
69 * free and can contain any number other than
70 * INVALID_PENDING_RING_IDX. In practice we use 0.
72 * The in use non-INVALID_PENDING_RING_IDX (say 0, 5 and 9 in the
73 * above example) number is the index into pending_tx_info and
76 struct pending_tx_info
{
77 struct xen_netif_tx_request req
; /* coalesced tx request */
78 pending_ring_idx_t head
; /* head != INVALID_PENDING_RING_IDX
79 * if it is head of one or more tx
84 #define XEN_NETIF_TX_RING_SIZE __CONST_RING_SIZE(xen_netif_tx, PAGE_SIZE)
85 #define XEN_NETIF_RX_RING_SIZE __CONST_RING_SIZE(xen_netif_rx, PAGE_SIZE)
87 struct xenvif_rx_meta
{
94 #define GSO_BIT(type) \
95 (1 << XEN_NETIF_GSO_TYPE_ ## type)
97 /* Discriminate from any valid pending_idx value. */
98 #define INVALID_PENDING_IDX 0xFFFF
100 #define MAX_BUFFER_OFFSET PAGE_SIZE
102 #define MAX_PENDING_REQS 256
105 /* Unique identifier for this interface. */
109 /* Use NAPI for guest TX */
110 struct napi_struct napi
;
111 /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
113 /* Only used when feature-split-event-channels = 1 */
114 char tx_irq_name
[IFNAMSIZ
+4]; /* DEVNAME-tx */
115 struct xen_netif_tx_back_ring tx
;
116 struct sk_buff_head tx_queue
;
117 struct page
*mmap_pages
[MAX_PENDING_REQS
];
118 pending_ring_idx_t pending_prod
;
119 pending_ring_idx_t pending_cons
;
120 u16 pending_ring
[MAX_PENDING_REQS
];
121 struct pending_tx_info pending_tx_info
[MAX_PENDING_REQS
];
123 /* Coalescing tx requests before copying makes number of grant
124 * copy ops greater or equal to number of slots required. In
125 * worst case a tx request consumes 2 gnttab_copy.
127 struct gnttab_copy tx_copy_ops
[2*MAX_PENDING_REQS
];
130 /* Use kthread for guest RX */
131 struct task_struct
*task
;
132 wait_queue_head_t wq
;
133 /* When feature-split-event-channels = 0, tx_irq = rx_irq. */
135 /* Only used when feature-split-event-channels = 1 */
136 char rx_irq_name
[IFNAMSIZ
+4]; /* DEVNAME-rx */
137 struct xen_netif_rx_back_ring rx
;
138 struct sk_buff_head rx_queue
;
140 /* Allow xenvif_start_xmit() to peek ahead in the rx request
141 * ring. This is a prediction of what rx_req_cons will be
142 * once all queued skbs are put on the ring.
144 RING_IDX rx_req_cons_peek
;
146 /* Given MAX_BUFFER_OFFSET of 4096 the worst case is that each
147 * head/fragment page uses 2 copy operations because it
148 * straddles two buffers in the frontend.
150 struct gnttab_copy grant_copy_op
[2*XEN_NETIF_RX_RING_SIZE
];
151 struct xenvif_rx_meta meta
[2*XEN_NETIF_RX_RING_SIZE
];
156 /* Frontend feature information. */
164 /* Internal feature information. */
165 u8 can_queue
:1; /* can queue packets for receiver? */
167 /* Transmit shaping: allow 'credit_bytes' every 'credit_usec'. */
168 unsigned long credit_bytes
;
169 unsigned long credit_usec
;
170 unsigned long remaining_credit
;
171 struct timer_list credit_timeout
;
172 u64 credit_window_start
;
175 unsigned long rx_gso_checksum_fixup
;
177 /* Miscellaneous private stuff. */
178 struct net_device
*dev
;
181 static inline struct xenbus_device
*xenvif_to_xenbus_device(struct xenvif
*vif
)
183 return to_xenbus_device(vif
->dev
->dev
.parent
);
186 struct xenvif
*xenvif_alloc(struct device
*parent
,
188 unsigned int handle
);
190 int xenvif_connect(struct xenvif
*vif
, unsigned long tx_ring_ref
,
191 unsigned long rx_ring_ref
, unsigned int tx_evtchn
,
192 unsigned int rx_evtchn
);
193 void xenvif_disconnect(struct xenvif
*vif
);
194 void xenvif_free(struct xenvif
*vif
);
196 int xenvif_xenbus_init(void);
197 void xenvif_xenbus_fini(void);
199 int xenvif_schedulable(struct xenvif
*vif
);
201 int xenvif_rx_ring_full(struct xenvif
*vif
);
203 int xenvif_must_stop_queue(struct xenvif
*vif
);
205 /* (Un)Map communication rings. */
206 void xenvif_unmap_frontend_rings(struct xenvif
*vif
);
207 int xenvif_map_frontend_rings(struct xenvif
*vif
,
208 grant_ref_t tx_ring_ref
,
209 grant_ref_t rx_ring_ref
);
211 /* Check for SKBs from frontend and schedule backend processing */
212 void xenvif_check_rx_xenvif(struct xenvif
*vif
);
214 /* Queue an SKB for transmission to the frontend */
215 void xenvif_queue_tx_skb(struct xenvif
*vif
, struct sk_buff
*skb
);
216 /* Notify xenvif that ring now has space to send an skb to the frontend */
217 void xenvif_notify_tx_completion(struct xenvif
*vif
);
219 /* Prevent the device from generating any further traffic. */
220 void xenvif_carrier_off(struct xenvif
*vif
);
222 /* Returns number of ring slots required to send an skb to the frontend */
223 unsigned int xenvif_count_skb_slots(struct xenvif
*vif
, struct sk_buff
*skb
);
225 int xenvif_tx_action(struct xenvif
*vif
, int budget
);
226 void xenvif_rx_action(struct xenvif
*vif
);
228 int xenvif_kthread(void *data
);
230 extern bool separate_tx_rx_irq
;
232 #endif /* __XEN_NETBACK__COMMON_H__ */