ip_vs_conn.c 23 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962
  1. /*
  2. * IPVS An implementation of the IP virtual server support for the
  3. * LINUX operating system. IPVS is now implemented as a module
  4. * over the Netfilter framework. IPVS can be used to build a
  5. * high-performance and highly available server based on a
  6. * cluster of servers.
  7. *
  8. * Version: $Id: ip_vs_conn.c,v 1.31 2003/04/18 09:03:16 wensong Exp $
  9. *
  10. * Authors: Wensong Zhang <wensong@linuxvirtualserver.org>
  11. * Peter Kese <peter.kese@ijs.si>
  12. * Julian Anastasov <ja@ssi.bg>
  13. *
  14. * This program is free software; you can redistribute it and/or
  15. * modify it under the terms of the GNU General Public License
  16. * as published by the Free Software Foundation; either version
  17. * 2 of the License, or (at your option) any later version.
  18. *
  19. * The IPVS code for kernel 2.2 was done by Wensong Zhang and Peter Kese,
  20. * with changes/fixes from Julian Anastasov, Lars Marowsky-Bree, Horms
  21. * and others. Many code here is taken from IP MASQ code of kernel 2.2.
  22. *
  23. * Changes:
  24. *
  25. */
  26. #include <linux/interrupt.h>
  27. #include <linux/in.h>
  28. #include <linux/net.h>
  29. #include <linux/kernel.h>
  30. #include <linux/module.h>
  31. #include <linux/vmalloc.h>
  32. #include <linux/proc_fs.h> /* for proc_net_* */
  33. #include <linux/seq_file.h>
  34. #include <linux/jhash.h>
  35. #include <linux/random.h>
  36. #include <net/net_namespace.h>
  37. #include <net/ip_vs.h>
  38. /*
  39. * Connection hash table: for input and output packets lookups of IPVS
  40. */
  41. static struct list_head *ip_vs_conn_tab;
  42. /* SLAB cache for IPVS connections */
  43. static struct kmem_cache *ip_vs_conn_cachep __read_mostly;
  44. /* counter for current IPVS connections */
  45. static atomic_t ip_vs_conn_count = ATOMIC_INIT(0);
  46. /* counter for no client port connections */
  47. static atomic_t ip_vs_conn_no_cport_cnt = ATOMIC_INIT(0);
  48. /* random value for IPVS connection hash */
  49. static unsigned int ip_vs_conn_rnd;
  50. /*
  51. * Fine locking granularity for big connection hash table
  52. */
  53. #define CT_LOCKARRAY_BITS 4
  54. #define CT_LOCKARRAY_SIZE (1<<CT_LOCKARRAY_BITS)
  55. #define CT_LOCKARRAY_MASK (CT_LOCKARRAY_SIZE-1)
  56. struct ip_vs_aligned_lock
  57. {
  58. rwlock_t l;
  59. } __attribute__((__aligned__(SMP_CACHE_BYTES)));
  60. /* lock array for conn table */
  61. static struct ip_vs_aligned_lock
  62. __ip_vs_conntbl_lock_array[CT_LOCKARRAY_SIZE] __cacheline_aligned;
  63. static inline void ct_read_lock(unsigned key)
  64. {
  65. read_lock(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  66. }
  67. static inline void ct_read_unlock(unsigned key)
  68. {
  69. read_unlock(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  70. }
  71. static inline void ct_write_lock(unsigned key)
  72. {
  73. write_lock(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  74. }
  75. static inline void ct_write_unlock(unsigned key)
  76. {
  77. write_unlock(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  78. }
  79. static inline void ct_read_lock_bh(unsigned key)
  80. {
  81. read_lock_bh(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  82. }
  83. static inline void ct_read_unlock_bh(unsigned key)
  84. {
  85. read_unlock_bh(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  86. }
  87. static inline void ct_write_lock_bh(unsigned key)
  88. {
  89. write_lock_bh(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  90. }
  91. static inline void ct_write_unlock_bh(unsigned key)
  92. {
  93. write_unlock_bh(&__ip_vs_conntbl_lock_array[key&CT_LOCKARRAY_MASK].l);
  94. }
  95. /*
  96. * Returns hash value for IPVS connection entry
  97. */
  98. static unsigned int ip_vs_conn_hashkey(unsigned proto, __be32 addr, __be16 port)
  99. {
  100. return jhash_3words((__force u32)addr, (__force u32)port, proto, ip_vs_conn_rnd)
  101. & IP_VS_CONN_TAB_MASK;
  102. }
  103. /*
  104. * Hashes ip_vs_conn in ip_vs_conn_tab by proto,addr,port.
  105. * returns bool success.
  106. */
  107. static inline int ip_vs_conn_hash(struct ip_vs_conn *cp)
  108. {
  109. unsigned hash;
  110. int ret;
  111. /* Hash by protocol, client address and port */
  112. hash = ip_vs_conn_hashkey(cp->protocol, cp->caddr, cp->cport);
  113. ct_write_lock(hash);
  114. if (!(cp->flags & IP_VS_CONN_F_HASHED)) {
  115. list_add(&cp->c_list, &ip_vs_conn_tab[hash]);
  116. cp->flags |= IP_VS_CONN_F_HASHED;
  117. atomic_inc(&cp->refcnt);
  118. ret = 1;
  119. } else {
  120. IP_VS_ERR("ip_vs_conn_hash(): request for already hashed, "
  121. "called from %p\n", __builtin_return_address(0));
  122. ret = 0;
  123. }
  124. ct_write_unlock(hash);
  125. return ret;
  126. }
  127. /*
  128. * UNhashes ip_vs_conn from ip_vs_conn_tab.
  129. * returns bool success.
  130. */
  131. static inline int ip_vs_conn_unhash(struct ip_vs_conn *cp)
  132. {
  133. unsigned hash;
  134. int ret;
  135. /* unhash it and decrease its reference counter */
  136. hash = ip_vs_conn_hashkey(cp->protocol, cp->caddr, cp->cport);
  137. ct_write_lock(hash);
  138. if (cp->flags & IP_VS_CONN_F_HASHED) {
  139. list_del(&cp->c_list);
  140. cp->flags &= ~IP_VS_CONN_F_HASHED;
  141. atomic_dec(&cp->refcnt);
  142. ret = 1;
  143. } else
  144. ret = 0;
  145. ct_write_unlock(hash);
  146. return ret;
  147. }
  148. /*
  149. * Gets ip_vs_conn associated with supplied parameters in the ip_vs_conn_tab.
  150. * Called for pkts coming from OUTside-to-INside.
  151. * s_addr, s_port: pkt source address (foreign host)
  152. * d_addr, d_port: pkt dest address (load balancer)
  153. */
  154. static inline struct ip_vs_conn *__ip_vs_conn_in_get
  155. (int protocol, __be32 s_addr, __be16 s_port, __be32 d_addr, __be16 d_port)
  156. {
  157. unsigned hash;
  158. struct ip_vs_conn *cp;
  159. hash = ip_vs_conn_hashkey(protocol, s_addr, s_port);
  160. ct_read_lock(hash);
  161. list_for_each_entry(cp, &ip_vs_conn_tab[hash], c_list) {
  162. if (s_addr==cp->caddr && s_port==cp->cport &&
  163. d_port==cp->vport && d_addr==cp->vaddr &&
  164. ((!s_port) ^ (!(cp->flags & IP_VS_CONN_F_NO_CPORT))) &&
  165. protocol==cp->protocol) {
  166. /* HIT */
  167. atomic_inc(&cp->refcnt);
  168. ct_read_unlock(hash);
  169. return cp;
  170. }
  171. }
  172. ct_read_unlock(hash);
  173. return NULL;
  174. }
  175. struct ip_vs_conn *ip_vs_conn_in_get
  176. (int protocol, __be32 s_addr, __be16 s_port, __be32 d_addr, __be16 d_port)
  177. {
  178. struct ip_vs_conn *cp;
  179. cp = __ip_vs_conn_in_get(protocol, s_addr, s_port, d_addr, d_port);
  180. if (!cp && atomic_read(&ip_vs_conn_no_cport_cnt))
  181. cp = __ip_vs_conn_in_get(protocol, s_addr, 0, d_addr, d_port);
  182. IP_VS_DBG(9, "lookup/in %s %u.%u.%u.%u:%d->%u.%u.%u.%u:%d %s\n",
  183. ip_vs_proto_name(protocol),
  184. NIPQUAD(s_addr), ntohs(s_port),
  185. NIPQUAD(d_addr), ntohs(d_port),
  186. cp?"hit":"not hit");
  187. return cp;
  188. }
  189. /* Get reference to connection template */
  190. struct ip_vs_conn *ip_vs_ct_in_get
  191. (int protocol, __be32 s_addr, __be16 s_port, __be32 d_addr, __be16 d_port)
  192. {
  193. unsigned hash;
  194. struct ip_vs_conn *cp;
  195. hash = ip_vs_conn_hashkey(protocol, s_addr, s_port);
  196. ct_read_lock(hash);
  197. list_for_each_entry(cp, &ip_vs_conn_tab[hash], c_list) {
  198. if (s_addr==cp->caddr && s_port==cp->cport &&
  199. d_port==cp->vport && d_addr==cp->vaddr &&
  200. cp->flags & IP_VS_CONN_F_TEMPLATE &&
  201. protocol==cp->protocol) {
  202. /* HIT */
  203. atomic_inc(&cp->refcnt);
  204. goto out;
  205. }
  206. }
  207. cp = NULL;
  208. out:
  209. ct_read_unlock(hash);
  210. IP_VS_DBG(9, "template lookup/in %s %u.%u.%u.%u:%d->%u.%u.%u.%u:%d %s\n",
  211. ip_vs_proto_name(protocol),
  212. NIPQUAD(s_addr), ntohs(s_port),
  213. NIPQUAD(d_addr), ntohs(d_port),
  214. cp?"hit":"not hit");
  215. return cp;
  216. }
  217. /*
  218. * Gets ip_vs_conn associated with supplied parameters in the ip_vs_conn_tab.
  219. * Called for pkts coming from inside-to-OUTside.
  220. * s_addr, s_port: pkt source address (inside host)
  221. * d_addr, d_port: pkt dest address (foreign host)
  222. */
  223. struct ip_vs_conn *ip_vs_conn_out_get
  224. (int protocol, __be32 s_addr, __be16 s_port, __be32 d_addr, __be16 d_port)
  225. {
  226. unsigned hash;
  227. struct ip_vs_conn *cp, *ret=NULL;
  228. /*
  229. * Check for "full" addressed entries
  230. */
  231. hash = ip_vs_conn_hashkey(protocol, d_addr, d_port);
  232. ct_read_lock(hash);
  233. list_for_each_entry(cp, &ip_vs_conn_tab[hash], c_list) {
  234. if (d_addr == cp->caddr && d_port == cp->cport &&
  235. s_port == cp->dport && s_addr == cp->daddr &&
  236. protocol == cp->protocol) {
  237. /* HIT */
  238. atomic_inc(&cp->refcnt);
  239. ret = cp;
  240. break;
  241. }
  242. }
  243. ct_read_unlock(hash);
  244. IP_VS_DBG(9, "lookup/out %s %u.%u.%u.%u:%d->%u.%u.%u.%u:%d %s\n",
  245. ip_vs_proto_name(protocol),
  246. NIPQUAD(s_addr), ntohs(s_port),
  247. NIPQUAD(d_addr), ntohs(d_port),
  248. ret?"hit":"not hit");
  249. return ret;
  250. }
  251. /*
  252. * Put back the conn and restart its timer with its timeout
  253. */
  254. void ip_vs_conn_put(struct ip_vs_conn *cp)
  255. {
  256. /* reset it expire in its timeout */
  257. mod_timer(&cp->timer, jiffies+cp->timeout);
  258. __ip_vs_conn_put(cp);
  259. }
  260. /*
  261. * Fill a no_client_port connection with a client port number
  262. */
  263. void ip_vs_conn_fill_cport(struct ip_vs_conn *cp, __be16 cport)
  264. {
  265. if (ip_vs_conn_unhash(cp)) {
  266. spin_lock(&cp->lock);
  267. if (cp->flags & IP_VS_CONN_F_NO_CPORT) {
  268. atomic_dec(&ip_vs_conn_no_cport_cnt);
  269. cp->flags &= ~IP_VS_CONN_F_NO_CPORT;
  270. cp->cport = cport;
  271. }
  272. spin_unlock(&cp->lock);
  273. /* hash on new dport */
  274. ip_vs_conn_hash(cp);
  275. }
  276. }
  277. /*
  278. * Bind a connection entry with the corresponding packet_xmit.
  279. * Called by ip_vs_conn_new.
  280. */
  281. static inline void ip_vs_bind_xmit(struct ip_vs_conn *cp)
  282. {
  283. switch (IP_VS_FWD_METHOD(cp)) {
  284. case IP_VS_CONN_F_MASQ:
  285. cp->packet_xmit = ip_vs_nat_xmit;
  286. break;
  287. case IP_VS_CONN_F_TUNNEL:
  288. cp->packet_xmit = ip_vs_tunnel_xmit;
  289. break;
  290. case IP_VS_CONN_F_DROUTE:
  291. cp->packet_xmit = ip_vs_dr_xmit;
  292. break;
  293. case IP_VS_CONN_F_LOCALNODE:
  294. cp->packet_xmit = ip_vs_null_xmit;
  295. break;
  296. case IP_VS_CONN_F_BYPASS:
  297. cp->packet_xmit = ip_vs_bypass_xmit;
  298. break;
  299. }
  300. }
  301. static inline int ip_vs_dest_totalconns(struct ip_vs_dest *dest)
  302. {
  303. return atomic_read(&dest->activeconns)
  304. + atomic_read(&dest->inactconns);
  305. }
  306. /*
  307. * Bind a connection entry with a virtual service destination
  308. * Called just after a new connection entry is created.
  309. */
  310. static inline void
  311. ip_vs_bind_dest(struct ip_vs_conn *cp, struct ip_vs_dest *dest)
  312. {
  313. /* if dest is NULL, then return directly */
  314. if (!dest)
  315. return;
  316. /* Increase the refcnt counter of the dest */
  317. atomic_inc(&dest->refcnt);
  318. /* Bind with the destination and its corresponding transmitter */
  319. cp->flags |= atomic_read(&dest->conn_flags);
  320. cp->dest = dest;
  321. IP_VS_DBG(7, "Bind-dest %s c:%u.%u.%u.%u:%d v:%u.%u.%u.%u:%d "
  322. "d:%u.%u.%u.%u:%d fwd:%c s:%u conn->flags:%X conn->refcnt:%d "
  323. "dest->refcnt:%d\n",
  324. ip_vs_proto_name(cp->protocol),
  325. NIPQUAD(cp->caddr), ntohs(cp->cport),
  326. NIPQUAD(cp->vaddr), ntohs(cp->vport),
  327. NIPQUAD(cp->daddr), ntohs(cp->dport),
  328. ip_vs_fwd_tag(cp), cp->state,
  329. cp->flags, atomic_read(&cp->refcnt),
  330. atomic_read(&dest->refcnt));
  331. /* Update the connection counters */
  332. if (!(cp->flags & IP_VS_CONN_F_TEMPLATE)) {
  333. /* It is a normal connection, so increase the inactive
  334. connection counter because it is in TCP SYNRECV
  335. state (inactive) or other protocol inacive state */
  336. atomic_inc(&dest->inactconns);
  337. } else {
  338. /* It is a persistent connection/template, so increase
  339. the peristent connection counter */
  340. atomic_inc(&dest->persistconns);
  341. }
  342. if (dest->u_threshold != 0 &&
  343. ip_vs_dest_totalconns(dest) >= dest->u_threshold)
  344. dest->flags |= IP_VS_DEST_F_OVERLOAD;
  345. }
  346. /*
  347. * Check if there is a destination for the connection, if so
  348. * bind the connection to the destination.
  349. */
  350. struct ip_vs_dest *ip_vs_try_bind_dest(struct ip_vs_conn *cp)
  351. {
  352. struct ip_vs_dest *dest;
  353. if ((cp) && (!cp->dest)) {
  354. dest = ip_vs_find_dest(cp->daddr, cp->dport,
  355. cp->vaddr, cp->vport, cp->protocol);
  356. ip_vs_bind_dest(cp, dest);
  357. return dest;
  358. } else
  359. return NULL;
  360. }
  361. /*
  362. * Unbind a connection entry with its VS destination
  363. * Called by the ip_vs_conn_expire function.
  364. */
  365. static inline void ip_vs_unbind_dest(struct ip_vs_conn *cp)
  366. {
  367. struct ip_vs_dest *dest = cp->dest;
  368. if (!dest)
  369. return;
  370. IP_VS_DBG(7, "Unbind-dest %s c:%u.%u.%u.%u:%d v:%u.%u.%u.%u:%d "
  371. "d:%u.%u.%u.%u:%d fwd:%c s:%u conn->flags:%X conn->refcnt:%d "
  372. "dest->refcnt:%d\n",
  373. ip_vs_proto_name(cp->protocol),
  374. NIPQUAD(cp->caddr), ntohs(cp->cport),
  375. NIPQUAD(cp->vaddr), ntohs(cp->vport),
  376. NIPQUAD(cp->daddr), ntohs(cp->dport),
  377. ip_vs_fwd_tag(cp), cp->state,
  378. cp->flags, atomic_read(&cp->refcnt),
  379. atomic_read(&dest->refcnt));
  380. /* Update the connection counters */
  381. if (!(cp->flags & IP_VS_CONN_F_TEMPLATE)) {
  382. /* It is a normal connection, so decrease the inactconns
  383. or activeconns counter */
  384. if (cp->flags & IP_VS_CONN_F_INACTIVE) {
  385. atomic_dec(&dest->inactconns);
  386. } else {
  387. atomic_dec(&dest->activeconns);
  388. }
  389. } else {
  390. /* It is a persistent connection/template, so decrease
  391. the peristent connection counter */
  392. atomic_dec(&dest->persistconns);
  393. }
  394. if (dest->l_threshold != 0) {
  395. if (ip_vs_dest_totalconns(dest) < dest->l_threshold)
  396. dest->flags &= ~IP_VS_DEST_F_OVERLOAD;
  397. } else if (dest->u_threshold != 0) {
  398. if (ip_vs_dest_totalconns(dest) * 4 < dest->u_threshold * 3)
  399. dest->flags &= ~IP_VS_DEST_F_OVERLOAD;
  400. } else {
  401. if (dest->flags & IP_VS_DEST_F_OVERLOAD)
  402. dest->flags &= ~IP_VS_DEST_F_OVERLOAD;
  403. }
  404. /*
  405. * Simply decrease the refcnt of the dest, because the
  406. * dest will be either in service's destination list
  407. * or in the trash.
  408. */
  409. atomic_dec(&dest->refcnt);
  410. }
  411. /*
  412. * Checking if the destination of a connection template is available.
  413. * If available, return 1, otherwise invalidate this connection
  414. * template and return 0.
  415. */
  416. int ip_vs_check_template(struct ip_vs_conn *ct)
  417. {
  418. struct ip_vs_dest *dest = ct->dest;
  419. /*
  420. * Checking the dest server status.
  421. */
  422. if ((dest == NULL) ||
  423. !(dest->flags & IP_VS_DEST_F_AVAILABLE) ||
  424. (sysctl_ip_vs_expire_quiescent_template &&
  425. (atomic_read(&dest->weight) == 0))) {
  426. IP_VS_DBG(9, "check_template: dest not available for "
  427. "protocol %s s:%u.%u.%u.%u:%d v:%u.%u.%u.%u:%d "
  428. "-> d:%u.%u.%u.%u:%d\n",
  429. ip_vs_proto_name(ct->protocol),
  430. NIPQUAD(ct->caddr), ntohs(ct->cport),
  431. NIPQUAD(ct->vaddr), ntohs(ct->vport),
  432. NIPQUAD(ct->daddr), ntohs(ct->dport));
  433. /*
  434. * Invalidate the connection template
  435. */
  436. if (ct->vport != htons(0xffff)) {
  437. if (ip_vs_conn_unhash(ct)) {
  438. ct->dport = htons(0xffff);
  439. ct->vport = htons(0xffff);
  440. ct->cport = 0;
  441. ip_vs_conn_hash(ct);
  442. }
  443. }
  444. /*
  445. * Simply decrease the refcnt of the template,
  446. * don't restart its timer.
  447. */
  448. atomic_dec(&ct->refcnt);
  449. return 0;
  450. }
  451. return 1;
  452. }
  453. static void ip_vs_conn_expire(unsigned long data)
  454. {
  455. struct ip_vs_conn *cp = (struct ip_vs_conn *)data;
  456. cp->timeout = 60*HZ;
  457. /*
  458. * hey, I'm using it
  459. */
  460. atomic_inc(&cp->refcnt);
  461. /*
  462. * do I control anybody?
  463. */
  464. if (atomic_read(&cp->n_control))
  465. goto expire_later;
  466. /*
  467. * unhash it if it is hashed in the conn table
  468. */
  469. if (!ip_vs_conn_unhash(cp))
  470. goto expire_later;
  471. /*
  472. * refcnt==1 implies I'm the only one referrer
  473. */
  474. if (likely(atomic_read(&cp->refcnt) == 1)) {
  475. /* delete the timer if it is activated by other users */
  476. if (timer_pending(&cp->timer))
  477. del_timer(&cp->timer);
  478. /* does anybody control me? */
  479. if (cp->control)
  480. ip_vs_control_del(cp);
  481. if (unlikely(cp->app != NULL))
  482. ip_vs_unbind_app(cp);
  483. ip_vs_unbind_dest(cp);
  484. if (cp->flags & IP_VS_CONN_F_NO_CPORT)
  485. atomic_dec(&ip_vs_conn_no_cport_cnt);
  486. atomic_dec(&ip_vs_conn_count);
  487. kmem_cache_free(ip_vs_conn_cachep, cp);
  488. return;
  489. }
  490. /* hash it back to the table */
  491. ip_vs_conn_hash(cp);
  492. expire_later:
  493. IP_VS_DBG(7, "delayed: conn->refcnt-1=%d conn->n_control=%d\n",
  494. atomic_read(&cp->refcnt)-1,
  495. atomic_read(&cp->n_control));
  496. ip_vs_conn_put(cp);
  497. }
  498. void ip_vs_conn_expire_now(struct ip_vs_conn *cp)
  499. {
  500. if (del_timer(&cp->timer))
  501. mod_timer(&cp->timer, jiffies);
  502. }
  503. /*
  504. * Create a new connection entry and hash it into the ip_vs_conn_tab
  505. */
  506. struct ip_vs_conn *
  507. ip_vs_conn_new(int proto, __be32 caddr, __be16 cport, __be32 vaddr, __be16 vport,
  508. __be32 daddr, __be16 dport, unsigned flags,
  509. struct ip_vs_dest *dest)
  510. {
  511. struct ip_vs_conn *cp;
  512. struct ip_vs_protocol *pp = ip_vs_proto_get(proto);
  513. cp = kmem_cache_zalloc(ip_vs_conn_cachep, GFP_ATOMIC);
  514. if (cp == NULL) {
  515. IP_VS_ERR_RL("ip_vs_conn_new: no memory available.\n");
  516. return NULL;
  517. }
  518. INIT_LIST_HEAD(&cp->c_list);
  519. init_timer(&cp->timer);
  520. cp->timer.data = (unsigned long)cp;
  521. cp->timer.function = ip_vs_conn_expire;
  522. cp->protocol = proto;
  523. cp->caddr = caddr;
  524. cp->cport = cport;
  525. cp->vaddr = vaddr;
  526. cp->vport = vport;
  527. cp->daddr = daddr;
  528. cp->dport = dport;
  529. cp->flags = flags;
  530. spin_lock_init(&cp->lock);
  531. /*
  532. * Set the entry is referenced by the current thread before hashing
  533. * it in the table, so that other thread run ip_vs_random_dropentry
  534. * but cannot drop this entry.
  535. */
  536. atomic_set(&cp->refcnt, 1);
  537. atomic_set(&cp->n_control, 0);
  538. atomic_set(&cp->in_pkts, 0);
  539. atomic_inc(&ip_vs_conn_count);
  540. if (flags & IP_VS_CONN_F_NO_CPORT)
  541. atomic_inc(&ip_vs_conn_no_cport_cnt);
  542. /* Bind the connection with a destination server */
  543. ip_vs_bind_dest(cp, dest);
  544. /* Set its state and timeout */
  545. cp->state = 0;
  546. cp->timeout = 3*HZ;
  547. /* Bind its packet transmitter */
  548. ip_vs_bind_xmit(cp);
  549. if (unlikely(pp && atomic_read(&pp->appcnt)))
  550. ip_vs_bind_app(cp, pp);
  551. /* Hash it in the ip_vs_conn_tab finally */
  552. ip_vs_conn_hash(cp);
  553. return cp;
  554. }
  555. /*
  556. * /proc/net/ip_vs_conn entries
  557. */
  558. #ifdef CONFIG_PROC_FS
  559. static void *ip_vs_conn_array(struct seq_file *seq, loff_t pos)
  560. {
  561. int idx;
  562. struct ip_vs_conn *cp;
  563. for(idx = 0; idx < IP_VS_CONN_TAB_SIZE; idx++) {
  564. ct_read_lock_bh(idx);
  565. list_for_each_entry(cp, &ip_vs_conn_tab[idx], c_list) {
  566. if (pos-- == 0) {
  567. seq->private = &ip_vs_conn_tab[idx];
  568. return cp;
  569. }
  570. }
  571. ct_read_unlock_bh(idx);
  572. }
  573. return NULL;
  574. }
  575. static void *ip_vs_conn_seq_start(struct seq_file *seq, loff_t *pos)
  576. {
  577. seq->private = NULL;
  578. return *pos ? ip_vs_conn_array(seq, *pos - 1) :SEQ_START_TOKEN;
  579. }
  580. static void *ip_vs_conn_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  581. {
  582. struct ip_vs_conn *cp = v;
  583. struct list_head *e, *l = seq->private;
  584. int idx;
  585. ++*pos;
  586. if (v == SEQ_START_TOKEN)
  587. return ip_vs_conn_array(seq, 0);
  588. /* more on same hash chain? */
  589. if ((e = cp->c_list.next) != l)
  590. return list_entry(e, struct ip_vs_conn, c_list);
  591. idx = l - ip_vs_conn_tab;
  592. ct_read_unlock_bh(idx);
  593. while (++idx < IP_VS_CONN_TAB_SIZE) {
  594. ct_read_lock_bh(idx);
  595. list_for_each_entry(cp, &ip_vs_conn_tab[idx], c_list) {
  596. seq->private = &ip_vs_conn_tab[idx];
  597. return cp;
  598. }
  599. ct_read_unlock_bh(idx);
  600. }
  601. seq->private = NULL;
  602. return NULL;
  603. }
  604. static void ip_vs_conn_seq_stop(struct seq_file *seq, void *v)
  605. {
  606. struct list_head *l = seq->private;
  607. if (l)
  608. ct_read_unlock_bh(l - ip_vs_conn_tab);
  609. }
  610. static int ip_vs_conn_seq_show(struct seq_file *seq, void *v)
  611. {
  612. if (v == SEQ_START_TOKEN)
  613. seq_puts(seq,
  614. "Pro FromIP FPrt ToIP TPrt DestIP DPrt State Expires\n");
  615. else {
  616. const struct ip_vs_conn *cp = v;
  617. seq_printf(seq,
  618. "%-3s %08X %04X %08X %04X %08X %04X %-11s %7lu\n",
  619. ip_vs_proto_name(cp->protocol),
  620. ntohl(cp->caddr), ntohs(cp->cport),
  621. ntohl(cp->vaddr), ntohs(cp->vport),
  622. ntohl(cp->daddr), ntohs(cp->dport),
  623. ip_vs_state_name(cp->protocol, cp->state),
  624. (cp->timer.expires-jiffies)/HZ);
  625. }
  626. return 0;
  627. }
  628. static const struct seq_operations ip_vs_conn_seq_ops = {
  629. .start = ip_vs_conn_seq_start,
  630. .next = ip_vs_conn_seq_next,
  631. .stop = ip_vs_conn_seq_stop,
  632. .show = ip_vs_conn_seq_show,
  633. };
  634. static int ip_vs_conn_open(struct inode *inode, struct file *file)
  635. {
  636. return seq_open(file, &ip_vs_conn_seq_ops);
  637. }
  638. static const struct file_operations ip_vs_conn_fops = {
  639. .owner = THIS_MODULE,
  640. .open = ip_vs_conn_open,
  641. .read = seq_read,
  642. .llseek = seq_lseek,
  643. .release = seq_release,
  644. };
  645. #endif
  646. /*
  647. * Randomly drop connection entries before running out of memory
  648. */
  649. static inline int todrop_entry(struct ip_vs_conn *cp)
  650. {
  651. /*
  652. * The drop rate array needs tuning for real environments.
  653. * Called from timer bh only => no locking
  654. */
  655. static const char todrop_rate[9] = {0, 1, 2, 3, 4, 5, 6, 7, 8};
  656. static char todrop_counter[9] = {0};
  657. int i;
  658. /* if the conn entry hasn't lasted for 60 seconds, don't drop it.
  659. This will leave enough time for normal connection to get
  660. through. */
  661. if (time_before(cp->timeout + jiffies, cp->timer.expires + 60*HZ))
  662. return 0;
  663. /* Don't drop the entry if its number of incoming packets is not
  664. located in [0, 8] */
  665. i = atomic_read(&cp->in_pkts);
  666. if (i > 8 || i < 0) return 0;
  667. if (!todrop_rate[i]) return 0;
  668. if (--todrop_counter[i] > 0) return 0;
  669. todrop_counter[i] = todrop_rate[i];
  670. return 1;
  671. }
  672. /* Called from keventd and must protect itself from softirqs */
  673. void ip_vs_random_dropentry(void)
  674. {
  675. int idx;
  676. struct ip_vs_conn *cp;
  677. /*
  678. * Randomly scan 1/32 of the whole table every second
  679. */
  680. for (idx = 0; idx < (IP_VS_CONN_TAB_SIZE>>5); idx++) {
  681. unsigned hash = net_random() & IP_VS_CONN_TAB_MASK;
  682. /*
  683. * Lock is actually needed in this loop.
  684. */
  685. ct_write_lock_bh(hash);
  686. list_for_each_entry(cp, &ip_vs_conn_tab[hash], c_list) {
  687. if (cp->flags & IP_VS_CONN_F_TEMPLATE)
  688. /* connection template */
  689. continue;
  690. if (cp->protocol == IPPROTO_TCP) {
  691. switch(cp->state) {
  692. case IP_VS_TCP_S_SYN_RECV:
  693. case IP_VS_TCP_S_SYNACK:
  694. break;
  695. case IP_VS_TCP_S_ESTABLISHED:
  696. if (todrop_entry(cp))
  697. break;
  698. continue;
  699. default:
  700. continue;
  701. }
  702. } else {
  703. if (!todrop_entry(cp))
  704. continue;
  705. }
  706. IP_VS_DBG(4, "del connection\n");
  707. ip_vs_conn_expire_now(cp);
  708. if (cp->control) {
  709. IP_VS_DBG(4, "del conn template\n");
  710. ip_vs_conn_expire_now(cp->control);
  711. }
  712. }
  713. ct_write_unlock_bh(hash);
  714. }
  715. }
  716. /*
  717. * Flush all the connection entries in the ip_vs_conn_tab
  718. */
  719. static void ip_vs_conn_flush(void)
  720. {
  721. int idx;
  722. struct ip_vs_conn *cp;
  723. flush_again:
  724. for (idx=0; idx<IP_VS_CONN_TAB_SIZE; idx++) {
  725. /*
  726. * Lock is actually needed in this loop.
  727. */
  728. ct_write_lock_bh(idx);
  729. list_for_each_entry(cp, &ip_vs_conn_tab[idx], c_list) {
  730. IP_VS_DBG(4, "del connection\n");
  731. ip_vs_conn_expire_now(cp);
  732. if (cp->control) {
  733. IP_VS_DBG(4, "del conn template\n");
  734. ip_vs_conn_expire_now(cp->control);
  735. }
  736. }
  737. ct_write_unlock_bh(idx);
  738. }
  739. /* the counter may be not NULL, because maybe some conn entries
  740. are run by slow timer handler or unhashed but still referred */
  741. if (atomic_read(&ip_vs_conn_count) != 0) {
  742. schedule();
  743. goto flush_again;
  744. }
  745. }
  746. int ip_vs_conn_init(void)
  747. {
  748. int idx;
  749. /*
  750. * Allocate the connection hash table and initialize its list heads
  751. */
  752. ip_vs_conn_tab = vmalloc(IP_VS_CONN_TAB_SIZE*sizeof(struct list_head));
  753. if (!ip_vs_conn_tab)
  754. return -ENOMEM;
  755. /* Allocate ip_vs_conn slab cache */
  756. ip_vs_conn_cachep = kmem_cache_create("ip_vs_conn",
  757. sizeof(struct ip_vs_conn), 0,
  758. SLAB_HWCACHE_ALIGN, NULL);
  759. if (!ip_vs_conn_cachep) {
  760. vfree(ip_vs_conn_tab);
  761. return -ENOMEM;
  762. }
  763. IP_VS_INFO("Connection hash table configured "
  764. "(size=%d, memory=%ldKbytes)\n",
  765. IP_VS_CONN_TAB_SIZE,
  766. (long)(IP_VS_CONN_TAB_SIZE*sizeof(struct list_head))/1024);
  767. IP_VS_DBG(0, "Each connection entry needs %Zd bytes at least\n",
  768. sizeof(struct ip_vs_conn));
  769. for (idx = 0; idx < IP_VS_CONN_TAB_SIZE; idx++) {
  770. INIT_LIST_HEAD(&ip_vs_conn_tab[idx]);
  771. }
  772. for (idx = 0; idx < CT_LOCKARRAY_SIZE; idx++) {
  773. rwlock_init(&__ip_vs_conntbl_lock_array[idx].l);
  774. }
  775. proc_net_fops_create(&init_net, "ip_vs_conn", 0, &ip_vs_conn_fops);
  776. /* calculate the random value for connection hash */
  777. get_random_bytes(&ip_vs_conn_rnd, sizeof(ip_vs_conn_rnd));
  778. return 0;
  779. }
  780. void ip_vs_conn_cleanup(void)
  781. {
  782. /* flush all the connection entries first */
  783. ip_vs_conn_flush();
  784. /* Release the empty cache */
  785. kmem_cache_destroy(ip_vs_conn_cachep);
  786. proc_net_remove(&init_net, "ip_vs_conn");
  787. vfree(ip_vs_conn_tab);
  788. }