netback.c 53 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049
  1. /*
  2. * Back-end of the driver for virtual network devices. This portion of the
  3. * driver exports a 'unified' network-device interface that can be accessed
  4. * by any operating system that implements a compatible front end. A
  5. * reference front-end implementation can be found in:
  6. * drivers/net/xen-netfront.c
  7. *
  8. * Copyright (c) 2002-2005, K A Fraser
  9. *
  10. * This program is free software; you can redistribute it and/or
  11. * modify it under the terms of the GNU General Public License version 2
  12. * as published by the Free Software Foundation; or, when distributed
  13. * separately from the Linux kernel or incorporated into other
  14. * software packages, subject to the following license:
  15. *
  16. * Permission is hereby granted, free of charge, to any person obtaining a copy
  17. * of this source file (the "Software"), to deal in the Software without
  18. * restriction, including without limitation the rights to use, copy, modify,
  19. * merge, publish, distribute, sublicense, and/or sell copies of the Software,
  20. * and to permit persons to whom the Software is furnished to do so, subject to
  21. * the following conditions:
  22. *
  23. * The above copyright notice and this permission notice shall be included in
  24. * all copies or substantial portions of the Software.
  25. *
  26. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  27. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  28. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  29. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  30. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  31. * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  32. * IN THE SOFTWARE.
  33. */
  34. #include "common.h"
  35. #include <linux/kthread.h>
  36. #include <linux/if_vlan.h>
  37. #include <linux/udp.h>
  38. #include <linux/highmem.h>
  39. #include <net/tcp.h>
  40. #include <xen/xen.h>
  41. #include <xen/events.h>
  42. #include <xen/interface/memory.h>
  43. #include <asm/xen/hypercall.h>
  44. #include <asm/xen/page.h>
  45. /* Provide an option to disable split event channels at load time as
  46. * event channels are limited resource. Split event channels are
  47. * enabled by default.
  48. */
  49. bool separate_tx_rx_irq = 1;
  50. module_param(separate_tx_rx_irq, bool, 0644);
  51. /* The time that packets can stay on the guest Rx internal queue
  52. * before they are dropped.
  53. */
  54. unsigned int rx_drain_timeout_msecs = 10000;
  55. module_param(rx_drain_timeout_msecs, uint, 0444);
  56. /* The length of time before the frontend is considered unresponsive
  57. * because it isn't providing Rx slots.
  58. */
  59. unsigned int rx_stall_timeout_msecs = 60000;
  60. module_param(rx_stall_timeout_msecs, uint, 0444);
  61. unsigned int xenvif_max_queues;
  62. module_param_named(max_queues, xenvif_max_queues, uint, 0644);
  63. MODULE_PARM_DESC(max_queues,
  64. "Maximum number of queues per virtual interface");
  65. /*
  66. * This is the maximum slots a skb can have. If a guest sends a skb
  67. * which exceeds this limit it is considered malicious.
  68. */
  69. #define FATAL_SKB_SLOTS_DEFAULT 20
  70. static unsigned int fatal_skb_slots = FATAL_SKB_SLOTS_DEFAULT;
  71. module_param(fatal_skb_slots, uint, 0444);
  72. /* The amount to copy out of the first guest Tx slot into the skb's
  73. * linear area. If the first slot has more data, it will be mapped
  74. * and put into the first frag.
  75. *
  76. * This is sized to avoid pulling headers from the frags for most
  77. * TCP/IP packets.
  78. */
  79. #define XEN_NETBACK_TX_COPY_LEN 128
  80. static void xenvif_idx_release(struct xenvif_queue *queue, u16 pending_idx,
  81. u8 status);
  82. static void make_tx_response(struct xenvif_queue *queue,
  83. struct xen_netif_tx_request *txp,
  84. s8 st);
  85. static void push_tx_responses(struct xenvif_queue *queue);
  86. static inline int tx_work_todo(struct xenvif_queue *queue);
  87. static struct xen_netif_rx_response *make_rx_response(struct xenvif_queue *queue,
  88. u16 id,
  89. s8 st,
  90. u16 offset,
  91. u16 size,
  92. u16 flags);
  93. static inline unsigned long idx_to_pfn(struct xenvif_queue *queue,
  94. u16 idx)
  95. {
  96. return page_to_pfn(queue->mmap_pages[idx]);
  97. }
  98. static inline unsigned long idx_to_kaddr(struct xenvif_queue *queue,
  99. u16 idx)
  100. {
  101. return (unsigned long)pfn_to_kaddr(idx_to_pfn(queue, idx));
  102. }
  103. #define callback_param(vif, pending_idx) \
  104. (vif->pending_tx_info[pending_idx].callback_struct)
  105. /* Find the containing VIF's structure from a pointer in pending_tx_info array
  106. */
  107. static inline struct xenvif_queue *ubuf_to_queue(const struct ubuf_info *ubuf)
  108. {
  109. u16 pending_idx = ubuf->desc;
  110. struct pending_tx_info *temp =
  111. container_of(ubuf, struct pending_tx_info, callback_struct);
  112. return container_of(temp - pending_idx,
  113. struct xenvif_queue,
  114. pending_tx_info[0]);
  115. }
  116. static u16 frag_get_pending_idx(skb_frag_t *frag)
  117. {
  118. return (u16)frag->page_offset;
  119. }
  120. static void frag_set_pending_idx(skb_frag_t *frag, u16 pending_idx)
  121. {
  122. frag->page_offset = pending_idx;
  123. }
  124. static inline pending_ring_idx_t pending_index(unsigned i)
  125. {
  126. return i & (MAX_PENDING_REQS-1);
  127. }
  128. bool xenvif_rx_ring_slots_available(struct xenvif_queue *queue, int needed)
  129. {
  130. RING_IDX prod, cons;
  131. do {
  132. prod = queue->rx.sring->req_prod;
  133. cons = queue->rx.req_cons;
  134. if (prod - cons >= needed)
  135. return true;
  136. queue->rx.sring->req_event = prod + 1;
  137. /* Make sure event is visible before we check prod
  138. * again.
  139. */
  140. mb();
  141. } while (queue->rx.sring->req_prod != prod);
  142. return false;
  143. }
  144. void xenvif_rx_queue_tail(struct xenvif_queue *queue, struct sk_buff *skb)
  145. {
  146. unsigned long flags;
  147. spin_lock_irqsave(&queue->rx_queue.lock, flags);
  148. __skb_queue_tail(&queue->rx_queue, skb);
  149. queue->rx_queue_len += skb->len;
  150. if (queue->rx_queue_len > queue->rx_queue_max)
  151. netif_tx_stop_queue(netdev_get_tx_queue(queue->vif->dev, queue->id));
  152. spin_unlock_irqrestore(&queue->rx_queue.lock, flags);
  153. }
  154. static struct sk_buff *xenvif_rx_dequeue(struct xenvif_queue *queue)
  155. {
  156. struct sk_buff *skb;
  157. spin_lock_irq(&queue->rx_queue.lock);
  158. skb = __skb_dequeue(&queue->rx_queue);
  159. if (skb)
  160. queue->rx_queue_len -= skb->len;
  161. spin_unlock_irq(&queue->rx_queue.lock);
  162. return skb;
  163. }
  164. static void xenvif_rx_queue_maybe_wake(struct xenvif_queue *queue)
  165. {
  166. spin_lock_irq(&queue->rx_queue.lock);
  167. if (queue->rx_queue_len < queue->rx_queue_max)
  168. netif_tx_wake_queue(netdev_get_tx_queue(queue->vif->dev, queue->id));
  169. spin_unlock_irq(&queue->rx_queue.lock);
  170. }
  171. static void xenvif_rx_queue_purge(struct xenvif_queue *queue)
  172. {
  173. struct sk_buff *skb;
  174. while ((skb = xenvif_rx_dequeue(queue)) != NULL)
  175. kfree_skb(skb);
  176. }
  177. static void xenvif_rx_queue_drop_expired(struct xenvif_queue *queue)
  178. {
  179. struct sk_buff *skb;
  180. for(;;) {
  181. skb = skb_peek(&queue->rx_queue);
  182. if (!skb)
  183. break;
  184. if (time_before(jiffies, XENVIF_RX_CB(skb)->expires))
  185. break;
  186. xenvif_rx_dequeue(queue);
  187. kfree_skb(skb);
  188. }
  189. }
  190. struct netrx_pending_operations {
  191. unsigned copy_prod, copy_cons;
  192. unsigned meta_prod, meta_cons;
  193. struct gnttab_copy *copy;
  194. struct xenvif_rx_meta *meta;
  195. int copy_off;
  196. grant_ref_t copy_gref;
  197. };
  198. static struct xenvif_rx_meta *get_next_rx_buffer(struct xenvif_queue *queue,
  199. struct netrx_pending_operations *npo)
  200. {
  201. struct xenvif_rx_meta *meta;
  202. struct xen_netif_rx_request *req;
  203. req = RING_GET_REQUEST(&queue->rx, queue->rx.req_cons++);
  204. meta = npo->meta + npo->meta_prod++;
  205. meta->gso_type = XEN_NETIF_GSO_TYPE_NONE;
  206. meta->gso_size = 0;
  207. meta->size = 0;
  208. meta->id = req->id;
  209. npo->copy_off = 0;
  210. npo->copy_gref = req->gref;
  211. return meta;
  212. }
  213. /*
  214. * Set up the grant operations for this fragment. If it's a flipping
  215. * interface, we also set up the unmap request from here.
  216. */
  217. static void xenvif_gop_frag_copy(struct xenvif_queue *queue, struct sk_buff *skb,
  218. struct netrx_pending_operations *npo,
  219. struct page *page, unsigned long size,
  220. unsigned long offset, int *head)
  221. {
  222. struct gnttab_copy *copy_gop;
  223. struct xenvif_rx_meta *meta;
  224. unsigned long bytes;
  225. int gso_type = XEN_NETIF_GSO_TYPE_NONE;
  226. /* Data must not cross a page boundary. */
  227. BUG_ON(size + offset > PAGE_SIZE<<compound_order(page));
  228. meta = npo->meta + npo->meta_prod - 1;
  229. /* Skip unused frames from start of page */
  230. page += offset >> PAGE_SHIFT;
  231. offset &= ~PAGE_MASK;
  232. while (size > 0) {
  233. struct xen_page_foreign *foreign;
  234. BUG_ON(offset >= PAGE_SIZE);
  235. BUG_ON(npo->copy_off > MAX_BUFFER_OFFSET);
  236. if (npo->copy_off == MAX_BUFFER_OFFSET)
  237. meta = get_next_rx_buffer(queue, npo);
  238. bytes = PAGE_SIZE - offset;
  239. if (bytes > size)
  240. bytes = size;
  241. if (npo->copy_off + bytes > MAX_BUFFER_OFFSET)
  242. bytes = MAX_BUFFER_OFFSET - npo->copy_off;
  243. copy_gop = npo->copy + npo->copy_prod++;
  244. copy_gop->flags = GNTCOPY_dest_gref;
  245. copy_gop->len = bytes;
  246. foreign = xen_page_foreign(page);
  247. if (foreign) {
  248. copy_gop->source.domid = foreign->domid;
  249. copy_gop->source.u.ref = foreign->gref;
  250. copy_gop->flags |= GNTCOPY_source_gref;
  251. } else {
  252. copy_gop->source.domid = DOMID_SELF;
  253. copy_gop->source.u.gmfn =
  254. virt_to_mfn(page_address(page));
  255. }
  256. copy_gop->source.offset = offset;
  257. copy_gop->dest.domid = queue->vif->domid;
  258. copy_gop->dest.offset = npo->copy_off;
  259. copy_gop->dest.u.ref = npo->copy_gref;
  260. npo->copy_off += bytes;
  261. meta->size += bytes;
  262. offset += bytes;
  263. size -= bytes;
  264. /* Next frame */
  265. if (offset == PAGE_SIZE && size) {
  266. BUG_ON(!PageCompound(page));
  267. page++;
  268. offset = 0;
  269. }
  270. /* Leave a gap for the GSO descriptor. */
  271. if (skb_is_gso(skb)) {
  272. if (skb_shinfo(skb)->gso_type & SKB_GSO_TCPV4)
  273. gso_type = XEN_NETIF_GSO_TYPE_TCPV4;
  274. else if (skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6)
  275. gso_type = XEN_NETIF_GSO_TYPE_TCPV6;
  276. }
  277. if (*head && ((1 << gso_type) & queue->vif->gso_mask))
  278. queue->rx.req_cons++;
  279. *head = 0; /* There must be something in this buffer now. */
  280. }
  281. }
  282. /*
  283. * Prepare an SKB to be transmitted to the frontend.
  284. *
  285. * This function is responsible for allocating grant operations, meta
  286. * structures, etc.
  287. *
  288. * It returns the number of meta structures consumed. The number of
  289. * ring slots used is always equal to the number of meta slots used
  290. * plus the number of GSO descriptors used. Currently, we use either
  291. * zero GSO descriptors (for non-GSO packets) or one descriptor (for
  292. * frontend-side LRO).
  293. */
  294. static int xenvif_gop_skb(struct sk_buff *skb,
  295. struct netrx_pending_operations *npo,
  296. struct xenvif_queue *queue)
  297. {
  298. struct xenvif *vif = netdev_priv(skb->dev);
  299. int nr_frags = skb_shinfo(skb)->nr_frags;
  300. int i;
  301. struct xen_netif_rx_request *req;
  302. struct xenvif_rx_meta *meta;
  303. unsigned char *data;
  304. int head = 1;
  305. int old_meta_prod;
  306. int gso_type;
  307. old_meta_prod = npo->meta_prod;
  308. gso_type = XEN_NETIF_GSO_TYPE_NONE;
  309. if (skb_is_gso(skb)) {
  310. if (skb_shinfo(skb)->gso_type & SKB_GSO_TCPV4)
  311. gso_type = XEN_NETIF_GSO_TYPE_TCPV4;
  312. else if (skb_shinfo(skb)->gso_type & SKB_GSO_TCPV6)
  313. gso_type = XEN_NETIF_GSO_TYPE_TCPV6;
  314. }
  315. /* Set up a GSO prefix descriptor, if necessary */
  316. if ((1 << gso_type) & vif->gso_prefix_mask) {
  317. req = RING_GET_REQUEST(&queue->rx, queue->rx.req_cons++);
  318. meta = npo->meta + npo->meta_prod++;
  319. meta->gso_type = gso_type;
  320. meta->gso_size = skb_shinfo(skb)->gso_size;
  321. meta->size = 0;
  322. meta->id = req->id;
  323. }
  324. req = RING_GET_REQUEST(&queue->rx, queue->rx.req_cons++);
  325. meta = npo->meta + npo->meta_prod++;
  326. if ((1 << gso_type) & vif->gso_mask) {
  327. meta->gso_type = gso_type;
  328. meta->gso_size = skb_shinfo(skb)->gso_size;
  329. } else {
  330. meta->gso_type = XEN_NETIF_GSO_TYPE_NONE;
  331. meta->gso_size = 0;
  332. }
  333. meta->size = 0;
  334. meta->id = req->id;
  335. npo->copy_off = 0;
  336. npo->copy_gref = req->gref;
  337. data = skb->data;
  338. while (data < skb_tail_pointer(skb)) {
  339. unsigned int offset = offset_in_page(data);
  340. unsigned int len = PAGE_SIZE - offset;
  341. if (data + len > skb_tail_pointer(skb))
  342. len = skb_tail_pointer(skb) - data;
  343. xenvif_gop_frag_copy(queue, skb, npo,
  344. virt_to_page(data), len, offset, &head);
  345. data += len;
  346. }
  347. for (i = 0; i < nr_frags; i++) {
  348. xenvif_gop_frag_copy(queue, skb, npo,
  349. skb_frag_page(&skb_shinfo(skb)->frags[i]),
  350. skb_frag_size(&skb_shinfo(skb)->frags[i]),
  351. skb_shinfo(skb)->frags[i].page_offset,
  352. &head);
  353. }
  354. return npo->meta_prod - old_meta_prod;
  355. }
  356. /*
  357. * This is a twin to xenvif_gop_skb. Assume that xenvif_gop_skb was
  358. * used to set up the operations on the top of
  359. * netrx_pending_operations, which have since been done. Check that
  360. * they didn't give any errors and advance over them.
  361. */
  362. static int xenvif_check_gop(struct xenvif *vif, int nr_meta_slots,
  363. struct netrx_pending_operations *npo)
  364. {
  365. struct gnttab_copy *copy_op;
  366. int status = XEN_NETIF_RSP_OKAY;
  367. int i;
  368. for (i = 0; i < nr_meta_slots; i++) {
  369. copy_op = npo->copy + npo->copy_cons++;
  370. if (copy_op->status != GNTST_okay) {
  371. netdev_dbg(vif->dev,
  372. "Bad status %d from copy to DOM%d.\n",
  373. copy_op->status, vif->domid);
  374. status = XEN_NETIF_RSP_ERROR;
  375. }
  376. }
  377. return status;
  378. }
  379. static void xenvif_add_frag_responses(struct xenvif_queue *queue, int status,
  380. struct xenvif_rx_meta *meta,
  381. int nr_meta_slots)
  382. {
  383. int i;
  384. unsigned long offset;
  385. /* No fragments used */
  386. if (nr_meta_slots <= 1)
  387. return;
  388. nr_meta_slots--;
  389. for (i = 0; i < nr_meta_slots; i++) {
  390. int flags;
  391. if (i == nr_meta_slots - 1)
  392. flags = 0;
  393. else
  394. flags = XEN_NETRXF_more_data;
  395. offset = 0;
  396. make_rx_response(queue, meta[i].id, status, offset,
  397. meta[i].size, flags);
  398. }
  399. }
  400. void xenvif_kick_thread(struct xenvif_queue *queue)
  401. {
  402. wake_up(&queue->wq);
  403. }
  404. static void xenvif_rx_action(struct xenvif_queue *queue)
  405. {
  406. s8 status;
  407. u16 flags;
  408. struct xen_netif_rx_response *resp;
  409. struct sk_buff_head rxq;
  410. struct sk_buff *skb;
  411. LIST_HEAD(notify);
  412. int ret;
  413. unsigned long offset;
  414. bool need_to_notify = false;
  415. struct netrx_pending_operations npo = {
  416. .copy = queue->grant_copy_op,
  417. .meta = queue->meta,
  418. };
  419. skb_queue_head_init(&rxq);
  420. while (xenvif_rx_ring_slots_available(queue, XEN_NETBK_RX_SLOTS_MAX)
  421. && (skb = xenvif_rx_dequeue(queue)) != NULL) {
  422. RING_IDX old_req_cons;
  423. RING_IDX ring_slots_used;
  424. queue->last_rx_time = jiffies;
  425. old_req_cons = queue->rx.req_cons;
  426. XENVIF_RX_CB(skb)->meta_slots_used = xenvif_gop_skb(skb, &npo, queue);
  427. ring_slots_used = queue->rx.req_cons - old_req_cons;
  428. __skb_queue_tail(&rxq, skb);
  429. }
  430. BUG_ON(npo.meta_prod > ARRAY_SIZE(queue->meta));
  431. if (!npo.copy_prod)
  432. goto done;
  433. BUG_ON(npo.copy_prod > MAX_GRANT_COPY_OPS);
  434. gnttab_batch_copy(queue->grant_copy_op, npo.copy_prod);
  435. while ((skb = __skb_dequeue(&rxq)) != NULL) {
  436. if ((1 << queue->meta[npo.meta_cons].gso_type) &
  437. queue->vif->gso_prefix_mask) {
  438. resp = RING_GET_RESPONSE(&queue->rx,
  439. queue->rx.rsp_prod_pvt++);
  440. resp->flags = XEN_NETRXF_gso_prefix | XEN_NETRXF_more_data;
  441. resp->offset = queue->meta[npo.meta_cons].gso_size;
  442. resp->id = queue->meta[npo.meta_cons].id;
  443. resp->status = XENVIF_RX_CB(skb)->meta_slots_used;
  444. npo.meta_cons++;
  445. XENVIF_RX_CB(skb)->meta_slots_used--;
  446. }
  447. queue->stats.tx_bytes += skb->len;
  448. queue->stats.tx_packets++;
  449. status = xenvif_check_gop(queue->vif,
  450. XENVIF_RX_CB(skb)->meta_slots_used,
  451. &npo);
  452. if (XENVIF_RX_CB(skb)->meta_slots_used == 1)
  453. flags = 0;
  454. else
  455. flags = XEN_NETRXF_more_data;
  456. if (skb->ip_summed == CHECKSUM_PARTIAL) /* local packet? */
  457. flags |= XEN_NETRXF_csum_blank | XEN_NETRXF_data_validated;
  458. else if (skb->ip_summed == CHECKSUM_UNNECESSARY)
  459. /* remote but checksummed. */
  460. flags |= XEN_NETRXF_data_validated;
  461. offset = 0;
  462. resp = make_rx_response(queue, queue->meta[npo.meta_cons].id,
  463. status, offset,
  464. queue->meta[npo.meta_cons].size,
  465. flags);
  466. if ((1 << queue->meta[npo.meta_cons].gso_type) &
  467. queue->vif->gso_mask) {
  468. struct xen_netif_extra_info *gso =
  469. (struct xen_netif_extra_info *)
  470. RING_GET_RESPONSE(&queue->rx,
  471. queue->rx.rsp_prod_pvt++);
  472. resp->flags |= XEN_NETRXF_extra_info;
  473. gso->u.gso.type = queue->meta[npo.meta_cons].gso_type;
  474. gso->u.gso.size = queue->meta[npo.meta_cons].gso_size;
  475. gso->u.gso.pad = 0;
  476. gso->u.gso.features = 0;
  477. gso->type = XEN_NETIF_EXTRA_TYPE_GSO;
  478. gso->flags = 0;
  479. }
  480. xenvif_add_frag_responses(queue, status,
  481. queue->meta + npo.meta_cons + 1,
  482. XENVIF_RX_CB(skb)->meta_slots_used);
  483. RING_PUSH_RESPONSES_AND_CHECK_NOTIFY(&queue->rx, ret);
  484. need_to_notify |= !!ret;
  485. npo.meta_cons += XENVIF_RX_CB(skb)->meta_slots_used;
  486. dev_kfree_skb(skb);
  487. }
  488. done:
  489. if (need_to_notify)
  490. notify_remote_via_irq(queue->rx_irq);
  491. }
  492. void xenvif_napi_schedule_or_enable_events(struct xenvif_queue *queue)
  493. {
  494. int more_to_do;
  495. RING_FINAL_CHECK_FOR_REQUESTS(&queue->tx, more_to_do);
  496. if (more_to_do)
  497. napi_schedule(&queue->napi);
  498. }
  499. static void tx_add_credit(struct xenvif_queue *queue)
  500. {
  501. unsigned long max_burst, max_credit;
  502. /*
  503. * Allow a burst big enough to transmit a jumbo packet of up to 128kB.
  504. * Otherwise the interface can seize up due to insufficient credit.
  505. */
  506. max_burst = RING_GET_REQUEST(&queue->tx, queue->tx.req_cons)->size;
  507. max_burst = min(max_burst, 131072UL);
  508. max_burst = max(max_burst, queue->credit_bytes);
  509. /* Take care that adding a new chunk of credit doesn't wrap to zero. */
  510. max_credit = queue->remaining_credit + queue->credit_bytes;
  511. if (max_credit < queue->remaining_credit)
  512. max_credit = ULONG_MAX; /* wrapped: clamp to ULONG_MAX */
  513. queue->remaining_credit = min(max_credit, max_burst);
  514. }
  515. void xenvif_tx_credit_callback(unsigned long data)
  516. {
  517. struct xenvif_queue *queue = (struct xenvif_queue *)data;
  518. tx_add_credit(queue);
  519. xenvif_napi_schedule_or_enable_events(queue);
  520. }
  521. static void xenvif_tx_err(struct xenvif_queue *queue,
  522. struct xen_netif_tx_request *txp, RING_IDX end)
  523. {
  524. RING_IDX cons = queue->tx.req_cons;
  525. unsigned long flags;
  526. do {
  527. spin_lock_irqsave(&queue->response_lock, flags);
  528. make_tx_response(queue, txp, XEN_NETIF_RSP_ERROR);
  529. push_tx_responses(queue);
  530. spin_unlock_irqrestore(&queue->response_lock, flags);
  531. if (cons == end)
  532. break;
  533. txp = RING_GET_REQUEST(&queue->tx, cons++);
  534. } while (1);
  535. queue->tx.req_cons = cons;
  536. }
  537. static void xenvif_fatal_tx_err(struct xenvif *vif)
  538. {
  539. netdev_err(vif->dev, "fatal error; disabling device\n");
  540. vif->disabled = true;
  541. /* Disable the vif from queue 0's kthread */
  542. if (vif->queues)
  543. xenvif_kick_thread(&vif->queues[0]);
  544. }
  545. static int xenvif_count_requests(struct xenvif_queue *queue,
  546. struct xen_netif_tx_request *first,
  547. struct xen_netif_tx_request *txp,
  548. int work_to_do)
  549. {
  550. RING_IDX cons = queue->tx.req_cons;
  551. int slots = 0;
  552. int drop_err = 0;
  553. int more_data;
  554. if (!(first->flags & XEN_NETTXF_more_data))
  555. return 0;
  556. do {
  557. struct xen_netif_tx_request dropped_tx = { 0 };
  558. if (slots >= work_to_do) {
  559. netdev_err(queue->vif->dev,
  560. "Asked for %d slots but exceeds this limit\n",
  561. work_to_do);
  562. xenvif_fatal_tx_err(queue->vif);
  563. return -ENODATA;
  564. }
  565. /* This guest is really using too many slots and
  566. * considered malicious.
  567. */
  568. if (unlikely(slots >= fatal_skb_slots)) {
  569. netdev_err(queue->vif->dev,
  570. "Malicious frontend using %d slots, threshold %u\n",
  571. slots, fatal_skb_slots);
  572. xenvif_fatal_tx_err(queue->vif);
  573. return -E2BIG;
  574. }
  575. /* Xen network protocol had implicit dependency on
  576. * MAX_SKB_FRAGS. XEN_NETBK_LEGACY_SLOTS_MAX is set to
  577. * the historical MAX_SKB_FRAGS value 18 to honor the
  578. * same behavior as before. Any packet using more than
  579. * 18 slots but less than fatal_skb_slots slots is
  580. * dropped
  581. */
  582. if (!drop_err && slots >= XEN_NETBK_LEGACY_SLOTS_MAX) {
  583. if (net_ratelimit())
  584. netdev_dbg(queue->vif->dev,
  585. "Too many slots (%d) exceeding limit (%d), dropping packet\n",
  586. slots, XEN_NETBK_LEGACY_SLOTS_MAX);
  587. drop_err = -E2BIG;
  588. }
  589. if (drop_err)
  590. txp = &dropped_tx;
  591. memcpy(txp, RING_GET_REQUEST(&queue->tx, cons + slots),
  592. sizeof(*txp));
  593. /* If the guest submitted a frame >= 64 KiB then
  594. * first->size overflowed and following slots will
  595. * appear to be larger than the frame.
  596. *
  597. * This cannot be fatal error as there are buggy
  598. * frontends that do this.
  599. *
  600. * Consume all slots and drop the packet.
  601. */
  602. if (!drop_err && txp->size > first->size) {
  603. if (net_ratelimit())
  604. netdev_dbg(queue->vif->dev,
  605. "Invalid tx request, slot size %u > remaining size %u\n",
  606. txp->size, first->size);
  607. drop_err = -EIO;
  608. }
  609. first->size -= txp->size;
  610. slots++;
  611. if (unlikely((txp->offset + txp->size) > PAGE_SIZE)) {
  612. netdev_err(queue->vif->dev, "Cross page boundary, txp->offset: %x, size: %u\n",
  613. txp->offset, txp->size);
  614. xenvif_fatal_tx_err(queue->vif);
  615. return -EINVAL;
  616. }
  617. more_data = txp->flags & XEN_NETTXF_more_data;
  618. if (!drop_err)
  619. txp++;
  620. } while (more_data);
  621. if (drop_err) {
  622. xenvif_tx_err(queue, first, cons + slots);
  623. return drop_err;
  624. }
  625. return slots;
  626. }
  627. struct xenvif_tx_cb {
  628. u16 pending_idx;
  629. };
  630. #define XENVIF_TX_CB(skb) ((struct xenvif_tx_cb *)(skb)->cb)
  631. static inline void xenvif_tx_create_map_op(struct xenvif_queue *queue,
  632. u16 pending_idx,
  633. struct xen_netif_tx_request *txp,
  634. struct gnttab_map_grant_ref *mop)
  635. {
  636. queue->pages_to_map[mop-queue->tx_map_ops] = queue->mmap_pages[pending_idx];
  637. gnttab_set_map_op(mop, idx_to_kaddr(queue, pending_idx),
  638. GNTMAP_host_map | GNTMAP_readonly,
  639. txp->gref, queue->vif->domid);
  640. memcpy(&queue->pending_tx_info[pending_idx].req, txp,
  641. sizeof(*txp));
  642. }
  643. static inline struct sk_buff *xenvif_alloc_skb(unsigned int size)
  644. {
  645. struct sk_buff *skb =
  646. alloc_skb(size + NET_SKB_PAD + NET_IP_ALIGN,
  647. GFP_ATOMIC | __GFP_NOWARN);
  648. if (unlikely(skb == NULL))
  649. return NULL;
  650. /* Packets passed to netif_rx() must have some headroom. */
  651. skb_reserve(skb, NET_SKB_PAD + NET_IP_ALIGN);
  652. /* Initialize it here to avoid later surprises */
  653. skb_shinfo(skb)->destructor_arg = NULL;
  654. return skb;
  655. }
  656. static struct gnttab_map_grant_ref *xenvif_get_requests(struct xenvif_queue *queue,
  657. struct sk_buff *skb,
  658. struct xen_netif_tx_request *txp,
  659. struct gnttab_map_grant_ref *gop)
  660. {
  661. struct skb_shared_info *shinfo = skb_shinfo(skb);
  662. skb_frag_t *frags = shinfo->frags;
  663. u16 pending_idx = XENVIF_TX_CB(skb)->pending_idx;
  664. int start;
  665. pending_ring_idx_t index;
  666. unsigned int nr_slots, frag_overflow = 0;
  667. /* At this point shinfo->nr_frags is in fact the number of
  668. * slots, which can be as large as XEN_NETBK_LEGACY_SLOTS_MAX.
  669. */
  670. if (shinfo->nr_frags > MAX_SKB_FRAGS) {
  671. frag_overflow = shinfo->nr_frags - MAX_SKB_FRAGS;
  672. BUG_ON(frag_overflow > MAX_SKB_FRAGS);
  673. shinfo->nr_frags = MAX_SKB_FRAGS;
  674. }
  675. nr_slots = shinfo->nr_frags;
  676. /* Skip first skb fragment if it is on same page as header fragment. */
  677. start = (frag_get_pending_idx(&shinfo->frags[0]) == pending_idx);
  678. for (shinfo->nr_frags = start; shinfo->nr_frags < nr_slots;
  679. shinfo->nr_frags++, txp++, gop++) {
  680. index = pending_index(queue->pending_cons++);
  681. pending_idx = queue->pending_ring[index];
  682. xenvif_tx_create_map_op(queue, pending_idx, txp, gop);
  683. frag_set_pending_idx(&frags[shinfo->nr_frags], pending_idx);
  684. }
  685. if (frag_overflow) {
  686. struct sk_buff *nskb = xenvif_alloc_skb(0);
  687. if (unlikely(nskb == NULL)) {
  688. if (net_ratelimit())
  689. netdev_err(queue->vif->dev,
  690. "Can't allocate the frag_list skb.\n");
  691. return NULL;
  692. }
  693. shinfo = skb_shinfo(nskb);
  694. frags = shinfo->frags;
  695. for (shinfo->nr_frags = 0; shinfo->nr_frags < frag_overflow;
  696. shinfo->nr_frags++, txp++, gop++) {
  697. index = pending_index(queue->pending_cons++);
  698. pending_idx = queue->pending_ring[index];
  699. xenvif_tx_create_map_op(queue, pending_idx, txp, gop);
  700. frag_set_pending_idx(&frags[shinfo->nr_frags],
  701. pending_idx);
  702. }
  703. skb_shinfo(skb)->frag_list = nskb;
  704. }
  705. return gop;
  706. }
  707. static inline void xenvif_grant_handle_set(struct xenvif_queue *queue,
  708. u16 pending_idx,
  709. grant_handle_t handle)
  710. {
  711. if (unlikely(queue->grant_tx_handle[pending_idx] !=
  712. NETBACK_INVALID_HANDLE)) {
  713. netdev_err(queue->vif->dev,
  714. "Trying to overwrite active handle! pending_idx: %x\n",
  715. pending_idx);
  716. BUG();
  717. }
  718. queue->grant_tx_handle[pending_idx] = handle;
  719. }
  720. static inline void xenvif_grant_handle_reset(struct xenvif_queue *queue,
  721. u16 pending_idx)
  722. {
  723. if (unlikely(queue->grant_tx_handle[pending_idx] ==
  724. NETBACK_INVALID_HANDLE)) {
  725. netdev_err(queue->vif->dev,
  726. "Trying to unmap invalid handle! pending_idx: %x\n",
  727. pending_idx);
  728. BUG();
  729. }
  730. queue->grant_tx_handle[pending_idx] = NETBACK_INVALID_HANDLE;
  731. }
  732. static int xenvif_tx_check_gop(struct xenvif_queue *queue,
  733. struct sk_buff *skb,
  734. struct gnttab_map_grant_ref **gopp_map,
  735. struct gnttab_copy **gopp_copy)
  736. {
  737. struct gnttab_map_grant_ref *gop_map = *gopp_map;
  738. u16 pending_idx = XENVIF_TX_CB(skb)->pending_idx;
  739. /* This always points to the shinfo of the skb being checked, which
  740. * could be either the first or the one on the frag_list
  741. */
  742. struct skb_shared_info *shinfo = skb_shinfo(skb);
  743. /* If this is non-NULL, we are currently checking the frag_list skb, and
  744. * this points to the shinfo of the first one
  745. */
  746. struct skb_shared_info *first_shinfo = NULL;
  747. int nr_frags = shinfo->nr_frags;
  748. const bool sharedslot = nr_frags &&
  749. frag_get_pending_idx(&shinfo->frags[0]) == pending_idx;
  750. int i, err;
  751. /* Check status of header. */
  752. err = (*gopp_copy)->status;
  753. if (unlikely(err)) {
  754. if (net_ratelimit())
  755. netdev_dbg(queue->vif->dev,
  756. "Grant copy of header failed! status: %d pending_idx: %u ref: %u\n",
  757. (*gopp_copy)->status,
  758. pending_idx,
  759. (*gopp_copy)->source.u.ref);
  760. /* The first frag might still have this slot mapped */
  761. if (!sharedslot)
  762. xenvif_idx_release(queue, pending_idx,
  763. XEN_NETIF_RSP_ERROR);
  764. }
  765. (*gopp_copy)++;
  766. check_frags:
  767. for (i = 0; i < nr_frags; i++, gop_map++) {
  768. int j, newerr;
  769. pending_idx = frag_get_pending_idx(&shinfo->frags[i]);
  770. /* Check error status: if okay then remember grant handle. */
  771. newerr = gop_map->status;
  772. if (likely(!newerr)) {
  773. xenvif_grant_handle_set(queue,
  774. pending_idx,
  775. gop_map->handle);
  776. /* Had a previous error? Invalidate this fragment. */
  777. if (unlikely(err)) {
  778. xenvif_idx_unmap(queue, pending_idx);
  779. /* If the mapping of the first frag was OK, but
  780. * the header's copy failed, and they are
  781. * sharing a slot, send an error
  782. */
  783. if (i == 0 && sharedslot)
  784. xenvif_idx_release(queue, pending_idx,
  785. XEN_NETIF_RSP_ERROR);
  786. else
  787. xenvif_idx_release(queue, pending_idx,
  788. XEN_NETIF_RSP_OKAY);
  789. }
  790. continue;
  791. }
  792. /* Error on this fragment: respond to client with an error. */
  793. if (net_ratelimit())
  794. netdev_dbg(queue->vif->dev,
  795. "Grant map of %d. frag failed! status: %d pending_idx: %u ref: %u\n",
  796. i,
  797. gop_map->status,
  798. pending_idx,
  799. gop_map->ref);
  800. xenvif_idx_release(queue, pending_idx, XEN_NETIF_RSP_ERROR);
  801. /* Not the first error? Preceding frags already invalidated. */
  802. if (err)
  803. continue;
  804. /* First error: if the header haven't shared a slot with the
  805. * first frag, release it as well.
  806. */
  807. if (!sharedslot)
  808. xenvif_idx_release(queue,
  809. XENVIF_TX_CB(skb)->pending_idx,
  810. XEN_NETIF_RSP_OKAY);
  811. /* Invalidate preceding fragments of this skb. */
  812. for (j = 0; j < i; j++) {
  813. pending_idx = frag_get_pending_idx(&shinfo->frags[j]);
  814. xenvif_idx_unmap(queue, pending_idx);
  815. xenvif_idx_release(queue, pending_idx,
  816. XEN_NETIF_RSP_OKAY);
  817. }
  818. /* And if we found the error while checking the frag_list, unmap
  819. * the first skb's frags
  820. */
  821. if (first_shinfo) {
  822. for (j = 0; j < first_shinfo->nr_frags; j++) {
  823. pending_idx = frag_get_pending_idx(&first_shinfo->frags[j]);
  824. xenvif_idx_unmap(queue, pending_idx);
  825. xenvif_idx_release(queue, pending_idx,
  826. XEN_NETIF_RSP_OKAY);
  827. }
  828. }
  829. /* Remember the error: invalidate all subsequent fragments. */
  830. err = newerr;
  831. }
  832. if (skb_has_frag_list(skb) && !first_shinfo) {
  833. first_shinfo = skb_shinfo(skb);
  834. shinfo = skb_shinfo(skb_shinfo(skb)->frag_list);
  835. nr_frags = shinfo->nr_frags;
  836. goto check_frags;
  837. }
  838. *gopp_map = gop_map;
  839. return err;
  840. }
  841. static void xenvif_fill_frags(struct xenvif_queue *queue, struct sk_buff *skb)
  842. {
  843. struct skb_shared_info *shinfo = skb_shinfo(skb);
  844. int nr_frags = shinfo->nr_frags;
  845. int i;
  846. u16 prev_pending_idx = INVALID_PENDING_IDX;
  847. for (i = 0; i < nr_frags; i++) {
  848. skb_frag_t *frag = shinfo->frags + i;
  849. struct xen_netif_tx_request *txp;
  850. struct page *page;
  851. u16 pending_idx;
  852. pending_idx = frag_get_pending_idx(frag);
  853. /* If this is not the first frag, chain it to the previous*/
  854. if (prev_pending_idx == INVALID_PENDING_IDX)
  855. skb_shinfo(skb)->destructor_arg =
  856. &callback_param(queue, pending_idx);
  857. else
  858. callback_param(queue, prev_pending_idx).ctx =
  859. &callback_param(queue, pending_idx);
  860. callback_param(queue, pending_idx).ctx = NULL;
  861. prev_pending_idx = pending_idx;
  862. txp = &queue->pending_tx_info[pending_idx].req;
  863. page = virt_to_page(idx_to_kaddr(queue, pending_idx));
  864. __skb_fill_page_desc(skb, i, page, txp->offset, txp->size);
  865. skb->len += txp->size;
  866. skb->data_len += txp->size;
  867. skb->truesize += txp->size;
  868. /* Take an extra reference to offset network stack's put_page */
  869. get_page(queue->mmap_pages[pending_idx]);
  870. }
  871. }
  872. static int xenvif_get_extras(struct xenvif_queue *queue,
  873. struct xen_netif_extra_info *extras,
  874. int work_to_do)
  875. {
  876. struct xen_netif_extra_info extra;
  877. RING_IDX cons = queue->tx.req_cons;
  878. do {
  879. if (unlikely(work_to_do-- <= 0)) {
  880. netdev_err(queue->vif->dev, "Missing extra info\n");
  881. xenvif_fatal_tx_err(queue->vif);
  882. return -EBADR;
  883. }
  884. memcpy(&extra, RING_GET_REQUEST(&queue->tx, cons),
  885. sizeof(extra));
  886. if (unlikely(!extra.type ||
  887. extra.type >= XEN_NETIF_EXTRA_TYPE_MAX)) {
  888. queue->tx.req_cons = ++cons;
  889. netdev_err(queue->vif->dev,
  890. "Invalid extra type: %d\n", extra.type);
  891. xenvif_fatal_tx_err(queue->vif);
  892. return -EINVAL;
  893. }
  894. memcpy(&extras[extra.type - 1], &extra, sizeof(extra));
  895. queue->tx.req_cons = ++cons;
  896. } while (extra.flags & XEN_NETIF_EXTRA_FLAG_MORE);
  897. return work_to_do;
  898. }
  899. static int xenvif_set_skb_gso(struct xenvif *vif,
  900. struct sk_buff *skb,
  901. struct xen_netif_extra_info *gso)
  902. {
  903. if (!gso->u.gso.size) {
  904. netdev_err(vif->dev, "GSO size must not be zero.\n");
  905. xenvif_fatal_tx_err(vif);
  906. return -EINVAL;
  907. }
  908. switch (gso->u.gso.type) {
  909. case XEN_NETIF_GSO_TYPE_TCPV4:
  910. skb_shinfo(skb)->gso_type = SKB_GSO_TCPV4;
  911. break;
  912. case XEN_NETIF_GSO_TYPE_TCPV6:
  913. skb_shinfo(skb)->gso_type = SKB_GSO_TCPV6;
  914. break;
  915. default:
  916. netdev_err(vif->dev, "Bad GSO type %d.\n", gso->u.gso.type);
  917. xenvif_fatal_tx_err(vif);
  918. return -EINVAL;
  919. }
  920. skb_shinfo(skb)->gso_size = gso->u.gso.size;
  921. /* gso_segs will be calculated later */
  922. return 0;
  923. }
  924. static int checksum_setup(struct xenvif_queue *queue, struct sk_buff *skb)
  925. {
  926. bool recalculate_partial_csum = false;
  927. /* A GSO SKB must be CHECKSUM_PARTIAL. However some buggy
  928. * peers can fail to set NETRXF_csum_blank when sending a GSO
  929. * frame. In this case force the SKB to CHECKSUM_PARTIAL and
  930. * recalculate the partial checksum.
  931. */
  932. if (skb->ip_summed != CHECKSUM_PARTIAL && skb_is_gso(skb)) {
  933. queue->stats.rx_gso_checksum_fixup++;
  934. skb->ip_summed = CHECKSUM_PARTIAL;
  935. recalculate_partial_csum = true;
  936. }
  937. /* A non-CHECKSUM_PARTIAL SKB does not require setup. */
  938. if (skb->ip_summed != CHECKSUM_PARTIAL)
  939. return 0;
  940. return skb_checksum_setup(skb, recalculate_partial_csum);
  941. }
  942. static bool tx_credit_exceeded(struct xenvif_queue *queue, unsigned size)
  943. {
  944. u64 now = get_jiffies_64();
  945. u64 next_credit = queue->credit_window_start +
  946. msecs_to_jiffies(queue->credit_usec / 1000);
  947. /* Timer could already be pending in rare cases. */
  948. if (timer_pending(&queue->credit_timeout))
  949. return true;
  950. /* Passed the point where we can replenish credit? */
  951. if (time_after_eq64(now, next_credit)) {
  952. queue->credit_window_start = now;
  953. tx_add_credit(queue);
  954. }
  955. /* Still too big to send right now? Set a callback. */
  956. if (size > queue->remaining_credit) {
  957. queue->credit_timeout.data =
  958. (unsigned long)queue;
  959. mod_timer(&queue->credit_timeout,
  960. next_credit);
  961. queue->credit_window_start = next_credit;
  962. return true;
  963. }
  964. return false;
  965. }
  966. static void xenvif_tx_build_gops(struct xenvif_queue *queue,
  967. int budget,
  968. unsigned *copy_ops,
  969. unsigned *map_ops)
  970. {
  971. struct gnttab_map_grant_ref *gop = queue->tx_map_ops, *request_gop;
  972. struct sk_buff *skb;
  973. int ret;
  974. while (skb_queue_len(&queue->tx_queue) < budget) {
  975. struct xen_netif_tx_request txreq;
  976. struct xen_netif_tx_request txfrags[XEN_NETBK_LEGACY_SLOTS_MAX];
  977. struct xen_netif_extra_info extras[XEN_NETIF_EXTRA_TYPE_MAX-1];
  978. u16 pending_idx;
  979. RING_IDX idx;
  980. int work_to_do;
  981. unsigned int data_len;
  982. pending_ring_idx_t index;
  983. if (queue->tx.sring->req_prod - queue->tx.req_cons >
  984. XEN_NETIF_TX_RING_SIZE) {
  985. netdev_err(queue->vif->dev,
  986. "Impossible number of requests. "
  987. "req_prod %d, req_cons %d, size %ld\n",
  988. queue->tx.sring->req_prod, queue->tx.req_cons,
  989. XEN_NETIF_TX_RING_SIZE);
  990. xenvif_fatal_tx_err(queue->vif);
  991. break;
  992. }
  993. work_to_do = RING_HAS_UNCONSUMED_REQUESTS(&queue->tx);
  994. if (!work_to_do)
  995. break;
  996. idx = queue->tx.req_cons;
  997. rmb(); /* Ensure that we see the request before we copy it. */
  998. memcpy(&txreq, RING_GET_REQUEST(&queue->tx, idx), sizeof(txreq));
  999. /* Credit-based scheduling. */
  1000. if (txreq.size > queue->remaining_credit &&
  1001. tx_credit_exceeded(queue, txreq.size))
  1002. break;
  1003. queue->remaining_credit -= txreq.size;
  1004. work_to_do--;
  1005. queue->tx.req_cons = ++idx;
  1006. memset(extras, 0, sizeof(extras));
  1007. if (txreq.flags & XEN_NETTXF_extra_info) {
  1008. work_to_do = xenvif_get_extras(queue, extras,
  1009. work_to_do);
  1010. idx = queue->tx.req_cons;
  1011. if (unlikely(work_to_do < 0))
  1012. break;
  1013. }
  1014. ret = xenvif_count_requests(queue, &txreq, txfrags, work_to_do);
  1015. if (unlikely(ret < 0))
  1016. break;
  1017. idx += ret;
  1018. if (unlikely(txreq.size < ETH_HLEN)) {
  1019. netdev_dbg(queue->vif->dev,
  1020. "Bad packet size: %d\n", txreq.size);
  1021. xenvif_tx_err(queue, &txreq, idx);
  1022. break;
  1023. }
  1024. /* No crossing a page as the payload mustn't fragment. */
  1025. if (unlikely((txreq.offset + txreq.size) > PAGE_SIZE)) {
  1026. netdev_err(queue->vif->dev,
  1027. "txreq.offset: %x, size: %u, end: %lu\n",
  1028. txreq.offset, txreq.size,
  1029. (unsigned long)(txreq.offset&~PAGE_MASK) + txreq.size);
  1030. xenvif_fatal_tx_err(queue->vif);
  1031. break;
  1032. }
  1033. index = pending_index(queue->pending_cons);
  1034. pending_idx = queue->pending_ring[index];
  1035. data_len = (txreq.size > XEN_NETBACK_TX_COPY_LEN &&
  1036. ret < XEN_NETBK_LEGACY_SLOTS_MAX) ?
  1037. XEN_NETBACK_TX_COPY_LEN : txreq.size;
  1038. skb = xenvif_alloc_skb(data_len);
  1039. if (unlikely(skb == NULL)) {
  1040. netdev_dbg(queue->vif->dev,
  1041. "Can't allocate a skb in start_xmit.\n");
  1042. xenvif_tx_err(queue, &txreq, idx);
  1043. break;
  1044. }
  1045. if (extras[XEN_NETIF_EXTRA_TYPE_GSO - 1].type) {
  1046. struct xen_netif_extra_info *gso;
  1047. gso = &extras[XEN_NETIF_EXTRA_TYPE_GSO - 1];
  1048. if (xenvif_set_skb_gso(queue->vif, skb, gso)) {
  1049. /* Failure in xenvif_set_skb_gso is fatal. */
  1050. kfree_skb(skb);
  1051. break;
  1052. }
  1053. }
  1054. XENVIF_TX_CB(skb)->pending_idx = pending_idx;
  1055. __skb_put(skb, data_len);
  1056. queue->tx_copy_ops[*copy_ops].source.u.ref = txreq.gref;
  1057. queue->tx_copy_ops[*copy_ops].source.domid = queue->vif->domid;
  1058. queue->tx_copy_ops[*copy_ops].source.offset = txreq.offset;
  1059. queue->tx_copy_ops[*copy_ops].dest.u.gmfn =
  1060. virt_to_mfn(skb->data);
  1061. queue->tx_copy_ops[*copy_ops].dest.domid = DOMID_SELF;
  1062. queue->tx_copy_ops[*copy_ops].dest.offset =
  1063. offset_in_page(skb->data);
  1064. queue->tx_copy_ops[*copy_ops].len = data_len;
  1065. queue->tx_copy_ops[*copy_ops].flags = GNTCOPY_source_gref;
  1066. (*copy_ops)++;
  1067. skb_shinfo(skb)->nr_frags = ret;
  1068. if (data_len < txreq.size) {
  1069. skb_shinfo(skb)->nr_frags++;
  1070. frag_set_pending_idx(&skb_shinfo(skb)->frags[0],
  1071. pending_idx);
  1072. xenvif_tx_create_map_op(queue, pending_idx, &txreq, gop);
  1073. gop++;
  1074. } else {
  1075. frag_set_pending_idx(&skb_shinfo(skb)->frags[0],
  1076. INVALID_PENDING_IDX);
  1077. memcpy(&queue->pending_tx_info[pending_idx].req, &txreq,
  1078. sizeof(txreq));
  1079. }
  1080. queue->pending_cons++;
  1081. request_gop = xenvif_get_requests(queue, skb, txfrags, gop);
  1082. if (request_gop == NULL) {
  1083. kfree_skb(skb);
  1084. xenvif_tx_err(queue, &txreq, idx);
  1085. break;
  1086. }
  1087. gop = request_gop;
  1088. __skb_queue_tail(&queue->tx_queue, skb);
  1089. queue->tx.req_cons = idx;
  1090. if (((gop-queue->tx_map_ops) >= ARRAY_SIZE(queue->tx_map_ops)) ||
  1091. (*copy_ops >= ARRAY_SIZE(queue->tx_copy_ops)))
  1092. break;
  1093. }
  1094. (*map_ops) = gop - queue->tx_map_ops;
  1095. return;
  1096. }
  1097. /* Consolidate skb with a frag_list into a brand new one with local pages on
  1098. * frags. Returns 0 or -ENOMEM if can't allocate new pages.
  1099. */
  1100. static int xenvif_handle_frag_list(struct xenvif_queue *queue, struct sk_buff *skb)
  1101. {
  1102. unsigned int offset = skb_headlen(skb);
  1103. skb_frag_t frags[MAX_SKB_FRAGS];
  1104. int i, f;
  1105. struct ubuf_info *uarg;
  1106. struct sk_buff *nskb = skb_shinfo(skb)->frag_list;
  1107. queue->stats.tx_zerocopy_sent += 2;
  1108. queue->stats.tx_frag_overflow++;
  1109. xenvif_fill_frags(queue, nskb);
  1110. /* Subtract frags size, we will correct it later */
  1111. skb->truesize -= skb->data_len;
  1112. skb->len += nskb->len;
  1113. skb->data_len += nskb->len;
  1114. /* create a brand new frags array and coalesce there */
  1115. for (i = 0; offset < skb->len; i++) {
  1116. struct page *page;
  1117. unsigned int len;
  1118. BUG_ON(i >= MAX_SKB_FRAGS);
  1119. page = alloc_page(GFP_ATOMIC);
  1120. if (!page) {
  1121. int j;
  1122. skb->truesize += skb->data_len;
  1123. for (j = 0; j < i; j++)
  1124. put_page(frags[j].page.p);
  1125. return -ENOMEM;
  1126. }
  1127. if (offset + PAGE_SIZE < skb->len)
  1128. len = PAGE_SIZE;
  1129. else
  1130. len = skb->len - offset;
  1131. if (skb_copy_bits(skb, offset, page_address(page), len))
  1132. BUG();
  1133. offset += len;
  1134. frags[i].page.p = page;
  1135. frags[i].page_offset = 0;
  1136. skb_frag_size_set(&frags[i], len);
  1137. }
  1138. /* Copied all the bits from the frag list -- free it. */
  1139. skb_frag_list_init(skb);
  1140. xenvif_skb_zerocopy_prepare(queue, nskb);
  1141. kfree_skb(nskb);
  1142. /* Release all the original (foreign) frags. */
  1143. for (f = 0; f < skb_shinfo(skb)->nr_frags; f++)
  1144. skb_frag_unref(skb, f);
  1145. uarg = skb_shinfo(skb)->destructor_arg;
  1146. /* increase inflight counter to offset decrement in callback */
  1147. atomic_inc(&queue->inflight_packets);
  1148. uarg->callback(uarg, true);
  1149. skb_shinfo(skb)->destructor_arg = NULL;
  1150. /* Fill the skb with the new (local) frags. */
  1151. memcpy(skb_shinfo(skb)->frags, frags, i * sizeof(skb_frag_t));
  1152. skb_shinfo(skb)->nr_frags = i;
  1153. skb->truesize += i * PAGE_SIZE;
  1154. return 0;
  1155. }
  1156. static int xenvif_tx_submit(struct xenvif_queue *queue)
  1157. {
  1158. struct gnttab_map_grant_ref *gop_map = queue->tx_map_ops;
  1159. struct gnttab_copy *gop_copy = queue->tx_copy_ops;
  1160. struct sk_buff *skb;
  1161. int work_done = 0;
  1162. while ((skb = __skb_dequeue(&queue->tx_queue)) != NULL) {
  1163. struct xen_netif_tx_request *txp;
  1164. u16 pending_idx;
  1165. unsigned data_len;
  1166. pending_idx = XENVIF_TX_CB(skb)->pending_idx;
  1167. txp = &queue->pending_tx_info[pending_idx].req;
  1168. /* Check the remap error code. */
  1169. if (unlikely(xenvif_tx_check_gop(queue, skb, &gop_map, &gop_copy))) {
  1170. /* If there was an error, xenvif_tx_check_gop is
  1171. * expected to release all the frags which were mapped,
  1172. * so kfree_skb shouldn't do it again
  1173. */
  1174. skb_shinfo(skb)->nr_frags = 0;
  1175. if (skb_has_frag_list(skb)) {
  1176. struct sk_buff *nskb =
  1177. skb_shinfo(skb)->frag_list;
  1178. skb_shinfo(nskb)->nr_frags = 0;
  1179. }
  1180. kfree_skb(skb);
  1181. continue;
  1182. }
  1183. data_len = skb->len;
  1184. callback_param(queue, pending_idx).ctx = NULL;
  1185. if (data_len < txp->size) {
  1186. /* Append the packet payload as a fragment. */
  1187. txp->offset += data_len;
  1188. txp->size -= data_len;
  1189. } else {
  1190. /* Schedule a response immediately. */
  1191. xenvif_idx_release(queue, pending_idx,
  1192. XEN_NETIF_RSP_OKAY);
  1193. }
  1194. if (txp->flags & XEN_NETTXF_csum_blank)
  1195. skb->ip_summed = CHECKSUM_PARTIAL;
  1196. else if (txp->flags & XEN_NETTXF_data_validated)
  1197. skb->ip_summed = CHECKSUM_UNNECESSARY;
  1198. xenvif_fill_frags(queue, skb);
  1199. if (unlikely(skb_has_frag_list(skb))) {
  1200. if (xenvif_handle_frag_list(queue, skb)) {
  1201. if (net_ratelimit())
  1202. netdev_err(queue->vif->dev,
  1203. "Not enough memory to consolidate frag_list!\n");
  1204. xenvif_skb_zerocopy_prepare(queue, skb);
  1205. kfree_skb(skb);
  1206. continue;
  1207. }
  1208. }
  1209. skb->dev = queue->vif->dev;
  1210. skb->protocol = eth_type_trans(skb, skb->dev);
  1211. skb_reset_network_header(skb);
  1212. if (checksum_setup(queue, skb)) {
  1213. netdev_dbg(queue->vif->dev,
  1214. "Can't setup checksum in net_tx_action\n");
  1215. /* We have to set this flag to trigger the callback */
  1216. if (skb_shinfo(skb)->destructor_arg)
  1217. xenvif_skb_zerocopy_prepare(queue, skb);
  1218. kfree_skb(skb);
  1219. continue;
  1220. }
  1221. skb_probe_transport_header(skb, 0);
  1222. /* If the packet is GSO then we will have just set up the
  1223. * transport header offset in checksum_setup so it's now
  1224. * straightforward to calculate gso_segs.
  1225. */
  1226. if (skb_is_gso(skb)) {
  1227. int mss = skb_shinfo(skb)->gso_size;
  1228. int hdrlen = skb_transport_header(skb) -
  1229. skb_mac_header(skb) +
  1230. tcp_hdrlen(skb);
  1231. skb_shinfo(skb)->gso_segs =
  1232. DIV_ROUND_UP(skb->len - hdrlen, mss);
  1233. }
  1234. queue->stats.rx_bytes += skb->len;
  1235. queue->stats.rx_packets++;
  1236. work_done++;
  1237. /* Set this flag right before netif_receive_skb, otherwise
  1238. * someone might think this packet already left netback, and
  1239. * do a skb_copy_ubufs while we are still in control of the
  1240. * skb. E.g. the __pskb_pull_tail earlier can do such thing.
  1241. */
  1242. if (skb_shinfo(skb)->destructor_arg) {
  1243. xenvif_skb_zerocopy_prepare(queue, skb);
  1244. queue->stats.tx_zerocopy_sent++;
  1245. }
  1246. netif_receive_skb(skb);
  1247. }
  1248. return work_done;
  1249. }
  1250. void xenvif_zerocopy_callback(struct ubuf_info *ubuf, bool zerocopy_success)
  1251. {
  1252. unsigned long flags;
  1253. pending_ring_idx_t index;
  1254. struct xenvif_queue *queue = ubuf_to_queue(ubuf);
  1255. /* This is the only place where we grab this lock, to protect callbacks
  1256. * from each other.
  1257. */
  1258. spin_lock_irqsave(&queue->callback_lock, flags);
  1259. do {
  1260. u16 pending_idx = ubuf->desc;
  1261. ubuf = (struct ubuf_info *) ubuf->ctx;
  1262. BUG_ON(queue->dealloc_prod - queue->dealloc_cons >=
  1263. MAX_PENDING_REQS);
  1264. index = pending_index(queue->dealloc_prod);
  1265. queue->dealloc_ring[index] = pending_idx;
  1266. /* Sync with xenvif_tx_dealloc_action:
  1267. * insert idx then incr producer.
  1268. */
  1269. smp_wmb();
  1270. queue->dealloc_prod++;
  1271. } while (ubuf);
  1272. wake_up(&queue->dealloc_wq);
  1273. spin_unlock_irqrestore(&queue->callback_lock, flags);
  1274. if (likely(zerocopy_success))
  1275. queue->stats.tx_zerocopy_success++;
  1276. else
  1277. queue->stats.tx_zerocopy_fail++;
  1278. xenvif_skb_zerocopy_complete(queue);
  1279. }
  1280. static inline void xenvif_tx_dealloc_action(struct xenvif_queue *queue)
  1281. {
  1282. struct gnttab_unmap_grant_ref *gop;
  1283. pending_ring_idx_t dc, dp;
  1284. u16 pending_idx, pending_idx_release[MAX_PENDING_REQS];
  1285. unsigned int i = 0;
  1286. dc = queue->dealloc_cons;
  1287. gop = queue->tx_unmap_ops;
  1288. /* Free up any grants we have finished using */
  1289. do {
  1290. dp = queue->dealloc_prod;
  1291. /* Ensure we see all indices enqueued by all
  1292. * xenvif_zerocopy_callback().
  1293. */
  1294. smp_rmb();
  1295. while (dc != dp) {
  1296. BUG_ON(gop - queue->tx_unmap_ops > MAX_PENDING_REQS);
  1297. pending_idx =
  1298. queue->dealloc_ring[pending_index(dc++)];
  1299. pending_idx_release[gop-queue->tx_unmap_ops] =
  1300. pending_idx;
  1301. queue->pages_to_unmap[gop-queue->tx_unmap_ops] =
  1302. queue->mmap_pages[pending_idx];
  1303. gnttab_set_unmap_op(gop,
  1304. idx_to_kaddr(queue, pending_idx),
  1305. GNTMAP_host_map,
  1306. queue->grant_tx_handle[pending_idx]);
  1307. xenvif_grant_handle_reset(queue, pending_idx);
  1308. ++gop;
  1309. }
  1310. } while (dp != queue->dealloc_prod);
  1311. queue->dealloc_cons = dc;
  1312. if (gop - queue->tx_unmap_ops > 0) {
  1313. int ret;
  1314. ret = gnttab_unmap_refs(queue->tx_unmap_ops,
  1315. NULL,
  1316. queue->pages_to_unmap,
  1317. gop - queue->tx_unmap_ops);
  1318. if (ret) {
  1319. netdev_err(queue->vif->dev, "Unmap fail: nr_ops %tx ret %d\n",
  1320. gop - queue->tx_unmap_ops, ret);
  1321. for (i = 0; i < gop - queue->tx_unmap_ops; ++i) {
  1322. if (gop[i].status != GNTST_okay)
  1323. netdev_err(queue->vif->dev,
  1324. " host_addr: %llx handle: %x status: %d\n",
  1325. gop[i].host_addr,
  1326. gop[i].handle,
  1327. gop[i].status);
  1328. }
  1329. BUG();
  1330. }
  1331. }
  1332. for (i = 0; i < gop - queue->tx_unmap_ops; ++i)
  1333. xenvif_idx_release(queue, pending_idx_release[i],
  1334. XEN_NETIF_RSP_OKAY);
  1335. }
  1336. /* Called after netfront has transmitted */
  1337. int xenvif_tx_action(struct xenvif_queue *queue, int budget)
  1338. {
  1339. unsigned nr_mops, nr_cops = 0;
  1340. int work_done, ret;
  1341. if (unlikely(!tx_work_todo(queue)))
  1342. return 0;
  1343. xenvif_tx_build_gops(queue, budget, &nr_cops, &nr_mops);
  1344. if (nr_cops == 0)
  1345. return 0;
  1346. gnttab_batch_copy(queue->tx_copy_ops, nr_cops);
  1347. if (nr_mops != 0) {
  1348. ret = gnttab_map_refs(queue->tx_map_ops,
  1349. NULL,
  1350. queue->pages_to_map,
  1351. nr_mops);
  1352. BUG_ON(ret);
  1353. }
  1354. work_done = xenvif_tx_submit(queue);
  1355. return work_done;
  1356. }
  1357. static void xenvif_idx_release(struct xenvif_queue *queue, u16 pending_idx,
  1358. u8 status)
  1359. {
  1360. struct pending_tx_info *pending_tx_info;
  1361. pending_ring_idx_t index;
  1362. unsigned long flags;
  1363. pending_tx_info = &queue->pending_tx_info[pending_idx];
  1364. spin_lock_irqsave(&queue->response_lock, flags);
  1365. make_tx_response(queue, &pending_tx_info->req, status);
  1366. /* Release the pending index before pusing the Tx response so
  1367. * its available before a new Tx request is pushed by the
  1368. * frontend.
  1369. */
  1370. index = pending_index(queue->pending_prod++);
  1371. queue->pending_ring[index] = pending_idx;
  1372. push_tx_responses(queue);
  1373. spin_unlock_irqrestore(&queue->response_lock, flags);
  1374. }
  1375. static void make_tx_response(struct xenvif_queue *queue,
  1376. struct xen_netif_tx_request *txp,
  1377. s8 st)
  1378. {
  1379. RING_IDX i = queue->tx.rsp_prod_pvt;
  1380. struct xen_netif_tx_response *resp;
  1381. resp = RING_GET_RESPONSE(&queue->tx, i);
  1382. resp->id = txp->id;
  1383. resp->status = st;
  1384. if (txp->flags & XEN_NETTXF_extra_info)
  1385. RING_GET_RESPONSE(&queue->tx, ++i)->status = XEN_NETIF_RSP_NULL;
  1386. queue->tx.rsp_prod_pvt = ++i;
  1387. }
  1388. static void push_tx_responses(struct xenvif_queue *queue)
  1389. {
  1390. int notify;
  1391. RING_PUSH_RESPONSES_AND_CHECK_NOTIFY(&queue->tx, notify);
  1392. if (notify)
  1393. notify_remote_via_irq(queue->tx_irq);
  1394. }
  1395. static struct xen_netif_rx_response *make_rx_response(struct xenvif_queue *queue,
  1396. u16 id,
  1397. s8 st,
  1398. u16 offset,
  1399. u16 size,
  1400. u16 flags)
  1401. {
  1402. RING_IDX i = queue->rx.rsp_prod_pvt;
  1403. struct xen_netif_rx_response *resp;
  1404. resp = RING_GET_RESPONSE(&queue->rx, i);
  1405. resp->offset = offset;
  1406. resp->flags = flags;
  1407. resp->id = id;
  1408. resp->status = (s16)size;
  1409. if (st < 0)
  1410. resp->status = (s16)st;
  1411. queue->rx.rsp_prod_pvt = ++i;
  1412. return resp;
  1413. }
  1414. void xenvif_idx_unmap(struct xenvif_queue *queue, u16 pending_idx)
  1415. {
  1416. int ret;
  1417. struct gnttab_unmap_grant_ref tx_unmap_op;
  1418. gnttab_set_unmap_op(&tx_unmap_op,
  1419. idx_to_kaddr(queue, pending_idx),
  1420. GNTMAP_host_map,
  1421. queue->grant_tx_handle[pending_idx]);
  1422. xenvif_grant_handle_reset(queue, pending_idx);
  1423. ret = gnttab_unmap_refs(&tx_unmap_op, NULL,
  1424. &queue->mmap_pages[pending_idx], 1);
  1425. if (ret) {
  1426. netdev_err(queue->vif->dev,
  1427. "Unmap fail: ret: %d pending_idx: %d host_addr: %llx handle: %x status: %d\n",
  1428. ret,
  1429. pending_idx,
  1430. tx_unmap_op.host_addr,
  1431. tx_unmap_op.handle,
  1432. tx_unmap_op.status);
  1433. BUG();
  1434. }
  1435. }
  1436. static inline int tx_work_todo(struct xenvif_queue *queue)
  1437. {
  1438. if (likely(RING_HAS_UNCONSUMED_REQUESTS(&queue->tx)))
  1439. return 1;
  1440. return 0;
  1441. }
  1442. static inline bool tx_dealloc_work_todo(struct xenvif_queue *queue)
  1443. {
  1444. return queue->dealloc_cons != queue->dealloc_prod;
  1445. }
  1446. void xenvif_unmap_frontend_rings(struct xenvif_queue *queue)
  1447. {
  1448. if (queue->tx.sring)
  1449. xenbus_unmap_ring_vfree(xenvif_to_xenbus_device(queue->vif),
  1450. queue->tx.sring);
  1451. if (queue->rx.sring)
  1452. xenbus_unmap_ring_vfree(xenvif_to_xenbus_device(queue->vif),
  1453. queue->rx.sring);
  1454. }
  1455. int xenvif_map_frontend_rings(struct xenvif_queue *queue,
  1456. grant_ref_t tx_ring_ref,
  1457. grant_ref_t rx_ring_ref)
  1458. {
  1459. void *addr;
  1460. struct xen_netif_tx_sring *txs;
  1461. struct xen_netif_rx_sring *rxs;
  1462. int err = -ENOMEM;
  1463. err = xenbus_map_ring_valloc(xenvif_to_xenbus_device(queue->vif),
  1464. &tx_ring_ref, 1, &addr);
  1465. if (err)
  1466. goto err;
  1467. txs = (struct xen_netif_tx_sring *)addr;
  1468. BACK_RING_INIT(&queue->tx, txs, PAGE_SIZE);
  1469. err = xenbus_map_ring_valloc(xenvif_to_xenbus_device(queue->vif),
  1470. &rx_ring_ref, 1, &addr);
  1471. if (err)
  1472. goto err;
  1473. rxs = (struct xen_netif_rx_sring *)addr;
  1474. BACK_RING_INIT(&queue->rx, rxs, PAGE_SIZE);
  1475. return 0;
  1476. err:
  1477. xenvif_unmap_frontend_rings(queue);
  1478. return err;
  1479. }
  1480. static void xenvif_queue_carrier_off(struct xenvif_queue *queue)
  1481. {
  1482. struct xenvif *vif = queue->vif;
  1483. queue->stalled = true;
  1484. /* At least one queue has stalled? Disable the carrier. */
  1485. spin_lock(&vif->lock);
  1486. if (vif->stalled_queues++ == 0) {
  1487. netdev_info(vif->dev, "Guest Rx stalled");
  1488. netif_carrier_off(vif->dev);
  1489. }
  1490. spin_unlock(&vif->lock);
  1491. }
  1492. static void xenvif_queue_carrier_on(struct xenvif_queue *queue)
  1493. {
  1494. struct xenvif *vif = queue->vif;
  1495. queue->last_rx_time = jiffies; /* Reset Rx stall detection. */
  1496. queue->stalled = false;
  1497. /* All queues are ready? Enable the carrier. */
  1498. spin_lock(&vif->lock);
  1499. if (--vif->stalled_queues == 0) {
  1500. netdev_info(vif->dev, "Guest Rx ready");
  1501. netif_carrier_on(vif->dev);
  1502. }
  1503. spin_unlock(&vif->lock);
  1504. }
  1505. static bool xenvif_rx_queue_stalled(struct xenvif_queue *queue)
  1506. {
  1507. RING_IDX prod, cons;
  1508. prod = queue->rx.sring->req_prod;
  1509. cons = queue->rx.req_cons;
  1510. return !queue->stalled
  1511. && prod - cons < XEN_NETBK_RX_SLOTS_MAX
  1512. && time_after(jiffies,
  1513. queue->last_rx_time + queue->vif->stall_timeout);
  1514. }
  1515. static bool xenvif_rx_queue_ready(struct xenvif_queue *queue)
  1516. {
  1517. RING_IDX prod, cons;
  1518. prod = queue->rx.sring->req_prod;
  1519. cons = queue->rx.req_cons;
  1520. return queue->stalled
  1521. && prod - cons >= XEN_NETBK_RX_SLOTS_MAX;
  1522. }
  1523. static bool xenvif_have_rx_work(struct xenvif_queue *queue)
  1524. {
  1525. return (!skb_queue_empty(&queue->rx_queue)
  1526. && xenvif_rx_ring_slots_available(queue, XEN_NETBK_RX_SLOTS_MAX))
  1527. || (queue->vif->stall_timeout &&
  1528. (xenvif_rx_queue_stalled(queue)
  1529. || xenvif_rx_queue_ready(queue)))
  1530. || kthread_should_stop()
  1531. || queue->vif->disabled;
  1532. }
  1533. static long xenvif_rx_queue_timeout(struct xenvif_queue *queue)
  1534. {
  1535. struct sk_buff *skb;
  1536. long timeout;
  1537. skb = skb_peek(&queue->rx_queue);
  1538. if (!skb)
  1539. return MAX_SCHEDULE_TIMEOUT;
  1540. timeout = XENVIF_RX_CB(skb)->expires - jiffies;
  1541. return timeout < 0 ? 0 : timeout;
  1542. }
  1543. /* Wait until the guest Rx thread has work.
  1544. *
  1545. * The timeout needs to be adjusted based on the current head of the
  1546. * queue (and not just the head at the beginning). In particular, if
  1547. * the queue is initially empty an infinite timeout is used and this
  1548. * needs to be reduced when a skb is queued.
  1549. *
  1550. * This cannot be done with wait_event_timeout() because it only
  1551. * calculates the timeout once.
  1552. */
  1553. static void xenvif_wait_for_rx_work(struct xenvif_queue *queue)
  1554. {
  1555. DEFINE_WAIT(wait);
  1556. if (xenvif_have_rx_work(queue))
  1557. return;
  1558. for (;;) {
  1559. long ret;
  1560. prepare_to_wait(&queue->wq, &wait, TASK_INTERRUPTIBLE);
  1561. if (xenvif_have_rx_work(queue))
  1562. break;
  1563. ret = schedule_timeout(xenvif_rx_queue_timeout(queue));
  1564. if (!ret)
  1565. break;
  1566. }
  1567. finish_wait(&queue->wq, &wait);
  1568. }
  1569. int xenvif_kthread_guest_rx(void *data)
  1570. {
  1571. struct xenvif_queue *queue = data;
  1572. struct xenvif *vif = queue->vif;
  1573. if (!vif->stall_timeout)
  1574. xenvif_queue_carrier_on(queue);
  1575. for (;;) {
  1576. xenvif_wait_for_rx_work(queue);
  1577. if (kthread_should_stop())
  1578. break;
  1579. /* This frontend is found to be rogue, disable it in
  1580. * kthread context. Currently this is only set when
  1581. * netback finds out frontend sends malformed packet,
  1582. * but we cannot disable the interface in softirq
  1583. * context so we defer it here, if this thread is
  1584. * associated with queue 0.
  1585. */
  1586. if (unlikely(vif->disabled && queue->id == 0)) {
  1587. xenvif_carrier_off(vif);
  1588. break;
  1589. }
  1590. if (!skb_queue_empty(&queue->rx_queue))
  1591. xenvif_rx_action(queue);
  1592. /* If the guest hasn't provided any Rx slots for a
  1593. * while it's probably not responsive, drop the
  1594. * carrier so packets are dropped earlier.
  1595. */
  1596. if (vif->stall_timeout) {
  1597. if (xenvif_rx_queue_stalled(queue))
  1598. xenvif_queue_carrier_off(queue);
  1599. else if (xenvif_rx_queue_ready(queue))
  1600. xenvif_queue_carrier_on(queue);
  1601. }
  1602. /* Queued packets may have foreign pages from other
  1603. * domains. These cannot be queued indefinitely as
  1604. * this would starve guests of grant refs and transmit
  1605. * slots.
  1606. */
  1607. xenvif_rx_queue_drop_expired(queue);
  1608. xenvif_rx_queue_maybe_wake(queue);
  1609. cond_resched();
  1610. }
  1611. /* Bin any remaining skbs */
  1612. xenvif_rx_queue_purge(queue);
  1613. return 0;
  1614. }
  1615. static bool xenvif_dealloc_kthread_should_stop(struct xenvif_queue *queue)
  1616. {
  1617. /* Dealloc thread must remain running until all inflight
  1618. * packets complete.
  1619. */
  1620. return kthread_should_stop() &&
  1621. !atomic_read(&queue->inflight_packets);
  1622. }
  1623. int xenvif_dealloc_kthread(void *data)
  1624. {
  1625. struct xenvif_queue *queue = data;
  1626. for (;;) {
  1627. wait_event_interruptible(queue->dealloc_wq,
  1628. tx_dealloc_work_todo(queue) ||
  1629. xenvif_dealloc_kthread_should_stop(queue));
  1630. if (xenvif_dealloc_kthread_should_stop(queue))
  1631. break;
  1632. xenvif_tx_dealloc_action(queue);
  1633. cond_resched();
  1634. }
  1635. /* Unmap anything remaining*/
  1636. if (tx_dealloc_work_todo(queue))
  1637. xenvif_tx_dealloc_action(queue);
  1638. return 0;
  1639. }
  1640. static int __init netback_init(void)
  1641. {
  1642. int rc = 0;
  1643. if (!xen_domain())
  1644. return -ENODEV;
  1645. /* Allow as many queues as there are CPUs, by default */
  1646. xenvif_max_queues = num_online_cpus();
  1647. if (fatal_skb_slots < XEN_NETBK_LEGACY_SLOTS_MAX) {
  1648. pr_info("fatal_skb_slots too small (%d), bump it to XEN_NETBK_LEGACY_SLOTS_MAX (%d)\n",
  1649. fatal_skb_slots, XEN_NETBK_LEGACY_SLOTS_MAX);
  1650. fatal_skb_slots = XEN_NETBK_LEGACY_SLOTS_MAX;
  1651. }
  1652. rc = xenvif_xenbus_init();
  1653. if (rc)
  1654. goto failed_init;
  1655. #ifdef CONFIG_DEBUG_FS
  1656. xen_netback_dbg_root = debugfs_create_dir("xen-netback", NULL);
  1657. if (IS_ERR_OR_NULL(xen_netback_dbg_root))
  1658. pr_warn("Init of debugfs returned %ld!\n",
  1659. PTR_ERR(xen_netback_dbg_root));
  1660. #endif /* CONFIG_DEBUG_FS */
  1661. return 0;
  1662. failed_init:
  1663. return rc;
  1664. }
  1665. module_init(netback_init);
  1666. static void __exit netback_fini(void)
  1667. {
  1668. #ifdef CONFIG_DEBUG_FS
  1669. if (!IS_ERR_OR_NULL(xen_netback_dbg_root))
  1670. debugfs_remove_recursive(xen_netback_dbg_root);
  1671. #endif /* CONFIG_DEBUG_FS */
  1672. xenvif_xenbus_fini();
  1673. }
  1674. module_exit(netback_fini);
  1675. MODULE_LICENSE("Dual BSD/GPL");
  1676. MODULE_ALIAS("xen-backend:vif");