/* * Seccomp BPF helper functions * * Copyright (c) 2012 The Chromium OS Authors * Author: Will Drewry * * The code may be used by anyone for any purpose, * and can serve as a starting point for developing * applications using prctl(PR_ATTACH_SECCOMP_FILTER). */ #include #include #include #include "bpf-helper.h" int bpf_resolve_jumps(struct bpf_labels *labels, struct sock_filter *filter, size_t count) { size_t i; if (count < 1 || count > BPF_MAXINSNS) return -1; /* * Walk it once, backwards, to build the label table and do fixups. * Since backward jumps are disallowed by BPF, this is easy. */ for (i = 0; i < count; ++i) { size_t offset = count - i - 1; struct sock_filter *instr = &filter[offset]; if (instr->code != (BPF_JMP+BPF_JA)) continue; switch ((instr->jt<<8)|instr->jf) { case (JUMP_JT<<8)|JUMP_JF: if (labels->labels[instr->k].location == 0xffffffff) { fprintf(stderr, "Unresolved label: '%s'\n", labels->labels[instr->k].label); return 1; } instr->k = labels->labels[instr->k].location - (offset + 1); instr->jt = 0; instr->jf = 0; continue; case (LABEL_JT<<8)|LABEL_JF: if (labels->labels[instr->k].location != 0xffffffff) { fprintf(stderr, "Duplicate label use: '%s'\n", labels->labels[instr->k].label); return 1; } labels->labels[instr->k].location = offset; instr->k = 0; /* fall through */ instr->jt = 0; instr->jf = 0; continue; } } return 0; } /* Simple lookup table for labels. */ __u32 seccomp_bpf_label(struct bpf_labels *labels, const char *label) { struct __bpf_label *begin = labels->labels, *end; int id; if (labels->count == BPF_LABELS_MAX) { fprintf(stderr, "Too many labels\n"); exit(1); } if (labels->count == 0) { begin->label = label; begin->location = 0xffffffff; labels->count++; return 0; } end = begin + labels->count; for (id = 0; begin < end; ++begin, ++id) { if (!strcmp(label, begin->label)) return id; } begin->label = label; begin->location = 0xffffffff; labels->count++; return id; } void seccomp_bpf_print(struct sock_filter *filter, size_t count) { struct sock_filter *end = filter + count; for ( ; filter < end; ++filter) printf("{ code=%u,jt=%u,jf=%u,k=%u },\n", filter->code, filter->jt, filter->jf, filter->k); }

path: root/net/ipv4/syncookies.c

ion value='3' selected='selected'>3

Age	Commit message (Expand)	Author	Files	Lines
space:
mode:

author	Johan Hovold <johan@kernel.org>	2017-01-30 11:26:38 +0100
committer	Jiri Kosina <jkosina@suse.cz>	2017-01-31 12:59:32 +0100
commit	7a7b5df84b6b4e5d599c7289526eed96541a0654 (patch)
tree	cf7514c7ddf4410fe37ca9099a2785e1cf08fa7d /net/core/dst.c
parent	877a021e08ccb6434718c0cc781fdf943c884cc0 (diff)

HID: cp2112: fix sleep-while-atomic

A recent commit fixing DMA-buffers on stack added a shared transfer buffer protected by a spinlock. This is broken as the USB HID request callbacks can sleep. Fix this up by replacing the spinlock with a mutex. Fixes: 1ffb3c40ffb5 ("HID: cp2112: make transfer buffers DMA capable") Cc: stable <stable@vger.kernel.org> # 4.9 Signed-off-by: Johan Hovold <johan@kernel.org> Reviewed-by: Benjamin Tissoires <benjamin.tissoires@redhat.com> Signed-off-by: Jiri Kosina <jkosina@suse.cz>

Diffstat (limited to 'net/core/dst.c')