| /kernel/bpf/ |
| D | percpu_freelist.c | 18 head->first = NULL; in pcpu_freelist_init()
21 s->extralist.first = NULL; in pcpu_freelist_init()
33 node->next = head->first; in pcpu_freelist_push_node()
34 WRITE_ONCE(head->first, node); in pcpu_freelist_push_node()
129 if (!READ_ONCE(head->first)) in ___pcpu_freelist_pop()
132 node = head->first; in ___pcpu_freelist_pop()
134 WRITE_ONCE(head->first, node->next); in ___pcpu_freelist_pop()
142 if (!READ_ONCE(s->extralist.first)) in ___pcpu_freelist_pop()
145 node = s->extralist.first; in ___pcpu_freelist_pop()
147 WRITE_ONCE(s->extralist.first, node->next); in ___pcpu_freelist_pop()
[all …]
|
| D | percpu_freelist.h | 10 struct pcpu_freelist_node *first; member
|
| D | memalloc.c | 116 entry = head->first; in __llist_del_first()
120 head->first = next; in __llist_del_first()
|
| /kernel/trace/ |
| D | rethook.c | 222 node = tsk->rethooks.first; in __rethook_find_ret_addr()
292 struct llist_node *first, *node = NULL; in rethook_trampoline_handler() local
315 first = current->rethooks.first; in rethook_trampoline_handler()
316 while (first) { in rethook_trampoline_handler()
317 rhn = container_of(first, struct rethook_node, llist); in rethook_trampoline_handler()
324 if (first == node) in rethook_trampoline_handler()
326 first = first->next; in rethook_trampoline_handler()
333 first = current->rethooks.first; in rethook_trampoline_handler()
334 current->rethooks.first = node->next; in rethook_trampoline_handler()
337 while (first) { in rethook_trampoline_handler()
[all …]
|
| D | trace_output.c | 73 int i, first = 1; in trace_print_flags_seq() local
83 if (!first && delim) in trace_print_flags_seq()
86 first = 0; in trace_print_flags_seq()
92 if (!first && delim) in trace_print_flags_seq()
137 int i, first = 1; in trace_print_flags_seq_u64() local
147 if (!first && delim) in trace_print_flags_seq_u64()
150 first = 0; in trace_print_flags_seq_u64()
156 if (!first && delim) in trace_print_flags_seq_u64()
|
| D | trace_events.c | 285 bool first = true; in test_event_printk() local
314 if (first) { in test_event_printk()
319 first = false; in test_event_printk()
336 if (!first || !in_quote) in test_event_printk()
2746 bool first = false; in trace_event_eval_update() local
2754 first = true; in trace_event_eval_update()
2772 if (first) { in trace_event_eval_update()
2774 first = false; in trace_event_eval_update()
2792 unsigned int first; in trace_create_new_event() local
2803 if (!trace_pid_list_first(pid_list, &first) || in trace_create_new_event()
[all …]
|
| D | Kconfig | 215 Its first purpose is to trace the duration of functions and
314 Enables hooks which will be called when preemption is first disabled,
461 The tracer prints two lines at every activation. The first is the
835 "START". The second string records the cold cache time of the first
844 first=3672 [COLD CACHED]
845 last=632 first=3672 max=632 min=632 avg=316 std=446 std^2=199712
846 last=278 first=3672 max=632 min=278 avg=303 std=316 std^2=100337
847 last=277 first=3672 max=632 min=277 avg=296 std=258 std^2=67064
848 last=273 first=3672 max=632 min=273 avg=292 std=224 std^2=50411
849 last=273 first=3672 max=632 min=273 avg=288 std=200 std^2=40389
[all …]
|
| /kernel/ |
| D | user_namespace.c | 247 u32 first, last, id2; in cmp_map_id() local
255 first = el->lower_first; in cmp_map_id()
257 first = el->first; in cmp_map_id()
259 last = first + el->count - 1; in cmp_map_id()
261 if (key->id >= first && key->id <= last && in cmp_map_id()
262 (id2 >= first && id2 <= last)) in cmp_map_id()
265 if (key->id < first || id2 < first) in cmp_map_id()
297 u32 first, last, id2; in map_id_range_down_base() local
303 first = map->extent[idx].first; in map_id_range_down_base()
304 last = first + map->extent[idx].count - 1; in map_id_range_down_base()
[all …]
|
| D | async.c | 89 struct async_entry *first = NULL; in lowest_in_progress() local
97 first = list_first_entry(&domain->pending, in lowest_in_progress()
101 first = list_first_entry(&async_global_pending, in lowest_in_progress()
105 if (first) in lowest_in_progress()
106 ret = first->cookie; in lowest_in_progress()
|
| D | taskstats.c | 215 struct task_struct *tsk, *first; in fill_stats_for_tgid() local
226 first = find_task_by_vpid(tgid); in fill_stats_for_tgid()
228 if (!first || !lock_task_sighand(first, &flags)) in fill_stats_for_tgid()
231 if (first->signal->stats) in fill_stats_for_tgid()
232 memcpy(stats, first->signal->stats, sizeof(*stats)); in fill_stats_for_tgid()
236 tsk = first; in fill_stats_for_tgid()
261 } while_each_thread(first, tsk); in fill_stats_for_tgid()
263 unlock_task_sighand(first, &flags); in fill_stats_for_tgid()
|
| D | resource.c | 770 struct resource *first, *next; in __insert_resource() local
772 for (;; parent = first) { in __insert_resource()
773 first = __request_resource(parent, new); in __insert_resource()
774 if (!first) in __insert_resource()
775 return first; in __insert_resource()
777 if (first == parent) in __insert_resource()
778 return first; in __insert_resource()
779 if (WARN_ON(first == new)) /* duplicated insertion */ in __insert_resource()
780 return first; in __insert_resource()
782 if ((first->start > new->start) || (first->end < new->end)) in __insert_resource()
[all …]
|
| D | pid.c | 51 { .first = NULL },
52 { .first = NULL },
53 { .first = NULL },
400 struct hlist_node *first; in pid_task() local
401 first = rcu_dereference_check(hlist_first_rcu(&pid->tasks[type]), in pid_task()
403 if (first) in pid_task()
404 result = hlist_entry(first, struct task_struct, pid_links[(type)]); in pid_task()
|
| D | user.c | 34 .first = 0,
44 .first = 0,
54 .first = 0,
|
| D | sysctl.c | 494 int *i, vleft, first = 1, err = 0; in __do_proc_dointvec() local
519 for (; left && vleft--; i++, first=0) { in __do_proc_dointvec()
542 if (!first) in __do_proc_dointvec()
548 if (!write && !first && left && !err) in __do_proc_dointvec()
552 if (write && first) in __do_proc_dointvec()
1048 int vleft, first = 1, err = 0; in __do_proc_doulongvec_minmax() local
1072 for (; left && vleft--; i++, first = 0) { in __do_proc_doulongvec_minmax()
1098 if (!first) in __do_proc_doulongvec_minmax()
1104 if (!write && !first && left && !err) in __do_proc_doulongvec_minmax()
1108 if (write && first) in __do_proc_doulongvec_minmax()
[all …]
|
| D | kprobes.c | 1959 node = tsk->kretprobe_instances.first; in __kretprobe_find_ret_addr()
2024 struct llist_node *first, *node = NULL; in __kretprobe_trampoline_handler() local
2042 first = current->kretprobe_instances.first; in __kretprobe_trampoline_handler()
2043 while (first) { in __kretprobe_trampoline_handler()
2044 ri = container_of(first, struct kretprobe_instance, llist); in __kretprobe_trampoline_handler()
2058 if (first == node) in __kretprobe_trampoline_handler()
2061 first = first->next; in __kretprobe_trampoline_handler()
2067 first = current->kretprobe_instances.first; in __kretprobe_trampoline_handler()
2068 current->kretprobe_instances.first = node->next; in __kretprobe_trampoline_handler()
2072 while (first) { in __kretprobe_trampoline_handler()
[all …]
|
| D | static_call_inline.c | 126 struct static_call_mod *site_mod, first; in __static_call_update() local
145 first = (struct static_call_mod){ in __static_call_update()
151 for (site_mod = &first; site_mod; site_mod = site_mod->next) { in __static_call_update()
|
| D | signal.c | 579 struct sigqueue *q, *first = NULL; in collect_signal() local
587 if (first) in collect_signal()
589 first = q; in collect_signal()
595 if (first) { in collect_signal()
597 list_del_init(&first->list); in collect_signal()
598 copy_siginfo(info, &first->info); in collect_signal()
601 (first->flags & SIGQUEUE_PREALLOC) && in collect_signal()
605 __sigqueue_free(first); in collect_signal()
|
| /kernel/sched/ |
| D | topology.c | 599 struct sched_group *tmp, *first; in free_sched_groups() local
604 first = sg; in free_sched_groups()
614 } while (sg != first); in free_sched_groups()
1007 struct sched_group *first = NULL, *last = NULL, *sg; in build_overlap_sched_groups() local
1081 if (!first) in build_overlap_sched_groups()
1082 first = sg; in build_overlap_sched_groups()
1086 last->next = first; in build_overlap_sched_groups()
1088 sd->groups = first; in build_overlap_sched_groups()
1093 free_sched_groups(first, 0); in build_overlap_sched_groups()
1218 struct sched_group *first = NULL, *last = NULL; in build_sched_groups() local
[all …]
|
| D | stop_task.c | 31 static void set_next_task_stop(struct rq *rq, struct task_struct *stop, bool first) in set_next_task_stop() argument
|
| D | idle.c | 434 static void set_next_task_idle(struct rq *rq, struct task_struct *next, bool first) in set_next_task_idle() argument
|
| /kernel/cgroup/ |
| D | debug.c | 241 bool first = true; in cgroup_masks_read_one() local
247 if (!first) in cgroup_masks_read_one()
250 first = false; in cgroup_masks_read_one()
|
| /kernel/locking/ |
| D | rwsem.c | 589 bool first = rwsem_first_waiter(sem) == waiter; in rwsem_del_wake_waiter() local
598 if (rwsem_del_waiter(sem, waiter) && first) in rwsem_del_wake_waiter()
615 struct rwsem_waiter *first = rwsem_first_waiter(sem); in rwsem_try_write_lock() local
630 if (first->handoff_set && (waiter != first)) in rwsem_try_write_lock()
662 first->handoff_set = true; in rwsem_try_write_lock()
|
| D | mutex.c | 675 bool first; in __mutex_lock_common() local
705 first = __mutex_waiter_is_first(lock, &waiter); in __mutex_lock_common()
713 if (__mutex_trylock_or_handoff(lock, first)) in __mutex_lock_common()
716 if (first) { in __mutex_lock_common()
|
| /kernel/debug/kdb/ |
| D | kdb_cmds | 7 # Standard debugging information for first level support, just type archkdb
|
| /kernel/time/ |
| D | hrtimer.c | 1217 bool force_local, first; in __hrtimer_start_range_ns() local
1258 first = enqueue_hrtimer(timer, new_base, mode); in __hrtimer_start_range_ns()
1260 return first; in __hrtimer_start_range_ns()
|