ip_vs_conn.c 21 KB

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