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: Ben Hawkes <hawkes@google.com>
Signed-off-by: Florian Westphal <fw@strlen.de>
Signed-off-by: Chris J. Arges <chris.j.arges@canonical.com>
Acked-by: Brad Figg <brad.figg@canonical.com>
Signed-off-by: Brad Figg <brad.figg@canonical.com>
Signed-off-by: Tim Gardner <tim.gardner@canonical.com>
memcmp(&e->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.
*/
/* Move along one */
size = e->next_offset;
+ if (!next_offset_ok(newinfo, pos + size))
+ return 0;
e = entry0 + pos + size;
if (pos + size >= newinfo->size)
return 0;
if (newpos >= newinfo->size)
return 0;
}
+
+ if (!next_offset_ok(newinfo, newpos))
+ return 0;
+
e = entry0 + newpos;
e->counters.pcnt = pos;
pos = newpos;
else return verdict;
}
+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
/* Move along one */
size = e->next_offset;
+ if (!next_offset_ok(newinfo, pos + size))
+ return 0;
e = entry0 + pos + size;
if (pos + size >= newinfo->size)
return 0;
if (newpos >= newinfo->size)
return 0;
}
+
+ if (!next_offset_ok(newinfo, newpos))
+ return 0;
+
e = entry0 + newpos;
e->counters.pcnt = pos;
pos = newpos;
else return verdict;
}
+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
/* Move along one */
size = e->next_offset;
+ if (!next_offset_ok(newinfo, pos + size))
+ return 0;
e = entry0 + pos + size;
if (pos + size >= newinfo->size)
return 0;
if (newpos >= newinfo->size)
return 0;
}
+
+ if (!next_offset_ok(newinfo, newpos))
+ return 0;
+
e = entry0 + newpos;
e->counters.pcnt = pos;
pos = newpos;