/linux-master/arch/parisc/math-emu/ |
H A D | hppa.h | 15 #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 D | sfcmp.c | 42 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 D | sfsub.c | 42 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 D | sfadd.c | 42 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 D | kqid.c | 9 * @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 D | uidgid.h | 53 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 D | projid.h | 36 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 D | test.h | 689 right, \ 694 const typeof(right) __right = (right); \ 698 .right_text = #right, \ 719 right, \ 726 left, op, right, \ 734 right, \ 741 left, op, right, \ 749 right, \ 754 const char *__right = (right); \ [all...] |
/linux-master/drivers/video/fbdev/core/ |
H A D | syscopyarea.c | 33 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 D | sysfillrect.c | 66 * 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 D | cfbcopyarea.c | 111 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 D | cfbfillrect.c | 87 * 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 D | expr.c | 39 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 D | hid-zpff.c | 30 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 D | hid-pl.c | 52 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 D | hid-sjoy.c | 34 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 D | hid-axff.c | 37 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 D | hid-lgff.c | 63 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);
|
H A D | hid-gaff.c | 34 int left, right; local 37 right = effect->u.rumble.weak_magnitude; 39 dbg_hid("called with 0x%04x 0x%04x", left, right); 42 right = right * 0xfe / 0xffff; 46 gaff->report->field[0]->value[2] = right; 50 dbg_hid("running with 0x%02x 0x%02x", left, right);
|
/linux-master/arch/x86/crypto/ |
H A D | des3_ede-asm_64.S | 92 #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 D | bitmap.c | 102 /* overlaps with the right side of the clearing range */ 125 struct xbitmap64_node *right; local 143 /* Do we have a right-adjacent extent? */ 144 right = xbitmap64_tree_iter_first(&bitmap->xb_root, last + 1, last + 1); 145 ASSERT(!right || right->bn_start == last + 1); 147 if (left && right) { 148 /* combine left and right adjacent extent */ 150 xbitmap64_tree_remove(right, &bitmap->xb_root); 151 left->bn_last = right 399 struct xbitmap32_node *right; local [all...] |
/linux-master/include/sound/ |
H A D | mixer_oss.h | 21 int *left, int *right); 24 int left, int right);
|
/linux-master/tools/perf/util/ |
H A D | sort.c | 110 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) argument 112 return thread__tid(right->thread) - thread__tid(left->thread); 146 sort__simd_cmp(struct hist_entry *left, struct hist_entry *right) argument 148 if (left->simd_flags.arch != right->simd_flags.arch) 149 return (int64_t) left->simd_flags.arch - right->simd_flags.arch; 151 return (int64_t) left->simd_flags.pred - right->simd_flags.pred; 197 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) argument 199 return strcmp(comm__str(right->comm), comm__str(left->comm)); 203 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) argument 205 return strcmp(comm__str(right 209 sort__comm_sort(struct hist_entry *left, struct hist_entry *right) argument 253 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) argument 325 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) argument 346 sort__sym_sort(struct hist_entry *left, struct hist_entry *right) argument 425 sort__symoff_cmp(struct hist_entry *left, struct hist_entry *right) argument 437 sort__symoff_sort(struct hist_entry *left, struct hist_entry *right) argument 476 sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right) argument 488 sort__srcline_collapse(struct hist_entry *left, struct hist_entry *right) argument 499 sort__srcline_sort(struct hist_entry *left, struct hist_entry *right) argument 535 sort__srcline_from_cmp(struct hist_entry *left, struct hist_entry *right) argument 541 sort__srcline_from_collapse(struct hist_entry *left, struct hist_entry *right) argument 553 sort__srcline_from_sort(struct hist_entry *left, struct hist_entry *right) argument 583 sort__srcline_to_cmp(struct hist_entry *left, struct hist_entry *right) argument 589 sort__srcline_to_collapse(struct hist_entry *left, struct hist_entry *right) argument 601 sort__srcline_to_sort(struct hist_entry *left, struct hist_entry *right) argument 705 sort__srcfile_cmp(struct hist_entry *left, struct hist_entry *right) argument 711 sort__srcfile_collapse(struct hist_entry *left, struct hist_entry *right) argument 722 sort__srcfile_sort(struct hist_entry *left, struct hist_entry *right) argument 752 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) argument 780 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right) argument 811 sort__cgroup_id_cmp(struct hist_entry *left, struct hist_entry *right) argument 841 sort__cgroup_cmp(struct hist_entry *left, struct hist_entry *right) argument 874 sort__socket_cmp(struct hist_entry *left, struct hist_entry *right) argument 906 sort__time_cmp(struct hist_entry *left, struct hist_entry *right) argument 963 sort__trace_cmp(struct hist_entry *left, struct hist_entry *right) argument 1004 sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right) argument 1036 sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right) argument 1068 sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right) argument 1085 sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right) argument 1241 sort__addr_from_cmp(struct hist_entry *left, struct hist_entry *right) argument 1265 sort__addr_to_cmp(struct hist_entry *left, struct hist_entry *right) argument 1306 sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right) argument 1333 sort__cycles_cmp(struct hist_entry *left, struct hist_entry *right) argument 1362 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right) argument 1388 sort__iaddr_cmp(struct hist_entry *left, struct hist_entry *right) argument 1414 sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right) argument 1439 sort__locked_cmp(struct hist_entry *left, struct hist_entry *right) argument 1467 sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right) argument 1495 sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right) argument 1523 sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right) argument 1551 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right) argument 1645 sort__weight_cmp(struct hist_entry *left, struct hist_entry *right) argument 1678 sort__ins_lat_cmp(struct hist_entry *left, struct hist_entry *right) argument 1711 sort__p_stage_cyc_cmp(struct hist_entry *left, struct hist_entry *right) argument 1801 sort__blocked_cmp(struct hist_entry *left, struct hist_entry *right) argument 1836 sort__phys_daddr_cmp(struct hist_entry *left, struct hist_entry *right) argument 1877 sort__data_page_size_cmp(struct hist_entry *left, struct hist_entry *right) argument 1906 sort__code_page_size_cmp(struct hist_entry *left, struct hist_entry *right) argument 1931 sort__abort_cmp(struct hist_entry *left, struct hist_entry *right) argument 1963 sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right) argument 1995 sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right) argument 2078 sort__sym_size_cmp(struct hist_entry *left, struct hist_entry *right) argument 2117 sort__dso_size_cmp(struct hist_entry *left, struct hist_entry *right) argument 2147 sort__addr_cmp(struct hist_entry *left, struct hist_entry *right) argument 2191 sort__type_cmp(struct hist_entry *left, struct hist_entry *right) argument 2209 sort__type_collapse(struct hist_entry *left, struct hist_entry *right) argument 2228 sort__type_sort(struct hist_entry *left, struct hist_entry *right) argument 2252 sort__typeoff_sort(struct hist_entry *left, struct hist_entry *right) argument [all...] |
/linux-master/drivers/md/persistent-data/ |
H A D | dm-btree-remove.c | 29 * 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 D | mkutf8data.c | 121 * 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...] |