vmci_transport_notify.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672
  1. // SPDX-License-Identifier: GPL-2.0-only
  2. /*
  3. * VMware vSockets Driver
  4. *
  5. * Copyright (C) 2009-2013 VMware, Inc. All rights reserved.
  6. */
  7. #include <linux/types.h>
  8. #include <linux/socket.h>
  9. #include <linux/stddef.h>
  10. #include <net/sock.h>
  11. #include "vmci_transport_notify.h"
  12. #define PKT_FIELD(vsk, field_name) (vmci_trans(vsk)->notify.pkt.field_name)
  13. static bool vmci_transport_notify_waiting_write(struct vsock_sock *vsk)
  14. {
  15. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  16. bool retval;
  17. u64 notify_limit;
  18. if (!PKT_FIELD(vsk, peer_waiting_write))
  19. return false;
  20. #ifdef VSOCK_OPTIMIZATION_FLOW_CONTROL
  21. /* When the sender blocks, we take that as a sign that the sender is
  22. * faster than the receiver. To reduce the transmit rate of the sender,
  23. * we delay the sending of the read notification by decreasing the
  24. * write_notify_window. The notification is delayed until the number of
  25. * bytes used in the queue drops below the write_notify_window.
  26. */
  27. if (!PKT_FIELD(vsk, peer_waiting_write_detected)) {
  28. PKT_FIELD(vsk, peer_waiting_write_detected) = true;
  29. if (PKT_FIELD(vsk, write_notify_window) < PAGE_SIZE) {
  30. PKT_FIELD(vsk, write_notify_window) =
  31. PKT_FIELD(vsk, write_notify_min_window);
  32. } else {
  33. PKT_FIELD(vsk, write_notify_window) -= PAGE_SIZE;
  34. if (PKT_FIELD(vsk, write_notify_window) <
  35. PKT_FIELD(vsk, write_notify_min_window))
  36. PKT_FIELD(vsk, write_notify_window) =
  37. PKT_FIELD(vsk, write_notify_min_window);
  38. }
  39. }
  40. notify_limit = vmci_trans(vsk)->consume_size -
  41. PKT_FIELD(vsk, write_notify_window);
  42. #else
  43. notify_limit = 0;
  44. #endif
  45. /* For now we ignore the wait information and just see if the free
  46. * space exceeds the notify limit. Note that improving this function
  47. * to be more intelligent will not require a protocol change and will
  48. * retain compatibility between endpoints with mixed versions of this
  49. * function.
  50. *
  51. * The notify_limit is used to delay notifications in the case where
  52. * flow control is enabled. Below the test is expressed in terms of
  53. * free space in the queue: if free_space > ConsumeSize -
  54. * write_notify_window then notify An alternate way of expressing this
  55. * is to rewrite the expression to use the data ready in the receive
  56. * queue: if write_notify_window > bufferReady then notify as
  57. * free_space == ConsumeSize - bufferReady.
  58. */
  59. retval = vmci_qpair_consume_free_space(vmci_trans(vsk)->qpair) >
  60. notify_limit;
  61. #ifdef VSOCK_OPTIMIZATION_FLOW_CONTROL
  62. if (retval) {
  63. /*
  64. * Once we notify the peer, we reset the detected flag so the
  65. * next wait will again cause a decrease in the window size.
  66. */
  67. PKT_FIELD(vsk, peer_waiting_write_detected) = false;
  68. }
  69. #endif
  70. return retval;
  71. #else
  72. return true;
  73. #endif
  74. }
  75. static bool vmci_transport_notify_waiting_read(struct vsock_sock *vsk)
  76. {
  77. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  78. if (!PKT_FIELD(vsk, peer_waiting_read))
  79. return false;
  80. /* For now we ignore the wait information and just see if there is any
  81. * data for our peer to read. Note that improving this function to be
  82. * more intelligent will not require a protocol change and will retain
  83. * compatibility between endpoints with mixed versions of this
  84. * function.
  85. */
  86. return vmci_qpair_produce_buf_ready(vmci_trans(vsk)->qpair) > 0;
  87. #else
  88. return true;
  89. #endif
  90. }
  91. static void
  92. vmci_transport_handle_waiting_read(struct sock *sk,
  93. struct vmci_transport_packet *pkt,
  94. bool bottom_half,
  95. struct sockaddr_vm *dst,
  96. struct sockaddr_vm *src)
  97. {
  98. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  99. struct vsock_sock *vsk;
  100. vsk = vsock_sk(sk);
  101. PKT_FIELD(vsk, peer_waiting_read) = true;
  102. memcpy(&PKT_FIELD(vsk, peer_waiting_read_info), &pkt->u.wait,
  103. sizeof(PKT_FIELD(vsk, peer_waiting_read_info)));
  104. if (vmci_transport_notify_waiting_read(vsk)) {
  105. bool sent;
  106. if (bottom_half)
  107. sent = vmci_transport_send_wrote_bh(dst, src) > 0;
  108. else
  109. sent = vmci_transport_send_wrote(sk) > 0;
  110. if (sent)
  111. PKT_FIELD(vsk, peer_waiting_read) = false;
  112. }
  113. #endif
  114. }
  115. static void
  116. vmci_transport_handle_waiting_write(struct sock *sk,
  117. struct vmci_transport_packet *pkt,
  118. bool bottom_half,
  119. struct sockaddr_vm *dst,
  120. struct sockaddr_vm *src)
  121. {
  122. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  123. struct vsock_sock *vsk;
  124. vsk = vsock_sk(sk);
  125. PKT_FIELD(vsk, peer_waiting_write) = true;
  126. memcpy(&PKT_FIELD(vsk, peer_waiting_write_info), &pkt->u.wait,
  127. sizeof(PKT_FIELD(vsk, peer_waiting_write_info)));
  128. if (vmci_transport_notify_waiting_write(vsk)) {
  129. bool sent;
  130. if (bottom_half)
  131. sent = vmci_transport_send_read_bh(dst, src) > 0;
  132. else
  133. sent = vmci_transport_send_read(sk) > 0;
  134. if (sent)
  135. PKT_FIELD(vsk, peer_waiting_write) = false;
  136. }
  137. #endif
  138. }
  139. static void
  140. vmci_transport_handle_read(struct sock *sk,
  141. struct vmci_transport_packet *pkt,
  142. bool bottom_half,
  143. struct sockaddr_vm *dst, struct sockaddr_vm *src)
  144. {
  145. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  146. struct vsock_sock *vsk;
  147. vsk = vsock_sk(sk);
  148. PKT_FIELD(vsk, sent_waiting_write) = false;
  149. #endif
  150. sk->sk_write_space(sk);
  151. }
  152. static bool send_waiting_read(struct sock *sk, u64 room_needed)
  153. {
  154. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  155. struct vsock_sock *vsk;
  156. struct vmci_transport_waiting_info waiting_info;
  157. u64 tail;
  158. u64 head;
  159. u64 room_left;
  160. bool ret;
  161. vsk = vsock_sk(sk);
  162. if (PKT_FIELD(vsk, sent_waiting_read))
  163. return true;
  164. if (PKT_FIELD(vsk, write_notify_window) <
  165. vmci_trans(vsk)->consume_size)
  166. PKT_FIELD(vsk, write_notify_window) =
  167. min(PKT_FIELD(vsk, write_notify_window) + PAGE_SIZE,
  168. vmci_trans(vsk)->consume_size);
  169. vmci_qpair_get_consume_indexes(vmci_trans(vsk)->qpair, &tail, &head);
  170. room_left = vmci_trans(vsk)->consume_size - head;
  171. if (room_needed >= room_left) {
  172. waiting_info.offset = room_needed - room_left;
  173. waiting_info.generation =
  174. PKT_FIELD(vsk, consume_q_generation) + 1;
  175. } else {
  176. waiting_info.offset = head + room_needed;
  177. waiting_info.generation = PKT_FIELD(vsk, consume_q_generation);
  178. }
  179. ret = vmci_transport_send_waiting_read(sk, &waiting_info) > 0;
  180. if (ret)
  181. PKT_FIELD(vsk, sent_waiting_read) = true;
  182. return ret;
  183. #else
  184. return true;
  185. #endif
  186. }
  187. static bool send_waiting_write(struct sock *sk, u64 room_needed)
  188. {
  189. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  190. struct vsock_sock *vsk;
  191. struct vmci_transport_waiting_info waiting_info;
  192. u64 tail;
  193. u64 head;
  194. u64 room_left;
  195. bool ret;
  196. vsk = vsock_sk(sk);
  197. if (PKT_FIELD(vsk, sent_waiting_write))
  198. return true;
  199. vmci_qpair_get_produce_indexes(vmci_trans(vsk)->qpair, &tail, &head);
  200. room_left = vmci_trans(vsk)->produce_size - tail;
  201. if (room_needed + 1 >= room_left) {
  202. /* Wraps around to current generation. */
  203. waiting_info.offset = room_needed + 1 - room_left;
  204. waiting_info.generation = PKT_FIELD(vsk, produce_q_generation);
  205. } else {
  206. waiting_info.offset = tail + room_needed + 1;
  207. waiting_info.generation =
  208. PKT_FIELD(vsk, produce_q_generation) - 1;
  209. }
  210. ret = vmci_transport_send_waiting_write(sk, &waiting_info) > 0;
  211. if (ret)
  212. PKT_FIELD(vsk, sent_waiting_write) = true;
  213. return ret;
  214. #else
  215. return true;
  216. #endif
  217. }
  218. static int vmci_transport_send_read_notification(struct sock *sk)
  219. {
  220. struct vsock_sock *vsk;
  221. bool sent_read;
  222. unsigned int retries;
  223. int err;
  224. vsk = vsock_sk(sk);
  225. sent_read = false;
  226. retries = 0;
  227. err = 0;
  228. if (vmci_transport_notify_waiting_write(vsk)) {
  229. /* Notify the peer that we have read, retrying the send on
  230. * failure up to our maximum value. XXX For now we just log
  231. * the failure, but later we should schedule a work item to
  232. * handle the resend until it succeeds. That would require
  233. * keeping track of work items in the vsk and cleaning them up
  234. * upon socket close.
  235. */
  236. while (!(vsk->peer_shutdown & RCV_SHUTDOWN) &&
  237. !sent_read &&
  238. retries < VMCI_TRANSPORT_MAX_DGRAM_RESENDS) {
  239. err = vmci_transport_send_read(sk);
  240. if (err >= 0)
  241. sent_read = true;
  242. retries++;
  243. }
  244. if (retries >= VMCI_TRANSPORT_MAX_DGRAM_RESENDS)
  245. pr_err("%p unable to send read notify to peer\n", sk);
  246. else
  247. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  248. PKT_FIELD(vsk, peer_waiting_write) = false;
  249. #endif
  250. }
  251. return err;
  252. }
  253. static void
  254. vmci_transport_handle_wrote(struct sock *sk,
  255. struct vmci_transport_packet *pkt,
  256. bool bottom_half,
  257. struct sockaddr_vm *dst, struct sockaddr_vm *src)
  258. {
  259. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  260. struct vsock_sock *vsk = vsock_sk(sk);
  261. PKT_FIELD(vsk, sent_waiting_read) = false;
  262. #endif
  263. vsock_data_ready(sk);
  264. }
  265. static void vmci_transport_notify_pkt_socket_init(struct sock *sk)
  266. {
  267. struct vsock_sock *vsk = vsock_sk(sk);
  268. PKT_FIELD(vsk, write_notify_window) = PAGE_SIZE;
  269. PKT_FIELD(vsk, write_notify_min_window) = PAGE_SIZE;
  270. PKT_FIELD(vsk, peer_waiting_read) = false;
  271. PKT_FIELD(vsk, peer_waiting_write) = false;
  272. PKT_FIELD(vsk, peer_waiting_write_detected) = false;
  273. PKT_FIELD(vsk, sent_waiting_read) = false;
  274. PKT_FIELD(vsk, sent_waiting_write) = false;
  275. PKT_FIELD(vsk, produce_q_generation) = 0;
  276. PKT_FIELD(vsk, consume_q_generation) = 0;
  277. memset(&PKT_FIELD(vsk, peer_waiting_read_info), 0,
  278. sizeof(PKT_FIELD(vsk, peer_waiting_read_info)));
  279. memset(&PKT_FIELD(vsk, peer_waiting_write_info), 0,
  280. sizeof(PKT_FIELD(vsk, peer_waiting_write_info)));
  281. }
  282. static void vmci_transport_notify_pkt_socket_destruct(struct vsock_sock *vsk)
  283. {
  284. }
  285. static int
  286. vmci_transport_notify_pkt_poll_in(struct sock *sk,
  287. size_t target, bool *data_ready_now)
  288. {
  289. struct vsock_sock *vsk = vsock_sk(sk);
  290. if (vsock_stream_has_data(vsk) >= target) {
  291. *data_ready_now = true;
  292. } else {
  293. /* We can't read right now because there is not enough data
  294. * in the queue. Ask for notifications when there is something
  295. * to read.
  296. */
  297. if (sk->sk_state == TCP_ESTABLISHED) {
  298. if (!send_waiting_read(sk, 1))
  299. return -1;
  300. }
  301. *data_ready_now = false;
  302. }
  303. return 0;
  304. }
  305. static int
  306. vmci_transport_notify_pkt_poll_out(struct sock *sk,
  307. size_t target, bool *space_avail_now)
  308. {
  309. s64 produce_q_free_space;
  310. struct vsock_sock *vsk = vsock_sk(sk);
  311. produce_q_free_space = vsock_stream_has_space(vsk);
  312. if (produce_q_free_space > 0) {
  313. *space_avail_now = true;
  314. return 0;
  315. } else if (produce_q_free_space == 0) {
  316. /* This is a connected socket but we can't currently send data.
  317. * Notify the peer that we are waiting if the queue is full. We
  318. * only send a waiting write if the queue is full because
  319. * otherwise we end up in an infinite WAITING_WRITE, READ,
  320. * WAITING_WRITE, READ, etc. loop. Treat failing to send the
  321. * notification as a socket error, passing that back through
  322. * the mask.
  323. */
  324. if (!send_waiting_write(sk, 1))
  325. return -1;
  326. *space_avail_now = false;
  327. }
  328. return 0;
  329. }
  330. static int
  331. vmci_transport_notify_pkt_recv_init(
  332. struct sock *sk,
  333. size_t target,
  334. struct vmci_transport_recv_notify_data *data)
  335. {
  336. struct vsock_sock *vsk = vsock_sk(sk);
  337. #ifdef VSOCK_OPTIMIZATION_WAITING_NOTIFY
  338. data->consume_head = 0;
  339. data->produce_tail = 0;
  340. #ifdef VSOCK_OPTIMIZATION_FLOW_CONTROL
  341. data->notify_on_block = false;
  342. if (PKT_FIELD(vsk, write_notify_min_window) < target + 1) {
  343. PKT_FIELD(vsk, write_notify_min_window) = target + 1;
  344. if (PKT_FIELD(vsk, write_notify_window) <
  345. PKT_FIELD(vsk, write_notify_min_window)) {
  346. /* If the current window is smaller than the new
  347. * minimal window size, we need to reevaluate whether
  348. * we need to notify the sender. If the number of ready
  349. * bytes are smaller than the new window, we need to
  350. * send a notification to the sender before we block.
  351. */
  352. PKT_FIELD(vsk, write_notify_window) =
  353. PKT_FIELD(vsk, write_notify_min_window);
  354. data->notify_on_block = true;
  355. }
  356. }
  357. #endif
  358. #endif
  359. return 0;
  360. }
  361. static int
  362. vmci_transport_notify_pkt_recv_pre_block(
  363. struct sock *sk,
  364. size_t target,
  365. struct vmci_transport_recv_notify_data *data)
  366. {
  367. int err = 0;
  368. /* Notify our peer that we are waiting for data to read. */
  369. if (!send_waiting_read(sk, target)) {
  370. err = -EHOSTUNREACH;
  371. return err;
  372. }
  373. #ifdef VSOCK_OPTIMIZATION_FLOW_CONTROL
  374. if (data->notify_on_block) {
  375. err = vmci_transport_send_read_notification(sk);
  376. if (err < 0)
  377. return err;
  378. data->notify_on_block = false;
  379. }
  380. #endif
  381. return err;
  382. }
  383. static int
  384. vmci_transport_notify_pkt_recv_pre_dequeue(
  385. struct sock *sk,
  386. size_t target,
  387. struct vmci_transport_recv_notify_data *data)
  388. {
  389. struct vsock_sock *vsk = vsock_sk(sk);
  390. /* Now consume up to len bytes from the queue. Note that since we have
  391. * the socket locked we should copy at least ready bytes.
  392. */
  393. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  394. vmci_qpair_get_consume_indexes(vmci_trans(vsk)->qpair,
  395. &data->produce_tail,
  396. &data->consume_head);
  397. #endif
  398. return 0;
  399. }
  400. static int
  401. vmci_transport_notify_pkt_recv_post_dequeue(
  402. struct sock *sk,
  403. size_t target,
  404. ssize_t copied,
  405. bool data_read,
  406. struct vmci_transport_recv_notify_data *data)
  407. {
  408. struct vsock_sock *vsk;
  409. int err;
  410. vsk = vsock_sk(sk);
  411. err = 0;
  412. if (data_read) {
  413. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  414. /* Detect a wrap-around to maintain queue generation. Note
  415. * that this is safe since we hold the socket lock across the
  416. * two queue pair operations.
  417. */
  418. if (copied >=
  419. vmci_trans(vsk)->consume_size - data->consume_head)
  420. PKT_FIELD(vsk, consume_q_generation)++;
  421. #endif
  422. err = vmci_transport_send_read_notification(sk);
  423. if (err < 0)
  424. return err;
  425. }
  426. return err;
  427. }
  428. static int
  429. vmci_transport_notify_pkt_send_init(
  430. struct sock *sk,
  431. struct vmci_transport_send_notify_data *data)
  432. {
  433. #ifdef VSOCK_OPTIMIZATION_WAITING_NOTIFY
  434. data->consume_head = 0;
  435. data->produce_tail = 0;
  436. #endif
  437. return 0;
  438. }
  439. static int
  440. vmci_transport_notify_pkt_send_pre_block(
  441. struct sock *sk,
  442. struct vmci_transport_send_notify_data *data)
  443. {
  444. /* Notify our peer that we are waiting for room to write. */
  445. if (!send_waiting_write(sk, 1))
  446. return -EHOSTUNREACH;
  447. return 0;
  448. }
  449. static int
  450. vmci_transport_notify_pkt_send_pre_enqueue(
  451. struct sock *sk,
  452. struct vmci_transport_send_notify_data *data)
  453. {
  454. struct vsock_sock *vsk = vsock_sk(sk);
  455. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  456. vmci_qpair_get_produce_indexes(vmci_trans(vsk)->qpair,
  457. &data->produce_tail,
  458. &data->consume_head);
  459. #endif
  460. return 0;
  461. }
  462. static int
  463. vmci_transport_notify_pkt_send_post_enqueue(
  464. struct sock *sk,
  465. ssize_t written,
  466. struct vmci_transport_send_notify_data *data)
  467. {
  468. int err = 0;
  469. struct vsock_sock *vsk;
  470. bool sent_wrote = false;
  471. int retries = 0;
  472. vsk = vsock_sk(sk);
  473. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  474. /* Detect a wrap-around to maintain queue generation. Note that this
  475. * is safe since we hold the socket lock across the two queue pair
  476. * operations.
  477. */
  478. if (written >= vmci_trans(vsk)->produce_size - data->produce_tail)
  479. PKT_FIELD(vsk, produce_q_generation)++;
  480. #endif
  481. if (vmci_transport_notify_waiting_read(vsk)) {
  482. /* Notify the peer that we have written, retrying the send on
  483. * failure up to our maximum value. See the XXX comment for the
  484. * corresponding piece of code in StreamRecvmsg() for potential
  485. * improvements.
  486. */
  487. while (!(vsk->peer_shutdown & RCV_SHUTDOWN) &&
  488. !sent_wrote &&
  489. retries < VMCI_TRANSPORT_MAX_DGRAM_RESENDS) {
  490. err = vmci_transport_send_wrote(sk);
  491. if (err >= 0)
  492. sent_wrote = true;
  493. retries++;
  494. }
  495. if (retries >= VMCI_TRANSPORT_MAX_DGRAM_RESENDS) {
  496. pr_err("%p unable to send wrote notify to peer\n", sk);
  497. return err;
  498. } else {
  499. #if defined(VSOCK_OPTIMIZATION_WAITING_NOTIFY)
  500. PKT_FIELD(vsk, peer_waiting_read) = false;
  501. #endif
  502. }
  503. }
  504. return err;
  505. }
  506. static void
  507. vmci_transport_notify_pkt_handle_pkt(
  508. struct sock *sk,
  509. struct vmci_transport_packet *pkt,
  510. bool bottom_half,
  511. struct sockaddr_vm *dst,
  512. struct sockaddr_vm *src, bool *pkt_processed)
  513. {
  514. bool processed = false;
  515. switch (pkt->type) {
  516. case VMCI_TRANSPORT_PACKET_TYPE_WROTE:
  517. vmci_transport_handle_wrote(sk, pkt, bottom_half, dst, src);
  518. processed = true;
  519. break;
  520. case VMCI_TRANSPORT_PACKET_TYPE_READ:
  521. vmci_transport_handle_read(sk, pkt, bottom_half, dst, src);
  522. processed = true;
  523. break;
  524. case VMCI_TRANSPORT_PACKET_TYPE_WAITING_WRITE:
  525. vmci_transport_handle_waiting_write(sk, pkt, bottom_half,
  526. dst, src);
  527. processed = true;
  528. break;
  529. case VMCI_TRANSPORT_PACKET_TYPE_WAITING_READ:
  530. vmci_transport_handle_waiting_read(sk, pkt, bottom_half,
  531. dst, src);
  532. processed = true;
  533. break;
  534. }
  535. if (pkt_processed)
  536. *pkt_processed = processed;
  537. }
  538. static void vmci_transport_notify_pkt_process_request(struct sock *sk)
  539. {
  540. struct vsock_sock *vsk = vsock_sk(sk);
  541. PKT_FIELD(vsk, write_notify_window) = vmci_trans(vsk)->consume_size;
  542. if (vmci_trans(vsk)->consume_size <
  543. PKT_FIELD(vsk, write_notify_min_window))
  544. PKT_FIELD(vsk, write_notify_min_window) =
  545. vmci_trans(vsk)->consume_size;
  546. }
  547. static void vmci_transport_notify_pkt_process_negotiate(struct sock *sk)
  548. {
  549. struct vsock_sock *vsk = vsock_sk(sk);
  550. PKT_FIELD(vsk, write_notify_window) = vmci_trans(vsk)->consume_size;
  551. if (vmci_trans(vsk)->consume_size <
  552. PKT_FIELD(vsk, write_notify_min_window))
  553. PKT_FIELD(vsk, write_notify_min_window) =
  554. vmci_trans(vsk)->consume_size;
  555. }
  556. /* Socket control packet based operations. */
  557. const struct vmci_transport_notify_ops vmci_transport_notify_pkt_ops = {
  558. .socket_init = vmci_transport_notify_pkt_socket_init,
  559. .socket_destruct = vmci_transport_notify_pkt_socket_destruct,
  560. .poll_in = vmci_transport_notify_pkt_poll_in,
  561. .poll_out = vmci_transport_notify_pkt_poll_out,
  562. .handle_notify_pkt = vmci_transport_notify_pkt_handle_pkt,
  563. .recv_init = vmci_transport_notify_pkt_recv_init,
  564. .recv_pre_block = vmci_transport_notify_pkt_recv_pre_block,
  565. .recv_pre_dequeue = vmci_transport_notify_pkt_recv_pre_dequeue,
  566. .recv_post_dequeue = vmci_transport_notify_pkt_recv_post_dequeue,
  567. .send_init = vmci_transport_notify_pkt_send_init,
  568. .send_pre_block = vmci_transport_notify_pkt_send_pre_block,
  569. .send_pre_enqueue = vmci_transport_notify_pkt_send_pre_enqueue,
  570. .send_post_enqueue = vmci_transport_notify_pkt_send_post_enqueue,
  571. .process_request = vmci_transport_notify_pkt_process_request,
  572. .process_negotiate = vmci_transport_notify_pkt_process_negotiate,
  573. };