Searched refs:right (Results 201 - 225 of 283) sorted by path

1234567891011>>

/linux-master/kernel/events/
H A Dcore.c83 * Now that we're on right CPU with IRQs disabled, we can test
84 * if we hit the right task without races.
314 * are already disabled and we're on the right CPU.
340 * We must be either inactive or active and the right task,
1395 * if so. If we locked the right context, then it
1581 const struct perf_event *right)
1583 if (left_cpu < right->cpu)
1585 if (left_cpu > right->cpu)
1589 if (left_pmu < right->pmu_ctx->pmu)
1591 if (left_pmu > right
1579 perf_event_groups_cmp(const int left_cpu, const struct pmu *left_pmu, const struct cgroup *left_cgroup, const u64 left_group_index, const struct perf_event *right) argument
[all...]
/linux-master/kernel/
H A Dgroups.c94 unsigned int left, right; local
100 right = group_info->ngroups;
101 while (left < right) {
102 unsigned int mid = (left+right)/2;
106 right = mid;
H A Dpid.c382 void exchange_tids(struct task_struct *left, struct task_struct *right) argument
385 struct pid *pid2 = right->thread_pid;
394 rcu_assign_pointer(right->thread_pid, pid1);
398 WRITE_ONCE(right->pid, pid_nr(pid1));
/linux-master/kernel/locking/
H A Drtmutex.c392 struct rt_waiter_node *right)
394 if (left->prio < right->prio)
401 * then right waiter has a dl_prio() too.
404 return dl_time_before(left->deadline, right->deadline);
410 struct rt_waiter_node *right)
412 if (left->prio != right->prio)
419 * then right waiter has a dl_prio() too.
422 return left->deadline == right->deadline;
1049 * We reached the end of the lock chain. Stop right here. No
1660 * Yell loudly and stop the task right her
391 rt_waiter_node_less(struct rt_waiter_node *left, struct rt_waiter_node *right) argument
409 rt_waiter_node_equal(struct rt_waiter_node *left, struct rt_waiter_node *right) argument
[all...]
/linux-master/kernel/sched/
H A Ddeadline.c905 u64 left, right; local
908 * left and right are the two sides of the equation above,
926 right = ((dl_se->deadline - t) >> DL_SCALE) *
929 return dl_time_before(right, left);
1296 * by 2^BW_SHIFT, the result has to be shifted right by BW_SHIFT.
1298 * is multiped by rq->dl.bw_ratio and shifted right by RATIO_SHIFT.
2715 * this is the right place to try to pull some other one
/linux-master/lib/
H A Dbtree.c35 * values are to the right, not to the left. All used slots within a node
396 /* right-most key is too large, update it */
397 /* FIXME: If the right-most key on higher levels is
518 unsigned long *right, int rfill,
525 setkey(geo, left, lfill + i, bkey(geo, right, i));
526 setval(geo, left, lfill + i, bval(geo, right, i));
528 /* Exchange left and right child in parent */
529 setval(geo, parent, lpos, right);
531 /* Remove left (formerly right) child from parent */
533 mempool_free(right, hea
516 merge(struct btree_head *head, struct btree_geo *geo, int level, unsigned long *left, int lfill, unsigned long *right, int rfill, unsigned long *parent, int lpos) argument
539 unsigned long *parent, *left = NULL, *right = NULL; local
[all...]
H A Dmaple_tree.c143 struct ma_state *orig_r; /* Original right side of subtree */
146 struct ma_state *r; /* New right side of subtree */
1514 * Check end implied pivot which can only be a gap on the right most
1780 * mab_shift_right() - Shift the data in mab right. Note, does not clean out the
1832 * If the split is less than the max slot && the right side will
2231 * @old_r: The encoded maple node to the right (next node).
2262 * the node to the right. Checking the nodes to the right then the left at each
2308 * mast_ascend() - Ascend the original left and right maple states.
2311 * Ascend the original left and right side
2366 mas_mab_to_node(struct ma_state *mas, struct maple_big_node *b_node, struct maple_enode **left, struct maple_enode **right, struct maple_enode **middle, unsigned char *mid_split, unsigned long min) argument
2423 mas_set_split_parent(struct ma_state *mas, struct maple_enode *left, struct maple_enode *right, unsigned char *slot, unsigned char split) argument
2448 mte_mid_split_check(struct maple_enode **l, struct maple_enode **r, struct maple_enode *right, unsigned char slot, unsigned char *split, unsigned char mid_split) argument
2474 mast_set_split_parents(struct maple_subtree_state *mast, struct maple_enode *left, struct maple_enode *middle, struct maple_enode *right, unsigned char split, unsigned char mid_split) argument
2663 mast_cp_to_nodes(struct maple_subtree_state *mast, struct maple_enode *left, struct maple_enode *middle, struct maple_enode *right, unsigned char split, unsigned char mid_split) argument
2834 struct maple_enode *left = NULL, *middle = NULL, *right = NULL; local
[all...]
/linux-master/mm/
H A Dmemblock.c1847 unsigned int left = 0, right = type->cnt; local
1850 unsigned int mid = (right + left) / 2;
1853 right = mid;
1859 } while (left < right);
/linux-master/net/ceph/crush/
H A Dmapper.c185 static int right(int x) function
214 /* descend to the left or right? */
219 n = right(n);
/linux-master/net/core/
H A Dsock_reuseport.c108 int left, right; local
112 right = reuse->num_socks;
115 right = reuse->max_socks;
118 for (; left < right; left++)
/linux-master/net/ipv6/
H A Dip6_fib.c813 rcu_dereference_protected(fn->right,
850 rcu_assign_pointer(pn->right, ln);
911 rcu_assign_pointer(pn->right, in);
921 rcu_assign_pointer(in->right, ln);
925 rcu_assign_pointer(in->right, fn);
945 RCU_INIT_POINTER(ln->right, fn);
952 rcu_assign_pointer(pn->right, ln);
1581 next = dir ? rcu_dereference(fn->right) :
1709 fn = rcu_dereference(fn->right);
1770 child_right = rcu_dereference_protected(fn->right,
2078 struct fib6_node *fn, *pn, *left, *right; local
[all...]
/linux-master/net/netfilter/
H A Dnft_set_pipapo.c1930 * @right: Byte expression for right boundary (end of range)
1953 * This function fills @left and @right with the byte values of the leftmost
1958 * right: < 12, 0, 10, 8, 0, 2, 2, 1 >
1961 * right: < 192, 168, 2, 1 >
1965 * rule 2 above: @left becomes < 192, 168, 1, 0 >, @right becomes
1972 int rule_count, u8 *left, u8 *right)
1975 u8 *l = left, *r = right;
2030 u8 right[NFT_PIPAPO_MAX_BYTES] = { 0 }; local
2033 pipapo_get_boundaries(f, first_rule, rule_count, left, right);
1971 pipapo_get_boundaries(struct nft_pipapo_field *f, int first_rule, int rule_count, u8 *left, u8 *right) argument
[all...]
H A Dx_tables.c702 int mid, left = 0, right = xt[af].cur - 1; local
704 while (left <= right) {
705 mid = (left + right) >> 1;
709 right = mid - 1;
/linux-master/net/sched/
H A Dem_meta.c49 * the right, eating up any number of octets and thus supporting
924 if (TCF_META_TYPE(hdr->left.kind) != TCF_META_TYPE(hdr->right.kind) ||
927 TCF_META_ID(hdr->right.kind) > TCF_META_ID_MAX)
937 memcpy(&meta->rvalue.hdr, &hdr->right, sizeof(hdr->right));
973 memcpy(&hdr.right, &meta->rvalue.hdr, sizeof(hdr.right));
H A Dsch_mqprio_lib.c14 int left = max(a, c), right = min(b, d); local
16 return left < right;
/linux-master/net/tipc/
H A Dcore.h185 static inline int less_eq(u16 left, u16 right) argument
187 return mod(right - left) < 32768u;
190 static inline int more(u16 left, u16 right) argument
192 return !less_eq(left, right);
195 static inline int less(u16 left, u16 right) argument
197 return less_eq(left, right) && (mod(right) != mod(left));
/linux-master/scripts/kconfig/
H A Dexpr.c39 e->right.expr = e2;
48 e->right.sym = s2;
89 e->right.sym = org->right.sym;
95 e->right.expr = expr_copy(org->right.expr);
128 expr_free(e->right.expr);
156 __expr_eliminate_eq(type, &e1->right.expr, &e2);
161 __expr_eliminate_eq(type, &e1, &e2->right.expr);
272 return e1->left.sym == e2->left.sym && e1->right
[all...]
H A Dexpr.h39 union expr_data left, right; member in struct:expr
47 for (e = (l); e && (s = e->right.sym); e = e->left.expr)
H A Dmenu.c95 e->right.expr = rewrite_m(e->right.expr);
276 !menu_validate_number(sym, prop->expr->right.sym))
522 (*ep)->right.sym = menu->sym;
H A Dsymbol.c145 range_sym = prop->expr->right.sym;
531 if (e->right.sym->visible != no)
532 e->right.sym->flags |= SYMBOL_DEF_USER;
625 val <= sym_get_range_val(prop->expr->right.sym, 10);
634 val <= sym_get_range_val(prop->expr->right.sym, 16);
1102 return sym_check_expr_deps(e->right.expr);
1114 return sym_check_deps(e->right.sym);
/linux-master/security/tomoyo/
H A Dcommon.c1254 const u8 right = condp->right; local
1268 switch (right) {
1280 const u8 right = condp->right; local
1323 switch (right) {
1334 tomoyo_condition_keyword[right]);
H A Dcommon.h646 u8 right; member in struct:tomoyo_condition_element
H A Dcondition.c294 * @right: Righthand value.
299 static bool tomoyo_parse_argv(char *left, char *right, argument
305 argv->value = tomoyo_get_dqword(right);
313 * @right: Righthand value.
318 static bool tomoyo_parse_envp(char *left, char *right, argument
333 if (!strcmp(right, "NULL")) {
336 value = tomoyo_get_dqword(right);
513 u8 right = -1; local
525 * of one or more repetition of $left$operator$right blocks
527 * either '=' or '!='" and "$right i
801 const u8 right = condp->right; local
[all...]
/linux-master/sound/aoa/codecs/
H A Dtas.c16 * monaureal and connected to the right channel of
24 * to delay the right channel by one sample. You can
157 u8 left, right; local
160 right = tas->cached_volume_r;
163 if (right > 177) right = 177;
166 if (tas->mute_r) right = 0;
178 tmp = tas_gaintable[right];
/linux-master/sound/core/oss/
H A Dmixer_oss.c255 int result = 0, left, right; local
262 right = pslot->volume[1];
264 result = pslot->get_volume(fmixer, pslot, &left, &right);
266 right = left;
269 if (snd_BUG_ON(right < 0 || right > 100))
273 pslot->volume[1] = right;
274 result = (left & 0xff) | ((right & 0xff) << 8);
284 int result = 0, left = volume & 0xff, right = (volume >> 8) & 0xff; local
292 if (right > 10
516 snd_mixer_oss_get_volume1_vol(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, unsigned int numid, int *left, int *right) argument
548 snd_mixer_oss_get_volume1_sw(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, unsigned int numid, int *left, int *right, int route) argument
582 snd_mixer_oss_get_volume1(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, int *left, int *right) argument
608 snd_mixer_oss_put_volume1_vol(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, unsigned int numid, int left, int right) argument
644 snd_mixer_oss_put_volume1_sw(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, unsigned int numid, int left, int right, int route) argument
685 snd_mixer_oss_put_volume1(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, int left, int right) argument
739 int left, right; local
752 int left, right; local
[all...]

Completed in 565 milliseconds

1234567891011>>