Lines Matching full:labels
31 int bpf_resolve_jumps(struct bpf_labels *labels, struct sock_filter *filter, in bpf_resolve_jumps() argument
36 if (labels->count > BPF_LABELS_MAX) { in bpf_resolve_jumps()
49 if (instr->k >= labels->count) { in bpf_resolve_jumps()
55 if (labels->labels[instr->k].location == 0xffffffff) { in bpf_resolve_jumps()
57 labels->labels[instr->k].label); in bpf_resolve_jumps()
60 instr->k = labels->labels[instr->k].location - (offset + 1); in bpf_resolve_jumps()
65 if (labels->labels[instr->k].location != 0xffffffff) { in bpf_resolve_jumps()
67 labels->labels[instr->k].label); in bpf_resolve_jumps()
70 labels->labels[instr->k].location = offset; in bpf_resolve_jumps()
80 /* Simple lookup table for labels. */
81 __u32 seccomp_bpf_label(struct bpf_labels *labels, const char *label) { in seccomp_bpf_label() argument
82 struct __bpf_label *begin = labels->labels; in seccomp_bpf_label()
83 struct __bpf_label *end = begin + labels->count; in seccomp_bpf_label()
85 if (labels->count > BPF_LABELS_MAX) { in seccomp_bpf_label()
86 return labels->count; in seccomp_bpf_label()
93 if (labels->count == BPF_LABELS_MAX) { in seccomp_bpf_label()
94 fprintf(stderr, "Too many labels\n"); in seccomp_bpf_label()
95 return labels->count++; in seccomp_bpf_label()
99 return labels->count++; in seccomp_bpf_label()