gro.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815
  1. // SPDX-License-Identifier: GPL-2.0-or-later
  2. #include <net/gro.h>
  3. #include <net/dst_metadata.h>
  4. #include <net/busy_poll.h>
  5. #include <trace/events/net.h>
  6. #define MAX_GRO_SKBS 8
  7. /* This should be increased if a protocol with a bigger head is added. */
  8. #define GRO_MAX_HEAD (MAX_HEADER + 128)
  9. static DEFINE_SPINLOCK(offload_lock);
  10. static struct list_head offload_base __read_mostly = LIST_HEAD_INIT(offload_base);
  11. /* Maximum number of GRO_NORMAL skbs to batch up for list-RX */
  12. int gro_normal_batch __read_mostly = 8;
  13. /**
  14. * dev_add_offload - register offload handlers
  15. * @po: protocol offload declaration
  16. *
  17. * Add protocol offload handlers to the networking stack. The passed
  18. * &proto_offload is linked into kernel lists and may not be freed until
  19. * it has been removed from the kernel lists.
  20. *
  21. * This call does not sleep therefore it can not
  22. * guarantee all CPU's that are in middle of receiving packets
  23. * will see the new offload handlers (until the next received packet).
  24. */
  25. void dev_add_offload(struct packet_offload *po)
  26. {
  27. struct packet_offload *elem;
  28. spin_lock(&offload_lock);
  29. list_for_each_entry(elem, &offload_base, list) {
  30. if (po->priority < elem->priority)
  31. break;
  32. }
  33. list_add_rcu(&po->list, elem->list.prev);
  34. spin_unlock(&offload_lock);
  35. }
  36. EXPORT_SYMBOL(dev_add_offload);
  37. /**
  38. * __dev_remove_offload - remove offload handler
  39. * @po: packet offload declaration
  40. *
  41. * Remove a protocol offload handler that was previously added to the
  42. * kernel offload handlers by dev_add_offload(). The passed &offload_type
  43. * is removed from the kernel lists and can be freed or reused once this
  44. * function returns.
  45. *
  46. * The packet type might still be in use by receivers
  47. * and must not be freed until after all the CPU's have gone
  48. * through a quiescent state.
  49. */
  50. static void __dev_remove_offload(struct packet_offload *po)
  51. {
  52. struct list_head *head = &offload_base;
  53. struct packet_offload *po1;
  54. spin_lock(&offload_lock);
  55. list_for_each_entry(po1, head, list) {
  56. if (po == po1) {
  57. list_del_rcu(&po->list);
  58. goto out;
  59. }
  60. }
  61. pr_warn("dev_remove_offload: %p not found\n", po);
  62. out:
  63. spin_unlock(&offload_lock);
  64. }
  65. /**
  66. * dev_remove_offload - remove packet offload handler
  67. * @po: packet offload declaration
  68. *
  69. * Remove a packet offload handler that was previously added to the kernel
  70. * offload handlers by dev_add_offload(). The passed &offload_type is
  71. * removed from the kernel lists and can be freed or reused once this
  72. * function returns.
  73. *
  74. * This call sleeps to guarantee that no CPU is looking at the packet
  75. * type after return.
  76. */
  77. void dev_remove_offload(struct packet_offload *po)
  78. {
  79. __dev_remove_offload(po);
  80. synchronize_net();
  81. }
  82. EXPORT_SYMBOL(dev_remove_offload);
  83. /**
  84. * skb_eth_gso_segment - segmentation handler for ethernet protocols.
  85. * @skb: buffer to segment
  86. * @features: features for the output path (see dev->features)
  87. * @type: Ethernet Protocol ID
  88. */
  89. struct sk_buff *skb_eth_gso_segment(struct sk_buff *skb,
  90. netdev_features_t features, __be16 type)
  91. {
  92. struct sk_buff *segs = ERR_PTR(-EPROTONOSUPPORT);
  93. struct packet_offload *ptype;
  94. rcu_read_lock();
  95. list_for_each_entry_rcu(ptype, &offload_base, list) {
  96. if (ptype->type == type && ptype->callbacks.gso_segment) {
  97. segs = ptype->callbacks.gso_segment(skb, features);
  98. break;
  99. }
  100. }
  101. rcu_read_unlock();
  102. return segs;
  103. }
  104. EXPORT_SYMBOL(skb_eth_gso_segment);
  105. /**
  106. * skb_mac_gso_segment - mac layer segmentation handler.
  107. * @skb: buffer to segment
  108. * @features: features for the output path (see dev->features)
  109. */
  110. struct sk_buff *skb_mac_gso_segment(struct sk_buff *skb,
  111. netdev_features_t features)
  112. {
  113. struct sk_buff *segs = ERR_PTR(-EPROTONOSUPPORT);
  114. struct packet_offload *ptype;
  115. int vlan_depth = skb->mac_len;
  116. __be16 type = skb_network_protocol(skb, &vlan_depth);
  117. if (unlikely(!type))
  118. return ERR_PTR(-EINVAL);
  119. __skb_pull(skb, vlan_depth);
  120. rcu_read_lock();
  121. list_for_each_entry_rcu(ptype, &offload_base, list) {
  122. if (ptype->type == type && ptype->callbacks.gso_segment) {
  123. segs = ptype->callbacks.gso_segment(skb, features);
  124. break;
  125. }
  126. }
  127. rcu_read_unlock();
  128. __skb_push(skb, skb->data - skb_mac_header(skb));
  129. return segs;
  130. }
  131. EXPORT_SYMBOL(skb_mac_gso_segment);
  132. int skb_gro_receive(struct sk_buff *p, struct sk_buff *skb)
  133. {
  134. struct skb_shared_info *pinfo, *skbinfo = skb_shinfo(skb);
  135. unsigned int offset = skb_gro_offset(skb);
  136. unsigned int headlen = skb_headlen(skb);
  137. unsigned int len = skb_gro_len(skb);
  138. unsigned int delta_truesize;
  139. unsigned int gro_max_size;
  140. unsigned int new_truesize;
  141. struct sk_buff *lp;
  142. int segs;
  143. /* Do not splice page pool based packets w/ non-page pool
  144. * packets. This can result in reference count issues as page
  145. * pool pages will not decrement the reference count and will
  146. * instead be immediately returned to the pool or have frag
  147. * count decremented.
  148. */
  149. if (p->pp_recycle != skb->pp_recycle)
  150. return -ETOOMANYREFS;
  151. /* pairs with WRITE_ONCE() in netif_set_gro_max_size() */
  152. gro_max_size = READ_ONCE(p->dev->gro_max_size);
  153. if (unlikely(p->len + len >= gro_max_size || NAPI_GRO_CB(skb)->flush))
  154. return -E2BIG;
  155. if (unlikely(p->len + len >= GRO_LEGACY_MAX_SIZE)) {
  156. if (p->protocol != htons(ETH_P_IPV6) ||
  157. skb_headroom(p) < sizeof(struct hop_jumbo_hdr) ||
  158. ipv6_hdr(p)->nexthdr != IPPROTO_TCP ||
  159. p->encapsulation)
  160. return -E2BIG;
  161. }
  162. segs = NAPI_GRO_CB(skb)->count;
  163. lp = NAPI_GRO_CB(p)->last;
  164. pinfo = skb_shinfo(lp);
  165. if (headlen <= offset) {
  166. skb_frag_t *frag;
  167. skb_frag_t *frag2;
  168. int i = skbinfo->nr_frags;
  169. int nr_frags = pinfo->nr_frags + i;
  170. if (nr_frags > MAX_SKB_FRAGS)
  171. goto merge;
  172. offset -= headlen;
  173. pinfo->nr_frags = nr_frags;
  174. skbinfo->nr_frags = 0;
  175. frag = pinfo->frags + nr_frags;
  176. frag2 = skbinfo->frags + i;
  177. do {
  178. *--frag = *--frag2;
  179. } while (--i);
  180. skb_frag_off_add(frag, offset);
  181. skb_frag_size_sub(frag, offset);
  182. /* all fragments truesize : remove (head size + sk_buff) */
  183. new_truesize = SKB_TRUESIZE(skb_end_offset(skb));
  184. delta_truesize = skb->truesize - new_truesize;
  185. skb->truesize = new_truesize;
  186. skb->len -= skb->data_len;
  187. skb->data_len = 0;
  188. NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE;
  189. goto done;
  190. } else if (skb->head_frag) {
  191. int nr_frags = pinfo->nr_frags;
  192. skb_frag_t *frag = pinfo->frags + nr_frags;
  193. struct page *page = virt_to_head_page(skb->head);
  194. unsigned int first_size = headlen - offset;
  195. unsigned int first_offset;
  196. if (nr_frags + 1 + skbinfo->nr_frags > MAX_SKB_FRAGS)
  197. goto merge;
  198. first_offset = skb->data -
  199. (unsigned char *)page_address(page) +
  200. offset;
  201. pinfo->nr_frags = nr_frags + 1 + skbinfo->nr_frags;
  202. __skb_frag_set_page(frag, page);
  203. skb_frag_off_set(frag, first_offset);
  204. skb_frag_size_set(frag, first_size);
  205. memcpy(frag + 1, skbinfo->frags, sizeof(*frag) * skbinfo->nr_frags);
  206. /* We dont need to clear skbinfo->nr_frags here */
  207. new_truesize = SKB_DATA_ALIGN(sizeof(struct sk_buff));
  208. delta_truesize = skb->truesize - new_truesize;
  209. skb->truesize = new_truesize;
  210. NAPI_GRO_CB(skb)->free = NAPI_GRO_FREE_STOLEN_HEAD;
  211. goto done;
  212. }
  213. merge:
  214. /* sk owenrship - if any - completely transferred to the aggregated packet */
  215. skb->destructor = NULL;
  216. delta_truesize = skb->truesize;
  217. if (offset > headlen) {
  218. unsigned int eat = offset - headlen;
  219. skb_frag_off_add(&skbinfo->frags[0], eat);
  220. skb_frag_size_sub(&skbinfo->frags[0], eat);
  221. skb->data_len -= eat;
  222. skb->len -= eat;
  223. offset = headlen;
  224. }
  225. __skb_pull(skb, offset);
  226. if (NAPI_GRO_CB(p)->last == p)
  227. skb_shinfo(p)->frag_list = skb;
  228. else
  229. NAPI_GRO_CB(p)->last->next = skb;
  230. NAPI_GRO_CB(p)->last = skb;
  231. __skb_header_release(skb);
  232. lp = p;
  233. done:
  234. NAPI_GRO_CB(p)->count += segs;
  235. p->data_len += len;
  236. p->truesize += delta_truesize;
  237. p->len += len;
  238. if (lp != p) {
  239. lp->data_len += len;
  240. lp->truesize += delta_truesize;
  241. lp->len += len;
  242. }
  243. NAPI_GRO_CB(skb)->same_flow = 1;
  244. return 0;
  245. }
  246. static void napi_gro_complete(struct napi_struct *napi, struct sk_buff *skb)
  247. {
  248. struct packet_offload *ptype;
  249. __be16 type = skb->protocol;
  250. struct list_head *head = &offload_base;
  251. int err = -ENOENT;
  252. BUILD_BUG_ON(sizeof(struct napi_gro_cb) > sizeof(skb->cb));
  253. if (NAPI_GRO_CB(skb)->count == 1) {
  254. skb_shinfo(skb)->gso_size = 0;
  255. goto out;
  256. }
  257. rcu_read_lock();
  258. list_for_each_entry_rcu(ptype, head, list) {
  259. if (ptype->type != type || !ptype->callbacks.gro_complete)
  260. continue;
  261. err = INDIRECT_CALL_INET(ptype->callbacks.gro_complete,
  262. ipv6_gro_complete, inet_gro_complete,
  263. skb, 0);
  264. break;
  265. }
  266. rcu_read_unlock();
  267. if (err) {
  268. WARN_ON(&ptype->list == head);
  269. kfree_skb(skb);
  270. return;
  271. }
  272. out:
  273. gro_normal_one(napi, skb, NAPI_GRO_CB(skb)->count);
  274. }
  275. static void __napi_gro_flush_chain(struct napi_struct *napi, u32 index,
  276. bool flush_old)
  277. {
  278. struct list_head *head = &napi->gro_hash[index].list;
  279. struct sk_buff *skb, *p;
  280. list_for_each_entry_safe_reverse(skb, p, head, list) {
  281. if (flush_old && NAPI_GRO_CB(skb)->age == jiffies)
  282. return;
  283. skb_list_del_init(skb);
  284. napi_gro_complete(napi, skb);
  285. napi->gro_hash[index].count--;
  286. }
  287. if (!napi->gro_hash[index].count)
  288. __clear_bit(index, &napi->gro_bitmask);
  289. }
  290. /* napi->gro_hash[].list contains packets ordered by age.
  291. * youngest packets at the head of it.
  292. * Complete skbs in reverse order to reduce latencies.
  293. */
  294. void napi_gro_flush(struct napi_struct *napi, bool flush_old)
  295. {
  296. unsigned long bitmask = napi->gro_bitmask;
  297. unsigned int i, base = ~0U;
  298. while ((i = ffs(bitmask)) != 0) {
  299. bitmask >>= i;
  300. base += i;
  301. __napi_gro_flush_chain(napi, base, flush_old);
  302. }
  303. }
  304. EXPORT_SYMBOL(napi_gro_flush);
  305. static void gro_list_prepare(const struct list_head *head,
  306. const struct sk_buff *skb)
  307. {
  308. unsigned int maclen = skb->dev->hard_header_len;
  309. u32 hash = skb_get_hash_raw(skb);
  310. struct sk_buff *p;
  311. list_for_each_entry(p, head, list) {
  312. unsigned long diffs;
  313. NAPI_GRO_CB(p)->flush = 0;
  314. if (hash != skb_get_hash_raw(p)) {
  315. NAPI_GRO_CB(p)->same_flow = 0;
  316. continue;
  317. }
  318. diffs = (unsigned long)p->dev ^ (unsigned long)skb->dev;
  319. diffs |= skb_vlan_tag_present(p) ^ skb_vlan_tag_present(skb);
  320. if (skb_vlan_tag_present(p))
  321. diffs |= skb_vlan_tag_get(p) ^ skb_vlan_tag_get(skb);
  322. diffs |= skb_metadata_differs(p, skb);
  323. if (maclen == ETH_HLEN)
  324. diffs |= compare_ether_header(skb_mac_header(p),
  325. skb_mac_header(skb));
  326. else if (!diffs)
  327. diffs = memcmp(skb_mac_header(p),
  328. skb_mac_header(skb),
  329. maclen);
  330. /* in most common scenarions 'slow_gro' is 0
  331. * otherwise we are already on some slower paths
  332. * either skip all the infrequent tests altogether or
  333. * avoid trying too hard to skip each of them individually
  334. */
  335. if (!diffs && unlikely(skb->slow_gro | p->slow_gro)) {
  336. #if IS_ENABLED(CONFIG_SKB_EXTENSIONS) && IS_ENABLED(CONFIG_NET_TC_SKB_EXT)
  337. struct tc_skb_ext *skb_ext;
  338. struct tc_skb_ext *p_ext;
  339. #endif
  340. diffs |= p->sk != skb->sk;
  341. diffs |= skb_metadata_dst_cmp(p, skb);
  342. diffs |= skb_get_nfct(p) ^ skb_get_nfct(skb);
  343. #if IS_ENABLED(CONFIG_SKB_EXTENSIONS) && IS_ENABLED(CONFIG_NET_TC_SKB_EXT)
  344. skb_ext = skb_ext_find(skb, TC_SKB_EXT);
  345. p_ext = skb_ext_find(p, TC_SKB_EXT);
  346. diffs |= (!!p_ext) ^ (!!skb_ext);
  347. if (!diffs && unlikely(skb_ext))
  348. diffs |= p_ext->chain ^ skb_ext->chain;
  349. #endif
  350. }
  351. NAPI_GRO_CB(p)->same_flow = !diffs;
  352. }
  353. }
  354. static inline void skb_gro_reset_offset(struct sk_buff *skb, u32 nhoff)
  355. {
  356. const struct skb_shared_info *pinfo = skb_shinfo(skb);
  357. const skb_frag_t *frag0 = &pinfo->frags[0];
  358. NAPI_GRO_CB(skb)->data_offset = 0;
  359. NAPI_GRO_CB(skb)->frag0 = NULL;
  360. NAPI_GRO_CB(skb)->frag0_len = 0;
  361. if (!skb_headlen(skb) && pinfo->nr_frags &&
  362. !PageHighMem(skb_frag_page(frag0)) &&
  363. (!NET_IP_ALIGN || !((skb_frag_off(frag0) + nhoff) & 3))) {
  364. NAPI_GRO_CB(skb)->frag0 = skb_frag_address(frag0);
  365. NAPI_GRO_CB(skb)->frag0_len = min_t(unsigned int,
  366. skb_frag_size(frag0),
  367. skb->end - skb->tail);
  368. }
  369. }
  370. static void gro_pull_from_frag0(struct sk_buff *skb, int grow)
  371. {
  372. struct skb_shared_info *pinfo = skb_shinfo(skb);
  373. BUG_ON(skb->end - skb->tail < grow);
  374. memcpy(skb_tail_pointer(skb), NAPI_GRO_CB(skb)->frag0, grow);
  375. skb->data_len -= grow;
  376. skb->tail += grow;
  377. skb_frag_off_add(&pinfo->frags[0], grow);
  378. skb_frag_size_sub(&pinfo->frags[0], grow);
  379. if (unlikely(!skb_frag_size(&pinfo->frags[0]))) {
  380. skb_frag_unref(skb, 0);
  381. memmove(pinfo->frags, pinfo->frags + 1,
  382. --pinfo->nr_frags * sizeof(pinfo->frags[0]));
  383. }
  384. }
  385. static void gro_flush_oldest(struct napi_struct *napi, struct list_head *head)
  386. {
  387. struct sk_buff *oldest;
  388. oldest = list_last_entry(head, struct sk_buff, list);
  389. /* We are called with head length >= MAX_GRO_SKBS, so this is
  390. * impossible.
  391. */
  392. if (WARN_ON_ONCE(!oldest))
  393. return;
  394. /* Do not adjust napi->gro_hash[].count, caller is adding a new
  395. * SKB to the chain.
  396. */
  397. skb_list_del_init(oldest);
  398. napi_gro_complete(napi, oldest);
  399. }
  400. static enum gro_result dev_gro_receive(struct napi_struct *napi, struct sk_buff *skb)
  401. {
  402. u32 bucket = skb_get_hash_raw(skb) & (GRO_HASH_BUCKETS - 1);
  403. struct gro_list *gro_list = &napi->gro_hash[bucket];
  404. struct list_head *head = &offload_base;
  405. struct packet_offload *ptype;
  406. __be16 type = skb->protocol;
  407. struct sk_buff *pp = NULL;
  408. enum gro_result ret;
  409. int same_flow;
  410. int grow;
  411. if (netif_elide_gro(skb->dev))
  412. goto normal;
  413. gro_list_prepare(&gro_list->list, skb);
  414. rcu_read_lock();
  415. list_for_each_entry_rcu(ptype, head, list) {
  416. if (ptype->type == type && ptype->callbacks.gro_receive)
  417. goto found_ptype;
  418. }
  419. rcu_read_unlock();
  420. goto normal;
  421. found_ptype:
  422. skb_set_network_header(skb, skb_gro_offset(skb));
  423. skb_reset_mac_len(skb);
  424. BUILD_BUG_ON(sizeof_field(struct napi_gro_cb, zeroed) != sizeof(u32));
  425. BUILD_BUG_ON(!IS_ALIGNED(offsetof(struct napi_gro_cb, zeroed),
  426. sizeof(u32))); /* Avoid slow unaligned acc */
  427. *(u32 *)&NAPI_GRO_CB(skb)->zeroed = 0;
  428. NAPI_GRO_CB(skb)->flush = skb_has_frag_list(skb);
  429. NAPI_GRO_CB(skb)->is_atomic = 1;
  430. NAPI_GRO_CB(skb)->count = 1;
  431. if (unlikely(skb_is_gso(skb))) {
  432. NAPI_GRO_CB(skb)->count = skb_shinfo(skb)->gso_segs;
  433. /* Only support TCP and non DODGY users. */
  434. if (!skb_is_gso_tcp(skb) ||
  435. (skb_shinfo(skb)->gso_type & SKB_GSO_DODGY))
  436. NAPI_GRO_CB(skb)->flush = 1;
  437. }
  438. /* Setup for GRO checksum validation */
  439. switch (skb->ip_summed) {
  440. case CHECKSUM_COMPLETE:
  441. NAPI_GRO_CB(skb)->csum = skb->csum;
  442. NAPI_GRO_CB(skb)->csum_valid = 1;
  443. break;
  444. case CHECKSUM_UNNECESSARY:
  445. NAPI_GRO_CB(skb)->csum_cnt = skb->csum_level + 1;
  446. break;
  447. }
  448. pp = INDIRECT_CALL_INET(ptype->callbacks.gro_receive,
  449. ipv6_gro_receive, inet_gro_receive,
  450. &gro_list->list, skb);
  451. rcu_read_unlock();
  452. if (PTR_ERR(pp) == -EINPROGRESS) {
  453. ret = GRO_CONSUMED;
  454. goto ok;
  455. }
  456. same_flow = NAPI_GRO_CB(skb)->same_flow;
  457. ret = NAPI_GRO_CB(skb)->free ? GRO_MERGED_FREE : GRO_MERGED;
  458. if (pp) {
  459. skb_list_del_init(pp);
  460. napi_gro_complete(napi, pp);
  461. gro_list->count--;
  462. }
  463. if (same_flow)
  464. goto ok;
  465. if (NAPI_GRO_CB(skb)->flush)
  466. goto normal;
  467. if (unlikely(gro_list->count >= MAX_GRO_SKBS))
  468. gro_flush_oldest(napi, &gro_list->list);
  469. else
  470. gro_list->count++;
  471. NAPI_GRO_CB(skb)->age = jiffies;
  472. NAPI_GRO_CB(skb)->last = skb;
  473. if (!skb_is_gso(skb))
  474. skb_shinfo(skb)->gso_size = skb_gro_len(skb);
  475. list_add(&skb->list, &gro_list->list);
  476. ret = GRO_HELD;
  477. pull:
  478. grow = skb_gro_offset(skb) - skb_headlen(skb);
  479. if (grow > 0)
  480. gro_pull_from_frag0(skb, grow);
  481. ok:
  482. if (gro_list->count) {
  483. if (!test_bit(bucket, &napi->gro_bitmask))
  484. __set_bit(bucket, &napi->gro_bitmask);
  485. } else if (test_bit(bucket, &napi->gro_bitmask)) {
  486. __clear_bit(bucket, &napi->gro_bitmask);
  487. }
  488. return ret;
  489. normal:
  490. ret = GRO_NORMAL;
  491. goto pull;
  492. }
  493. struct packet_offload *gro_find_receive_by_type(__be16 type)
  494. {
  495. struct list_head *offload_head = &offload_base;
  496. struct packet_offload *ptype;
  497. list_for_each_entry_rcu(ptype, offload_head, list) {
  498. if (ptype->type != type || !ptype->callbacks.gro_receive)
  499. continue;
  500. return ptype;
  501. }
  502. return NULL;
  503. }
  504. EXPORT_SYMBOL(gro_find_receive_by_type);
  505. struct packet_offload *gro_find_complete_by_type(__be16 type)
  506. {
  507. struct list_head *offload_head = &offload_base;
  508. struct packet_offload *ptype;
  509. list_for_each_entry_rcu(ptype, offload_head, list) {
  510. if (ptype->type != type || !ptype->callbacks.gro_complete)
  511. continue;
  512. return ptype;
  513. }
  514. return NULL;
  515. }
  516. EXPORT_SYMBOL(gro_find_complete_by_type);
  517. static gro_result_t napi_skb_finish(struct napi_struct *napi,
  518. struct sk_buff *skb,
  519. gro_result_t ret)
  520. {
  521. switch (ret) {
  522. case GRO_NORMAL:
  523. gro_normal_one(napi, skb, 1);
  524. break;
  525. case GRO_MERGED_FREE:
  526. if (NAPI_GRO_CB(skb)->free == NAPI_GRO_FREE_STOLEN_HEAD)
  527. napi_skb_free_stolen_head(skb);
  528. else if (skb->fclone != SKB_FCLONE_UNAVAILABLE)
  529. __kfree_skb(skb);
  530. else
  531. __kfree_skb_defer(skb);
  532. break;
  533. case GRO_HELD:
  534. case GRO_MERGED:
  535. case GRO_CONSUMED:
  536. break;
  537. }
  538. return ret;
  539. }
  540. gro_result_t napi_gro_receive(struct napi_struct *napi, struct sk_buff *skb)
  541. {
  542. gro_result_t ret;
  543. skb_mark_napi_id(skb, napi);
  544. trace_napi_gro_receive_entry(skb);
  545. skb_gro_reset_offset(skb, 0);
  546. ret = napi_skb_finish(napi, skb, dev_gro_receive(napi, skb));
  547. trace_napi_gro_receive_exit(ret);
  548. return ret;
  549. }
  550. EXPORT_SYMBOL(napi_gro_receive);
  551. static void napi_reuse_skb(struct napi_struct *napi, struct sk_buff *skb)
  552. {
  553. if (unlikely(skb->pfmemalloc)) {
  554. consume_skb(skb);
  555. return;
  556. }
  557. __skb_pull(skb, skb_headlen(skb));
  558. /* restore the reserve we had after netdev_alloc_skb_ip_align() */
  559. skb_reserve(skb, NET_SKB_PAD + NET_IP_ALIGN - skb_headroom(skb));
  560. __vlan_hwaccel_clear_tag(skb);
  561. skb->dev = napi->dev;
  562. skb->skb_iif = 0;
  563. /* eth_type_trans() assumes pkt_type is PACKET_HOST */
  564. skb->pkt_type = PACKET_HOST;
  565. skb->encapsulation = 0;
  566. skb_shinfo(skb)->gso_type = 0;
  567. skb_shinfo(skb)->gso_size = 0;
  568. if (unlikely(skb->slow_gro)) {
  569. skb_orphan(skb);
  570. skb_ext_reset(skb);
  571. nf_reset_ct(skb);
  572. skb->slow_gro = 0;
  573. }
  574. napi->skb = skb;
  575. }
  576. struct sk_buff *napi_get_frags(struct napi_struct *napi)
  577. {
  578. struct sk_buff *skb = napi->skb;
  579. if (!skb) {
  580. skb = napi_alloc_skb(napi, GRO_MAX_HEAD);
  581. if (skb) {
  582. napi->skb = skb;
  583. skb_mark_napi_id(skb, napi);
  584. }
  585. }
  586. return skb;
  587. }
  588. EXPORT_SYMBOL(napi_get_frags);
  589. static gro_result_t napi_frags_finish(struct napi_struct *napi,
  590. struct sk_buff *skb,
  591. gro_result_t ret)
  592. {
  593. switch (ret) {
  594. case GRO_NORMAL:
  595. case GRO_HELD:
  596. __skb_push(skb, ETH_HLEN);
  597. skb->protocol = eth_type_trans(skb, skb->dev);
  598. if (ret == GRO_NORMAL)
  599. gro_normal_one(napi, skb, 1);
  600. break;
  601. case GRO_MERGED_FREE:
  602. if (NAPI_GRO_CB(skb)->free == NAPI_GRO_FREE_STOLEN_HEAD)
  603. napi_skb_free_stolen_head(skb);
  604. else
  605. napi_reuse_skb(napi, skb);
  606. break;
  607. case GRO_MERGED:
  608. case GRO_CONSUMED:
  609. break;
  610. }
  611. return ret;
  612. }
  613. /* Upper GRO stack assumes network header starts at gro_offset=0
  614. * Drivers could call both napi_gro_frags() and napi_gro_receive()
  615. * We copy ethernet header into skb->data to have a common layout.
  616. */
  617. static struct sk_buff *napi_frags_skb(struct napi_struct *napi)
  618. {
  619. struct sk_buff *skb = napi->skb;
  620. const struct ethhdr *eth;
  621. unsigned int hlen = sizeof(*eth);
  622. napi->skb = NULL;
  623. skb_reset_mac_header(skb);
  624. skb_gro_reset_offset(skb, hlen);
  625. if (unlikely(skb_gro_header_hard(skb, hlen))) {
  626. eth = skb_gro_header_slow(skb, hlen, 0);
  627. if (unlikely(!eth)) {
  628. net_warn_ratelimited("%s: dropping impossible skb from %s\n",
  629. __func__, napi->dev->name);
  630. napi_reuse_skb(napi, skb);
  631. return NULL;
  632. }
  633. } else {
  634. eth = (const struct ethhdr *)skb->data;
  635. gro_pull_from_frag0(skb, hlen);
  636. NAPI_GRO_CB(skb)->frag0 += hlen;
  637. NAPI_GRO_CB(skb)->frag0_len -= hlen;
  638. }
  639. __skb_pull(skb, hlen);
  640. /*
  641. * This works because the only protocols we care about don't require
  642. * special handling.
  643. * We'll fix it up properly in napi_frags_finish()
  644. */
  645. skb->protocol = eth->h_proto;
  646. return skb;
  647. }
  648. gro_result_t napi_gro_frags(struct napi_struct *napi)
  649. {
  650. gro_result_t ret;
  651. struct sk_buff *skb = napi_frags_skb(napi);
  652. trace_napi_gro_frags_entry(skb);
  653. ret = napi_frags_finish(napi, skb, dev_gro_receive(napi, skb));
  654. trace_napi_gro_frags_exit(ret);
  655. return ret;
  656. }
  657. EXPORT_SYMBOL(napi_gro_frags);
  658. /* Compute the checksum from gro_offset and return the folded value
  659. * after adding in any pseudo checksum.
  660. */
  661. __sum16 __skb_gro_checksum_complete(struct sk_buff *skb)
  662. {
  663. __wsum wsum;
  664. __sum16 sum;
  665. wsum = skb_checksum(skb, skb_gro_offset(skb), skb_gro_len(skb), 0);
  666. /* NAPI_GRO_CB(skb)->csum holds pseudo checksum */
  667. sum = csum_fold(csum_add(NAPI_GRO_CB(skb)->csum, wsum));
  668. /* See comments in __skb_checksum_complete(). */
  669. if (likely(!sum)) {
  670. if (unlikely(skb->ip_summed == CHECKSUM_COMPLETE) &&
  671. !skb->csum_complete_sw)
  672. netdev_rx_csum_fault(skb->dev, skb);
  673. }
  674. NAPI_GRO_CB(skb)->csum = wsum;
  675. NAPI_GRO_CB(skb)->csum_valid = 1;
  676. return sum;
  677. }
  678. EXPORT_SYMBOL(__skb_gro_checksum_complete);