Home
last modified time | relevance | path

Searched refs:nb_ins (Results 1 – 9 of 9) sorted by relevance

/dpdk/app/test/
H A Dtest_bpf.c2925 .nb_ins = RTE_DIM(test_load1_prog),
2953 .nb_ins = RTE_DIM(test_mul1_prog),
2981 .nb_ins = RTE_DIM(test_jump1_prog),
2995 .nb_ins = RTE_DIM(test_jump2_prog),
3009 .nb_ins = RTE_DIM(test_alu1_prog),
3023 .nb_ins = RTE_DIM(test_bele1_prog),
3037 .nb_ins = RTE_DIM(test_xadd1_prog),
3051 .nb_ins = RTE_DIM(test_div1_prog),
3065 .nb_ins = RTE_DIM(test_call1_prog),
3083 .nb_ins = RTE_DIM(test_call2_prog),
[all …]
/dpdk/lib/bpf/
H A Drte_bpf.h92 uint32_t nb_ins; /**< number of instructions in ins */ member
H A Dbpf_load.c23 insz = prm->nb_ins * sizeof(prm->ins[0]); in bpf_load()
H A Dbpf_jit_arm64.c113 ctx->map = malloc(bpf->prm.nb_ins * sizeof(ctx->map[0])); in jump_offset_init()
118 for (i = 0; i != bpf->prm.nb_ins; i++) { in jump_offset_init()
1099 for (i = 0; i != bpf->prm.nb_ins; i++) { in check_program_has_call()
1137 for (i = 0; i != bpf->prm.nb_ins; i++) { in emit()
H A Dbpf_load_elf.c286 np.nb_ins = sd->d_size / sizeof(struct ebpf_insn); in bpf_load_elf()
H A Dbpf_jit_x86.c1294 for (i = 0; i != bpf->prm.nb_ins; i++) { in emit()
1502 st.off = malloc(bpf->prm.nb_ins * sizeof(st.off[0])); in bpf_jit_x86()
1508 for (i = 0; i != bpf->prm.nb_ins; i++) in bpf_jit_x86()
H A Dbpf_validate.c1813 if (nidx > bvf->prm->nb_ins) { in add_edge()
1922 for (i = 0; i != bvf->prm->nb_ins; i++) { in log_unreachable()
1942 for (i = 0; i != bvf->prm->nb_ins; i++) { in log_loop()
1974 for (i = 0; i < bvf->prm->nb_ins; i++) { in validate()
2320 bvf.in = calloc(bpf->prm.nb_ins, sizeof(bvf.in[0])); in bpf_validate()
H A Dbpf_convert.c568 prm->nb_ins = ebpf_len; in rte_bpf_convert()
/dpdk/app/dumpcap/
H A Dmain.c294 printf("\neBPF program (%u insns)\n", bpf_prm->nb_ins); in compile_filter()
295 rte_bpf_dump(stdout, bpf_prm->ins, bpf_prm->nb_ins); in compile_filter()