1 // SPDX-License-Identifier: (GPL-2.0-only OR BSD-2-Clause)
2 // Copyright (c) 2022 Google
4 #include <bpf/bpf_helpers.h>
5 #include <bpf/bpf_tracing.h>
6 #include <bpf/bpf_core_read.h>
10 /* default buffer size */
11 #define MAX_ENTRIES 10240
13 /* lock contention flags from include/trace/events/lock.h */
14 #define LCB_F_SPIN (1U << 0)
15 #define LCB_F_READ (1U << 1)
16 #define LCB_F_WRITE (1U << 2)
17 #define LCB_F_RT (1U << 3)
18 #define LCB_F_PERCPU (1U << 4)
19 #define LCB_F_MUTEX (1U << 5)
28 /* callstack storage */
30 __uint(type, BPF_MAP_TYPE_STACK_TRACE);
31 __uint(key_size, sizeof(__u32));
32 __uint(value_size, sizeof(__u64));
33 __uint(max_entries, MAX_ENTRIES);
34 } stacks SEC(".maps");
36 /* maintain timestamp at the beginning of contention */
38 __uint(type, BPF_MAP_TYPE_HASH);
40 __type(value, struct tstamp_data);
41 __uint(max_entries, MAX_ENTRIES);
42 } tstamp SEC(".maps");
44 /* actual lock contention statistics */
46 __uint(type, BPF_MAP_TYPE_HASH);
47 __uint(key_size, sizeof(struct contention_key));
48 __uint(value_size, sizeof(struct contention_data));
49 __uint(max_entries, MAX_ENTRIES);
50 } lock_stat SEC(".maps");
53 __uint(type, BPF_MAP_TYPE_HASH);
54 __uint(key_size, sizeof(__u32));
55 __uint(value_size, sizeof(struct contention_task_data));
56 __uint(max_entries, MAX_ENTRIES);
57 } task_data SEC(".maps");
60 __uint(type, BPF_MAP_TYPE_HASH);
61 __uint(key_size, sizeof(__u32));
62 __uint(value_size, sizeof(__u8));
63 __uint(max_entries, 1);
64 } cpu_filter SEC(".maps");
67 __uint(type, BPF_MAP_TYPE_HASH);
68 __uint(key_size, sizeof(__u32));
69 __uint(value_size, sizeof(__u8));
70 __uint(max_entries, 1);
71 } task_filter SEC(".maps");
74 __uint(type, BPF_MAP_TYPE_HASH);
75 __uint(key_size, sizeof(__u32));
76 __uint(value_size, sizeof(__u8));
77 __uint(max_entries, 1);
78 } type_filter SEC(".maps");
81 __uint(type, BPF_MAP_TYPE_HASH);
82 __uint(key_size, sizeof(__u64));
83 __uint(value_size, sizeof(__u8));
84 __uint(max_entries, 1);
85 } addr_filter SEC(".maps");
87 struct rw_semaphore___old {
88 struct task_struct *owner;
89 } __attribute__((preserve_access_index));
91 struct rw_semaphore___new {
93 } __attribute__((preserve_access_index));
95 struct mm_struct___old {
96 struct rw_semaphore mmap_sem;
97 } __attribute__((preserve_access_index));
99 struct mm_struct___new {
100 struct rw_semaphore mmap_lock;
101 } __attribute__((preserve_access_index));
113 /* determine the key of lock stat */
119 static inline int can_record(u64 *ctx)
122 __u32 cpu = bpf_get_smp_processor_id();
125 ok = bpf_map_lookup_elem(&cpu_filter, &cpu);
132 __u32 pid = bpf_get_current_pid_tgid();
134 ok = bpf_map_lookup_elem(&task_filter, &pid);
141 __u32 flags = (__u32)ctx[1];
143 ok = bpf_map_lookup_elem(&type_filter, &flags);
152 ok = bpf_map_lookup_elem(&addr_filter, &addr);
160 static inline int update_task_data(struct task_struct *task)
162 struct contention_task_data *p;
165 err = bpf_core_read(&pid, sizeof(pid), &task->pid);
169 p = bpf_map_lookup_elem(&task_data, &pid);
171 struct contention_task_data data = {};
173 BPF_CORE_READ_STR_INTO(&data.comm, task, comm);
174 bpf_map_update_elem(&task_data, &pid, &data, BPF_NOEXIST);
180 #ifndef __has_builtin
181 # define __has_builtin(x) 0
184 static inline struct task_struct *get_lock_owner(__u64 lock, __u32 flags)
186 struct task_struct *task;
189 if (flags & LCB_F_MUTEX) {
190 struct mutex *mutex = (void *)lock;
191 owner = BPF_CORE_READ(mutex, owner.counter);
192 } else if (flags == LCB_F_READ || flags == LCB_F_WRITE) {
194 * Support for the BPF_TYPE_MATCHES argument to the
195 * __builtin_preserve_type_info builtin was added at some point during
196 * development of clang 15 and it's what is needed for
197 * bpf_core_type_matches.
199 #if __has_builtin(__builtin_preserve_type_info) && __clang_major__ >= 15
200 if (bpf_core_type_matches(struct rw_semaphore___old)) {
201 struct rw_semaphore___old *rwsem = (void *)lock;
202 owner = (unsigned long)BPF_CORE_READ(rwsem, owner);
203 } else if (bpf_core_type_matches(struct rw_semaphore___new)) {
204 struct rw_semaphore___new *rwsem = (void *)lock;
205 owner = BPF_CORE_READ(rwsem, owner.counter);
208 /* assume new struct */
209 struct rw_semaphore *rwsem = (void *)lock;
210 owner = BPF_CORE_READ(rwsem, owner.counter);
217 task = (void *)(owner & ~7UL);
221 static inline __u32 check_lock_type(__u64 lock, __u32 flags)
223 struct task_struct *curr;
224 struct mm_struct___old *mm_old;
225 struct mm_struct___new *mm_new;
228 case LCB_F_READ: /* rwsem */
230 curr = bpf_get_current_task_btf();
231 if (curr->mm == NULL)
233 mm_new = (void *)curr->mm;
234 if (bpf_core_field_exists(mm_new->mmap_lock)) {
235 if (&mm_new->mmap_lock == (void *)lock)
236 return LCD_F_MMAP_LOCK;
239 mm_old = (void *)curr->mm;
240 if (bpf_core_field_exists(mm_old->mmap_sem)) {
241 if (&mm_old->mmap_sem == (void *)lock)
242 return LCD_F_MMAP_LOCK;
245 case LCB_F_SPIN: /* spinlock */
246 curr = bpf_get_current_task_btf();
247 if (&curr->sighand->siglock == (void *)lock)
248 return LCD_F_SIGHAND_LOCK;
256 SEC("tp_btf/contention_begin")
257 int contention_begin(u64 *ctx)
260 struct tstamp_data *pelem;
262 if (!enabled || !can_record(ctx))
265 pid = bpf_get_current_pid_tgid();
266 pelem = bpf_map_lookup_elem(&tstamp, &pid);
267 if (pelem && pelem->lock)
271 struct tstamp_data zero = {};
273 bpf_map_update_elem(&tstamp, &pid, &zero, BPF_ANY);
274 pelem = bpf_map_lookup_elem(&tstamp, &pid);
281 pelem->timestamp = bpf_ktime_get_ns();
282 pelem->lock = (__u64)ctx[0];
283 pelem->flags = (__u32)ctx[1];
285 if (needs_callstack) {
286 pelem->stack_id = bpf_get_stackid(ctx, &stacks,
287 BPF_F_FAST_STACK_CMP | stack_skip);
288 if (pelem->stack_id < 0)
290 } else if (aggr_mode == LOCK_AGGR_TASK) {
291 struct task_struct *task;
294 task = get_lock_owner(pelem->lock, pelem->flags);
296 /* The flags is not used anymore. Pass the owner pid. */
298 pelem->flags = BPF_CORE_READ(task, pid);
303 task = bpf_get_current_task_btf();
307 if (update_task_data(task) < 0 && lock_owner)
315 SEC("tp_btf/contention_end")
316 int contention_end(u64 *ctx)
319 struct tstamp_data *pelem;
320 struct contention_key key = {};
321 struct contention_data *data;
327 pid = bpf_get_current_pid_tgid();
328 pelem = bpf_map_lookup_elem(&tstamp, &pid);
329 if (!pelem || pelem->lock != ctx[0])
332 duration = bpf_ktime_get_ns() - pelem->timestamp;
335 case LOCK_AGGR_CALLER:
336 key.stack_id = pelem->stack_id;
340 key.pid = pelem->flags;
344 key.stack_id = pelem->stack_id;
347 key.lock_addr = pelem->lock;
349 key.stack_id = pelem->stack_id;
352 /* should not happen */
356 data = bpf_map_lookup_elem(&lock_stat, &key);
358 struct contention_data first = {
359 .total_time = duration,
360 .max_time = duration,
361 .min_time = duration,
363 .flags = pelem->flags,
366 if (aggr_mode == LOCK_AGGR_ADDR)
367 first.flags |= check_lock_type(pelem->lock, pelem->flags);
369 bpf_map_update_elem(&lock_stat, &key, &first, BPF_NOEXIST);
370 bpf_map_delete_elem(&tstamp, &pid);
374 __sync_fetch_and_add(&data->total_time, duration);
375 __sync_fetch_and_add(&data->count, 1);
377 /* FIXME: need atomic operations */
378 if (data->max_time < duration)
379 data->max_time = duration;
380 if (data->min_time > duration)
381 data->min_time = duration;
383 bpf_map_delete_elem(&tstamp, &pid);
387 char LICENSE[] SEC("license") = "Dual BSD/GPL";