Commit f24e230d authored by Florian Westphal's avatar Florian Westphal Committed by Pablo Neira Ayuso

netfilter: x_tables: don't move to non-existent next rule

Ben Hawkes says:

 In the mark_source_chains function (net/ipv4/netfilter/ip_tables.c) it
 is possible for a user-supplied ipt_entry structure to have a large
 next_offset field. This field is not bounds checked prior to writing a
 counter value at the supplied offset.

Base chains enforce absolute verdict.

User defined chains are supposed to end with an unconditional return,
xtables userspace adds them automatically.

But if such return is missing we will move to non-existent next rule.
Reported-by: default avatarBen Hawkes <hawkes@google.com>
Signed-off-by: default avatarFlorian Westphal <fw@strlen.de>
Signed-off-by: default avatarPablo Neira Ayuso <pablo@netfilter.org>
parent 7d45a04c
...@@ -439,6 +439,8 @@ static int mark_source_chains(const struct xt_table_info *newinfo, ...@@ -439,6 +439,8 @@ static int mark_source_chains(const struct xt_table_info *newinfo,
size = e->next_offset; size = e->next_offset;
e = (struct arpt_entry *) e = (struct arpt_entry *)
(entry0 + pos + size); (entry0 + pos + size);
if (pos + size >= newinfo->size)
return 0;
e->counters.pcnt = pos; e->counters.pcnt = pos;
pos += size; pos += size;
} else { } else {
...@@ -461,6 +463,8 @@ static int mark_source_chains(const struct xt_table_info *newinfo, ...@@ -461,6 +463,8 @@ static int mark_source_chains(const struct xt_table_info *newinfo,
} else { } else {
/* ... this is a fallthru */ /* ... this is a fallthru */
newpos = pos + e->next_offset; newpos = pos + e->next_offset;
if (newpos >= newinfo->size)
return 0;
} }
e = (struct arpt_entry *) e = (struct arpt_entry *)
(entry0 + newpos); (entry0 + newpos);
...@@ -691,10 +695,8 @@ static int translate_table(struct xt_table_info *newinfo, void *entry0, ...@@ -691,10 +695,8 @@ static int translate_table(struct xt_table_info *newinfo, void *entry0,
} }
} }
if (!mark_source_chains(newinfo, repl->valid_hooks, entry0)) { if (!mark_source_chains(newinfo, repl->valid_hooks, entry0))
duprintf("Looping hook\n");
return -ELOOP; return -ELOOP;
}
/* Finally, each sanity check must pass */ /* Finally, each sanity check must pass */
i = 0; i = 0;
......
...@@ -520,6 +520,8 @@ mark_source_chains(const struct xt_table_info *newinfo, ...@@ -520,6 +520,8 @@ mark_source_chains(const struct xt_table_info *newinfo,
size = e->next_offset; size = e->next_offset;
e = (struct ipt_entry *) e = (struct ipt_entry *)
(entry0 + pos + size); (entry0 + pos + size);
if (pos + size >= newinfo->size)
return 0;
e->counters.pcnt = pos; e->counters.pcnt = pos;
pos += size; pos += size;
} else { } else {
...@@ -541,6 +543,8 @@ mark_source_chains(const struct xt_table_info *newinfo, ...@@ -541,6 +543,8 @@ mark_source_chains(const struct xt_table_info *newinfo,
} else { } else {
/* ... this is a fallthru */ /* ... this is a fallthru */
newpos = pos + e->next_offset; newpos = pos + e->next_offset;
if (newpos >= newinfo->size)
return 0;
} }
e = (struct ipt_entry *) e = (struct ipt_entry *)
(entry0 + newpos); (entry0 + newpos);
......
...@@ -532,6 +532,8 @@ mark_source_chains(const struct xt_table_info *newinfo, ...@@ -532,6 +532,8 @@ mark_source_chains(const struct xt_table_info *newinfo,
size = e->next_offset; size = e->next_offset;
e = (struct ip6t_entry *) e = (struct ip6t_entry *)
(entry0 + pos + size); (entry0 + pos + size);
if (pos + size >= newinfo->size)
return 0;
e->counters.pcnt = pos; e->counters.pcnt = pos;
pos += size; pos += size;
} else { } else {
...@@ -553,6 +555,8 @@ mark_source_chains(const struct xt_table_info *newinfo, ...@@ -553,6 +555,8 @@ mark_source_chains(const struct xt_table_info *newinfo,
} else { } else {
/* ... this is a fallthru */ /* ... this is a fallthru */
newpos = pos + e->next_offset; newpos = pos + e->next_offset;
if (newpos >= newinfo->size)
return 0;
} }
e = (struct ip6t_entry *) e = (struct ip6t_entry *)
(entry0 + newpos); (entry0 + newpos);
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment