Commit 99d9d519 authored by Florian Westphal's avatar Florian Westphal Committed by Tim Gardner

UBUNTU: SAUCE: [nf,v2] netfilter: x_tables: don't rely on well-behaving userspace

BugLink: http://bugs.launchpad.net/bugs/1555338

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.

Problem is that xt_entry_foreach() macro stops iterating once e->next_offset
is out of bounds, assuming this is the last entry.

With malformed data thats not necessarily the case so we can
write outside of allocated area later as we might not have walked the
entire blob.

Fix this by simplifying mark_source_chains -- it already has to check
if nextoff is in range to catch invalid jumps, so just do the check
when we move to a next entry as well.

Also, check that the offset meets the xtables_entry alignment.
Reported-by: default avatarBen Hawkes <hawkes@google.com>
Signed-off-by: default avatarFlorian Westphal <fw@strlen.de>
Signed-off-by: default avatarChris J. Arges <chris.j.arges@canonical.com>
Acked-by: default avatarBrad Figg <brad.figg@canonical.com>
Signed-off-by: default avatarBrad Figg <brad.figg@canonical.com>
Signed-off-by: default avatarTim Gardner <tim.gardner@canonical.com>
parent 7da29bde
......@@ -366,6 +366,17 @@ static inline bool unconditional(const struct arpt_arp *arp)
return memcmp(arp, &uncond, sizeof(uncond)) == 0;
}
static bool next_offset_ok(const struct xt_table_info *t, unsigned int newpos)
{
if (newpos > t->size - sizeof(struct arpt_entry))
return false;
if (newpos % __alignof__(struct arpt_entry) != 0)
return false;
return true;
}
/* Figures out from what hook each rule can be called: returns 0 if
* there are loops. Puts hook bitmask in comefrom.
*/
......@@ -437,6 +448,8 @@ static int mark_source_chains(const struct xt_table_info *newinfo,
/* Move along one */
size = e->next_offset;
if (!next_offset_ok(newinfo, pos + size))
return 0;
e = (struct arpt_entry *)
(entry0 + pos + size);
e->counters.pcnt = pos;
......@@ -447,14 +460,6 @@ static int mark_source_chains(const struct xt_table_info *newinfo,
if (strcmp(t->target.u.user.name,
XT_STANDARD_TARGET) == 0 &&
newpos >= 0) {
if (newpos > newinfo->size -
sizeof(struct arpt_entry)) {
duprintf("mark_source_chains: "
"bad verdict (%i)\n",
newpos);
return 0;
}
/* This a jump; chase it. */
duprintf("Jump rule %u -> %u\n",
pos, newpos);
......@@ -462,6 +467,10 @@ static int mark_source_chains(const struct xt_table_info *newinfo,
/* ... this is a fallthru */
newpos = pos + e->next_offset;
}
if (!next_offset_ok(newinfo, newpos))
return 0;
e = (struct arpt_entry *)
(entry0 + newpos);
e->counters.pcnt = pos;
......
......@@ -443,6 +443,17 @@ ipt_do_table(struct sk_buff *skb,
#endif
}
static bool next_offset_ok(const struct xt_table_info *t, unsigned int newpos)
{
if (newpos > t->size - sizeof(struct ipt_entry))
return false;
if (newpos % __alignof__(struct ipt_entry) != 0)
return false;
return true;
}
/* Figures out from what hook each rule can be called: returns 0 if
there are loops. Puts hook bitmask in comefrom. */
static int
......@@ -519,6 +530,8 @@ mark_source_chains(const struct xt_table_info *newinfo,
/* Move along one */
size = e->next_offset;
if (!next_offset_ok(newinfo, pos + size))
return 0;
e = (struct ipt_entry *)
(entry0 + pos + size);
e->counters.pcnt = pos;
......@@ -529,13 +542,6 @@ mark_source_chains(const struct xt_table_info *newinfo,
if (strcmp(t->target.u.user.name,
XT_STANDARD_TARGET) == 0 &&
newpos >= 0) {
if (newpos > newinfo->size -
sizeof(struct ipt_entry)) {
duprintf("mark_source_chains: "
"bad verdict (%i)\n",
newpos);
return 0;
}
/* This a jump; chase it. */
duprintf("Jump rule %u -> %u\n",
pos, newpos);
......@@ -543,6 +549,10 @@ mark_source_chains(const struct xt_table_info *newinfo,
/* ... this is a fallthru */
newpos = pos + e->next_offset;
}
if (!next_offset_ok(newinfo, newpos))
return 0;
e = (struct ipt_entry *)
(entry0 + newpos);
e->counters.pcnt = pos;
......
......@@ -455,6 +455,17 @@ ip6t_do_table(struct sk_buff *skb,
#endif
}
static bool next_offset_ok(const struct xt_table_info *t, unsigned int newpos)
{
if (newpos > t->size - sizeof(struct ip6t_entry))
return false;
if (newpos % __alignof__(struct ip6t_entry) != 0)
return false;
return true;
}
/* Figures out from what hook each rule can be called: returns 0 if
there are loops. Puts hook bitmask in comefrom. */
static int
......@@ -531,6 +542,8 @@ mark_source_chains(const struct xt_table_info *newinfo,
/* Move along one */
size = e->next_offset;
if (!next_offset_ok(newinfo, pos + size))
return 0;
e = (struct ip6t_entry *)
(entry0 + pos + size);
e->counters.pcnt = pos;
......@@ -541,13 +554,6 @@ mark_source_chains(const struct xt_table_info *newinfo,
if (strcmp(t->target.u.user.name,
XT_STANDARD_TARGET) == 0 &&
newpos >= 0) {
if (newpos > newinfo->size -
sizeof(struct ip6t_entry)) {
duprintf("mark_source_chains: "
"bad verdict (%i)\n",
newpos);
return 0;
}
/* This a jump; chase it. */
duprintf("Jump rule %u -> %u\n",
pos, newpos);
......@@ -555,6 +561,10 @@ mark_source_chains(const struct xt_table_info *newinfo,
/* ... this is a fallthru */
newpos = pos + e->next_offset;
}
if (!next_offset_ok(newinfo, newpos))
return 0;
e = (struct ip6t_entry *)
(entry0 + newpos);
e->counters.pcnt = pos;
......
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