Home
last modified time | relevance | path

Searched refs:w (Results 1 – 10 of 10) sorted by relevance

/kernel/locking/
Drtmutex.h16 #define debug_rt_mutex_init_waiter(w) do { } while (0) argument
17 #define debug_rt_mutex_free_waiter(w) do { } while (0) argument
24 #define debug_rt_mutex_print_deadlock(w) do { } while (0) argument
25 #define debug_rt_mutex_reset_waiter(w) do { } while (0) argument
27 static inline void rt_mutex_print_deadlock(struct rt_mutex_waiter *w) in rt_mutex_print_deadlock() argument
32 static inline bool debug_rt_mutex_detect_deadlock(struct rt_mutex_waiter *w, in debug_rt_mutex_detect_deadlock() argument
Drtmutex-debug.h27 # define debug_rt_mutex_reset_waiter(w) \ argument
28 do { (w)->deadlock_lock = NULL; } while (0)
36 static inline void rt_mutex_print_deadlock(struct rt_mutex_waiter *w) in rt_mutex_print_deadlock() argument
38 debug_rt_mutex_print_deadlock(w); in rt_mutex_print_deadlock()
Drtmutex_common.h50 struct rt_mutex_waiter *w; in rt_mutex_top_waiter() local
52 w = rb_entry(lock->waiters_leftmost, struct rt_mutex_waiter, in rt_mutex_top_waiter()
54 BUG_ON(w->lock != lock); in rt_mutex_top_waiter()
56 return w; in rt_mutex_top_waiter()
Drtmutex.c1232 struct rt_mutex_waiter *w) in rt_mutex_handle_deadlock() argument
1244 rt_mutex_print_deadlock(w); in rt_mutex_handle_deadlock()
/kernel/
Daudit_watch.c238 static void audit_watch_log_rule_change(struct audit_krule *r, struct audit_watch *w, char *op) in audit_watch_log_rule_change() argument
250 audit_log_untrustedstring(ab, w->path); in audit_watch_log_rule_change()
339 struct audit_watch *w, *nextw; in audit_remove_parent_watches() local
344 list_for_each_entry_safe(w, nextw, &parent->watches, wlist) { in audit_remove_parent_watches()
345 list_for_each_entry_safe(r, nextr, &w->rules, rlist) { in audit_remove_parent_watches()
347 audit_watch_log_rule_change(r, w, "remove_rule"); in audit_remove_parent_watches()
355 audit_remove_watch(w); in audit_remove_parent_watches()
383 struct audit_watch *w, *watch = krule->watch; in audit_add_to_parent() local
388 list_for_each_entry(w, &parent->watches, wlist) { in audit_add_to_parent()
389 if (strcmp(watch->path, w->path)) in audit_add_to_parent()
[all …]
Daudit.h288 #define audit_put_watch(w) {} argument
289 #define audit_get_watch(w) {} argument
293 #define audit_watch_path(w) "" argument
294 #define audit_watch_compare(w, i, d) 0 argument
/kernel/sched/
Dsched.h75 # define scale_load(w) ((w) << SCHED_FIXEDPOINT_SHIFT) argument
76 # define scale_load_down(w) ((w) >> SCHED_FIXEDPOINT_SHIFT) argument
79 # define scale_load(w) (w) argument
80 # define scale_load_down(w) (w) argument
Dfair.c147 static inline void update_load_set(struct load_weight *lw, unsigned long w) in update_load_set() argument
149 lw->weight = w; in update_load_set()
205 unsigned long w; in __update_inv_weight() local
210 w = scale_load_down(lw->weight); in __update_inv_weight()
212 if (BITS_PER_LONG > 32 && unlikely(w >= WMULT_CONST)) in __update_inv_weight()
214 else if (unlikely(!w)) in __update_inv_weight()
217 lw->inv_weight = WMULT_CONST / w; in __update_inv_weight()
5340 long W, w = cfs_rq_load_avg(cfs_rq); in effective_load() local
5351 W += w; in effective_load()
5356 w += wl; in effective_load()
[all …]
/kernel/bpf/
Dverifier.c2499 static int push_insn(int t, int w, int e, struct bpf_verifier_env *env) in push_insn() argument
2507 if (w < 0 || w >= env->prog->len) { in push_insn()
2508 verbose("jump out of range from insn %d to %d\n", t, w); in push_insn()
2514 env->explored_states[w] = STATE_LIST_MARK; in push_insn()
2516 if (insn_state[w] == 0) { in push_insn()
2519 insn_state[w] = DISCOVERED; in push_insn()
2522 insn_stack[cur_stack++] = w; in push_insn()
2524 } else if ((insn_state[w] & 0xF0) == DISCOVERED) { in push_insn()
2525 verbose("back-edge from insn %d to %d\n", t, w); in push_insn()
2527 } else if (insn_state[w] == EXPLORED) { in push_insn()
/kernel/events/
Dcore.c490 static void perf_duration_warn(struct irq_work *w) in perf_duration_warn() argument