1 /* bpf_jit.h: BPF JIT compiler for PPC64 2 * 3 * Copyright 2011 Matt Evans <matt@ozlabs.org>, IBM Corporation 4 * 5 * This program is free software; you can redistribute it and/or 6 * modify it under the terms of the GNU General Public License 7 * as published by the Free Software Foundation; version 2 8 * of the License. 9 */ 10 #ifndef _BPF_JIT_H 11 #define _BPF_JIT_H 12 13 #ifdef CONFIG_PPC64 14 #define BPF_PPC_STACK_R3_OFF 48 15 #define BPF_PPC_STACK_LOCALS 32 16 #define BPF_PPC_STACK_BASIC (48+64) 17 #define BPF_PPC_STACK_SAVE (18*8) 18 #define BPF_PPC_STACKFRAME (BPF_PPC_STACK_BASIC+BPF_PPC_STACK_LOCALS+ \ 19 BPF_PPC_STACK_SAVE) 20 #define BPF_PPC_SLOWPATH_FRAME (48+64) 21 #else 22 #define BPF_PPC_STACK_R3_OFF 24 23 #define BPF_PPC_STACK_LOCALS 16 24 #define BPF_PPC_STACK_BASIC (24+32) 25 #define BPF_PPC_STACK_SAVE (18*4) 26 #define BPF_PPC_STACKFRAME (BPF_PPC_STACK_BASIC+BPF_PPC_STACK_LOCALS+ \ 27 BPF_PPC_STACK_SAVE) 28 #define BPF_PPC_SLOWPATH_FRAME (24+32) 29 #endif 30 31 #define REG_SZ (BITS_PER_LONG/8) 32 33 /* 34 * Generated code register usage: 35 * 36 * As normal PPC C ABI (e.g. r1=sp, r2=TOC), with: 37 * 38 * skb r3 (Entry parameter) 39 * A register r4 40 * X register r5 41 * addr param r6 42 * r7-r10 scratch 43 * skb->data r14 44 * skb headlen r15 (skb->len - skb->data_len) 45 * m[0] r16 46 * m[...] ... 47 * m[15] r31 48 */ 49 #define r_skb 3 50 #define r_ret 3 51 #define r_A 4 52 #define r_X 5 53 #define r_addr 6 54 #define r_scratch1 7 55 #define r_scratch2 8 56 #define r_D 14 57 #define r_HL 15 58 #define r_M 16 59 60 #ifndef __ASSEMBLY__ 61 62 /* 63 * Assembly helpers from arch/powerpc/net/bpf_jit.S: 64 */ 65 #define DECLARE_LOAD_FUNC(func) \ 66 extern u8 func[], func##_negative_offset[], func##_positive_offset[] 67 68 DECLARE_LOAD_FUNC(sk_load_word); 69 DECLARE_LOAD_FUNC(sk_load_half); 70 DECLARE_LOAD_FUNC(sk_load_byte); 71 DECLARE_LOAD_FUNC(sk_load_byte_msh); 72 73 #ifdef CONFIG_PPC64 74 #define FUNCTION_DESCR_SIZE 24 75 #else 76 #define FUNCTION_DESCR_SIZE 0 77 #endif 78 79 /* 80 * 16-bit immediate helper macros: HA() is for use with sign-extending instrs 81 * (e.g. LD, ADDI). If the bottom 16 bits is "-ve", add another bit into the 82 * top half to negate the effect (i.e. 0xffff + 1 = 0x(1)0000). 83 */ 84 #define IMM_H(i) ((uintptr_t)(i)>>16) 85 #define IMM_HA(i) (((uintptr_t)(i)>>16) + \ 86 (((uintptr_t)(i) & 0x8000) >> 15)) 87 #define IMM_L(i) ((uintptr_t)(i) & 0xffff) 88 89 #define PLANT_INSTR(d, idx, instr) \ 90 do { if (d) { (d)[idx] = instr; } idx++; } while (0) 91 #define EMIT(instr) PLANT_INSTR(image, ctx->idx, instr) 92 93 #define PPC_NOP() EMIT(PPC_INST_NOP) 94 #define PPC_BLR() EMIT(PPC_INST_BLR) 95 #define PPC_BLRL() EMIT(PPC_INST_BLRL) 96 #define PPC_MTLR(r) EMIT(PPC_INST_MTLR | ___PPC_RT(r)) 97 #define PPC_ADDI(d, a, i) EMIT(PPC_INST_ADDI | ___PPC_RT(d) | \ 98 ___PPC_RA(a) | IMM_L(i)) 99 #define PPC_MR(d, a) PPC_OR(d, a, a) 100 #define PPC_LI(r, i) PPC_ADDI(r, 0, i) 101 #define PPC_ADDIS(d, a, i) EMIT(PPC_INST_ADDIS | \ 102 ___PPC_RS(d) | ___PPC_RA(a) | IMM_L(i)) 103 #define PPC_LIS(r, i) PPC_ADDIS(r, 0, i) 104 #define PPC_STD(r, base, i) EMIT(PPC_INST_STD | ___PPC_RS(r) | \ 105 ___PPC_RA(base) | ((i) & 0xfffc)) 106 #define PPC_STDU(r, base, i) EMIT(PPC_INST_STDU | ___PPC_RS(r) | \ 107 ___PPC_RA(base) | ((i) & 0xfffc)) 108 #define PPC_STW(r, base, i) EMIT(PPC_INST_STW | ___PPC_RS(r) | \ 109 ___PPC_RA(base) | ((i) & 0xfffc)) 110 #define PPC_STWU(r, base, i) EMIT(PPC_INST_STWU | ___PPC_RS(r) | \ 111 ___PPC_RA(base) | ((i) & 0xfffc)) 112 113 #define PPC_LBZ(r, base, i) EMIT(PPC_INST_LBZ | ___PPC_RT(r) | \ 114 ___PPC_RA(base) | IMM_L(i)) 115 #define PPC_LD(r, base, i) EMIT(PPC_INST_LD | ___PPC_RT(r) | \ 116 ___PPC_RA(base) | IMM_L(i)) 117 #define PPC_LWZ(r, base, i) EMIT(PPC_INST_LWZ | ___PPC_RT(r) | \ 118 ___PPC_RA(base) | IMM_L(i)) 119 #define PPC_LHZ(r, base, i) EMIT(PPC_INST_LHZ | ___PPC_RT(r) | \ 120 ___PPC_RA(base) | IMM_L(i)) 121 #define PPC_LHBRX(r, base, b) EMIT(PPC_INST_LHBRX | ___PPC_RT(r) | \ 122 ___PPC_RA(base) | ___PPC_RB(b)) 123 124 #ifdef CONFIG_PPC64 125 #define PPC_BPF_LL(r, base, i) do { PPC_LD(r, base, i); } while(0) 126 #define PPC_BPF_STL(r, base, i) do { PPC_STD(r, base, i); } while(0) 127 #define PPC_BPF_STLU(r, base, i) do { PPC_STDU(r, base, i); } while(0) 128 #else 129 #define PPC_BPF_LL(r, base, i) do { PPC_LWZ(r, base, i); } while(0) 130 #define PPC_BPF_STL(r, base, i) do { PPC_STW(r, base, i); } while(0) 131 #define PPC_BPF_STLU(r, base, i) do { PPC_STWU(r, base, i); } while(0) 132 #endif 133 134 /* Convenience helpers for the above with 'far' offsets: */ 135 #define PPC_LBZ_OFFS(r, base, i) do { if ((i) < 32768) PPC_LBZ(r, base, i); \ 136 else { PPC_ADDIS(r, base, IMM_HA(i)); \ 137 PPC_LBZ(r, r, IMM_L(i)); } } while(0) 138 139 #define PPC_LD_OFFS(r, base, i) do { if ((i) < 32768) PPC_LD(r, base, i); \ 140 else { PPC_ADDIS(r, base, IMM_HA(i)); \ 141 PPC_LD(r, r, IMM_L(i)); } } while(0) 142 143 #define PPC_LWZ_OFFS(r, base, i) do { if ((i) < 32768) PPC_LWZ(r, base, i); \ 144 else { PPC_ADDIS(r, base, IMM_HA(i)); \ 145 PPC_LWZ(r, r, IMM_L(i)); } } while(0) 146 147 #define PPC_LHZ_OFFS(r, base, i) do { if ((i) < 32768) PPC_LHZ(r, base, i); \ 148 else { PPC_ADDIS(r, base, IMM_HA(i)); \ 149 PPC_LHZ(r, r, IMM_L(i)); } } while(0) 150 151 #ifdef CONFIG_PPC64 152 #define PPC_LL_OFFS(r, base, i) do { PPC_LD_OFFS(r, base, i); } while(0) 153 #else 154 #define PPC_LL_OFFS(r, base, i) do { PPC_LWZ_OFFS(r, base, i); } while(0) 155 #endif 156 157 #define PPC_CMPWI(a, i) EMIT(PPC_INST_CMPWI | ___PPC_RA(a) | IMM_L(i)) 158 #define PPC_CMPDI(a, i) EMIT(PPC_INST_CMPDI | ___PPC_RA(a) | IMM_L(i)) 159 #define PPC_CMPLWI(a, i) EMIT(PPC_INST_CMPLWI | ___PPC_RA(a) | IMM_L(i)) 160 #define PPC_CMPLW(a, b) EMIT(PPC_INST_CMPLW | ___PPC_RA(a) | ___PPC_RB(b)) 161 162 #define PPC_SUB(d, a, b) EMIT(PPC_INST_SUB | ___PPC_RT(d) | \ 163 ___PPC_RB(a) | ___PPC_RA(b)) 164 #define PPC_ADD(d, a, b) EMIT(PPC_INST_ADD | ___PPC_RT(d) | \ 165 ___PPC_RA(a) | ___PPC_RB(b)) 166 #define PPC_MUL(d, a, b) EMIT(PPC_INST_MULLW | ___PPC_RT(d) | \ 167 ___PPC_RA(a) | ___PPC_RB(b)) 168 #define PPC_MULHWU(d, a, b) EMIT(PPC_INST_MULHWU | ___PPC_RT(d) | \ 169 ___PPC_RA(a) | ___PPC_RB(b)) 170 #define PPC_MULI(d, a, i) EMIT(PPC_INST_MULLI | ___PPC_RT(d) | \ 171 ___PPC_RA(a) | IMM_L(i)) 172 #define PPC_DIVWU(d, a, b) EMIT(PPC_INST_DIVWU | ___PPC_RT(d) | \ 173 ___PPC_RA(a) | ___PPC_RB(b)) 174 #define PPC_AND(d, a, b) EMIT(PPC_INST_AND | ___PPC_RA(d) | \ 175 ___PPC_RS(a) | ___PPC_RB(b)) 176 #define PPC_ANDI(d, a, i) EMIT(PPC_INST_ANDI | ___PPC_RA(d) | \ 177 ___PPC_RS(a) | IMM_L(i)) 178 #define PPC_AND_DOT(d, a, b) EMIT(PPC_INST_ANDDOT | ___PPC_RA(d) | \ 179 ___PPC_RS(a) | ___PPC_RB(b)) 180 #define PPC_OR(d, a, b) EMIT(PPC_INST_OR | ___PPC_RA(d) | \ 181 ___PPC_RS(a) | ___PPC_RB(b)) 182 #define PPC_ORI(d, a, i) EMIT(PPC_INST_ORI | ___PPC_RA(d) | \ 183 ___PPC_RS(a) | IMM_L(i)) 184 #define PPC_ORIS(d, a, i) EMIT(PPC_INST_ORIS | ___PPC_RA(d) | \ 185 ___PPC_RS(a) | IMM_L(i)) 186 #define PPC_XOR(d, a, b) EMIT(PPC_INST_XOR | ___PPC_RA(d) | \ 187 ___PPC_RS(a) | ___PPC_RB(b)) 188 #define PPC_XORI(d, a, i) EMIT(PPC_INST_XORI | ___PPC_RA(d) | \ 189 ___PPC_RS(a) | IMM_L(i)) 190 #define PPC_XORIS(d, a, i) EMIT(PPC_INST_XORIS | ___PPC_RA(d) | \ 191 ___PPC_RS(a) | IMM_L(i)) 192 #define PPC_SLW(d, a, s) EMIT(PPC_INST_SLW | ___PPC_RA(d) | \ 193 ___PPC_RS(a) | ___PPC_RB(s)) 194 #define PPC_SRW(d, a, s) EMIT(PPC_INST_SRW | ___PPC_RA(d) | \ 195 ___PPC_RS(a) | ___PPC_RB(s)) 196 /* slwi = rlwinm Rx, Ry, n, 0, 31-n */ 197 #define PPC_SLWI(d, a, i) EMIT(PPC_INST_RLWINM | ___PPC_RA(d) | \ 198 ___PPC_RS(a) | __PPC_SH(i) | \ 199 __PPC_MB(0) | __PPC_ME(31-(i))) 200 /* srwi = rlwinm Rx, Ry, 32-n, n, 31 */ 201 #define PPC_SRWI(d, a, i) EMIT(PPC_INST_RLWINM | ___PPC_RA(d) | \ 202 ___PPC_RS(a) | __PPC_SH(32-(i)) | \ 203 __PPC_MB(i) | __PPC_ME(31)) 204 /* sldi = rldicr Rx, Ry, n, 63-n */ 205 #define PPC_SLDI(d, a, i) EMIT(PPC_INST_RLDICR | ___PPC_RA(d) | \ 206 ___PPC_RS(a) | __PPC_SH(i) | \ 207 __PPC_MB(63-(i)) | (((i) & 0x20) >> 4)) 208 #define PPC_NEG(d, a) EMIT(PPC_INST_NEG | ___PPC_RT(d) | ___PPC_RA(a)) 209 210 /* Long jump; (unconditional 'branch') */ 211 #define PPC_JMP(dest) EMIT(PPC_INST_BRANCH | \ 212 (((dest) - (ctx->idx * 4)) & 0x03fffffc)) 213 /* "cond" here covers BO:BI fields. */ 214 #define PPC_BCC_SHORT(cond, dest) EMIT(PPC_INST_BRANCH_COND | \ 215 (((cond) & 0x3ff) << 16) | \ 216 (((dest) - (ctx->idx * 4)) & \ 217 0xfffc)) 218 #define PPC_LI32(d, i) do { PPC_LI(d, IMM_L(i)); \ 219 if ((u32)(uintptr_t)(i) >= 32768) { \ 220 PPC_ADDIS(d, d, IMM_HA(i)); \ 221 } } while(0) 222 #define PPC_LI64(d, i) do { \ 223 if (!((uintptr_t)(i) & 0xffffffff00000000ULL)) \ 224 PPC_LI32(d, i); \ 225 else { \ 226 PPC_LIS(d, ((uintptr_t)(i) >> 48)); \ 227 if ((uintptr_t)(i) & 0x0000ffff00000000ULL) \ 228 PPC_ORI(d, d, \ 229 ((uintptr_t)(i) >> 32) & 0xffff); \ 230 PPC_SLDI(d, d, 32); \ 231 if ((uintptr_t)(i) & 0x00000000ffff0000ULL) \ 232 PPC_ORIS(d, d, \ 233 ((uintptr_t)(i) >> 16) & 0xffff); \ 234 if ((uintptr_t)(i) & 0x000000000000ffffULL) \ 235 PPC_ORI(d, d, (uintptr_t)(i) & 0xffff); \ 236 } } while (0); 237 238 #ifdef CONFIG_PPC64 239 #define PPC_FUNC_ADDR(d,i) do { PPC_LI64(d, i); } while(0) 240 #else 241 #define PPC_FUNC_ADDR(d,i) do { PPC_LI32(d, i); } while(0) 242 #endif 243 244 #define PPC_LHBRX_OFFS(r, base, i) \ 245 do { PPC_LI32(r, i); PPC_LHBRX(r, r, base); } while(0) 246 #ifdef __LITTLE_ENDIAN__ 247 #define PPC_NTOHS_OFFS(r, base, i) PPC_LHBRX_OFFS(r, base, i) 248 #else 249 #define PPC_NTOHS_OFFS(r, base, i) PPC_LHZ_OFFS(r, base, i) 250 #endif 251 252 static inline bool is_nearbranch(int offset) 253 { 254 return (offset < 32768) && (offset >= -32768); 255 } 256 257 /* 258 * The fly in the ointment of code size changing from pass to pass is 259 * avoided by padding the short branch case with a NOP. If code size differs 260 * with different branch reaches we will have the issue of code moving from 261 * one pass to the next and will need a few passes to converge on a stable 262 * state. 263 */ 264 #define PPC_BCC(cond, dest) do { \ 265 if (is_nearbranch((dest) - (ctx->idx * 4))) { \ 266 PPC_BCC_SHORT(cond, dest); \ 267 PPC_NOP(); \ 268 } else { \ 269 /* Flip the 'T or F' bit to invert comparison */ \ 270 PPC_BCC_SHORT(cond ^ COND_CMP_TRUE, (ctx->idx+2)*4); \ 271 PPC_JMP(dest); \ 272 } } while(0) 273 274 /* To create a branch condition, select a bit of cr0... */ 275 #define CR0_LT 0 276 #define CR0_GT 1 277 #define CR0_EQ 2 278 /* ...and modify BO[3] */ 279 #define COND_CMP_TRUE 0x100 280 #define COND_CMP_FALSE 0x000 281 /* Together, they make all required comparisons: */ 282 #define COND_GT (CR0_GT | COND_CMP_TRUE) 283 #define COND_GE (CR0_LT | COND_CMP_FALSE) 284 #define COND_EQ (CR0_EQ | COND_CMP_TRUE) 285 #define COND_NE (CR0_EQ | COND_CMP_FALSE) 286 #define COND_LT (CR0_LT | COND_CMP_TRUE) 287 288 #define SEEN_DATAREF 0x10000 /* might call external helpers */ 289 #define SEEN_XREG 0x20000 /* X reg is used */ 290 #define SEEN_MEM 0x40000 /* SEEN_MEM+(1<<n) = use mem[n] for temporary 291 * storage */ 292 #define SEEN_MEM_MSK 0x0ffff 293 294 struct codegen_context { 295 unsigned int seen; 296 unsigned int idx; 297 int pc_ret0; /* bpf index of first RET #0 instruction (if any) */ 298 }; 299 300 #endif 301 302 #endif 303