Home
last modified time | relevance | path

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

/kernel/
Dsysctl.c495 size_t left; in __do_proc_dointvec() local
505 left = *lenp; in __do_proc_dointvec()
514 if (left > PAGE_SIZE - 1) in __do_proc_dointvec()
515 left = PAGE_SIZE - 1; in __do_proc_dointvec()
519 for (; left && vleft--; i++, first=0) { in __do_proc_dointvec()
524 proc_skip_spaces(&p, &left); in __do_proc_dointvec()
526 if (!left) in __do_proc_dointvec()
528 err = proc_get_long(&p, &left, &lval, &neg, in __do_proc_dointvec()
543 proc_put_char(&buffer, &left, '\t'); in __do_proc_dointvec()
544 proc_put_long(&buffer, &left, lval, neg); in __do_proc_dointvec()
[all …]
Dauditfilter.c1204 int audit_comparator(u32 left, u32 op, u32 right) in audit_comparator() argument
1208 return (left == right); in audit_comparator()
1210 return (left != right); in audit_comparator()
1212 return (left < right); in audit_comparator()
1214 return (left <= right); in audit_comparator()
1216 return (left > right); in audit_comparator()
1218 return (left >= right); in audit_comparator()
1220 return (left & right); in audit_comparator()
1222 return ((left & right) == right); in audit_comparator()
1228 int audit_uid_comparator(kuid_t left, u32 op, kuid_t right) in audit_uid_comparator() argument
[all …]
Dgroups.c94 unsigned int left, right; in groups_search() local
99 left = 0; in groups_search()
101 while (left < right) { in groups_search()
102 unsigned int mid = (left+right)/2; in groups_search()
104 left = mid + 1; in groups_search()
Daudit.h231 extern int audit_comparator(const u32 left, const u32 op, const u32 right);
232 extern int audit_uid_comparator(kuid_t left, u32 op, kuid_t right);
233 extern int audit_gid_comparator(kgid_t left, u32 op, kgid_t right);
Dpid.c368 void exchange_tids(struct task_struct *left, struct task_struct *right) in exchange_tids() argument
370 struct pid *pid1 = left->thread_pid; in exchange_tids()
379 rcu_assign_pointer(left->thread_pid, pid2); in exchange_tids()
383 WRITE_ONCE(left->pid, pid_nr(pid2)); in exchange_tids()
Dregset.c24 (struct membuf){.p = p, .left = size}); in __regset_get()
Dauditsc.c232 int left = ctx->tree_count; in put_tree_ref() local
234 if (likely(left)) { in put_tree_ref()
235 p->c[--left] = chunk; in put_tree_ref()
236 ctx->tree_count = left; in put_tree_ref()
/kernel/locking/
Drtmutex.c355 static __always_inline int rt_mutex_waiter_less(struct rt_mutex_waiter *left, in rt_mutex_waiter_less() argument
358 if (left->prio < right->prio) in rt_mutex_waiter_less()
367 if (dl_prio(left->prio)) in rt_mutex_waiter_less()
368 return dl_time_before(left->deadline, right->deadline); in rt_mutex_waiter_less()
373 static __always_inline int rt_mutex_waiter_equal(struct rt_mutex_waiter *left, in rt_mutex_waiter_equal() argument
376 if (left->prio != right->prio) in rt_mutex_waiter_equal()
385 if (dl_prio(left->prio)) in rt_mutex_waiter_equal()
386 return left->deadline == right->deadline; in rt_mutex_waiter_equal()
/kernel/sched/
Ddeadline.c911 u64 left, right; in dl_entity_overflow() local
931 left = (pi_of(dl_se)->dl_deadline >> DL_SCALE) * (dl_se->runtime >> DL_SCALE); in dl_entity_overflow()
935 return dl_time_before(right, left); in dl_entity_overflow()
2009 struct rb_node *left = rb_first_cached(&dl_rq->root); in pick_next_dl_entity() local
2011 if (!left) in pick_next_dl_entity()
2014 return __node_2_dle(left); in pick_next_dl_entity()
Dfair.c649 struct rb_node *left = rb_first_cached(&cfs_rq->tasks_timeline); in __pick_first_entity() local
651 if (!left) in __pick_first_entity()
654 return __node_2_se(left); in __pick_first_entity()
5042 struct sched_entity *left = __pick_first_entity(cfs_rq); in pick_next_entity() local
5053 if (!left || (curr && entity_before(curr, left))) in pick_next_entity()
5054 left = curr; in pick_next_entity()
5056 se = left; /* ideally we run the leftmost entity */ in pick_next_entity()
5073 if (second && wakeup_preempt_entity(second, left) < 1) in pick_next_entity()
5077 if (cfs_rq->next && wakeup_preempt_entity(cfs_rq->next, left) < 1) { in pick_next_entity()
5082 } else if (cfs_rq->last && wakeup_preempt_entity(cfs_rq->last, left) < 1) { in pick_next_entity()