blob: b20a2a83a6e75be330ef97f9ea65e785629bb1ca [file] [log] [blame]
Thomas Gleixnerb886d83c2019-06-01 10:08:55 +02001/* SPDX-License-Identifier: GPL-2.0-only */
Naveen N. Rao6ac0ba52016-06-22 21:55:06 +05302/*
3 * bpf_jit.h: BPF JIT compiler for PPC
Matt Evans0ca87f02011-07-20 15:51:00 +00004 *
5 * Copyright 2011 Matt Evans <matt@ozlabs.org>, IBM Corporation
Naveen N. Rao156d0e22016-06-22 21:55:07 +05306 * 2016 Naveen N. Rao <naveen.n.rao@linux.vnet.ibm.com>
Matt Evans0ca87f02011-07-20 15:51:00 +00007 */
8#ifndef _BPF_JIT_H
9#define _BPF_JIT_H
10
Matt Evans0ca87f02011-07-20 15:51:00 +000011#ifndef __ASSEMBLY__
12
Naveen N. Rao156d0e22016-06-22 21:55:07 +053013#include <asm/types.h>
Balamuruhan S06541862020-06-24 17:00:35 +053014#include <asm/ppc-opcode.h>
Naveen N. Rao156d0e22016-06-22 21:55:07 +053015
16#ifdef PPC64_ELF_ABI_v1
Matt Evans0ca87f02011-07-20 15:51:00 +000017#define FUNCTION_DESCR_SIZE 24
Denis Kirjanov09ca5ab2015-02-17 10:04:40 +030018#else
19#define FUNCTION_DESCR_SIZE 0
20#endif
Matt Evans0ca87f02011-07-20 15:51:00 +000021
Matt Evans0ca87f02011-07-20 15:51:00 +000022#define PLANT_INSTR(d, idx, instr) \
23 do { if (d) { (d)[idx] = instr; } idx++; } while (0)
24#define EMIT(instr) PLANT_INSTR(image, ctx->idx, instr)
25
Matt Evans0ca87f02011-07-20 15:51:00 +000026/* Long jump; (unconditional 'branch') */
Naveen N. Rao3832ba42021-10-06 01:55:21 +053027#define PPC_JMP(dest) \
28 do { \
29 long offset = (long)(dest) - (ctx->idx * 4); \
30 if (!is_offset_in_branch_range(offset)) { \
31 pr_err_ratelimited("Branch offset 0x%lx (@%u) out of range\n", offset, ctx->idx); \
32 return -ERANGE; \
33 } \
Hari Bathinif15a71b2021-10-12 18:00:52 +053034 EMIT(PPC_RAW_BRANCH(offset)); \
Naveen N. Rao3832ba42021-10-06 01:55:21 +053035 } while (0)
36
Christophe Leroyee7c3ec2021-04-12 11:44:18 +000037/* blr; (unconditional 'branch' with link) to absolute address */
38#define PPC_BL_ABS(dest) EMIT(PPC_INST_BL | \
39 (((dest) - (unsigned long)(image + ctx->idx)) & 0x03fffffc))
Matt Evans0ca87f02011-07-20 15:51:00 +000040/* "cond" here covers BO:BI fields. */
Naveen N. Rao3832ba42021-10-06 01:55:21 +053041#define PPC_BCC_SHORT(cond, dest) \
42 do { \
43 long offset = (long)(dest) - (ctx->idx * 4); \
44 if (!is_offset_in_cond_branch_range(offset)) { \
45 pr_err_ratelimited("Conditional branch offset 0x%lx (@%u) out of range\n", offset, ctx->idx); \
46 return -ERANGE; \
47 } \
48 EMIT(PPC_INST_BRANCH_COND | (((cond) & 0x3ff) << 16) | (offset & 0xfffc)); \
49 } while (0)
50
Naveen N. Raoaaf2f7e2016-06-22 21:55:02 +053051/* Sign-extended 32-bit immediate load */
52#define PPC_LI32(d, i) do { \
53 if ((int)(uintptr_t)(i) >= -32768 && \
54 (int)(uintptr_t)(i) < 32768) \
Balamuruhan S3a181232020-06-24 17:00:36 +053055 EMIT(PPC_RAW_LI(d, i)); \
Naveen N. Raoaaf2f7e2016-06-22 21:55:02 +053056 else { \
Balamuruhan S3a181232020-06-24 17:00:36 +053057 EMIT(PPC_RAW_LIS(d, IMM_H(i))); \
Naveen N. Raoaaf2f7e2016-06-22 21:55:02 +053058 if (IMM_L(i)) \
Balamuruhan S3a181232020-06-24 17:00:36 +053059 EMIT(PPC_RAW_ORI(d, d, IMM_L(i))); \
Matt Evans0ca87f02011-07-20 15:51:00 +000060 } } while(0)
Naveen N. Raoaaf2f7e2016-06-22 21:55:02 +053061
Christophe Leroy51c66ad2021-03-22 16:37:52 +000062#ifdef CONFIG_PPC32
63#define PPC_EX32(r, i) EMIT(PPC_RAW_LI((r), (i) < 0 ? -1 : 0))
64#endif
65
Matt Evans0ca87f02011-07-20 15:51:00 +000066#define PPC_LI64(d, i) do { \
Naveen N. Raob1a05782016-06-22 21:55:03 +053067 if ((long)(i) >= -2147483648 && \
68 (long)(i) < 2147483648) \
Matt Evans0ca87f02011-07-20 15:51:00 +000069 PPC_LI32(d, i); \
70 else { \
Naveen N. Raob1a05782016-06-22 21:55:03 +053071 if (!((uintptr_t)(i) & 0xffff800000000000ULL)) \
Balamuruhan S3a181232020-06-24 17:00:36 +053072 EMIT(PPC_RAW_LI(d, ((uintptr_t)(i) >> 32) & \
73 0xffff)); \
Naveen N. Raob1a05782016-06-22 21:55:03 +053074 else { \
Balamuruhan S3a181232020-06-24 17:00:36 +053075 EMIT(PPC_RAW_LIS(d, ((uintptr_t)(i) >> 48))); \
Naveen N. Raob1a05782016-06-22 21:55:03 +053076 if ((uintptr_t)(i) & 0x0000ffff00000000ULL) \
Balamuruhan S3a181232020-06-24 17:00:36 +053077 EMIT(PPC_RAW_ORI(d, d, \
78 ((uintptr_t)(i) >> 32) & 0xffff)); \
Naveen N. Raob1a05782016-06-22 21:55:03 +053079 } \
Balamuruhan S3a181232020-06-24 17:00:36 +053080 EMIT(PPC_RAW_SLDI(d, d, 32)); \
Matt Evans0ca87f02011-07-20 15:51:00 +000081 if ((uintptr_t)(i) & 0x00000000ffff0000ULL) \
Balamuruhan S3a181232020-06-24 17:00:36 +053082 EMIT(PPC_RAW_ORIS(d, d, \
83 ((uintptr_t)(i) >> 16) & 0xffff)); \
Matt Evans0ca87f02011-07-20 15:51:00 +000084 if ((uintptr_t)(i) & 0x000000000000ffffULL) \
Balamuruhan S3a181232020-06-24 17:00:36 +053085 EMIT(PPC_RAW_ORI(d, d, (uintptr_t)(i) & \
86 0xffff)); \
Naveen N. Raob1a05782016-06-22 21:55:03 +053087 } } while (0)
Matt Evans0ca87f02011-07-20 15:51:00 +000088
Denis Kirjanov09ca5ab2015-02-17 10:04:40 +030089#ifdef CONFIG_PPC64
90#define PPC_FUNC_ADDR(d,i) do { PPC_LI64(d, i); } while(0)
91#else
92#define PPC_FUNC_ADDR(d,i) do { PPC_LI32(d, i); } while(0)
93#endif
94
Matt Evans0ca87f02011-07-20 15:51:00 +000095/*
96 * The fly in the ointment of code size changing from pass to pass is
97 * avoided by padding the short branch case with a NOP. If code size differs
98 * with different branch reaches we will have the issue of code moving from
99 * one pass to the next and will need a few passes to converge on a stable
100 * state.
101 */
102#define PPC_BCC(cond, dest) do { \
Naveen N. Rao4549c3e2021-10-06 01:55:20 +0530103 if (is_offset_in_cond_branch_range((long)(dest) - (ctx->idx * 4))) { \
Matt Evans0ca87f02011-07-20 15:51:00 +0000104 PPC_BCC_SHORT(cond, dest); \
Balamuruhan S3a181232020-06-24 17:00:36 +0530105 EMIT(PPC_RAW_NOP()); \
Matt Evans0ca87f02011-07-20 15:51:00 +0000106 } else { \
107 /* Flip the 'T or F' bit to invert comparison */ \
108 PPC_BCC_SHORT(cond ^ COND_CMP_TRUE, (ctx->idx+2)*4); \
109 PPC_JMP(dest); \
110 } } while(0)
111
112/* To create a branch condition, select a bit of cr0... */
113#define CR0_LT 0
114#define CR0_GT 1
115#define CR0_EQ 2
116/* ...and modify BO[3] */
117#define COND_CMP_TRUE 0x100
118#define COND_CMP_FALSE 0x000
119/* Together, they make all required comparisons: */
120#define COND_GT (CR0_GT | COND_CMP_TRUE)
121#define COND_GE (CR0_LT | COND_CMP_FALSE)
122#define COND_EQ (CR0_EQ | COND_CMP_TRUE)
123#define COND_NE (CR0_EQ | COND_CMP_FALSE)
124#define COND_LT (CR0_LT | COND_CMP_TRUE)
Daniel Borkmann20dbf5c2017-08-10 01:40:00 +0200125#define COND_LE (CR0_GT | COND_CMP_FALSE)
Matt Evans0ca87f02011-07-20 15:51:00 +0000126
Christophe Leroyc4268102021-03-22 16:37:50 +0000127#define SEEN_FUNC 0x20000000 /* might call external helpers */
Ravi Bangoriac9ce7c32021-10-12 18:00:49 +0530128#define SEEN_TAILCALL 0x40000000 /* uses tail calls */
Christophe Leroyf1b15832021-03-22 16:37:48 +0000129
Christophe Leroy40272032021-03-22 16:37:53 +0000130#define SEEN_VREG_MASK 0x1ff80000 /* Volatile registers r3-r12 */
131#define SEEN_NVREG_MASK 0x0003ffff /* Non volatile registers r14-r31 */
132
133#ifdef CONFIG_PPC64
134extern const int b2p[MAX_BPF_JIT_REG + 2];
135#else
136extern const int b2p[MAX_BPF_JIT_REG + 1];
137#endif
138
Christophe Leroyf1b15832021-03-22 16:37:48 +0000139struct codegen_context {
140 /*
141 * This is used to track register usage as well
142 * as calls to external helpers.
143 * - register usage is tracked with corresponding
Christophe Leroyc4268102021-03-22 16:37:50 +0000144 * bits (r3-r31)
Christophe Leroyf1b15832021-03-22 16:37:48 +0000145 * - rest of the bits can be used to track other
Christophe Leroyc4268102021-03-22 16:37:50 +0000146 * things -- for now, we use bits 0 to 2
Christophe Leroyf1b15832021-03-22 16:37:48 +0000147 * encoded in SEEN_* macros above
148 */
149 unsigned int seen;
150 unsigned int idx;
151 unsigned int stack_size;
Christophe Leroy40272032021-03-22 16:37:53 +0000152 int b2p[ARRAY_SIZE(b2p)];
Ravi Bangoria983bdc02021-10-12 18:00:53 +0530153 unsigned int exentry_idx;
Christophe Leroyf1b15832021-03-22 16:37:48 +0000154};
155
Hari Bathini23b51912021-10-12 18:00:55 +0530156#ifdef CONFIG_PPC32
157#define BPF_FIXUP_LEN 3 /* Three instructions => 12 bytes */
158#else
Ravi Bangoria983bdc02021-10-12 18:00:53 +0530159#define BPF_FIXUP_LEN 2 /* Two instructions => 8 bytes */
Hari Bathini23b51912021-10-12 18:00:55 +0530160#endif
Ravi Bangoria983bdc02021-10-12 18:00:53 +0530161
Christophe Leroyf1b15832021-03-22 16:37:48 +0000162static inline void bpf_flush_icache(void *start, void *end)
163{
164 smp_wmb(); /* smp write barrier */
165 flush_icache_range((unsigned long)start, (unsigned long)end);
166}
167
168static inline bool bpf_is_seen_register(struct codegen_context *ctx, int i)
169{
170 return ctx->seen & (1 << (31 - i));
171}
172
173static inline void bpf_set_seen_register(struct codegen_context *ctx, int i)
174{
175 ctx->seen |= 1 << (31 - i);
176}
177
Christophe Leroy40272032021-03-22 16:37:53 +0000178static inline void bpf_clear_seen_register(struct codegen_context *ctx, int i)
179{
180 ctx->seen &= ~(1 << (31 - i));
181}
182
Christophe Leroy4ea76e92021-03-22 16:37:49 +0000183void bpf_jit_emit_func_call_rel(u32 *image, struct codegen_context *ctx, u64 func);
184int bpf_jit_build_body(struct bpf_prog *fp, u32 *image, struct codegen_context *ctx,
Ravi Bangoria983bdc02021-10-12 18:00:53 +0530185 u32 *addrs, int pass);
Christophe Leroy4ea76e92021-03-22 16:37:49 +0000186void bpf_jit_build_prologue(u32 *image, struct codegen_context *ctx);
187void bpf_jit_build_epilogue(u32 *image, struct codegen_context *ctx);
Christophe Leroy40272032021-03-22 16:37:53 +0000188void bpf_jit_realloc_regs(struct codegen_context *ctx);
Christophe Leroy4ea76e92021-03-22 16:37:49 +0000189
Ravi Bangoria983bdc02021-10-12 18:00:53 +0530190int bpf_add_extable_entry(struct bpf_prog *fp, u32 *image, int pass, struct codegen_context *ctx,
191 int insn_idx, int jmp_off, int dst_reg);
192
Matt Evans0ca87f02011-07-20 15:51:00 +0000193#endif
194
195#endif