anonfunc/xtables-addons
1
0
Fork 0
mirror of git://git.code.sf.net/p/xtables-addons/xtables-addons synced 2025-09-08 13:44:56 +02:00
Code Issues Releases Wiki Activity

psd: style: break double statements

Browse Source
This commit is contained in:
Jan Engelhardt
2009-08-14 20:24:36 +02:00
parent 6b175b40cb
commit 5b07e04600
1 changed files with 13 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

15
extensions/xt_psd.c
View File

@@ -164,9 +164,11 @@ xt_psd_match(const struct sk_buff *pskb, const struct xt_match_param *match)
last = NULL; last = NULL;
if ((curr = *(head = &state.hash[hash = hashfunc(addr)]))) if ((curr = *(head = &state.hash[hash = hashfunc(addr)])))
do { do {
if (curr->src_addr.s_addr == addr.s_addr) break; if (curr->src_addr.s_addr == addr.s_addr)
break;
count++; count++;
if (curr->next) last = curr; if (curr->next)
last = curr;
} while ((curr = curr->next)); } while ((curr = curr->next));
if (curr) { if (curr) {
@@ -245,7 +247,8 @@ xt_psd_match(const struct sk_buff *pskb, const struct xt_match_param *match)
/* Got too many source addresses with the same hash value? Then remove the /* Got too many source addresses with the same hash value? Then remove the
* oldest one from the hash table, so that they can't take too much of our * oldest one from the hash table, so that they can't take too much of our
* CPU time even with carefully chosen spoofed IP addresses. */ * CPU time even with carefully chosen spoofed IP addresses. */
if (count >= HASH_MAX && last) last->next = NULL; if (count >= HASH_MAX && last)
last->next = NULL;
/* We're going to re-use the oldest list entry, so remove it from the hash /* We're going to re-use the oldest list entry, so remove it from the hash
* table first (if it is really already in use, and isn't removed from the * table first (if it is really already in use, and isn't removed from the
@@ -259,7 +262,8 @@ xt_psd_match(const struct sk_buff *pskb, const struct xt_match_param *match)
last = NULL; last = NULL;
if ((curr = *head)) if ((curr = *head))
do { do {
if (curr == &state.list[state.index]) break; if (curr == &state.list[state.index])
break;
last = curr; last = curr;
} while ((curr = curr->next)); } while ((curr = curr->next));
@@ -273,7 +277,8 @@ xt_psd_match(const struct sk_buff *pskb, const struct xt_match_param *match)
/* Get our list entry */ /* Get our list entry */
curr = &state.list[state.index++]; curr = &state.list[state.index++];
if (state.index >= LIST_SIZE) state.index = 0; if (state.index >= LIST_SIZE)
state.index = 0;
/* Link it into the hash table */ /* Link it into the hash table */
head = &state.hash[hash]; head = &state.hash[hash];