Lines Matching defs:data
316 * This is the priority-queue data structure of the RT scheduling class:
352 * This is all done in the data structure below. It is similar to the
526 extern int walk_tg_tree_from(struct task_group *from, tg_visitor down, tg_visitor up, void *data);
534 static inline int walk_tg_tree(tg_visitor down, tg_visitor up, void *data)
536 return walk_tg_tree_from(&root_task_group, down, up, data);
539 extern int tg_nop(struct task_group *tg, void *data);
973 * This is the main, per-CPU runqueue data structure.
1698 * per-task data have been completed by this moment.
2497 struct update_util_data *data;
2509 data = rcu_dereference_sched(*per_cpu_ptr(&cpufreq_update_util_data, cpu_of(rq)));
2510 if (data) {
2511 data->func(data, clock, flags);