xprt.c 37 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422
  1. /*
  2. * linux/net/sunrpc/xprt.c
  3. *
  4. * This is a generic RPC call interface supporting congestion avoidance,
  5. * and asynchronous calls.
  6. *
  7. * The interface works like this:
  8. *
  9. * - When a process places a call, it allocates a request slot if
  10. * one is available. Otherwise, it sleeps on the backlog queue
  11. * (xprt_reserve).
  12. * - Next, the caller puts together the RPC message, stuffs it into
  13. * the request struct, and calls xprt_transmit().
  14. * - xprt_transmit sends the message and installs the caller on the
  15. * transport's wait list. At the same time, if a reply is expected,
  16. * it installs a timer that is run after the packet's timeout has
  17. * expired.
  18. * - When a packet arrives, the data_ready handler walks the list of
  19. * pending requests for that transport. If a matching XID is found, the
  20. * caller is woken up, and the timer removed.
  21. * - When no reply arrives within the timeout interval, the timer is
  22. * fired by the kernel and runs xprt_timer(). It either adjusts the
  23. * timeout values (minor timeout) or wakes up the caller with a status
  24. * of -ETIMEDOUT.
  25. * - When the caller receives a notification from RPC that a reply arrived,
  26. * it should release the RPC slot, and process the reply.
  27. * If the call timed out, it may choose to retry the operation by
  28. * adjusting the initial timeout value, and simply calling rpc_call
  29. * again.
  30. *
  31. * Support for async RPC is done through a set of RPC-specific scheduling
  32. * primitives that `transparently' work for processes as well as async
  33. * tasks that rely on callbacks.
  34. *
  35. * Copyright (C) 1995-1997, Olaf Kirch <okir@monad.swb.de>
  36. *
  37. * Transport switch API copyright (C) 2005, Chuck Lever <cel@netapp.com>
  38. */
  39. #include <linux/module.h>
  40. #include <linux/types.h>
  41. #include <linux/interrupt.h>
  42. #include <linux/workqueue.h>
  43. #include <linux/net.h>
  44. #include <linux/ktime.h>
  45. #include <linux/sunrpc/clnt.h>
  46. #include <linux/sunrpc/metrics.h>
  47. #include <linux/sunrpc/bc_xprt.h>
  48. #include <trace/events/sunrpc.h>
  49. #include "sunrpc.h"
  50. /*
  51. * Local variables
  52. */
  53. #if IS_ENABLED(CONFIG_SUNRPC_DEBUG)
  54. # define RPCDBG_FACILITY RPCDBG_XPRT
  55. #endif
  56. /*
  57. * Local functions
  58. */
  59. static void xprt_init(struct rpc_xprt *xprt, struct net *net);
  60. static void xprt_request_init(struct rpc_task *, struct rpc_xprt *);
  61. static void xprt_connect_status(struct rpc_task *task);
  62. static int __xprt_get_cong(struct rpc_xprt *, struct rpc_task *);
  63. static void __xprt_put_cong(struct rpc_xprt *, struct rpc_rqst *);
  64. static void xprt_destroy(struct rpc_xprt *xprt);
  65. static DEFINE_SPINLOCK(xprt_list_lock);
  66. static LIST_HEAD(xprt_list);
  67. /**
  68. * xprt_register_transport - register a transport implementation
  69. * @transport: transport to register
  70. *
  71. * If a transport implementation is loaded as a kernel module, it can
  72. * call this interface to make itself known to the RPC client.
  73. *
  74. * Returns:
  75. * 0: transport successfully registered
  76. * -EEXIST: transport already registered
  77. * -EINVAL: transport module being unloaded
  78. */
  79. int xprt_register_transport(struct xprt_class *transport)
  80. {
  81. struct xprt_class *t;
  82. int result;
  83. result = -EEXIST;
  84. spin_lock(&xprt_list_lock);
  85. list_for_each_entry(t, &xprt_list, list) {
  86. /* don't register the same transport class twice */
  87. if (t->ident == transport->ident)
  88. goto out;
  89. }
  90. list_add_tail(&transport->list, &xprt_list);
  91. printk(KERN_INFO "RPC: Registered %s transport module.\n",
  92. transport->name);
  93. result = 0;
  94. out:
  95. spin_unlock(&xprt_list_lock);
  96. return result;
  97. }
  98. EXPORT_SYMBOL_GPL(xprt_register_transport);
  99. /**
  100. * xprt_unregister_transport - unregister a transport implementation
  101. * @transport: transport to unregister
  102. *
  103. * Returns:
  104. * 0: transport successfully unregistered
  105. * -ENOENT: transport never registered
  106. */
  107. int xprt_unregister_transport(struct xprt_class *transport)
  108. {
  109. struct xprt_class *t;
  110. int result;
  111. result = 0;
  112. spin_lock(&xprt_list_lock);
  113. list_for_each_entry(t, &xprt_list, list) {
  114. if (t == transport) {
  115. printk(KERN_INFO
  116. "RPC: Unregistered %s transport module.\n",
  117. transport->name);
  118. list_del_init(&transport->list);
  119. goto out;
  120. }
  121. }
  122. result = -ENOENT;
  123. out:
  124. spin_unlock(&xprt_list_lock);
  125. return result;
  126. }
  127. EXPORT_SYMBOL_GPL(xprt_unregister_transport);
  128. /**
  129. * xprt_load_transport - load a transport implementation
  130. * @transport_name: transport to load
  131. *
  132. * Returns:
  133. * 0: transport successfully loaded
  134. * -ENOENT: transport module not available
  135. */
  136. int xprt_load_transport(const char *transport_name)
  137. {
  138. struct xprt_class *t;
  139. int result;
  140. result = 0;
  141. spin_lock(&xprt_list_lock);
  142. list_for_each_entry(t, &xprt_list, list) {
  143. if (strcmp(t->name, transport_name) == 0) {
  144. spin_unlock(&xprt_list_lock);
  145. goto out;
  146. }
  147. }
  148. spin_unlock(&xprt_list_lock);
  149. result = request_module("xprt%s", transport_name);
  150. out:
  151. return result;
  152. }
  153. EXPORT_SYMBOL_GPL(xprt_load_transport);
  154. /**
  155. * xprt_reserve_xprt - serialize write access to transports
  156. * @task: task that is requesting access to the transport
  157. * @xprt: pointer to the target transport
  158. *
  159. * This prevents mixing the payload of separate requests, and prevents
  160. * transport connects from colliding with writes. No congestion control
  161. * is provided.
  162. */
  163. int xprt_reserve_xprt(struct rpc_xprt *xprt, struct rpc_task *task)
  164. {
  165. struct rpc_rqst *req = task->tk_rqstp;
  166. int priority;
  167. if (test_and_set_bit(XPRT_LOCKED, &xprt->state)) {
  168. if (task == xprt->snd_task)
  169. return 1;
  170. goto out_sleep;
  171. }
  172. xprt->snd_task = task;
  173. if (req != NULL)
  174. req->rq_ntrans++;
  175. return 1;
  176. out_sleep:
  177. dprintk("RPC: %5u failed to lock transport %p\n",
  178. task->tk_pid, xprt);
  179. task->tk_timeout = 0;
  180. task->tk_status = -EAGAIN;
  181. if (req == NULL)
  182. priority = RPC_PRIORITY_LOW;
  183. else if (!req->rq_ntrans)
  184. priority = RPC_PRIORITY_NORMAL;
  185. else
  186. priority = RPC_PRIORITY_HIGH;
  187. rpc_sleep_on_priority(&xprt->sending, task, NULL, priority);
  188. return 0;
  189. }
  190. EXPORT_SYMBOL_GPL(xprt_reserve_xprt);
  191. static void xprt_clear_locked(struct rpc_xprt *xprt)
  192. {
  193. xprt->snd_task = NULL;
  194. if (!test_bit(XPRT_CLOSE_WAIT, &xprt->state)) {
  195. smp_mb__before_atomic();
  196. clear_bit(XPRT_LOCKED, &xprt->state);
  197. smp_mb__after_atomic();
  198. } else
  199. queue_work(rpciod_workqueue, &xprt->task_cleanup);
  200. }
  201. /*
  202. * xprt_reserve_xprt_cong - serialize write access to transports
  203. * @task: task that is requesting access to the transport
  204. *
  205. * Same as xprt_reserve_xprt, but Van Jacobson congestion control is
  206. * integrated into the decision of whether a request is allowed to be
  207. * woken up and given access to the transport.
  208. */
  209. int xprt_reserve_xprt_cong(struct rpc_xprt *xprt, struct rpc_task *task)
  210. {
  211. struct rpc_rqst *req = task->tk_rqstp;
  212. int priority;
  213. if (test_and_set_bit(XPRT_LOCKED, &xprt->state)) {
  214. if (task == xprt->snd_task)
  215. return 1;
  216. goto out_sleep;
  217. }
  218. if (req == NULL) {
  219. xprt->snd_task = task;
  220. return 1;
  221. }
  222. if (__xprt_get_cong(xprt, task)) {
  223. xprt->snd_task = task;
  224. req->rq_ntrans++;
  225. return 1;
  226. }
  227. xprt_clear_locked(xprt);
  228. out_sleep:
  229. if (req)
  230. __xprt_put_cong(xprt, req);
  231. dprintk("RPC: %5u failed to lock transport %p\n", task->tk_pid, xprt);
  232. task->tk_timeout = 0;
  233. task->tk_status = -EAGAIN;
  234. if (req == NULL)
  235. priority = RPC_PRIORITY_LOW;
  236. else if (!req->rq_ntrans)
  237. priority = RPC_PRIORITY_NORMAL;
  238. else
  239. priority = RPC_PRIORITY_HIGH;
  240. rpc_sleep_on_priority(&xprt->sending, task, NULL, priority);
  241. return 0;
  242. }
  243. EXPORT_SYMBOL_GPL(xprt_reserve_xprt_cong);
  244. static inline int xprt_lock_write(struct rpc_xprt *xprt, struct rpc_task *task)
  245. {
  246. int retval;
  247. spin_lock_bh(&xprt->transport_lock);
  248. retval = xprt->ops->reserve_xprt(xprt, task);
  249. spin_unlock_bh(&xprt->transport_lock);
  250. return retval;
  251. }
  252. static bool __xprt_lock_write_func(struct rpc_task *task, void *data)
  253. {
  254. struct rpc_xprt *xprt = data;
  255. struct rpc_rqst *req;
  256. req = task->tk_rqstp;
  257. xprt->snd_task = task;
  258. if (req)
  259. req->rq_ntrans++;
  260. return true;
  261. }
  262. static void __xprt_lock_write_next(struct rpc_xprt *xprt)
  263. {
  264. if (test_and_set_bit(XPRT_LOCKED, &xprt->state))
  265. return;
  266. if (rpc_wake_up_first(&xprt->sending, __xprt_lock_write_func, xprt))
  267. return;
  268. xprt_clear_locked(xprt);
  269. }
  270. static bool __xprt_lock_write_cong_func(struct rpc_task *task, void *data)
  271. {
  272. struct rpc_xprt *xprt = data;
  273. struct rpc_rqst *req;
  274. req = task->tk_rqstp;
  275. if (req == NULL) {
  276. xprt->snd_task = task;
  277. return true;
  278. }
  279. if (__xprt_get_cong(xprt, task)) {
  280. xprt->snd_task = task;
  281. req->rq_ntrans++;
  282. return true;
  283. }
  284. return false;
  285. }
  286. static void __xprt_lock_write_next_cong(struct rpc_xprt *xprt)
  287. {
  288. if (test_and_set_bit(XPRT_LOCKED, &xprt->state))
  289. return;
  290. if (RPCXPRT_CONGESTED(xprt))
  291. goto out_unlock;
  292. if (rpc_wake_up_first(&xprt->sending, __xprt_lock_write_cong_func, xprt))
  293. return;
  294. out_unlock:
  295. xprt_clear_locked(xprt);
  296. }
  297. static void xprt_task_clear_bytes_sent(struct rpc_task *task)
  298. {
  299. if (task != NULL) {
  300. struct rpc_rqst *req = task->tk_rqstp;
  301. if (req != NULL)
  302. req->rq_bytes_sent = 0;
  303. }
  304. }
  305. /**
  306. * xprt_release_xprt - allow other requests to use a transport
  307. * @xprt: transport with other tasks potentially waiting
  308. * @task: task that is releasing access to the transport
  309. *
  310. * Note that "task" can be NULL. No congestion control is provided.
  311. */
  312. void xprt_release_xprt(struct rpc_xprt *xprt, struct rpc_task *task)
  313. {
  314. if (xprt->snd_task == task) {
  315. xprt_task_clear_bytes_sent(task);
  316. xprt_clear_locked(xprt);
  317. __xprt_lock_write_next(xprt);
  318. }
  319. }
  320. EXPORT_SYMBOL_GPL(xprt_release_xprt);
  321. /**
  322. * xprt_release_xprt_cong - allow other requests to use a transport
  323. * @xprt: transport with other tasks potentially waiting
  324. * @task: task that is releasing access to the transport
  325. *
  326. * Note that "task" can be NULL. Another task is awoken to use the
  327. * transport if the transport's congestion window allows it.
  328. */
  329. void xprt_release_xprt_cong(struct rpc_xprt *xprt, struct rpc_task *task)
  330. {
  331. if (xprt->snd_task == task) {
  332. xprt_task_clear_bytes_sent(task);
  333. xprt_clear_locked(xprt);
  334. __xprt_lock_write_next_cong(xprt);
  335. }
  336. }
  337. EXPORT_SYMBOL_GPL(xprt_release_xprt_cong);
  338. static inline void xprt_release_write(struct rpc_xprt *xprt, struct rpc_task *task)
  339. {
  340. spin_lock_bh(&xprt->transport_lock);
  341. xprt->ops->release_xprt(xprt, task);
  342. spin_unlock_bh(&xprt->transport_lock);
  343. }
  344. /*
  345. * Van Jacobson congestion avoidance. Check if the congestion window
  346. * overflowed. Put the task to sleep if this is the case.
  347. */
  348. static int
  349. __xprt_get_cong(struct rpc_xprt *xprt, struct rpc_task *task)
  350. {
  351. struct rpc_rqst *req = task->tk_rqstp;
  352. if (req->rq_cong)
  353. return 1;
  354. dprintk("RPC: %5u xprt_cwnd_limited cong = %lu cwnd = %lu\n",
  355. task->tk_pid, xprt->cong, xprt->cwnd);
  356. if (RPCXPRT_CONGESTED(xprt))
  357. return 0;
  358. req->rq_cong = 1;
  359. xprt->cong += RPC_CWNDSCALE;
  360. return 1;
  361. }
  362. /*
  363. * Adjust the congestion window, and wake up the next task
  364. * that has been sleeping due to congestion
  365. */
  366. static void
  367. __xprt_put_cong(struct rpc_xprt *xprt, struct rpc_rqst *req)
  368. {
  369. if (!req->rq_cong)
  370. return;
  371. req->rq_cong = 0;
  372. xprt->cong -= RPC_CWNDSCALE;
  373. __xprt_lock_write_next_cong(xprt);
  374. }
  375. /**
  376. * xprt_release_rqst_cong - housekeeping when request is complete
  377. * @task: RPC request that recently completed
  378. *
  379. * Useful for transports that require congestion control.
  380. */
  381. void xprt_release_rqst_cong(struct rpc_task *task)
  382. {
  383. struct rpc_rqst *req = task->tk_rqstp;
  384. __xprt_put_cong(req->rq_xprt, req);
  385. }
  386. EXPORT_SYMBOL_GPL(xprt_release_rqst_cong);
  387. /**
  388. * xprt_adjust_cwnd - adjust transport congestion window
  389. * @xprt: pointer to xprt
  390. * @task: recently completed RPC request used to adjust window
  391. * @result: result code of completed RPC request
  392. *
  393. * The transport code maintains an estimate on the maximum number of out-
  394. * standing RPC requests, using a smoothed version of the congestion
  395. * avoidance implemented in 44BSD. This is basically the Van Jacobson
  396. * congestion algorithm: If a retransmit occurs, the congestion window is
  397. * halved; otherwise, it is incremented by 1/cwnd when
  398. *
  399. * - a reply is received and
  400. * - a full number of requests are outstanding and
  401. * - the congestion window hasn't been updated recently.
  402. */
  403. void xprt_adjust_cwnd(struct rpc_xprt *xprt, struct rpc_task *task, int result)
  404. {
  405. struct rpc_rqst *req = task->tk_rqstp;
  406. unsigned long cwnd = xprt->cwnd;
  407. if (result >= 0 && cwnd <= xprt->cong) {
  408. /* The (cwnd >> 1) term makes sure
  409. * the result gets rounded properly. */
  410. cwnd += (RPC_CWNDSCALE * RPC_CWNDSCALE + (cwnd >> 1)) / cwnd;
  411. if (cwnd > RPC_MAXCWND(xprt))
  412. cwnd = RPC_MAXCWND(xprt);
  413. __xprt_lock_write_next_cong(xprt);
  414. } else if (result == -ETIMEDOUT) {
  415. cwnd >>= 1;
  416. if (cwnd < RPC_CWNDSCALE)
  417. cwnd = RPC_CWNDSCALE;
  418. }
  419. dprintk("RPC: cong %ld, cwnd was %ld, now %ld\n",
  420. xprt->cong, xprt->cwnd, cwnd);
  421. xprt->cwnd = cwnd;
  422. __xprt_put_cong(xprt, req);
  423. }
  424. EXPORT_SYMBOL_GPL(xprt_adjust_cwnd);
  425. /**
  426. * xprt_wake_pending_tasks - wake all tasks on a transport's pending queue
  427. * @xprt: transport with waiting tasks
  428. * @status: result code to plant in each task before waking it
  429. *
  430. */
  431. void xprt_wake_pending_tasks(struct rpc_xprt *xprt, int status)
  432. {
  433. if (status < 0)
  434. rpc_wake_up_status(&xprt->pending, status);
  435. else
  436. rpc_wake_up(&xprt->pending);
  437. }
  438. EXPORT_SYMBOL_GPL(xprt_wake_pending_tasks);
  439. /**
  440. * xprt_wait_for_buffer_space - wait for transport output buffer to clear
  441. * @task: task to be put to sleep
  442. * @action: function pointer to be executed after wait
  443. *
  444. * Note that we only set the timer for the case of RPC_IS_SOFT(), since
  445. * we don't in general want to force a socket disconnection due to
  446. * an incomplete RPC call transmission.
  447. */
  448. void xprt_wait_for_buffer_space(struct rpc_task *task, rpc_action action)
  449. {
  450. struct rpc_rqst *req = task->tk_rqstp;
  451. struct rpc_xprt *xprt = req->rq_xprt;
  452. task->tk_timeout = RPC_IS_SOFT(task) ? req->rq_timeout : 0;
  453. rpc_sleep_on(&xprt->pending, task, action);
  454. }
  455. EXPORT_SYMBOL_GPL(xprt_wait_for_buffer_space);
  456. /**
  457. * xprt_write_space - wake the task waiting for transport output buffer space
  458. * @xprt: transport with waiting tasks
  459. *
  460. * Can be called in a soft IRQ context, so xprt_write_space never sleeps.
  461. */
  462. void xprt_write_space(struct rpc_xprt *xprt)
  463. {
  464. spin_lock_bh(&xprt->transport_lock);
  465. if (xprt->snd_task) {
  466. dprintk("RPC: write space: waking waiting task on "
  467. "xprt %p\n", xprt);
  468. rpc_wake_up_queued_task(&xprt->pending, xprt->snd_task);
  469. }
  470. spin_unlock_bh(&xprt->transport_lock);
  471. }
  472. EXPORT_SYMBOL_GPL(xprt_write_space);
  473. /**
  474. * xprt_set_retrans_timeout_def - set a request's retransmit timeout
  475. * @task: task whose timeout is to be set
  476. *
  477. * Set a request's retransmit timeout based on the transport's
  478. * default timeout parameters. Used by transports that don't adjust
  479. * the retransmit timeout based on round-trip time estimation.
  480. */
  481. void xprt_set_retrans_timeout_def(struct rpc_task *task)
  482. {
  483. task->tk_timeout = task->tk_rqstp->rq_timeout;
  484. }
  485. EXPORT_SYMBOL_GPL(xprt_set_retrans_timeout_def);
  486. /**
  487. * xprt_set_retrans_timeout_rtt - set a request's retransmit timeout
  488. * @task: task whose timeout is to be set
  489. *
  490. * Set a request's retransmit timeout using the RTT estimator.
  491. */
  492. void xprt_set_retrans_timeout_rtt(struct rpc_task *task)
  493. {
  494. int timer = task->tk_msg.rpc_proc->p_timer;
  495. struct rpc_clnt *clnt = task->tk_client;
  496. struct rpc_rtt *rtt = clnt->cl_rtt;
  497. struct rpc_rqst *req = task->tk_rqstp;
  498. unsigned long max_timeout = clnt->cl_timeout->to_maxval;
  499. task->tk_timeout = rpc_calc_rto(rtt, timer);
  500. task->tk_timeout <<= rpc_ntimeo(rtt, timer) + req->rq_retries;
  501. if (task->tk_timeout > max_timeout || task->tk_timeout == 0)
  502. task->tk_timeout = max_timeout;
  503. }
  504. EXPORT_SYMBOL_GPL(xprt_set_retrans_timeout_rtt);
  505. static void xprt_reset_majortimeo(struct rpc_rqst *req)
  506. {
  507. const struct rpc_timeout *to = req->rq_task->tk_client->cl_timeout;
  508. req->rq_majortimeo = req->rq_timeout;
  509. if (to->to_exponential)
  510. req->rq_majortimeo <<= to->to_retries;
  511. else
  512. req->rq_majortimeo += to->to_increment * to->to_retries;
  513. if (req->rq_majortimeo > to->to_maxval || req->rq_majortimeo == 0)
  514. req->rq_majortimeo = to->to_maxval;
  515. req->rq_majortimeo += jiffies;
  516. }
  517. /**
  518. * xprt_adjust_timeout - adjust timeout values for next retransmit
  519. * @req: RPC request containing parameters to use for the adjustment
  520. *
  521. */
  522. int xprt_adjust_timeout(struct rpc_rqst *req)
  523. {
  524. struct rpc_xprt *xprt = req->rq_xprt;
  525. const struct rpc_timeout *to = req->rq_task->tk_client->cl_timeout;
  526. int status = 0;
  527. if (time_before(jiffies, req->rq_majortimeo)) {
  528. if (to->to_exponential)
  529. req->rq_timeout <<= 1;
  530. else
  531. req->rq_timeout += to->to_increment;
  532. if (to->to_maxval && req->rq_timeout >= to->to_maxval)
  533. req->rq_timeout = to->to_maxval;
  534. req->rq_retries++;
  535. } else {
  536. req->rq_timeout = to->to_initval;
  537. req->rq_retries = 0;
  538. xprt_reset_majortimeo(req);
  539. /* Reset the RTT counters == "slow start" */
  540. spin_lock_bh(&xprt->transport_lock);
  541. rpc_init_rtt(req->rq_task->tk_client->cl_rtt, to->to_initval);
  542. spin_unlock_bh(&xprt->transport_lock);
  543. status = -ETIMEDOUT;
  544. }
  545. if (req->rq_timeout == 0) {
  546. printk(KERN_WARNING "xprt_adjust_timeout: rq_timeout = 0!\n");
  547. req->rq_timeout = 5 * HZ;
  548. }
  549. return status;
  550. }
  551. static void xprt_autoclose(struct work_struct *work)
  552. {
  553. struct rpc_xprt *xprt =
  554. container_of(work, struct rpc_xprt, task_cleanup);
  555. clear_bit(XPRT_CLOSE_WAIT, &xprt->state);
  556. xprt->ops->close(xprt);
  557. xprt_release_write(xprt, NULL);
  558. }
  559. /**
  560. * xprt_disconnect_done - mark a transport as disconnected
  561. * @xprt: transport to flag for disconnect
  562. *
  563. */
  564. void xprt_disconnect_done(struct rpc_xprt *xprt)
  565. {
  566. dprintk("RPC: disconnected transport %p\n", xprt);
  567. spin_lock_bh(&xprt->transport_lock);
  568. xprt_clear_connected(xprt);
  569. xprt_wake_pending_tasks(xprt, -EAGAIN);
  570. spin_unlock_bh(&xprt->transport_lock);
  571. }
  572. EXPORT_SYMBOL_GPL(xprt_disconnect_done);
  573. /**
  574. * xprt_force_disconnect - force a transport to disconnect
  575. * @xprt: transport to disconnect
  576. *
  577. */
  578. void xprt_force_disconnect(struct rpc_xprt *xprt)
  579. {
  580. /* Don't race with the test_bit() in xprt_clear_locked() */
  581. spin_lock_bh(&xprt->transport_lock);
  582. set_bit(XPRT_CLOSE_WAIT, &xprt->state);
  583. /* Try to schedule an autoclose RPC call */
  584. if (test_and_set_bit(XPRT_LOCKED, &xprt->state) == 0)
  585. queue_work(rpciod_workqueue, &xprt->task_cleanup);
  586. xprt_wake_pending_tasks(xprt, -EAGAIN);
  587. spin_unlock_bh(&xprt->transport_lock);
  588. }
  589. /**
  590. * xprt_conditional_disconnect - force a transport to disconnect
  591. * @xprt: transport to disconnect
  592. * @cookie: 'connection cookie'
  593. *
  594. * This attempts to break the connection if and only if 'cookie' matches
  595. * the current transport 'connection cookie'. It ensures that we don't
  596. * try to break the connection more than once when we need to retransmit
  597. * a batch of RPC requests.
  598. *
  599. */
  600. void xprt_conditional_disconnect(struct rpc_xprt *xprt, unsigned int cookie)
  601. {
  602. /* Don't race with the test_bit() in xprt_clear_locked() */
  603. spin_lock_bh(&xprt->transport_lock);
  604. if (cookie != xprt->connect_cookie)
  605. goto out;
  606. if (test_bit(XPRT_CLOSING, &xprt->state) || !xprt_connected(xprt))
  607. goto out;
  608. set_bit(XPRT_CLOSE_WAIT, &xprt->state);
  609. /* Try to schedule an autoclose RPC call */
  610. if (test_and_set_bit(XPRT_LOCKED, &xprt->state) == 0)
  611. queue_work(rpciod_workqueue, &xprt->task_cleanup);
  612. xprt_wake_pending_tasks(xprt, -EAGAIN);
  613. out:
  614. spin_unlock_bh(&xprt->transport_lock);
  615. }
  616. static void
  617. xprt_init_autodisconnect(unsigned long data)
  618. {
  619. struct rpc_xprt *xprt = (struct rpc_xprt *)data;
  620. spin_lock(&xprt->transport_lock);
  621. if (!list_empty(&xprt->recv))
  622. goto out_abort;
  623. if (test_and_set_bit(XPRT_LOCKED, &xprt->state))
  624. goto out_abort;
  625. spin_unlock(&xprt->transport_lock);
  626. queue_work(rpciod_workqueue, &xprt->task_cleanup);
  627. return;
  628. out_abort:
  629. spin_unlock(&xprt->transport_lock);
  630. }
  631. bool xprt_lock_connect(struct rpc_xprt *xprt,
  632. struct rpc_task *task,
  633. void *cookie)
  634. {
  635. bool ret = false;
  636. spin_lock_bh(&xprt->transport_lock);
  637. if (!test_bit(XPRT_LOCKED, &xprt->state))
  638. goto out;
  639. if (xprt->snd_task != task)
  640. goto out;
  641. xprt_task_clear_bytes_sent(task);
  642. xprt->snd_task = cookie;
  643. ret = true;
  644. out:
  645. spin_unlock_bh(&xprt->transport_lock);
  646. return ret;
  647. }
  648. void xprt_unlock_connect(struct rpc_xprt *xprt, void *cookie)
  649. {
  650. spin_lock_bh(&xprt->transport_lock);
  651. if (xprt->snd_task != cookie)
  652. goto out;
  653. if (!test_bit(XPRT_LOCKED, &xprt->state))
  654. goto out;
  655. xprt->snd_task =NULL;
  656. xprt->ops->release_xprt(xprt, NULL);
  657. out:
  658. spin_unlock_bh(&xprt->transport_lock);
  659. }
  660. /**
  661. * xprt_connect - schedule a transport connect operation
  662. * @task: RPC task that is requesting the connect
  663. *
  664. */
  665. void xprt_connect(struct rpc_task *task)
  666. {
  667. struct rpc_xprt *xprt = task->tk_rqstp->rq_xprt;
  668. dprintk("RPC: %5u xprt_connect xprt %p %s connected\n", task->tk_pid,
  669. xprt, (xprt_connected(xprt) ? "is" : "is not"));
  670. if (!xprt_bound(xprt)) {
  671. task->tk_status = -EAGAIN;
  672. return;
  673. }
  674. if (!xprt_lock_write(xprt, task))
  675. return;
  676. if (test_and_clear_bit(XPRT_CLOSE_WAIT, &xprt->state))
  677. xprt->ops->close(xprt);
  678. if (!xprt_connected(xprt)) {
  679. task->tk_rqstp->rq_bytes_sent = 0;
  680. task->tk_timeout = task->tk_rqstp->rq_timeout;
  681. rpc_sleep_on(&xprt->pending, task, xprt_connect_status);
  682. if (test_bit(XPRT_CLOSING, &xprt->state))
  683. return;
  684. if (xprt_test_and_set_connecting(xprt))
  685. return;
  686. xprt->stat.connect_start = jiffies;
  687. xprt->ops->connect(xprt, task);
  688. }
  689. xprt_release_write(xprt, task);
  690. }
  691. static void xprt_connect_status(struct rpc_task *task)
  692. {
  693. struct rpc_xprt *xprt = task->tk_rqstp->rq_xprt;
  694. if (task->tk_status == 0) {
  695. xprt->stat.connect_count++;
  696. xprt->stat.connect_time += (long)jiffies - xprt->stat.connect_start;
  697. dprintk("RPC: %5u xprt_connect_status: connection established\n",
  698. task->tk_pid);
  699. return;
  700. }
  701. switch (task->tk_status) {
  702. case -ECONNREFUSED:
  703. case -ECONNRESET:
  704. case -ECONNABORTED:
  705. case -ENETUNREACH:
  706. case -EHOSTUNREACH:
  707. case -EPIPE:
  708. case -EAGAIN:
  709. dprintk("RPC: %5u xprt_connect_status: retrying\n", task->tk_pid);
  710. break;
  711. case -ETIMEDOUT:
  712. dprintk("RPC: %5u xprt_connect_status: connect attempt timed "
  713. "out\n", task->tk_pid);
  714. break;
  715. default:
  716. dprintk("RPC: %5u xprt_connect_status: error %d connecting to "
  717. "server %s\n", task->tk_pid, -task->tk_status,
  718. xprt->servername);
  719. task->tk_status = -EIO;
  720. }
  721. }
  722. /**
  723. * xprt_lookup_rqst - find an RPC request corresponding to an XID
  724. * @xprt: transport on which the original request was transmitted
  725. * @xid: RPC XID of incoming reply
  726. *
  727. */
  728. struct rpc_rqst *xprt_lookup_rqst(struct rpc_xprt *xprt, __be32 xid)
  729. {
  730. struct rpc_rqst *entry;
  731. list_for_each_entry(entry, &xprt->recv, rq_list)
  732. if (entry->rq_xid == xid) {
  733. trace_xprt_lookup_rqst(xprt, xid, 0);
  734. return entry;
  735. }
  736. dprintk("RPC: xprt_lookup_rqst did not find xid %08x\n",
  737. ntohl(xid));
  738. trace_xprt_lookup_rqst(xprt, xid, -ENOENT);
  739. xprt->stat.bad_xids++;
  740. return NULL;
  741. }
  742. EXPORT_SYMBOL_GPL(xprt_lookup_rqst);
  743. static void xprt_update_rtt(struct rpc_task *task)
  744. {
  745. struct rpc_rqst *req = task->tk_rqstp;
  746. struct rpc_rtt *rtt = task->tk_client->cl_rtt;
  747. unsigned int timer = task->tk_msg.rpc_proc->p_timer;
  748. long m = usecs_to_jiffies(ktime_to_us(req->rq_rtt));
  749. if (timer) {
  750. if (req->rq_ntrans == 1)
  751. rpc_update_rtt(rtt, timer, m);
  752. rpc_set_timeo(rtt, timer, req->rq_ntrans - 1);
  753. }
  754. }
  755. /**
  756. * xprt_complete_rqst - called when reply processing is complete
  757. * @task: RPC request that recently completed
  758. * @copied: actual number of bytes received from the transport
  759. *
  760. * Caller holds transport lock.
  761. */
  762. void xprt_complete_rqst(struct rpc_task *task, int copied)
  763. {
  764. struct rpc_rqst *req = task->tk_rqstp;
  765. struct rpc_xprt *xprt = req->rq_xprt;
  766. dprintk("RPC: %5u xid %08x complete (%d bytes received)\n",
  767. task->tk_pid, ntohl(req->rq_xid), copied);
  768. trace_xprt_complete_rqst(xprt, req->rq_xid, copied);
  769. xprt->stat.recvs++;
  770. req->rq_rtt = ktime_sub(ktime_get(), req->rq_xtime);
  771. if (xprt->ops->timer != NULL)
  772. xprt_update_rtt(task);
  773. list_del_init(&req->rq_list);
  774. req->rq_private_buf.len = copied;
  775. /* Ensure all writes are done before we update */
  776. /* req->rq_reply_bytes_recvd */
  777. smp_wmb();
  778. req->rq_reply_bytes_recvd = copied;
  779. rpc_wake_up_queued_task(&xprt->pending, task);
  780. }
  781. EXPORT_SYMBOL_GPL(xprt_complete_rqst);
  782. static void xprt_timer(struct rpc_task *task)
  783. {
  784. struct rpc_rqst *req = task->tk_rqstp;
  785. struct rpc_xprt *xprt = req->rq_xprt;
  786. if (task->tk_status != -ETIMEDOUT)
  787. return;
  788. dprintk("RPC: %5u xprt_timer\n", task->tk_pid);
  789. spin_lock_bh(&xprt->transport_lock);
  790. if (!req->rq_reply_bytes_recvd) {
  791. if (xprt->ops->timer)
  792. xprt->ops->timer(xprt, task);
  793. } else
  794. task->tk_status = 0;
  795. spin_unlock_bh(&xprt->transport_lock);
  796. }
  797. static inline int xprt_has_timer(struct rpc_xprt *xprt)
  798. {
  799. return xprt->idle_timeout != 0;
  800. }
  801. /**
  802. * xprt_prepare_transmit - reserve the transport before sending a request
  803. * @task: RPC task about to send a request
  804. *
  805. */
  806. bool xprt_prepare_transmit(struct rpc_task *task)
  807. {
  808. struct rpc_rqst *req = task->tk_rqstp;
  809. struct rpc_xprt *xprt = req->rq_xprt;
  810. bool ret = false;
  811. dprintk("RPC: %5u xprt_prepare_transmit\n", task->tk_pid);
  812. spin_lock_bh(&xprt->transport_lock);
  813. if (!req->rq_bytes_sent) {
  814. if (req->rq_reply_bytes_recvd) {
  815. task->tk_status = req->rq_reply_bytes_recvd;
  816. goto out_unlock;
  817. }
  818. if ((task->tk_flags & RPC_TASK_NO_RETRANS_TIMEOUT)
  819. && xprt_connected(xprt)
  820. && req->rq_connect_cookie == xprt->connect_cookie) {
  821. xprt->ops->set_retrans_timeout(task);
  822. rpc_sleep_on(&xprt->pending, task, xprt_timer);
  823. goto out_unlock;
  824. }
  825. }
  826. if (!xprt->ops->reserve_xprt(xprt, task)) {
  827. task->tk_status = -EAGAIN;
  828. goto out_unlock;
  829. }
  830. ret = true;
  831. out_unlock:
  832. spin_unlock_bh(&xprt->transport_lock);
  833. return ret;
  834. }
  835. void xprt_end_transmit(struct rpc_task *task)
  836. {
  837. xprt_release_write(task->tk_rqstp->rq_xprt, task);
  838. }
  839. /**
  840. * xprt_transmit - send an RPC request on a transport
  841. * @task: controlling RPC task
  842. *
  843. * We have to copy the iovec because sendmsg fiddles with its contents.
  844. */
  845. void xprt_transmit(struct rpc_task *task)
  846. {
  847. struct rpc_rqst *req = task->tk_rqstp;
  848. struct rpc_xprt *xprt = req->rq_xprt;
  849. int status, numreqs;
  850. dprintk("RPC: %5u xprt_transmit(%u)\n", task->tk_pid, req->rq_slen);
  851. if (!req->rq_reply_bytes_recvd) {
  852. if (list_empty(&req->rq_list) && rpc_reply_expected(task)) {
  853. /*
  854. * Add to the list only if we're expecting a reply
  855. */
  856. spin_lock_bh(&xprt->transport_lock);
  857. /* Update the softirq receive buffer */
  858. memcpy(&req->rq_private_buf, &req->rq_rcv_buf,
  859. sizeof(req->rq_private_buf));
  860. /* Add request to the receive list */
  861. list_add_tail(&req->rq_list, &xprt->recv);
  862. spin_unlock_bh(&xprt->transport_lock);
  863. xprt_reset_majortimeo(req);
  864. /* Turn off autodisconnect */
  865. del_singleshot_timer_sync(&xprt->timer);
  866. }
  867. } else if (!req->rq_bytes_sent)
  868. return;
  869. req->rq_xtime = ktime_get();
  870. status = xprt->ops->send_request(task);
  871. trace_xprt_transmit(xprt, req->rq_xid, status);
  872. if (status != 0) {
  873. task->tk_status = status;
  874. return;
  875. }
  876. xprt_inject_disconnect(xprt);
  877. dprintk("RPC: %5u xmit complete\n", task->tk_pid);
  878. task->tk_flags |= RPC_TASK_SENT;
  879. spin_lock_bh(&xprt->transport_lock);
  880. xprt->ops->set_retrans_timeout(task);
  881. numreqs = atomic_read(&xprt->num_reqs);
  882. if (numreqs > xprt->stat.max_slots)
  883. xprt->stat.max_slots = numreqs;
  884. xprt->stat.sends++;
  885. xprt->stat.req_u += xprt->stat.sends - xprt->stat.recvs;
  886. xprt->stat.bklog_u += xprt->backlog.qlen;
  887. xprt->stat.sending_u += xprt->sending.qlen;
  888. xprt->stat.pending_u += xprt->pending.qlen;
  889. /* Don't race with disconnect */
  890. if (!xprt_connected(xprt))
  891. task->tk_status = -ENOTCONN;
  892. else {
  893. /*
  894. * Sleep on the pending queue since
  895. * we're expecting a reply.
  896. */
  897. if (!req->rq_reply_bytes_recvd && rpc_reply_expected(task))
  898. rpc_sleep_on(&xprt->pending, task, xprt_timer);
  899. req->rq_connect_cookie = xprt->connect_cookie;
  900. }
  901. spin_unlock_bh(&xprt->transport_lock);
  902. }
  903. static void xprt_add_backlog(struct rpc_xprt *xprt, struct rpc_task *task)
  904. {
  905. set_bit(XPRT_CONGESTED, &xprt->state);
  906. rpc_sleep_on(&xprt->backlog, task, NULL);
  907. }
  908. static void xprt_wake_up_backlog(struct rpc_xprt *xprt)
  909. {
  910. if (rpc_wake_up_next(&xprt->backlog) == NULL)
  911. clear_bit(XPRT_CONGESTED, &xprt->state);
  912. }
  913. static bool xprt_throttle_congested(struct rpc_xprt *xprt, struct rpc_task *task)
  914. {
  915. bool ret = false;
  916. if (!test_bit(XPRT_CONGESTED, &xprt->state))
  917. goto out;
  918. spin_lock(&xprt->reserve_lock);
  919. if (test_bit(XPRT_CONGESTED, &xprt->state)) {
  920. rpc_sleep_on(&xprt->backlog, task, NULL);
  921. ret = true;
  922. }
  923. spin_unlock(&xprt->reserve_lock);
  924. out:
  925. return ret;
  926. }
  927. static struct rpc_rqst *xprt_dynamic_alloc_slot(struct rpc_xprt *xprt, gfp_t gfp_flags)
  928. {
  929. struct rpc_rqst *req = ERR_PTR(-EAGAIN);
  930. if (!atomic_add_unless(&xprt->num_reqs, 1, xprt->max_reqs))
  931. goto out;
  932. req = kzalloc(sizeof(struct rpc_rqst), gfp_flags);
  933. if (req != NULL)
  934. goto out;
  935. atomic_dec(&xprt->num_reqs);
  936. req = ERR_PTR(-ENOMEM);
  937. out:
  938. return req;
  939. }
  940. static bool xprt_dynamic_free_slot(struct rpc_xprt *xprt, struct rpc_rqst *req)
  941. {
  942. if (atomic_add_unless(&xprt->num_reqs, -1, xprt->min_reqs)) {
  943. kfree(req);
  944. return true;
  945. }
  946. return false;
  947. }
  948. void xprt_alloc_slot(struct rpc_xprt *xprt, struct rpc_task *task)
  949. {
  950. struct rpc_rqst *req;
  951. spin_lock(&xprt->reserve_lock);
  952. if (!list_empty(&xprt->free)) {
  953. req = list_entry(xprt->free.next, struct rpc_rqst, rq_list);
  954. list_del(&req->rq_list);
  955. goto out_init_req;
  956. }
  957. req = xprt_dynamic_alloc_slot(xprt, GFP_NOWAIT|__GFP_NOWARN);
  958. if (!IS_ERR(req))
  959. goto out_init_req;
  960. switch (PTR_ERR(req)) {
  961. case -ENOMEM:
  962. dprintk("RPC: dynamic allocation of request slot "
  963. "failed! Retrying\n");
  964. task->tk_status = -ENOMEM;
  965. break;
  966. case -EAGAIN:
  967. xprt_add_backlog(xprt, task);
  968. dprintk("RPC: waiting for request slot\n");
  969. default:
  970. task->tk_status = -EAGAIN;
  971. }
  972. spin_unlock(&xprt->reserve_lock);
  973. return;
  974. out_init_req:
  975. task->tk_status = 0;
  976. task->tk_rqstp = req;
  977. xprt_request_init(task, xprt);
  978. spin_unlock(&xprt->reserve_lock);
  979. }
  980. EXPORT_SYMBOL_GPL(xprt_alloc_slot);
  981. void xprt_lock_and_alloc_slot(struct rpc_xprt *xprt, struct rpc_task *task)
  982. {
  983. /* Note: grabbing the xprt_lock_write() ensures that we throttle
  984. * new slot allocation if the transport is congested (i.e. when
  985. * reconnecting a stream transport or when out of socket write
  986. * buffer space).
  987. */
  988. if (xprt_lock_write(xprt, task)) {
  989. xprt_alloc_slot(xprt, task);
  990. xprt_release_write(xprt, task);
  991. }
  992. }
  993. EXPORT_SYMBOL_GPL(xprt_lock_and_alloc_slot);
  994. static void xprt_free_slot(struct rpc_xprt *xprt, struct rpc_rqst *req)
  995. {
  996. spin_lock(&xprt->reserve_lock);
  997. if (!xprt_dynamic_free_slot(xprt, req)) {
  998. memset(req, 0, sizeof(*req)); /* mark unused */
  999. list_add(&req->rq_list, &xprt->free);
  1000. }
  1001. xprt_wake_up_backlog(xprt);
  1002. spin_unlock(&xprt->reserve_lock);
  1003. }
  1004. static void xprt_free_all_slots(struct rpc_xprt *xprt)
  1005. {
  1006. struct rpc_rqst *req;
  1007. while (!list_empty(&xprt->free)) {
  1008. req = list_first_entry(&xprt->free, struct rpc_rqst, rq_list);
  1009. list_del(&req->rq_list);
  1010. kfree(req);
  1011. }
  1012. }
  1013. struct rpc_xprt *xprt_alloc(struct net *net, size_t size,
  1014. unsigned int num_prealloc,
  1015. unsigned int max_alloc)
  1016. {
  1017. struct rpc_xprt *xprt;
  1018. struct rpc_rqst *req;
  1019. int i;
  1020. xprt = kzalloc(size, GFP_KERNEL);
  1021. if (xprt == NULL)
  1022. goto out;
  1023. xprt_init(xprt, net);
  1024. for (i = 0; i < num_prealloc; i++) {
  1025. req = kzalloc(sizeof(struct rpc_rqst), GFP_KERNEL);
  1026. if (!req)
  1027. goto out_free;
  1028. list_add(&req->rq_list, &xprt->free);
  1029. }
  1030. if (max_alloc > num_prealloc)
  1031. xprt->max_reqs = max_alloc;
  1032. else
  1033. xprt->max_reqs = num_prealloc;
  1034. xprt->min_reqs = num_prealloc;
  1035. atomic_set(&xprt->num_reqs, num_prealloc);
  1036. return xprt;
  1037. out_free:
  1038. xprt_free(xprt);
  1039. out:
  1040. return NULL;
  1041. }
  1042. EXPORT_SYMBOL_GPL(xprt_alloc);
  1043. void xprt_free(struct rpc_xprt *xprt)
  1044. {
  1045. put_net(xprt->xprt_net);
  1046. xprt_free_all_slots(xprt);
  1047. kfree(xprt);
  1048. }
  1049. EXPORT_SYMBOL_GPL(xprt_free);
  1050. /**
  1051. * xprt_reserve - allocate an RPC request slot
  1052. * @task: RPC task requesting a slot allocation
  1053. *
  1054. * If the transport is marked as being congested, or if no more
  1055. * slots are available, place the task on the transport's
  1056. * backlog queue.
  1057. */
  1058. void xprt_reserve(struct rpc_task *task)
  1059. {
  1060. struct rpc_xprt *xprt;
  1061. task->tk_status = 0;
  1062. if (task->tk_rqstp != NULL)
  1063. return;
  1064. task->tk_timeout = 0;
  1065. task->tk_status = -EAGAIN;
  1066. rcu_read_lock();
  1067. xprt = rcu_dereference(task->tk_client->cl_xprt);
  1068. if (!xprt_throttle_congested(xprt, task))
  1069. xprt->ops->alloc_slot(xprt, task);
  1070. rcu_read_unlock();
  1071. }
  1072. /**
  1073. * xprt_retry_reserve - allocate an RPC request slot
  1074. * @task: RPC task requesting a slot allocation
  1075. *
  1076. * If no more slots are available, place the task on the transport's
  1077. * backlog queue.
  1078. * Note that the only difference with xprt_reserve is that we now
  1079. * ignore the value of the XPRT_CONGESTED flag.
  1080. */
  1081. void xprt_retry_reserve(struct rpc_task *task)
  1082. {
  1083. struct rpc_xprt *xprt;
  1084. task->tk_status = 0;
  1085. if (task->tk_rqstp != NULL)
  1086. return;
  1087. task->tk_timeout = 0;
  1088. task->tk_status = -EAGAIN;
  1089. rcu_read_lock();
  1090. xprt = rcu_dereference(task->tk_client->cl_xprt);
  1091. xprt->ops->alloc_slot(xprt, task);
  1092. rcu_read_unlock();
  1093. }
  1094. static inline __be32 xprt_alloc_xid(struct rpc_xprt *xprt)
  1095. {
  1096. return (__force __be32)xprt->xid++;
  1097. }
  1098. static inline void xprt_init_xid(struct rpc_xprt *xprt)
  1099. {
  1100. xprt->xid = prandom_u32();
  1101. }
  1102. static void xprt_request_init(struct rpc_task *task, struct rpc_xprt *xprt)
  1103. {
  1104. struct rpc_rqst *req = task->tk_rqstp;
  1105. INIT_LIST_HEAD(&req->rq_list);
  1106. req->rq_timeout = task->tk_client->cl_timeout->to_initval;
  1107. req->rq_task = task;
  1108. req->rq_xprt = xprt;
  1109. req->rq_buffer = NULL;
  1110. req->rq_xid = xprt_alloc_xid(xprt);
  1111. req->rq_connect_cookie = xprt->connect_cookie - 1;
  1112. req->rq_bytes_sent = 0;
  1113. req->rq_snd_buf.len = 0;
  1114. req->rq_snd_buf.buflen = 0;
  1115. req->rq_rcv_buf.len = 0;
  1116. req->rq_rcv_buf.buflen = 0;
  1117. req->rq_release_snd_buf = NULL;
  1118. xprt_reset_majortimeo(req);
  1119. dprintk("RPC: %5u reserved req %p xid %08x\n", task->tk_pid,
  1120. req, ntohl(req->rq_xid));
  1121. }
  1122. /**
  1123. * xprt_release - release an RPC request slot
  1124. * @task: task which is finished with the slot
  1125. *
  1126. */
  1127. void xprt_release(struct rpc_task *task)
  1128. {
  1129. struct rpc_xprt *xprt;
  1130. struct rpc_rqst *req = task->tk_rqstp;
  1131. if (req == NULL) {
  1132. if (task->tk_client) {
  1133. rcu_read_lock();
  1134. xprt = rcu_dereference(task->tk_client->cl_xprt);
  1135. if (xprt->snd_task == task)
  1136. xprt_release_write(xprt, task);
  1137. rcu_read_unlock();
  1138. }
  1139. return;
  1140. }
  1141. xprt = req->rq_xprt;
  1142. if (task->tk_ops->rpc_count_stats != NULL)
  1143. task->tk_ops->rpc_count_stats(task, task->tk_calldata);
  1144. else if (task->tk_client)
  1145. rpc_count_iostats(task, task->tk_client->cl_metrics);
  1146. spin_lock_bh(&xprt->transport_lock);
  1147. xprt->ops->release_xprt(xprt, task);
  1148. if (xprt->ops->release_request)
  1149. xprt->ops->release_request(task);
  1150. if (!list_empty(&req->rq_list))
  1151. list_del(&req->rq_list);
  1152. xprt->last_used = jiffies;
  1153. if (list_empty(&xprt->recv) && xprt_has_timer(xprt))
  1154. mod_timer(&xprt->timer,
  1155. xprt->last_used + xprt->idle_timeout);
  1156. spin_unlock_bh(&xprt->transport_lock);
  1157. if (req->rq_buffer)
  1158. xprt->ops->buf_free(req->rq_buffer);
  1159. xprt_inject_disconnect(xprt);
  1160. if (req->rq_cred != NULL)
  1161. put_rpccred(req->rq_cred);
  1162. task->tk_rqstp = NULL;
  1163. if (req->rq_release_snd_buf)
  1164. req->rq_release_snd_buf(req);
  1165. dprintk("RPC: %5u release request %p\n", task->tk_pid, req);
  1166. if (likely(!bc_prealloc(req)))
  1167. xprt_free_slot(xprt, req);
  1168. else
  1169. xprt_free_bc_request(req);
  1170. }
  1171. static void xprt_init(struct rpc_xprt *xprt, struct net *net)
  1172. {
  1173. atomic_set(&xprt->count, 1);
  1174. spin_lock_init(&xprt->transport_lock);
  1175. spin_lock_init(&xprt->reserve_lock);
  1176. INIT_LIST_HEAD(&xprt->free);
  1177. INIT_LIST_HEAD(&xprt->recv);
  1178. #if defined(CONFIG_SUNRPC_BACKCHANNEL)
  1179. spin_lock_init(&xprt->bc_pa_lock);
  1180. INIT_LIST_HEAD(&xprt->bc_pa_list);
  1181. #endif /* CONFIG_SUNRPC_BACKCHANNEL */
  1182. xprt->last_used = jiffies;
  1183. xprt->cwnd = RPC_INITCWND;
  1184. xprt->bind_index = 0;
  1185. rpc_init_wait_queue(&xprt->binding, "xprt_binding");
  1186. rpc_init_wait_queue(&xprt->pending, "xprt_pending");
  1187. rpc_init_priority_wait_queue(&xprt->sending, "xprt_sending");
  1188. rpc_init_priority_wait_queue(&xprt->backlog, "xprt_backlog");
  1189. xprt_init_xid(xprt);
  1190. xprt->xprt_net = get_net(net);
  1191. }
  1192. /**
  1193. * xprt_create_transport - create an RPC transport
  1194. * @args: rpc transport creation arguments
  1195. *
  1196. */
  1197. struct rpc_xprt *xprt_create_transport(struct xprt_create *args)
  1198. {
  1199. struct rpc_xprt *xprt;
  1200. struct xprt_class *t;
  1201. spin_lock(&xprt_list_lock);
  1202. list_for_each_entry(t, &xprt_list, list) {
  1203. if (t->ident == args->ident) {
  1204. spin_unlock(&xprt_list_lock);
  1205. goto found;
  1206. }
  1207. }
  1208. spin_unlock(&xprt_list_lock);
  1209. dprintk("RPC: transport (%d) not supported\n", args->ident);
  1210. return ERR_PTR(-EIO);
  1211. found:
  1212. xprt = t->setup(args);
  1213. if (IS_ERR(xprt)) {
  1214. dprintk("RPC: xprt_create_transport: failed, %ld\n",
  1215. -PTR_ERR(xprt));
  1216. goto out;
  1217. }
  1218. if (args->flags & XPRT_CREATE_NO_IDLE_TIMEOUT)
  1219. xprt->idle_timeout = 0;
  1220. INIT_WORK(&xprt->task_cleanup, xprt_autoclose);
  1221. if (xprt_has_timer(xprt))
  1222. setup_timer(&xprt->timer, xprt_init_autodisconnect,
  1223. (unsigned long)xprt);
  1224. else
  1225. init_timer(&xprt->timer);
  1226. if (strlen(args->servername) > RPC_MAXNETNAMELEN) {
  1227. xprt_destroy(xprt);
  1228. return ERR_PTR(-EINVAL);
  1229. }
  1230. xprt->servername = kstrdup(args->servername, GFP_KERNEL);
  1231. if (xprt->servername == NULL) {
  1232. xprt_destroy(xprt);
  1233. return ERR_PTR(-ENOMEM);
  1234. }
  1235. rpc_xprt_debugfs_register(xprt);
  1236. dprintk("RPC: created transport %p with %u slots\n", xprt,
  1237. xprt->max_reqs);
  1238. out:
  1239. return xprt;
  1240. }
  1241. /**
  1242. * xprt_destroy - destroy an RPC transport, killing off all requests.
  1243. * @xprt: transport to destroy
  1244. *
  1245. */
  1246. static void xprt_destroy(struct rpc_xprt *xprt)
  1247. {
  1248. dprintk("RPC: destroying transport %p\n", xprt);
  1249. del_timer_sync(&xprt->timer);
  1250. rpc_xprt_debugfs_unregister(xprt);
  1251. rpc_destroy_wait_queue(&xprt->binding);
  1252. rpc_destroy_wait_queue(&xprt->pending);
  1253. rpc_destroy_wait_queue(&xprt->sending);
  1254. rpc_destroy_wait_queue(&xprt->backlog);
  1255. cancel_work_sync(&xprt->task_cleanup);
  1256. kfree(xprt->servername);
  1257. /*
  1258. * Tear down transport state and free the rpc_xprt
  1259. */
  1260. xprt->ops->destroy(xprt);
  1261. }
  1262. /**
  1263. * xprt_put - release a reference to an RPC transport.
  1264. * @xprt: pointer to the transport
  1265. *
  1266. */
  1267. void xprt_put(struct rpc_xprt *xprt)
  1268. {
  1269. if (atomic_dec_and_test(&xprt->count))
  1270. xprt_destroy(xprt);
  1271. }