| /linux/include/kunit/ |
| H A D | test.h | 835 right, \ argument
840 const typeof(right) __right = (right); \
844 .right_text = #right, \
866 right, \ argument
873 left, op, right, \
881 right, \ argument
888 left, op, right, \
896 right, \ argument
901 const char *__right = (right); \
905 .right_text = #right, \
[all …]
|
| /linux/arch/parisc/math-emu/ |
| H A D | sfsub.c | 42 register unsigned int left, right, result, extent; in sgl_fsub() local
51 right = *rightptr; in sgl_fsub()
55 Sgl_xortointp1(left,right,/*to*/save); in sgl_fsub()
64 if (Sgl_isnotnan(right)) in sgl_fsub()
66 if (Sgl_isinfinity(right) && save==0) in sgl_fsub()
100 else if (Sgl_is_signalingnan(right)) in sgl_fsub()
106 Sgl_set_quiet(right); in sgl_fsub()
107 *dstptr = right; in sgl_fsub()
120 if (Sgl_isinfinity_exponent(right)) in sgl_fsub()
122 if (Sgl_iszero_mantissa(right)) in sgl_fsub()
[all …]
|
| H A D | sfadd.c | 42 register unsigned int left, right, result, extent; in sgl_fadd() local
53 right = *rightptr; in sgl_fadd()
57 Sgl_xortointp1(left,right,/*to*/save); in sgl_fadd()
66 if (Sgl_isnotnan(right)) in sgl_fadd()
68 if (Sgl_isinfinity(right) && save!=0) in sgl_fadd()
102 else if (Sgl_is_signalingnan(right)) in sgl_fadd()
108 Sgl_set_quiet(right); in sgl_fadd()
109 *dstptr = right; in sgl_fadd()
122 if (Sgl_isinfinity_exponent(right)) in sgl_fadd()
124 if (Sgl_iszero_mantissa(right)) in sgl_fadd()
[all …]
|
| H A D | sfcmp.c | 42 register unsigned int left, right; in sgl_fcmp() local
47 right = *rightptr; in sgl_fcmp()
53 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) ) in sgl_fcmp()
62 ( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
63 && Sgl_isnotzero_mantissa(right) in sgl_fcmp()
64 && (Exception(cond) || Sgl_isone_signaling(right)) ) ) in sgl_fcmp()
79 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
80 && Sgl_isnotzero_mantissa(right)) ) in sgl_fcmp()
90 Sgl_xortointp1(left,right,xorresult); in sgl_fcmp()
96 && Sgl_iszero_exponentmantissa(right) ) in sgl_fcmp()
[all …]
|
| H A D | hppa.h | 15 #define Shiftdouble(left,right,amount,dest) \ argument
17 dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount))
20 #define Variableshiftdouble(left,right,amount,dest) \ argument
22 if (amount == 0) dest = right; \
24 ((unsigned) right >> (amount))
27 #define Variable_shift_double(left,right,amount,dest) \ argument
29 dest = (left << (32-(amount))) | ((unsigned) right >> (amount))
|
| /linux/Documentation/userspace-api/media/v4l/ |
| H A D | pixfmt-y8i.rst | 19 in lower and from the right sensor in the higher 8 bits.
33 - Y'\ :sub:`00right`
35 - Y'\ :sub:`01right`
37 - Y'\ :sub:`02right`
39 - Y'\ :sub:`03right`
42 - Y'\ :sub:`10right`
44 - Y'\ :sub:`11right`
46 - Y'\ :sub:`12right`
48 - Y'\ :sub:`13right`
51 - Y'\ :sub:`20right`
[all …]
|
| /linux/scripts/kconfig/ |
| H A D | expr.c | 42 e->right._initdata == r) in expr_lookup()
49 e->right._initdata = r; in expr_lookup()
109 r = (*ep1)->right.expr; in __expr_eliminate_eq()
117 r = (*ep2)->right.expr; in __expr_eliminate_eq()
228 return e1->left.sym == e2->left.sym && e1->right.sym == e2->right.sym; in expr_eq()
274 r = expr_eliminate_yn(e->right.expr); in expr_eliminate_yn()
290 r = expr_eliminate_yn(e->right.expr); in expr_eliminate_yn()
343 ((e1->right.sym == &symbol_yes && e2->right.sym == &symbol_mod) || in expr_join_or()
344 (e1->right.sym == &symbol_mod && e2->right.sym == &symbol_yes))) { in expr_join_or()
349 ((e1->right.sym == &symbol_yes && e2->right.sym == &symbol_no) || in expr_join_or()
[all …]
|
| /linux/include/linux/ |
| H A D | uidgid.h | 53 static inline bool uid_eq(kuid_t left, kuid_t right) in uid_eq() argument
55 return __kuid_val(left) == __kuid_val(right); in uid_eq()
58 static inline bool gid_eq(kgid_t left, kgid_t right) in gid_eq() argument
60 return __kgid_val(left) == __kgid_val(right); in gid_eq()
63 static inline bool uid_gt(kuid_t left, kuid_t right) in uid_gt() argument
65 return __kuid_val(left) > __kuid_val(right); in uid_gt()
68 static inline bool gid_gt(kgid_t left, kgid_t right) in gid_gt() argument
70 return __kgid_val(left) > __kgid_val(right); in gid_gt()
73 static inline bool uid_gte(kuid_t left, kuid_t right) in uid_gte() argument
75 return __kuid_val(left) >= __kuid_val(right); in uid_gte()
[all …]
|
| /linux/arch/x86/crypto/ |
| H A D | des3_ede-asm_64.S | 92 #define initial_permutation(left, right) \ argument
93 do_permutation(left##d, right##d, 4, 0x0f0f0f0f); \
94 do_permutation(left##d, right##d, 16, 0x0000ffff); \
95 do_permutation(right##d, left##d, 2, 0x33333333); \
96 do_permutation(right##d, left##d, 8, 0x00ff00ff); \
99 roll $1, right##d; \
100 xorl right##d, RW0d; \
103 xorl RW0d, right##d; \
105 expand_to_64bits(right, RT3); \
108 #define final_permutation(left, right) \ argument
[all …]
|
| /linux/fs/quota/ |
| H A D | kqid.c | 13 bool qid_eq(struct kqid left, struct kqid right) in qid_eq() argument
15 if (left.type != right.type) in qid_eq()
19 return uid_eq(left.uid, right.uid); in qid_eq()
21 return gid_eq(left.gid, right.gid); in qid_eq()
23 return projid_eq(left.projid, right.projid); in qid_eq()
37 bool qid_lt(struct kqid left, struct kqid right) in qid_lt() argument
39 if (left.type < right.type) in qid_lt()
41 if (left.type > right.type) in qid_lt()
45 return uid_lt(left.uid, right.uid); in qid_lt()
47 return gid_lt(left.gid, right.gid); in qid_lt()
[all …]
|
| /linux/drivers/md/persistent-data/ |
| H A D | dm-btree-remove.c | 86 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy() argument
91 if (value_size != le32_to_cpu(right->header.value_size)) { in node_copy()
105 key_ptr(right, 0), in node_copy()
108 value_ptr(right, 0), in node_copy()
111 if (shift > le32_to_cpu(right->header.max_entries)) { in node_copy()
116 memcpy(key_ptr(right, 0), in node_copy()
119 memcpy(value_ptr(right, 0), in node_copy()
192 static int shift(struct btree_node *left, struct btree_node *right, int count) in shift() argument
196 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); in shift()
198 uint32_t r_max_entries = le32_to_cpu(right->header.max_entries); in shift()
[all …]
|
| /linux/tools/testing/selftests/hid/tests/ |
| H A D | base_gamepad.py | 65 self.right = (127, 127)
84 right=(None, None), argument
126 right = replace_none_in_tuple(right, self.right)
127 self.right = right
143 self.store_axes("right_stick", gamepad, right)
150 self, *, left=(None, None), right=(None, None), hat_switch=None, buttons=None argument
165 left=left, right=right, hat_switch=hat_switch, buttons=buttons
206 right=(None, None), argument
230 right=right,
|
| /linux/tools/perf/util/ |
| H A D | sort.c | 111 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) in sort__thread_cmp() argument
113 return thread__tid(right->thread) - thread__tid(left->thread); in sort__thread_cmp()
147 sort__tgid_cmp(struct hist_entry *left, struct hist_entry *right) in sort__tgid_cmp() argument
149 return thread__pid(right->thread) - thread__pid(left->thread); in sort__tgid_cmp()
184 sort__simd_cmp(struct hist_entry *left, struct hist_entry *right) in sort__simd_cmp() argument
186 if (left->simd_flags.arch != right->simd_flags.arch) in sort__simd_cmp()
187 return (int64_t) left->simd_flags.arch - right->simd_flags.arch; in sort__simd_cmp()
189 return (int64_t) left->simd_flags.pred - right->simd_flags.pred; in sort__simd_cmp()
235 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) in sort__comm_cmp() argument
237 return strcmp(comm__str(right->comm), comm__str(left->comm)); in sort__comm_cmp()
[all …]
|
| /linux/fs/xfs/scrub/ |
| H A D | bitmap.c | 126 struct xbitmap64_node *right; in xbitmap64_set() local
145 right = xbitmap64_tree_iter_first(&bitmap->xb_root, last + 1, last + 1); in xbitmap64_set()
146 ASSERT(!right || right->bn_start == last + 1); in xbitmap64_set()
148 if (left && right) { in xbitmap64_set()
151 xbitmap64_tree_remove(right, &bitmap->xb_root); in xbitmap64_set()
152 left->bn_last = right->bn_last; in xbitmap64_set()
154 kfree(right); in xbitmap64_set()
160 } else if (right) { in xbitmap64_set()
162 xbitmap64_tree_remove(right, &bitmap->xb_root); in xbitmap64_set()
163 right->bn_start = start; in xbitmap64_set()
[all …]
|
| /linux/fs/unicode/ |
| H A D | mkutf8data.c | 368 void *right; member
392 node = node->right; in lookup()
394 leaf = node->right; in lookup()
442 node->left, node->right, in tree_walk()
445 if (!(node->left && node->right)) in tree_walk()
467 assert(node->right); in tree_walk()
468 tree->leaf_print(node->right, in tree_walk()
471 } else if (node->right) { in tree_walk()
474 node = node->right; in tree_walk()
498 node->left = node->right = NULL; in alloc_node()
[all …]
|
| /linux/Documentation/sound/cards/ |
| H A D | audigy-mixer.rst | 49 This control is used to attenuate samples from left and right front PCM FX-bus
50 accumulators. ALSA uses accumulators 8 and 9 for left and right front PCM
55 This control is used to attenuate samples from left and right surround PCM FX-bus
56 accumulators. ALSA uses accumulators 2 and 3 for left and right surround PCM
62 This control is used to attenuate samples from left and right side PCM FX-bus
63 accumulators. ALSA uses accumulators 14 and 15 for left and right side PCM
80 This control is used to attenuate samples from left and right PCM FX-bus
81 accumulators. ALSA uses accumulators 0 and 1 for left and right PCM samples for
86 This control is used to attenuate samples from left and right PCM FX-bus
87 accumulators. ALSA uses accumulators 0 and 1 for left and right PCM samples for
[all …]
|
| H A D | sb-live-mixer.rst | 64 This control is used to attenuate samples from left and right PCM FX-bus
65 accumulators. ALSA uses accumulators 0 and 1 for left and right PCM samples.
70 This control is used to attenuate samples from left and right PCM FX-bus
71 accumulators. ALSA uses accumulators 0 and 1 for left and right PCM samples.
77 This control is used to attenuate samples from left and right PCM FX-bus
78 accumulators. ALSA uses accumulators 0 and 1 for left and right PCM samples.
80 the ??rear?? right DAC PCM slot of the AC97 codec.
84 This control is used to attenuate samples from left and right PCM FX-bus
85 accumulators. ALSA uses accumulators 0 and 1 for left and right PCM.
91 These controls are used to attenuate samples from left and right PCM FX-bus
[all …]
|
| /linux/sound/core/oss/ |
| H A D | mixer_oss.c | 255 int result = 0, left, right; in snd_mixer_oss_get_volume() local
262 right = pslot->volume[1]; in snd_mixer_oss_get_volume()
264 result = pslot->get_volume(fmixer, pslot, &left, &right); in snd_mixer_oss_get_volume()
266 right = left; in snd_mixer_oss_get_volume()
269 if (snd_BUG_ON(right < 0 || right > 100)) in snd_mixer_oss_get_volume()
273 pslot->volume[1] = right; in snd_mixer_oss_get_volume()
274 result = (left & 0xff) | ((right & 0xff) << 8); in snd_mixer_oss_get_volume()
284 int result = 0, left = volume & 0xff, right = (volume >> 8) & 0xff; in snd_mixer_oss_set_volume() local
292 if (right > 100) in snd_mixer_oss_set_volume()
293 right = 100; in snd_mixer_oss_set_volume()
[all …]
|
| /linux/drivers/video/fbdev/core/ |
| H A D | fb_copyarea.h | 167 int shift, left, right; in fb_copy_fwd() local
173 right = shift & (BITS_PER_LONG - 1); in fb_copy_fwd()
182 d0 |= fb_right(reorder(fb_read_offset(0, src), reverse), right); in fb_copy_fwd()
189 d0 = fb_right(reorder(fb_read_offset(0, src), reverse), right); in fb_copy_fwd()
205 d0 = fb_left(d0, left) | fb_right(d1, right); in fb_copy_fwd()
215 d0 = fb_left(d0, left) | fb_right(d1, right); in fb_copy_fwd()
219 d0 = fb_left(d0, left) | fb_right(d1, right); in fb_copy_fwd()
223 d0 = fb_left(d0, left) | fb_right(d1, right); in fb_copy_fwd()
227 d0 = fb_left(d0, left) | fb_right(d1, right); in fb_copy_fwd()
235 d0 = fb_left(d0, left) | fb_right(d1, right); in fb_copy_fwd()
[all …]
|
| /linux/kernel/bpf/ |
| H A D | range_tree.c | 200 struct range_node *right; in range_tree_set() local
220 right = range_it_iter_first(rt, last + 1, last + 1); in range_tree_set()
221 if (right && right->rn_start != last + 1) in range_tree_set()
224 if (left && right) { in range_tree_set()
227 range_it_remove(right, rt); in range_tree_set()
228 left->rn_last = right->rn_last; in range_tree_set()
231 bpf_mem_free(&bpf_global_ma, right); in range_tree_set()
238 } else if (right) { in range_tree_set()
240 range_it_remove(right, rt); in range_tree_set()
241 right->rn_start = start; in range_tree_set()
[all …]
|
| /linux/drivers/usb/core/ |
| H A D | port.c | 484 static int link_peers(struct usb_port *left, struct usb_port *right) in link_peers() argument
489 if (left->peer == right && right->peer == left) in link_peers()
492 if (left->peer || right->peer) { in link_peers()
494 struct usb_port *rpeer = right->peer; in link_peers()
497 if (left->location && left->location == right->location) in link_peers()
503 dev_name(&left->dev), dev_name(&right->dev), method, in link_peers()
506 dev_name(&right->dev), in link_peers()
511 rc = sysfs_create_link(&left->dev.kobj, &right->dev.kobj, "peer"); in link_peers()
514 rc = sysfs_create_link(&right->dev.kobj, &left->dev.kobj, "peer"); in link_peers()
527 WARN_ON(right->is_superspeed); in link_peers()
[all …]
|
| /linux/fs/btrfs/ |
| H A D | ctree.c | 874 struct extent_buffer *right = NULL; in balance_level() local
976 right = btrfs_read_node_slot(parent, pslot + 1); in balance_level()
977 if (IS_ERR(right)) { in balance_level()
978 ret = PTR_ERR(right); in balance_level()
979 right = NULL; in balance_level()
983 btrfs_tree_lock_nested(right, BTRFS_NESTING_RIGHT); in balance_level()
984 wret = btrfs_cow_block(trans, root, right, in balance_level()
985 parent, pslot + 1, &right, in balance_level()
1004 if (right) { in balance_level()
1005 wret = push_node_left(trans, mid, right, 1); in balance_level()
[all …]
|
| /linux/drivers/hid/ |
| H A D | hid-zpff.c | 30 int left, right; in zpff_play() local
39 right = effect->u.rumble.weak_magnitude; in zpff_play()
40 dbg_hid("called with 0x%04x 0x%04x\n", left, right); in zpff_play()
43 right = right * 0x7f / 0xffff; in zpff_play()
46 zpff->report->field[3]->value[0] = right; in zpff_play()
47 dbg_hid("running with 0x%02x 0x%02x\n", left, right); in zpff_play()
|
| /linux/tools/testing/selftests/kvm/lib/ |
| H A D | sparsebit.c | 171 struct node *right; member
227 if (nodep->right) { in node_next()
228 for (nodep = nodep->right; nodep->left; nodep = nodep->left) in node_next()
237 while (nodep->parent && nodep == nodep->parent->right) in node_next()
256 for (nodep = nodep->left; nodep->right; nodep = nodep->right) in node_prev()
297 if (subtree->right) { in node_copy_subtree()
298 root->right = node_copy_subtree(subtree->right); in node_copy_subtree()
299 root->right->parent = root; in node_copy_subtree()
316 nodep = nodep->idx > idx ? nodep->left : nodep->right) { in node_find()
367 if (!parentp->right) { in node_add()
[all …]
|
| /linux/net/tipc/ |
| H A D | core.h | 184 static inline int less_eq(u16 left, u16 right) in less_eq() argument
186 return mod(right - left) < 32768u; in less_eq()
189 static inline int more(u16 left, u16 right) in more() argument
191 return !less_eq(left, right); in more()
194 static inline int less(u16 left, u16 right) in less() argument
196 return less_eq(left, right) && (mod(right) != mod(left)); in less()
|