| /linux-6.1.9/include/kunit/ |
| D | test.h | 574 right, \ argument
579 const typeof(right) __right = (right); \
583 .right_text = #right, \
604 right, \ argument
611 left, op, right, \
619 right, \ argument
626 left, op, right, \
634 right, \ argument
639 const char *__right = (right); \
643 .right_text = #right, \
[all …]
|
| /linux-6.1.9/arch/parisc/math-emu/ |
| 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 …]
|
| 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 …]
|
| 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 …]
|
| 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-6.1.9/scripts/kconfig/ |
| D | expr.c | 39 e->right.expr = e2; in expr_alloc_two()
48 e->right.sym = s2; in expr_alloc_comp()
89 e->right.sym = org->right.sym; in expr_copy()
95 e->right.expr = expr_copy(org->right.expr); in expr_copy()
128 expr_free(e->right.expr); in expr_free()
156 __expr_eliminate_eq(type, &e1->right.expr, &e2); in __expr_eliminate_eq()
161 __expr_eliminate_eq(type, &e1, &e2->right.expr); in __expr_eliminate_eq()
272 return e1->left.sym == e2->left.sym && e1->right.sym == e2->right.sym; in expr_eq()
323 e->right.expr = expr_eliminate_yn(e->right.expr); in expr_eliminate_yn()
327 expr_free(e->right.expr); in expr_eliminate_yn()
[all …]
|
| /linux-6.1.9/Documentation/userspace-api/media/v4l/ |
| 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-6.1.9/include/linux/ |
| D | uidgid.h | 61 static inline bool uid_eq(kuid_t left, kuid_t right) in uid_eq() argument
63 return __kuid_val(left) == __kuid_val(right); in uid_eq()
66 static inline bool gid_eq(kgid_t left, kgid_t right) in gid_eq() argument
68 return __kgid_val(left) == __kgid_val(right); in gid_eq()
71 static inline bool uid_gt(kuid_t left, kuid_t right) in uid_gt() argument
73 return __kuid_val(left) > __kuid_val(right); in uid_gt()
76 static inline bool gid_gt(kgid_t left, kgid_t right) in gid_gt() argument
78 return __kgid_val(left) > __kgid_val(right); in gid_gt()
81 static inline bool uid_gte(kuid_t left, kuid_t right) in uid_gte() argument
83 return __kuid_val(left) >= __kuid_val(right); in uid_gte()
[all …]
|
| /linux-6.1.9/arch/x86/crypto/ |
| 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-6.1.9/drivers/video/fbdev/core/ |
| D | syscopyarea.c | 33 int left, right; in bitcpy() local
80 right = shift & (bits - 1); in bitcpy()
92 *dst = comp(*src >> right, *dst, first); in bitcpy()
97 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
118 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
130 *dst++ = d0 >> right | d1 << left; in bitcpy()
133 *dst++ = d0 >> right | d1 << left; in bitcpy()
136 *dst++ = d0 >> right | d1 << left; in bitcpy()
139 *dst++ = d0 >> right | d1 << left; in bitcpy()
145 *dst++ = d0 >> right | d1 << left; in bitcpy()
[all …]
|
| D | sysfillrect.c | 72 unsigned long pat, int left, int right, unsigned n, int bits) in bitfill_unaligned() argument
93 pat = pat << left | pat >> right; in bitfill_unaligned()
101 pat = pat << left | pat >> right; in bitfill_unaligned()
103 pat = pat << left | pat >> right; in bitfill_unaligned()
105 pat = pat << left | pat >> right; in bitfill_unaligned()
107 pat = pat << left | pat >> right; in bitfill_unaligned()
112 pat = pat << left | pat >> right; in bitfill_unaligned()
182 unsigned long pat, int left, int right, unsigned n, in bitfill_unaligned_rev() argument
205 pat = pat << left | pat >> right; in bitfill_unaligned_rev()
213 pat = pat << left | pat >> right; in bitfill_unaligned_rev()
[all …]
|
| D | cfbcopyarea.c | 111 int const right = -shift & (bits - 1); in bitcpy() local
124 d0 >>= right; in bitcpy()
129 d0 = d0 >> right | d1 << left; in bitcpy()
153 d0 = d0 >> right | d1 << left; in bitcpy()
166 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
169 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
172 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
175 FB_WRITEL(d0 >> right | d1 << left, dst++); in bitcpy()
182 d0 = d0 >> right | d1 << left; in bitcpy()
190 if (m <= bits - right) { in bitcpy()
[all …]
|
| D | cfbfillrect.c | 93 unsigned long pat, int left, int right, unsigned n, int bits) in bitfill_unaligned() argument
114 pat = pat << left | pat >> right; in bitfill_unaligned()
122 pat = pat << left | pat >> right; in bitfill_unaligned()
124 pat = pat << left | pat >> right; in bitfill_unaligned()
126 pat = pat << left | pat >> right; in bitfill_unaligned()
128 pat = pat << left | pat >> right; in bitfill_unaligned()
133 pat = pat << left | pat >> right; in bitfill_unaligned()
218 int dst_idx, unsigned long pat, int left, int right, in bitfill_unaligned_rev() argument
243 pat = pat << left | pat >> right; in bitfill_unaligned_rev()
252 pat = pat << left | pat >> right; in bitfill_unaligned_rev()
[all …]
|
| /linux-6.1.9/fs/quota/ |
| 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-6.1.9/drivers/md/persistent-data/ |
| D | dm-btree-remove.c | 85 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) in node_copy() argument
89 if (value_size != le32_to_cpu(right->header.value_size)) { in node_copy()
103 key_ptr(right, 0), in node_copy()
106 value_ptr(right, 0), in node_copy()
109 if (shift > le32_to_cpu(right->header.max_entries)) { in node_copy()
114 memcpy(key_ptr(right, 0), in node_copy()
117 memcpy(value_ptr(right, 0), in node_copy()
189 static int shift(struct btree_node *left, struct btree_node *right, int count) in shift() argument
193 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); in shift()
195 uint32_t r_max_entries = le32_to_cpu(right->header.max_entries); in shift()
[all …]
|
| /linux-6.1.9/tools/perf/util/ |
| D | sort.c | 98 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) in sort__thread_cmp() argument
100 return right->thread->tid - left->thread->tid; in sort__thread_cmp()
139 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) in sort__comm_cmp() argument
141 return strcmp(comm__str(right->comm), comm__str(left->comm)); in sort__comm_cmp()
145 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) in sort__comm_collapse() argument
147 return strcmp(comm__str(right->comm), comm__str(left->comm)); in sort__comm_collapse()
151 sort__comm_sort(struct hist_entry *left, struct hist_entry *right) in sort__comm_sort() argument
153 return strcmp(comm__str(right->comm), comm__str(left->comm)); in sort__comm_sort()
195 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) in sort__dso_cmp() argument
197 return _sort__dso_cmp(right->ms.map, left->ms.map); in sort__dso_cmp()
[all …]
|
| /linux-6.1.9/fs/unicode/ |
| 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-6.1.9/drivers/usb/core/ |
| D | port.c | 405 static int link_peers(struct usb_port *left, struct usb_port *right) in link_peers() argument
410 if (left->peer == right && right->peer == left) in link_peers()
413 if (left->peer || right->peer) { in link_peers()
415 struct usb_port *rpeer = right->peer; in link_peers()
418 if (left->location && left->location == right->location) in link_peers()
424 dev_name(&left->dev), dev_name(&right->dev), method, in link_peers()
427 dev_name(&right->dev), in link_peers()
432 rc = sysfs_create_link(&left->dev.kobj, &right->dev.kobj, "peer"); in link_peers()
435 rc = sysfs_create_link(&right->dev.kobj, &left->dev.kobj, "peer"); in link_peers()
448 WARN_ON(right->is_superspeed); in link_peers()
[all …]
|
| /linux-6.1.9/sound/core/oss/ |
| D | mixer_oss.c | 261 int result = 0, left, right; in snd_mixer_oss_get_volume() local
268 right = pslot->volume[1]; in snd_mixer_oss_get_volume()
270 result = pslot->get_volume(fmixer, pslot, &left, &right); in snd_mixer_oss_get_volume()
272 right = left; in snd_mixer_oss_get_volume()
277 if (snd_BUG_ON(right < 0 || right > 100)) { in snd_mixer_oss_get_volume()
283 pslot->volume[1] = right; in snd_mixer_oss_get_volume()
284 result = (left & 0xff) | ((right & 0xff) << 8); in snd_mixer_oss_get_volume()
296 int result = 0, left = volume & 0xff, right = (volume >> 8) & 0xff; in snd_mixer_oss_set_volume() local
304 if (right > 100) in snd_mixer_oss_set_volume()
305 right = 100; in snd_mixer_oss_set_volume()
[all …]
|
| /linux-6.1.9/Documentation/sound/cards/ |
| D | audigy-mixer.rst | 49 This control is used to attenuate samples for left and right front PCM FX-bus
50 accumulators. ALSA uses accumulators 8 and 9 for left and right front PCM
56 This control is used to attenuate samples for left and right surround PCM FX-bus
57 accumulators. ALSA uses accumulators 2 and 3 for left and right surround PCM
75 This control is used to attenuate samples for left and right PCM FX-bus
76 accumulators. ALSA uses accumulators 0 and 1 for left and right PCM samples for
82 This control is used to attenuate samples for left and right PCM FX-bus
83 accumulator. ALSA uses accumulators 0 and 1 for left and right PCM.
89 This control is used to attenuate samples for left and right MIDI FX-bus
90 accumulators. ALSA uses accumulators 4 and 5 for left and right MIDI samples.
[all …]
|
| D | sb-live-mixer.rst | 64 This control is used to attenuate samples for 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 for 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 for 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 for 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 for left and right PCM FX-bus
[all …]
|
| /linux-6.1.9/drivers/hid/ |
| 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-6.1.9/fs/btrfs/ |
| D | ctree.c | 886 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 right = NULL; in balance_level()
980 if (right) { in balance_level()
981 __btrfs_tree_lock(right, BTRFS_NESTING_RIGHT); in balance_level()
982 wret = btrfs_cow_block(trans, root, right, in balance_level()
983 parent, pslot + 1, &right, in balance_level()
1002 if (right) { in balance_level()
1003 wret = push_node_left(trans, mid, right, 1); in balance_level()
[all …]
|
| /linux-6.1.9/net/tipc/ |
| D | core.h | 185 static inline int less_eq(u16 left, u16 right) in less_eq() argument
187 return mod(right - left) < 32768u; in less_eq()
190 static inline int more(u16 left, u16 right) in more() argument
192 return !less_eq(left, right); in more()
195 static inline int less(u16 left, u16 right) in less() argument
197 return less_eq(left, right) && (mod(right) != mod(left)); in less()
|
| /linux-6.1.9/tools/testing/selftests/kvm/lib/ |
| 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 …]
|