blob: 89f70073dec8519d25632feca8f655ab84fcea2a [file] [log] [blame]
Naveen N. Rao6ac0ba52016-06-22 21:55:06 +05301/*
2 * bpf_jit.h: BPF JIT compiler for PPC
Matt Evans0ca87f02011-07-20 15:51:00 +00003 *
4 * Copyright 2011 Matt Evans <matt@ozlabs.org>, IBM Corporation
Naveen N. Rao156d0e22016-06-22 21:55:07 +05305 * 2016 Naveen N. Rao <naveen.n.rao@linux.vnet.ibm.com>
Matt Evans0ca87f02011-07-20 15:51:00 +00006 *
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License
9 * as published by the Free Software Foundation; version 2
10 * of the License.
11 */
12#ifndef _BPF_JIT_H
13#define _BPF_JIT_H
14
Matt Evans0ca87f02011-07-20 15:51:00 +000015#ifndef __ASSEMBLY__
16
Naveen N. Rao156d0e22016-06-22 21:55:07 +053017#include <asm/types.h>
18
19#ifdef PPC64_ELF_ABI_v1
Matt Evans0ca87f02011-07-20 15:51:00 +000020#define FUNCTION_DESCR_SIZE 24
Denis Kirjanov09ca5ab2015-02-17 10:04:40 +030021#else
22#define FUNCTION_DESCR_SIZE 0
23#endif
Matt Evans0ca87f02011-07-20 15:51:00 +000024
25/*
26 * 16-bit immediate helper macros: HA() is for use with sign-extending instrs
27 * (e.g. LD, ADDI). If the bottom 16 bits is "-ve", add another bit into the
28 * top half to negate the effect (i.e. 0xffff + 1 = 0x(1)0000).
29 */
30#define IMM_H(i) ((uintptr_t)(i)>>16)
31#define IMM_HA(i) (((uintptr_t)(i)>>16) + \
Naveen N. Raocef1e8c2016-06-22 21:55:05 +053032 (((uintptr_t)(i) & 0x8000) >> 15))
Matt Evans0ca87f02011-07-20 15:51:00 +000033#define IMM_L(i) ((uintptr_t)(i) & 0xffff)
34
35#define PLANT_INSTR(d, idx, instr) \
36 do { if (d) { (d)[idx] = instr; } idx++; } while (0)
37#define EMIT(instr) PLANT_INSTR(image, ctx->idx, instr)
38
39#define PPC_NOP() EMIT(PPC_INST_NOP)
40#define PPC_BLR() EMIT(PPC_INST_BLR)
41#define PPC_BLRL() EMIT(PPC_INST_BLRL)
Michael Neulingcdaade712012-06-25 13:33:21 +000042#define PPC_MTLR(r) EMIT(PPC_INST_MTLR | ___PPC_RT(r))
Naveen N. Raoce076142016-09-24 02:05:01 +053043#define PPC_BCTR() EMIT(PPC_INST_BCTR)
44#define PPC_MTCTR(r) EMIT(PPC_INST_MTCTR | ___PPC_RT(r))
Michael Neulingcdaade712012-06-25 13:33:21 +000045#define PPC_ADDI(d, a, i) EMIT(PPC_INST_ADDI | ___PPC_RT(d) | \
46 ___PPC_RA(a) | IMM_L(i))
Matt Evans0ca87f02011-07-20 15:51:00 +000047#define PPC_MR(d, a) PPC_OR(d, a, a)
48#define PPC_LI(r, i) PPC_ADDI(r, 0, i)
49#define PPC_ADDIS(d, a, i) EMIT(PPC_INST_ADDIS | \
Naveen N. Raocef1e8c2016-06-22 21:55:05 +053050 ___PPC_RT(d) | ___PPC_RA(a) | IMM_L(i))
Matt Evans0ca87f02011-07-20 15:51:00 +000051#define PPC_LIS(r, i) PPC_ADDIS(r, 0, i)
Michael Neulingcdaade712012-06-25 13:33:21 +000052#define PPC_STD(r, base, i) EMIT(PPC_INST_STD | ___PPC_RS(r) | \
53 ___PPC_RA(base) | ((i) & 0xfffc))
Denis Kirjanov09ca5ab2015-02-17 10:04:40 +030054#define PPC_STDU(r, base, i) EMIT(PPC_INST_STDU | ___PPC_RS(r) | \
55 ___PPC_RA(base) | ((i) & 0xfffc))
56#define PPC_STW(r, base, i) EMIT(PPC_INST_STW | ___PPC_RS(r) | \
Naveen N. Raocef1e8c2016-06-22 21:55:05 +053057 ___PPC_RA(base) | IMM_L(i))
Denis Kirjanov09ca5ab2015-02-17 10:04:40 +030058#define PPC_STWU(r, base, i) EMIT(PPC_INST_STWU | ___PPC_RS(r) | \
Naveen N. Raocef1e8c2016-06-22 21:55:05 +053059 ___PPC_RA(base) | IMM_L(i))
Naveen N. Rao156d0e22016-06-22 21:55:07 +053060#define PPC_STH(r, base, i) EMIT(PPC_INST_STH | ___PPC_RS(r) | \
61 ___PPC_RA(base) | IMM_L(i))
62#define PPC_STB(r, base, i) EMIT(PPC_INST_STB | ___PPC_RS(r) | \
63 ___PPC_RA(base) | IMM_L(i))
Denis Kirjanov4e235762014-10-30 09:12:15 +030064
65#define PPC_LBZ(r, base, i) EMIT(PPC_INST_LBZ | ___PPC_RT(r) | \
66 ___PPC_RA(base) | IMM_L(i))
Michael Neulingcdaade712012-06-25 13:33:21 +000067#define PPC_LD(r, base, i) EMIT(PPC_INST_LD | ___PPC_RT(r) | \
68 ___PPC_RA(base) | IMM_L(i))
69#define PPC_LWZ(r, base, i) EMIT(PPC_INST_LWZ | ___PPC_RT(r) | \
70 ___PPC_RA(base) | IMM_L(i))
71#define PPC_LHZ(r, base, i) EMIT(PPC_INST_LHZ | ___PPC_RT(r) | \
72 ___PPC_RA(base) | IMM_L(i))
Philippe Bergheaud9c662ca2013-09-24 14:13:35 +020073#define PPC_LHBRX(r, base, b) EMIT(PPC_INST_LHBRX | ___PPC_RT(r) | \
74 ___PPC_RA(base) | ___PPC_RB(b))
Naveen N. Rao156d0e22016-06-22 21:55:07 +053075#define PPC_LDBRX(r, base, b) EMIT(PPC_INST_LDBRX | ___PPC_RT(r) | \
76 ___PPC_RA(base) | ___PPC_RB(b))
77
78#define PPC_BPF_LDARX(t, a, b, eh) EMIT(PPC_INST_LDARX | ___PPC_RT(t) | \
79 ___PPC_RA(a) | ___PPC_RB(b) | \
80 __PPC_EH(eh))
81#define PPC_BPF_LWARX(t, a, b, eh) EMIT(PPC_INST_LWARX | ___PPC_RT(t) | \
82 ___PPC_RA(a) | ___PPC_RB(b) | \
83 __PPC_EH(eh))
84#define PPC_BPF_STWCX(s, a, b) EMIT(PPC_INST_STWCX | ___PPC_RS(s) | \
85 ___PPC_RA(a) | ___PPC_RB(b))
86#define PPC_BPF_STDCX(s, a, b) EMIT(PPC_INST_STDCX | ___PPC_RS(s) | \
87 ___PPC_RA(a) | ___PPC_RB(b))
Denis Kirjanov09ca5ab2015-02-17 10:04:40 +030088
89#ifdef CONFIG_PPC64
90#define PPC_BPF_LL(r, base, i) do { PPC_LD(r, base, i); } while(0)
91#define PPC_BPF_STL(r, base, i) do { PPC_STD(r, base, i); } while(0)
92#define PPC_BPF_STLU(r, base, i) do { PPC_STDU(r, base, i); } while(0)
93#else
94#define PPC_BPF_LL(r, base, i) do { PPC_LWZ(r, base, i); } while(0)
95#define PPC_BPF_STL(r, base, i) do { PPC_STW(r, base, i); } while(0)
96#define PPC_BPF_STLU(r, base, i) do { PPC_STWU(r, base, i); } while(0)
97#endif
98
Michael Neulingcdaade712012-06-25 13:33:21 +000099#define PPC_CMPWI(a, i) EMIT(PPC_INST_CMPWI | ___PPC_RA(a) | IMM_L(i))
100#define PPC_CMPDI(a, i) EMIT(PPC_INST_CMPDI | ___PPC_RA(a) | IMM_L(i))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530101#define PPC_CMPW(a, b) EMIT(PPC_INST_CMPW | ___PPC_RA(a) | \
102 ___PPC_RB(b))
103#define PPC_CMPD(a, b) EMIT(PPC_INST_CMPD | ___PPC_RA(a) | \
104 ___PPC_RB(b))
Michael Neulingcdaade712012-06-25 13:33:21 +0000105#define PPC_CMPLWI(a, i) EMIT(PPC_INST_CMPLWI | ___PPC_RA(a) | IMM_L(i))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530106#define PPC_CMPLDI(a, i) EMIT(PPC_INST_CMPLDI | ___PPC_RA(a) | IMM_L(i))
Naveen N. Raocef1e8c2016-06-22 21:55:05 +0530107#define PPC_CMPLW(a, b) EMIT(PPC_INST_CMPLW | ___PPC_RA(a) | \
108 ___PPC_RB(b))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530109#define PPC_CMPLD(a, b) EMIT(PPC_INST_CMPLD | ___PPC_RA(a) | \
110 ___PPC_RB(b))
Matt Evans0ca87f02011-07-20 15:51:00 +0000111
Michael Neulingcdaade712012-06-25 13:33:21 +0000112#define PPC_SUB(d, a, b) EMIT(PPC_INST_SUB | ___PPC_RT(d) | \
113 ___PPC_RB(a) | ___PPC_RA(b))
114#define PPC_ADD(d, a, b) EMIT(PPC_INST_ADD | ___PPC_RT(d) | \
115 ___PPC_RA(a) | ___PPC_RB(b))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530116#define PPC_MULD(d, a, b) EMIT(PPC_INST_MULLD | ___PPC_RT(d) | \
117 ___PPC_RA(a) | ___PPC_RB(b))
Naveen N. Raocef1e8c2016-06-22 21:55:05 +0530118#define PPC_MULW(d, a, b) EMIT(PPC_INST_MULLW | ___PPC_RT(d) | \
Michael Neulingcdaade712012-06-25 13:33:21 +0000119 ___PPC_RA(a) | ___PPC_RB(b))
120#define PPC_MULHWU(d, a, b) EMIT(PPC_INST_MULHWU | ___PPC_RT(d) | \
121 ___PPC_RA(a) | ___PPC_RB(b))
122#define PPC_MULI(d, a, i) EMIT(PPC_INST_MULLI | ___PPC_RT(d) | \
123 ___PPC_RA(a) | IMM_L(i))
124#define PPC_DIVWU(d, a, b) EMIT(PPC_INST_DIVWU | ___PPC_RT(d) | \
125 ___PPC_RA(a) | ___PPC_RB(b))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530126#define PPC_DIVD(d, a, b) EMIT(PPC_INST_DIVD | ___PPC_RT(d) | \
127 ___PPC_RA(a) | ___PPC_RB(b))
Michael Neulingcdaade712012-06-25 13:33:21 +0000128#define PPC_AND(d, a, b) EMIT(PPC_INST_AND | ___PPC_RA(d) | \
129 ___PPC_RS(a) | ___PPC_RB(b))
130#define PPC_ANDI(d, a, i) EMIT(PPC_INST_ANDI | ___PPC_RA(d) | \
131 ___PPC_RS(a) | IMM_L(i))
132#define PPC_AND_DOT(d, a, b) EMIT(PPC_INST_ANDDOT | ___PPC_RA(d) | \
133 ___PPC_RS(a) | ___PPC_RB(b))
134#define PPC_OR(d, a, b) EMIT(PPC_INST_OR | ___PPC_RA(d) | \
135 ___PPC_RS(a) | ___PPC_RB(b))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530136#define PPC_MR(d, a) PPC_OR(d, a, a)
Michael Neulingcdaade712012-06-25 13:33:21 +0000137#define PPC_ORI(d, a, i) EMIT(PPC_INST_ORI | ___PPC_RA(d) | \
138 ___PPC_RS(a) | IMM_L(i))
139#define PPC_ORIS(d, a, i) EMIT(PPC_INST_ORIS | ___PPC_RA(d) | \
140 ___PPC_RS(a) | IMM_L(i))
Daniel Borkmann02871902012-11-08 11:39:41 +0000141#define PPC_XOR(d, a, b) EMIT(PPC_INST_XOR | ___PPC_RA(d) | \
142 ___PPC_RS(a) | ___PPC_RB(b))
143#define PPC_XORI(d, a, i) EMIT(PPC_INST_XORI | ___PPC_RA(d) | \
144 ___PPC_RS(a) | IMM_L(i))
145#define PPC_XORIS(d, a, i) EMIT(PPC_INST_XORIS | ___PPC_RA(d) | \
146 ___PPC_RS(a) | IMM_L(i))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530147#define PPC_EXTSW(d, a) EMIT(PPC_INST_EXTSW | ___PPC_RA(d) | \
148 ___PPC_RS(a))
Michael Neulingcdaade712012-06-25 13:33:21 +0000149#define PPC_SLW(d, a, s) EMIT(PPC_INST_SLW | ___PPC_RA(d) | \
150 ___PPC_RS(a) | ___PPC_RB(s))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530151#define PPC_SLD(d, a, s) EMIT(PPC_INST_SLD | ___PPC_RA(d) | \
152 ___PPC_RS(a) | ___PPC_RB(s))
Michael Neulingcdaade712012-06-25 13:33:21 +0000153#define PPC_SRW(d, a, s) EMIT(PPC_INST_SRW | ___PPC_RA(d) | \
154 ___PPC_RS(a) | ___PPC_RB(s))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530155#define PPC_SRD(d, a, s) EMIT(PPC_INST_SRD | ___PPC_RA(d) | \
156 ___PPC_RS(a) | ___PPC_RB(s))
157#define PPC_SRAD(d, a, s) EMIT(PPC_INST_SRAD | ___PPC_RA(d) | \
158 ___PPC_RS(a) | ___PPC_RB(s))
159#define PPC_SRADI(d, a, i) EMIT(PPC_INST_SRADI | ___PPC_RA(d) | \
160 ___PPC_RS(a) | __PPC_SH(i) | \
161 (((i) & 0x20) >> 4))
Naveen N. Rao277285b2016-06-22 21:55:04 +0530162#define PPC_RLWINM(d, a, i, mb, me) EMIT(PPC_INST_RLWINM | ___PPC_RA(d) | \
163 ___PPC_RS(a) | __PPC_SH(i) | \
164 __PPC_MB(mb) | __PPC_ME(me))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530165#define PPC_RLWIMI(d, a, i, mb, me) EMIT(PPC_INST_RLWIMI | ___PPC_RA(d) | \
166 ___PPC_RS(a) | __PPC_SH(i) | \
167 __PPC_MB(mb) | __PPC_ME(me))
168#define PPC_RLDICL(d, a, i, mb) EMIT(PPC_INST_RLDICL | ___PPC_RA(d) | \
169 ___PPC_RS(a) | __PPC_SH(i) | \
170 __PPC_MB64(mb) | (((i) & 0x20) >> 4))
Naveen N. Rao277285b2016-06-22 21:55:04 +0530171#define PPC_RLDICR(d, a, i, me) EMIT(PPC_INST_RLDICR | ___PPC_RA(d) | \
172 ___PPC_RS(a) | __PPC_SH(i) | \
173 __PPC_ME64(me) | (((i) & 0x20) >> 4))
174
Matt Evans0ca87f02011-07-20 15:51:00 +0000175/* slwi = rlwinm Rx, Ry, n, 0, 31-n */
Naveen N. Rao277285b2016-06-22 21:55:04 +0530176#define PPC_SLWI(d, a, i) PPC_RLWINM(d, a, i, 0, 31-(i))
Matt Evans0ca87f02011-07-20 15:51:00 +0000177/* srwi = rlwinm Rx, Ry, 32-n, n, 31 */
Naveen N. Rao277285b2016-06-22 21:55:04 +0530178#define PPC_SRWI(d, a, i) PPC_RLWINM(d, a, 32-(i), i, 31)
Matt Evans0ca87f02011-07-20 15:51:00 +0000179/* sldi = rldicr Rx, Ry, n, 63-n */
Naveen N. Rao277285b2016-06-22 21:55:04 +0530180#define PPC_SLDI(d, a, i) PPC_RLDICR(d, a, i, 63-(i))
Naveen N. Rao156d0e22016-06-22 21:55:07 +0530181/* sldi = rldicl Rx, Ry, 64-n, n */
182#define PPC_SRDI(d, a, i) PPC_RLDICL(d, a, 64-(i), i)
Naveen N. Rao277285b2016-06-22 21:55:04 +0530183
Michael Neulingcdaade712012-06-25 13:33:21 +0000184#define PPC_NEG(d, a) EMIT(PPC_INST_NEG | ___PPC_RT(d) | ___PPC_RA(a))
Matt Evans0ca87f02011-07-20 15:51:00 +0000185
186/* Long jump; (unconditional 'branch') */
187#define PPC_JMP(dest) EMIT(PPC_INST_BRANCH | \
188 (((dest) - (ctx->idx * 4)) & 0x03fffffc))
189/* "cond" here covers BO:BI fields. */
190#define PPC_BCC_SHORT(cond, dest) EMIT(PPC_INST_BRANCH_COND | \
191 (((cond) & 0x3ff) << 16) | \
192 (((dest) - (ctx->idx * 4)) & \
193 0xfffc))
Naveen N. Raoaaf2f7e2016-06-22 21:55:02 +0530194/* Sign-extended 32-bit immediate load */
195#define PPC_LI32(d, i) do { \
196 if ((int)(uintptr_t)(i) >= -32768 && \
197 (int)(uintptr_t)(i) < 32768) \
198 PPC_LI(d, i); \
199 else { \
200 PPC_LIS(d, IMM_H(i)); \
201 if (IMM_L(i)) \
202 PPC_ORI(d, d, IMM_L(i)); \
Matt Evans0ca87f02011-07-20 15:51:00 +0000203 } } while(0)
Naveen N. Raoaaf2f7e2016-06-22 21:55:02 +0530204
Matt Evans0ca87f02011-07-20 15:51:00 +0000205#define PPC_LI64(d, i) do { \
Naveen N. Raob1a05782016-06-22 21:55:03 +0530206 if ((long)(i) >= -2147483648 && \
207 (long)(i) < 2147483648) \
Matt Evans0ca87f02011-07-20 15:51:00 +0000208 PPC_LI32(d, i); \
209 else { \
Naveen N. Raob1a05782016-06-22 21:55:03 +0530210 if (!((uintptr_t)(i) & 0xffff800000000000ULL)) \
211 PPC_LI(d, ((uintptr_t)(i) >> 32) & 0xffff); \
212 else { \
213 PPC_LIS(d, ((uintptr_t)(i) >> 48)); \
214 if ((uintptr_t)(i) & 0x0000ffff00000000ULL) \
215 PPC_ORI(d, d, \
216 ((uintptr_t)(i) >> 32) & 0xffff); \
217 } \
Matt Evans0ca87f02011-07-20 15:51:00 +0000218 PPC_SLDI(d, d, 32); \
219 if ((uintptr_t)(i) & 0x00000000ffff0000ULL) \
220 PPC_ORIS(d, d, \
221 ((uintptr_t)(i) >> 16) & 0xffff); \
222 if ((uintptr_t)(i) & 0x000000000000ffffULL) \
223 PPC_ORI(d, d, (uintptr_t)(i) & 0xffff); \
Naveen N. Raob1a05782016-06-22 21:55:03 +0530224 } } while (0)
Matt Evans0ca87f02011-07-20 15:51:00 +0000225
Denis Kirjanov09ca5ab2015-02-17 10:04:40 +0300226#ifdef CONFIG_PPC64
227#define PPC_FUNC_ADDR(d,i) do { PPC_LI64(d, i); } while(0)
228#else
229#define PPC_FUNC_ADDR(d,i) do { PPC_LI32(d, i); } while(0)
230#endif
231
Matt Evans0ca87f02011-07-20 15:51:00 +0000232static inline bool is_nearbranch(int offset)
233{
234 return (offset < 32768) && (offset >= -32768);
235}
236
237/*
238 * The fly in the ointment of code size changing from pass to pass is
239 * avoided by padding the short branch case with a NOP. If code size differs
240 * with different branch reaches we will have the issue of code moving from
241 * one pass to the next and will need a few passes to converge on a stable
242 * state.
243 */
244#define PPC_BCC(cond, dest) do { \
245 if (is_nearbranch((dest) - (ctx->idx * 4))) { \
246 PPC_BCC_SHORT(cond, dest); \
247 PPC_NOP(); \
248 } else { \
249 /* Flip the 'T or F' bit to invert comparison */ \
250 PPC_BCC_SHORT(cond ^ COND_CMP_TRUE, (ctx->idx+2)*4); \
251 PPC_JMP(dest); \
252 } } while(0)
253
254/* To create a branch condition, select a bit of cr0... */
255#define CR0_LT 0
256#define CR0_GT 1
257#define CR0_EQ 2
258/* ...and modify BO[3] */
259#define COND_CMP_TRUE 0x100
260#define COND_CMP_FALSE 0x000
261/* Together, they make all required comparisons: */
262#define COND_GT (CR0_GT | COND_CMP_TRUE)
263#define COND_GE (CR0_LT | COND_CMP_FALSE)
264#define COND_EQ (CR0_EQ | COND_CMP_TRUE)
265#define COND_NE (CR0_EQ | COND_CMP_FALSE)
266#define COND_LT (CR0_LT | COND_CMP_TRUE)
267
Matt Evans0ca87f02011-07-20 15:51:00 +0000268#endif
269
270#endif