|
|
@@ -1987,7 +1987,7 @@ int tp_sched_wakeup(void *ctx)
|
|
|
return 0;
|
|
|
|
|
|
bpf_printk("\n");
|
|
|
- bpf_printk("[sched_wakeup] [Start] waker=%u wakee=%u", waker_tid, wakee_tid);
|
|
|
+// bpf_printk("[sched_wakeup] [Start] waker=%u wakee=%u", waker_tid, wakee_tid);
|
|
|
|
|
|
struct thread_ctx_t *wakee_ctx = bpf_map_lookup_elem(&thread_ctx, &wakee_tid);
|
|
|
struct thread_ctx_t *waker_ctx = bpf_map_lookup_elem(&thread_ctx, &waker_tid);
|
|
|
@@ -1995,8 +1995,8 @@ int tp_sched_wakeup(void *ctx)
|
|
|
// 🧠 新增逻辑:如果双方都存在且都为主线程,则跳过 update
|
|
|
if (wakee_ctx && waker_ctx &&
|
|
|
wakee_ctx->is_main_thread == 1 && waker_ctx->is_main_thread == 1) {
|
|
|
- bpf_printk(" [sched_wakeup] [skip update] both main threads (waker=%u wakee=%u)",
|
|
|
- waker_tid, wakee_tid);
|
|
|
+// bpf_printk(" [sched_wakeup] [skip update] both main threads (waker=%u wakee=%u)",
|
|
|
+// waker_tid, wakee_tid);
|
|
|
return 0;
|
|
|
}
|
|
|
|
|
|
@@ -2033,12 +2033,12 @@ int tp_sched_wakeup(void *ctx)
|
|
|
else if (waker_ctx && waker_ctx->is_main_thread == 1)
|
|
|
trace_id = waker_ctx->token;
|
|
|
|
|
|
- if (!wakee_ctx)
|
|
|
- bpf_printk(" [sched_wakeup] [not find prev_ctx] wakee_tid(%u)", wakee_tid);
|
|
|
- if (!waker_ctx)
|
|
|
- bpf_printk(" [sched_wakeup] [waker_ctx] [not find prev_ctx] tid:%u", waker_tid);
|
|
|
-
|
|
|
- bpf_printk("[sched_wakeup] [End] new edge: waker=%u -> wakee=%u trace_id=%llu",
|
|
|
- waker_tid, wakee_tid, trace_id);
|
|
|
+// if (!wakee_ctx)
|
|
|
+// bpf_printk(" [sched_wakeup] [not find prev_ctx] wakee_tid(%u)", wakee_tid);
|
|
|
+// if (!waker_ctx)
|
|
|
+// bpf_printk(" [sched_wakeup] [waker_ctx] [not find prev_ctx] tid:%u", waker_tid);
|
|
|
+//
|
|
|
+// bpf_printk("[sched_wakeup] [End] new edge: waker=%u -> wakee=%u trace_id=%llu",
|
|
|
+// waker_tid, wakee_tid, trace_id);
|
|
|
return 0;
|
|
|
}
|