netfilter: xtables: resolve indirect macros 2/3
Signed-off-by: Jan Engelhardt <jengelh@medozas.de>
This commit is contained in:
@ -228,7 +228,7 @@ arpt_error(struct sk_buff *skb, const struct xt_action_param *par)
|
||||
return NF_DROP;
|
||||
}
|
||||
|
||||
static inline const struct arpt_entry_target *
|
||||
static inline const struct xt_entry_target *
|
||||
arpt_get_target_c(const struct arpt_entry *e)
|
||||
{
|
||||
return arpt_get_target((struct arpt_entry *)e);
|
||||
@ -282,7 +282,7 @@ unsigned int arpt_do_table(struct sk_buff *skb,
|
||||
|
||||
arp = arp_hdr(skb);
|
||||
do {
|
||||
const struct arpt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
|
||||
if (!arp_packet_match(arp, skb->dev, indev, outdev, &e->arp)) {
|
||||
e = arpt_next_entry(e);
|
||||
@ -297,7 +297,7 @@ unsigned int arpt_do_table(struct sk_buff *skb,
|
||||
if (!t->u.kernel.target->target) {
|
||||
int v;
|
||||
|
||||
v = ((struct arpt_standard_target *)t)->verdict;
|
||||
v = ((struct xt_standard_target *)t)->verdict;
|
||||
if (v < 0) {
|
||||
/* Pop from stack? */
|
||||
if (v != ARPT_RETURN) {
|
||||
@ -377,7 +377,7 @@ static int mark_source_chains(const struct xt_table_info *newinfo,
|
||||
e->counters.pcnt = pos;
|
||||
|
||||
for (;;) {
|
||||
const struct arpt_standard_target *t
|
||||
const struct xt_standard_target *t
|
||||
= (void *)arpt_get_target_c(e);
|
||||
int visited = e->comefrom & (1 << hook);
|
||||
|
||||
@ -464,14 +464,14 @@ static int mark_source_chains(const struct xt_table_info *newinfo,
|
||||
|
||||
static inline int check_entry(const struct arpt_entry *e, const char *name)
|
||||
{
|
||||
const struct arpt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
|
||||
if (!arp_checkentry(&e->arp)) {
|
||||
duprintf("arp_tables: arp check failed %p %s.\n", e, name);
|
||||
return -EINVAL;
|
||||
}
|
||||
|
||||
if (e->target_offset + sizeof(struct arpt_entry_target) > e->next_offset)
|
||||
if (e->target_offset + sizeof(struct xt_entry_target) > e->next_offset)
|
||||
return -EINVAL;
|
||||
|
||||
t = arpt_get_target_c(e);
|
||||
@ -483,7 +483,7 @@ static inline int check_entry(const struct arpt_entry *e, const char *name)
|
||||
|
||||
static inline int check_target(struct arpt_entry *e, const char *name)
|
||||
{
|
||||
struct arpt_entry_target *t = arpt_get_target(e);
|
||||
struct xt_entry_target *t = arpt_get_target(e);
|
||||
int ret;
|
||||
struct xt_tgchk_param par = {
|
||||
.table = name,
|
||||
@ -506,7 +506,7 @@ static inline int check_target(struct arpt_entry *e, const char *name)
|
||||
static inline int
|
||||
find_check_entry(struct arpt_entry *e, const char *name, unsigned int size)
|
||||
{
|
||||
struct arpt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_target *target;
|
||||
int ret;
|
||||
|
||||
@ -536,7 +536,7 @@ out:
|
||||
|
||||
static bool check_underflow(const struct arpt_entry *e)
|
||||
{
|
||||
const struct arpt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
unsigned int verdict;
|
||||
|
||||
if (!unconditional(&e->arp))
|
||||
@ -544,7 +544,7 @@ static bool check_underflow(const struct arpt_entry *e)
|
||||
t = arpt_get_target_c(e);
|
||||
if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)
|
||||
return false;
|
||||
verdict = ((struct arpt_standard_target *)t)->verdict;
|
||||
verdict = ((struct xt_standard_target *)t)->verdict;
|
||||
verdict = -verdict - 1;
|
||||
return verdict == NF_DROP || verdict == NF_ACCEPT;
|
||||
}
|
||||
@ -566,7 +566,7 @@ static inline int check_entry_size_and_hooks(struct arpt_entry *e,
|
||||
}
|
||||
|
||||
if (e->next_offset
|
||||
< sizeof(struct arpt_entry) + sizeof(struct arpt_entry_target)) {
|
||||
< sizeof(struct arpt_entry) + sizeof(struct xt_entry_target)) {
|
||||
duprintf("checking: element %p size %u\n",
|
||||
e, e->next_offset);
|
||||
return -EINVAL;
|
||||
@ -598,7 +598,7 @@ static inline int check_entry_size_and_hooks(struct arpt_entry *e,
|
||||
static inline void cleanup_entry(struct arpt_entry *e)
|
||||
{
|
||||
struct xt_tgdtor_param par;
|
||||
struct arpt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
|
||||
t = arpt_get_target(e);
|
||||
par.target = t->u.kernel.target;
|
||||
@ -794,7 +794,7 @@ static int copy_entries_to_user(unsigned int total_size,
|
||||
/* FIXME: use iterator macros --RR */
|
||||
/* ... then go back and fix counters and names */
|
||||
for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
|
||||
const struct arpt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
|
||||
e = (struct arpt_entry *)(loc_cpu_entry + off);
|
||||
if (copy_to_user(userptr + off
|
||||
@ -807,7 +807,7 @@ static int copy_entries_to_user(unsigned int total_size,
|
||||
|
||||
t = arpt_get_target_c(e);
|
||||
if (copy_to_user(userptr + off + e->target_offset
|
||||
+ offsetof(struct arpt_entry_target,
|
||||
+ offsetof(struct xt_entry_target,
|
||||
u.user.name),
|
||||
t->u.kernel.target->name,
|
||||
strlen(t->u.kernel.target->name)+1) != 0) {
|
||||
@ -844,7 +844,7 @@ static int compat_calc_entry(const struct arpt_entry *e,
|
||||
const struct xt_table_info *info,
|
||||
const void *base, struct xt_table_info *newinfo)
|
||||
{
|
||||
const struct arpt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
unsigned int entry_offset;
|
||||
int off, i, ret;
|
||||
|
||||
@ -1204,7 +1204,7 @@ static int do_add_counters(struct net *net, const void __user *user,
|
||||
#ifdef CONFIG_COMPAT
|
||||
static inline void compat_release_entry(struct compat_arpt_entry *e)
|
||||
{
|
||||
struct arpt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
|
||||
t = compat_arpt_get_target(e);
|
||||
module_put(t->u.kernel.target->me);
|
||||
@ -1220,7 +1220,7 @@ check_compat_entry_size_and_hooks(struct compat_arpt_entry *e,
|
||||
const unsigned int *underflows,
|
||||
const char *name)
|
||||
{
|
||||
struct arpt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_target *target;
|
||||
unsigned int entry_offset;
|
||||
int ret, off, h;
|
||||
@ -1288,7 +1288,7 @@ compat_copy_entry_from_user(struct compat_arpt_entry *e, void **dstptr,
|
||||
unsigned int *size, const char *name,
|
||||
struct xt_table_info *newinfo, unsigned char *base)
|
||||
{
|
||||
struct arpt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_target *target;
|
||||
struct arpt_entry *de;
|
||||
unsigned int origsize;
|
||||
@ -1567,7 +1567,7 @@ static int compat_copy_entry_to_user(struct arpt_entry *e, void __user **dstptr,
|
||||
struct xt_counters *counters,
|
||||
unsigned int i)
|
||||
{
|
||||
struct arpt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct compat_arpt_entry __user *ce;
|
||||
u_int16_t target_offset, next_offset;
|
||||
compat_uint_t origsize;
|
||||
|
@ -186,7 +186,7 @@ static inline bool unconditional(const struct ipt_ip *ip)
|
||||
}
|
||||
|
||||
/* for const-correctness */
|
||||
static inline const struct ipt_entry_target *
|
||||
static inline const struct xt_entry_target *
|
||||
ipt_get_target_c(const struct ipt_entry *e)
|
||||
{
|
||||
return ipt_get_target((struct ipt_entry *)e);
|
||||
@ -230,7 +230,7 @@ get_chainname_rulenum(const struct ipt_entry *s, const struct ipt_entry *e,
|
||||
const char *hookname, const char **chainname,
|
||||
const char **comment, unsigned int *rulenum)
|
||||
{
|
||||
const struct ipt_standard_target *t = (void *)ipt_get_target_c(s);
|
||||
const struct xt_standard_target *t = (void *)ipt_get_target_c(s);
|
||||
|
||||
if (strcmp(t->target.u.kernel.target->name, IPT_ERROR_TARGET) == 0) {
|
||||
/* Head of user chain: ERROR target with chainname */
|
||||
@ -346,7 +346,7 @@ ipt_do_table(struct sk_buff *skb,
|
||||
get_entry(table_base, private->underflow[hook]));
|
||||
|
||||
do {
|
||||
const struct ipt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
const struct xt_entry_match *ematch;
|
||||
|
||||
IP_NF_ASSERT(e);
|
||||
@ -380,7 +380,7 @@ ipt_do_table(struct sk_buff *skb,
|
||||
if (!t->u.kernel.target->target) {
|
||||
int v;
|
||||
|
||||
v = ((struct ipt_standard_target *)t)->verdict;
|
||||
v = ((struct xt_standard_target *)t)->verdict;
|
||||
if (v < 0) {
|
||||
/* Pop from stack? */
|
||||
if (v != IPT_RETURN) {
|
||||
@ -461,7 +461,7 @@ mark_source_chains(const struct xt_table_info *newinfo,
|
||||
e->counters.pcnt = pos;
|
||||
|
||||
for (;;) {
|
||||
const struct ipt_standard_target *t
|
||||
const struct xt_standard_target *t
|
||||
= (void *)ipt_get_target_c(e);
|
||||
int visited = e->comefrom & (1 << hook);
|
||||
|
||||
@ -552,7 +552,7 @@ mark_source_chains(const struct xt_table_info *newinfo,
|
||||
return 1;
|
||||
}
|
||||
|
||||
static void cleanup_match(struct ipt_entry_match *m, struct net *net)
|
||||
static void cleanup_match(struct xt_entry_match *m, struct net *net)
|
||||
{
|
||||
struct xt_mtdtor_param par;
|
||||
|
||||
@ -568,14 +568,14 @@ static void cleanup_match(struct ipt_entry_match *m, struct net *net)
|
||||
static int
|
||||
check_entry(const struct ipt_entry *e, const char *name)
|
||||
{
|
||||
const struct ipt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
|
||||
if (!ip_checkentry(&e->ip)) {
|
||||
duprintf("ip check failed %p %s.\n", e, par->match->name);
|
||||
return -EINVAL;
|
||||
}
|
||||
|
||||
if (e->target_offset + sizeof(struct ipt_entry_target) >
|
||||
if (e->target_offset + sizeof(struct xt_entry_target) >
|
||||
e->next_offset)
|
||||
return -EINVAL;
|
||||
|
||||
@ -587,7 +587,7 @@ check_entry(const struct ipt_entry *e, const char *name)
|
||||
}
|
||||
|
||||
static int
|
||||
check_match(struct ipt_entry_match *m, struct xt_mtchk_param *par)
|
||||
check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
|
||||
{
|
||||
const struct ipt_ip *ip = par->entryinfo;
|
||||
int ret;
|
||||
@ -605,7 +605,7 @@ check_match(struct ipt_entry_match *m, struct xt_mtchk_param *par)
|
||||
}
|
||||
|
||||
static int
|
||||
find_check_match(struct ipt_entry_match *m, struct xt_mtchk_param *par)
|
||||
find_check_match(struct xt_entry_match *m, struct xt_mtchk_param *par)
|
||||
{
|
||||
struct xt_match *match;
|
||||
int ret;
|
||||
@ -630,7 +630,7 @@ err:
|
||||
|
||||
static int check_target(struct ipt_entry *e, struct net *net, const char *name)
|
||||
{
|
||||
struct ipt_entry_target *t = ipt_get_target(e);
|
||||
struct xt_entry_target *t = ipt_get_target(e);
|
||||
struct xt_tgchk_param par = {
|
||||
.net = net,
|
||||
.table = name,
|
||||
@ -656,7 +656,7 @@ static int
|
||||
find_check_entry(struct ipt_entry *e, struct net *net, const char *name,
|
||||
unsigned int size)
|
||||
{
|
||||
struct ipt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_target *target;
|
||||
int ret;
|
||||
unsigned int j;
|
||||
@ -707,7 +707,7 @@ find_check_entry(struct ipt_entry *e, struct net *net, const char *name,
|
||||
|
||||
static bool check_underflow(const struct ipt_entry *e)
|
||||
{
|
||||
const struct ipt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
unsigned int verdict;
|
||||
|
||||
if (!unconditional(&e->ip))
|
||||
@ -715,7 +715,7 @@ static bool check_underflow(const struct ipt_entry *e)
|
||||
t = ipt_get_target_c(e);
|
||||
if (strcmp(t->u.user.name, XT_STANDARD_TARGET) != 0)
|
||||
return false;
|
||||
verdict = ((struct ipt_standard_target *)t)->verdict;
|
||||
verdict = ((struct xt_standard_target *)t)->verdict;
|
||||
verdict = -verdict - 1;
|
||||
return verdict == NF_DROP || verdict == NF_ACCEPT;
|
||||
}
|
||||
@ -738,7 +738,7 @@ check_entry_size_and_hooks(struct ipt_entry *e,
|
||||
}
|
||||
|
||||
if (e->next_offset
|
||||
< sizeof(struct ipt_entry) + sizeof(struct ipt_entry_target)) {
|
||||
< sizeof(struct ipt_entry) + sizeof(struct xt_entry_target)) {
|
||||
duprintf("checking: element %p size %u\n",
|
||||
e, e->next_offset);
|
||||
return -EINVAL;
|
||||
@ -771,7 +771,7 @@ static void
|
||||
cleanup_entry(struct ipt_entry *e, struct net *net)
|
||||
{
|
||||
struct xt_tgdtor_param par;
|
||||
struct ipt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_entry_match *ematch;
|
||||
|
||||
/* Cleanup all matches */
|
||||
@ -972,8 +972,8 @@ copy_entries_to_user(unsigned int total_size,
|
||||
/* ... then go back and fix counters and names */
|
||||
for (off = 0, num = 0; off < total_size; off += e->next_offset, num++){
|
||||
unsigned int i;
|
||||
const struct ipt_entry_match *m;
|
||||
const struct ipt_entry_target *t;
|
||||
const struct xt_entry_match *m;
|
||||
const struct xt_entry_target *t;
|
||||
|
||||
e = (struct ipt_entry *)(loc_cpu_entry + off);
|
||||
if (copy_to_user(userptr + off
|
||||
@ -990,7 +990,7 @@ copy_entries_to_user(unsigned int total_size,
|
||||
m = (void *)e + i;
|
||||
|
||||
if (copy_to_user(userptr + off + i
|
||||
+ offsetof(struct ipt_entry_match,
|
||||
+ offsetof(struct xt_entry_match,
|
||||
u.user.name),
|
||||
m->u.kernel.match->name,
|
||||
strlen(m->u.kernel.match->name)+1)
|
||||
@ -1002,7 +1002,7 @@ copy_entries_to_user(unsigned int total_size,
|
||||
|
||||
t = ipt_get_target_c(e);
|
||||
if (copy_to_user(userptr + off + e->target_offset
|
||||
+ offsetof(struct ipt_entry_target,
|
||||
+ offsetof(struct xt_entry_target,
|
||||
u.user.name),
|
||||
t->u.kernel.target->name,
|
||||
strlen(t->u.kernel.target->name)+1) != 0) {
|
||||
@ -1040,7 +1040,7 @@ static int compat_calc_entry(const struct ipt_entry *e,
|
||||
const void *base, struct xt_table_info *newinfo)
|
||||
{
|
||||
const struct xt_entry_match *ematch;
|
||||
const struct ipt_entry_target *t;
|
||||
const struct xt_entry_target *t;
|
||||
unsigned int entry_offset;
|
||||
int off, i, ret;
|
||||
|
||||
@ -1407,7 +1407,7 @@ struct compat_ipt_replace {
|
||||
u32 hook_entry[NF_INET_NUMHOOKS];
|
||||
u32 underflow[NF_INET_NUMHOOKS];
|
||||
u32 num_counters;
|
||||
compat_uptr_t counters; /* struct ipt_counters * */
|
||||
compat_uptr_t counters; /* struct xt_counters * */
|
||||
struct compat_ipt_entry entries[0];
|
||||
};
|
||||
|
||||
@ -1416,7 +1416,7 @@ compat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,
|
||||
unsigned int *size, struct xt_counters *counters,
|
||||
unsigned int i)
|
||||
{
|
||||
struct ipt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct compat_ipt_entry __user *ce;
|
||||
u_int16_t target_offset, next_offset;
|
||||
compat_uint_t origsize;
|
||||
@ -1451,7 +1451,7 @@ compat_copy_entry_to_user(struct ipt_entry *e, void __user **dstptr,
|
||||
}
|
||||
|
||||
static int
|
||||
compat_find_calc_match(struct ipt_entry_match *m,
|
||||
compat_find_calc_match(struct xt_entry_match *m,
|
||||
const char *name,
|
||||
const struct ipt_ip *ip,
|
||||
unsigned int hookmask,
|
||||
@ -1473,7 +1473,7 @@ compat_find_calc_match(struct ipt_entry_match *m,
|
||||
|
||||
static void compat_release_entry(struct compat_ipt_entry *e)
|
||||
{
|
||||
struct ipt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_entry_match *ematch;
|
||||
|
||||
/* Cleanup all matches */
|
||||
@ -1494,7 +1494,7 @@ check_compat_entry_size_and_hooks(struct compat_ipt_entry *e,
|
||||
const char *name)
|
||||
{
|
||||
struct xt_entry_match *ematch;
|
||||
struct ipt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_target *target;
|
||||
unsigned int entry_offset;
|
||||
unsigned int j;
|
||||
@ -1576,7 +1576,7 @@ compat_copy_entry_from_user(struct compat_ipt_entry *e, void **dstptr,
|
||||
unsigned int *size, const char *name,
|
||||
struct xt_table_info *newinfo, unsigned char *base)
|
||||
{
|
||||
struct ipt_entry_target *t;
|
||||
struct xt_entry_target *t;
|
||||
struct xt_target *target;
|
||||
struct ipt_entry *de;
|
||||
unsigned int origsize;
|
||||
|
Reference in New Issue
Block a user