Searched refs:right (Results 1 - 200 of 2482) sorted by relevance

1234567891011>>

/linux-4.1.27/arch/parisc/math-emu/
H A Dhppa.h28 #define Shiftdouble(left,right,amount,dest) \
29 /* int left, right, amount, dest; */ \
30 dest = ((left) << (32-(amount))) | ((unsigned int)(right) >> (amount))
33 #define Variableshiftdouble(left,right,amount,dest) \
34 /* unsigned int left, right; int amount, dest; */ \
35 if (amount == 0) dest = right; \
37 ((unsigned) right >> (amount))
40 #define Variable_shift_double(left,right,amount,dest) \
41 /* unsigned int left, right; int amount, dest; */ \
42 dest = (left << (32-(amount))) | ((unsigned) right >> (amount))
H A Dsfcmp.c55 register unsigned int left, right; sgl_fcmp() local
60 right = *rightptr; sgl_fcmp()
66 || (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) ) sgl_fcmp()
75 ( (Sgl_exponent(right) == SGL_INFINITY_EXPONENT) sgl_fcmp()
76 && Sgl_isnotzero_mantissa(right) sgl_fcmp()
77 && (Exception(cond) || Sgl_isone_signaling(right)) ) ) sgl_fcmp()
92 ((Sgl_exponent(right) == SGL_INFINITY_EXPONENT) sgl_fcmp()
93 && Sgl_isnotzero_mantissa(right)) ) sgl_fcmp()
103 Sgl_xortointp1(left,right,xorresult); sgl_fcmp()
109 && Sgl_iszero_exponentmantissa(right) ) sgl_fcmp()
124 else if( Sgl_all(left) == Sgl_all(right) ) sgl_fcmp()
131 if( Sgl_all(left) < Sgl_all(right) ) sgl_fcmp()
145 if( Sgl_all(left) > Sgl_all(right) ) sgl_fcmp()
H A Dsfsub.c55 register unsigned int left, right, result, extent; sgl_fsub() local
64 right = *rightptr; sgl_fsub()
68 Sgl_xortointp1(left,right,/*to*/save); sgl_fsub()
77 if (Sgl_isnotnan(right)) sgl_fsub()
79 if (Sgl_isinfinity(right) && save==0) sgl_fsub()
113 else if (Sgl_is_signalingnan(right)) sgl_fsub()
119 Sgl_set_quiet(right); sgl_fsub()
120 *dstptr = right; sgl_fsub()
133 if (Sgl_isinfinity_exponent(right)) sgl_fsub()
135 if (Sgl_iszero_mantissa(right)) sgl_fsub()
138 Sgl_invert_sign(right); sgl_fsub()
139 *dstptr = right; sgl_fsub()
145 if (Sgl_isone_signaling(right)) sgl_fsub()
151 Sgl_set_quiet(right); sgl_fsub()
156 *dstptr = right; sgl_fsub()
158 } /* End right NaN or Infinity processing */ sgl_fsub()
164 Sgl_copytoint_exponentmantissa(right,signless_upper_right); sgl_fsub()
171 Sgl_xorfromintp1(save,right,/*to*/right); sgl_fsub()
176 /* Invariant: left is not smaller than right. */ sgl_fsub()
178 if((right_exponent = Sgl_exponent(right)) == 0) sgl_fsub()
181 if(Sgl_iszero_mantissa(right)) sgl_fsub()
183 /* right is zero */ sgl_fsub()
187 Sgl_invert_sign(right); sgl_fsub()
190 Sgl_or_signs(left,/*with*/right); sgl_fsub()
194 Sgl_and_signs(left,/*with*/right); sgl_fsub()
220 Sgl_clear_sign(right); /* Exponent is already cleared */ sgl_fsub()
228 Sgl_subtract(left,/*minus*/right,/*into*/result); sgl_fsub()
245 Sgl_addition(left,right,/*into*/result); sgl_fsub()
272 Sgl_clear_signexponent_set_hidden(right); sgl_fsub()
288 /* Align right operand by shifting to right */ sgl_fsub()
289 Sgl_right_align(/*operand*/right,/*shifted by*/diff_exponent, sgl_fsub()
300 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); sgl_fsub()
311 * shift is needed, then all bits to the right of the guard sgl_fsub()
357 * one position right and still not found a one so the remainder sgl_fsub()
442 Sgl_addition(left,right,/*to*/result); sgl_fsub()
H A Dsfadd.c55 register unsigned int left, right, result, extent; sgl_fadd() local
66 right = *rightptr; sgl_fadd()
70 Sgl_xortointp1(left,right,/*to*/save); sgl_fadd()
79 if (Sgl_isnotnan(right)) sgl_fadd()
81 if (Sgl_isinfinity(right) && save!=0) sgl_fadd()
115 else if (Sgl_is_signalingnan(right)) sgl_fadd()
121 Sgl_set_quiet(right); sgl_fadd()
122 *dstptr = right; sgl_fadd()
135 if (Sgl_isinfinity_exponent(right)) sgl_fadd()
137 if (Sgl_iszero_mantissa(right)) sgl_fadd()
140 *dstptr = right; sgl_fadd()
146 if (Sgl_isone_signaling(right)) sgl_fadd()
152 Sgl_set_quiet(right); sgl_fadd()
157 *dstptr = right; sgl_fadd()
159 } /* End right NaN or Infinity processing */ sgl_fadd()
165 Sgl_copytoint_exponentmantissa(right,signless_upper_right); sgl_fadd()
172 Sgl_xorfromintp1(save,right,/*to*/right); sgl_fadd()
176 /* Invariant: left is not smaller than right. */ sgl_fadd()
178 if((right_exponent = Sgl_exponent(right)) == 0) sgl_fadd()
181 if(Sgl_iszero_mantissa(right)) sgl_fadd()
183 /* right is zero */ sgl_fadd()
189 Sgl_or_signs(left,/*with*/right); sgl_fadd()
193 Sgl_and_signs(left,/*with*/right); sgl_fadd()
218 Sgl_clear_sign(right); /* Exponent is already cleared */ sgl_fadd()
226 Sgl_subtract(left,/*minus*/right,/*into*/result); sgl_fadd()
243 Sgl_addition(left,right,/*into*/result); sgl_fadd()
269 Sgl_clear_signexponent_set_hidden(right); sgl_fadd()
285 /* Align right operand by shifting to right */ sgl_fadd()
286 Sgl_right_align(/*operand*/right,/*shifted by*/diff_exponent, sgl_fadd()
297 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); sgl_fadd()
308 * shift is needed, then all bits to the right of the guard sgl_fadd()
354 * one position right and still not found a one so the remainder sgl_fadd()
439 Sgl_addition(left,right,/*to*/result); sgl_fadd()
H A Dsgl_float.h63 #define Sgl_leftshiftby1_withextent(left,right,result) \
64 Shiftdouble(Sall(left),Extall(right),31,Sall(result))
66 #define Sgl_rightshiftby1_withextent(left,right,dst) \
67 Shiftdouble(Sall(left),Extall(right),1,Extall(right))
233 /* The left argument is never smaller than the right argument */
237 /* Subtract right augmented with extension from left augmented with zeros and
239 #define Sgl_subtract_withextension(left,right,extent,result) \
240 /* sgl_floating_point left,right,result; extension extent */ \
241 Sgl_subtract(left,right,result); \
248 #define Sgl_xortointp1(left,right,result) \
249 result = Sall(left) XOR Sall(right);
251 #define Sgl_xorfromintp1(left,right,result) \
252 Sall(result) = left XOR Sall(right)
374 /* The left argument is never smaller than the right argument */
419 #define Sglext_xortointp1(left,right,result) Sgl_xortointp1(left,right,result)
420 #define Sglext_xorfromintp1(left,right,result) \
421 Sgl_xorfromintp1(left,right,result)
H A Dfpbits.h31 * and bitfield assignment (default left-to-right, unlike VAX, PDP-11)
35 * is a 32-bit integer (right-justified on the 20) and that bit 0 is the
H A Ddbl_float.h99 #define Dbl_leftshiftby1_withextent(lefta,leftb,right,resulta,resultb) \
101 Shiftdouble(Dallp2(leftb), Extall(right), 31, Dallp2(resultb))
103 #define Dbl_rightshiftby1_withextent(leftb,right,dst) \
104 Extall(dst) = (Dallp2(leftb) << 31) | ((unsigned int)Extall(right) >> 1) | \
105 Extlow(right)
386 * Here we need to shift the result right to correct for an overshift
399 /* The left argument is never smaller than the right argument */
405 /* Subtract right augmented with extension from left augmented with zeros and
421 #define Dbl_xortointp1(left,right,result) \
422 result = Dallp1(left) XOR Dallp1(right)
424 #define Dbl_xorfromintp1(left,right,result) \
425 Dallp1(result) = left XOR Dallp1(right)
427 #define Dbl_swap_lower(left,right) \
428 Dallp2(left) = Dallp2(left) XOR Dallp2(right); \
429 Dallp2(right) = Dallp2(left) XOR Dallp2(right); \
430 Dallp2(left) = Dallp2(left) XOR Dallp2(right)
634 /* The left argument is never smaller than the right argument */
720 #define Dblext_xortointp1(left,right,result) Dbl_xortointp1(left,right,result)
722 #define Dblext_xorfromintp1(left,right,result) \
723 Dbl_xorfromintp1(left,right,result)
H A Ddfadd.c158 } /* End right NaN or Infinity processing */ dbl_fadd()
176 /* Invariant: left is not smaller than right. */ dbl_fadd()
183 /* right is zero */ dbl_fadd()
289 /* Align right operand by shifting to right */ dbl_fadd()
313 * shift is needed, then all bits to the right of the guard dbl_fadd()
359 * one position right and still not found a one so the remainder dbl_fadd()
H A Ddfsub.c159 } /* End right NaN or Infinity processing */ dbl_fsub()
178 /* Invariant: left is not smaller than right. */ dbl_fsub()
185 /* right is zero */ dbl_fsub()
292 /* Align right operand by shifting to right */ dbl_fsub()
316 * shift is needed, then all bits to the right of the guard dbl_fsub()
362 * one position right and still not found a one so the remainder dbl_fsub()
H A Dfmpyfadd.c444 /* right is zero */ dbl_fmpyfadd()
471 * Copy opnd3 to the double extended variable called right. dbl_fmpyfadd()
504 /* Invariant: left is not smaller than right. */ dbl_fmpyfadd()
516 /* Align right operand by shifting it to the right */ dbl_fmpyfadd()
543 * bits to the right of the guard bit are zeros, dbl_fmpyfadd()
569 * shifted the result one position right and still dbl_fmpyfadd()
1104 /* right is zero */ dbl_fmpynfadd()
1131 * Copy opnd3 to the double extended variable called right. dbl_fmpynfadd()
1164 /* Invariant: left is not smaller than right. */ dbl_fmpynfadd()
1176 /* Align right operand by shifting it to the right */ dbl_fmpynfadd()
1203 * bits to the right of the guard bit are zeros, dbl_fmpynfadd()
1229 * shifted the result one position right and still dbl_fmpynfadd()
1758 /* right is zero */ sgl_fmpyfadd()
1784 * Copy opnd3 to the double extended variable called right. sgl_fmpyfadd()
1816 /* Invariant: left is not smaller than right. */ sgl_fmpyfadd()
1828 /* Align right operand by shifting it to the right */ sgl_fmpyfadd()
1853 * bits to the right of the guard bit are zeros, sgl_fmpyfadd()
1878 * shifted the result one position right and still sgl_fmpyfadd()
2400 /* right is zero */ sgl_fmpynfadd()
2426 * Copy opnd3 to the double extended variable called right. sgl_fmpynfadd()
2458 /* Invariant: left is not smaller than right. */ sgl_fmpynfadd()
2470 /* Align right operand by shifting it to the right */ sgl_fmpynfadd()
2495 * bits to the right of the guard bit are zeros, sgl_fmpynfadd()
2520 * shifted the result one position right and still sgl_fmpynfadd()
/linux-4.1.27/scripts/kconfig/
H A Dexpr.c41 e->right.expr = e2; expr_alloc_two()
50 e->right.sym = s2; expr_alloc_comp()
87 e->right.sym = org->right.sym; expr_copy()
93 e->right.expr = expr_copy(org->right.expr); expr_copy()
122 expr_free(e->right.expr); expr_free()
140 __expr_eliminate_eq(type, &e1->right.expr, &e2); __expr_eliminate_eq()
145 __expr_eliminate_eq(type, &e1, &e2->right.expr); __expr_eliminate_eq()
204 return e1->left.sym == e2->left.sym && e1->right.sym == e2->right.sym; expr_eq()
244 e->right.expr = expr_eliminate_yn(e->right.expr); expr_eliminate_yn()
248 expr_free(e->right.expr); expr_eliminate_yn()
251 e->right.expr = NULL; expr_eliminate_yn()
255 tmp = e->right.expr; expr_eliminate_yn()
256 *e = *(e->right.expr); expr_eliminate_yn()
261 if (e->right.expr->type == E_SYMBOL) { expr_eliminate_yn()
262 if (e->right.expr->left.sym == &symbol_no) { expr_eliminate_yn()
264 expr_free(e->right.expr); expr_eliminate_yn()
267 e->right.expr = NULL; expr_eliminate_yn()
269 } else if (e->right.expr->left.sym == &symbol_yes) { expr_eliminate_yn()
270 free(e->right.expr); expr_eliminate_yn()
280 e->right.expr = expr_eliminate_yn(e->right.expr); expr_eliminate_yn()
284 tmp = e->right.expr; expr_eliminate_yn()
285 *e = *(e->right.expr); expr_eliminate_yn()
290 expr_free(e->right.expr); expr_eliminate_yn()
293 e->right.expr = NULL; expr_eliminate_yn()
297 if (e->right.expr->type == E_SYMBOL) { expr_eliminate_yn()
298 if (e->right.expr->left.sym == &symbol_no) { expr_eliminate_yn()
299 free(e->right.expr); expr_eliminate_yn()
304 } else if (e->right.expr->left.sym == &symbol_yes) { expr_eliminate_yn()
306 expr_free(e->right.expr); expr_eliminate_yn()
309 e->right.expr = NULL; expr_eliminate_yn()
332 e->right.expr = expr_trans_bool(e->right.expr); expr_trans_bool()
337 if (e->right.sym == &symbol_no) { expr_trans_bool()
339 e->right.sym = NULL; expr_trans_bool()
382 ((e1->right.sym == &symbol_yes && e2->right.sym == &symbol_mod) || expr_join_or()
383 (e1->right.sym == &symbol_mod && e2->right.sym == &symbol_yes))) { expr_join_or()
388 ((e1->right.sym == &symbol_yes && e2->right.sym == &symbol_no) || expr_join_or()
389 (e1->right.sym == &symbol_no && e2->right.sym == &symbol_yes))) { expr_join_or()
394 ((e1->right.sym == &symbol_mod && e2->right.sym == &symbol_no) || expr_join_or()
395 (e1->right.sym == &symbol_no && e2->right.sym == &symbol_mod))) { expr_join_or()
445 if ((e1->type == E_SYMBOL && e2->type == E_EQUAL && e2->right.sym == &symbol_yes) || expr_join_and()
446 (e2->type == E_SYMBOL && e1->type == E_EQUAL && e1->right.sym == &symbol_yes)) expr_join_and()
450 if ((e1->type == E_SYMBOL && e2->type == E_UNEQUAL && e2->right.sym == &symbol_no) || expr_join_and()
451 (e2->type == E_SYMBOL && e1->type == E_UNEQUAL && e1->right.sym == &symbol_no)) expr_join_and()
455 if ((e1->type == E_SYMBOL && e2->type == E_UNEQUAL && e2->right.sym == &symbol_mod) || expr_join_and()
456 (e2->type == E_SYMBOL && e1->type == E_UNEQUAL && e1->right.sym == &symbol_mod)) expr_join_and()
463 sym2 = e1->right.sym; expr_join_and()
464 if ((e2->right.sym->flags & SYMBOL_CONST) && (sym2->flags & SYMBOL_CONST)) expr_join_and()
465 return sym2 != e2->right.sym ? expr_alloc_comp(E_EQUAL, sym1, sym2) expr_join_and()
470 sym2 = e2->right.sym; expr_join_and()
471 if ((e1->right.sym->flags & SYMBOL_CONST) && (sym2->flags & SYMBOL_CONST)) expr_join_and()
472 return sym2 != e1->right.sym ? expr_alloc_comp(E_EQUAL, sym1, sym2) expr_join_and()
476 ((e1->right.sym == &symbol_yes && e2->right.sym == &symbol_no) || expr_join_and()
477 (e1->right.sym == &symbol_no && e2->right.sym == &symbol_yes))) expr_join_and()
482 ((e1->right.sym == &symbol_yes && e2->right.sym == &symbol_mod) || expr_join_and()
483 (e1->right.sym == &symbol_mod && e2->right.sym == &symbol_yes))) expr_join_and()
488 ((e1->right.sym == &symbol_mod && e2->right.sym == &symbol_no) || expr_join_and()
489 (e1->right.sym == &symbol_no && e2->right.sym == &symbol_mod))) expr_join_and()
493 if ((e1->type == E_SYMBOL && e2->type == E_EQUAL && e2->right.sym == &symbol_mod) || expr_join_and()
494 (e2->type == E_SYMBOL && e1->type == E_EQUAL && e1->right.sym == &symbol_mod) || expr_join_and()
495 (e1->type == E_SYMBOL && e2->type == E_UNEQUAL && e2->right.sym == &symbol_yes) || expr_join_and()
496 (e2->type == E_SYMBOL && e1->type == E_UNEQUAL && e1->right.sym == &symbol_yes)) expr_join_and()
518 expr_eliminate_dups1(type, &e1->right.expr, &e2); expr_eliminate_dups1()
523 expr_eliminate_dups1(type, &e1, &e2->right.expr); expr_eliminate_dups1()
570 expr_eliminate_dups2(type, &e1->right.expr, &e2); expr_eliminate_dups2()
575 expr_eliminate_dups2(type, &e1, &e2->right.expr); expr_eliminate_dups2()
656 e->right.expr = expr_transform(e->right.expr); expr_transform()
663 if (e->right.sym == &symbol_no) { expr_transform()
666 e->right.sym = NULL; expr_transform()
669 if (e->right.sym == &symbol_mod) { expr_transform()
673 e->right.sym = NULL; expr_transform()
676 if (e->right.sym == &symbol_yes) { expr_transform()
678 e->right.sym = NULL; expr_transform()
685 if (e->right.sym == &symbol_no) { expr_transform()
687 e->right.sym = NULL; expr_transform()
690 if (e->right.sym == &symbol_mod) { expr_transform()
694 e->right.sym = NULL; expr_transform()
697 if (e->right.sym == &symbol_yes) { expr_transform()
700 e->right.sym = NULL; expr_transform()
726 e->right.expr = expr_alloc_one(E_NOT, tmp->right.expr); expr_transform()
728 tmp->right.expr = NULL; expr_transform()
735 e->right.expr = expr_alloc_one(E_NOT, tmp->right.expr); expr_transform()
737 tmp->right.expr = NULL; expr_transform()
788 expr_contains_symbol(dep->right.expr, sym); expr_contains_symbol()
794 dep->right.sym == sym; expr_contains_symbol()
811 expr_depends_symbol(dep->right.expr, sym); expr_depends_symbol()
816 if (dep->right.sym == &symbol_yes || dep->right.sym == &symbol_mod) expr_depends_symbol()
822 if (dep->right.sym == &symbol_no) expr_depends_symbol()
860 expr_extract_eq(type, ep, &e1->right.expr, &e2); expr_extract_eq()
865 expr_extract_eq(type, ep, ep1, &e2->right.expr); expr_extract_eq()
896 e2 = expr_trans_compare(e->right.expr, E_EQUAL, sym); expr_trans_compare()
906 e2 = expr_trans_compare(e->right.expr, E_EQUAL, sym); expr_trans_compare()
958 val2 = expr_calc_value(e->right.expr); expr_calc_value()
962 val2 = expr_calc_value(e->right.expr); expr_calc_value()
969 sym_calc_value(e->right.sym); expr_calc_value()
971 str2 = sym_get_string_value(e->right.sym); expr_calc_value()
975 sym_calc_value(e->right.sym); expr_calc_value()
977 str2 = sym_get_string_value(e->right.sym); expr_calc_value()
1038 expr_simplify_unmet_dep(e1->right.expr, e2)); expr_simplify_unmet_dep()
1081 fn(data, e->right.sym, e->right.sym->name); expr_print()
1089 fn(data, e->right.sym, e->right.sym->name); expr_print()
1094 expr_print(e->right.expr, fn, data, E_OR); expr_print()
1099 expr_print(e->right.expr, fn, data, E_AND); expr_print()
1102 fn(data, e->right.sym, e->right.sym->name); expr_print()
1112 fn(data, e->right.sym, e->right.sym->name); expr_print()
/linux-4.1.27/drivers/md/persistent-data/
H A Ddm-btree-remove.c25 * Each node may have a left or right sibling. When decending the spine,
33 * ==> rebalance(node, right sibling)
35 * [C] No right sibling
38 * [D] Both siblings, total_entries(left, node, right) <= DEL_THRESHOLD
39 * ==> delete node adding it's contents to left and right
41 * [E] Both siblings, total_entries(left, node, right) > DEL_THRESHOLD
42 * ==> rebalance(left, node, right)
82 static void node_copy(struct btree_node *left, struct btree_node *right, int shift) node_copy() argument
86 BUG_ON(value_size != le32_to_cpu(right->header.value_size)); node_copy()
92 key_ptr(right, 0), node_copy()
95 value_ptr(right, 0), node_copy()
98 BUG_ON(shift > le32_to_cpu(right->header.max_entries)); node_copy()
99 memcpy(key_ptr(right, 0), node_copy()
102 memcpy(value_ptr(right, 0), node_copy()
173 static void shift(struct btree_node *left, struct btree_node *right, int count) shift() argument
176 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); shift()
178 uint32_t r_max_entries = le32_to_cpu(right->header.max_entries); shift()
188 node_shift(right, count); shift()
189 node_copy(left, right, count); shift()
191 node_copy(left, right, count); shift()
192 node_shift(right, count); shift()
196 right->header.nr_entries = cpu_to_le32(nr_right + count); shift()
203 struct btree_node *right = r->n; __rebalance2() local
205 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); __rebalance2()
212 node_copy(left, right, -nr_right); __rebalance2()
217 * We need to decrement the right block, but not it's __rebalance2()
226 shift(left, right, nr_left - target_left); __rebalance2()
227 *key_ptr(parent, r->index) = right->keys[0]; __rebalance2()
236 struct child left, right; rebalance2() local
244 r = init_child(info, vt, parent, left_index + 1, &right); rebalance2()
250 __rebalance2(info, parent, &left, &right); rebalance2()
254 exit_child(info, &right); rebalance2()
258 return exit_child(info, &right); rebalance2()
263 * in right, then rebalance2. This wastes some cpu, but I want something
268 struct btree_node *left, struct btree_node *center, struct btree_node *right, delete_center_node()
281 node_shift(right, shift); delete_center_node()
282 node_copy(center, right, shift); delete_center_node()
283 right->header.nr_entries = cpu_to_le32(nr_right + shift); delete_center_node()
285 *key_ptr(parent, r->index) = right->keys[0]; delete_center_node()
299 struct btree_node *left, struct btree_node *center, struct btree_node *right, redistribute3()
319 shift(left, right, s); redistribute3()
324 shift(center, right, target_right - nr_right); redistribute3()
330 shift(center, right, nr_center); redistribute3()
332 shift(left, right, s); redistribute3()
335 shift(center, right, s); redistribute3()
341 *key_ptr(parent, r->index) = right->keys[0]; redistribute3()
349 struct btree_node *right = r->n; __rebalance3() local
353 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); __rebalance3()
358 BUG_ON(center->header.max_entries != right->header.max_entries); __rebalance3()
361 delete_center_node(info, parent, l, c, r, left, center, right, __rebalance3()
364 redistribute3(info, parent, l, c, r, left, center, right, __rebalance3()
373 struct child left, center, right; rebalance3() local
388 r = init_child(info, vt, parent, left_index + 2, &right); rebalance3()
395 __rebalance3(info, parent, &left, &center, &right); rebalance3()
400 exit_child(info, &right); rebalance3()
406 exit_child(info, &right); rebalance3()
410 r = exit_child(info, &right); rebalance3()
266 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) delete_center_node() argument
297 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) redistribute3() argument
H A Ddm-btree.c429 struct dm_block *left, *right, *parent; btree_split_sibling() local
435 r = new_block(s->info, &right); btree_split_sibling()
440 rn = dm_block_data(right); btree_split_sibling()
469 location = cpu_to_le64(dm_block_location(right)); btree_split_sibling()
478 unlock_block(s->info, right); btree_split_sibling()
482 s->nodes[1] = right; btree_split_sibling()
514 struct dm_block *left, *right, *new_parent; btree_split_beneath() local
524 r = new_block(s->info, &right); btree_split_beneath()
532 rn = dm_block_data(right); btree_split_beneath()
570 val = cpu_to_le64(dm_block_location(right)); btree_split_beneath()
584 unlock_block(s->info, right); btree_split_beneath()
588 s->nodes[1] = right; btree_split_beneath()
/linux-4.1.27/fs/quota/
H A Dkqid.c8 * @right: Another quid value
12 bool qid_eq(struct kqid left, struct kqid right) qid_eq() argument
14 if (left.type != right.type) qid_eq()
18 return uid_eq(left.uid, right.uid); qid_eq()
20 return gid_eq(left.gid, right.gid); qid_eq()
22 return projid_eq(left.projid, right.projid); qid_eq()
32 * @right: The possibly greater qid value
34 * Return true if left is less than right and false otherwise.
36 bool qid_lt(struct kqid left, struct kqid right) qid_lt() argument
38 if (left.type < right.type) qid_lt()
40 if (left.type > right.type) qid_lt()
44 return uid_lt(left.uid, right.uid); qid_lt()
46 return gid_lt(left.gid, right.gid); qid_lt()
48 return projid_lt(left.projid, right.projid); qid_lt()
/linux-4.1.27/include/linux/
H A Duidgid.h60 static inline bool uid_eq(kuid_t left, kuid_t right) uid_eq() argument
62 return __kuid_val(left) == __kuid_val(right); uid_eq()
65 static inline bool gid_eq(kgid_t left, kgid_t right) gid_eq() argument
67 return __kgid_val(left) == __kgid_val(right); gid_eq()
70 static inline bool uid_gt(kuid_t left, kuid_t right) uid_gt() argument
72 return __kuid_val(left) > __kuid_val(right); uid_gt()
75 static inline bool gid_gt(kgid_t left, kgid_t right) gid_gt() argument
77 return __kgid_val(left) > __kgid_val(right); gid_gt()
80 static inline bool uid_gte(kuid_t left, kuid_t right) uid_gte() argument
82 return __kuid_val(left) >= __kuid_val(right); uid_gte()
85 static inline bool gid_gte(kgid_t left, kgid_t right) gid_gte() argument
87 return __kgid_val(left) >= __kgid_val(right); gid_gte()
90 static inline bool uid_lt(kuid_t left, kuid_t right) uid_lt() argument
92 return __kuid_val(left) < __kuid_val(right); uid_lt()
95 static inline bool gid_lt(kgid_t left, kgid_t right) gid_lt() argument
97 return __kgid_val(left) < __kgid_val(right); gid_lt()
100 static inline bool uid_lte(kuid_t left, kuid_t right) uid_lte() argument
102 return __kuid_val(left) <= __kuid_val(right); uid_lte()
105 static inline bool gid_lte(kgid_t left, kgid_t right) gid_lte() argument
107 return __kgid_val(left) <= __kgid_val(right); gid_lte()
H A Dprojid.h35 static inline bool projid_eq(kprojid_t left, kprojid_t right) projid_eq() argument
37 return __kprojid_val(left) == __kprojid_val(right); projid_eq()
40 static inline bool projid_lt(kprojid_t left, kprojid_t right) projid_lt() argument
42 return __kprojid_val(left) < __kprojid_val(right); projid_lt()
H A Dgpio_mouse.h33 * @right: GPIO line for right value.
36 * @bright: GPIO line for right button.
51 int right; member in struct:gpio_mouse_platform_data::__anon11713::__anon11714
H A Dsuspend.h107 * conditions aren't right.
112 * @begin() is executed right prior to suspending devices. The information
121 * @prepare() is called right after devices have been suspended (ie. the
142 * @wake: Called when the system has just left a sleep state, right after
150 * @finish is called right prior to calling device drivers' regular suspend
164 * @end: Called by the PM core right after resuming devices, to indicate to
273 * Called right after shrinking memory and before freezing devices.
275 * @end: Called by the PM core right after resuming devices, to indicate to
279 * Called right after devices have been frozen and before the nonboot
285 * Called right after the nonboot CPUs have been enabled and before
289 * Called right after the hibernation image has been saved and before
299 * Called right after the control has been passed from the boot kernel to
304 * Called right after devices have been frozen and before the nonboot
308 * Called right after the nonboot CPUs have been enabled and before
H A Dinterval_tree_generic.h122 * right of N can't satisfy Cond1 either. \
166 * First, search right subtree if suitable \
169 ITSTRUCT *right = rb_entry(rb, ITSTRUCT, ITRB); \
170 if (start <= right->ITSUBTREE) \
171 return ITPREFIX ## _subtree_search(right, \
H A Dscx200_gpio.h29 state of the GPIO right now if the GPIO is configured as an input) */
H A Datmel-mci.h23 * might get upset if we don't get the clock management exactly right.
H A Dbitops.h94 * ror64 - rotate a 64-bit value right
114 * ror32 - rotate a 32-bit value right
134 * ror16 - rotate a 16-bit value right
154 * ror8 - rotate an 8-bit value right
H A Dkobject_ns.h36 * @netlink_ns: return namespace to which a sock belongs (right?)
/linux-4.1.27/arch/x86/crypto/
H A Ddes3_ede-asm_64.S101 #define initial_permutation(left, right) \
102 do_permutation(left##d, right##d, 4, 0x0f0f0f0f); \
103 do_permutation(left##d, right##d, 16, 0x0000ffff); \
104 do_permutation(right##d, left##d, 2, 0x33333333); \
105 do_permutation(right##d, left##d, 8, 0x00ff00ff); \
108 roll $1, right##d; \
109 xorl right##d, RW0d; \
112 xorl RW0d, right##d; \
114 expand_to_64bits(right, RT3); \
117 #define final_permutation(left, right) \
118 compress_to_64bits(right); \
120 movl right##d, RW0d; \
124 xorl RW0d, right##d; \
126 rorl $1, right##d; \
127 do_permutation(right##d, left##d, 8, 0x00ff00ff); \
128 do_permutation(right##d, left##d, 2, 0x33333333); \
129 do_permutation(left##d, right##d, 16, 0x0000ffff); \
130 do_permutation(left##d, right##d, 4, 0x0f0f0f0f);
162 #define read_block(io, left, right) \
164 movl 4(io), right##d; \
166 bswapl right##d;
168 #define write_block(io, left, right) \
170 bswapl right##d; \
172 movl right##d, 4(io);
272 #define initial_permutation3(left, right) \
273 do_permutation(left##0d, right##0d, 4, 0x0f0f0f0f); \
274 do_permutation(left##0d, right##0d, 16, 0x0000ffff); \
275 do_permutation(left##1d, right##1d, 4, 0x0f0f0f0f); \
276 do_permutation(left##1d, right##1d, 16, 0x0000ffff); \
277 do_permutation(left##2d, right##2d, 4, 0x0f0f0f0f); \
278 do_permutation(left##2d, right##2d, 16, 0x0000ffff); \
280 do_permutation(right##0d, left##0d, 2, 0x33333333); \
281 do_permutation(right##0d, left##0d, 8, 0x00ff00ff); \
282 do_permutation(right##1d, left##1d, 2, 0x33333333); \
283 do_permutation(right##1d, left##1d, 8, 0x00ff00ff); \
284 do_permutation(right##2d, left##2d, 2, 0x33333333); \
285 do_permutation(right##2d, left##2d, 8, 0x00ff00ff); \
290 roll $1, right##0d; \
291 xorl right##0d, RW0d; \
294 xorl RW0d, right##0d; \
296 expand_to_64bits(right##0, RT3); \
299 roll $1, right##1d; \
300 xorl right##1d, RW1d; \
303 xorl RW1d, right##1d; \
305 expand_to_64bits(right##1, RT3); \
308 roll $1, right##2d; \
309 xorl right##2d, RW2d; \
312 xorl RW2d, right##2d; \
314 expand_to_64bits(right##2, RT3); \
317 #define final_permutation3(left, right) \
318 compress_to_64bits(right##0); \
320 movl right##0d, RW0d; \
324 xorl RW0d, right##0d; \
326 rorl $1, right##0d; \
327 compress_to_64bits(right##1); \
329 movl right##1d, RW1d; \
333 xorl RW1d, right##1d; \
335 rorl $1, right##1d; \
336 compress_to_64bits(right##2); \
338 movl right##2d, RW2d; \
342 xorl RW2d, right##2d; \
344 rorl $1, right##2d; \
346 do_permutation(right##0d, left##0d, 8, 0x00ff00ff); \
347 do_permutation(right##0d, left##0d, 2, 0x33333333); \
348 do_permutation(right##1d, left##1d, 8, 0x00ff00ff); \
349 do_permutation(right##1d, left##1d, 2, 0x33333333); \
350 do_permutation(right##2d, left##2d, 8, 0x00ff00ff); \
351 do_permutation(right##2d, left##2d, 2, 0x33333333); \
353 do_permutation(left##0d, right##0d, 16, 0x0000ffff); \
354 do_permutation(left##0d, right##0d, 4, 0x0f0f0f0f); \
355 do_permutation(left##1d, right##1d, 16, 0x0000ffff); \
356 do_permutation(left##1d, right##1d, 4, 0x0f0f0f0f); \
357 do_permutation(left##2d, right##2d, 16, 0x0000ffff); \
358 do_permutation(left##2d, right##2d, 4, 0x0f0f0f0f);
/linux-4.1.27/include/net/netns/
H A Dhash.h12 * shift this right to eliminate bits, that are net_hash_mix()
H A Dsctp.h47 * RTO.Alpha - 1/8 (3 when converted to right shifts.)
48 * RTO.Beta - 1/4 (2 when converted to right shifts.)
/linux-4.1.27/drivers/video/fbdev/core/
H A Dsyscopyarea.c33 int left, right; bitcpy() local
80 right = shift & (bits - 1); bitcpy()
92 *dst = comp(*src >> right, *dst, first); bitcpy()
97 *dst = comp(d0 >> right | d1 << left, *dst, bitcpy()
118 *dst = comp(d0 >> right | d1 << left, *dst, bitcpy()
130 *dst++ = d0 >> right | d1 << left; bitcpy()
133 *dst++ = d0 >> right | d1 << left; bitcpy()
136 *dst++ = d0 >> right | d1 << left; bitcpy()
139 *dst++ = d0 >> right | d1 << left; bitcpy()
145 *dst++ = d0 >> right | d1 << left; bitcpy()
151 if (m <= bits - right) { bitcpy()
153 d0 >>= right; bitcpy() local
157 d0 = d0 >> right | d1 << left; bitcpy()
228 int const right = -shift & (bits-1); bitcpy_rev() local
236 *dst = comp(*src >> right, *dst, last); bitcpy_rev()
242 *dst = comp(*src << left | *(src-1) >> right, bitcpy_rev()
261 d0 >>= right; bitcpy_rev() local
265 d0 = d0 << left | d1 >> right; bitcpy_rev()
280 *dst-- = d0 << left | d1 >> right; bitcpy_rev()
283 *dst-- = d0 << left | d1 >> right; bitcpy_rev()
286 *dst-- = d0 << left | d1 >> right; bitcpy_rev()
289 *dst-- = d0 << left | d1 >> right; bitcpy_rev()
295 *dst-- = d0 << left | d1 >> right; bitcpy_rev()
307 d0 = d0 << left | d1 >> right; bitcpy_rev()
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) bitfill_unaligned()
114 pat = pat << left | pat >> right; bitfill_unaligned()
122 pat = pat << left | pat >> right; bitfill_unaligned()
124 pat = pat << left | pat >> right; bitfill_unaligned()
126 pat = pat << left | pat >> right; bitfill_unaligned()
128 pat = pat << left | pat >> right; bitfill_unaligned()
133 pat = pat << left | pat >> right; bitfill_unaligned()
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, bitfill_unaligned_rev()
243 pat = pat << left | pat >> right; bitfill_unaligned_rev()
252 pat = pat << left | pat >> right; bitfill_unaligned_rev()
255 pat = pat << left | pat >> right; bitfill_unaligned_rev()
258 pat = pat << left | pat >> right; bitfill_unaligned_rev()
261 pat = pat << left | pat >> right; bitfill_unaligned_rev()
267 pat = pat << left | pat >> right; bitfill_unaligned_rev()
332 int right, r; cfb_fillrect() local
335 int right, unsigned n, int bits) = NULL; cfb_fillrect()
337 right = left; cfb_fillrect()
338 left = bpp - right; cfb_fillrect()
340 right = bpp - left; cfb_fillrect()
360 fill_op(p, dst, dst_idx, pat2, left, right, cfb_fillrect()
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) bitfill_unaligned() 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) bitfill_unaligned_rev() argument
H A Dsysfillrect.c76 * Left/right are the appropriate shifts to convert to the pattern to be
82 unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned()
103 pat = pat << left | pat >> right; bitfill_unaligned()
111 pat = pat << left | pat >> right; bitfill_unaligned()
113 pat = pat << left | pat >> right; bitfill_unaligned()
115 pat = pat << left | pat >> right; bitfill_unaligned()
117 pat = pat << left | pat >> right; bitfill_unaligned()
122 pat = pat << left | pat >> right; bitfill_unaligned()
186 * Left/right are the appropriate shifts to convert to the pattern to be
192 unsigned long pat, int left, int right, unsigned n, bitfill_unaligned_rev()
215 pat = pat << left | pat >> right; bitfill_unaligned_rev()
223 pat = pat << left | pat >> right; bitfill_unaligned_rev()
225 pat = pat << left | pat >> right; bitfill_unaligned_rev()
227 pat = pat << left | pat >> right; bitfill_unaligned_rev()
229 pat = pat << left | pat >> right; bitfill_unaligned_rev()
234 pat = pat << left | pat >> right; bitfill_unaligned_rev()
295 int right, r; sys_fillrect() local
298 int right, unsigned n, int bits) = NULL; sys_fillrect()
300 right = left; sys_fillrect()
301 left = bpp - right; sys_fillrect()
303 right = bpp - left; sys_fillrect()
324 fill_op(p, dst, dst_idx, pat2, left, right, sys_fillrect()
81 bitfill_unaligned(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned() argument
191 bitfill_unaligned_rev(struct fb_info *p, unsigned long *dst, int dst_idx, unsigned long pat, int left, int right, unsigned n, int bits) bitfill_unaligned_rev() argument
H A Dcfbcopyarea.c111 int const right = -shift & (bits - 1); bitcpy() local
124 d0 >>= right; bitcpy() local
129 d0 = d0 >> right | d1 << left; bitcpy()
153 d0 = d0 >> right | d1 << left; bitcpy()
166 FB_WRITEL(d0 >> right | d1 << left, dst++); bitcpy()
169 FB_WRITEL(d0 >> right | d1 << left, dst++); bitcpy()
172 FB_WRITEL(d0 >> right | d1 << left, dst++); bitcpy()
175 FB_WRITEL(d0 >> right | d1 << left, dst++); bitcpy()
182 d0 = d0 >> right | d1 << left; bitcpy()
190 if (m <= bits - right) { bitcpy()
192 d0 >>= right; bitcpy() local
198 d0 = d0 >> right | d1 << left; bitcpy()
284 int const right = -shift & (bits-1); bitcpy_rev() local
293 d0 >>= right; bitcpy_rev() local
301 d0 = d0 << left | d1 >> right; bitcpy_rev()
319 d0 >>= right; bitcpy_rev() local
324 d0 = d0 << left | d1 >> right; bitcpy_rev()
340 FB_WRITEL(d0 << left | d1 >> right, dst--); bitcpy_rev()
343 FB_WRITEL(d0 << left | d1 >> right, dst--); bitcpy_rev()
346 FB_WRITEL(d0 << left | d1 >> right, dst--); bitcpy_rev()
349 FB_WRITEL(d0 << left | d1 >> right, dst--); bitcpy_rev()
356 d0 = d0 << left | d1 >> right; bitcpy_rev()
372 d0 = d0 << left | d1 >> right; bitcpy_rev()
/linux-4.1.27/include/sound/
H A Dak4531_codec.h41 #define AK4531_RMASTER 0x01 /* master volume right */
43 #define AK4531_RVOICE 0x03 /* channel volume right */
45 #define AK4531_RFM 0x05 /* FM volume right */
47 #define AK4531_RCD 0x07 /* CD volume right */
49 #define AK4531_RLINE 0x09 /* LINE volume right */
51 #define AK4531_RAUXA 0x0b /* AUXA volume right */
53 #define AK4531_MONO2 0x0d /* MONO1 volume right */
59 #define AK4531_RIN_SW1 0x13 /* Input right mixer switch 1 */
61 #define AK4531_RIN_SW2 0x15 /* Input right mixer switch 2 */
H A Dcs4231-regs.h37 #define CS4231_RIGHT_INPUT 0x01 /* right input control */
39 #define CS4231_AUX1_RIGHT_INPUT 0x03 /* right AUX1 input control */
41 #define CS4231_AUX2_RIGHT_INPUT 0x05 /* right AUX2 input control */
43 #define CS4231_RIGHT_OUTPUT 0x07 /* right output control register */
55 #define AD1845_AF2_MIC_RIGHT 0x11 /* alternate #2 feature + MIC right */
57 #define CS4231_RIGHT_LINE_IN 0x13 /* right line input control */
62 #define CS4231_RIGHT_MIC_INPUT 0x17 /* right MIC input control register (InterWave only) */
69 #define CS4231_LINE_RIGHT_OUTPUT 0x1b /* right line output control register (InterWave only) */
74 #define CS4235_RIGHT_MASTER 0x1d /* right master output control */
160 #define CS4236_RIGHT_LINE 0x18 /* right LINE alternate volume */
162 #define CS4236_RIGHT_MIC 0x38 /* right MIC volume */
164 #define CS4236_RIGHT_MIX_CTRL 0x58 /* right input mixer control */
166 #define CS4236_RIGHT_FM 0x78 /* right FM volume */
168 #define CS4236_RIGHT_DSP 0x98 /* right DSP serial port volume */
169 #define CS4236_RIGHT_LOOPBACK 0xa8 /* right loopback monitor volume */
174 #define CS4236_RIGHT_MASTER 0xf8 /* right master digital audio volume */
176 #define CS4236_RIGHT_WAVE 0x1c /* right wavetable serial port volume */
H A Daci.h31 /* These are the values for the right channel GET registers.
33 (left=right+0x01) */
52 /* And these are the values for the right channel SET registers.
H A Dmixer_oss.h36 int *left, int *right);
39 int left, int right);
H A Dhda_regmap.h38 * @ch: channel (left = 0, right = 1)
121 * @ch: channel (left=0 or right=1)
144 * @ch: channel (left=0 or right=1)
166 * @ch: channel (left=0 or right=1)
171 * Read stereo AMP values. The lower byte is left, the upper byte is right.
195 * The lower byte is left, the upper byte is right.
H A Dak4117.h102 #define AK4117_DIF_16R (0) /* STDO: 16-bit, right justified */
103 #define AK4117_DIF_18R (AK4117_DIF0) /* STDO: 18-bit, right justified */
104 #define AK4117_DIF_20R (AK4117_DIF1) /* STDO: 20-bit, right justified */
105 #define AK4117_DIF_24R (AK4117_DIF1|AK4117_DIF0) /* STDO: 24-bit, right justified */
H A Dcs8427.h103 #define CS8427_SIRESMASK (3<<4) /* Resolution of the input data for right justified formats */
107 #define CS8427_SIJUST (1<<3) /* Justification of SDIN data relative to ILRCK, 0 = left-justified, 1 = right-justified */
110 #define CS8427_SILRPOL (1<<0) /* ILRCK clock polarity, 0 = SDIN data left channel when ILRCK is high, 1 = SDIN right when ILRCK is high */
120 #define CS8427_SOJUST (1<<3) /* Justification of SDOUT data relative to OLRCK, 0 = left-justified, 1 = right-justified */
123 #define CS8427_SOLRPOL (1<<0) /* OLRCK clock polarity, 0 = SDOUT data left channel when OLRCK is high, 1 = SDOUT right when OLRCK is high */
H A Dopl3.h12 * of the right side.
14 * Another special register at the right side is at offset 4. It contains
22 * bit at offset 4 of the right side.
25 * first voice on the right side to the 4 OP mode. The fourth
30 * be connected the left, right or both stereo channels. It can
/linux-4.1.27/tools/perf/util/
H A Dsort.c64 sort__thread_cmp(struct hist_entry *left, struct hist_entry *right) sort__thread_cmp() argument
66 return right->thread->tid - left->thread->tid; sort__thread_cmp()
89 sort__comm_cmp(struct hist_entry *left, struct hist_entry *right) sort__comm_cmp() argument
92 return comm__str(right->comm) - comm__str(left->comm); sort__comm_cmp()
96 sort__comm_collapse(struct hist_entry *left, struct hist_entry *right) sort__comm_collapse() argument
99 return comm__str(right->comm) - comm__str(left->comm); sort__comm_collapse()
103 sort__comm_sort(struct hist_entry *left, struct hist_entry *right) sort__comm_sort() argument
105 return strcmp(comm__str(right->comm), comm__str(left->comm)); sort__comm_sort()
146 sort__dso_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_cmp() argument
148 return _sort__dso_cmp(right->ms.map, left->ms.map); sort__dso_cmp()
200 sort__sym_cmp(struct hist_entry *left, struct hist_entry *right) sort__sym_cmp() argument
204 if (!left->ms.sym && !right->ms.sym) sort__sym_cmp()
205 return _sort__addr_cmp(left->ip, right->ip); sort__sym_cmp()
212 ret = sort__dso_cmp(left, right); sort__sym_cmp()
217 return _sort__sym_cmp(left->ms.sym, right->ms.sym); sort__sym_cmp()
221 sort__sym_sort(struct hist_entry *left, struct hist_entry *right) sort__sym_sort() argument
223 if (!left->ms.sym || !right->ms.sym) sort__sym_sort()
224 return cmp_null(left->ms.sym, right->ms.sym); sort__sym_sort()
226 return strcmp(right->ms.sym->name, left->ms.sym->name); sort__sym_sort()
286 sort__srcline_cmp(struct hist_entry *left, struct hist_entry *right) sort__srcline_cmp() argument
298 if (!right->srcline) { sort__srcline_cmp()
299 if (!right->ms.map) sort__srcline_cmp()
300 right->srcline = SRCLINE_UNKNOWN; sort__srcline_cmp()
302 struct map *map = right->ms.map; sort__srcline_cmp()
303 right->srcline = get_srcline(map->dso, sort__srcline_cmp()
304 map__rip_2objdump(map, right->ip), sort__srcline_cmp()
305 right->ms.sym, true); sort__srcline_cmp()
308 return strcmp(right->srcline, left->srcline); sort__srcline_cmp()
327 sort__parent_cmp(struct hist_entry *left, struct hist_entry *right) sort__parent_cmp() argument
330 struct symbol *sym_r = right->parent; sort__parent_cmp()
355 sort__cpu_cmp(struct hist_entry *left, struct hist_entry *right) sort__cpu_cmp() argument
357 return right->cpu - left->cpu; sort__cpu_cmp()
376 sort__dso_from_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_from_cmp() argument
378 if (!left->branch_info || !right->branch_info) sort__dso_from_cmp()
379 return cmp_null(left->branch_info, right->branch_info); sort__dso_from_cmp()
382 right->branch_info->from.map); sort__dso_from_cmp()
396 sort__dso_to_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_to_cmp() argument
398 if (!left->branch_info || !right->branch_info) sort__dso_to_cmp()
399 return cmp_null(left->branch_info, right->branch_info); sort__dso_to_cmp()
402 right->branch_info->to.map); sort__dso_to_cmp()
416 sort__sym_from_cmp(struct hist_entry *left, struct hist_entry *right) sort__sym_from_cmp() argument
419 struct addr_map_symbol *from_r = &right->branch_info->from; sort__sym_from_cmp()
421 if (!left->branch_info || !right->branch_info) sort__sym_from_cmp()
422 return cmp_null(left->branch_info, right->branch_info); sort__sym_from_cmp()
425 from_r = &right->branch_info->from; sort__sym_from_cmp()
434 sort__sym_to_cmp(struct hist_entry *left, struct hist_entry *right) sort__sym_to_cmp() argument
438 if (!left->branch_info || !right->branch_info) sort__sym_to_cmp()
439 return cmp_null(left->branch_info, right->branch_info); sort__sym_to_cmp()
442 to_r = &right->branch_info->to; sort__sym_to_cmp()
505 sort__mispredict_cmp(struct hist_entry *left, struct hist_entry *right) sort__mispredict_cmp() argument
509 if (!left->branch_info || !right->branch_info) sort__mispredict_cmp()
510 return cmp_null(left->branch_info, right->branch_info); sort__mispredict_cmp()
512 mp = left->branch_info->flags.mispred != right->branch_info->flags.mispred; sort__mispredict_cmp()
513 p = left->branch_info->flags.predicted != right->branch_info->flags.predicted; sort__mispredict_cmp()
533 sort__daddr_cmp(struct hist_entry *left, struct hist_entry *right) sort__daddr_cmp() argument
539 if (right->mem_info) sort__daddr_cmp()
540 r = right->mem_info->daddr.addr; sort__daddr_cmp()
562 sort__dso_daddr_cmp(struct hist_entry *left, struct hist_entry *right) sort__dso_daddr_cmp() argument
569 if (right->mem_info) sort__dso_daddr_cmp()
570 map_r = right->mem_info->daddr.map; sort__dso_daddr_cmp()
587 sort__locked_cmp(struct hist_entry *left, struct hist_entry *right) sort__locked_cmp() argument
597 if (right->mem_info) sort__locked_cmp()
598 data_src_r = right->mem_info->data_src; sort__locked_cmp()
625 sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right) sort__tlb_cmp() argument
635 if (right->mem_info) sort__tlb_cmp()
636 data_src_r = right->mem_info->data_src; sort__tlb_cmp()
695 sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right) sort__lvl_cmp() argument
705 if (right->mem_info) sort__lvl_cmp()
706 data_src_r = right->mem_info->data_src; sort__lvl_cmp()
772 sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right) sort__snoop_cmp() argument
782 if (right->mem_info) sort__snoop_cmp()
783 data_src_r = right->mem_info->data_src; sort__snoop_cmp()
836 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right) sort__dcacheline_cmp() argument
842 if (!right->mem_info) return 1; sort__dcacheline_cmp()
845 if (left->cpumode > right->cpumode) return -1; sort__dcacheline_cmp()
846 if (left->cpumode < right->cpumode) return 1; sort__dcacheline_cmp()
849 r_map = right->mem_info->daddr.map; sort__dcacheline_cmp()
884 if (left->thread->pid_ > right->thread->pid_) return -1; sort__dcacheline_cmp()
885 if (left->thread->pid_ < right->thread->pid_) return 1; sort__dcacheline_cmp()
889 /* al_addr does all the right addr - start + offset calculations */ sort__dcacheline_cmp()
891 r = cl_address(right->mem_info->daddr.al_addr); sort__dcacheline_cmp()
940 sort__local_weight_cmp(struct hist_entry *left, struct hist_entry *right) sort__local_weight_cmp() argument
942 return he_weight(left) - he_weight(right); sort__local_weight_cmp()
959 sort__global_weight_cmp(struct hist_entry *left, struct hist_entry *right) sort__global_weight_cmp() argument
961 return left->stat.weight - right->stat.weight; sort__global_weight_cmp()
1027 sort__abort_cmp(struct hist_entry *left, struct hist_entry *right) sort__abort_cmp() argument
1029 if (!left->branch_info || !right->branch_info) sort__abort_cmp()
1030 return cmp_null(left->branch_info, right->branch_info); sort__abort_cmp()
1033 right->branch_info->flags.abort; sort__abort_cmp()
1059 sort__in_tx_cmp(struct hist_entry *left, struct hist_entry *right) sort__in_tx_cmp() argument
1061 if (!left->branch_info || !right->branch_info) sort__in_tx_cmp()
1062 return cmp_null(left->branch_info, right->branch_info); sort__in_tx_cmp()
1065 right->branch_info->flags.in_tx; sort__in_tx_cmp()
1091 sort__transaction_cmp(struct hist_entry *left, struct hist_entry *right) sort__transaction_cmp() argument
1093 return left->transaction - right->transaction; sort__transaction_cmp()
H A Dstrfilter.h11 struct strfilter_node *r; /* Tree right branche (for !,&,|) */
/linux-4.1.27/sound/oss/
H A Dpas2_mixer.c81 int right = right_vol * div / 100; mixer_output() local
87 right |= mixer; mixer_output()
99 mix_write(right, 0x078B); mixer_output()
117 int left, right, devmask, changed, i, mixer = 0; pas_mixer_set() local
120 right = (level & 0x7f00) >> 8; pas_mixer_set()
132 levels[whichDev] = mixer_output(right, left, 63, 0x01, 0); pas_mixer_set()
140 levels[whichDev] = mixer_output(right, left, 12, 0x03, 0); pas_mixer_set()
143 levels[whichDev] = mixer_output(right, left, 12, 0x04, 0); pas_mixer_set()
147 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x00, mixer); pas_mixer_set()
150 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x05, mixer); pas_mixer_set()
153 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x07, mixer); pas_mixer_set()
156 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x06, mixer); pas_mixer_set()
159 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x02, mixer); pas_mixer_set()
162 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x03, mixer); pas_mixer_set()
165 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x04, mixer); pas_mixer_set()
168 levels[whichDev] = mixer_output(right, left, 31, 0x10 | 0x01, pas_mixer_set()
172 levels[whichDev] = mixer_output(right, left, 15, 0x02, 0); pas_mixer_set()
H A Dsb_mixer.c273 int sb_common_mixer_set(sb_devc * devc, int dev, int left, int right) sb_common_mixer_set() argument
307 oss_change_bits(devc, &val, dev, RIGHT_CHN, right); sb_common_mixer_set()
311 return left | (right << 8); sb_common_mixer_set()
314 static int smw_mixer_set(sb_devc * devc, int dev, int left, int right) smw_mixer_set() argument
322 sb_setmixer(devc, 0x0c, 96 - (96 * right / 100)); smw_mixer_set()
327 devc->levels[dev] = left | (right << 8); smw_mixer_set()
333 /* Set right bass and treble values */ smw_mixer_set()
348 sb_setmixer(devc, reg + 1, (24 - (24 * right / 100)) | 0x40); smw_mixer_set()
351 devc->levels[dev] = left | (right << 8); smw_mixer_set()
352 return left | (right << 8); smw_mixer_set()
358 int right = (value & 0x0000ff00) >> 8; sb_mixer_set() local
363 if (right > 100) sb_mixer_set()
364 right = 100; sb_mixer_set()
377 retval = smw_mixer_set(devc, dev, left, right); sb_mixer_set()
380 retval = ess_mixer_set(devc, dev, left, right); sb_mixer_set()
383 retval = sb_common_mixer_set(devc, dev, left, right); sb_mixer_set()
H A Dopl3_hw.h13 * of the right side.
15 * Another special register at the right side is at offset 4. It contains
23 * bit at offset 4 of the right side.
26 * first voice on the right side to the 4 OP mode. The fourth
31 * be connected the left, right or both stereo channels. It can
196 unsigned short ioaddr; /* I/O port (left or right side) */
202 * (9 in the left and 9 in the right).
/linux-4.1.27/drivers/hid/
H A Dhid-zpff.c42 int left, right; zpff_play() local
51 right = effect->u.rumble.weak_magnitude; zpff_play()
52 dbg_hid("called with 0x%04x 0x%04x\n", left, right); zpff_play()
55 right = right * 0x7f / 0xffff; zpff_play()
58 zpff->report->field[3]->value[0] = right; zpff_play()
59 dbg_hid("running with 0x%02x 0x%02x\n", left, right); zpff_play()
H A Dhid-axff.c49 int left, right; axff_play() local
53 right = effect->u.rumble.weak_magnitude; axff_play()
55 dbg_hid("called with 0x%04x 0x%04x", left, right); axff_play()
58 right = right * 0xff / 0xffff; axff_play()
63 field_count % 2 ? right : left; axff_play()
68 dbg_hid("running with 0x%02x 0x%02x", left, right); axff_play()
162 * We need to start polling device right away, otherwise ax_probe()
H A Dhid-lgff.c75 unsigned int left, right; hid_lgff_play() local
94 right = effect->u.rumble.strong_magnitude; hid_lgff_play()
96 right = right * 0xff / 0xffff; hid_lgff_play()
99 CLAMP(right); hid_lgff_play()
103 report->field[0]->value[3] = right; hid_lgff_play()
104 dbg_hid("(left, right)=(%04x, %04x)\n", left, right); hid_lgff_play()
H A Dhid-gaff.c47 int left, right; hid_gaff_play() local
50 right = effect->u.rumble.weak_magnitude; hid_gaff_play()
52 dbg_hid("called with 0x%04x 0x%04x", left, right); hid_gaff_play()
55 right = right * 0xfe / 0xffff; hid_gaff_play()
59 gaff->report->field[0]->value[2] = right; hid_gaff_play()
63 dbg_hid("running with 0x%02x 0x%02x", left, right); hid_gaff_play()
H A Dhid-sjoy.c46 u32 left, right; hid_sjoyff_play() local
49 right = effect->u.rumble.weak_magnitude; hid_sjoyff_play()
50 dev_dbg(&dev->dev, "called with 0x%08x 0x%08x\n", left, right); hid_sjoyff_play()
53 right = (right != 0); /* on/off only */ hid_sjoyff_play()
55 sjoyff->report->field[0]->value[1] = right; hid_sjoyff_play()
57 dev_dbg(&dev->dev, "running with 0x%02x 0x%02x\n", left, right); hid_sjoyff_play()
H A Dhid-holtekff.c71 * bit 6: right (weak) motor enabled
111 int left, right; holtekff_play() local
117 right = effect->u.rumble.weak_magnitude; holtekff_play()
118 dbg_hid("called with 0x%04x 0x%04x\n", left, right); holtekff_play()
120 if (!left && !right) { holtekff_play()
127 if (right) holtekff_play()
131 buf[6] = min(0xf, (left >> 12) + (right >> 12)); holtekff_play()
H A Dhid-pl.c64 int left, right; hid_plff_play() local
67 right = effect->u.rumble.weak_magnitude; hid_plff_play()
68 debug("called with 0x%04x 0x%04x", left, right); hid_plff_play()
71 right = right * plff->maxval / 0xffff; hid_plff_play()
74 *plff->weak = right; hid_plff_play()
75 debug("running with 0x%02x 0x%02x", left, right); hid_plff_play()
H A Dhid-betopff.c45 __u16 left, right; hid_betopff_play() local
48 right = effect->u.rumble.weak_magnitude; hid_betopff_play()
51 betopff->report->field[3]->value[0] = right / 256; hid_betopff_play()
H A Dhid-roccat-kone.h25 kone_keystroke_button_2 = 0xf1, /* right mouse button */
49 kone_button_info_type_button_2 = 0x2, /* menu (right mouse button)*/
64 kone_button_info_type_button_6 = 0x10, /* tilt right */
158 uint8_t tilt; /* right = 1, left = -1 */
H A Dhid-tmff.c90 int left, right; /* Rumbling */ tmff_play() local
111 right = tmff_scale_u16(effect->u.rumble.strong_magnitude, tmff_play()
115 dbg_hid("(left,right)=(%08x, %08x)\n", left, right); tmff_play()
117 ff_field->value[1] = right; tmff_play()
/linux-4.1.27/drivers/usb/core/
H A Dport.c191 static int link_peers(struct usb_port *left, struct usb_port *right) link_peers() argument
196 if (left->peer == right && right->peer == left) link_peers()
199 if (left->peer || right->peer) { link_peers()
201 struct usb_port *rpeer = right->peer; link_peers()
204 if (left->location && left->location == right->location) link_peers()
210 dev_name(&left->dev), dev_name(&right->dev), method, link_peers()
213 dev_name(&right->dev), link_peers()
218 rc = sysfs_create_link(&left->dev.kobj, &right->dev.kobj, "peer"); link_peers()
221 rc = sysfs_create_link(&right->dev.kobj, &left->dev.kobj, "peer"); link_peers()
234 WARN_ON(right->is_superspeed); link_peers()
235 hs_port = right; link_peers()
237 ss_port = right; link_peers()
238 WARN_ON(!right->is_superspeed); link_peers()
243 left->peer = right; link_peers()
244 right->peer = left; link_peers()
260 static void link_peers_report(struct usb_port *left, struct usb_port *right) link_peers_report() argument
264 rc = link_peers(left, right); link_peers_report()
266 dev_dbg(&left->dev, "peered to %s\n", dev_name(&right->dev)); link_peers_report()
269 dev_name(&right->dev), rc); link_peers_report()
275 static void unlink_peers(struct usb_port *left, struct usb_port *right) unlink_peers() argument
279 WARN(right->peer != left || left->peer != right, unlink_peers()
281 dev_name(&left->dev), dev_name(&right->dev)); unlink_peers()
290 hs_port = right; unlink_peers()
292 ss_port = right; unlink_peers()
299 right->peer = NULL; unlink_peers()
300 sysfs_remove_link(&right->dev.kobj, "peer"); unlink_peers()
/linux-4.1.27/kernel/
H A Dgroups.c117 int right = left + stride; groups_sort() local
118 kgid_t tmp = GROUP_AT(group_info, right); groups_sort()
121 GROUP_AT(group_info, right) = groups_sort()
123 right = left; groups_sort()
126 GROUP_AT(group_info, right) = tmp; groups_sort()
135 unsigned int left, right; groups_search() local
141 right = group_info->ngroups; groups_search()
142 while (left < right) { groups_search()
143 unsigned int mid = (left+right)/2; groups_search()
147 right = mid; groups_search()
H A Dauditfilter.c1126 int audit_comparator(u32 left, u32 op, u32 right) audit_comparator() argument
1130 return (left == right); audit_comparator()
1132 return (left != right); audit_comparator()
1134 return (left < right); audit_comparator()
1136 return (left <= right); audit_comparator()
1138 return (left > right); audit_comparator()
1140 return (left >= right); audit_comparator()
1142 return (left & right); audit_comparator()
1144 return ((left & right) == right); audit_comparator()
1151 int audit_uid_comparator(kuid_t left, u32 op, kuid_t right) audit_uid_comparator() argument
1155 return uid_eq(left, right); audit_uid_comparator()
1157 return !uid_eq(left, right); audit_uid_comparator()
1159 return uid_lt(left, right); audit_uid_comparator()
1161 return uid_lte(left, right); audit_uid_comparator()
1163 return uid_gt(left, right); audit_uid_comparator()
1165 return uid_gte(left, right); audit_uid_comparator()
1174 int audit_gid_comparator(kgid_t left, u32 op, kgid_t right) audit_gid_comparator() argument
1178 return gid_eq(left, right); audit_gid_comparator()
1180 return !gid_eq(left, right); audit_gid_comparator()
1182 return gid_lt(left, right); audit_gid_comparator()
1184 return gid_lte(left, right); audit_gid_comparator()
1186 return gid_gt(left, right); audit_gid_comparator()
1188 return gid_gte(left, right); audit_gid_comparator()
/linux-4.1.27/sound/core/oss/
H A Dmixer_oss.c263 int result = 0, left, right; snd_mixer_oss_get_volume() local
269 right = pslot->volume[1]; snd_mixer_oss_get_volume()
271 result = pslot->get_volume(fmixer, pslot, &left, &right); snd_mixer_oss_get_volume()
273 right = left; snd_mixer_oss_get_volume()
276 if (snd_BUG_ON(right < 0 || right > 100)) snd_mixer_oss_get_volume()
280 pslot->volume[1] = right; snd_mixer_oss_get_volume()
281 result = (left & 0xff) | ((right & 0xff) << 8); snd_mixer_oss_get_volume()
291 int result = 0, left = volume & 0xff, right = (volume >> 8) & 0xff; snd_mixer_oss_set_volume() local
298 if (right > 100) snd_mixer_oss_set_volume()
299 right = 100; snd_mixer_oss_set_volume()
301 right = left; snd_mixer_oss_set_volume()
303 result = pslot->put_volume(fmixer, pslot, left, right); snd_mixer_oss_set_volume()
307 pslot->volume[1] = right; snd_mixer_oss_set_volume()
308 return (left & 0xff) | ((right & 0xff) << 8); snd_mixer_oss_set_volume()
518 int *left, int *right) snd_mixer_oss_get_volume1_vol()
545 *right = snd_mixer_oss_conv1(uctl->value.integer.value[1], uinfo->value.integer.min, uinfo->value.integer.max, &pslot->volume[1]); snd_mixer_oss_get_volume1_vol()
555 int *left, int *right, snd_mixer_oss_get_volume1_sw()
581 *right = 0; snd_mixer_oss_get_volume1_sw()
584 *right = 0; snd_mixer_oss_get_volume1_sw()
593 int *left, int *right) snd_mixer_oss_get_volume1()
597 *left = *right = 100; snd_mixer_oss_get_volume1()
599 snd_mixer_oss_get_volume1_vol(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PVOLUME], left, right); snd_mixer_oss_get_volume1()
601 snd_mixer_oss_get_volume1_vol(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GVOLUME], left, right); snd_mixer_oss_get_volume1()
603 snd_mixer_oss_get_volume1_vol(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GLOBAL], left, right); snd_mixer_oss_get_volume1()
606 snd_mixer_oss_get_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PSWITCH], left, right, 0); snd_mixer_oss_get_volume1()
608 snd_mixer_oss_get_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GSWITCH], left, right, 0); snd_mixer_oss_get_volume1()
610 snd_mixer_oss_get_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PROUTE], left, right, 1); snd_mixer_oss_get_volume1()
612 snd_mixer_oss_get_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GROUTE], left, right, 1); snd_mixer_oss_get_volume1()
620 int left, int right) snd_mixer_oss_put_volume1_vol()
646 uctl->value.integer.value[1] = snd_mixer_oss_conv2(right, uinfo->value.integer.min, uinfo->value.integer.max); snd_mixer_oss_put_volume1_vol()
660 int left, int right, snd_mixer_oss_put_volume1_sw()
684 uctl->value.integer.value[route ? 3 : 1] = right > 0 ? 1 : 0; snd_mixer_oss_put_volume1_sw()
690 uctl->value.integer.value[0] = (left > 0 || right > 0) ? 1 : 0; snd_mixer_oss_put_volume1_sw()
704 int left, int right) snd_mixer_oss_put_volume1()
709 snd_mixer_oss_put_volume1_vol(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PVOLUME], left, right); snd_mixer_oss_put_volume1()
711 snd_mixer_oss_put_volume1_vol(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_CVOLUME], left, right); snd_mixer_oss_put_volume1()
714 slot->numid[SNDRV_MIXER_OSS_ITEM_CVOLUME], left, right); snd_mixer_oss_put_volume1()
716 snd_mixer_oss_put_volume1_vol(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GVOLUME], left, right); snd_mixer_oss_put_volume1()
718 snd_mixer_oss_put_volume1_vol(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GLOBAL], left, right); snd_mixer_oss_put_volume1()
720 if (left || right) { snd_mixer_oss_put_volume1()
722 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PSWITCH], left, right, 0); snd_mixer_oss_put_volume1()
724 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_CSWITCH], left, right, 0); snd_mixer_oss_put_volume1()
726 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GSWITCH], left, right, 0); snd_mixer_oss_put_volume1()
728 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PROUTE], left, right, 1); snd_mixer_oss_put_volume1()
730 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_CROUTE], left, right, 1); snd_mixer_oss_put_volume1()
732 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GROUTE], left, right, 1); snd_mixer_oss_put_volume1()
735 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PSWITCH], left, right, 0); snd_mixer_oss_put_volume1()
737 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_CSWITCH], left, right, 0); snd_mixer_oss_put_volume1()
739 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GSWITCH], left, right, 0); snd_mixer_oss_put_volume1()
741 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_PROUTE], left, right, 1); snd_mixer_oss_put_volume1()
743 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_CROUTE], left, right, 1); snd_mixer_oss_put_volume1()
745 snd_mixer_oss_put_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_GROUTE], left, right, 1); snd_mixer_oss_put_volume1()
756 int left, right; snd_mixer_oss_get_recsrc1_sw() local
758 left = right = 1; snd_mixer_oss_get_recsrc1_sw()
759 snd_mixer_oss_get_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_CSWITCH], &left, &right, 0); snd_mixer_oss_get_recsrc1_sw()
760 *active = (left || right) ? 1 : 0; snd_mixer_oss_get_recsrc1_sw()
769 int left, right; snd_mixer_oss_get_recsrc1_route() local
771 left = right = 1; snd_mixer_oss_get_recsrc1_route()
772 snd_mixer_oss_get_volume1_sw(fmixer, pslot, slot->numid[SNDRV_MIXER_OSS_ITEM_CROUTE], &left, &right, 1); snd_mixer_oss_get_recsrc1_route()
773 *active = (left || right) ? 1 : 0; snd_mixer_oss_get_recsrc1_route()
515 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) snd_mixer_oss_get_volume1_vol() argument
552 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) snd_mixer_oss_get_volume1_sw() argument
591 snd_mixer_oss_get_volume1(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, int *left, int *right) snd_mixer_oss_get_volume1() argument
617 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) snd_mixer_oss_put_volume1_vol() argument
657 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) snd_mixer_oss_put_volume1_sw() argument
702 snd_mixer_oss_put_volume1(struct snd_mixer_oss_file *fmixer, struct snd_mixer_oss_slot *pslot, int left, int right) snd_mixer_oss_put_volume1() argument
/linux-4.1.27/include/uapi/sound/
H A Demu10k1.h142 #define EXTIN_AC97_R 0x01 /* AC'97 capture channel - right */
144 #define EXTIN_SPDIF_CD_R 0x03 /* internal S/PDIF CD - onboard - right */
146 #define EXTIN_ZOOM_R 0x05 /* Zoom Video I2S - right */
148 #define EXTIN_TOSLINK_R 0x07 /* LiveDrive - TOSLink Optical - right */
150 #define EXTIN_LINE1_R 0x09 /* LiveDrive - Line/Mic 1 - right */
152 #define EXTIN_COAX_SPDIF_R 0x0b /* LiveDrive - Coaxial S/PDIF - right */
154 #define EXTIN_LINE2_R 0x0d /* LiveDrive - Line/Mic 2 - right */
158 #define EXTOUT_AC97_R 0x01 /* AC'97 playback channel - right */
160 #define EXTOUT_TOSLINK_R 0x03 /* LiveDrive - TOSLink Optical - right */
164 #define EXTOUT_HEADPHONE_R 0x07 /* LiveDrive - Headphone - right */
166 #define EXTOUT_REAR_R 0x09 /* Rear channel - right */
168 #define EXTOUT_ADC_CAP_R 0x0b /* ADC Capture buffer - right */
177 #define A_EXTIN_AC97_R 0x01 /* AC'97 capture channel - right */
181 #define A_EXTIN_OPT_SPDIF_R 0x05 /* right */
183 #define A_EXTIN_LINE2_R 0x09 /* right */
185 #define A_EXTIN_ADC_R 0x0b /* right */
187 #define A_EXTIN_AUX2_R 0x0d /* - right */
191 #define A_EXTOUT_FRONT_R 0x01 /* right */
195 #define A_EXTOUT_HEADPHONE_R 0x05 /* right */
197 #define A_EXTOUT_REAR_R 0x07 /* right */
199 #define A_EXTOUT_AFRONT_R 0x09 /* right */
203 #define A_EXTOUT_ASIDE_R 0x0d /* right - Audigy 2 ZS */
205 #define A_EXTOUT_AREAR_R 0x0f /* right */
207 #define A_EXTOUT_AC97_R 0x11 /* right */
209 #define A_EXTOUT_ADC_CAP_R 0x17 /* right */
H A Dasound.h511 SNDRV_CHMAP_FR, /* front right */
513 SNDRV_CHMAP_RR, /* rear right */
517 SNDRV_CHMAP_SR, /* side right */
521 SNDRV_CHMAP_FRC, /* front right center */
523 SNDRV_CHMAP_RRC, /* rear right center */
525 SNDRV_CHMAP_FRW, /* front right wide */
528 SNDRV_CHMAP_FRH, /* front right high */
531 SNDRV_CHMAP_TFR, /* top front right */
534 SNDRV_CHMAP_TRR, /* top rear right */
538 SNDRV_CHMAP_TFRC, /* top front right center */
540 SNDRV_CHMAP_TSR, /* top side right */
542 SNDRV_CHMAP_RLFE, /* right LFE */
545 SNDRV_CHMAP_BRC, /* bottom right center */
/linux-4.1.27/drivers/watchdog/
H A Docteon-wdt-nmi.S19 * should have the value right before the NMI. */
52 /* Set the stack to begin right below the registers */
H A Dintel_scu_watchdog.h42 /* Ajustment to clock tick frequency to make timing come out right */
/linux-4.1.27/sound/pci/au88x0/
H A Dau88x0_eq.h32 s32 this10; /* How many gains are used for each side (right or left). */
33 u16 this14_array[10]; /* SetLeftGainsTarget: Left (and right?) EQ gains */
H A Dau88x0_a3d.c174 static void a3dsrc_SetHrtfOutput(a3dsrc_t * a, short left, short right) a3dsrc_SetHrtfOutput() argument
180 a3d_addrA(a->slice, a->source, A3D_A_HrtfOutR), right); a3dsrc_SetHrtfOutput()
235 static void a3dsrc_GetHrtfOutput(a3dsrc_t * a, short *left, short *right)
241 *right =
339 static void a3dsrc_SetGainTarget(a3dsrc_t * a, short left, short right) a3dsrc_SetGainTarget() argument
344 (right << 0x10) | left); a3dsrc_SetGainTarget()
347 static void a3dsrc_SetGainCurrent(a3dsrc_t * a, short left, short right) a3dsrc_SetGainCurrent() argument
352 (right << 0x10) | left); a3dsrc_SetGainCurrent()
356 static void a3dsrc_GetGainTarget(a3dsrc_t * a, short *left, short *right)
359 *right =
367 static void a3dsrc_GetGainCurrent(a3dsrc_t * a, short *left, short *right)
370 *right =
715 static void vortex_a3d_coord2ild(a3d_LRGains_t ild, int left, int right) vortex_a3d_coord2ild() argument
/linux-4.1.27/arch/x86/boot/
H A Dstring.h15 * do "undef memcpy" in .c file and link against right string.c
/linux-4.1.27/arch/x86/math-emu/
H A Dshr_Xsig.S5 | 12 byte right shift function |
14 | Extended shift right function. |
17 | right by the number of bits specified by the second arg (nr). |
H A Dwm_shrx.S5 | 64 bit right shift functions |
24 | Extended shift right function. |
27 | right by the number of bits specified by the second arg (arg2). |
30 | shift right ---------> |
100 | Extended shift right function (optimized for small floating point |
103 | right by the number of bits specified by the second arg (arg2). |
106 | shift right ---------> |
H A Dreg_u_sub.S74 | right the required number of |
116 /* Shift right by 64 bits */
127 /* Shift right by 65 bits */
/linux-4.1.27/sound/soc/codecs/
H A Dsirf-audio-codec.c194 SND_SOC_DAPM_DAC("DAC right", NULL, AUDIO_IC_CODEC_CTRL0, 0, 0),
197 SND_SOC_DAPM_SWITCH("Left dac to hp right amp", SND_SOC_NOPM, 0, 0,
201 SND_SOC_DAPM_SWITCH("Right dac to hp right amp", SND_SOC_NOPM, 0, 0,
205 SND_SOC_DAPM_OUT_DRV("HP amp right driver", AUDIO_IC_CODEC_CTRL0, 3, 0,
221 SND_SOC_DAPM_ADC_E("ADC right", NULL, AUDIO_IC_CODEC_CTRL1, 7, 0,
248 {"Right dac to speaker lineout", "Switch", "DAC right"},
252 {"HP Right Driver", NULL, "HP amp right driver"},
254 {"HP amp right driver", NULL , "Right dac to hp right amp"},
256 {"HP amp right driver", NULL , "Right dac to hp right amp"},
258 {"Right dac to hp right amp", "Switch", "DAC right"},
260 {"Left dac to hp right amp", "Switch", "DAC right"},
262 {"DAC right", NULL, "codecclk"},
264 {"DAC right", NULL, "Playback"},
266 {"DAC right", NULL, "HSL Phase Opposite"},
269 {"Capture", NULL, "ADC right"},
271 {"ADC right", NULL, "codecclk"},
273 {"ADC right", NULL, "Right PGA mixer"},
H A Dtlv320aic23.h34 /* Left (right) line input volume control register */
41 /* Left (right) channel headphone volume control register */
H A Dtlv320aic26.h78 AIC26_DATFM_RIGHTJ = 2 << 8, /* right justified */
/linux-4.1.27/arch/parisc/include/asm/
H A Delf.h72 #define R_PARISC_GPREL14R 30 /* GP-relative, right 14 bits. */
74 #define R_PARISC_LTOFF14R 38 /* LT-relative, right 14 bits. */
79 #define R_PARISC_PLTOFF14R 54 /* PLT rel. address, right 14 bits. */
82 #define R_PARISC_LTOFF_FPTR14R 62 /* LT-rel. fct ptr, right 14 bits. */
87 #define R_PARISC_PCREL14WR 75 /* PC-rel. address, right 14 bits. */
88 #define R_PARISC_PCREL14DR 76 /* PC rel. address, right 14 bits. */
99 #define R_PARISC_GPREL14WR 91 /* GP-rel. address, right 14 bits. */
100 #define R_PARISC_GPREL14DR 92 /* GP-rel. address, right 14 bits. */
105 #define R_PARISC_LTOFF14WR 99 /* LT-rel. address, right 14 bits. */
106 #define R_PARISC_LTOFF14DR 100 /* LT-rel. address, right 14 bits. */
112 #define R_PARISC_PLTOFF14WR 115 /* PLT-rel. address, right 14 bits. */
113 #define R_PARISC_PLTOFF14DR 116 /* PLT-rel. address, right 14 bits. */
118 #define R_PARISC_LTOFF_FPTR14WR 123 /* LT-rel. fct. ptr., right 14 bits. */
119 #define R_PARISC_LTOFF_FPTR14DR 124 /* LT-rel. fct. ptr., right 14 bits. */
129 #define R_PARISC_TPREL14R 158 /* TP-rel. address, right 14 bits. */
131 #define R_PARISC_LTOFF_TP14R 166 /* LT-TP-rel. address, right 14 bits.*/
134 #define R_PARISC_TPREL14WR 219 /* TP-rel. address, right 14 bits. */
135 #define R_PARISC_TPREL14DR 220 /* TP-rel. address, right 14 bits. */
140 #define R_PARISC_LTOFF_TP14WR 227 /* LT-TP-rel. address, right 14 bits.*/
141 #define R_PARISC_LTOFF_TP14DR 228 /* LT-TP-rel. address, right 14 bits.*/
H A Dled.h4 #define LED7 0x80 /* top (or furthest right) LED */
/linux-4.1.27/net/bluetooth/
H A Decc.c133 /* Returns sign of left - right. */ vli_cmp()
134 static int vli_cmp(const u64 *left, const u64 *right) vli_cmp() argument
139 if (left[i] > right[i]) vli_cmp()
141 else if (left[i] < right[i]) vli_cmp()
182 /* Computes result = left + right, returning carry. Can modify in place. */ vli_add()
184 const u64 *right) vli_add()
192 sum = left[i] + right[i] + carry; vli_add()
202 /* Computes result = left - right, returning borrow. Can modify in place. */ vli_sub()
203 static u64 vli_sub(u64 *result, const u64 *left, const u64 *right) vli_sub() argument
211 diff = left[i] - right[i] - borrow; vli_sub()
221 static uint128_t mul_64_64(u64 left, u64 right) mul_64_64() argument
225 u64 b0 = right & 0xffffffffull; mul_64_64()
226 u64 b1 = right >> 32; mul_64_64()
256 static void vli_mult(u64 *result, const u64 *left, const u64 *right) vli_mult() argument
276 product = mul_64_64(left[i], right[k - i]); vli_mult()
330 /* Computes result = (left + right) % mod.
331 * Assumes that left < mod and right < mod, result != mod.
333 static void vli_mod_add(u64 *result, const u64 *left, const u64 *right, vli_mod_add() argument
338 carry = vli_add(result, left, right); vli_mod_add()
347 /* Computes result = (left - right) % mod.
348 * Assumes that left < mod and right < mod, result != mod.
350 static void vli_mod_sub(u64 *result, const u64 *left, const u64 *right, vli_mod_sub() argument
353 u64 borrow = vli_sub(result, left, right); vli_mod_sub()
440 /* Computes result = (left * right) % curve_p. */ vli_mod_mult_fast()
441 static void vli_mod_mult_fast(u64 *result, const u64 *left, const u64 *right) vli_mod_mult_fast() argument
445 vli_mult(product, left, right); vli_mod_mult_fast()
183 vli_add(u64 *result, const u64 *left, const u64 *right) vli_add() argument
/linux-4.1.27/security/tomoyo/
H A Dcondition.c282 * @right: Righthand value.
287 static bool tomoyo_parse_argv(char *left, char *right, tomoyo_parse_argv() argument
293 argv->value = tomoyo_get_dqword(right); tomoyo_parse_argv()
301 * @right: Righthand value.
306 static bool tomoyo_parse_envp(char *left, char *right, tomoyo_parse_envp() argument
320 if (!strcmp(right, "NULL")) { tomoyo_parse_envp()
323 value = tomoyo_get_dqword(right); tomoyo_parse_envp()
495 u8 right = -1; tomoyo_get_condition() local
506 * of one or more repetition of $left$operator$right blocks tomoyo_get_condition()
508 * either '=' or '!='" and "$right is free from ' '". tomoyo_get_condition()
601 right = TOMOYO_NAME_UNION; tomoyo_get_condition()
609 right = tomoyo_condition_type(right_word); tomoyo_get_condition()
610 if (right == TOMOYO_MAX_CONDITION_KEYWORD) { tomoyo_get_condition()
615 right = TOMOYO_NUMBER_UNION; tomoyo_get_condition()
624 dprintk(KERN_WARNING "%u: dry_run left=%u right=%u " tomoyo_get_condition()
625 "match=%u\n", __LINE__, left, right, !is_not); tomoyo_get_condition()
629 condp->right = right; tomoyo_get_condition()
631 dprintk(KERN_WARNING "%u: left=%u right=%u match=%u\n", tomoyo_get_condition()
632 __LINE__, condp->left, condp->right, tomoyo_get_condition()
779 const u8 right = condp->right; tomoyo_condition() local
787 if (right == TOMOYO_NAME_UNION) { tomoyo_condition()
812 const u8 index = j ? right : left; tomoyo_condition()
1041 if (right == TOMOYO_NUMBER_UNION) { tomoyo_condition()
1064 switch (right) { tomoyo_condition()
/linux-4.1.27/fs/btrfs/
H A Dctree.c1806 * simple bin_search frontend that does the right thing for
1884 struct extent_buffer *right = NULL; balance_level() local
1971 right = read_node_slot(root, parent, pslot + 1); balance_level()
1972 if (right) { balance_level()
1973 btrfs_tree_lock(right); balance_level()
1974 btrfs_set_lock_blocking(right); balance_level()
1975 wret = btrfs_cow_block(trans, root, right, balance_level()
1976 parent, pslot + 1, &right); balance_level()
1992 * then try to empty the right most buffer into the middle balance_level()
1994 if (right) { balance_level()
1995 wret = push_node_left(trans, root, mid, right, 1); balance_level()
1998 if (btrfs_header_nritems(right) == 0) { balance_level()
1999 clean_tree_block(trans, root->fs_info, right); balance_level()
2000 btrfs_tree_unlock(right); balance_level()
2002 root_sub_used(root, right->len); balance_level()
2003 btrfs_free_tree_block(trans, root, right, 0, 1); balance_level()
2004 free_extent_buffer_stale(right); balance_level()
2005 right = NULL; balance_level()
2008 btrfs_node_key(right, &right_key, 0); balance_level()
2023 * right balance_level()
2082 if (right) { balance_level()
2083 btrfs_tree_unlock(right); balance_level()
2084 free_extent_buffer(right); balance_level()
2102 struct extent_buffer *right = NULL; push_nodes_for_insert() local
2175 right = read_node_slot(root, parent, pslot + 1); push_nodes_for_insert()
2178 * then try to empty the right most buffer into the middle push_nodes_for_insert()
2180 if (right) { push_nodes_for_insert()
2183 btrfs_tree_lock(right); push_nodes_for_insert()
2184 btrfs_set_lock_blocking(right); push_nodes_for_insert()
2186 right_nr = btrfs_header_nritems(right); push_nodes_for_insert()
2190 ret = btrfs_cow_block(trans, root, right, push_nodes_for_insert()
2192 &right); push_nodes_for_insert()
2197 right, mid); push_nodes_for_insert()
2205 btrfs_node_key(right, &disk_key, 0); push_nodes_for_insert()
2212 path->nodes[level] = right; push_nodes_for_insert()
2219 btrfs_tree_unlock(right); push_nodes_for_insert()
2220 free_extent_buffer(right); push_nodes_for_insert()
2224 btrfs_tree_unlock(right); push_nodes_for_insert()
2225 free_extent_buffer(right); push_nodes_for_insert()
3122 * making sure the right key of each node is points to 'key'.
3253 * try to push data from one node into the next node right in the
3257 * error, and > 0 if there was no room in the right hand block.
3438 * left and right, if either one works, it returns right away.
3584 * right. We'll push up to and including min_slot, but no lower
3590 struct extent_buffer *right, __push_leaf_right()
3652 /* push left to right */ __push_leaf_right()
3653 right_nritems = btrfs_header_nritems(right); __push_leaf_right()
3658 /* make room in the right data area */ __push_leaf_right()
3659 data_end = leaf_data_end(root, right); __push_leaf_right()
3660 memmove_extent_buffer(right, __push_leaf_right()
3661 btrfs_leaf_data(right) + data_end - push_space, __push_leaf_right()
3662 btrfs_leaf_data(right) + data_end, __push_leaf_right()
3666 copy_extent_buffer(right, left, btrfs_leaf_data(right) + __push_leaf_right()
3671 memmove_extent_buffer(right, btrfs_item_nr_offset(push_items), __push_leaf_right()
3675 /* copy the items from left to right */ __push_leaf_right()
3676 copy_extent_buffer(right, left, btrfs_item_nr_offset(0), __push_leaf_right()
3682 btrfs_set_header_nritems(right, right_nritems); __push_leaf_right()
3686 push_space -= btrfs_token_item_size(right, item, &token); __push_leaf_right()
3687 btrfs_set_token_item_offset(right, item, push_space, &token); __push_leaf_right()
3698 btrfs_mark_buffer_dirty(right); __push_leaf_right()
3700 btrfs_item_key(right, &disk_key, 0); __push_leaf_right()
3711 path->nodes[0] = right; __push_leaf_right()
3714 btrfs_tree_unlock(right); __push_leaf_right()
3715 free_extent_buffer(right); __push_leaf_right()
3720 btrfs_tree_unlock(right); __push_leaf_right()
3721 free_extent_buffer(right); __push_leaf_right()
3726 * push some data in the path leaf to the right, trying to free up at
3741 struct extent_buffer *right; push_leaf_right() local
3758 right = read_node_slot(root, upper, slot + 1); push_leaf_right()
3759 if (right == NULL) push_leaf_right()
3762 btrfs_tree_lock(right); push_leaf_right()
3763 btrfs_set_lock_blocking(right); push_leaf_right()
3765 free_space = btrfs_leaf_free_space(root, right); push_leaf_right()
3770 ret = btrfs_cow_block(trans, root, right, upper, push_leaf_right()
3771 slot + 1, &right); push_leaf_right()
3775 free_space = btrfs_leaf_free_space(root, right); push_leaf_right()
3784 /* Key greater than all keys in the leaf, right neighbor has push_leaf_right()
3786 * it, therefore use right neighbor to insert the new item and push_leaf_right()
3790 path->nodes[0] = right; push_leaf_right()
3797 right, free_space, left_nritems, min_slot); push_leaf_right()
3799 btrfs_tree_unlock(right); push_leaf_right()
3800 free_extent_buffer(right); push_leaf_right()
3820 struct extent_buffer *right = path->nodes[0]; __push_leaf_left() local
3846 int space = btrfs_leaf_free_space(root, right); __push_leaf_left()
3855 this_item_size = btrfs_item_size(right, item); __push_leaf_left()
3867 WARN_ON(!empty && push_items == btrfs_header_nritems(right)); __push_leaf_left()
3869 /* push data from right to left */ __push_leaf_left()
3870 copy_extent_buffer(left, right, __push_leaf_left()
3876 btrfs_item_offset_nr(right, push_items - 1); __push_leaf_left()
3878 copy_extent_buffer(left, right, btrfs_leaf_data(left) + __push_leaf_left()
3880 btrfs_leaf_data(right) + __push_leaf_left()
3881 btrfs_item_offset_nr(right, push_items - 1), __push_leaf_left()
3899 /* fixup right node */ __push_leaf_left()
3905 push_space = btrfs_item_offset_nr(right, push_items - 1) - __push_leaf_left()
3906 leaf_data_end(root, right); __push_leaf_left()
3907 memmove_extent_buffer(right, btrfs_leaf_data(right) + __push_leaf_left()
3909 btrfs_leaf_data(right) + __push_leaf_left()
3910 leaf_data_end(root, right), push_space); __push_leaf_left()
3912 memmove_extent_buffer(right, btrfs_item_nr_offset(0), __push_leaf_left()
3914 (btrfs_header_nritems(right) - push_items) * __push_leaf_left()
3918 btrfs_set_header_nritems(right, right_nritems); __push_leaf_left()
3923 push_space = push_space - btrfs_token_item_size(right, __push_leaf_left()
3925 btrfs_set_token_item_offset(right, item, push_space, &token); __push_leaf_left()
3930 btrfs_mark_buffer_dirty(right); __push_leaf_left()
3932 clean_tree_block(trans, root->fs_info, right); __push_leaf_left()
3934 btrfs_item_key(right, &disk_key, 0); __push_leaf_left()
3969 struct extent_buffer *right = path->nodes[0]; push_leaf_left() local
3982 right_nritems = btrfs_header_nritems(right); push_leaf_left()
4034 struct extent_buffer *right, copy_for_split()
4046 btrfs_set_header_nritems(right, nritems); copy_for_split()
4049 copy_extent_buffer(right, l, btrfs_item_nr_offset(0), copy_for_split()
4053 copy_extent_buffer(right, l, copy_for_split()
4054 btrfs_leaf_data(right) + BTRFS_LEAF_DATA_SIZE(root) - copy_for_split()
4065 ioff = btrfs_token_item_offset(right, item, &token); copy_for_split()
4066 btrfs_set_token_item_offset(right, item, copy_for_split()
4071 btrfs_item_key(right, &disk_key, 0); copy_for_split()
4072 insert_ptr(trans, root, path, &disk_key, right->start, copy_for_split()
4075 btrfs_mark_buffer_dirty(right); copy_for_split()
4082 path->nodes[0] = right; copy_for_split()
4086 btrfs_tree_unlock(right); copy_for_split()
4087 free_extent_buffer(right); copy_for_split()
4120 * right leaf push_for_double_split()
4171 struct extent_buffer *right; split_leaf() local
4185 /* first try to make some room by pushing left and right */ split_leaf()
4263 right = btrfs_alloc_tree_block(trans, root, 0, root->root_key.objectid, split_leaf()
4265 if (IS_ERR(right)) split_leaf()
4266 return PTR_ERR(right); split_leaf()
4270 memset_extent_buffer(right, 0, 0, sizeof(struct btrfs_header)); split_leaf()
4271 btrfs_set_header_bytenr(right, right->start); split_leaf()
4272 btrfs_set_header_generation(right, trans->transid); split_leaf()
4273 btrfs_set_header_backref_rev(right, BTRFS_MIXED_BACKREF_REV); split_leaf()
4274 btrfs_set_header_owner(right, root->root_key.objectid); split_leaf()
4275 btrfs_set_header_level(right, 0); split_leaf()
4276 write_extent_buffer(right, fs_info->fsid, split_leaf()
4279 write_extent_buffer(right, fs_info->chunk_tree_uuid, split_leaf()
4280 btrfs_header_chunk_tree_uuid(right), split_leaf()
4285 btrfs_set_header_nritems(right, 0); split_leaf()
4286 insert_ptr(trans, root, path, &disk_key, right->start, split_leaf()
4290 path->nodes[0] = right; split_leaf()
4294 btrfs_set_header_nritems(right, 0); split_leaf()
4295 insert_ptr(trans, root, path, &disk_key, right->start, split_leaf()
4299 path->nodes[0] = right; split_leaf()
4304 btrfs_mark_buffer_dirty(right); split_leaf()
4308 copy_for_split(trans, root, path, l, right, slot, mid, nritems); split_leaf()
5079 * We might have had an item with the previous key in the tree right btrfs_prev_leaf()
5375 * If left < right treat left item as new, advance left tree btrfs_compare_trees()
5377 * If left > right treat right item as deleted, advance right tree btrfs_compare_trees()
5379 * If left == right do deep compare of items, treat as changed if btrfs_compare_trees()
5383 * If left < right advance left tree and repeat btrfs_compare_trees()
5384 * If left > right advance right tree and repeat btrfs_compare_trees()
5385 * If left == right compare blockptrs of the next nodes/leafs btrfs_compare_trees()
5403 * the right if possible or go up and right. btrfs_compare_trees()
3586 __push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int data_size, int empty, struct extent_buffer *right, int free_space, u32 left_nritems, u32 min_slot) __push_leaf_right() argument
4030 copy_for_split(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct extent_buffer *l, struct extent_buffer *right, int slot, int mid, int nritems) copy_for_split() argument
/linux-4.1.27/fs/xfs/libxfs/
H A Dxfs_btree.c773 xfs_fsblock_t right = be64_to_cpu(block->bb_u.l.bb_rightsib); xfs_btree_readahead_lblock() local
781 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLFSBLOCK) { xfs_btree_readahead_lblock()
782 xfs_btree_reada_bufl(cur->bc_mp, right, 1, xfs_btree_readahead_lblock()
798 xfs_agblock_t right = be32_to_cpu(block->bb_u.s.bb_rightsib); xfs_btree_readahead_sblock() local
807 if ((lr & XFS_BTCUR_RIGHTRA) && right != NULLAGBLOCK) { xfs_btree_readahead_sblock()
809 right, 1, cur->bc_ops->buf_ops); xfs_btree_readahead_sblock()
824 int lr) /* left/right bits */ xfs_btree_readahead()
1046 * we can pull the owner from the cursor right now as the different xfs_btree_init_block_cur()
1222 * Shift keys one index left/right inside a single btree block.
1241 * Shift records one index left/right inside a single btree block.
1260 * Shift block pointers one index left/right inside a single btree block.
1448 /* Read-ahead to the right at this level. */ xfs_btree_increment()
1464 /* Fail if we just went off the right edge of the tree. */ xfs_btree_increment()
1473 * Stop when we don't go off the right edge of a block. xfs_btree_increment()
1487 /* Read-ahead the right block for the next loop. */ xfs_btree_increment()
1673 * we just return the right key.
1775 * - less than, move right xfs_btree_lookup()
1936 * we are at the far right edge of the tree, update it. xfs_btree_update()
1975 struct xfs_buf *rbp; /* right buffer pointer */ xfs_btree_lshift()
1976 struct xfs_btree_block *right; /* right btree block */ xfs_btree_lshift() local
1977 int rrecs; /* right record count */ xfs_btree_lshift()
1979 union xfs_btree_key *rkp = NULL; /* right btree key */ xfs_btree_lshift()
1980 union xfs_btree_ptr *rpp = NULL; /* right address pointer */ xfs_btree_lshift()
1981 union xfs_btree_rec *rrp = NULL; /* right record pointer */ xfs_btree_lshift()
1991 /* Set up variables for this block as "right". */ xfs_btree_lshift()
1992 right = xfs_btree_get_block(cur, level, &rbp); xfs_btree_lshift()
1995 error = xfs_btree_check_block(cur, right, level, rbp); xfs_btree_lshift()
2001 xfs_btree_get_sibling(cur, right, &lptr, XFS_BB_LEFTSIB); xfs_btree_lshift()
2022 rrecs = xfs_btree_get_numrecs(right); xfs_btree_lshift()
2025 * We add one entry to the left side and remove one for the right side. xfs_btree_lshift()
2045 rkp = xfs_btree_key_addr(cur, 1, right); xfs_btree_lshift()
2048 rpp = xfs_btree_ptr_addr(cur, 1, right); xfs_btree_lshift()
2067 rrp = xfs_btree_rec_addr(cur, 1, right); xfs_btree_lshift()
2079 xfs_btree_set_numrecs(right, rrecs); xfs_btree_lshift()
2083 * Slide the contents of right down one entry. xfs_btree_lshift()
2098 xfs_btree_key_addr(cur, 2, right), xfs_btree_lshift()
2101 xfs_btree_ptr_addr(cur, 2, right), xfs_btree_lshift()
2109 xfs_btree_rec_addr(cur, 2, right), xfs_btree_lshift()
2118 xfs_btree_rec_addr(cur, 1, right)); xfs_btree_lshift()
2122 /* Update the parent key values of right. */ xfs_btree_lshift()
2145 * Move 1 record right from cur/level if possible.
2157 struct xfs_buf *rbp; /* right buffer pointer */ xfs_btree_rshift()
2158 struct xfs_btree_block *right; /* right btree block */ xfs_btree_rshift() local
2160 union xfs_btree_ptr rptr; /* right block pointer */ xfs_btree_rshift()
2161 union xfs_btree_key *rkp; /* right btree key */ xfs_btree_rshift()
2162 int rrecs; /* right record count */ xfs_btree_rshift()
2183 /* If we've got no right sibling then we can't shift an entry right. */ xfs_btree_rshift()
2196 /* Set up the right neighbor as "right". */ xfs_btree_rshift()
2197 error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp); xfs_btree_rshift()
2202 rrecs = xfs_btree_get_numrecs(right); xfs_btree_rshift()
2210 * Make a hole at the start of the right neighbor block, then xfs_btree_rshift()
2221 rkp = xfs_btree_key_addr(cur, 1, right); xfs_btree_rshift()
2222 rpp = xfs_btree_ptr_addr(cur, 1, right); xfs_btree_rshift()
2249 xfs_btree_key_addr(cur, 2, right))); xfs_btree_rshift()
2256 rrp = xfs_btree_rec_addr(cur, 1, right); xfs_btree_rshift()
2268 xfs_btree_rec_addr(cur, 2, right))); xfs_btree_rshift()
2272 * Decrement and log left's numrecs, bump and log right's numrecs. xfs_btree_rshift()
2277 xfs_btree_set_numrecs(right, ++rrecs); xfs_btree_rshift()
2282 * block on the right. xfs_btree_rshift()
2336 union xfs_btree_ptr rptr; /* right sibling block ptr */ __xfs_btree_split()
2337 struct xfs_buf *rbp; /* right buffer pointer */ __xfs_btree_split()
2338 struct xfs_btree_block *right; /* right btree block */ __xfs_btree_split() local
2339 union xfs_btree_ptr rrptr; /* right-right sibling ptr */ __xfs_btree_split()
2340 struct xfs_buf *rrbp; /* right-right buffer pointer */ __xfs_btree_split()
2341 struct xfs_btree_block *rrblock; /* right-right btree block */ __xfs_btree_split()
2374 /* Set up the new block as "right". */ __xfs_btree_split()
2375 error = xfs_btree_get_buf_block(cur, &rptr, 0, &right, &rbp); __xfs_btree_split()
2379 /* Fill in the btree header for the new right block. */ __xfs_btree_split()
2397 * new block, the right. Update the right block and log the __xfs_btree_split()
2404 union xfs_btree_key *rkp; /* right btree key */ __xfs_btree_split()
2405 union xfs_btree_ptr *rpp; /* right address pointer */ __xfs_btree_split()
2409 rkp = xfs_btree_key_addr(cur, 1, right); __xfs_btree_split()
2410 rpp = xfs_btree_ptr_addr(cur, 1, right); __xfs_btree_split()
2426 /* Grab the keys to the entries moved to the right block */ __xfs_btree_split()
2431 union xfs_btree_rec *rrp; /* right record pointer */ __xfs_btree_split()
2434 rrp = xfs_btree_rec_addr(cur, 1, right); __xfs_btree_split()
2440 xfs_btree_rec_addr(cur, 1, right)); __xfs_btree_split()
2449 xfs_btree_set_sibling(cur, right, &rrptr, XFS_BB_RIGHTSIB); __xfs_btree_split()
2450 xfs_btree_set_sibling(cur, right, &lptr, XFS_BB_LEFTSIB); __xfs_btree_split()
2455 xfs_btree_set_numrecs(right, xfs_btree_get_numrecs(right) + rrecs); __xfs_btree_split()
2461 * If there's a block to the new block's right, make that block __xfs_btree_split()
2462 * point back to right instead of to left. __xfs_btree_split()
2473 * If the cursor is really in the right block, move it there. __xfs_btree_split()
2483 * the right block, no matter where this cursor was. __xfs_btree_split()
2679 * the root is at the right level. xfs_btree_new_iroot()
2711 struct xfs_buf *rbp; /* right buffer pointer */ xfs_btree_new_root()
2712 struct xfs_btree_block *right; /* right btree block */ xfs_btree_new_root() local
2742 * "right" for each case. xfs_btree_new_root()
2754 /* Our block is left, pick up the right block. */ xfs_btree_new_root()
2758 error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp); xfs_btree_new_root()
2764 /* Our block is right, pick up the left block. */ xfs_btree_new_root()
2767 right = block; xfs_btree_new_root()
2768 xfs_btree_get_sibling(cur, right, &lptr, XFS_BB_LEFTSIB); xfs_btree_new_root()
2788 xfs_btree_key_addr(cur, 1, right), 1); xfs_btree_new_root()
2795 xfs_btree_rec_addr(cur, 1, right)); xfs_btree_new_root()
2858 /* First, try shifting an entry to the right neighbor. */ xfs_btree_make_block_unfull()
2958 /* Check that the new entry is being inserted in the right place. */ xfs_btree_insrec()
3071 * we are at the far right edge of the tree, update it. xfs_btree_insrec()
3365 union xfs_btree_ptr rptr; /* right sibling block ptr */ xfs_btree_delrec()
3366 struct xfs_buf *rbp; /* right buffer pointer */ xfs_btree_delrec()
3367 struct xfs_btree_block *right; /* right btree block */ xfs_btree_delrec() local
3368 struct xfs_btree_block *rrblock; /* right-right btree block */ xfs_btree_delrec()
3369 struct xfs_buf *rrbp; /* right-right buffer pointer */ xfs_btree_delrec()
3370 int rrecs = 0; /* right record count */ xfs_btree_delrec()
3465 * we are at the far right edge of the tree, update it. xfs_btree_delrec()
3540 * tree balanced. Look at the left and right sibling blocks to xfs_btree_delrec()
3576 * If there's a right sibling, see if it's ok to shift an entry xfs_btree_delrec()
3596 right = xfs_btree_get_block(tcur, level, &rbp); xfs_btree_delrec()
3598 error = xfs_btree_check_block(tcur, right, level, rbp); xfs_btree_delrec()
3603 xfs_btree_get_sibling(tcur, right, &cptr, XFS_BB_LEFTSIB); xfs_btree_delrec()
3606 * If right block is full enough so that removing one entry xfs_btree_delrec()
3608 * of right to us works, we're done. xfs_btree_delrec()
3610 if (xfs_btree_get_numrecs(right) - 1 >= xfs_btree_delrec()
3630 * Otherwise, grab the number of records in right for xfs_btree_delrec()
3634 rrecs = xfs_btree_get_numrecs(right); xfs_btree_delrec()
3676 * won't make it too empty, and right-shifting an entry out xfs_btree_delrec()
3698 * Otherwise, grab the number of records in right for xfs_btree_delrec()
3715 * Set "right" to be the starting block, xfs_btree_delrec()
3719 right = block; xfs_btree_delrec()
3726 * If that won't work, see if we can join with the right neighbor block. xfs_btree_delrec()
3733 * "right" to be the right neighbor. xfs_btree_delrec()
3738 error = xfs_btree_read_buf_block(cur, &rptr, 0, &right, &rbp); xfs_btree_delrec()
3753 rrecs = xfs_btree_get_numrecs(right); xfs_btree_delrec()
3757 * We're now going to join "left" and "right" by moving all the stuff xfs_btree_delrec()
3758 * in "right" to "left" and deleting "right". xfs_btree_delrec()
3765 union xfs_btree_key *rkp; /* right btree key */ xfs_btree_delrec()
3766 union xfs_btree_ptr *rpp; /* right address pointer */ xfs_btree_delrec()
3770 rkp = xfs_btree_key_addr(cur, 1, right); xfs_btree_delrec()
3771 rpp = xfs_btree_ptr_addr(cur, 1, right); xfs_btree_delrec()
3787 union xfs_btree_rec *rrp; /* right record pointer */ xfs_btree_delrec()
3790 rrp = xfs_btree_rec_addr(cur, 1, right); xfs_btree_delrec()
3799 * Fix up the number of records and right block pointer in the xfs_btree_delrec()
3803 xfs_btree_get_sibling(cur, right, &cptr, XFS_BB_RIGHTSIB), xfs_btree_delrec()
3807 /* If there is a right sibling, point it to the remaining block. */ xfs_btree_delrec()
3833 * If we joined with the right neighbor and there's a level above xfs_btree_delrec()
3937 * Off the right end or left end, return failure. xfs_btree_get_rec()
3961 * pointers so we can just walk all the blocks on each level from left to right
3987 /* do right sibling readahead */ xfs_btree_block_change_owner()
H A Dxfs_bmap.c327 * Check that the extents for the inode ip are in the right order in all
414 * Loop over all leaf nodes checking that all extents are in the right order. xfs_bmap_check_leaf_extents()
851 * the root is at the right level. xfs_bmap_extents_to_btree()
1562 * Otherwise *last_block is already the right answer. xfs_bmap_last_before()
1719 /* left is 0, right is 1, prev is 2 */ xfs_bmap_add_extent_delay_real()
1785 * Check and set flags if this segment has a right neighbor. xfs_bmap_add_extent_delay_real()
1820 * The left and right neighbors are both contiguous with new. xfs_bmap_add_extent_delay_real()
1862 * The left neighbor is contiguous, the right is not. xfs_bmap_add_extent_delay_real()
1894 * The right neighbor is contiguous, the left is not. xfs_bmap_add_extent_delay_real()
1925 * Neither the left nor right neighbors are contiguous with xfs_bmap_add_extent_delay_real()
2039 * The right neighbor is contiguous with the new allocation. xfs_bmap_add_extent_delay_real()
2080 * The right neighbor is not contiguous. xfs_bmap_add_extent_delay_real()
2278 /* left is 0, right is 1, prev is 2 */ xfs_bmap_add_extent_unwritten_real()
2341 * Check and set flags if this segment has a right neighbor. xfs_bmap_add_extent_unwritten_real()
2374 * The left and right neighbors are both contiguous with new. xfs_bmap_add_extent_unwritten_real()
2418 * The left neighbor is contiguous, the right is not. xfs_bmap_add_extent_unwritten_real()
2455 * The right neighbor is contiguous, the left is not. xfs_bmap_add_extent_unwritten_real()
2490 * Neither the left nor right neighbors are contiguous with xfs_bmap_add_extent_unwritten_real()
2601 * The right neighbor is contiguous with the new allocation. xfs_bmap_add_extent_unwritten_real()
2643 * The right neighbor is not contiguous. xfs_bmap_add_extent_unwritten_real()
2711 /* new right extent - oldext */ xfs_bmap_add_extent_unwritten_real()
2794 xfs_bmbt_irec_t right; /* right neighbor extent entry */ xfs_bmap_add_extent_hole_delay() local
2814 * Check and set flags if the current (right) segment exists. xfs_bmap_add_extent_hole_delay()
2819 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, *idx), &right); xfs_bmap_add_extent_hole_delay() local
2821 if (isnullstartblock(right.br_startblock)) xfs_bmap_add_extent_hole_delay()
2826 * Set contiguity flags on the left and right neighbors. xfs_bmap_add_extent_hole_delay()
2835 new->br_startoff + new->br_blockcount == right.br_startoff && xfs_bmap_add_extent_hole_delay()
2836 new->br_blockcount + right.br_blockcount <= MAXEXTLEN && xfs_bmap_add_extent_hole_delay()
2839 right.br_blockcount <= MAXEXTLEN))) xfs_bmap_add_extent_hole_delay()
2849 * on the left and on the right. xfs_bmap_add_extent_hole_delay()
2854 right.br_blockcount; xfs_bmap_add_extent_hole_delay()
2860 startblockval(right.br_startblock); xfs_bmap_add_extent_hole_delay()
2891 * on the right. xfs_bmap_add_extent_hole_delay()
2892 * Merge the new allocation with the right neighbor. xfs_bmap_add_extent_hole_delay()
2895 temp = new->br_blockcount + right.br_blockcount; xfs_bmap_add_extent_hole_delay()
2897 startblockval(right.br_startblock); xfs_bmap_add_extent_hole_delay()
2901 nullstartblock((int)newlen), temp, right.br_state); xfs_bmap_add_extent_hole_delay()
2938 xfs_bmbt_irec_t right; /* right neighbor extent entry */ xfs_bmap_add_extent_hole_real() local
2974 xfs_bmbt_get_all(xfs_iext_get_ext(ifp, bma->idx), &right); xfs_bmap_add_extent_hole_real()
2975 if (isnullstartblock(right.br_startblock)) xfs_bmap_add_extent_hole_real()
2980 * We're inserting a real allocation between "left" and "right". xfs_bmap_add_extent_hole_real()
2991 new->br_startoff + new->br_blockcount == right.br_startoff && xfs_bmap_add_extent_hole_real()
2992 new->br_startblock + new->br_blockcount == right.br_startblock && xfs_bmap_add_extent_hole_real()
2993 new->br_state == right.br_state && xfs_bmap_add_extent_hole_real()
2994 new->br_blockcount + right.br_blockcount <= MAXEXTLEN && xfs_bmap_add_extent_hole_real()
2997 right.br_blockcount <= MAXEXTLEN)) xfs_bmap_add_extent_hole_real()
3008 * left and on the right. xfs_bmap_add_extent_hole_real()
3015 right.br_blockcount); xfs_bmap_add_extent_hole_real()
3026 error = xfs_bmbt_lookup_eq(bma->cur, right.br_startoff, xfs_bmap_add_extent_hole_real()
3027 right.br_startblock, right.br_blockcount, xfs_bmap_add_extent_hole_real()
3044 right.br_blockcount, xfs_bmap_add_extent_hole_real()
3086 * on the right. xfs_bmap_add_extent_hole_real()
3087 * Merge the new allocation with the right neighbor. xfs_bmap_add_extent_hole_real()
3092 new->br_blockcount + right.br_blockcount, xfs_bmap_add_extent_hole_real()
3093 right.br_state); xfs_bmap_add_extent_hole_real()
3101 right.br_startoff, xfs_bmap_add_extent_hole_real()
3102 right.br_startblock, xfs_bmap_add_extent_hole_real()
3103 right.br_blockcount, &i); xfs_bmap_add_extent_hole_real()
3110 right.br_blockcount, xfs_bmap_add_extent_hole_real()
3111 right.br_state); xfs_bmap_add_extent_hole_real()
3397 xfs_fsblock_t gotbno; /* right side block number */ xfs_bmap_adjacent()
3398 xfs_fsblock_t gotdiff=0; /* right side difference */ xfs_bmap_adjacent()
3445 * If there's a following (right) block, select a requested xfs_bmap_adjacent()
3695 * it's in the right allocation group. xfs_bmap_btalloc()
4791 * Left-contig is 2, right-contig is 1. xfs_bmap_del_extent()
5565 * a right shift does not modify extent neighbors xfs_bmse_shift_one()
5601 * Shift extent records to the left/right to cover/create a hole.
5680 * In case of first right shift, we need to initialize next_fsb xfs_bmap_shift_extents()
/linux-4.1.27/arch/arm/mach-s3c64xx/
H A Dmach-hmt.c210 { /* right function keys - red */
211 .name = "right:red",
214 { /* right function keys - green */
215 .name = "right:green",
218 { /* right function keys - blue */
219 .name = "right:blue",
/linux-4.1.27/arch/x86/include/asm/
H A Dsparsemem.h28 # define SECTION_SIZE_BITS 27 /* matt - 128 is convenient right now */
H A Dvvar.h25 * right place.
/linux-4.1.27/arch/x86/pci/
H A Dinit.c7 in the right sequence from here. */ pci_arch_init()
/linux-4.1.27/arch/xtensa/platforms/xtfpga/include/platform/
H A Dlcd.h18 /* Shift the contents of the LCD display left or right. */
/linux-4.1.27/arch/metag/lib/
H A Dashrdi3.S3 ! 64-bit arithmetic shift right routine.
H A Dlshrdi3.S3 ! 64-bit logical shift right routine.
/linux-4.1.27/include/linux/platform_data/
H A Data-samsung_cf.h17 * @setup_gpio: Setup the external GPIO pins to the right state for data
H A Ddavinci_asp.h27 * Allowing this is more efficient and eliminates left and right swaps
28 * caused by underruns, but will swap the left and right channels
H A Dvideo_s3c.h29 * @setup_gpio: Setup the external GPIO pins to the right state to transfer
/linux-4.1.27/sound/pci/
H A Dak4531_codec.c166 int left, right; snd_ak4531_get_double() local
170 right = (ak4531->regs[right_reg] >> right_shift) & mask; snd_ak4531_get_double()
174 right = mask - right; snd_ak4531_get_double()
177 ucontrol->value.integer.value[1] = right; snd_ak4531_get_double()
191 int left, right; snd_ak4531_put_double() local
194 right = ucontrol->value.integer.value[1] & mask; snd_ak4531_put_double()
197 right = mask - right; snd_ak4531_put_double()
200 right <<= right_shift; snd_ak4531_put_double()
203 left = (ak4531->regs[left_reg] & ~((mask << left_shift) | (mask << right_shift))) | left | right; snd_ak4531_put_double()
208 right = (ak4531->regs[right_reg] & ~(mask << right_shift)) | right; snd_ak4531_put_double()
209 change = left != ak4531->regs[left_reg] || right != ak4531->regs[right_reg]; snd_ak4531_put_double()
211 ak4531->write(ak4531, right_reg, ak4531->regs[right_reg] = right); snd_ak4531_put_double()
H A Dad1889.h25 #define AD_DS_WADA_RWAM 0x0080 /* right wave mute */
26 #define AD_DS_WADA_RWAA 0x001f /* right wave attenuation */
31 #define AD_DS_SYDA_RSYM 0x0080 /* right synthesis mute */
32 #define AD_DS_SYDA_RSYA 0x001f /* right synthesis attenuation */
/linux-4.1.27/sound/hda/
H A Dhdac_regmap.c138 * fake register to deal both left and right channels by a single
141 * for the left and the upper 8bit for the right channel.
151 /* read a pseudo stereo amp register (16bit left+right) */ hda_reg_read_stereo_amp()
155 unsigned int left, right; hda_reg_read_stereo_amp() local
162 err = snd_hdac_exec_verb(codec, reg | AC_AMP_GET_RIGHT, 0, &right); hda_reg_read_stereo_amp()
165 *val = left | (right << 8); hda_reg_read_stereo_amp()
169 /* write a pseudo stereo amp register (16bit left+right) */ hda_reg_write_stereo_amp()
174 unsigned int verb, left, right; hda_reg_write_stereo_amp() local
184 right = (val >> 8) & 0xff; hda_reg_write_stereo_amp()
185 if (left == right) { hda_reg_write_stereo_amp()
193 err = snd_hdac_exec_verb(codec, reg | AC_AMP_SET_RIGHT | right, 0, NULL); hda_reg_write_stereo_amp()
/linux-4.1.27/drivers/media/platform/s5p-g2d/
H A Dg2d-hw.c41 n |= f->right & 0xFFF; g2d_set_src_size()
66 n |= f->right & 0xFFF; g2d_set_dst_size()
/linux-4.1.27/arch/mips/kernel/
H A Djump_label.c27 * - the amount the jump target address is shifted right to fit in the
51 /* Target must have the right alignment and ISA must be preserved. */ arch_jump_label_transform()
/linux-4.1.27/arch/mn10300/unit-asb2303/
H A Dleds.c30 ~0x04, /* right top - segB */
31 ~0x08, /* right bottom - segC */
/linux-4.1.27/drivers/staging/lustre/lustre/ldlm/
H A Dinterval_tree.c246 /* The left rotation "pivots" around the link from node to node->right, and
247 * - node will be linked to node->right's left child, and
248 * - node->right's left child will be linked to node's right child. */ __rotate_left()
252 struct interval_node *right = node->in_right; __rotate_left() local
255 node->in_right = right->in_left; __rotate_left()
257 right->in_left->in_parent = node; __rotate_left()
259 right->in_left = node; __rotate_left()
260 right->in_parent = parent; __rotate_left()
263 parent->in_left = right; __rotate_left()
265 parent->in_right = right; __rotate_left()
267 *root = right; __rotate_left()
269 node->in_parent = right; __rotate_left()
271 /* update max_high for node and right */ __rotate_left()
272 __rotate_change_maxhigh(node, right); __rotate_left()
275 /* The right rotation "pivots" around the link from node to node->left, and
276 * - node will be linked to node->left's right child, and
277 * - node->left's right child will be linked to node's left child. */ __rotate_right()
520 } else { /* Both left and right child are not NULL */ interval_erase()
712 /* we only concern the empty tree right now. */ interval_expand_low()
/linux-4.1.27/drivers/block/drbd/
H A Ddrbd_interval.c33 sector_t right = interval_end(node->rb.rb_right); compute_subtree_last() local
34 if (right > max) compute_subtree_last()
35 max = right; compute_subtree_last()
130 * overlapping intervals will be on the right side of the tree, reachable with
155 /* Overlap if any must be on right side */ drbd_find_overlap()
/linux-4.1.27/net/tipc/
H A Dlink.h263 static inline int less_eq(u32 left, u32 right) less_eq() argument
265 return mod(right - left) < 32768u; less_eq()
268 static inline int more(u32 left, u32 right) more() argument
270 return !less_eq(left, right); more()
273 static inline int less(u32 left, u32 right) less() argument
275 return less_eq(left, right) && (mod(right) != mod(left)); less()
278 static inline u32 lesser(u32 left, u32 right) lesser() argument
280 return less_eq(left, right) ? left : right; lesser()
/linux-4.1.27/sound/pci/ctxfi/
H A Dctdaio.c33 unsigned short right; member in struct:daio_rsc_idx
37 [LINEO1] = {.left = 0x00, .right = 0x01},
38 [LINEO2] = {.left = 0x18, .right = 0x19},
39 [LINEO3] = {.left = 0x08, .right = 0x09},
40 [LINEO4] = {.left = 0x10, .right = 0x11},
41 [LINEIM] = {.left = 0x1b5, .right = 0x1bd},
42 [SPDIFOO] = {.left = 0x20, .right = 0x21},
43 [SPDIFIO] = {.left = 0x15, .right = 0x1d},
44 [SPDIFI1] = {.left = 0x95, .right = 0x9d},
48 [LINEO1] = {.left = 0x40, .right = 0x41},
49 [LINEO2] = {.left = 0x60, .right = 0x61},
50 [LINEO3] = {.left = 0x50, .right = 0x51},
51 [LINEO4] = {.left = 0x70, .right = 0x71},
52 [LINEIM] = {.left = 0x45, .right = 0xc5},
53 [MIC] = {.left = 0x55, .right = 0xd5},
54 [SPDIFOO] = {.left = 0x00, .right = 0x01},
55 [SPDIFIO] = {.left = 0x05, .right = 0x85},
340 idx_r = idx_20k1[desc->type].right; daio_rsc_init()
344 idx_r = idx_20k2[desc->type].right; daio_rsc_init()
H A Dctvmem.h29 * (emu20k1 can handle even 8k pages, but we don't use it right now)
/linux-4.1.27/drivers/gpu/drm/qxl/
H A Dqxl_draw.c95 drawable->self_bitmap_area.right = 0; make_drawable()
198 rect.right = x + width; qxl_draw_opaque_fb()
233 drawable->u.copy.src_area.right = width; qxl_draw_opaque_fb()
281 int left, right, top, bottom; qxl_draw_dirty_fb() local
300 right = clips->x2; qxl_draw_dirty_fb()
308 right = max_t(int, right, (int)clips_ptr->x2); qxl_draw_dirty_fb()
313 width = right - left; qxl_draw_dirty_fb()
332 drawable_rect.right = right; qxl_draw_dirty_fb()
365 drawable->u.copy.src_area.right = width; qxl_draw_dirty_fb()
380 rects[i].right = clips_ptr->x2; qxl_draw_dirty_fb()
424 rect.right = dx + width; qxl_draw_copyarea()
/linux-4.1.27/fs/nfs/blocklayout/
H A Dextent_tree.c112 struct pnfs_block_extent *right = ext_tree_next(be); ext_try_to_merge_right() local
114 if (right && ext_can_merge(be, right)) { ext_try_to_merge_right()
115 be->be_length += right->be_length; ext_try_to_merge_right()
116 rb_erase(&right->be_node, root); ext_try_to_merge_right()
117 nfs4_put_deviceid_node(right->be_device); ext_try_to_merge_right()
118 kfree(right); ext_try_to_merge_right()
437 struct pnfs_block_extent *right = ext_tree_next(be); ext_tree_mark_written() local
439 if (right && ext_can_merge(be, right)) { ext_tree_mark_written()
444 right->be_f_offset -= diff; ext_tree_mark_written()
445 right->be_v_offset -= diff; ext_tree_mark_written()
446 right->be_length += diff; ext_tree_mark_written()
/linux-4.1.27/tools/lib/traceevent/
H A Dparse-filter.c209 free_arg(arg->num.right); free_arg()
214 free_arg(arg->exp.right); free_arg()
231 free_arg(arg->op.right); free_arg()
462 if (op->exp.right) add_right()
464 op->exp.right = arg; add_right()
468 if (op->op.right) add_right()
470 op->op.right = arg; add_right()
474 if (op->op.right) add_right()
579 /* We no longer have left or right args */ add_right()
600 op->num.right = arg; add_right()
622 arg = a->op.right; rotate_op_right()
623 a->op.right = b; rotate_op_right()
736 return arg->exp.right != NULL; check_op_done()
739 return arg->op.right != NULL; check_op_done()
742 return arg->num.right != NULL; check_op_done()
777 if (old_child->op.right == arg) { reparent_op_arg()
778 ptr = &old_child->op.right; reparent_op_arg()
782 other_child = old_child->op.right; reparent_op_arg()
800 if (parent->op.right == old_child) reparent_op_arg()
801 ptr = &parent->op.right; reparent_op_arg()
837 rval = test_arg(arg, arg->exp.right, error_str); test_arg()
846 rval = test_arg(arg, arg->num.right, error_str); test_arg()
860 rval = test_arg(arg, arg->op.right, error_str); test_arg()
864 return reparent_op_arg(parent, arg, arg->op.right, test_arg()
870 rval = test_arg(arg, arg->op.right, error_str); test_arg()
874 return reparent_op_arg(parent, arg, arg->op.right, test_arg()
882 rval = test_arg(arg, arg->op.right, error_str); test_arg()
1750 rval = get_arg_value(event, arg->exp.right, record, err); get_exp_value()
1829 rval = get_arg_value(event, arg->num.right, record, err); test_num()
1943 test_filter(event, arg->op.right, record, err); test_op()
1947 test_filter(event, arg->op.right, record, err); test_op()
1950 return !test_filter(event, arg->op.right, record, err); test_op()
2062 char *right = NULL; op_to_str() local
2077 right = arg_to_str(filter, arg->op.right); op_to_str()
2078 if (!left || !right) op_to_str()
2087 if (strcmp(right, "TRUE") == 0) op_to_str()
2089 else if (strcmp(right, "FALSE") == 0) op_to_str()
2120 /* Just return right value */ op_to_str()
2121 str = right; op_to_str()
2122 right = NULL; op_to_str()
2125 /* The right value is meaningless */ op_to_str()
2131 asprintf(&str, "(%s) %s (%s)", left, op, right); op_to_str()
2136 right = arg_to_str(filter, arg->op.right); op_to_str()
2137 if (!right) op_to_str()
2141 if (strcmp(right, "TRUE") == 0) op_to_str()
2143 else if (strcmp(right, "FALSE") == 0) op_to_str()
2150 asprintf(&str, "%s(%s)", op, right); op_to_str()
2158 free(right); op_to_str()
2184 rstr = arg_to_str(filter, arg->exp.right); exp_to_str()
2240 rstr = arg_to_str(filter, arg->num.right); num_to_str()
H A Devent-parse.c791 free_arg(arg->op.right); free_arg()
1659 struct print_arg *arg, *left, *right; process_cond() local
1665 right = alloc_arg(); process_cond()
1667 if (!arg || !left || !right) { process_cond()
1671 free_arg(right); process_cond()
1677 arg->op.right = right; process_cond()
1694 type = process_arg(event, right, &token); process_cond()
1696 top->op.right = arg; process_cond()
1703 top->op.right = NULL; process_cond()
1729 top->op.right = arg; process_array()
1814 struct print_arg *left, *right = NULL; process_op() local
1847 right = alloc_arg(); process_op()
1848 if (!right) process_op()
1851 arg->op.right = right; process_op()
1855 type = process_arg(event, right, tok); process_op()
1871 /* it will set arg->op.right */ process_op()
1902 arg->op.right = NULL; process_op()
1937 right = alloc_arg(); process_op()
1938 if (!right) process_op()
1941 type = process_arg_token(event, right, tok, type); process_op()
1943 if (right->type == PRINT_OP && process_op()
1944 get_op_prio(arg->op.op) < get_op_prio(right->op.op)) { process_op()
1948 arg->op.right = right->op.left; process_op()
1951 *arg = *right; process_op()
1952 *right = tmp; process_op()
1954 arg->op.left = right; process_op()
1956 arg->op.right = right; process_op()
1973 /* it will set arg->op.right */ process_op()
1992 return process_op(event, right, tok); process_op()
2186 long long left, right; arg_num_eval() local
2205 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2209 *val = left || right; arg_num_eval()
2211 *val = left | right; arg_num_eval()
2217 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2221 *val = left && right; arg_num_eval()
2223 *val = left & right; arg_num_eval()
2229 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2234 *val = left < right; arg_num_eval()
2237 *val = left << right; arg_num_eval()
2240 *val = left <= right; arg_num_eval()
2251 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2256 *val = left > right; arg_num_eval()
2259 *val = left >> right; arg_num_eval()
2262 *val = left >= right; arg_num_eval()
2273 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2281 *val = left == right; arg_num_eval()
2287 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2293 *val = left != right; arg_num_eval()
2308 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2311 *val = left - right; arg_num_eval()
2320 ret = arg_num_eval(arg->op.right, &right); arg_num_eval()
2323 *val = left + right; arg_num_eval()
3395 unsigned long long left, right; eval_num_arg() local
3443 right = eval_num_arg(data, size, event, arg->op.right); eval_num_arg()
3469 offset += right; eval_num_arg()
3482 right * larg->field.field->elementsize; eval_num_arg()
3494 arg = arg->op.right; eval_num_arg()
3498 val = eval_num_arg(data, size, event, arg->op.right); eval_num_arg()
3503 right = eval_num_arg(data, size, event, arg->op.right); eval_num_arg()
3508 val = !right; eval_num_arg()
3511 val = left != right; eval_num_arg()
3518 val = ~right; eval_num_arg()
3522 val = left || right; eval_num_arg()
3524 val = left | right; eval_num_arg()
3528 val = left && right; eval_num_arg()
3530 val = left & right; eval_num_arg()
3535 val = left < right; eval_num_arg()
3538 val = left << right; eval_num_arg()
3541 val = left <= right; eval_num_arg()
3550 val = left > right; eval_num_arg()
3553 val = left >> right; eval_num_arg()
3556 val = left >= right; eval_num_arg()
3566 val = left == right; eval_num_arg()
3569 val = left - right; eval_num_arg()
3572 val = left + right; eval_num_arg()
3575 val = left / right; eval_num_arg()
3578 val = left * right; eval_num_arg()
3941 format, len_arg, arg->op.right->op.left); print_str_arg()
3944 format, len_arg, arg->op.right->op.right); print_str_arg()
5506 print_args(args->op.right); print_args()
/linux-4.1.27/drivers/net/wireless/brcm80211/brcmsmac/phy/
H A Dphy_qmath.c21 * To fit the output into 16 bits the 32 bit multiplication result is right
32 * result is right shifted by 15 bits. Right shifting 15 bits instead of 16 bits
105 * specified shift is +ve. This function will make a 32 bit right shift when
130 * specified shift is +ve. This function will make a 16 bit right shift when
154 * Description: This function make a 16 bit right shift when shift is +ve.
256 * at the right side of 30th bit. qm_log10()
260 /* take the table index as the LOG2_OF_LOG_TABLE_SIZE bits right of the qm_log10()
/linux-4.1.27/sound/isa/msnd/
H A Dmsnd_pinnacle_mixer.c186 static int snd_msndmix_set(struct snd_msnd *dev, int d, int left, int right) snd_msndmix_set() argument
198 bRight = right * 0xff / 100; snd_msndmix_set()
199 wRight = right * 0xffff / 100; snd_msndmix_set()
260 int left, right; snd_msndmix_volume_put() local
264 right = ucontrol->value.integer.value[1] % 101; snd_msndmix_volume_put()
267 || msnd->right_levels[addr] != right; snd_msndmix_volume_put()
268 snd_msndmix_set(msnd, addr, left, right); snd_msndmix_volume_put()
/linux-4.1.27/drivers/firmware/efi/libstub/
H A Darm-stub.c311 const efi_memory_desc_t *left = l, *right = r; cmp_mem_desc() local
313 return (left->phys_addr > right->phys_addr) ? 1 : -1; cmp_mem_desc()
317 * Returns whether region @left ends exactly where region @right starts,
321 efi_memory_desc_t *right) regions_are_adjacent()
325 if (left == NULL || right == NULL) regions_are_adjacent()
330 return left_end == right->phys_addr; regions_are_adjacent()
334 * Returns whether region @left and region @right have compatible memory type
338 efi_memory_desc_t *right) regions_have_compatible_memory_type_attrs()
344 return ((left->attribute ^ right->attribute) & mem_type_mask) == 0; regions_have_compatible_memory_type_attrs()
320 regions_are_adjacent(efi_memory_desc_t *left, efi_memory_desc_t *right) regions_are_adjacent() argument
337 regions_have_compatible_memory_type_attrs(efi_memory_desc_t *left, efi_memory_desc_t *right) regions_have_compatible_memory_type_attrs() argument
/linux-4.1.27/drivers/gpu/drm/panel/
H A Dpanel-sharp-lq101r1sx01.c137 struct mipi_dsi_device *right, sharp_setup_symmetrical_split()
154 err = mipi_dsi_dcs_set_column_address(right, mode->hdisplay / 2, sharp_setup_symmetrical_split()
157 dev_err(&right->dev, "failed to set column address: %d\n", err); sharp_setup_symmetrical_split()
161 err = mipi_dsi_dcs_set_page_address(right, 0, mode->vdisplay - 1); sharp_setup_symmetrical_split()
163 dev_err(&right->dev, "failed to set page address: %d\n", err); sharp_setup_symmetrical_split()
206 /* set left-right mode */ sharp_panel_prepare()
209 dev_err(panel->dev, "failed to set left-right mode: %d\n", err); sharp_panel_prepare()
227 * TODO: The device supports both left-right and even-odd split sharp_panel_prepare()
229 * right split. To support a different mode a mechanism needs to be sharp_panel_prepare()
136 sharp_setup_symmetrical_split(struct mipi_dsi_device *left, struct mipi_dsi_device *right, const struct drm_display_mode *mode) sharp_setup_symmetrical_split() argument
/linux-4.1.27/arch/m68k/lib/
H A Dmulsi3.S55 /* Use the right prefix for global labels. */
59 /* Use the right prefix for registers. */
63 /* Use the right prefix for immediate values. */
H A Ddivsi3.S55 /* Use the right prefix for global labels. */
59 /* Use the right prefix for registers. */
63 /* Use the right prefix for immediate values. */
H A Dmodsi3.S55 /* Use the right prefix for global labels. */
59 /* Use the right prefix for registers. */
63 /* Use the right prefix for immediate values. */
H A Dumodsi3.S55 /* Use the right prefix for global labels. */
59 /* Use the right prefix for registers. */
63 /* Use the right prefix for immediate values. */
/linux-4.1.27/lib/
H A Drbtree.c144 * Case 3 - right rotate at gparent __rb_insert()
173 /* Case 2 - right rotate at parent */ __rb_insert()
267 * Case 3 - right rotate at sibling ____rb_erase_color()
312 /* Case 1 - right rotate at parent */ ____rb_erase_color()
338 /* Case 3 - right rotate at sibling */ ____rb_erase_color()
452 * If we have a right-hand child, go down and then left as far rb_next()
463 * No right-hand children. Everything down and left is smaller than us, rb_next()
465 * Go up the tree; any time the ancestor is a right-hand child of its rb_next()
484 * If we have a left-hand child, go down and then right as far rb_prev()
496 * is a right-hand child of its parent. rb_prev()
543 /* If we are the parent's left node, go to the parent's right rb_next_postorder()
547 /* Otherwise we are the parent's right node, and the parent rb_next_postorder()
H A Dbtree.c37 * values are to the right, not to the left. All used slots within a node
400 /* right-most key is too large, update it */ find_level()
401 /* FIXME: If the right-most key on higher levels is find_level()
522 unsigned long *right, int rfill, merge()
529 setkey(geo, left, lfill + i, bkey(geo, right, i)); merge()
530 setval(geo, left, lfill + i, bval(geo, right, i)); merge()
532 /* Exchange left and right child in parent */ merge()
533 setval(geo, parent, lpos, right); merge()
535 /* Remove left (formerly right) child from parent */ merge()
537 mempool_free(right, head->mempool); merge()
543 unsigned long *parent, *left = NULL, *right = NULL; rebalance() local
572 right = bval(geo, parent, i + 1); rebalance()
573 no_right = getfill(geo, right, 0); rebalance()
577 right, no_right, rebalance()
583 * We could also try to steal one entry from the left or right rebalance()
520 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) merge() argument
H A Dtest_kasan.c25 pr_info("out-of-bounds to right\n"); kmalloc_oob_right()
57 pr_info("kmalloc_node(): out-of-bounds to right\n"); kmalloc_node_oob_right()
73 pr_info("kmalloc large allocation: out-of-bounds to right\n"); kmalloc_large_oob_rigth()
/linux-4.1.27/tools/perf/
H A Dbuiltin-diff.c498 __hist_entry__cmp_compute(struct hist_entry *left, struct hist_entry *right, __hist_entry__cmp_compute() argument
505 double r = right->diff.period_ratio_delta; __hist_entry__cmp_compute()
512 double r = right->diff.period_ratio; __hist_entry__cmp_compute()
519 s64 r = right->diff.wdiff; __hist_entry__cmp_compute()
531 hist_entry__cmp_compute(struct hist_entry *left, struct hist_entry *right, hist_entry__cmp_compute() argument
535 bool pairs_right = hist_entry__has_pairs(right); hist_entry__cmp_compute()
545 p_right = get_pair_data(right, &data__files[sort_idx]); hist_entry__cmp_compute()
561 hist_entry__cmp_compute_idx(struct hist_entry *left, struct hist_entry *right, hist_entry__cmp_compute_idx() argument
567 p_right = get_pair_data(right, &data__files[sort_idx]); hist_entry__cmp_compute_idx()
581 if (left->dummy && right->dummy) hist_entry__cmp_compute_idx()
584 if (left->dummy || right->dummy) hist_entry__cmp_compute_idx()
594 struct hist_entry *right __maybe_unused) hist_entry__cmp_nop()
601 struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_baseline()
603 if (left->stat.period == right->stat.period) hist_entry__cmp_baseline()
605 return left->stat.period > right->stat.period ? 1 : -1; hist_entry__cmp_baseline()
610 struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_delta()
614 return hist_entry__cmp_compute(right, left, COMPUTE_DELTA, d->idx); hist_entry__cmp_delta()
619 struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_ratio()
623 return hist_entry__cmp_compute(right, left, COMPUTE_RATIO, d->idx); hist_entry__cmp_ratio()
628 struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_wdiff()
632 return hist_entry__cmp_compute(right, left, COMPUTE_WEIGHTED_DIFF, d->idx); hist_entry__cmp_wdiff()
637 struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_delta_idx()
639 return hist_entry__cmp_compute_idx(right, left, COMPUTE_DELTA, hist_entry__cmp_delta_idx()
645 struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_ratio_idx()
647 return hist_entry__cmp_compute_idx(right, left, COMPUTE_RATIO, hist_entry__cmp_ratio_idx()
653 struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_wdiff_idx()
655 return hist_entry__cmp_compute_idx(right, left, COMPUTE_WEIGHTED_DIFF, hist_entry__cmp_wdiff_idx()
600 hist_entry__cmp_baseline(struct perf_hpp_fmt *fmt __maybe_unused, struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_baseline() argument
609 hist_entry__cmp_delta(struct perf_hpp_fmt *fmt, struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_delta() argument
618 hist_entry__cmp_ratio(struct perf_hpp_fmt *fmt, struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_ratio() argument
627 hist_entry__cmp_wdiff(struct perf_hpp_fmt *fmt, struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_wdiff() argument
636 hist_entry__cmp_delta_idx(struct perf_hpp_fmt *fmt __maybe_unused, struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_delta_idx() argument
644 hist_entry__cmp_ratio_idx(struct perf_hpp_fmt *fmt __maybe_unused, struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_ratio_idx() argument
652 hist_entry__cmp_wdiff_idx(struct perf_hpp_fmt *fmt __maybe_unused, struct hist_entry *left, struct hist_entry *right) hist_entry__cmp_wdiff_idx() argument
/linux-4.1.27/arch/sparc/include/asm/
H A Dunistd.h5 * think of right now to force the arguments into fixed registers
/linux-4.1.27/arch/sparc/prom/
H A Dbootstr_64.c12 /* WARNING: The boot loader knows that these next three variables come one right
/linux-4.1.27/drivers/gpu/drm/nouveau/include/nvkm/core/
H A Ddevidx.h18 /* This grouping of subdevs are initialised right after they've
/linux-4.1.27/include/uapi/linux/tc_ematch/
H A Dtc_em_meta.h89 struct tcf_meta_val right; member in struct:tcf_meta_hdr
/linux-4.1.27/arch/powerpc/platforms/pasemi/
H A Dtime.c26 /* Let's just return a fake date right now */ pas_get_boot_time()
/linux-4.1.27/arch/mips/include/asm/
H A Dvga.h27 * <linux/vt_buffer.h> has already done the right job for us.
/linux-4.1.27/arch/mn10300/lib/
H A D__lshrdi3.S1 /* MN10300 64-bit logical right shift
H A D__ashrdi3.S1 /* MN10300 64-bit arithmetic right shift
/linux-4.1.27/arch/powerpc/boot/
H A Ddiv64.S33 cntlzw r0,r5 # we are shifting the dividend right
35 srw r10,r10,r0 # the divisor right the same amount,
71 * ashrdi3: arithmetic right shift (sign propagation)
72 * lshrdi3: logical right shift
/linux-4.1.27/arch/powerpc/include/asm/
H A Dvga.h23 * <linux/vt_buffer.h> has already done the right job for us.
/linux-4.1.27/arch/frv/lib/
H A D__ashrdi3.S1 /* __ashrdi3.S: 64-bit arithmetic shift right
H A D__lshrdi3.S1 /* __lshrdi3.S: 64-bit logical shift right
/linux-4.1.27/arch/arm/mach-ux500/
H A Dcache-l2x0.c24 * already enabled, so we do it right here instead. The PL310 has ux500_l2x0_unlock()
/linux-4.1.27/arch/arm/include/uapi/asm/
H A Dswab.h35 * right thing and not screw it up to different degrees __arch_swab32()
/linux-4.1.27/arch/arc/plat-arcfpga/
H A Dplatform.c19 * however as part of early device tree scan, we also select the right
/linux-4.1.27/net/ipv4/
H A Dtcp_vegas.h9 u32 beg_snd_nxt; /* right edge during last RTT */
/linux-4.1.27/drivers/input/mouse/
H A Dvsxxxaa.c212 int left, middle, right; vsxxxaa_handle_REL_packet() local
244 right = buf[0] & 0x01; vsxxxaa_handle_REL_packet()
250 left ? "L" : "l", middle ? "M" : "m", right ? "R" : "r"); vsxxxaa_handle_REL_packet()
257 input_report_key(dev, BTN_RIGHT, right); vsxxxaa_handle_REL_packet()
268 int left, middle, right, touch; vsxxxaa_handle_ABS_packet() local
294 right = buf[0] & 0x08; vsxxxaa_handle_ABS_packet()
302 right ? "R" : "r", touch ? "T" : "t"); vsxxxaa_handle_ABS_packet()
309 input_report_key(dev, BTN_RIGHT, right); vsxxxaa_handle_ABS_packet()
320 int left, middle, right; vsxxxaa_handle_POR_packet() local
353 right = buf[0] & 0x01; vsxxxaa_handle_POR_packet()
362 input_report_key(dev, BTN_RIGHT, right); vsxxxaa_handle_POR_packet()
H A Dgpio_mouse.c38 x = (gpio_get_value(gpio->right) ^ gpio->polarity) gpio_mouse_scan()
134 pdata->bright < 0 ? "" : "right"); gpio_mouse_probe()
H A Dhgpk.c285 * swr/swl are the left/right buttons.
304 * swr/swl are the left/right buttons.
350 int right = !!(packet[3] & 2); hgpk_process_advanced_packet() local
374 left, right, x, y); hgpk_process_advanced_packet()
378 input_report_key(idev, BTN_RIGHT, right); hgpk_process_advanced_packet()
416 hgpk_spewing_hack(psmouse, left, right, x_diff, y_diff); hgpk_process_advanced_packet()
433 int right = (packet[0] >> 1) & 1; hgpk_process_simple_packet() local
448 hgpk_spewing_hack(psmouse, left, right, x, y); hgpk_process_simple_packet()
452 left, right, x, y); hgpk_process_simple_packet()
455 input_report_key(dev, BTN_RIGHT, right); hgpk_process_simple_packet()
556 /* All modes report left and right buttons */ hgpk_setup_input_device()
675 * If we get packets right away after recalibrating, it's likely hgpk_force_recalibrate()
890 * We queue work instead of doing recalibration right here hgpk_trigger_recal()
/linux-4.1.27/drivers/media/rc/keymaps/
H A Drc-kworld-plus-tv-analog.c28 { 0x03, KEY_4 }, /* Two keys have the same code: 3 and right */
46 /* Couldn't map key left/key right since those
H A Drc-lme2510.c59 { 0xbf06, KEY_VOLUMEDOWN }, /* Volume defined as right hand*/
80 { 0x43, KEY_VOLUMEDOWN }, /* Volume defined as right hand*/
H A Drc-avermedia-dvbt.c25 { 0x34, KEY_6 }, /* '6' / 'right arrow' */
H A Drc-it913x-v1.c64 { 0x807f03, KEY_VOLUMEDOWN }, /* Volume defined as right hand*/
H A Drc-su3000.c15 { 0x25, KEY_POWER }, /* right-bottom Red */
/linux-4.1.27/arch/tile/
H A DMakefile13 # If we're not cross-compiling, make sure we're on the right architecture.
46 # uses the right default anyway.
/linux-4.1.27/arch/mn10300/unit-asb2305/
H A Dleds.c27 ~0x04040404, /* right top - segB */
28 ~0x08080808, /* right bottom - segC */
/linux-4.1.27/arch/mn10300/unit-asb2364/
H A Dleds.c30 ~0x04040404, /* right top - segB */
31 ~0x08080808, /* right bottom - segC */
/linux-4.1.27/fs/gfs2/
H A Dlog.h19 * gfs2_log_lock - acquire the right to mess with the log manager
31 * gfs2_log_unlock - release the right to mess with the log manager
/linux-4.1.27/lib/mpi/
H A Dgeneric_mpih-rshift.c32 /* Shift U (pointed to by UP and USIZE limbs long) CNT bits to the right
34 * The bits shifted out to the right are returned.
/linux-4.1.27/arch/sparc/kernel/
H A Dvisemul.c250 u16 left, right; member in struct:edge_tab
296 u16 left, right; edge() local
311 right = edge8_tab[rs2 & 0x7].right; edge()
316 right = edge8_tab_l[rs2 & 0x7].right; edge()
322 right = edge16_tab[(rs2 >> 1) & 0x3].right; edge()
328 right = edge16_tab_l[(rs2 >> 1) & 0x3].right; edge()
334 right = edge32_tab[(rs2 >> 2) & 0x1].right; edge()
340 right = edge32_tab_l[(rs2 >> 2) & 0x1].right; edge()
345 rd_val = right & left; edge()
/linux-4.1.27/drivers/staging/speakup/
H A Di18n.c50 [MSG_EDGE_RIGHT] = "right,",
127 [MSG_KEYNAME_RIGHTBRACE] = "right brace",
154 [MSG_KEYNAME_RIGHTSHFT] = "right shift",
197 [MSG_KEYNAME_RIGHTCTRL] = "right control",
200 [MSG_KEYNAME_RIGHTALT] = "right alt",
206 [MSG_KEYNAME_RIGHT] = "right",
226 [MSG_KEYNAME_RIGHTMETA] = "right meta",
280 [MSG_KEYNAME_KPRIGHTPAR] = "keypad right paren",
304 [MSG_FUNCNAME_GOTO_RIGHT] = "go to right edge",
329 [MSG_FUNCNAME_SAY_TO_RIGHT] = "say to right",
/linux-4.1.27/sound/usb/
H A Dstream.c237 SNDRV_CHMAP_FR, /* right front */ convert_chmap()
241 SNDRV_CHMAP_SR, /* right surround */ convert_chmap()
243 SNDRV_CHMAP_FRC, /* right of center */ convert_chmap()
246 SNDRV_CHMAP_SR, /* side right */ convert_chmap()
252 SNDRV_CHMAP_FR, /* front right */ convert_chmap()
256 SNDRV_CHMAP_RR, /* back right */ convert_chmap()
258 SNDRV_CHMAP_FRC, /* front right of center */ convert_chmap()
261 SNDRV_CHMAP_SR, /* side right */ convert_chmap()
265 SNDRV_CHMAP_TFR, /* top front right */ convert_chmap()
268 SNDRV_CHMAP_TRR, /* top back right */ convert_chmap()
270 SNDRV_CHMAP_TFRC, /* top front right of center */ convert_chmap()
272 SNDRV_CHMAP_RLFE, /* right LFE */ convert_chmap()
274 SNDRV_CHMAP_TSR, /* top side right */ convert_chmap()
277 SNDRV_CHMAP_RRC, /* back right of center */ convert_chmap()
/linux-4.1.27/fs/nilfs2/
H A Dbtree.c194 /* Assume the buffer heads corresponding to left and right are locked. */ nilfs_btree_node_move_left()
196 struct nilfs_btree_node *right, nilfs_btree_node_move_left()
207 rdkeys = nilfs_btree_node_dkeys(right); nilfs_btree_node_move_left()
208 rdptrs = nilfs_btree_node_dptrs(right, rncmax); nilfs_btree_node_move_left()
209 rnchildren = nilfs_btree_node_get_nchildren(right); nilfs_btree_node_move_left()
219 nilfs_btree_node_set_nchildren(right, rnchildren); nilfs_btree_node_move_left()
222 /* Assume that the buffer heads corresponding to left and right are locked. */ nilfs_btree_node_move_right()
224 struct nilfs_btree_node *right, nilfs_btree_node_move_right()
235 rdkeys = nilfs_btree_node_dkeys(right); nilfs_btree_node_move_right()
236 rdptrs = nilfs_btree_node_dptrs(right, rncmax); nilfs_btree_node_move_right()
237 rnchildren = nilfs_btree_node_get_nchildren(right); nilfs_btree_node_move_right()
247 nilfs_btree_node_set_nchildren(right, rnchildren); nilfs_btree_node_move_right()
745 /* look-up right sibling node */ nilfs_btree_lookup_contig()
874 struct nilfs_btree_node *node, *right; nilfs_btree_carry_right() local
878 right = nilfs_btree_get_sib_node(path, level); nilfs_btree_carry_right()
880 rnchildren = nilfs_btree_node_get_nchildren(right); nilfs_btree_carry_right()
891 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); nilfs_btree_carry_right()
900 nilfs_btree_node_get_key(right, 0)); nilfs_btree_carry_right()
921 struct nilfs_btree_node *node, *right; nilfs_btree_split() local
927 right = nilfs_btree_get_sib_node(path, level); nilfs_btree_split()
938 nilfs_btree_node_move_right(node, right, n, ncblk, ncblk); nilfs_btree_split()
945 newkey = nilfs_btree_node_get_key(right, 0); nilfs_btree_split()
950 nilfs_btree_node_insert(right, path[level].bp_index, nilfs_btree_split()
953 *keyp = nilfs_btree_node_get_key(right, 0); nilfs_btree_split()
962 *keyp = nilfs_btree_node_get_key(right, 0); nilfs_btree_split()
1108 /* right sibling */ nilfs_btree_prepare_insert()
1313 struct nilfs_btree_node *node, *right; nilfs_btree_borrow_right() local
1319 right = nilfs_btree_get_sib_node(path, level); nilfs_btree_borrow_right()
1321 rnchildren = nilfs_btree_node_get_nchildren(right); nilfs_btree_borrow_right()
1326 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); nilfs_btree_borrow_right()
1335 nilfs_btree_node_get_key(right, 0)); nilfs_btree_borrow_right()
1372 struct nilfs_btree_node *node, *right; nilfs_btree_concat_right() local
1378 right = nilfs_btree_get_sib_node(path, level); nilfs_btree_concat_right()
1381 n = nilfs_btree_node_get_nchildren(right); nilfs_btree_concat_right()
1383 nilfs_btree_node_move_left(node, right, n, ncblk, ncblk); nilfs_btree_concat_right()
1481 /* right sibling */ nilfs_btree_prepare_delete()
1498 * When merging right sibling node nilfs_btree_prepare_delete()
1500 * the right sibling node must be nilfs_btree_prepare_delete()
195 nilfs_btree_node_move_left(struct nilfs_btree_node *left, struct nilfs_btree_node *right, int n, int lncmax, int rncmax) nilfs_btree_node_move_left() argument
223 nilfs_btree_node_move_right(struct nilfs_btree_node *left, struct nilfs_btree_node *right, int n, int lncmax, int rncmax) nilfs_btree_node_move_right() argument
/linux-4.1.27/drivers/video/fbdev/
H A Darcfb.c248 unsigned int left, unsigned int right, unsigned int distance) arcfb_lcd_update_page()
269 while (left <= right) { arcfb_lcd_update_page()
296 * chip to select for the right. upper is needed for setting the page
300 unsigned int bottom, unsigned int left, unsigned int right) arcfb_lcd_update_vert()
310 arcfb_lcd_update_page(par, upper, left, right, 8); arcfb_lcd_update_vert()
322 unsigned int right, unsigned int top, unsigned int h) arcfb_lcd_update_horiz()
332 arcfb_lcd_update_vert(par, upper, lower, left, right); arcfb_lcd_update_horiz()
346 unsigned int left, right, distance, y; arcfb_lcd_update() local
355 right = min(left + w - 1, ceil64(left)); arcfb_lcd_update()
358 arcfb_lcd_update_horiz(par, left, right, y, h); arcfb_lcd_update()
359 distance -= ((right - left) + 1); arcfb_lcd_update()
360 left = right + 1; arcfb_lcd_update()
361 right = min(left + distance - 1, ceil64(left)); arcfb_lcd_update()
247 arcfb_lcd_update_page(struct arcfb_par *par, unsigned int upper, unsigned int left, unsigned int right, unsigned int distance) arcfb_lcd_update_page() argument
299 arcfb_lcd_update_vert(struct arcfb_par *par, unsigned int top, unsigned int bottom, unsigned int left, unsigned int right) arcfb_lcd_update_vert() argument
321 arcfb_lcd_update_horiz(struct arcfb_par *par, unsigned int left, unsigned int right, unsigned int top, unsigned int h) arcfb_lcd_update_horiz() argument
H A Damifb.c120 | left # | # right | hsync |
288 xres yres left right upper lower hsync vsync
299 xres yres left right upper lower hsync vsync
2548 * on the right side will never be seen amifb_pan_display()
2604 int shift = dst_idx - src_idx, left, right; bitcpy() local
2656 right = shift & (BITS_PER_LONG - 1); bitcpy()
2665 *dst = comp(*src >> right, *dst, first); bitcpy()
2673 *dst = comp(d0 << left | d1 >> right, *dst, bitcpy()
2682 *dst = comp(d0 >> right, *dst, first); bitcpy()
2688 *dst = comp(d0 << left | d1 >> right, *dst, bitcpy()
2700 *dst++ = d0 << left | d1 >> right; bitcpy()
2703 *dst++ = d0 << left | d1 >> right; bitcpy()
2706 *dst++ = d0 << left | d1 >> right; bitcpy()
2709 *dst++ = d0 << left | d1 >> right; bitcpy()
2715 *dst++ = d0 << left | d1 >> right; bitcpy()
2721 if (m <= right) { bitcpy()
2727 *dst = comp(d0 << left | d1 >> right, bitcpy()
2744 int shift = dst_idx - src_idx, left, right; bitcpy_rev() local
2807 right = shift & (BITS_PER_LONG - 1); bitcpy_rev()
2819 *dst = comp(*src >> right, *dst, first); bitcpy_rev()
2824 *dst = comp(d0 >> right | d1 << left, *dst, bitcpy_rev()
2839 *dst = comp(d0 >> right | d1 << left, *dst, bitcpy_rev()
2851 *dst-- = d0 >> right | d1 << left; bitcpy_rev()
2854 *dst-- = d0 >> right | d1 << left; bitcpy_rev()
2857 *dst-- = d0 >> right | d1 << left; bitcpy_rev()
2860 *dst-- = d0 >> right | d1 << left; bitcpy_rev()
2866 *dst-- = d0 >> right | d1 << left; bitcpy_rev()
2874 *dst = comp(d0 >> right, *dst, last); bitcpy_rev()
2878 *dst = comp(d0 >> right | d1 << left, bitcpy_rev()
2896 int shift = dst_idx - src_idx, left, right; bitcpy_not() local
2948 right = shift & (BITS_PER_LONG - 1); bitcpy_not()
2957 *dst = comp(~*src >> right, *dst, first); bitcpy_not()
2965 *dst = comp(d0 << left | d1 >> right, *dst, bitcpy_not()
2974 *dst = comp(d0 >> right, *dst, first); bitcpy_not()
2980 *dst = comp(d0 << left | d1 >> right, *dst, bitcpy_not()
2992 *dst++ = d0 << left | d1 >> right; bitcpy_not()
2995 *dst++ = d0 << left | d1 >> right; bitcpy_not()
2998 *dst++ = d0 << left | d1 >> right; bitcpy_not()
3001 *dst++ = d0 << left | d1 >> right; bitcpy_not()
3007 *dst++ = d0 << left | d1 >> right; bitcpy_not()
3013 if (m <= right) { bitcpy_not()
3019 *dst = comp(d0 << left | d1 >> right, bitcpy_not()
/linux-4.1.27/drivers/media/pci/saa7134/
H A Dsaa7134-alsa.c400 int left, int right, bool force_notify) snd_saa7134_capsrc_set()
413 active = left != 0 || right != 0; snd_saa7134_capsrc_set()
420 chip->capture_source[1] != right; snd_saa7134_capsrc_set()
423 chip->capture_source[1] = right; snd_saa7134_capsrc_set()
477 if (left || right) { snd_saa7134_capsrc_set()
511 * Called right after the capture device is opened, this function configures
678 * Called on initialization, right before the PCM preparation
956 int left, right; snd_saa7134_volume_put() local
963 right = ucontrol->value.integer.value[1]; snd_saa7134_volume_put()
964 if (right < 0) snd_saa7134_volume_put()
965 right = 0; snd_saa7134_volume_put()
966 if (right > 20) snd_saa7134_volume_put()
967 right = 20; snd_saa7134_volume_put()
972 right = left; snd_saa7134_volume_put()
974 if (chip->mixer_volume[addr][1] != right) { snd_saa7134_volume_put()
976 left = right; snd_saa7134_volume_put()
1013 chip->mixer_volume[addr][1] = right; snd_saa7134_volume_put()
1057 int left, right; snd_saa7134_capsrc_put() local
1059 right = ucontrol->value.integer.value[1] & 1; snd_saa7134_capsrc_put()
1061 return snd_saa7134_capsrc_set(kcontrol, left, right, false); snd_saa7134_capsrc_put()
399 snd_saa7134_capsrc_set(struct snd_kcontrol *kcontrol, int left, int right, bool force_notify) snd_saa7134_capsrc_set() argument
/linux-4.1.27/drivers/media/radio/
H A Dradio-sf16fmr2.c152 int volume, balance, left, right; fmr2_s_ctrl() local
167 left = right = volume; fmr2_s_ctrl()
169 right = max(0, right + balance); fmr2_s_ctrl()
174 tc9154a_set_attenuation(fmr2, abs(right - 68), TC9154A_CHANNEL_RIGHT); fmr2_s_ctrl()
/linux-4.1.27/drivers/input/joystick/
H A Dxpad.c234 BTN_TRIGGER_HAPPY1, BTN_TRIGGER_HAPPY2, /* d-pad left, right */
241 BTN_TL2, BTN_TR2, /* triggers left/right */
254 ABS_RX, ABS_RY, /* right stick */
266 ABS_Z, ABS_RZ, /* triggers left/right */
370 /* right stick */ xpad_process_packet()
377 /* triggers left/right */ xpad_process_packet()
388 /* dpad as buttons (left, right, up, down) */ xpad_process_packet()
400 /* start/back buttons and stick press left/right */ xpad_process_packet()
436 /* dpad as buttons (left, right, up, down) */ xpad360_process_packet()
452 /* stick press left/right */ xpad360_process_packet()
472 /* right stick */ xpad360_process_packet()
479 /* triggers left/right */ xpad360_process_packet()
545 /* dpad as buttons (left, right, up, down) */ xpadone_process_buttons()
561 /* stick press left/right */ xpadone_process_buttons()
572 /* right stick */ xpadone_process_buttons()
579 /* triggers left/right */ xpadone_process_buttons()
798 xpad->odata[5] = weak / 256; /* right actuator */ xpad_play_effect()
808 xpad->odata[4] = weak / 256; /* right actuator? */ xpad_play_effect()
843 xpad->odata[9] = weak / 256; /* right actuator */ xpad_play_effect()
/linux-4.1.27/drivers/mtd/devices/
H A Dms02-nv.h29 * but we can't really use the available area right from 0x000400 as
55 * with the LEDs at the top left and the battery at the bottom right
60 * right LED battery condition status: lit = OK
/linux-4.1.27/arch/microblaze/kernel/
H A Dprocess.c90 * RETURN() and we want to have the right machine state there copy_thread()
93 * compose the right MSR for RETURN(). It will work for switch_to also copy_thread()
96 * right now MSR is a copy of parent one */ copy_thread()
/linux-4.1.27/fs/ncpfs/
H A Dfile.c32 int ncp_make_open(struct inode *inode, int right) ncp_make_open() argument
61 switch (right) { ncp_make_open()
89 if (access == right || access == O_RDWR) { ncp_make_open()
/linux-4.1.27/include/uapi/linux/dvb/
H A Daudio.h71 int vocal1; /* into left and right t at 70% each */
74 /* Vocal2 into the right channel at 100% each. */
76 } audio_karaoke_t; /* into left and right */
/linux-4.1.27/sound/pci/cs46xx/
H A Ddsp_spos.h220 u16 left, u16 right) cs46xx_dsp_scb_set_volume()
222 unsigned int val = ((0xffff - left) << 16 | (0xffff - right)); cs46xx_dsp_scb_set_volume()
228 scb->volume[1] = right; cs46xx_dsp_scb_set_volume()
218 cs46xx_dsp_scb_set_volume(struct snd_cs46xx * chip, struct dsp_scb_descriptor * scb, u16 left, u16 right) cs46xx_dsp_scb_set_volume() argument
/linux-4.1.27/drivers/s390/crypto/
H A Dzcrypt_pcica.h34 * Note that all unsigned char arrays are right-justified and left-padded
97 * Note that all unsigned char arrays are right-justified and left-padded
/linux-4.1.27/arch/x86/xen/
H A Dxen-head.S1 /* Xen-specific pieces of head.S, intended to be included in the right
31 * clarifies what the right flags need to be.
/linux-4.1.27/include/math-emu/
H A Dop-8.h76 * What this actually means is that we do a standard right-shift,
77 * but that if any of the bits that fall off the right hand side
/linux-4.1.27/arch/mips/math-emu/
H A Ddp_add.c132 * Have to shift y fraction right to align. ieee754dp_add()
139 * Have to shift x fraction right to align. ieee754dp_add()
H A Dsp_add.c132 * Have to shift y fraction right to align. ieee754sp_add()
138 * Have to shift x fraction right to align. ieee754sp_add()
H A Dsp_sub.c134 * have to shift y fraction right to align ieee754sp_sub()
140 * have to shift x fraction right to align ieee754sp_sub()
H A Dieee754dp.h48 /* 3bit extended double precision sticky right shift */
H A Dsp_fdp.c76 * Convert from DP_FBITS to SP_FBITS+3 with sticky right shift. ieee754sp_fdp()
H A Dsp_sqrt.c86 r = 0x01000000; /* r = moving bit from right to left */ ieee754sp_sqrt()
/linux-4.1.27/net/wimax/
H A Dwimax-internal.h48 * function to check if the state is the right one.
50 * An error value will be returned if the state is not the right
/linux-4.1.27/fs/reiserfs/
H A Dfix_node.c15 * will shift to left/right neighbor, or to a new node, where new item
23 * have to have if we do not any shiftings, if we shift to left/right
147 * set right merge flag we take right delimiting key and create_virtual_node()
166 * with right neighbor's first item create_virtual_node()
278 * shifted to right neighbor
323 /* last item may be merge with first item in right neighbor */ check_right()
368 * to - number of item, which are shifted to right neighbor entirely
372 * which are shifted to right neighbor
617 * rbytes number of bytes which flow to the right neighbor from the
652 * neighbor and tb->rnum[0] to the right one.
662 * number of items that will be shifted to left (right) neighbor is_leaf_removable()
731 * not be that first one because its right neighbor are_leaves_removable()
937 * Get free space of the right neighbor,
938 * which is stored in the parent node of the right neighbor.
1015 * Calculate far left/right parent of the left/right neighbor of the
1016 * current node, that is calculate the left/right (FL[h]/FR[h]) neighbor
1018 * Calculate left/right common parent of the current node and L[h]/R[h].
1019 * Calculate left/right delimiting key position.
1123 * left/right neighbor. Now we are getting the parent of the get_far_parent()
1124 * left/right neighbor. get_far_parent()
1127 /* Form key to get parent of the left/right neighbor. */ get_far_parent()
1169 * Calculate numbers of left and right delimiting keys position:
1238 * Calculate current parent of R[h], which is the right get_parents()
1343 * right, and lrnver is the number if we shift in both directions. ip_check_balance()
1367 * 4,5 - shift to right (whole items and as much as possible ip_check_balance()
1425 * determine maximal number of items we can shift to the right ip_check_balance()
1427 * that can flow to the right neighbor from the right most liquid ip_check_balance()
1443 * routine we set the left node equal to the right node, ip_check_balance()
1496 * lpar, rpar - number of items we can shift to left/right ip_check_balance()
1545 * l_shift_num first items and l_shift_bytes of the right ip_check_balance()
1571 * liquid item to be shifted are shifted to the right neighbor, ip_check_balance()
1672 * direction either to the left or to the right is required ip_check_balance()
1677 * shifting to the right ip_check_balance()
1685 * if shifting to the right is better than ip_check_balance()
1703 * shift to the right independently on whether the ip_check_balance()
1704 * right neighbor in cache or not ip_check_balance()
1867 /* Check whether we can merge S[h] with right neighbor. */ dc_check_balance_internal()
1981 * determine maximal number of items we can shift to the left/right dc_check_balance_leaf()
1983 * left/right neighbor from the left/right most liquid item that dc_check_balance_leaf()
2002 /* check whether we can merge S[0] with right neighbor. */ dc_check_balance_leaf()
2206 /* We need right neighbor to balance S[path_offset]. */ get_neighbors()
2237 "PAP-8300: invalid child size of right neighbor (%d != %d - %d)", get_neighbors()
/linux-4.1.27/drivers/hwmon/
H A Dlm75.h46 /* use integer division instead of equivalent right shift to LM75_TEMP_FROM_REG()
/linux-4.1.27/drivers/media/pci/cx23885/
H A Dcx23885-av.c36 /* clear left and right adc channel interrupt request flag */ cx23885_av_work_handler()
/linux-4.1.27/arch/x86/kernel/
H A Dsysfb_efi.c176 /* At least one of these two will be right; maybe both? */
179 /* At least one of these two will be right; maybe both? */
190 /* At least one of these two will be right; maybe both? */
193 /* At least one of these two will be right; maybe both? */
/linux-4.1.27/arch/x86/vdso/vdso32/
H A Dnote.S26 * corresponding to the bits here is needed to make ldconfig work right.
/linux-4.1.27/arch/um/kernel/
H A Duml.lds.S11 /* This must contain the right address - not quite the default ELF one.*/
/linux-4.1.27/arch/mips/dec/
H A Dwbflush.c2 * Setup the right wbflush routine for the different DECstations.
/linux-4.1.27/drivers/video/fbdev/kyro/
H A DSTG4000Interface.h57 u32 right, u32 bottom);
H A DSTG4000OverlayDevice.c319 u32 right, u32 bottom) SetOverlayViewPort()
353 srcDest.ulDstX2 = right; SetOverlayViewPort()
425 * lowest to the next lowest 128 bit boundary, and the right hand edge SetOverlayViewPort()
427 * PMX1) as the left and right hand edges are aligned to these SetOverlayViewPort()
495 * we must align the right hand edge to the next 32 SetOverlayViewPort()
504 * we must align the right hand edge to the next SetOverlayViewPort()
317 SetOverlayViewPort(volatile STG4000REG __iomem *pSTGReg, u32 left, u32 top, u32 right, u32 bottom) SetOverlayViewPort() argument
/linux-4.1.27/arch/mips/include/asm/sn/
H A Dfru.h25 *I think this is the right number
/linux-4.1.27/arch/mips/pci/
H A Dfixup-ip32.c40 * right if there exists such a broken piece of crap.
/linux-4.1.27/arch/ia64/include/asm/
H A Dirqflags.h31 * write a floating-point register right before reading the PSR
/linux-4.1.27/arch/ia64/include/asm/uv/
H A Duv_hub.h34 * right shift the NASID by 1 to exclude the always-zero bit.
37 * GNODE - NASID right shifted by 1 bit. Most mmrs contain gnodes instead
119 * g - GNODE (full 15-bit global nasid, right shifted 1)
120 * p - PNODE (local part of nsids, right shifted 1)
/linux-4.1.27/arch/ia64/lib/
H A Dstrlen.S103 sub tmp=64,tmp // how many bits to shift our mask on the right
113 czx1.r val1=v[1] // search 0 byte from right
114 czx1.r val2=w[1] // search 0 byte from right following 8bytes
180 czx1.r val1=val // search 0 byte from right
H A Dstrlen_user.S105 sub tmp=64,tmp // how many bits to shift our mask on the right
116 czx1.r val1=v[1] // search 0 byte from right
117 czx1.r val2=w[1] // search 0 byte from right following 8bytes
177 czx1.r val1=val // search 0 byte from right
/linux-4.1.27/arch/m68k/include/asm/
H A Dswitch_to.h22 * to push them onto the stack and read them back right after.
/linux-4.1.27/arch/m68k/kernel/
H A Dsun3-head.S64 movc %d0, %cacr | is this the right value? (yes --m)
/linux-4.1.27/arch/alpha/kernel/
H A Dconsole.c80 * the right one... find_console_vga_hose()
/linux-4.1.27/arch/arc/include/asm/
H A Ddelay.h47 * -Divide by 2^32 is very simply right shift by 32
/linux-4.1.27/sound/mips/
H A Dhal2.h156 #define H2I_C2_R_GAIN_SHIFT 0 /* right a/d input gain */
160 #define H2I_C2_R_SEL 0x100 /* right input select */
165 #define H2I_C2_R_ATT_SHIFT 18 /* right d/a output - */
231 u32 right; /* Right volume */ member in struct:hal2_vol_regs
/linux-4.1.27/sound/soc/blackfin/
H A Dbf5xx-ac97.h23 u16 ac97_sr; /*slot 8:surround right*/
/linux-4.1.27/tools/power/cpupower/utils/idle_monitor/
H A Dcpupower-monitor.h23 /* Hard to define the right names ...: */
/linux-4.1.27/include/asm-generic/
H A Dpgtable-nopmd.h13 * Having the pmd type consist of a pud gets the size right, and allows
H A Dpgtable-nopud.h9 * Having the pud type consist of a pgd gets the size right, and allows
/linux-4.1.27/drivers/media/pci/cx88/
H A Dcx88-alsa.c667 int right = value->value.integer.value[1]; snd_cx88_wm8775_volume_put() local
671 if (left >= right) { snd_cx88_wm8775_volume_put()
673 b = left ? (0x8000 * right) / left : 0x8000; snd_cx88_wm8775_volume_put()
675 v = right << 10; snd_cx88_wm8775_volume_put()
676 b = right ? 0xffff - (0x8000 * left) / right : 0x8000; snd_cx88_wm8775_volume_put()
688 int left, right, v, b; snd_cx88_volume_put() local
696 right = value->value.integer.value[1] & 0x3f; snd_cx88_volume_put()
697 b = right - left; snd_cx88_volume_put()
702 v = 0x3f - right; snd_cx88_volume_put()
/linux-4.1.27/drivers/gpu/drm/omapdrm/
H A Dtcm-sita.c258 * and p0.y <= p1.y; whereas, for a scan from bottom-right p1.x <= p0.x and p1.y
263 * Raster scan horizontally right to left from top to bottom to find a place for
304 /* scan field top-to-bottom, right-to-left */ scan_r2l_t2b()
337 * Raster scan horizontally left to right from top to bottom to find a place for
380 /* scan field top-to-bottom, left-to-right */ scan_l2r_t2b()
413 * Raster scan horizontally right to left from bottom to top to find a place
455 /* remember bottom-right corner */ scan_r2l_b2t_one_dim()
532 /* prefer top-right corner */ scan_areas_and_find_fit()
660 * search direction is right-to-left or bottom-to-top. get_nearness_factor()
691 /* process left & right edges */ get_neighbor_stats()
/linux-4.1.27/sound/isa/sb/
H A Dsb_mixer.c132 unsigned char left, right; snd_sbmixer_get_double() local
136 right = (snd_sbmixer_read(sb, right_reg) >> right_shift) & mask; snd_sbmixer_get_double()
139 ucontrol->value.integer.value[1] = right; snd_sbmixer_get_double()
153 unsigned char left, right, oleft, oright; snd_sbmixer_put_double() local
156 right = (ucontrol->value.integer.value[1] & mask) << right_shift; snd_sbmixer_put_double()
160 left = (oleft & ~((mask << left_shift) | (mask << right_shift))) | left | right; snd_sbmixer_put_double()
168 right = (oright & ~(mask << right_shift)) | right; snd_sbmixer_put_double()
169 change = left != oleft || right != oright; snd_sbmixer_put_double()
172 snd_sbmixer_write(sb, right_reg, right); snd_sbmixer_put_double()
/linux-4.1.27/sound/parisc/
H A Dharmony.c720 int left, right; snd_harmony_volume_get() local
725 right = (h->st.gain >> shift_right) & mask; snd_harmony_volume_get()
728 right = mask - right; snd_harmony_volume_get()
733 ucontrol->value.integer.value[1] = right; snd_harmony_volume_get()
749 int left, right; snd_harmony_volume_put() local
761 right = ucontrol->value.integer.value[1] & mask; snd_harmony_volume_put()
763 right = mask - right; snd_harmony_volume_put()
765 h->st.gain |= (right << shift_right); snd_harmony_volume_put()
/linux-4.1.27/fs/jfs/
H A Djfs_xtree.c272 * the entry to be shifted right for insertion of new entry. xtSearch()
640 /* if insert into middle, shift right remaining entries. */ xtInsert()
695 s64 rbn; /* new right page block number */ xtSplitUp()
697 xtpage_t *rcp; /* right child page */ xtSplitUp()
698 s64 rcbn; /* right child page block number */ xtSplitUp()
728 /* if insert into middle, shift right remaining entries. */ xtSplitUp()
787 * Split leaf page <sp> into <sp> and a new right page <rp>. xtSplitUp()
814 * a new entry is inserted at its right with the first key and xtSplitUp()
815 * block number of the new right page. xtSplitUp()
818 * right child, left parent and right parent (when the parent splits) xtSplitUp()
831 * insert router entry in parent for new right child page <rp> xtSplitUp()
842 * because the split was to the right. xtSplitUp()
847 * split or shift right remaining entries of the parent page xtSplitUp()
862 /* unpin previous right child page */ xtSplitUp()
885 * insert router entry in parent for the right child xtSplitUp()
886 * page from the first entry of the right child page: xtSplitUp()
896 * if insert into middle, shift right remaining entries xtSplitUp()
932 /* unpin current right page */ xtSplitUp()
944 * original/split/left page and new right page
965 xtpage_t *rp; /* new right page allocated */ xtSplitPage()
966 s64 rbn; /* new right page block number */ xtSplitPage()
996 * allocate the new right page for the split xtSplitPage()
1021 * acquire a transaction lock on the new right page; xtSplitPage()
1050 * if we're wrong it's no big deal - we will do the split the right xtSplitPage()
1058 * acquire a transaction lock on the new/right page; xtSplitPage()
1062 /* insert entry at the first entry of the new right page */ xtSplitPage()
1086 * update previous pointer of old next/right page of <sp> xtSplitPage()
1114 * split the data between the split and new/right pages xtSplitPage()
1124 /* move right half of split page to the new right page */ xtSplitPage()
1128 /* shift right tail of left half to make room for new entry */ xtSplitPage()
1149 * skip index in new right page - insert into right page: xtSplitPage()
1152 /* move left head of right half to right page */ xtSplitPage()
1163 /* move right tail of right half to right page */ xtSplitPage()
1209 * right page
1211 * copied to a single new right child page since root page <<
1213 * for the new right child page.
1245 * allocate a single (right) child page xtSplitRoot()
1265 * acquire a transaction lock on the new right page; xtSplitRoot()
1283 * copy the in-line root page into new right page extent xtSplitRoot()
1290 * insert the new entry into the new right/child page xtSplitRoot()
1291 * (skip index in the new right page will not change) xtSplitRoot()
1294 /* if insert into middle, shift right remaining entries */ xtSplitRoot()
1316 * init root with the single entry for the new right page xtSplitRoot()
1806 /* extend right lXAD */ xtUpdate()
1811 * right extent gets logged. If the left one is marked XAD_NEW, xtUpdate()
1860 * coalesce with right XAD xtUpdate()
1883 * the left extent gets logged. If the right one is marked xtUpdate()
1979 /* if insert into middle, shift right remaining entries */ xtUpdate()
2018 /* get new right page */ xtUpdate()
2123 /* if insert into middle, shift right remaining entries */ xtUpdate()
2922 * the entry to be shifted right for insertion of new entry. xtSearchNode()
3254 * already freed a page that was formerly to the right, let's make xtTruncate()
/linux-4.1.27/sound/isa/opti9xx/
H A Dmiro.c488 int left, right, left_old, right_old; snd_miro_put_double() local
493 right = ucontrol->value.integer.value[1]; snd_miro_put_double()
520 right < -0x7f || right > 0x7f) snd_miro_put_double()
544 if (right >= 0) { snd_miro_put_double()
545 error = aci_setvalue(aci, setreg_right, right); snd_miro_put_double()
548 right, error); snd_miro_put_double()
552 error = aci_setvalue(aci, setreg_right, 0x80 - right); snd_miro_put_double()
555 0x80 - right, error); snd_miro_put_double()
565 right < 0 || right > 0x20) snd_miro_put_double()
577 error = aci_setvalue(aci, setreg_right, 0x20 - right); snd_miro_put_double()
580 0x20 - right, error); snd_miro_put_double()
585 change = (left != left_old) || (right != right_old); snd_miro_put_double()
/linux-4.1.27/net/ipv6/
H A Dip6_fib.c479 fn = dir ? fn->right : fn->left; fib6_add_1()
513 pn->right = ln; fib6_add_1()
574 pn->right = in; fib6_add_1()
586 in->right = ln; fib6_add_1()
590 in->right = fn; fib6_add_1()
612 pn->right = ln; fib6_add_1()
617 ln->right = fn; fib6_add_1()
1072 next = dir ? fn->right : fn->left; fib6_lookup_1()
1171 fn = fn->right; fib6_locate_1()
1216 if (fn->right) fib6_find_prefix()
1217 return fn->right->leaf; fib6_find_prefix()
1248 if (fn->right) fib6_repair_tree()
1249 child = fn->right, children |= 1; fib6_repair_tree()
1279 if (pn->right == fn) fib6_repair_tree()
1280 pn->right = child; fib6_repair_tree()
1489 if (fn->right) { fib6_walk_continue()
1490 w->node = fn->right; fib6_walk_continue()
1530 if (pn->right == fn) { fib6_walk_continue()
/linux-4.1.27/drivers/input/touchscreen/
H A Dtouchit213.c50 * right and y is the vertical axis with values growing from top to
56 * right to left.
/linux-4.1.27/drivers/leds/
H A Dleds-sunfire.c186 .name = "clockboard-right",
207 .name = "fhc-right",

Completed in 7220 milliseconds

1234567891011>>