call_object.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590
  1. /* RxRPC individual remote procedure call handling
  2. *
  3. * Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
  4. * Written by David Howells (dhowells@redhat.com)
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License
  8. * as published by the Free Software Foundation; either version
  9. * 2 of the License, or (at your option) any later version.
  10. */
  11. #define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
  12. #include <linux/slab.h>
  13. #include <linux/module.h>
  14. #include <linux/circ_buf.h>
  15. #include <linux/spinlock_types.h>
  16. #include <net/sock.h>
  17. #include <net/af_rxrpc.h>
  18. #include "ar-internal.h"
  19. const char *const rxrpc_call_states[NR__RXRPC_CALL_STATES] = {
  20. [RXRPC_CALL_UNINITIALISED] = "Uninit ",
  21. [RXRPC_CALL_CLIENT_AWAIT_CONN] = "ClWtConn",
  22. [RXRPC_CALL_CLIENT_SEND_REQUEST] = "ClSndReq",
  23. [RXRPC_CALL_CLIENT_AWAIT_REPLY] = "ClAwtRpl",
  24. [RXRPC_CALL_CLIENT_RECV_REPLY] = "ClRcvRpl",
  25. [RXRPC_CALL_SERVER_PREALLOC] = "SvPrealc",
  26. [RXRPC_CALL_SERVER_SECURING] = "SvSecure",
  27. [RXRPC_CALL_SERVER_ACCEPTING] = "SvAccept",
  28. [RXRPC_CALL_SERVER_RECV_REQUEST] = "SvRcvReq",
  29. [RXRPC_CALL_SERVER_ACK_REQUEST] = "SvAckReq",
  30. [RXRPC_CALL_SERVER_SEND_REPLY] = "SvSndRpl",
  31. [RXRPC_CALL_SERVER_AWAIT_ACK] = "SvAwtACK",
  32. [RXRPC_CALL_COMPLETE] = "Complete",
  33. };
  34. const char *const rxrpc_call_completions[NR__RXRPC_CALL_COMPLETIONS] = {
  35. [RXRPC_CALL_SUCCEEDED] = "Complete",
  36. [RXRPC_CALL_REMOTELY_ABORTED] = "RmtAbort",
  37. [RXRPC_CALL_LOCALLY_ABORTED] = "LocAbort",
  38. [RXRPC_CALL_LOCAL_ERROR] = "LocError",
  39. [RXRPC_CALL_NETWORK_ERROR] = "NetError",
  40. };
  41. struct kmem_cache *rxrpc_call_jar;
  42. LIST_HEAD(rxrpc_calls);
  43. DEFINE_RWLOCK(rxrpc_call_lock);
  44. static void rxrpc_call_timer_expired(unsigned long _call)
  45. {
  46. struct rxrpc_call *call = (struct rxrpc_call *)_call;
  47. _enter("%d", call->debug_id);
  48. if (call->state < RXRPC_CALL_COMPLETE)
  49. rxrpc_set_timer(call, rxrpc_timer_expired, ktime_get_real());
  50. }
  51. /*
  52. * find an extant server call
  53. * - called in process context with IRQs enabled
  54. */
  55. struct rxrpc_call *rxrpc_find_call_by_user_ID(struct rxrpc_sock *rx,
  56. unsigned long user_call_ID)
  57. {
  58. struct rxrpc_call *call;
  59. struct rb_node *p;
  60. _enter("%p,%lx", rx, user_call_ID);
  61. read_lock(&rx->call_lock);
  62. p = rx->calls.rb_node;
  63. while (p) {
  64. call = rb_entry(p, struct rxrpc_call, sock_node);
  65. if (user_call_ID < call->user_call_ID)
  66. p = p->rb_left;
  67. else if (user_call_ID > call->user_call_ID)
  68. p = p->rb_right;
  69. else
  70. goto found_extant_call;
  71. }
  72. read_unlock(&rx->call_lock);
  73. _leave(" = NULL");
  74. return NULL;
  75. found_extant_call:
  76. rxrpc_get_call(call, rxrpc_call_got);
  77. read_unlock(&rx->call_lock);
  78. _leave(" = %p [%d]", call, atomic_read(&call->usage));
  79. return call;
  80. }
  81. /*
  82. * allocate a new call
  83. */
  84. struct rxrpc_call *rxrpc_alloc_call(gfp_t gfp)
  85. {
  86. struct rxrpc_call *call;
  87. call = kmem_cache_zalloc(rxrpc_call_jar, gfp);
  88. if (!call)
  89. return NULL;
  90. call->rxtx_buffer = kcalloc(RXRPC_RXTX_BUFF_SIZE,
  91. sizeof(struct sk_buff *),
  92. gfp);
  93. if (!call->rxtx_buffer)
  94. goto nomem;
  95. call->rxtx_annotations = kcalloc(RXRPC_RXTX_BUFF_SIZE, sizeof(u8), gfp);
  96. if (!call->rxtx_annotations)
  97. goto nomem_2;
  98. setup_timer(&call->timer, rxrpc_call_timer_expired,
  99. (unsigned long)call);
  100. INIT_WORK(&call->processor, &rxrpc_process_call);
  101. INIT_LIST_HEAD(&call->link);
  102. INIT_LIST_HEAD(&call->chan_wait_link);
  103. INIT_LIST_HEAD(&call->accept_link);
  104. INIT_LIST_HEAD(&call->recvmsg_link);
  105. INIT_LIST_HEAD(&call->sock_link);
  106. init_waitqueue_head(&call->waitq);
  107. spin_lock_init(&call->lock);
  108. rwlock_init(&call->state_lock);
  109. atomic_set(&call->usage, 1);
  110. call->debug_id = atomic_inc_return(&rxrpc_debug_id);
  111. memset(&call->sock_node, 0xed, sizeof(call->sock_node));
  112. /* Leave space in the ring to handle a maxed-out jumbo packet */
  113. call->rx_winsize = rxrpc_rx_window_size;
  114. call->tx_winsize = 16;
  115. call->rx_expect_next = 1;
  116. if (RXRPC_TX_SMSS > 2190)
  117. call->cong_cwnd = 2;
  118. else if (RXRPC_TX_SMSS > 1095)
  119. call->cong_cwnd = 3;
  120. else
  121. call->cong_cwnd = 4;
  122. call->cong_ssthresh = RXRPC_RXTX_BUFF_SIZE - 1;
  123. return call;
  124. nomem_2:
  125. kfree(call->rxtx_buffer);
  126. nomem:
  127. kmem_cache_free(rxrpc_call_jar, call);
  128. return NULL;
  129. }
  130. /*
  131. * Allocate a new client call.
  132. */
  133. static struct rxrpc_call *rxrpc_alloc_client_call(struct sockaddr_rxrpc *srx,
  134. gfp_t gfp)
  135. {
  136. struct rxrpc_call *call;
  137. ktime_t now;
  138. _enter("");
  139. call = rxrpc_alloc_call(gfp);
  140. if (!call)
  141. return ERR_PTR(-ENOMEM);
  142. call->state = RXRPC_CALL_CLIENT_AWAIT_CONN;
  143. call->service_id = srx->srx_service;
  144. call->tx_phase = true;
  145. now = ktime_get_real();
  146. call->acks_latest_ts = now;
  147. call->cong_tstamp = now;
  148. _leave(" = %p", call);
  149. return call;
  150. }
  151. /*
  152. * Initiate the call ack/resend/expiry timer.
  153. */
  154. static void rxrpc_start_call_timer(struct rxrpc_call *call)
  155. {
  156. ktime_t now = ktime_get_real(), expire_at;
  157. expire_at = ktime_add_ms(now, rxrpc_max_call_lifetime);
  158. call->expire_at = expire_at;
  159. call->ack_at = expire_at;
  160. call->ping_at = expire_at;
  161. call->resend_at = expire_at;
  162. call->timer.expires = jiffies + LONG_MAX / 2;
  163. rxrpc_set_timer(call, rxrpc_timer_begin, now);
  164. }
  165. /*
  166. * set up a call for the given data
  167. * - called in process context with IRQs enabled
  168. */
  169. struct rxrpc_call *rxrpc_new_client_call(struct rxrpc_sock *rx,
  170. struct rxrpc_conn_parameters *cp,
  171. struct sockaddr_rxrpc *srx,
  172. unsigned long user_call_ID,
  173. gfp_t gfp)
  174. {
  175. struct rxrpc_call *call, *xcall;
  176. struct rb_node *parent, **pp;
  177. const void *here = __builtin_return_address(0);
  178. int ret;
  179. _enter("%p,%lx", rx, user_call_ID);
  180. call = rxrpc_alloc_client_call(srx, gfp);
  181. if (IS_ERR(call)) {
  182. _leave(" = %ld", PTR_ERR(call));
  183. return call;
  184. }
  185. trace_rxrpc_call(call, rxrpc_call_new_client, atomic_read(&call->usage),
  186. here, (const void *)user_call_ID);
  187. /* Publish the call, even though it is incompletely set up as yet */
  188. write_lock(&rx->call_lock);
  189. pp = &rx->calls.rb_node;
  190. parent = NULL;
  191. while (*pp) {
  192. parent = *pp;
  193. xcall = rb_entry(parent, struct rxrpc_call, sock_node);
  194. if (user_call_ID < xcall->user_call_ID)
  195. pp = &(*pp)->rb_left;
  196. else if (user_call_ID > xcall->user_call_ID)
  197. pp = &(*pp)->rb_right;
  198. else
  199. goto error_dup_user_ID;
  200. }
  201. rcu_assign_pointer(call->socket, rx);
  202. call->user_call_ID = user_call_ID;
  203. __set_bit(RXRPC_CALL_HAS_USERID, &call->flags);
  204. rxrpc_get_call(call, rxrpc_call_got_userid);
  205. rb_link_node(&call->sock_node, parent, pp);
  206. rb_insert_color(&call->sock_node, &rx->calls);
  207. list_add(&call->sock_link, &rx->sock_calls);
  208. write_unlock(&rx->call_lock);
  209. write_lock(&rxrpc_call_lock);
  210. list_add_tail(&call->link, &rxrpc_calls);
  211. write_unlock(&rxrpc_call_lock);
  212. /* Set up or get a connection record and set the protocol parameters,
  213. * including channel number and call ID.
  214. */
  215. ret = rxrpc_connect_call(call, cp, srx, gfp);
  216. if (ret < 0)
  217. goto error;
  218. trace_rxrpc_call(call, rxrpc_call_connected, atomic_read(&call->usage),
  219. here, NULL);
  220. spin_lock_bh(&call->conn->params.peer->lock);
  221. hlist_add_head(&call->error_link,
  222. &call->conn->params.peer->error_targets);
  223. spin_unlock_bh(&call->conn->params.peer->lock);
  224. rxrpc_start_call_timer(call);
  225. _net("CALL new %d on CONN %d", call->debug_id, call->conn->debug_id);
  226. _leave(" = %p [new]", call);
  227. return call;
  228. /* We unexpectedly found the user ID in the list after taking
  229. * the call_lock. This shouldn't happen unless the user races
  230. * with itself and tries to add the same user ID twice at the
  231. * same time in different threads.
  232. */
  233. error_dup_user_ID:
  234. write_unlock(&rx->call_lock);
  235. ret = -EEXIST;
  236. error:
  237. __rxrpc_set_call_completion(call, RXRPC_CALL_LOCAL_ERROR,
  238. RX_CALL_DEAD, ret);
  239. trace_rxrpc_call(call, rxrpc_call_error, atomic_read(&call->usage),
  240. here, ERR_PTR(ret));
  241. rxrpc_release_call(rx, call);
  242. rxrpc_put_call(call, rxrpc_call_put);
  243. _leave(" = %d", ret);
  244. return ERR_PTR(ret);
  245. }
  246. /*
  247. * Set up an incoming call. call->conn points to the connection.
  248. * This is called in BH context and isn't allowed to fail.
  249. */
  250. void rxrpc_incoming_call(struct rxrpc_sock *rx,
  251. struct rxrpc_call *call,
  252. struct sk_buff *skb)
  253. {
  254. struct rxrpc_connection *conn = call->conn;
  255. struct rxrpc_skb_priv *sp = rxrpc_skb(skb);
  256. u32 chan;
  257. _enter(",%d", call->conn->debug_id);
  258. rcu_assign_pointer(call->socket, rx);
  259. call->call_id = sp->hdr.callNumber;
  260. call->service_id = sp->hdr.serviceId;
  261. call->cid = sp->hdr.cid;
  262. call->state = RXRPC_CALL_SERVER_ACCEPTING;
  263. if (sp->hdr.securityIndex > 0)
  264. call->state = RXRPC_CALL_SERVER_SECURING;
  265. call->cong_tstamp = skb->tstamp;
  266. /* Set the channel for this call. We don't get channel_lock as we're
  267. * only defending against the data_ready handler (which we're called
  268. * from) and the RESPONSE packet parser (which is only really
  269. * interested in call_counter and can cope with a disagreement with the
  270. * call pointer).
  271. */
  272. chan = sp->hdr.cid & RXRPC_CHANNELMASK;
  273. conn->channels[chan].call_counter = call->call_id;
  274. conn->channels[chan].call_id = call->call_id;
  275. rcu_assign_pointer(conn->channels[chan].call, call);
  276. spin_lock(&conn->params.peer->lock);
  277. hlist_add_head(&call->error_link, &conn->params.peer->error_targets);
  278. spin_unlock(&conn->params.peer->lock);
  279. _net("CALL incoming %d on CONN %d", call->debug_id, call->conn->debug_id);
  280. rxrpc_start_call_timer(call);
  281. _leave("");
  282. }
  283. /*
  284. * Queue a call's work processor, getting a ref to pass to the work queue.
  285. */
  286. bool rxrpc_queue_call(struct rxrpc_call *call)
  287. {
  288. const void *here = __builtin_return_address(0);
  289. int n = __atomic_add_unless(&call->usage, 1, 0);
  290. if (n == 0)
  291. return false;
  292. if (rxrpc_queue_work(&call->processor))
  293. trace_rxrpc_call(call, rxrpc_call_queued, n + 1, here, NULL);
  294. else
  295. rxrpc_put_call(call, rxrpc_call_put_noqueue);
  296. return true;
  297. }
  298. /*
  299. * Queue a call's work processor, passing the callers ref to the work queue.
  300. */
  301. bool __rxrpc_queue_call(struct rxrpc_call *call)
  302. {
  303. const void *here = __builtin_return_address(0);
  304. int n = atomic_read(&call->usage);
  305. ASSERTCMP(n, >=, 1);
  306. if (rxrpc_queue_work(&call->processor))
  307. trace_rxrpc_call(call, rxrpc_call_queued_ref, n, here, NULL);
  308. else
  309. rxrpc_put_call(call, rxrpc_call_put_noqueue);
  310. return true;
  311. }
  312. /*
  313. * Note the re-emergence of a call.
  314. */
  315. void rxrpc_see_call(struct rxrpc_call *call)
  316. {
  317. const void *here = __builtin_return_address(0);
  318. if (call) {
  319. int n = atomic_read(&call->usage);
  320. trace_rxrpc_call(call, rxrpc_call_seen, n, here, NULL);
  321. }
  322. }
  323. /*
  324. * Note the addition of a ref on a call.
  325. */
  326. void rxrpc_get_call(struct rxrpc_call *call, enum rxrpc_call_trace op)
  327. {
  328. const void *here = __builtin_return_address(0);
  329. int n = atomic_inc_return(&call->usage);
  330. trace_rxrpc_call(call, op, n, here, NULL);
  331. }
  332. /*
  333. * Detach a call from its owning socket.
  334. */
  335. void rxrpc_release_call(struct rxrpc_sock *rx, struct rxrpc_call *call)
  336. {
  337. const void *here = __builtin_return_address(0);
  338. struct rxrpc_connection *conn = call->conn;
  339. bool put = false;
  340. int i;
  341. _enter("{%d,%d}", call->debug_id, atomic_read(&call->usage));
  342. trace_rxrpc_call(call, rxrpc_call_release, atomic_read(&call->usage),
  343. here, (const void *)call->flags);
  344. ASSERTCMP(call->state, ==, RXRPC_CALL_COMPLETE);
  345. spin_lock_bh(&call->lock);
  346. if (test_and_set_bit(RXRPC_CALL_RELEASED, &call->flags))
  347. BUG();
  348. spin_unlock_bh(&call->lock);
  349. del_timer_sync(&call->timer);
  350. /* Make sure we don't get any more notifications */
  351. write_lock_bh(&rx->recvmsg_lock);
  352. if (!list_empty(&call->recvmsg_link)) {
  353. _debug("unlinking once-pending call %p { e=%lx f=%lx }",
  354. call, call->events, call->flags);
  355. list_del(&call->recvmsg_link);
  356. put = true;
  357. }
  358. /* list_empty() must return false in rxrpc_notify_socket() */
  359. call->recvmsg_link.next = NULL;
  360. call->recvmsg_link.prev = NULL;
  361. write_unlock_bh(&rx->recvmsg_lock);
  362. if (put)
  363. rxrpc_put_call(call, rxrpc_call_put);
  364. write_lock(&rx->call_lock);
  365. if (test_and_clear_bit(RXRPC_CALL_HAS_USERID, &call->flags)) {
  366. rb_erase(&call->sock_node, &rx->calls);
  367. memset(&call->sock_node, 0xdd, sizeof(call->sock_node));
  368. rxrpc_put_call(call, rxrpc_call_put_userid);
  369. }
  370. list_del(&call->sock_link);
  371. write_unlock(&rx->call_lock);
  372. _debug("RELEASE CALL %p (%d CONN %p)", call, call->debug_id, conn);
  373. if (conn)
  374. rxrpc_disconnect_call(call);
  375. for (i = 0; i < RXRPC_RXTX_BUFF_SIZE; i++) {
  376. rxrpc_free_skb(call->rxtx_buffer[i],
  377. (call->tx_phase ? rxrpc_skb_tx_cleaned :
  378. rxrpc_skb_rx_cleaned));
  379. call->rxtx_buffer[i] = NULL;
  380. }
  381. _leave("");
  382. }
  383. /*
  384. * release all the calls associated with a socket
  385. */
  386. void rxrpc_release_calls_on_socket(struct rxrpc_sock *rx)
  387. {
  388. struct rxrpc_call *call;
  389. _enter("%p", rx);
  390. while (!list_empty(&rx->to_be_accepted)) {
  391. call = list_entry(rx->to_be_accepted.next,
  392. struct rxrpc_call, accept_link);
  393. list_del(&call->accept_link);
  394. rxrpc_abort_call("SKR", call, 0, RX_CALL_DEAD, ECONNRESET);
  395. rxrpc_put_call(call, rxrpc_call_put);
  396. }
  397. while (!list_empty(&rx->sock_calls)) {
  398. call = list_entry(rx->sock_calls.next,
  399. struct rxrpc_call, sock_link);
  400. rxrpc_get_call(call, rxrpc_call_got);
  401. rxrpc_abort_call("SKT", call, 0, RX_CALL_DEAD, ECONNRESET);
  402. rxrpc_send_abort_packet(call);
  403. rxrpc_release_call(rx, call);
  404. rxrpc_put_call(call, rxrpc_call_put);
  405. }
  406. _leave("");
  407. }
  408. /*
  409. * release a call
  410. */
  411. void rxrpc_put_call(struct rxrpc_call *call, enum rxrpc_call_trace op)
  412. {
  413. const void *here = __builtin_return_address(0);
  414. int n;
  415. ASSERT(call != NULL);
  416. n = atomic_dec_return(&call->usage);
  417. trace_rxrpc_call(call, op, n, here, NULL);
  418. ASSERTCMP(n, >=, 0);
  419. if (n == 0) {
  420. _debug("call %d dead", call->debug_id);
  421. ASSERTCMP(call->state, ==, RXRPC_CALL_COMPLETE);
  422. write_lock(&rxrpc_call_lock);
  423. list_del_init(&call->link);
  424. write_unlock(&rxrpc_call_lock);
  425. rxrpc_cleanup_call(call);
  426. }
  427. }
  428. /*
  429. * Final call destruction under RCU.
  430. */
  431. static void rxrpc_rcu_destroy_call(struct rcu_head *rcu)
  432. {
  433. struct rxrpc_call *call = container_of(rcu, struct rxrpc_call, rcu);
  434. rxrpc_put_peer(call->peer);
  435. kfree(call->rxtx_buffer);
  436. kfree(call->rxtx_annotations);
  437. kmem_cache_free(rxrpc_call_jar, call);
  438. }
  439. /*
  440. * clean up a call
  441. */
  442. void rxrpc_cleanup_call(struct rxrpc_call *call)
  443. {
  444. int i;
  445. _net("DESTROY CALL %d", call->debug_id);
  446. memset(&call->sock_node, 0xcd, sizeof(call->sock_node));
  447. del_timer_sync(&call->timer);
  448. ASSERTCMP(call->state, ==, RXRPC_CALL_COMPLETE);
  449. ASSERT(test_bit(RXRPC_CALL_RELEASED, &call->flags));
  450. ASSERTCMP(call->conn, ==, NULL);
  451. /* Clean up the Rx/Tx buffer */
  452. for (i = 0; i < RXRPC_RXTX_BUFF_SIZE; i++)
  453. rxrpc_free_skb(call->rxtx_buffer[i],
  454. (call->tx_phase ? rxrpc_skb_tx_cleaned :
  455. rxrpc_skb_rx_cleaned));
  456. rxrpc_free_skb(call->tx_pending, rxrpc_skb_tx_cleaned);
  457. call_rcu(&call->rcu, rxrpc_rcu_destroy_call);
  458. }
  459. /*
  460. * Make sure that all calls are gone.
  461. */
  462. void __exit rxrpc_destroy_all_calls(void)
  463. {
  464. struct rxrpc_call *call;
  465. _enter("");
  466. if (list_empty(&rxrpc_calls))
  467. return;
  468. write_lock(&rxrpc_call_lock);
  469. while (!list_empty(&rxrpc_calls)) {
  470. call = list_entry(rxrpc_calls.next, struct rxrpc_call, link);
  471. _debug("Zapping call %p", call);
  472. rxrpc_see_call(call);
  473. list_del_init(&call->link);
  474. pr_err("Call %p still in use (%d,%s,%lx,%lx)!\n",
  475. call, atomic_read(&call->usage),
  476. rxrpc_call_states[call->state],
  477. call->flags, call->events);
  478. write_unlock(&rxrpc_call_lock);
  479. cond_resched();
  480. write_lock(&rxrpc_call_lock);
  481. }
  482. write_unlock(&rxrpc_call_lock);
  483. }