diff options
| author | Denis Kirjanov <kda@linux-powerpc.org> | 2014-11-17 15:07:41 -0500 |
|---|---|---|
| committer | David S. Miller <davem@davemloft.net> | 2014-11-18 13:20:09 -0500 |
| commit | cadaecd2188b99d93de676150007f0e097223232 (patch) | |
| tree | c6b9cce5cdd22a4df086d65f2c392f3722d01f96 /arch/powerpc/net | |
| parent | 65622ed40eef5ce2732365077b22416593fec4c8 (diff) | |
PPC: bpf_jit_comp: Unify BPF_MOD | BPF_X and BPF_DIV | BPF_X
Reduce duplicated code by unifying
BPF_ALU | BPF_MOD | BPF_X and BPF_ALU | BPF_DIV | BPF_X
CC: Alexei Starovoitov<alexei.starovoitov@gmail.com>
CC: Daniel Borkmann<dborkman@redhat.com>
CC: Philippe Bergheaud<felix@linux.vnet.ibm.com>
Signed-off-by: Denis Kirjanov <kda@linux-powerpc.org>
Acked-by: Alexei Starovoitov <ast@plumgrid.com>
Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'arch/powerpc/net')
| -rw-r--r-- | arch/powerpc/net/bpf_jit_comp.c | 27 |
1 files changed, 8 insertions, 19 deletions
diff --git a/arch/powerpc/net/bpf_jit_comp.c b/arch/powerpc/net/bpf_jit_comp.c index d3fa80d04e6b..1ca125b9c226 100644 --- a/arch/powerpc/net/bpf_jit_comp.c +++ b/arch/powerpc/net/bpf_jit_comp.c | |||
| @@ -181,6 +181,7 @@ static int bpf_jit_build_body(struct bpf_prog *fp, u32 *image, | |||
| 181 | } | 181 | } |
| 182 | break; | 182 | break; |
| 183 | case BPF_ALU | BPF_MOD | BPF_X: /* A %= X; */ | 183 | case BPF_ALU | BPF_MOD | BPF_X: /* A %= X; */ |
| 184 | case BPF_ALU | BPF_DIV | BPF_X: /* A /= X; */ | ||
| 184 | ctx->seen |= SEEN_XREG; | 185 | ctx->seen |= SEEN_XREG; |
| 185 | PPC_CMPWI(r_X, 0); | 186 | PPC_CMPWI(r_X, 0); |
| 186 | if (ctx->pc_ret0 != -1) { | 187 | if (ctx->pc_ret0 != -1) { |
| @@ -190,9 +191,13 @@ static int bpf_jit_build_body(struct bpf_prog *fp, u32 *image, | |||
| 190 | PPC_LI(r_ret, 0); | 191 | PPC_LI(r_ret, 0); |
| 191 | PPC_JMP(exit_addr); | 192 | PPC_JMP(exit_addr); |
| 192 | } | 193 | } |
| 193 | PPC_DIVWU(r_scratch1, r_A, r_X); | 194 | if (code == (BPF_ALU | BPF_MOD | BPF_X)) { |
| 194 | PPC_MUL(r_scratch1, r_X, r_scratch1); | 195 | PPC_DIVWU(r_scratch1, r_A, r_X); |
| 195 | PPC_SUB(r_A, r_A, r_scratch1); | 196 | PPC_MUL(r_scratch1, r_X, r_scratch1); |
| 197 | PPC_SUB(r_A, r_A, r_scratch1); | ||
| 198 | } else { | ||
| 199 | PPC_DIVWU(r_A, r_A, r_X); | ||
| 200 | } | ||
| 196 | break; | 201 | break; |
| 197 | case BPF_ALU | BPF_MOD | BPF_K: /* A %= K; */ | 202 | case BPF_ALU | BPF_MOD | BPF_K: /* A %= K; */ |
| 198 | PPC_LI32(r_scratch2, K); | 203 | PPC_LI32(r_scratch2, K); |
| @@ -200,22 +205,6 @@ static int bpf_jit_build_body(struct bpf_prog *fp, u32 *image, | |||
| 200 | PPC_MUL(r_scratch1, r_scratch2, r_scratch1); | 205 | PPC_MUL(r_scratch1, r_scratch2, r_scratch1); |
| 201 | PPC_SUB(r_A, r_A, r_scratch1); | 206 | PPC_SUB(r_A, r_A, r_scratch1); |
| 202 | break; | 207 | break; |
| 203 | case BPF_ALU | BPF_DIV | BPF_X: /* A /= X; */ | ||
| 204 | ctx->seen |= SEEN_XREG; | ||
| 205 | PPC_CMPWI(r_X, 0); | ||
| 206 | if (ctx->pc_ret0 != -1) { | ||
| 207 | PPC_BCC(COND_EQ, addrs[ctx->pc_ret0]); | ||
| 208 | } else { | ||
| 209 | /* | ||
| 210 | * Exit, returning 0; first pass hits here | ||
| 211 | * (longer worst-case code size). | ||
| 212 | */ | ||
| 213 | PPC_BCC_SHORT(COND_NE, (ctx->idx*4)+12); | ||
| 214 | PPC_LI(r_ret, 0); | ||
| 215 | PPC_JMP(exit_addr); | ||
| 216 | } | ||
| 217 | PPC_DIVWU(r_A, r_A, r_X); | ||
| 218 | break; | ||
| 219 | case BPF_ALU | BPF_DIV | BPF_K: /* A /= K */ | 208 | case BPF_ALU | BPF_DIV | BPF_K: /* A /= K */ |
| 220 | if (K == 1) | 209 | if (K == 1) |
| 221 | break; | 210 | break; |
