/linux/drivers/scsi/ |
H A D | 53c700.scr | 142 JUMP Finish, WHEN STATUS 143 JUMP SendIdentifyMsg, IF MSG_OUT 182 JUMP ResumeSendMessage 193 JUMP ReceiveExtendedMessage, IF EXTENDED_MSG 201 JUMP Receive1Byte, IF 0x01 202 JUMP Receive2Byte, IF 0x02 203 JUMP Receive3Byte, IF 0x03 204 JUMP Receive4Byte, IF 0x04 205 JUMP Receive5Byte, IF 0x05 241 JUMP SendMessage [all …]
|
H A D | 53c700_d.h_shipped | 148 JUMP Finish, WHEN STATUS 152 JUMP SendIdentifyMsg, IF MSG_OUT 242 JUMP ResumeSendMessage 259 JUMP ReceiveExtendedMessage, IF EXTENDED_MSG 288 JUMP Receive1Byte, IF 0x01 292 JUMP Receive2Byte, IF 0x02 296 JUMP Receive3Byte, IF 0x03 300 JUMP Receive4Byte, IF 0x04 304 JUMP Receive5Byte, IF 0x05 403 JUMP SendMessage [all …]
|
/linux/arch/hexagon/kernel/ |
H A D | vm_vectors.S | 3 * Event jump tables 15 jump 1f; 16 jump 1f; 17 jump 1f; 18 jump 1f; 19 jump 1f; 21 jump 1f; 22 jump 1f; 28 jump 1b; /* Reset */ 29 jump _K_enter_machcheck; [all …]
|
/linux/arch/hexagon/lib/ |
H A D | memset.S | 42 if p1 jump 2f /* skip byte loop */ 60 if !p0 jump 3f /* skip initial byte store */ 73 if !p0 jump 4f /* skip initial half store */ 86 if !p0 jump 5f /* skip initial word store */ 99 if !p0 jump 7f /* skip double loop */ 126 if !p0 jump 8f /* skip final word store */ 137 if !p0 jump 9f /* skip final half store */ 159 if (r2==#0) jump:nt .L1 164 if (p0.new) jump:nt .L3 179 if (!p0.new) jump:nt .L8 [all …]
|
/linux/arch/hexagon/mm/ |
H A D | copy_user_template.S | 20 if (!p0.new) jump:nt .Ldone 27 if (!p0.new) jump:nt .Loop_not_aligned_8 33 if (!p1) jump .Lsmall 47 jump .Lsmall 53 if (p0.new) jump:nt .Lalign 57 if (!p0.new) jump:nt .Loop_not_aligned_4 62 if (!p1) jump .Lsmall 77 jump .Lsmall 83 if (!p0.new) jump:nt .Loop_not_aligned 88 if (!p1) jump .Lsmall [all …]
|
/linux/tools/objtool/arch/x86/ |
H A D | special.c | 72 * There are 3 basic jump table patterns: 77 * jump table which is stored in .rodata. 84 * As part of an optimization, GCC makes a copy of an existing switch jump 85 * table, modifies it, and then hard-codes the jump (albeit with an indirect 86 * jump) to use a single entry in the table. The rest of the jump table and 87 * some of its jump targets remain as dead code. 107 * ensure the same register is used in the mov and jump instructions. 134 * symbol. GCC jump tables are anonymous data. in arch_find_switch_table() 136 * Also support C jump table in arch_find_switch_table() [all...] |
/linux/drivers/net/ethernet/chelsio/cxgb4/ |
H A D | cxgb4_tc_u32_parse.h | 242 * field's value to jump to next header such as IHL field 247 /* location of jump to make */ 248 const struct cxgb4_match_field *jump; member 251 /* Accept a rule with a jump to transport layer header based on IHL field in 256 /* TCP Jump */ 268 .jump = cxgb4_tcp_fields, 271 /* UDP Jump */ 283 .jump = cxgb4_udp_fields, 285 { .jump = NULL }, 288 /* Accept a rule with a jump directly past the 40 Bytes of IPv6 fixed header [all …]
|
/linux/arch/hexagon/include/asm/ |
H A D | spinlock.h | 33 " { if (!P3) jump 1b; }\n" in arch_read_lock() 35 " { if (!P3) jump 1b; }\n" in arch_read_lock() 49 " if (!P3) jump 1b;\n" in arch_read_unlock() 64 " { if (!P3) jump 1f; }\n" in arch_read_trylock() 81 " { if (!P3) jump 1b; }\n" in arch_write_lock() 83 " { if (!P3) jump 1b; }\n" in arch_write_lock() 97 " { if (!P3) jump 1f; }\n" in arch_write_trylock() 120 " { if (!P3) jump 1b; R6 = #1; }\n" in arch_spin_lock() 122 " { if (!P3) jump 1b; }\n" in arch_spin_lock() 142 " { if (!P3) jump 1f; R6 = #1; %0 = #0; }\n" in arch_spin_trylock()
|
H A D | atomic.h | 22 " if (!P0) jump 1b;\n" in arch_atomic_set() 42 " if (!P3) jump 1b;\n" \ 58 " if (!P3) jump 1b;\n" \ 75 " if (!P3) jump 1b;\n" \ 118 " if (p3.new) jump:nt 2f;" in ATOMIC_OPS() 123 " if (!p3) jump 1b;" in ATOMIC_OPS()
|
H A D | futex.h | 19 " if (!p2) jump 1b;\n" \ 24 " jump ##3b\n" \ 86 " if (!p2.new) jump:NT 3f\n" in futex_atomic_cmpxchg_inatomic() 89 " if (!p2) jump 1b\n" in futex_atomic_cmpxchg_inatomic() 93 " jump ##3b\n" in futex_atomic_cmpxchg_inatomic()
|
/linux/Documentation/staging/ |
H A D | static-keys.rst | 88 'no-op' in the straight-line codepath with a 'jump' instruction to the 93 This lowlevel patching mechanism is called 'jump label patching', and it gives 180 4) Architecture level code patching interface, 'jump labels' 185 simply fall back to a traditional, load, test, and jump sequence. Also, the 208 5) Static keys / jump label analysis, results (x86_64): 228 The resulting instructions with jump labels generated by GCC is:: 248 Without the jump label optimization it looks like:: 272 Thus, the disable jump label case adds a 'mov', 'test' and 'jne' instruction 273 vs. the jump label case just has a 'no-op' or 'jmp 0'. (The jmp 0, is patched 274 to a 5 byte atomic no-op instruction at boot-time.) Thus, the disabled jump [all …]
|
/linux/samples/seccomp/ |
H A D | bpf-fancy.c | 40 SYSCALL(__NR_write, JUMP(&l, write_fd)), in main() 41 SYSCALL(__NR_read, JUMP(&l, read)), in main() 55 JEQ(STDOUT_FILENO, JUMP(&l, write_buf)), in main() 56 JEQ(STDERR_FILENO, JUMP(&l, write_buf)), in main() 61 JEQ((unsigned long)msg1, JUMP(&l, msg1_len)), in main() 62 JEQ((unsigned long)msg2, JUMP(&l, msg2_len)), in main() 63 JEQ((unsigned long)buf, JUMP(&l, buf_len)), in main()
|
/linux/arch/riscv/kernel/ |
H A D | kexec_relocate.S | 17 * s1: (const) Phys address to jump to after relocation 39 * we try to jump somewhere, the offset on the jump 42 * the start of the loop below so that we jump there in 77 /* IND_DONE entry ? -> jump to done label */ 139 * and jump to the new kernel 153 * s0: (const) Phys address to jump to 203 * This will also trigger a jump to CSR_STVEC
|
/linux/arch/x86/kernel/kprobes/ |
H A D | opt.c | 3 * Kernel Probes Jump Optimization (Optprobes) 46 /* This function only handles jump-optimized kprobe */ in __recover_optprobed_insn() 59 * overwritten by jump destination address. In this case, original in __recover_optprobed_insn() 228 /* Check whether insn is indirect jump */ 232 (X86_MODRM_REG(insn->modrm.value) & 6) == 4) || /* Jump */ in insn_is_indirect_jump() 233 insn->opcode.bytes[0] == 0xea); /* Segment based jump */ in insn_is_indirect_jump() 246 case 0xe9: /* near relative jump */ in insn_jump_into_range() 247 case 0xeb: /* short relative jump */ in insn_jump_into_range() 263 /* Decode whole function to ensure any instructions don't jump into target */ 282 /* Check there is enough space for a relative jump. */ in can_optimize() [all …]
|
/linux/drivers/net/ethernet/intel/ixgbe/ |
H A D | ixgbe_model.h | 83 /* match criteria to make this jump*/ 87 /* location of jump to make */ 88 struct ixgbe_mat_field *jump; member 93 .off = 8, .val = 0x600, .mask = 0xff00, .jump = ixgbe_tcp_fields}, 95 .off = 8, .val = 0x1100, .mask = 0xff00, .jump = ixgbe_udp_fields}, 96 { .jump = NULL } /* terminal node */
|
/linux/arch/xtensa/kernel/ |
H A D | align.S | 174 _beqi a0, OP0_L32I_N, 1f # L32I.N, jump 177 /* 'store indicator bit' set, jump */ 197 _beqi a0, OP0_L32I_N, .Lload_w# l32i.n: jump 236 _beqi a5, OP0_L32I_N, .Lload # L32I.N, jump 240 /* 'store indicator bit' not set, jump */ 245 /* Store: Jump to table entry to get the value in the source register.*/ 250 jx a5 # jump into table 274 _beqi a5, OP0_L32I_N, .Lload_w# l32i.n: jump 282 _beqi a5, OP1_L32I, .Lload_w # l32i: jump 305 jx a4 # jump to entry for target register [all …]
|
/linux/arch/mips/kernel/ |
H A D | jump_label.c | 20 * Define parameters for the standard MIPS and the microMIPS jump 25 * - the amount the jump target address is shifted right to fit in the 28 * - the mask determining the size of the jump region relative to the 31 * - the jump target alignment, either 4 or 2 bytes. 66 * Jump only works within an aligned region its delay in arch_jump_label_transform() 99 /* if the module doesn't have jump label entries, just return */ in jump_label_apply_nops()
|
/linux/Documentation/networking/ |
H A D | filter.rst | 78 __u8 jt; /* Jump true */ 79 __u8 jf; /* Jump false */ 84 a code, jt, jf and k value. jt and jf are jump offsets and k a generic 210 encoded. jt and jf are two 8 bit wide jump targets, one for condition 211 "jump if true", the other one "jump if false". Eventually, element k 234 jmp 6 Jump to label 235 ja 6 Jump to label 236 jeq 7, 8, 9, 10 Jump on A == <x> 237 jneq 9, 10 Jump on A != <x> 238 jne 9, 10 Jump on A != <x> [all …]
|
/linux/Documentation/trace/ |
H A D | kprobes.rst | 54 probes work and how jump optimization works. They explain certain 169 How Does Jump Optimization Work? 175 sysctl(8)), Kprobes tries to reduce probe-hit overhead by using a jump 191 - Kprobes verifies that the region that will be replaced by the jump 193 (A jump instruction is multiple bytes, and so may overlay multiple 197 jump into the optimized region. Specifically: 199 - the function contains no indirect jump; 201 the fixup code triggered by the exception could jump back into the 203 - there is no near jump to the optimized region (other than to the first 219 - a jump back to the original execution path. [all …]
|
/linux/tools/testing/selftests/bpf/verifier/ |
H A D | jump.c | 2 "jump test 1", 26 "jump test 2", 54 "jump test 3", 91 "jump test 4", 141 "jump test 5", 182 "jump test 6", 212 "jump test 7", 241 "jump test 8", 271 "jump/call test 9", 299 .errstr = "jump out of range from insn 1 to 4", [all …]
|
/linux/arch/mips/net/ |
H A D | bpf_jit_comp.h | 56 * Jump address mask for immediate jumps. The four most significant bits 65 * Jump pseudo-instructions used internally 116 /* Workaround for Loongson-2F jump errata */ 153 /* Compute the 28-bit jump target address from a BPF program location */ 189 /* Prepare a PC-relative jump operation with immediate conditional */ 193 /* Prepare a PC-relative jump operation with register conditional */ 197 /* Finish a PC-relative jump operation */ 206 /* Jump always */ 209 /* Jump to epilogue */
|
H A D | bpf_jit_comp.c | 66 * translating the jump offset. This table is computed by dry-running the 69 * branch instruction. In such cases, the long jump is converted into the 74 * j <offset> Unconditional absolute long jump 81 * fall back to converting every remaining jump operation. The branch 87 * Convert jump conditional and offset into a form that can be JITed. 89 * jump if branch conversion is necessary. 100 * Emit any instructions needed to finish the jump. This includes a nop 101 * for the delay slot if a branch was emitted, and a long absolute jump 168 /* Compute the 28-bit jump target address from a BPF program location */ 501 /* Validate jump immediate range */ [all …]
|
/linux/Documentation/ABI/testing/ |
H A D | sysfs-class-chromeos | 22 - "ro": Jump to RO without rebooting. 23 - "rw": Jump to RW without rebooting. 25 - "disable-jump": Disable jump until next reboot.
|
/linux/tools/testing/selftests/bpf/progs/ |
H A D | verifier_cfg.c | 34 __description("out of range jump") 35 __failure __msg("jump out of range") 48 __failure __msg("jump out of range") 123 __description("unconditional loop after conditional jump") 148 __description("unconditional loop after conditional jump")
|
/linux/arch/microblaze/kernel/ |
H A D | mcount.S | 109 /* MS: jump over graph function - replaced from C code */ 116 /* MS: graph was taken that's why - can jump over function trace */ 126 beqid r5, end; /* MS: not taken -> jump over */ 138 brald r15, r20; /* MS: jump to ftrace handler */ 144 rtsd r15, 8; /* MS: jump back */ 163 rtsd r15, 8; /* MS: jump back */
|