/* Copyright (c) 2016 Facebook * * This program is free software; you can redistribute it and/or * modify it under the terms of version 2 of the GNU General Public * License as published by the Free Software Foundation. */ #include #include #include #include #include #include "bpf_helpers.h" struct key_t { char comm[TASK_COMM_LEN]; u32 kernstack; u32 userstack; }; struct bpf_map_def SEC("maps") counts = { .type = BPF_MAP_TYPE_HASH, .key_size = sizeof(struct key_t), .value_size = sizeof(u64), .max_entries = 10000, }; struct bpf_map_def SEC("maps") stackmap = { .type = BPF_MAP_TYPE_STACK_TRACE, .key_size = sizeof(u32), .value_size = PERF_MAX_STACK_DEPTH * sizeof(u64), .max_entries = 10000, }; #define KERN_STACKID_FLAGS (0 | BPF_F_FAST_STACK_CMP) #define USER_STACKID_FLAGS (0 | BPF_F_FAST_STACK_CMP | BPF_F_USER_STACK) SEC("perf_event") int bpf_prog1(struct bpf_perf_event_data *ctx) { char fmt[] = "CPU-%d period %lld ip %llx"; u32 cpu = bpf_get_smp_processor_id(); struct key_t key; u64 *val, one = 1; if (ctx->sample_period < 10000) /* ignore warmup */ return 0; bpf_get_current_comm(&key.comm, sizeof(key.comm)); key.kernstack = bpf_get_stackid(ctx, &stackmap, KERN_STACKID_FLAGS); key.userstack = bpf_get_stackid(ctx, &stackmap, USER_STACKID_FLAGS); if ((int)key.kernstack < 0 && (int)key.userstack < 0) { bpf_trace_printk(fmt, sizeof(fmt), cpu, ctx->sample_period, PT_REGS_IP(&ctx->regs)); return 0; } val = bpf_map_lookup_elem(&counts, &key); if (val) (*val)++; else bpf_map_update_elem(&counts, &key, &one, BPF_NOEXIST); return 0; } char _license[] SEC("license") = "GPL"; git.cgi/linux/net-next.git/tree/include/net/dst_cache.h?id=72d19459d7919f966594576bb042d15a451f27ea'>treecommitdiff
diff options
context:
space:
mode:
authorBenjamin Tissoires <benjamin.tissoires@redhat.com>2016-11-25 14:27:21 +0100
committerJiri Kosina <jkosina@suse.cz>2016-11-28 14:39:47 +0100
commit72d19459d7919f966594576bb042d15a451f27ea (patch)
tree57f4aacfa8709eb1f37dff82d51f49d82aae3363 /include/net/dst_cache.h
parent5cc5084dd9afa2f9bf953b0217bdb1b7c2158be1 (diff)
HID: input: rework HID_QUIRK_MULTI_INPUT
The purpose of HID_QUIRK_MULTI_INPUT is to have an input device per report id. This is useful when the HID device presents several HID collections of different device types. The current implementation of hid-input creates one input node per id per type (input or output). This is problematic for the LEDs of a keyboard as they are often set through an output report. The current code creates one input node with all the keyboard keys, and one other with only the LEDs. To solve this, we use a two-passes way: - first, we initialize all input nodes and associate one per report id - then, we register all the input nodes Signed-off-by: Benjamin Tissoires <benjamin.tissoires@redhat.com> Signed-off-by: Jiri Kosina <jkosina@suse.cz>
Diffstat (limited to 'include/net/dst_cache.h')