Searched refs:right (Results 1 - 25 of 286) sorted by relevance

1234567891011>>

/linux-master/arch/parisc/math-emu/
H A Dhppa.h15 #define Shiftdouble(left,right,amount,dest) \
16 /* int left, right, amount, dest; */ \
17 dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount))
20 #define Variableshiftdouble(left,right,amount,dest) \
21 /* unsigned int left, right; int amount, dest; */ \
22 if (amount == 0) dest = right; \
24 ((unsigned) right >> (amount))
27 #define Variable_shift_double(left,right,amount,dest) \
28 /* unsigned int left, right; int amount, dest; */ \
29 dest = (left << (32-(amount))) | ((unsigned) right >> (amoun
[all...]
H A Dsfcmp.c42 register unsigned int left, right; local
47 right = *rightptr;
53 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) )
62 ( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
63 && Sgl_isnotzero_mantissa(right)
64 && (Exception(cond) || Sgl_isone_signaling(right)) ) )
79 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT)
80 && Sgl_isnotzero_mantissa(right)) )
90 Sgl_xortointp1(left,right,xorresult);
96 && Sgl_iszero_exponentmantissa(right) )
[all...]
H A Dsfsub.c42 register unsigned int left, right, result, extent; local
51 right = *rightptr;
55 Sgl_xortointp1(left,right,/*to*/save);
64 if (Sgl_isnotnan(right))
66 if (Sgl_isinfinity(right) && save==0)
100 else if (Sgl_is_signalingnan(right))
106 Sgl_set_quiet(right);
107 *dstptr = right;
120 if (Sgl_isinfinity_exponent(right))
122 if (Sgl_iszero_mantissa(right))
[all...]
H A Dsfadd.c42 register unsigned int left, right, result, extent; local
53 right = *rightptr;
57 Sgl_xortointp1(left,right,/*to*/save);
66 if (Sgl_isnotnan(right))
68 if (Sgl_isinfinity(right) && save!=0)
102 else if (Sgl_is_signalingnan(right))
108 Sgl_set_quiet(right);
109 *dstptr = right;
122 if (Sgl_isinfinity_exponent(right))
124 if (Sgl_iszero_mantissa(right))
[all...]
/linux-master/fs/quota/
H A Dkqid.c9 * @right: Another quid value
13 bool qid_eq(struct kqid left, struct kqid right) argument
15 if (left.type != right.type)
19 return uid_eq(left.uid, right.uid);
21 return gid_eq(left.gid, right.gid);
23 return projid_eq(left.projid, right.projid);
33 * @right: The possibly greater qid value
35 * Return true if left is less than right and false otherwise.
37 bool qid_lt(struct kqid left, struct kqid right) argument
39 if (left.type < right
[all...]
/linux-master/include/linux/
H A Duidgid.h53 static inline bool uid_eq(kuid_t left, kuid_t right) argument
55 return __kuid_val(left) == __kuid_val(right);
58 static inline bool gid_eq(kgid_t left, kgid_t right) argument
60 return __kgid_val(left) == __kgid_val(right);
63 static inline bool uid_gt(kuid_t left, kuid_t right) argument
65 return __kuid_val(left) > __kuid_val(right);
68 static inline bool gid_gt(kgid_t left, kgid_t right) argument
70 return __kgid_val(left) > __kgid_val(right);
73 static inline bool uid_gte(kuid_t left, kuid_t right) argument
75 return __kuid_val(left) >= __kuid_val(right);
78 gid_gte(kgid_t left, kgid_t right) argument
83 uid_lt(kuid_t left, kuid_t right) argument
88 gid_lt(kgid_t left, kgid_t right) argument
93 uid_lte(kuid_t left, kuid_t right) argument
98 gid_lte(kgid_t left, kgid_t right) argument
[all...]
H A Dprojid.h36 static inline bool projid_eq(kprojid_t left, kprojid_t right) argument
38 return __kprojid_val(left) == __kprojid_val(right);
41 static inline bool projid_lt(kprojid_t left, kprojid_t right) argument
43 return __kprojid_val(left) < __kprojid_val(right);
/linux-master/include/kunit/
H A Dtest.h703 right, \
708 const typeof(right) __right = (right); \
712 .right_text = #right, \
734 right, \
741 left, op, right, \
749 right, \
756 left, op, right, \
764 right, \
769 const char *__right = (right); \
[all...]
/linux-master/tools/testing/selftests/hid/tests/
H A Dbase_gamepad.py65 self.right = (127, 127)
84 right=(None, None),
95 :param right: a tuple of absolute (x, y) value of the right joypad
126 right = replace_none_in_tuple(right, self.right)
127 self.right = right
143 self.store_axes("right_stick", gamepad, right)
[all...]
/linux-master/drivers/video/fbdev/core/
H A Dsyscopyarea.c33 int left, right; local
80 right = shift & (bits - 1);
92 *dst = comp(*src >> right, *dst, first);
97 *dst = comp(d0 >> right | d1 << left, *dst,
118 *dst = comp(d0 >> right | d1 << left, *dst,
130 *dst++ = d0 >> right | d1 << left;
133 *dst++ = d0 >> right | d1 << left;
136 *dst++ = d0 >> right | d1 << left;
139 *dst++ = d0 >> right | d1 << left;
145 *dst++ = d0 >> right | d
153 d0 >>= right; local
228 int const right = -shift & (bits-1); local
261 d0 >>= right; local
[all...]
H A Dsysfillrect.c66 * Left/right are the appropriate shifts to convert to the pattern to be
72 unsigned long pat, int left, int right, unsigned n, int bits)
93 pat = pat << left | pat >> right;
101 pat = pat << left | pat >> right;
103 pat = pat << left | pat >> right;
105 pat = pat << left | pat >> right;
107 pat = pat << left | pat >> right;
112 pat = pat << left | pat >> right;
176 * Left/right are the appropriate shifts to convert to the pattern to be
182 unsigned long pat, int left, int right, unsigne
71 bitfill_unaligned(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) argument
181 bitfill_unaligned_rev(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) argument
288 int right, r; local
[all...]
H A Dcfbcopyarea.c111 int const right = -shift & (bits - 1); local
124 d0 >>= right; local
129 d0 = d0 >> right | d1 << left;
153 d0 = d0 >> right | d1 << left;
166 FB_WRITEL(d0 >> right | d1 << left, dst++);
169 FB_WRITEL(d0 >> right | d1 << left, dst++);
172 FB_WRITEL(d0 >> right | d1 << left, dst++);
175 FB_WRITEL(d0 >> right | d1 << left, dst++);
182 d0 = d0 >> right | d1 << left;
190 if (m <= bits - right) {
192 d0 >>= right; local
284 int const right = -shift & (bits-1); local
293 d0 >>= right; local
319 d0 >>= right; local
[all...]
H A Dcfbfillrect.c87 * Left/right are the appropriate shifts to convert to the pattern to be
93 unsigned long pat, int left, int right, unsigned n, int bits)
114 pat = pat << left | pat >> right;
122 pat = pat << left | pat >> right;
124 pat = pat << left | pat >> right;
126 pat = pat << left | pat >> right;
128 pat = pat << left | pat >> right;
133 pat = pat << left | pat >> right;
212 * Left/right are the appropriate shifts to convert to the pattern to be
218 int dst_idx, unsigned long pat, int left, int right,
92 bitfill_unaligned(struct fb_info *p, unsigned long __iomem *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) argument
217 bitfill_unaligned_rev(struct fb_info *p, unsigned long __iomem *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) argument
335 int right, r; local
[all...]
/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...]
/linux-master/drivers/hid/
H A Dhid-zpff.c30 int left, right; local
39 right = effect->u.rumble.weak_magnitude;
40 dbg_hid("called with 0x%04x 0x%04x\n", left, right);
43 right = right * 0x7f / 0xffff;
46 zpff->report->field[3]->value[0] = right;
47 dbg_hid("running with 0x%02x 0x%02x\n", left, right);
H A Dhid-pl.c52 int left, right; local
55 right = effect->u.rumble.weak_magnitude;
56 debug("called with 0x%04x 0x%04x", left, right);
59 right = right * plff->maxval / 0xffff;
62 *plff->weak = right;
63 debug("running with 0x%02x 0x%02x", left, right);
H A Dhid-sjoy.c34 u32 left, right; local
37 right = effect->u.rumble.weak_magnitude;
38 dev_dbg(&dev->dev, "called with 0x%08x 0x%08x\n", left, right);
41 right = (right != 0); /* on/off only */
43 sjoyff->report->field[0]->value[1] = right;
45 dev_dbg(&dev->dev, "running with 0x%02x 0x%02x\n", left, right);
H A Dhid-axff.c37 int left, right; local
41 right = effect->u.rumble.weak_magnitude;
43 dbg_hid("called with 0x%04x 0x%04x", left, right);
46 right = right * 0xff / 0xffff;
51 field_count % 2 ? right : left;
56 dbg_hid("running with 0x%02x 0x%02x", left, right);
157 * We need to start polling device right away, otherwise
H A Dhid-lgff.c63 unsigned int left, right; local
82 right = effect->u.rumble.strong_magnitude;
84 right = right * 0xff / 0xffff;
87 CLAMP(right);
91 report->field[0]->value[3] = right;
92 dbg_hid("(left, right)=(%04x, %04x)\n", left, right);
/linux-master/arch/x86/crypto/
H A Ddes3_ede-asm_64.S92 #define initial_permutation(left, right) \
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) \
[all...]
/linux-master/fs/xfs/scrub/
H A Dbitmap.c103 /* overlaps with the right side of the clearing range */
126 struct xbitmap64_node *right; local
144 /* Do we have a right-adjacent extent? */
145 right = xbitmap64_tree_iter_first(&bitmap->xb_root, last + 1, last + 1);
146 ASSERT(!right || right->bn_start == last + 1);
148 if (left && right) {
149 /* combine left and right adjacent extent */
151 xbitmap64_tree_remove(right, &bitmap->xb_root);
152 left->bn_last = right
401 struct xbitmap32_node *right; local
[all...]
/linux-master/include/sound/
H A Dmixer_oss.h21 int *left, int *right);
24 int left, int right);
/linux-master/tools/perf/util/
H A Dsort.c111 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) argument
113 return thread__tid(right->thread) - thread__tid(left->thread);
147 sort__simd_cmp(struct hist_entry *left, struct hist_entry *right) argument
149 if (left->simd_flags.arch != right->simd_flags.arch)
150 return (int64_t) left->simd_flags.arch - right->simd_flags.arch;
152 return (int64_t) left->simd_flags.pred - right->simd_flags.pred;
198 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) argument
200 return strcmp(comm__str(right->comm), comm__str(left->comm));
204 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) argument
206 return strcmp(comm__str(right
210 sort__comm_sort(struct hist_entry *left, struct hist_entry *right) argument
254 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) argument
326 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) argument
347 sort__sym_sort(struct hist_entry *left, struct hist_entry *right) argument
426 sort__symoff_cmp(struct hist_entry *left, struct hist_entry *right) argument
438 sort__symoff_sort(struct hist_entry *left, struct hist_entry *right) argument
477 sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right) argument
489 sort__srcline_collapse(struct hist_entry *left, struct hist_entry *right) argument
500 sort__srcline_sort(struct hist_entry *left, struct hist_entry *right) argument
536 sort__srcline_from_cmp(struct hist_entry *left, struct hist_entry *right) argument
542 sort__srcline_from_collapse(struct hist_entry *left, struct hist_entry *right) argument
554 sort__srcline_from_sort(struct hist_entry *left, struct hist_entry *right) argument
584 sort__srcline_to_cmp(struct hist_entry *left, struct hist_entry *right) argument
590 sort__srcline_to_collapse(struct hist_entry *left, struct hist_entry *right) argument
602 sort__srcline_to_sort(struct hist_entry *left, struct hist_entry *right) argument
706 sort__srcfile_cmp(struct hist_entry *left, struct hist_entry *right) argument
712 sort__srcfile_collapse(struct hist_entry *left, struct hist_entry *right) argument
723 sort__srcfile_sort(struct hist_entry *left, struct hist_entry *right) argument
753 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) argument
781 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right) argument
812 sort__cgroup_id_cmp(struct hist_entry *left, struct hist_entry *right) argument
842 sort__cgroup_cmp(struct hist_entry *left, struct hist_entry *right) argument
875 sort__socket_cmp(struct hist_entry *left, struct hist_entry *right) argument
907 sort__time_cmp(struct hist_entry *left, struct hist_entry *right) argument
964 sort__trace_cmp(struct hist_entry *left, struct hist_entry *right) argument
1005 sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right) argument
1037 sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right) argument
1069 sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right) argument
1086 sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right) argument
1242 sort__addr_from_cmp(struct hist_entry *left, struct hist_entry *right) argument
1266 sort__addr_to_cmp(struct hist_entry *left, struct hist_entry *right) argument
1307 sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right) argument
1334 sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right) argument
1363 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right) argument
1389 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right) argument
1415 sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right) argument
1440 sort__locked_cmp(struct hist_entry *left, struct hist_entry *right) argument
1468 sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right) argument
1496 sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right) argument
1524 sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right) argument
1552 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right) argument
1647 sort__weight_cmp(struct hist_entry *left, struct hist_entry *right) argument
1680 sort__ins_lat_cmp(struct hist_entry *left, struct hist_entry *right) argument
1713 sort__p_stage_cyc_cmp(struct hist_entry *left, struct hist_entry *right) argument
1803 sort__blocked_cmp(struct hist_entry *left, struct hist_entry *right) argument
1838 sort__phys_daddr_cmp(struct hist_entry *left, struct hist_entry *right) argument
1879 sort__data_page_size_cmp(struct hist_entry *left, struct hist_entry *right) argument
1908 sort__code_page_size_cmp(struct hist_entry *left, struct hist_entry *right) argument
1933 sort__abort_cmp(struct hist_entry *left, struct hist_entry *right) argument
1965 sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right) argument
1997 sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right) argument
2080 sort__sym_size_cmp(struct hist_entry *left, struct hist_entry *right) argument
2119 sort__dso_size_cmp(struct hist_entry *left, struct hist_entry *right) argument
2149 sort__addr_cmp(struct hist_entry *left, struct hist_entry *right) argument
2193 sort__type_cmp(struct hist_entry *left, struct hist_entry *right) argument
2211 sort__type_collapse(struct hist_entry *left, struct hist_entry *right) argument
2230 sort__type_sort(struct hist_entry *left, struct hist_entry *right) argument
2254 sort__typeoff_sort(struct hist_entry *left, struct hist_entry *right) argument
[all...]
/linux-master/drivers/md/persistent-data/
H A Ddm-btree-remove.c29 * Each node may have a left or right sibling. When decending the spine,
37 * ==> rebalance(node, right sibling)
39 * [C] No right sibling
42 * [D] Both siblings, total_entries(left, node, right) <= DEL_THRESHOLD
43 * ==> delete node adding it's contents to left and right
45 * [E] Both siblings, total_entries(left, node, right) > DEL_THRESHOLD
46 * ==> rebalance(left, node, right)
86 static int node_copy(struct btree_node *left, struct btree_node *right, int shift) argument
91 if (value_size != le32_to_cpu(right->header.value_size)) {
105 key_ptr(right,
192 shift(struct btree_node *left, struct btree_node *right, int count) argument
241 struct btree_node *right = r->n; local
284 struct child left, right; local
311 delete_center_node(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) argument
351 redistribute3(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) argument
423 struct btree_node *right = r->n; local
451 struct child left, center, right; local
[all...]
/linux-master/fs/unicode/
H A Dmkutf8data.c121 * right-hand path (tested bit is set)
126 * RIGHTNODE - 1 bit field - set if the right-hand node is internal
368 void *right; member in struct:node
392 node = node->right;
394 leaf = node->right;
415 * left and right branches in the leftmask and rightmask.
439 " left %p right %p mask %x bits %x\n",
442 node->left, node->right,
445 if (!(node->left && node->right))
467 assert(node->right);
658 struct node *right; local
1052 struct node *right; local
1377 struct unicode_data *right = r; local
1394 struct unicode_data *right = r; local
[all...]

Completed in 214 milliseconds

1234567891011>>