/linux-master/drivers/cxl/ |
H A D | cxlmem.h | 801 u8 pass[NVDIMM_PASSPHRASE_LEN]; member in struct:cxl_disable_pass 808 u8 pass[NVDIMM_PASSPHRASE_LEN]; member in struct:cxl_pass_erase
|
/linux-master/arch/sparc/net/ |
H A D | bpf_jit_comp_32.c | 329 u32 temp[8], *prog, *func, seen = 0, pass; local 342 /* Before first pass, make a rough estimation of addrs[] 351 for (pass = 0; pass < 10; pass++) { 352 u8 seen_or_pass0 = (pass == 0) ? (SEEN_XREG | SEEN_DATAREF | SEEN_MEM) : seen; 747 bpf_jit_dump(flen, proglen, pass + 1, image);
|
H A D | bpf_jit_comp_64.c | 1490 int pass, i; local 1522 pass = 1; 1542 for (pass = 1; pass < 40; pass++) { 1553 pr_info("Pass %d: size = %u, seen = [%c%c%c%c%c%c]\n", pass, 1600 bpf_jit_dump(prog->len, image_size, pass, ctx.image);
|
/linux-master/arch/riscv/net/ |
H A D | bpf_jit_core.c | 50 int pass = 0, prev_ninsns = 0, i; local 103 pass++; 162 pass++; 174 bpf_jit_dump(prog->len, prog_size, pass, ctx->insns); 256 * If we fail the final pass of JIT (from jit_subprogs),
|
/linux-master/arch/powerpc/net/ |
H A D | bpf_jit_comp64.c | 300 * until the last extra pass. As seen above, we use PPC_LI64() to 408 u32 *addrs, int pass, bool extra_pass) 415 /* Start of epilogue code - will only be valid 2nd pass onwards */ 986 ret = bpf_add_extable_entry(fp, image, fimage, pass, ctx, 407 bpf_jit_build_body(struct bpf_prog *fp, u32 *image, u32 *fimage, struct codegen_context *ctx, u32 *addrs, int pass, bool extra_pass) argument
|
H A D | bpf_jit_comp32.c | 283 u32 *addrs, int pass, bool extra_pass) 289 /* Start of epilogue code - will only be valid 2nd pass onwards */ 1073 ret = bpf_add_extable_entry(fp, image, fimage, pass, ctx, insn_idx, 282 bpf_jit_build_body(struct bpf_prog *fp, u32 *image, u32 *fimage, struct codegen_context *ctx, u32 *addrs, int pass, bool extra_pass) argument
|
H A D | bpf_jit_comp.c | 71 int pass; local 121 /* During extra pass, ensure index is reset before repopulating extable entries */ 138 /* Scouting faux-generate pass 0 */ 146 * If we have seen a tail call, we need a second pass. 149 * We also need a second pass if we ended up with too large 191 for (pass = 1; pass < 3; pass++) { 196 if (bpf_jit_build_body(fp, code_base, fcode_base, &cgctx, addrs, pass, 206 pr_info("Pass %d: shrink = %d, seen = 0x%x\n", pass, 257 bpf_add_extable_entry(struct bpf_prog *fp, u32 *image, u32 *fimage, int pass, struct codegen_context *ctx, int insn_idx, int jmp_off, int dst_reg) argument [all...] |
/linux-master/tools/testing/selftests/timers/ |
H A D | valid-adjtimex.c | 116 int ret, pass = 0; local 135 pass = -1; 154 pass = -1; 163 pass = -1; 178 pass = -1; 191 return pass;
|
/linux-master/tools/testing/selftests/net/forwarding/ |
H A D | sch_tbf_core.sh | 98 flower $TCFLAGS vlan_id 10 action pass 100 flower $TCFLAGS vlan_id 11 action pass
|
H A D | lib_sh_test.sh | 40 pass() function 95 local status_names=(pass fail xfail xpass skip) 150 local status_names=(pass fail xfail xpass skip) 170 exit_status_subtest $ksft_pass "pass" 175 exit_status_subtest $ksft_pass "pass pass" 176 exit_status_subtest $ksft_fail "pass fail" 177 exit_status_subtest $ksft_pass "pass xfail" 178 exit_status_subtest $ksft_skip "pass skip" 180 exit_status_subtest $ksft_fail "fail pass" [all...] |
/linux-master/tools/testing/selftests/ |
H A D | kselftest_deps.sh | 26 echo "- Prints pass/fail dependency check for each tests/sub-test." 27 echo "- Prints pass/fail targets and libraries." 68 pass=$(mktemp).out 69 trap "rm -f $pass" EXIT 70 #echo $pass 274 echo "PASS: $test dependency check passed $lib" >> $pass 303 cat $pass
|
/linux-master/tools/testing/selftests/bpf/prog_tests/ |
H A D | sockmap_listen.c | 679 unsigned int pass; local 707 err = xbpf_map_lookup_elem(verd_mapfd, &key, &pass); 710 if (pass != 1) 711 FAIL("%s: want pass count 1, have %d", log_prefix, pass); 984 unsigned int pass; local 1036 err = xbpf_map_lookup_elem(verd_map, &key, &pass); 1039 if (pass != 1) 1040 FAIL("want pass count 1, have %d", pass); 1382 unsigned int pass; local 1533 unsigned int pass; local [all...] |
H A D | sockmap_basic.c | 511 struct test_sockmap_pass_prog *pass = NULL; local 516 pass = test_sockmap_pass_prog__open_and_load(); 517 if (!ASSERT_OK_PTR(pass, "open_and_load")) 519 verdict = bpf_program__fd(pass->progs.prog_skb_verdict); 520 map = bpf_map__fd(pass->maps.sock_map_rx); 566 test_sockmap_pass_prog__destroy(pass); 609 struct test_sockmap_pass_prog *pass; local 612 pass = test_sockmap_pass_prog__open_and_load(); 613 if (!ASSERT_OK_PTR(pass, "open_and_load")) 615 verdict = bpf_program__fd(pass 630 struct test_sockmap_pass_prog *pass; local [all...] |
/linux-master/net/core/ |
H A D | filter.c | 560 * 1) First pass for calculating the new program length: 563 * 2) 2nd pass to remap in two passes: 1st pass finds new 564 * jump offsets, 2nd pass remapping: 571 int new_flen = 0, pass = 0, target, i, stack_off; local 896 pass++; 899 if (pass > 2) 1266 * pass. At this time, the user BPF is stored in fp->insns. 1275 /* 1st pass: calculate the new program length. */ 1295 /* 2nd pass [all...] |
/linux-master/include/linux/ |
H A D | filter.h | 1149 u32 pass, void *image) 1151 pr_err("flen=%u proglen=%u pass=%u image=%pK from=%s pid=%d\n", flen, 1152 proglen, pass, image, current->comm, task_pid_nr(current)); 1148 bpf_jit_dump(unsigned int flen, unsigned int proglen, u32 pass, void *image) argument
|
/linux-master/fs/gfs2/ |
H A D | incore.h | 60 struct gfs2_log_header_host *head, int pass); 63 int pass); 64 void (*lo_after_scan) (struct gfs2_jdesc *jd, int error, int pass);
|
/linux-master/drivers/scsi/ |
H A D | scsi_transport_sas.c | 283 int pass = (int)(unsigned long)data; local 285 if (pass == 0 && scsi_is_sas_port(dev)) 287 else if (pass == 1 && scsi_is_sas_phy(dev))
|
H A D | scsi_scan.c | 651 int pass, count, result, resid; local 686 /* Perform up to 3 passes. The first pass uses a conservative 691 pass = 1; 695 "scsi scan: INQUIRY pass %d length %d\n", 696 pass, try_inquiry_len)); 698 /* Each pass gets up to three chances to ignore Unit Attention */ 748 /* When the first pass succeeds we gain information about 750 if (pass == 1) { 768 /* If more data is available perform the second pass */ 771 pass [all...] |
/linux-master/drivers/net/ethernet/xircom/ |
H A D | xirc2ps_cs.c | 651 int *pass = priv_data; local 654 tmp += (*pass ? (p_dev->config_index & 0x20 ? -24 : 8) 765 int pass; local 777 * the Mako if (on the first pass) the COR bit 5 is set. 779 for (pass=0; pass < 2; pass++) 781 &pass))
|
/linux-master/arch/x86/net/ |
H A D | bpf_jit_comp32.c | 1496 * to pass arguments number one to (number) if they are of integral 1505 * Two 32bit registers are used to pass a 64bit arg. 2530 int pass; local 2555 * Before first pass, make a rough estimation of addrs[] 2565 * JITed image shrinks with every pass and the loop iterates 2567 * may converge on the last pass. In such case do one more 2568 * pass to emit the final image. 2570 for (pass = 0; pass < 20 || image; pass [all...] |
H A D | bpf_jit_comp.c | 263 * pass, only to generate the correct offset on the second pass. 2200 * If the previous pass already emits an imm8 2204 * On the other hand, if the previous pass emits an 2259 * (2) The previous pass emits an imm8 jmp, 2262 * (3) Similarly, the previous pass emits an 2282 * If the previous pass already emits an imm8 2379 /* Generally speaking, the compiler will pass the arguments 2420 /* get the count of the regs that are used to pass arguments */ 2453 * Meanwhile, the compiler will pass th 3238 int pass; local [all...] |
/linux-master/arch/s390/net/ |
H A D | bpf_jit_comp.c | 335 * Return whether this is the first pass. The first pass is special, since we 344 * Return whether this is the code generation pass. The code generation pass is 1924 /* On the first pass anything goes */ 1928 /* The codegen pass must not change anything */ 2007 int pass; member in struct:s390_jit_data 2045 int pass; local 2075 pass = jit_data->pass [all...] |
/linux-master/arch/parisc/net/ |
H A D | bpf_jit_core.c | 49 int pass = 0, prev_ninsns = 0, prologue_len, i; local 94 pass++; 145 pass++; 158 bpf_jit_dump(prog->len, prog_size, pass, ctx->insns);
|
/linux-master/arch/arm64/include/asm/ |
H A D | el2_setup.h | 237 .macro __check_override idreg, fld, width, pass, fail, tmp1, tmp2 variable 249 cbnz \tmp2, \pass 254 .macro check_override idreg, fld, pass, fail, tmp1, tmp2 variable 256 __check_override \idreg \fld 4 \pass \fail \tmp1 \tmp2 260 .macro __check_override idreg, fld, width, pass, fail, tmp, ignore 263 cbnz \tmp, \pass 267 .macro check_override idreg, fld, pass, fail, tmp, ignore 268 __check_override \idreg \fld 4 \pass \fail \tmp \ignore
|
/linux-master/arch/arc/net/ |
H A D | bpf_jit_core.c | 65 * necessary for the next extra pass to come. 89 * jit_data: A piece of memory to transfer data to the next pass. 95 * is_extra_pass: Indicates if the current pass is an extra pass. 145 const int pass = ctx->is_extra_pass ? 2 : 1; local 151 scnprintf(header, sizeof(header), "JIT:%d", pass); 155 bpf_jit_dump(ctx->prog->len, ctx->jit.len, pass, ctx->jit.buf); 182 * Only after the first iteration of normal pass (the dry-run), 191 * "*mem" should be freed when there is no "extra pass" to come, 388 * an extra pass [all...] |