Searched refs:left (Results 1 - 200 of 2390) sorted by relevance

1234567891011>>

/linux-4.1.27/net/sunrpc/
H A Dsysctl.c82 size_t left, len; proc_dodebug() local
89 left = *lenp; proc_dodebug()
92 if (!access_ok(VERIFY_READ, buffer, left)) proc_dodebug()
95 while (left && __get_user(c, p) >= 0 && isspace(c)) proc_dodebug()
96 left--, p++; proc_dodebug()
97 if (!left) proc_dodebug()
100 if (left > sizeof(tmpbuf) - 1) proc_dodebug()
102 if (copy_from_user(tmpbuf, p, left)) proc_dodebug()
104 tmpbuf[left] = '\0'; proc_dodebug()
106 for (s = tmpbuf, value = 0; '0' <= *s && *s <= '9'; s++, left--) proc_dodebug()
110 while (left && isspace(*s)) proc_dodebug()
111 left--, s++; proc_dodebug()
117 if (!access_ok(VERIFY_WRITE, buffer, left)) proc_dodebug()
120 if (len > left) proc_dodebug()
121 len = left; proc_dodebug()
124 if ((left -= len) > 0) { proc_dodebug()
127 left--; proc_dodebug()
132 *lenp -= left; proc_dodebug()
/linux-4.1.27/scripts/kconfig/
H A Dexpr.c24 e->left.sym = sym; expr_alloc_symbol()
32 e->left.expr = ce; expr_alloc_one()
40 e->left.expr = e1; expr_alloc_two()
49 e->left.sym = s1; expr_alloc_comp()
79 e->left = org->left; expr_copy()
82 e->left.expr = expr_copy(org->left.expr); expr_copy()
86 e->left.sym = org->left.sym; expr_copy()
92 e->left.expr = expr_copy(org->left.expr); expr_copy()
114 expr_free(e->left.expr); expr_free()
121 expr_free(e->left.expr); expr_free()
139 __expr_eliminate_eq(type, &e1->left.expr, &e2); __expr_eliminate_eq()
144 __expr_eliminate_eq(type, &e1, &e2->left.expr); __expr_eliminate_eq()
149 e1->left.sym == e2->left.sym && __expr_eliminate_eq()
150 (e1->left.sym == &symbol_yes || e1->left.sym == &symbol_no)) __expr_eliminate_eq()
204 return e1->left.sym == e2->left.sym && e1->right.sym == e2->right.sym; expr_eq()
206 return e1->left.sym == e2->left.sym; expr_eq()
208 return expr_eq(e1->left.expr, e2->left.expr); expr_eq()
216 e1->left.sym == e2->left.sym); expr_eq()
243 e->left.expr = expr_eliminate_yn(e->left.expr); expr_eliminate_yn()
245 if (e->left.expr->type == E_SYMBOL) { expr_eliminate_yn()
246 if (e->left.expr->left.sym == &symbol_no) { expr_eliminate_yn()
247 expr_free(e->left.expr); expr_eliminate_yn()
250 e->left.sym = &symbol_no; expr_eliminate_yn()
253 } else if (e->left.expr->left.sym == &symbol_yes) { expr_eliminate_yn()
254 free(e->left.expr); expr_eliminate_yn()
262 if (e->right.expr->left.sym == &symbol_no) { expr_eliminate_yn()
263 expr_free(e->left.expr); expr_eliminate_yn()
266 e->left.sym = &symbol_no; expr_eliminate_yn()
269 } else if (e->right.expr->left.sym == &symbol_yes) { expr_eliminate_yn()
271 tmp = e->left.expr; expr_eliminate_yn()
272 *e = *(e->left.expr); expr_eliminate_yn()
279 e->left.expr = expr_eliminate_yn(e->left.expr); expr_eliminate_yn()
281 if (e->left.expr->type == E_SYMBOL) { expr_eliminate_yn()
282 if (e->left.expr->left.sym == &symbol_no) { expr_eliminate_yn()
283 free(e->left.expr); expr_eliminate_yn()
288 } else if (e->left.expr->left.sym == &symbol_yes) { expr_eliminate_yn()
289 expr_free(e->left.expr); expr_eliminate_yn()
292 e->left.sym = &symbol_yes; expr_eliminate_yn()
298 if (e->right.expr->left.sym == &symbol_no) { expr_eliminate_yn()
300 tmp = e->left.expr; expr_eliminate_yn()
301 *e = *(e->left.expr); expr_eliminate_yn()
304 } else if (e->right.expr->left.sym == &symbol_yes) { expr_eliminate_yn()
305 expr_free(e->left.expr); expr_eliminate_yn()
308 e->left.sym = &symbol_yes; expr_eliminate_yn()
331 e->left.expr = expr_trans_bool(e->left.expr); expr_trans_bool()
336 if (e->left.sym->type == S_TRISTATE) { expr_trans_bool()
364 tmp = e1->left.expr; expr_join_or()
367 sym1 = tmp->left.sym; expr_join_or()
369 sym1 = e1->left.sym; expr_join_or()
371 if (e2->left.expr->type != E_SYMBOL) expr_join_or()
373 sym2 = e2->left.expr->left.sym; expr_join_or()
375 sym2 = e2->left.sym; expr_join_or()
401 if ((e1->type == E_NOT && e1->left.expr->type == E_SYMBOL && e2->type == E_SYMBOL) || expr_join_or()
402 (e2->type == E_NOT && e2->left.expr->type == E_SYMBOL && e1->type == E_SYMBOL)) expr_join_or()
428 tmp = e1->left.expr; expr_join_and()
431 sym1 = tmp->left.sym; expr_join_and()
433 sym1 = e1->left.sym; expr_join_and()
435 if (e2->left.expr->type != E_SYMBOL) expr_join_and()
437 sym2 = e2->left.expr->left.sym; expr_join_and()
439 sym2 = e2->left.sym; expr_join_and()
517 expr_eliminate_dups1(type, &e1->left.expr, &e2); expr_eliminate_dups1()
522 expr_eliminate_dups1(type, &e1, &e2->left.expr); expr_eliminate_dups1()
569 expr_eliminate_dups2(type, &e1->left.expr, &e2); expr_eliminate_dups2()
574 expr_eliminate_dups2(type, &e1, &e2->left.expr); expr_eliminate_dups2()
655 e->left.expr = expr_transform(e->left.expr); expr_transform()
661 if (e->left.sym->type != S_BOOLEAN) expr_transform()
665 e->left.expr = expr_alloc_symbol(e->left.sym); expr_transform()
670 printf("boolean symbol %s tested for 'm'? test forced to 'n'\n", e->left.sym->name); expr_transform()
672 e->left.sym = &symbol_no; expr_transform()
683 if (e->left.sym->type != S_BOOLEAN) expr_transform()
691 printf("boolean symbol %s tested for 'm'? test forced to 'y'\n", e->left.sym->name); expr_transform()
693 e->left.sym = &symbol_yes; expr_transform()
699 e->left.expr = expr_alloc_symbol(e->left.sym); expr_transform()
705 switch (e->left.expr->type) { expr_transform()
708 tmp = e->left.expr->left.expr; expr_transform()
709 free(e->left.expr); expr_transform()
717 tmp = e->left.expr; expr_transform()
724 tmp = e->left.expr; expr_transform()
733 tmp = e->left.expr; expr_transform()
741 if (e->left.expr->left.sym == &symbol_yes) { expr_transform()
743 tmp = e->left.expr; expr_transform()
747 e->left.sym = &symbol_no; expr_transform()
750 if (e->left.expr->left.sym == &symbol_mod) { expr_transform()
752 tmp = e->left.expr; expr_transform()
756 e->left.sym = &symbol_mod; expr_transform()
759 if (e->left.expr->left.sym == &symbol_no) { expr_transform()
761 tmp = e->left.expr; expr_transform()
765 e->left.sym = &symbol_yes; expr_transform()
787 return expr_contains_symbol(dep->left.expr, sym) || expr_contains_symbol()
790 return dep->left.sym == sym; expr_contains_symbol()
793 return dep->left.sym == sym || expr_contains_symbol()
796 return expr_contains_symbol(dep->left.expr, sym); expr_contains_symbol()
810 return expr_depends_symbol(dep->left.expr, sym) || expr_depends_symbol()
813 return dep->left.sym == sym; expr_depends_symbol()
815 if (dep->left.sym == sym) { expr_depends_symbol()
821 if (dep->left.sym == sym) { expr_depends_symbol()
859 expr_extract_eq(type, ep, &e1->left.expr, &e2); expr_extract_eq()
864 expr_extract_eq(type, ep, ep1, &e2->left.expr); expr_extract_eq()
895 e1 = expr_trans_compare(e->left.expr, E_EQUAL, sym); expr_trans_compare()
905 e1 = expr_trans_compare(e->left.expr, E_EQUAL, sym); expr_trans_compare()
915 return expr_trans_compare(e->left.expr, type == E_EQUAL ? E_UNEQUAL : E_EQUAL, sym); expr_trans_compare()
935 return expr_alloc_comp(type, e->left.sym, sym); expr_trans_compare()
954 sym_calc_value(e->left.sym); expr_calc_value()
955 return e->left.sym->curr.tri; expr_calc_value()
957 val1 = expr_calc_value(e->left.expr); expr_calc_value()
961 val1 = expr_calc_value(e->left.expr); expr_calc_value()
965 val1 = expr_calc_value(e->left.expr); expr_calc_value()
968 sym_calc_value(e->left.sym); expr_calc_value()
970 str1 = sym_get_string_value(e->left.sym); expr_calc_value()
974 sym_calc_value(e->left.sym); expr_calc_value()
976 str1 = sym_get_string_value(e->left.sym); expr_calc_value()
1021 e = e->left.expr; expr_get_leftmost_symbol()
1037 expr_simplify_unmet_dep(e1->left.expr, e2), expr_simplify_unmet_dep()
1066 if (e->left.sym->name) expr_print()
1067 fn(data, e->left.sym, e->left.sym->name); expr_print()
1073 expr_print(e->left.expr, fn, data, E_NOT); expr_print()
1076 if (e->left.sym->name) expr_print()
1077 fn(data, e->left.sym, e->left.sym->name); expr_print()
1084 if (e->left.sym->name) expr_print()
1085 fn(data, e->left.sym, e->left.sym->name); expr_print()
1092 expr_print(e->left.expr, fn, data, E_OR); expr_print()
1097 expr_print(e->left.expr, fn, data, E_AND); expr_print()
1103 if (e->left.expr) { expr_print()
1105 expr_print(e->left.expr, fn, data, E_LIST); expr_print()
1110 fn(data, e->left.sym, e->left.sym->name); expr_print()
/linux-4.1.27/arch/parisc/math-emu/
H A Dsfcmp.c55 register unsigned int left, right; sgl_fcmp() local
59 left = *leftptr; sgl_fcmp()
65 if( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) sgl_fcmp()
71 if( ( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) sgl_fcmp()
72 && Sgl_isnotzero_mantissa(left) sgl_fcmp()
73 && (Exception(cond) || Sgl_isone_signaling(left))) sgl_fcmp()
89 else if( ((Sgl_exponent(left) == SGL_INFINITY_EXPONENT) sgl_fcmp()
90 && Sgl_isnotzero_mantissa(left)) sgl_fcmp()
103 Sgl_xortointp1(left,right,xorresult); sgl_fcmp()
106 /* left negative => less, left positive => greater. sgl_fcmp()
108 if( Sgl_iszero_exponentmantissa(left) sgl_fcmp()
113 else if( Sgl_isone_sign(left) ) sgl_fcmp()
124 else if( Sgl_all(left) == Sgl_all(right) ) sgl_fcmp()
128 else if( Sgl_iszero_sign(left) ) sgl_fcmp()
131 if( Sgl_all(left) < Sgl_all(right) ) sgl_fcmp()
145 if( Sgl_all(left) > Sgl_all(right) ) sgl_fcmp()
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; */ \
36 else dest = ((((unsigned) left)&0x7fffffff) << (32-(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 Dsfsub.c55 register unsigned int left, right, result, extent; sgl_fsub() local
63 left = *leftptr; sgl_fsub()
68 Sgl_xortointp1(left,right,/*to*/save); sgl_fsub()
73 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) sgl_fsub()
75 if (Sgl_iszero_mantissa(left)) sgl_fsub()
93 *dstptr = left; sgl_fsub()
102 if (Sgl_isone_signaling(left)) sgl_fsub()
108 Sgl_set_quiet(left); sgl_fsub()
126 *dstptr = left; sgl_fsub()
129 } /* End left NaN or Infinity processing */ sgl_fsub()
163 Sgl_copytoint_exponentmantissa(left,signless_upper_left); sgl_fsub()
169 /* Set the left operand to the larger one by XOR swap * sgl_fsub()
172 Sgl_xorfromintp1(save,left,/*to*/left); sgl_fsub()
173 result_exponent = Sgl_exponent(left); sgl_fsub()
174 Sgl_invert_sign(left); sgl_fsub()
176 /* Invariant: left is not smaller than right. */ sgl_fsub()
184 if(Sgl_iszero_exponentmantissa(left)) sgl_fsub()
190 Sgl_or_signs(left,/*with*/right); sgl_fsub()
194 Sgl_and_signs(left,/*with*/right); sgl_fsub()
200 * underflows are signaled if left is denormalized. Result sgl_fsub()
205 sign_save = Sgl_signextendedsign(left); sgl_fsub()
206 Sgl_leftshiftby1(left); sgl_fsub()
207 Sgl_normalize(left,result_exponent); sgl_fsub()
208 Sgl_set_sign(left,/*using*/sign_save); sgl_fsub()
209 Sgl_setwrapped_exponent(left,result_exponent,unfl); sgl_fsub()
210 *dstptr = left; sgl_fsub()
215 *dstptr = left; sgl_fsub()
228 Sgl_subtract(left,/*minus*/right,/*into*/result); sgl_fsub()
245 Sgl_addition(left,right,/*into*/result); sgl_fsub()
274 Sgl_clear_exponent_set_hidden(left); sgl_fsub()
300 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); sgl_fsub()
305 * and extension left until the hidden bit becomes one. Not 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
65 left = *leftptr; sgl_fadd()
70 Sgl_xortointp1(left,right,/*to*/save); sgl_fadd()
75 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) sgl_fadd()
77 if (Sgl_iszero_mantissa(left)) sgl_fadd()
95 *dstptr = left; sgl_fadd()
104 if (Sgl_isone_signaling(left)) sgl_fadd()
110 Sgl_set_quiet(left); sgl_fadd()
128 *dstptr = left; sgl_fadd()
131 } /* End left NaN or Infinity processing */ sgl_fadd()
164 Sgl_copytoint_exponentmantissa(left,signless_upper_left); sgl_fadd()
170 /* Set the left operand to the larger one by XOR swap * sgl_fadd()
173 Sgl_xorfromintp1(save,left,/*to*/left); sgl_fadd()
174 result_exponent = Sgl_exponent(left); sgl_fadd()
176 /* Invariant: left is not smaller than right. */ sgl_fadd()
184 if(Sgl_iszero_exponentmantissa(left)) sgl_fadd()
189 Sgl_or_signs(left,/*with*/right); sgl_fadd()
193 Sgl_and_signs(left,/*with*/right); sgl_fadd()
199 * underflows are signaled if left is denormalized. Result sgl_fadd()
204 sign_save = Sgl_signextendedsign(left); sgl_fadd()
205 Sgl_leftshiftby1(left); sgl_fadd()
206 Sgl_normalize(left,result_exponent); sgl_fadd()
207 Sgl_set_sign(left,/*using*/sign_save); sgl_fadd()
208 Sgl_setwrapped_exponent(left,result_exponent,unfl); sgl_fadd()
209 *dstptr = left; sgl_fadd()
213 *dstptr = left; sgl_fadd()
226 Sgl_subtract(left,/*minus*/right,/*into*/result); sgl_fadd()
243 Sgl_addition(left,right,/*into*/result); sgl_fadd()
271 Sgl_clear_exponent_set_hidden(left); sgl_fadd()
297 Sgl_subtract_withextension(left,/*minus*/right,/*with*/extent,/*into*/result); sgl_fadd()
302 * and extension left until the hidden bit becomes one. Not 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 Dfcnvuf.c86 /* left justify source, with msb at bit position 0 */ sgl_to_sgl_fcnvuf()
145 /* left justify source, with msb at bit position 0 */ sgl_to_dbl_fcnvuf()
187 /* left justify source, with msb at bit position 0 */ dbl_to_sgl_fcnvuf()
204 /* left justify source, with msb at bit position 0 */ dbl_to_sgl_fcnvuf()
269 /* left justify source, with msb at bit position 0 */ dbl_to_dbl_fcnvuf()
285 /* left justify source, with msb at bit position 0 */ dbl_to_dbl_fcnvuf()
H A Dfcnvxf.c94 /* left justify source, with msb at bit position 1 */ sgl_to_sgl_fcnvxf()
165 /* left justify source, with msb at bit position 1 */ sgl_to_dbl_fcnvxf()
217 /* left justify source, with msb at bit position 1 */ dbl_to_sgl_fcnvxf()
240 /* left justify source, with msb at bit position 1 */ dbl_to_sgl_fcnvxf()
322 /* left justify source, with msb at bit position 1 */ dbl_to_dbl_fcnvxf()
344 /* left justify source, with msb at bit position 1 */ dbl_to_dbl_fcnvxf()
/linux-4.1.27/fs/quota/
H A Dkqid.c7 * @left: A qid value
12 bool qid_eq(struct kqid left, struct kqid right) qid_eq() argument
14 if (left.type != right.type) qid_eq()
16 switch(left.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()
31 * @left: The possibly lesser 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()
42 switch (left.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/drivers/md/persistent-data/
H A Ddm-btree-remove.c25 * Each node may have a left or right sibling. When decending the spine,
32 * [B] No left sibling
36 * ==> rebalance(left sibling, node)
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
84 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); node_copy()
85 uint32_t value_size = le32_to_cpu(left->header.value_size); node_copy()
90 BUG_ON(nr_left + shift > le32_to_cpu(left->header.max_entries)); node_copy()
91 memcpy(key_ptr(left, nr_left), node_copy()
94 memcpy(value_ptr(left, nr_left), node_copy()
100 key_ptr(left, nr_left - shift), node_copy()
103 value_ptr(left, nr_left - shift), node_copy()
173 static void shift(struct btree_node *left, struct btree_node *right, int count) shift() argument
175 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); shift()
177 uint32_t max_entries = le32_to_cpu(left->header.max_entries); shift()
189 node_copy(left, right, count); shift()
191 node_copy(left, right, count); shift()
195 left->header.nr_entries = cpu_to_le32(nr_left - count); shift()
202 struct btree_node *left = l->n; __rebalance2() local
204 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); __rebalance2()
206 unsigned threshold = 2 * merge_threshold(left) + 1; __rebalance2()
212 node_copy(left, right, -nr_right); __rebalance2()
213 left->header.nr_entries = cpu_to_le32(nr_left + nr_right); __rebalance2()
218 * children, since they're still referenced by left. __rebalance2()
226 shift(left, right, nr_left - target_left); __rebalance2()
236 struct child left, right; rebalance2() local
240 r = init_child(info, vt, parent, left_index, &left); rebalance2()
246 exit_child(info, &left); rebalance2()
250 __rebalance2(info, parent, &left, &right); rebalance2()
252 r = exit_child(info, &left); rebalance2()
262 * We dump as many entries from center as possible into left, then the rest
268 struct btree_node *left, struct btree_node *center, struct btree_node *right, delete_center_node()
271 uint32_t max_entries = le32_to_cpu(left->header.max_entries); delete_center_node()
275 node_copy(left, center, -shift); delete_center_node()
276 left->header.nr_entries = cpu_to_le32(nr_left + shift); delete_center_node()
299 struct btree_node *left, struct btree_node *center, struct btree_node *right, redistribute3()
303 uint32_t max_entries = le32_to_cpu(left->header.max_entries); redistribute3()
317 shift(left, center, -nr_center); redistribute3()
319 shift(left, right, s); redistribute3()
322 shift(left, center, s); redistribute3()
332 shift(left, right, s); redistribute3()
337 shift(left, center, nr_left - target_left); redistribute3()
347 struct btree_node *left = l->n; __rebalance3() local
351 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); __rebalance3()
355 unsigned threshold = merge_threshold(left) * 4 + 1; __rebalance3()
357 BUG_ON(left->header.max_entries != center->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
378 r = init_child(info, vt, parent, left_index, &left); rebalance3()
384 exit_child(info, &left); rebalance3()
390 exit_child(info, &left); rebalance3()
395 __rebalance3(info, parent, &left, &center, &right); rebalance3()
397 r = exit_child(info, &left); 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
433 left = shadow_current(s); btree_split_sibling()
439 ln = dm_block_data(left); btree_split_sibling()
464 location = cpu_to_le64(dm_block_location(left)); btree_split_sibling()
479 s->nodes[1] = left; btree_split_sibling()
481 unlock_block(s->info, left); btree_split_sibling()
514 struct dm_block *left, *right, *new_parent; btree_split_beneath() local
520 r = new_block(s->info, &left); btree_split_beneath()
526 unlock_block(s->info, left); btree_split_beneath()
531 ln = dm_block_data(left); btree_split_beneath()
565 val = cpu_to_le64(dm_block_location(left)); btree_split_beneath()
585 s->nodes[1] = left; btree_split_beneath()
587 unlock_block(s->info, left); btree_split_beneath()
/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.h32 * @left: GPIO line for left value.
34 * @bleft: GPIO line for left button.
50 int left; member in struct:gpio_mouse_platform_data::__anon11713::__anon11714
H A Derrno.h10 * at syscall exit tracing, but they will never be left for the debugged user
/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); \
107 movl left##d, RW0d; \
111 xorl RW0d, left##d; \
113 roll $1, left##d; \
115 expand_to_64bits(left, RT3);
117 #define final_permutation(left, right) \
119 compress_to_64bits(left); \
121 rorl $1, left##d; \
122 xorl left##d, RW0d; \
125 xorl RW0d, left##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) \
163 movl (io), left##d; \
165 bswapl left##d; \
168 #define write_block(io, left, right) \
169 bswapl left##d; \
171 movl left##d, (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); \
289 movl left##0d, RW0d; \
293 xorl RW0d, left##0d; \
295 roll $1, left##0d; \
297 expand_to_64bits(left##0, RT3); \
298 movl left##1d, RW1d; \
302 xorl RW1d, left##1d; \
304 roll $1, left##1d; \
306 expand_to_64bits(left##1, RT3); \
307 movl left##2d, RW2d; \
311 xorl RW2d, left##2d; \
313 roll $1, left##2d; \
315 expand_to_64bits(left##2, RT3);
317 #define final_permutation3(left, right) \
319 compress_to_64bits(left##0); \
321 rorl $1, left##0d; \
322 xorl left##0d, RW0d; \
325 xorl RW0d, left##0d; \
328 compress_to_64bits(left##1); \
330 rorl $1, left##1d; \
331 xorl left##1d, RW1d; \
334 xorl RW1d, left##1d; \
337 compress_to_64bits(left##2); \
339 rorl $1, left##2d; \
340 xorl left##2d, RW2d; \
343 xorl RW2d, left##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/drivers/media/pci/bt8xx/
H A Dbtcx-risc.c91 if (win->left < 0) { btcx_screen_clips()
92 /* left */ btcx_screen_clips()
93 clips[n].c.left = 0; btcx_screen_clips()
95 clips[n].c.width = -win->left; btcx_screen_clips()
99 if (win->left + win->width > swidth) { btcx_screen_clips()
101 clips[n].c.left = swidth - win->left; btcx_screen_clips()
103 clips[n].c.width = win->width - clips[n].c.left; btcx_screen_clips()
109 clips[n].c.left = 0; btcx_screen_clips()
117 clips[n].c.left = 0; btcx_screen_clips()
133 nx = (win->left + mask) & ~mask; btcx_align()
135 if (nx + nw > win->left + win->width) btcx_align()
137 dx = nx - win->left; btcx_align()
138 win->left = nx; btcx_align()
142 win->width, win->height, win->left, win->top, dx); btcx_align()
146 nx = (clips[i].c.left-dx) & ~mask; btcx_align()
148 if (nx + nw < clips[i].c.left-dx + clips[i].c.width) btcx_align()
150 clips[i].c.left = nx; btcx_align()
155 clips[i].c.left, clips[i].c.top); btcx_align()
170 if (clips[j].c.left > clips[j+1].c.left) { btcx_sort_clips()
195 if (clips[clip].c.left + clips[clip].c.width <= 0) btcx_calc_skips()
197 if (clips[clip].c.left > (signed)width) btcx_calc_skips()
212 if (0 == skip || clips[clip].c.left > skips[skip-1].end) { btcx_calc_skips()
214 skips[skip].start = clips[clip].c.left; btcx_calc_skips()
217 skips[skip].end = clips[clip].c.left + clips[clip].c.width; btcx_calc_skips()
223 end = clips[clip].c.left + clips[clip].c.width; btcx_calc_skips()
/linux-4.1.27/net/ceph/
H A Dpagevec.c102 int left = len; ceph_copy_user_to_page_vector() local
105 while (left > 0) { ceph_copy_user_to_page_vector()
106 l = min_t(int, PAGE_CACHE_SIZE-po, left); ceph_copy_user_to_page_vector()
111 left -= l - bad; ceph_copy_user_to_page_vector()
128 size_t left = len; ceph_copy_to_page_vector() local
130 while (left > 0) { ceph_copy_to_page_vector()
131 size_t l = min_t(size_t, PAGE_CACHE_SIZE-po, left); ceph_copy_to_page_vector()
135 left -= l; ceph_copy_to_page_vector()
151 size_t left = len; ceph_copy_from_page_vector() local
153 while (left > 0) { ceph_copy_from_page_vector()
154 size_t l = min_t(size_t, PAGE_CACHE_SIZE-po, left); ceph_copy_from_page_vector()
158 left -= l; ceph_copy_from_page_vector()
/linux-4.1.27/drivers/net/wireless/hostap/
H A Dhostap_info.c14 int left) prism2_info_commtallies16()
18 if (left < sizeof(struct hfa384x_comm_tallies)) { prism2_info_commtallies16()
20 "info frame\n", local->dev->name, left); prism2_info_commtallies16()
54 int left) prism2_info_commtallies32()
58 if (left < sizeof(struct hfa384x_comm_tallies32)) { prism2_info_commtallies32()
60 "info frame\n", local->dev->name, left); prism2_info_commtallies32()
94 int left) prism2_info_commtallies()
97 prism2_info_commtallies32(local, buf, left); prism2_info_commtallies()
99 prism2_info_commtallies16(local, buf, left); prism2_info_commtallies()
129 int left) prism2_info_linkstatus()
138 if (left != 2) { prism2_info_linkstatus()
140 "length %d\n", local->dev->name, left); prism2_info_linkstatus()
253 int left) prism2_info_scanresults()
261 if (left < 4) { prism2_info_scanresults()
263 "length %d\n", local->dev->name, left); prism2_info_scanresults()
270 left -= 4; prism2_info_scanresults()
272 new_count = left / sizeof(struct hfa384x_scan_result); prism2_info_scanresults()
304 unsigned char *buf, int left) prism2_info_hostscanresults()
314 if (left < 4) { prism2_info_hostscanresults()
316 "length %d\n", local->dev->name, left); prism2_info_hostscanresults()
332 left -= 4; prism2_info_hostscanresults()
335 new_count = left / result_size; prism2_info_hostscanresults()
344 left -= result_size; prism2_info_hostscanresults()
347 if (left) { prism2_info_hostscanresults()
349 local->dev->name, left, result_size); prism2_info_hostscanresults()
370 int left; hostap_info_process() local
377 left = skb->len - sizeof(*info); hostap_info_process()
381 prism2_info_commtallies(local, buf, left); hostap_info_process()
386 prism2_info_linkstatus(local, buf, left); hostap_info_process()
390 prism2_info_scanresults(local, buf, left); hostap_info_process()
394 prism2_info_hostscanresults(local, buf, left); hostap_info_process()
404 for (i = 0; i < (left < 100 ? left : 100); i++) hostap_info_process()
13 prism2_info_commtallies16(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies16() argument
53 prism2_info_commtallies32(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies32() argument
93 prism2_info_commtallies(local_info_t *local, unsigned char *buf, int left) prism2_info_commtallies() argument
128 prism2_info_linkstatus(local_info_t *local, unsigned char *buf, int left) prism2_info_linkstatus() argument
252 prism2_info_scanresults(local_info_t *local, unsigned char *buf, int left) prism2_info_scanresults() argument
303 prism2_info_hostscanresults(local_info_t *local, unsigned char *buf, int left) prism2_info_hostscanresults() argument
/linux-4.1.27/drivers/video/fbdev/core/
H A Dsyscopyarea.c33 int left, right; bitcpy() local
81 left = -shift & (bits - 1); bitcpy()
89 *dst = comp(*src << left, *dst, first); bitcpy()
97 *dst = comp(d0 >> right | d1 << left, *dst, bitcpy()
112 *dst = comp(d0 << left, *dst, first); 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()
157 d0 = d0 >> right | d1 << left; bitcpy()
227 int const left = shift & (bits-1); bitcpy_rev() local
239 *dst = comp(*src << left, *dst, last); bitcpy_rev()
242 *dst = comp(*src << left | *(src-1) >> right, bitcpy_rev()
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()
301 if (m <= bits - left) { bitcpy_rev()
303 d0 <<= left; bitcpy_rev() local
307 d0 = d0 << left | d1 >> right; bitcpy_rev()
H A Dcfbfillrect.c93 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()
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()
285 int dst_idx, left; cfb_fillrect() local
302 left = bits % bpp; cfb_fillrect()
305 if (!left) { cfb_fillrect()
334 int dst_idx, unsigned long pat, int left, 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.c82 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()
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()
250 int dst_idx, left; sys_fillrect() local
267 left = bits % bpp; sys_fillrect()
270 if (!left) { sys_fillrect()
297 int dst_idx, unsigned long pat, int left, 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.c110 int const left = shift & (bits - 1); bitcpy() local
121 d0 <<= left; bitcpy() local
129 d0 = d0 >> right | d1 << left; bitcpy()
146 d0 <<= left; bitcpy() local
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()
198 d0 = d0 >> right | d1 << left; bitcpy()
283 int const left = shift & (bits-1); bitcpy_rev() local
296 d0 <<= left; bitcpy_rev() local
301 d0 = d0 << left | d1 >> right; bitcpy_rev()
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()
364 if (m <= bits - left) { bitcpy_rev()
366 d0 <<= left; bitcpy_rev() local
372 d0 = d0 << left | d1 >> right; bitcpy_rev()
/linux-4.1.27/drivers/infiniband/hw/usnic/
H A Dusnic_debugfs.c59 int left; flowinfo_read() local
65 left = count; flowinfo_read()
71 n = scnprintf(ptr, left, flowinfo_read()
75 UPDATE_PTR_LEFT(n, ptr, left); flowinfo_read()
77 n = scnprintf(ptr, left, "Port_Num:%hu\n", flowinfo_read()
79 UPDATE_PTR_LEFT(n, ptr, left); flowinfo_read()
81 n = usnic_transport_sock_to_str(ptr, left, flowinfo_read()
83 UPDATE_PTR_LEFT(n, ptr, left); flowinfo_read()
84 n = scnprintf(ptr, left, "\n"); flowinfo_read()
85 UPDATE_PTR_LEFT(n, ptr, left); flowinfo_read()
H A Dusnic_ib_sysfs.c72 unsigned left; usnic_ib_show_config() local
80 left = PAGE_SIZE; usnic_ib_show_config()
94 n = scnprintf(ptr, left, usnic_ib_show_config()
103 UPDATE_PTR_LEFT(n, ptr, left); usnic_ib_show_config()
110 n = scnprintf(ptr, left, " %d %s%s", usnic_ib_show_config()
115 UPDATE_PTR_LEFT(n, ptr, left); usnic_ib_show_config()
117 n = scnprintf(ptr, left, "\n"); usnic_ib_show_config()
118 UPDATE_PTR_LEFT(n, ptr, left); usnic_ib_show_config()
120 n = scnprintf(ptr, left, "%s: no VFs\n", usnic_ib_show_config()
122 UPDATE_PTR_LEFT(n, ptr, left); usnic_ib_show_config()
233 int left; summary_show() local
238 left = PAGE_SIZE; summary_show()
241 n = scnprintf(ptr, left, summary_show()
247 UPDATE_PTR_LEFT(n, ptr, left); summary_show()
253 n = scnprintf(ptr, left, "%s[%d] ", summary_show()
256 UPDATE_PTR_LEFT(n, ptr, left); summary_show()
260 n = scnprintf(ptr, left, "\n"); summary_show()
261 UPDATE_PTR_LEFT(n, ptr, left); summary_show()
/linux-4.1.27/drivers/misc/cb710/
H A Dsgbuf2.c30 size_t len, left = 4; sg_dwiter_read_buffer() local
35 len = min(miter->length - miter->consumed, left); sg_dwiter_read_buffer()
38 left -= len; sg_dwiter_read_buffer()
39 if (!left) sg_dwiter_read_buffer()
44 memset(addr, 0, left); sg_dwiter_read_buffer()
106 size_t len, left = 4; sg_dwiter_write_slow() local
110 len = min(miter->length - miter->consumed, left); sg_dwiter_write_slow()
113 left -= len; sg_dwiter_write_slow()
114 if (!left) sg_dwiter_write_slow()
/linux-4.1.27/include/sound/
H A Dak4531_codec.h40 #define AK4531_LMASTER 0x00 /* master volume left */
42 #define AK4531_LVOICE 0x02 /* channel volume left */
44 #define AK4531_LFM 0x04 /* FM volume left */
46 #define AK4531_LCD 0x06 /* CD volume left */
48 #define AK4531_LLINE 0x08 /* LINE volume left */
50 #define AK4531_LAUXA 0x0a /* AUXA volume left */
52 #define AK4531_MONO1 0x0c /* MONO1 volume left */
58 #define AK4531_LIN_SW1 0x12 /* Input left mixer switch 1 */
60 #define AK4531_LIN_SW2 0x14 /* Input left mixer switch 2 */
H A Dcs4231-regs.h36 #define CS4231_LEFT_INPUT 0x00 /* left input control */
38 #define CS4231_AUX1_LEFT_INPUT 0x02 /* left AUX1 input control */
40 #define CS4231_AUX2_LEFT_INPUT 0x04 /* left AUX2 input control */
42 #define CS4231_LEFT_OUTPUT 0x06 /* left output control register */
53 #define AD1845_AF1_MIC_LEFT 0x10 /* alternate #1 feature + MIC left */
56 #define CS4231_LEFT_LINE_IN 0x12 /* left line input control */
60 #define CS4231_LEFT_MIC_INPUT 0x16 /* left MIC input control register (InterWave only) */
66 #define CS4231_LINE_LEFT_OUTPUT 0x19 /* left line output control register (InterWave only) */
71 #define CS4235_LEFT_MASTER 0x1b /* left master output control */
159 #define CS4236_LEFT_LINE 0x08 /* left LINE alternate volume */
161 #define CS4236_LEFT_MIC 0x28 /* left MIC volume */
163 #define CS4236_LEFT_MIX_CTRL 0x48 /* synthesis and left input mixer control */
165 #define CS4236_LEFT_FM 0x68 /* left FM volume */
167 #define CS4236_LEFT_DSP 0x88 /* left DSP serial port volume */
173 #define CS4236_LEFT_MASTER 0xe8 /* left master digital audio volume */
175 #define CS4236_LEFT_WAVE 0x0c /* left wavetable serial port volume */
H A Daci.h32 Add an offset of 0x01 for the left channel register.
33 (left=right+0x01) */
53 For left channel access you have to add an offset of 0x08.
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.
/linux-4.1.27/net/mac80211/
H A Dmichael.c60 size_t block, blocks, left; michael_mic() local
67 left = data_len % 4; michael_mic()
75 while (left > 0) { michael_mic()
77 left--; michael_mic()
78 val |= data[blocks * 4 + left]; michael_mic()
H A Daes_cmac.c44 size_t i, e, left, total_len; aes_cmac_vector() local
51 left = total_len; aes_cmac_vector()
57 while (left >= AES_BLOCK_SIZE) { aes_cmac_vector()
66 if (left > AES_BLOCK_SIZE) aes_cmac_vector()
68 left -= AES_BLOCK_SIZE; aes_cmac_vector()
75 if (left || total_len == 0) { aes_cmac_vector()
76 for (i = 0; i < left; i++) { aes_cmac_vector()
84 cbc[left] ^= 0x80; aes_cmac_vector()
/linux-4.1.27/drivers/media/platform/soc_camera/
H A Dsoc_scale_crop.c35 return r1->left > r2->left || r1->top > r2->top || is_inside()
36 r1->left + r1->width < r2->left + r2->width || is_inside()
75 if (rect->left > subrect->left) update_subrect()
76 subrect->left = rect->left; update_subrect()
77 else if (rect->left + rect->width > update_subrect()
78 subrect->left + subrect->width) update_subrect()
79 subrect->left = rect->left + rect->width - update_subrect()
118 rect->width, rect->height, rect->left, rect->top); soc_camera_client_s_crop()
126 cam_rect->left, cam_rect->top, soc_camera_client_s_crop()
127 rect->width, rect->height, rect->left, rect->top); soc_camera_client_s_crop()
135 soc_camera_limit_side(&rect->left, &rect->width, cap.bounds.left, 2, soc_camera_client_s_crop()
163 * left and top borders. We could try to be smarter in iterating soc_camera_client_s_crop()
164 * them, e.g., if camera current left is to the right of the soc_camera_client_s_crop()
165 * target left, set it to the middle point between the current soc_camera_client_s_crop()
166 * left and minimum left. But that would add too much soc_camera_client_s_crop()
168 * Instead we just drop to the left and top bounds. soc_camera_client_s_crop()
170 if (cam_rect->left > rect->left) soc_camera_client_s_crop()
171 cam_rect->left = cap.bounds.left; soc_camera_client_s_crop()
173 if (cam_rect->left + cam_rect->width < rect->left + rect->width) soc_camera_client_s_crop()
174 cam_rect->width = rect->left + rect->width - soc_camera_client_s_crop()
175 cam_rect->left; soc_camera_client_s_crop()
188 cam_rect->left, cam_rect->top); soc_camera_client_s_crop()
202 cam_rect->left, cam_rect->top); soc_camera_client_s_crop()
378 subrect->left, subrect->top); soc_camera_calc_client_output()
/linux-4.1.27/sound/oss/
H A Dpas2_mixer.c80 int left = left_vol * div / 100; mixer_output() local
86 left |= mixer; mixer_output()
92 mix_write(left, 0x078B); mixer_output()
97 mix_write(left, 0x078B); mixer_output()
117 int left, right, devmask, changed, i, mixer = 0; pas_mixer_set() local
119 left = level & 0x7f; pas_mixer_set()
132 levels[whichDev] = mixer_output(right, left, 63, 0x01, 0); pas_mixer_set()
136 * Note! Bass and Treble are mono devices. Will use just the left 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
287 oss_change_bits(devc, &val, dev, LEFT_CHN, left); sb_common_mixer_set()
299 return left | (left << 8); /* sb_common_mixer_set()
300 * Just left channel present 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
321 sb_setmixer(devc, 0x0b, 96 - (96 * left / 100)); /* 96=mute, 0=max */ smw_mixer_set()
327 devc->levels[dev] = left | (right << 8); smw_mixer_set()
328 /* Set left bass and treble values */ smw_mixer_set()
347 sb_setmixer(devc, reg, (24 - (24 * left / 100)) | 0x20); /* 24=mute, 0=max */ smw_mixer_set()
351 devc->levels[dev] = left | (right << 8); smw_mixer_set()
352 return left | (right << 8); smw_mixer_set()
357 int left = value & 0x000000ff; sb_mixer_set() local
361 if (left > 100) sb_mixer_set()
362 left = 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()
/linux-4.1.27/kernel/
H A Dgroups.c116 int left = base; groups_sort() local
117 int right = left + stride; groups_sort()
120 while (left >= 0 && gid_gt(GROUP_AT(group_info, left), tmp)) { groups_sort()
122 GROUP_AT(group_info, left); groups_sort()
123 right = left; groups_sort()
124 left -= stride; groups_sort()
135 unsigned int left, right; groups_search() local
140 left = 0; groups_search()
142 while (left < right) { groups_search()
143 unsigned int mid = (left+right)/2; groups_search()
145 left = mid + 1; groups_search()
H A Dsysctl.c2011 size_t left; __do_proc_dointvec() local
2021 left = *lenp; __do_proc_dointvec()
2039 if (left > PAGE_SIZE - 1) __do_proc_dointvec()
2040 left = PAGE_SIZE - 1; __do_proc_dointvec()
2045 if (copy_from_user(kbuf, buffer, left)) { __do_proc_dointvec()
2049 kbuf[left] = 0; __do_proc_dointvec()
2052 for (; left && vleft--; i++, first=0) { __do_proc_dointvec()
2057 left -= proc_skip_spaces(&kbuf); __do_proc_dointvec()
2059 if (!left) __do_proc_dointvec()
2061 err = proc_get_long(&kbuf, &left, &lval, &neg, __do_proc_dointvec()
2076 err = proc_put_char(&buffer, &left, '\t'); __do_proc_dointvec()
2079 err = proc_put_long(&buffer, &left, lval, neg); __do_proc_dointvec()
2085 if (!write && !first && left && !err) __do_proc_dointvec()
2086 err = proc_put_char(&buffer, &left, '\n'); __do_proc_dointvec()
2087 if (write && !err && left) __do_proc_dointvec()
2088 left -= proc_skip_spaces(&kbuf); __do_proc_dointvec()
2095 *lenp -= left; __do_proc_dointvec()
2274 size_t left; __do_proc_doulongvec_minmax() local
2286 left = *lenp; __do_proc_doulongvec_minmax()
2301 if (left > PAGE_SIZE - 1) __do_proc_doulongvec_minmax()
2302 left = PAGE_SIZE - 1; __do_proc_doulongvec_minmax()
2307 if (copy_from_user(kbuf, buffer, left)) { __do_proc_doulongvec_minmax()
2311 kbuf[left] = 0; __do_proc_doulongvec_minmax()
2314 for (; left && vleft--; i++, first = 0) { __do_proc_doulongvec_minmax()
2320 left -= proc_skip_spaces(&kbuf); __do_proc_doulongvec_minmax()
2322 err = proc_get_long(&kbuf, &left, &val, &neg, __do_proc_doulongvec_minmax()
2335 err = proc_put_char(&buffer, &left, '\t'); __do_proc_doulongvec_minmax()
2339 err = proc_put_long(&buffer, &left, val, false); __do_proc_doulongvec_minmax()
2345 if (!write && !first && left && !err) __do_proc_doulongvec_minmax()
2346 err = proc_put_char(&buffer, &left, '\n'); __do_proc_doulongvec_minmax()
2348 left -= proc_skip_spaces(&kbuf); __do_proc_doulongvec_minmax()
2355 *lenp -= left; __do_proc_doulongvec_minmax()
2601 size_t left = *lenp; proc_do_large_bitmap() local
2607 if (!bitmap || !bitmap_len || !left || (*ppos && !write)) { proc_do_large_bitmap()
2616 if (left > PAGE_SIZE - 1) proc_do_large_bitmap()
2617 left = PAGE_SIZE - 1; proc_do_large_bitmap()
2623 if (copy_from_user(kbuf, buffer, left)) { proc_do_large_bitmap()
2627 kbuf[left] = 0; proc_do_large_bitmap()
2635 proc_skip_char(&kbuf, &left, '\n'); proc_do_large_bitmap()
2636 while (!err && left) { proc_do_large_bitmap()
2640 err = proc_get_long(&kbuf, &left, &val_a, &neg, tr_a, proc_do_large_bitmap()
2650 if (left) { proc_do_large_bitmap()
2652 left--; proc_do_large_bitmap()
2656 err = proc_get_long(&kbuf, &left, &val_b, proc_do_large_bitmap()
2666 if (left) { proc_do_large_bitmap()
2668 left--; proc_do_large_bitmap()
2674 proc_skip_char(&kbuf, &left, '\n'); proc_do_large_bitmap()
2680 while (left) { proc_do_large_bitmap()
2688 err = proc_put_char(&buffer, &left, ','); proc_do_large_bitmap()
2692 err = proc_put_long(&buffer, &left, bit_a, false); proc_do_large_bitmap()
2696 err = proc_put_char(&buffer, &left, '-'); proc_do_large_bitmap()
2699 err = proc_put_long(&buffer, &left, bit_b, false); proc_do_large_bitmap()
2707 err = proc_put_char(&buffer, &left, '\n'); proc_do_large_bitmap()
2718 *lenp -= left; proc_do_large_bitmap()
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/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
288 if (!left->srcline) { sort__srcline_cmp()
289 if (!left->ms.map) sort__srcline_cmp()
290 left->srcline = SRCLINE_UNKNOWN; sort__srcline_cmp()
292 struct map *map = left->ms.map; sort__srcline_cmp()
293 left->srcline = get_srcline(map->dso, sort__srcline_cmp()
294 map__rip_2objdump(map, left->ip), sort__srcline_cmp()
295 left->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
329 struct symbol *sym_l = left->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()
381 return _sort__dso_cmp(left->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()
401 return _sort__dso_cmp(left->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
418 struct addr_map_symbol *from_l = &left->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()
424 from_l = &left->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()
441 to_l = &left->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
537 if (left->mem_info) sort__daddr_cmp()
538 l = left->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
567 if (left->mem_info) sort__dso_daddr_cmp()
568 map_l = left->mem_info->daddr.map; sort__dso_daddr_cmp()
587 sort__locked_cmp(struct hist_entry *left, struct hist_entry *right) sort__locked_cmp() argument
592 if (left->mem_info) sort__locked_cmp()
593 data_src_l = left->mem_info->data_src; sort__locked_cmp()
625 sort__tlb_cmp(struct hist_entry *left, struct hist_entry *right) sort__tlb_cmp() argument
630 if (left->mem_info) sort__tlb_cmp()
631 data_src_l = left->mem_info->data_src; sort__tlb_cmp()
695 sort__lvl_cmp(struct hist_entry *left, struct hist_entry *right) sort__lvl_cmp() argument
700 if (left->mem_info) sort__lvl_cmp()
701 data_src_l = left->mem_info->data_src; sort__lvl_cmp()
772 sort__snoop_cmp(struct hist_entry *left, struct hist_entry *right) sort__snoop_cmp() argument
777 if (left->mem_info) sort__snoop_cmp()
778 data_src_l = left->mem_info->data_src; sort__snoop_cmp()
836 sort__dcacheline_cmp(struct hist_entry *left, struct hist_entry *right) sort__dcacheline_cmp() argument
841 if (!left->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()
848 l_map = left->mem_info->daddr.map; sort__dcacheline_cmp()
878 if ((left->cpumode != PERF_RECORD_MISC_KERNEL) && 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()
890 l = cl_address(left->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()
1032 return left->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()
1064 return left->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.h10 struct strfilter_node *l; /* Tree left branche (for &,|) */
/linux-4.1.27/drivers/spi/
H A Dspi-bcm53xx.c177 size_t left; bcm53xxspi_transfer_one() local
181 left = t->len; bcm53xxspi_transfer_one()
182 while (left) { bcm53xxspi_transfer_one()
183 size_t to_write = min_t(size_t, 16, left); bcm53xxspi_transfer_one()
184 bool cont = left - to_write > 0; bcm53xxspi_transfer_one()
187 left -= to_write; bcm53xxspi_transfer_one()
194 left = t->len; bcm53xxspi_transfer_one()
195 while (left) { bcm53xxspi_transfer_one()
197 left); bcm53xxspi_transfer_one()
198 bool cont = left - to_read > 0; bcm53xxspi_transfer_one()
201 left -= to_read; bcm53xxspi_transfer_one()
/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()
200 struct usb_port *lpeer = left->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()
211 dev_name(&left->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()
223 sysfs_remove_link(&left->dev.kobj, "peer"); link_peers()
232 if (left->is_superspeed) { link_peers()
233 ss_port = left; link_peers()
239 hs_port = left; 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()
268 dev_warn(&left->dev, "failed to peer to %s (%d)\n", 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()
288 if (left->is_superspeed) { unlink_peers()
289 ss_port = left; unlink_peers()
293 hs_port = left; unlink_peers()
298 sysfs_remove_link(&left->dev.kobj, "peer"); unlink_peers()
301 left->peer = NULL; unlink_peers()
/linux-4.1.27/arch/powerpc/boot/
H A Dstdio.h8 #define ENOSPC 28 /* No space left on device */
/linux-4.1.27/drivers/hid/
H A Dhid-zpff.c42 int left, right; zpff_play() local
50 left = effect->u.rumble.strong_magnitude; zpff_play()
52 dbg_hid("called with 0x%04x 0x%04x\n", left, right); zpff_play()
54 left = left * 0x7f / 0xffff; zpff_play()
57 zpff->report->field[2]->value[0] = left; zpff_play()
59 dbg_hid("running with 0x%02x 0x%02x\n", left, right); zpff_play()
H A Dhid-lgff.c75 unsigned int left, right; hid_lgff_play() local
95 left = effect->u.rumble.weak_magnitude; hid_lgff_play()
97 left = left * 0xff / 0xffff; hid_lgff_play()
98 CLAMP(left); hid_lgff_play()
102 report->field[0]->value[2] = left; hid_lgff_play()
104 dbg_hid("(left, right)=(%04x, %04x)\n", left, right); hid_lgff_play()
H A Dhid-axff.c49 int left, right; axff_play() local
52 left = effect->u.rumble.strong_magnitude; axff_play()
55 dbg_hid("called with 0x%04x 0x%04x", left, right); axff_play()
57 left = left * 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()
H A Dhid-gaff.c47 int left, right; hid_gaff_play() local
49 left = effect->u.rumble.strong_magnitude; hid_gaff_play()
52 dbg_hid("called with 0x%04x 0x%04x", left, right); hid_gaff_play()
54 left = left * 0xfe / 0xffff; hid_gaff_play()
61 gaff->report->field[0]->value[4] = left; 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
48 left = effect->u.rumble.strong_magnitude; hid_sjoyff_play()
50 dev_dbg(&dev->dev, "called with 0x%08x 0x%08x\n", left, right); hid_sjoyff_play()
52 left = left * 0xff / 0xffff; hid_sjoyff_play()
56 sjoyff->report->field[0]->value[2] = left; hid_sjoyff_play()
57 dev_dbg(&dev->dev, "running with 0x%02x 0x%02x\n", left, right); hid_sjoyff_play()
H A Dhid-holtekff.c72 * bit 7: left (strong) motor enabled
111 int left, right; holtekff_play() local
116 left = effect->u.rumble.strong_magnitude; holtekff_play()
118 dbg_hid("called with 0x%04x 0x%04x\n", left, right); holtekff_play()
120 if (!left && !right) { holtekff_play()
125 if (left) 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
66 left = effect->u.rumble.strong_magnitude; hid_plff_play()
68 debug("called with 0x%04x 0x%04x", left, right); hid_plff_play()
70 left = left * plff->maxval / 0xffff; hid_plff_play()
73 *plff->strong = left; 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
47 left = effect->u.rumble.strong_magnitude; hid_betopff_play()
50 betopff->report->field[2]->value[0] = left / 256; hid_betopff_play()
H A Dhid-roccat-kone.h24 kone_keystroke_button_1 = 0xf0, /* left mouse button */
48 kone_button_info_type_button_1 = 0x1, /* click (left mouse button) */
63 kone_button_info_type_button_7 = 0xf, /* tilt left */
158 uint8_t tilt; /* right = 1, left = -1 */
H A Dhid-tmff.c90 int left, right; /* Rumbling */ tmff_play() local
108 left = tmff_scale_u16(effect->u.rumble.weak_magnitude, tmff_play()
115 dbg_hid("(left,right)=(%08x, %08x)\n", left, right); tmff_play()
116 ff_field->value[0] = left; tmff_play()
/linux-4.1.27/drivers/firmware/
H A Dedd.c54 #define left (PAGE_SIZE - (p - buf) - 1) macro
144 p += scnprintf(p, left, "%c", info->params.host_bus_type[i]); edd_show_host_bus()
146 p += scnprintf(p, left, " "); edd_show_host_bus()
151 p += scnprintf(p, left, "\tbase_address: %x\n", edd_show_host_bus()
156 p += scnprintf(p, left, edd_show_host_bus()
164 p += scnprintf(p, left, edd_show_host_bus()
169 p += scnprintf(p, left, "\tunknown: %llx\n", edd_show_host_bus()
190 p += scnprintf(p, left, "%c", info->params.interface_type[i]); edd_show_interface()
192 p += scnprintf(p, left, " "); edd_show_interface()
196 p += scnprintf(p, left, "\tdevice: %u lun: %u\n", edd_show_interface()
200 p += scnprintf(p, left, "\tdevice: %u\n", edd_show_interface()
203 p += scnprintf(p, left, "\tid: %u lun: %llu\n", edd_show_interface()
207 p += scnprintf(p, left, "\tserial_number: %llx\n", edd_show_interface()
210 p += scnprintf(p, left, "\teui: %llx\n", edd_show_interface()
213 p += scnprintf(p, left, "\twwid: %llx lun: %llx\n", edd_show_interface()
217 p += scnprintf(p, left, "\tidentity_tag: %llx\n", edd_show_interface()
220 p += scnprintf(p, left, "\tidentity_tag: %x\n", edd_show_interface()
223 p += scnprintf(p, left, "\tdevice: %u\n", edd_show_interface()
226 p += scnprintf(p, left, "\tunknown: %llx %llx\n", edd_show_interface()
274 p += scnprintf(p, left, "0x%02x\n", info->version); edd_show_version()
282 p += scnprintf(p, left, "0x%08x\n", edev->mbr_signature); edd_show_mbr_signature()
298 p += scnprintf(p, left, "Fixed disk access\n"); edd_show_extensions()
301 p += scnprintf(p, left, "Device locking and ejecting\n"); edd_show_extensions()
304 p += scnprintf(p, left, "Enhanced Disk Drive support\n"); edd_show_extensions()
307 p += scnprintf(p, left, "64-bit extensions\n"); edd_show_extensions()
324 p += scnprintf(p, left, "DMA boundary error transparent\n"); edd_show_info_flags()
326 p += scnprintf(p, left, "geometry valid\n"); edd_show_info_flags()
328 p += scnprintf(p, left, "removable\n"); edd_show_info_flags()
330 p += scnprintf(p, left, "write verify\n"); edd_show_info_flags()
332 p += scnprintf(p, left, "media change notification\n"); edd_show_info_flags()
334 p += scnprintf(p, left, "lockable\n"); edd_show_info_flags()
336 p += scnprintf(p, left, "no media present\n"); edd_show_info_flags()
338 p += scnprintf(p, left, "use int13 fn50\n"); edd_show_info_flags()
353 p += snprintf(p, left, "%u\n", info->legacy_max_cylinder); edd_show_legacy_max_cylinder()
368 p += snprintf(p, left, "%u\n", info->legacy_max_head); edd_show_legacy_max_head()
383 p += snprintf(p, left, "%u\n", info->legacy_sectors_per_track); edd_show_legacy_sectors_per_track()
398 p += scnprintf(p, left, "%u\n", info->params.num_default_cylinders); edd_show_default_cylinders()
413 p += scnprintf(p, left, "%u\n", info->params.num_default_heads); edd_show_default_heads()
428 p += scnprintf(p, left, "%u\n", info->params.sectors_per_track); edd_show_default_sectors_per_track()
443 p += scnprintf(p, left, "%llu\n", info->params.number_of_sectors); edd_show_sectors()
H A Ddmi-id.c92 ssize_t l, left; get_modalias() local
97 p = buffer + 3; left = buffer_size - 4; get_modalias()
99 for (f = fields; f->prefix && left > 0; f++) { get_modalias()
111 l = scnprintf(p, left, ":%s%s", f->prefix, t); get_modalias()
115 left -= l; get_modalias()
/linux-4.1.27/drivers/staging/rtl8712/
H A Dieee80211.c291 int left, count; r8712_parse_wpa_ie() local
303 left = wpa_ie_len - 8; r8712_parse_wpa_ie()
305 if (left >= WPA_SELECTOR_LEN) { r8712_parse_wpa_ie()
308 left -= WPA_SELECTOR_LEN; r8712_parse_wpa_ie()
309 } else if (left > 0) r8712_parse_wpa_ie()
312 if (left >= 2) { r8712_parse_wpa_ie()
315 left -= 2; r8712_parse_wpa_ie()
316 if (count == 0 || left < count * WPA_SELECTOR_LEN) r8712_parse_wpa_ie()
321 left -= WPA_SELECTOR_LEN; r8712_parse_wpa_ie()
323 } else if (left == 1) r8712_parse_wpa_ie()
332 int left, count; r8712_parse_wpa2_ie() local
343 left = rsn_ie_len - 4; r8712_parse_wpa2_ie()
345 if (left >= RSN_SELECTOR_LEN) { r8712_parse_wpa2_ie()
348 left -= RSN_SELECTOR_LEN; r8712_parse_wpa2_ie()
349 } else if (left > 0) r8712_parse_wpa2_ie()
352 if (left >= 2) { r8712_parse_wpa2_ie()
355 left -= 2; r8712_parse_wpa2_ie()
356 if (count == 0 || left < count * RSN_SELECTOR_LEN) r8712_parse_wpa2_ie()
361 left -= RSN_SELECTOR_LEN; r8712_parse_wpa2_ie()
363 } else if (left == 1) r8712_parse_wpa2_ie()
/linux-4.1.27/arch/x86/math-emu/
H A Dround_Xsig.S42 jnz L_shift_1 /* Shift left 1 - 31 bits */
49 /* We need to shift left by 1 - 31 bits */
102 jnz L_n_shift_1 /* Shift left 1 - 31 bits */
111 jnz L_n_shift_1 /* Shift left 1 - 31 bits */
120 /* We need to shift left by 1 - 31 bits */
H A Dreg_norm.S36 jnz L_shift_1 /* Shift left 1 - 31 bits */
45 /* We need to shift left by 1 - 31 bits */
113 jnz L_nuo_shift_1 /* Shift left 1 - 31 bits */
122 /* We need to shift left by 1 - 31 bits */
H A Dreg_u_sub.S177 jnz L_shift_1 /* shift left 1 - 31 bits */
180 jnz L_shift_32 /* shift left 32 - 63 bits */
193 /* Shift left 64 bits */
217 /* We need to shift left by 1 - 31 bits */
/linux-4.1.27/include/uapi/sound/
H A Demu10k1.h141 #define EXTIN_AC97_L 0x00 /* AC'97 capture channel - left */
143 #define EXTIN_SPDIF_CD_L 0x02 /* internal S/PDIF CD - onboard - left */
145 #define EXTIN_ZOOM_L 0x04 /* Zoom Video I2S - left */
147 #define EXTIN_TOSLINK_L 0x06 /* LiveDrive - TOSLink Optical - left */
149 #define EXTIN_LINE1_L 0x08 /* LiveDrive - Line/Mic 1 - left */
151 #define EXTIN_COAX_SPDIF_L 0x0a /* LiveDrive - Coaxial S/PDIF - left */
153 #define EXTIN_LINE2_L 0x0c /* LiveDrive - Line/Mic 2 - left */
157 #define EXTOUT_AC97_L 0x00 /* AC'97 playback channel - left */
159 #define EXTOUT_TOSLINK_L 0x02 /* LiveDrive - TOSLink Optical - left */
163 #define EXTOUT_HEADPHONE_L 0x06 /* LiveDrive - Headphone - left */
165 #define EXTOUT_REAR_L 0x08 /* Rear channel - left */
167 #define EXTOUT_ADC_CAP_L 0x0a /* ADC Capture buffer - left */
176 #define A_EXTIN_AC97_L 0x00 /* AC'97 capture channel - left */
178 #define A_EXTIN_SPDIF_CD_L 0x02 /* digital CD left */
179 #define A_EXTIN_SPDIF_CD_R 0x03 /* digital CD left */
180 #define A_EXTIN_OPT_SPDIF_L 0x04 /* audigy drive Optical SPDIF - left */
182 #define A_EXTIN_LINE2_L 0x08 /* audigy drive line2/mic2 - left */
184 #define A_EXTIN_ADC_L 0x0a /* Philips ADC - left */
186 #define A_EXTIN_AUX2_L 0x0c /* audigy drive aux2 - left */
190 #define A_EXTOUT_FRONT_L 0x00 /* digital front left */
194 #define A_EXTOUT_HEADPHONE_L 0x04 /* headphone audigy drive left */
196 #define A_EXTOUT_REAR_L 0x06 /* digital rear left */
198 #define A_EXTOUT_AFRONT_L 0x08 /* analog front left */
202 #define A_EXTOUT_ASIDE_L 0x0c /* analog side left - Audigy 2 ZS */
204 #define A_EXTOUT_AREAR_L 0x0e /* analog rear left */
206 #define A_EXTOUT_AC97_L 0x10 /* AC97 left (front) */
208 #define A_EXTOUT_ADC_CAP_L 0x16 /* ADC capture buffer left */
/linux-4.1.27/sound/core/oss/
H A Dmixer_oss.c263 int result = 0, left, right; snd_mixer_oss_get_volume() local
268 left = pslot->volume[0]; 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()
274 if (snd_BUG_ON(left < 0 || left > 100)) snd_mixer_oss_get_volume()
279 pslot->volume[0] = left; 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
296 if (left > 100) snd_mixer_oss_set_volume()
297 left = 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()
306 pslot->volume[0] = left; 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()
543 *left = snd_mixer_oss_conv1(uctl->value.integer.value[0], uinfo->value.integer.min, uinfo->value.integer.max, &pslot->volume[0]); snd_mixer_oss_get_volume1_vol()
555 int *left, int *right, snd_mixer_oss_get_volume1_sw()
579 *left = 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()
644 uctl->value.integer.value[0] = snd_mixer_oss_conv2(left, 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()
683 uctl->value.integer.value[0] = left > 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/security/tomoyo/
H A Dcondition.c281 * @left: Lefthand value.
287 static bool tomoyo_parse_argv(char *left, char *right, tomoyo_parse_argv() argument
290 if (tomoyo_parse_ulong(&argv->index, &left) != tomoyo_parse_argv()
291 TOMOYO_VALUE_TYPE_DECIMAL || *left++ != ']' || *left) tomoyo_parse_argv()
300 * @left: Lefthand value.
306 static bool tomoyo_parse_envp(char *left, char *right, tomoyo_parse_envp() argument
311 char *cp = left + strlen(left) - 1; tomoyo_parse_envp()
315 if (!tomoyo_correct_word(left)) tomoyo_parse_envp()
317 name = tomoyo_get_name(left); tomoyo_parse_envp()
494 u8 left = -1; tomoyo_get_condition() local
503 * Since left-hand condition does not allow use of "path_group" tomoyo_get_condition()
506 * of one or more repetition of $left$operator$right blocks tomoyo_get_condition()
507 * where "$left is free from '=' and ' '" and "$operator is tomoyo_get_condition()
552 left = TOMOYO_ARGV_ENTRY; tomoyo_get_condition()
567 left = TOMOYO_ENVP_ENTRY; tomoyo_get_condition()
575 left = tomoyo_condition_type(left_word); tomoyo_get_condition()
576 dprintk(KERN_WARNING "%u: <%s> left=%u\n", __LINE__, left_word, tomoyo_get_condition()
577 left); tomoyo_get_condition()
578 if (left == TOMOYO_MAX_CONDITION_KEYWORD) { tomoyo_get_condition()
583 left = TOMOYO_NUMBER_UNION; tomoyo_get_condition()
595 if (left == TOMOYO_EXEC_REALPATH || tomoyo_get_condition()
596 left == TOMOYO_SYMLINK_TARGET) { 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()
628 condp->left = left; 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()
778 const u8 left = condp->left; tomoyo_condition() local
784 if (left == TOMOYO_ARGV_ENTRY || left == TOMOYO_ENVP_ENTRY) tomoyo_condition()
789 switch (left) { tomoyo_condition()
812 const u8 index = j ? right : left; tomoyo_condition()
1035 if (left == TOMOYO_NUMBER_UNION) { tomoyo_condition()
1074 switch (left) { tomoyo_condition()
/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()
183 static u64 vli_add(u64 *result, const u64 *left, vli_add() argument
192 sum = left[i] + right[i] + carry; vli_add()
193 if (sum != left[i]) vli_add()
194 carry = (sum < left[i]); 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()
212 if (diff != left[i]) vli_sub()
213 borrow = (diff > left[i]); vli_sub()
221 static uint128_t mul_64_64(u64 left, u64 right) mul_64_64() argument
223 u64 a0 = left & 0xffffffffull; mul_64_64()
224 u64 a1 = left >> 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()
291 static void vli_square(u64 *result, const u64 *left) vli_square() argument
308 product = mul_64_64(left[i], left[k - i]); vli_square()
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()
449 /* Computes result = left^2 % curve_p. */ vli_mod_square_fast()
450 static void vli_mod_square_fast(u64 *result, const u64 *left) vli_mod_square_fast() argument
454 vli_square(product, left); vli_mod_square_fast()
/linux-4.1.27/drivers/media/platform/vsp1/
H A Dvsp1_rwpf.c135 crop->left = 0; vsp1_rwpf_set_format()
167 sel->r.left = 0; vsp1_rwpf_get_selection()
196 * WPF top and left offsets are limited to 255. vsp1_rwpf_set_selection()
200 sel->r.left = min_t(unsigned int, sel->r.left, format->width - 2); vsp1_rwpf_set_selection()
203 sel->r.left = min_t(unsigned int, sel->r.left, 255); vsp1_rwpf_set_selection()
207 format->width - sel->r.left); vsp1_rwpf_set_selection()
/linux-4.1.27/arch/s390/include/asm/
H A Didals.h198 size_t left; idal_buffer_to_user() local
203 left = copy_to_user(to, ib->data[i], IDA_BLOCK_SIZE); idal_buffer_to_user()
204 if (left) idal_buffer_to_user()
205 return left + count - IDA_BLOCK_SIZE; idal_buffer_to_user()
218 size_t left; idal_buffer_from_user() local
223 left = copy_from_user(ib->data[i], from, IDA_BLOCK_SIZE); idal_buffer_from_user()
224 if (left) idal_buffer_from_user()
225 return left + count - IDA_BLOCK_SIZE; idal_buffer_from_user()
/linux-4.1.27/arch/x86/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
/linux-4.1.27/arch/sparc/include/uapi/asm/
H A Dipcbuf.h9 * Pad space is left for:
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/s390/include/uapi/asm/
H A Dipcbuf.h9 * Pad space is left for:
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/mips/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/mn10300/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/parisc/include/asm/
H A Drt_sigframe.h11 trampoline we left on the stack (we were bad and didn't
H A Dled.h11 #define LED0 0x01 /* bottom (or furthest left) LED */
/linux-4.1.27/arch/avr32/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/cris/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h11 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/frv/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/ia64/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/m32r/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/arch/alpha/include/uapi/asm/
H A Dsembuf.h9 * Pad space is left for:
H A Dmsgbuf.h9 * Pad space is left for:
H A Dshmbuf.h9 * Pad space is left for:
/linux-4.1.27/drivers/s390/char/
H A Draw3270.h250 struct list_head *p, *left; free_string() local
252 /* Find out the left neighbour in free memory list. */ free_string()
253 left = free_list; list_for_each()
257 left = p; list_for_each()
259 /* Try to merge with right neighbour = next element from left. */
260 if (left->next != free_list) {
261 tmp = list_entry(left->next, struct string, list);
267 /* Try to merge with left neighbour. */
268 if (left != free_list) {
269 tmp = list_entry(left, struct string, list);
275 __list_add(&cs->list, left, left->next);
/linux-4.1.27/arch/arm/plat-samsung/
H A Dpm-check.c110 unsigned long addr, left; s3c_pm_makecheck() local
114 left = res->end - addr; s3c_pm_makecheck()
116 if (left > CHECK_CHUNKSIZE) s3c_pm_makecheck()
117 left = CHECK_CHUNKSIZE; s3c_pm_makecheck()
119 *val = crc32_le(~0, phys_to_virt(addr), left); s3c_pm_makecheck()
168 unsigned long left; s3c_pm_runcheck() local
177 left = res->end - addr; s3c_pm_runcheck()
179 if (left > CHECK_CHUNKSIZE) s3c_pm_runcheck()
180 left = CHECK_CHUNKSIZE; s3c_pm_runcheck()
184 if (in_region(ptr, left, stkpage, 4096)) { s3c_pm_runcheck()
189 if (in_region(ptr, left, crcs, crc_size)) { s3c_pm_runcheck()
196 calc = crc32_le(~0, ptr, left); s3c_pm_runcheck()
/linux-4.1.27/sound/soc/blackfin/
H A Dbf5xx-ac97.h17 u16 ac97_pcm_l; /*slot 3:front left*/
18 u16 ac97_pcm_r; /*slot 4:front left*/
22 u16 ac97_sl; /*slot 7:surround left*/
/linux-4.1.27/sound/soc/codecs/
H A Dsirf-audio-codec.c193 SND_SOC_DAPM_DAC("DAC left", NULL, AUDIO_IC_CODEC_CTRL0, 1, 0),
195 SND_SOC_DAPM_SWITCH("Left dac to hp left amp", SND_SOC_NOPM, 0, 0,
199 SND_SOC_DAPM_SWITCH("Right dac to hp left amp", SND_SOC_NOPM, 0, 0,
203 SND_SOC_DAPM_OUT_DRV("HP amp left driver", AUDIO_IC_CODEC_CTRL0, 3, 0,
219 SND_SOC_DAPM_ADC_E("ADC left", NULL, AUDIO_IC_CODEC_CTRL1, 8, 0,
247 {"Left dac to speaker lineout", "Switch", "DAC left"},
251 {"HP Left Driver", NULL, "HP amp left driver"},
253 {"HP amp left driver", NULL, "Right dac to hp left amp"},
255 {"HP amp left driver", NULL, "Left dac to hp left amp"},
257 {"Right dac to hp left amp", "Switch", "DAC left"},
259 {"Left dac to hp left amp", "Switch", "DAC left"},
261 {"DAC left", NULL, "codecclk"},
263 {"DAC left", NULL, "Playback"},
265 {"DAC left", NULL, "HSL Phase Opposite"},
268 {"Capture", NULL, "ADC left"},
270 {"ADC left", NULL, "codecclk"},
272 {"ADC left", NULL, "Left PGA mixer"},
/linux-4.1.27/lib/
H A Diov_iter.c9 size_t left; \
15 left = (STEP); \
16 __v.iov_len -= left; \
20 left = 0; \
22 while (unlikely(!left && n)) { \
28 left = (STEP); \
29 __v.iov_len -= left; \
141 size_t skip, copy, left, wanted; copy_page_to_iter_iovec() local
163 left = __copy_to_user_inatomic(buf, from, copy); copy_page_to_iter_iovec()
164 copy -= left; copy_page_to_iter_iovec()
169 while (unlikely(!left && bytes)) { copy_page_to_iter_iovec()
173 left = __copy_to_user_inatomic(buf, from, copy); copy_page_to_iter_iovec()
174 copy -= left; copy_page_to_iter_iovec()
191 left = __copy_to_user(buf, from, copy); copy_page_to_iter_iovec()
192 copy -= left; copy_page_to_iter_iovec()
196 while (unlikely(!left && bytes)) { copy_page_to_iter_iovec()
200 left = __copy_to_user(buf, from, copy); copy_page_to_iter_iovec()
201 copy -= left; copy_page_to_iter_iovec()
222 size_t skip, copy, left, wanted; copy_page_from_iter_iovec() local
244 left = __copy_from_user_inatomic(to, buf, copy); copy_page_from_iter_iovec()
245 copy -= left; copy_page_from_iter_iovec()
250 while (unlikely(!left && bytes)) { copy_page_from_iter_iovec()
254 left = __copy_from_user_inatomic(to, buf, copy); copy_page_from_iter_iovec()
255 copy -= left; copy_page_from_iter_iovec()
272 left = __copy_from_user(to, buf, copy); copy_page_from_iter_iovec()
273 copy -= left; copy_page_from_iter_iovec()
277 while (unlikely(!left && bytes)) { copy_page_from_iter_iovec()
281 left = __copy_from_user(to, buf, copy); copy_page_from_iter_iovec()
282 copy -= left; copy_page_from_iter_iovec()
H A Drbtree.c121 * Case 2 - left rotate at parent __rb_insert()
185 /* Case 3 - left rotate at gparent */ __rb_insert()
219 * Case 1 - left rotate at parent ____rb_erase_color()
289 * Case 4 - left rotate at parent + color flips ____rb_erase_color()
349 /* Case 4 - left rotate at parent + color flips */ ____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()
466 * parent, keep going up. First time it's a left-hand child of its rb_next()
484 * If we have a left-hand child, go down and then right as far rb_prev()
495 * No left-hand children. Go up till we find an ancestor which rb_prev()
543 /* If we are the parent's left node, go to the parent's right rb_next_postorder()
544 * node then all the way down to the left */ rb_next_postorder()
H A Dbtree.c37 * values are to the right, not to the left. All used slots within a node
38 * are on the left, all unused slots contain NUL values. Most operations
521 unsigned long *left, int lfill, merge()
528 /* Move all keys to the left */ 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()
534 setval(geo, parent, lpos + 1, left); merge()
535 /* Remove left (formerly right) child from parent */ merge()
543 unsigned long *parent, *left = NULL, *right = NULL; rebalance() local
561 left = bval(geo, parent, i - 1); rebalance()
562 no_left = getfill(geo, left, 0); rebalance()
565 left, no_left, 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
/linux-4.1.27/arch/alpha/lib/
H A Dev6-clear_user.S8 * right "bytes left to zero" value (and that it is updated only _after_
22 * bytes left to copy in $0
86 addq $0, $4, $0 # .. E .. .. : bytes left -= 8 - misalignment
128 * $0 is the number of bytes left
129 * $1 is the number of quads left
141 * through the loop, and if there are less than two trips left, the target
164 subq $0, 168, $5 # E : U L L U : two trips through the loop left?
183 # zero to 16 quadwords left to store, plus any trailing bytes
184 # $1 is the number of quadwords left to go.
202 # We have an unknown number of bytes left to go.
209 # $0 contains the number of bytes left to copy (0..31)
H A Dclear_user.S8 * right "bytes left to zero" value (and that it is updated only _after_
22 * bytes left to copy in $0
96 addq $0, $4, $0 # .. e1 : bytes left -= 8 - misalignment
H A Dcopy_user.S9 * contains the right "bytes left to copy" value (and that it is updated
23 * bytes left to copy in $0
/linux-4.1.27/drivers/media/platform/vivid/
H A Dvivid-vid-common.c625 if (r->left < boundary->left) rect_map_inside()
626 r->left = boundary->left; rect_map_inside()
629 if (r->left + r->width > boundary->width) rect_map_inside()
630 r->left = boundary->width - r->width; rect_map_inside()
648 r.left = max(a->left, b->left); rect_intersect()
650 right = min(a->left + a->width, b->left + b->width); rect_intersect()
652 r.width = max(0, right - r.left); rect_intersect()
664 r->left = r->top = r->width = r->height = 0; rect_scale()
667 r->left = (((r->left - from->left) * to->width) / from->width) & ~1; rect_scale()
676 * IF the left side of r1 is to the right of the right side of r2 OR rect_overlap()
677 * the left side of r2 is to the right of the right side of r1 THEN rect_overlap()
680 if (r1->left >= r2->left + r2->width || rect_overlap()
681 r2->left >= r1->left + r1->width) rect_overlap()
723 if (r->left < 0) vivid_vid_adjust_sel()
724 r->left = 0; vivid_vid_adjust_sel()
725 /* sanitize left and top in case someone passes ~0 as the value */ vivid_vid_adjust_sel()
726 r->left &= 0xfffe; vivid_vid_adjust_sel()
728 if (r->left + w > MAX_WIDTH) vivid_vid_adjust_sel()
729 r->left = MAX_WIDTH - w; vivid_vid_adjust_sel()
H A Dvivid-tpg.c395 tpg->crop.top = tpg->crop.left = 0; tpg_reset_source()
398 tpg->compose.top = tpg->compose.left = 0; tpg_reset_source()
1214 tpg->square.left = (w - tpg->square.width) / 2; tpg_calculate_square_border()
1221 tpg->border.left = 0; tpg_calculate_square_border()
1233 tpg->border.left = (w - tpg->border.width) / 2; tpg_calculate_square_border()
1249 tpg->border.left = (w - tpg->border.width) / 2; tpg_calculate_square_border()
1265 tpg->border.left = (w - tpg->border.width) / 2; tpg_calculate_square_border()
1422 x += tpg->compose.left; tpg_gen_text()
1722 params->wss_width = tpg->crop.left < tpg->src_width / 2 ? tpg_fill_params_extras()
1723 tpg->src_width / 2 - tpg->crop.left : 0; tpg_fill_params_extras()
1730 if (tpg->crop.left < tpg->border.left) { tpg_fill_params_extras()
1731 left_pillar_width = tpg->border.left - tpg->crop.left; tpg_fill_params_extras()
1738 if (tpg->crop.left + tpg->crop.width > tpg_fill_params_extras()
1739 tpg->border.left + tpg->border.width) { tpg_fill_params_extras()
1741 tpg->border.left + tpg->border.width - tpg->crop.left; tpg_fill_params_extras()
1778 unsigned left = params->left_pillar_width; tpg_fill_plane_extras() local
1783 memcpy(vbuf + left, tpg->contrast_line[p], tpg_fill_plane_extras()
1784 right - left); tpg_fill_plane_extras()
1786 if (b->left >= c->left && tpg_fill_plane_extras()
1787 b->left < c->left + c->width) tpg_fill_plane_extras()
1788 memcpy(vbuf + left, tpg_fill_plane_extras()
1790 if (b->left + b->width > c->left && tpg_fill_plane_extras()
1791 b->left + b->width <= c->left + c->width) tpg_fill_plane_extras()
1804 sq->left < c->left + c->width && tpg_fill_plane_extras()
1805 sq->left + sq->width >= c->left) { tpg_fill_plane_extras()
1806 unsigned left = sq->left; tpg_fill_plane_extras() local
1809 if (c->left > left) { tpg_fill_plane_extras()
1810 width -= c->left - left; tpg_fill_plane_extras()
1811 left = c->left; tpg_fill_plane_extras()
1813 if (c->left + c->width < left + width) tpg_fill_plane_extras()
1814 width -= left + width - c->left - c->width; tpg_fill_plane_extras()
1815 left -= c->left; tpg_fill_plane_extras()
1816 left = tpg_hscale_div(tpg, p, left); tpg_fill_plane_extras()
1818 memcpy(vbuf + left, tpg->contrast_line[p], width); tpg_fill_plane_extras()
1864 unsigned line_offset = tpg_hscale_div(tpg, p, tpg->crop.left); tpg_fill_plane_pattern()
2020 vbuf += tpg_hdiv(tpg, p, tpg->compose.left); tpg_fill_plane_buffer()
H A Dvivid-kthread-cap.c65 int left = dev->overlay_out_left; copy_pix() local
67 int fb_x = win_x + left; copy_pix()
77 win_x -= dev->compose_out.left; copy_pix()
87 fb_x >= r->left && fb_x < r->left + r->width) copy_pix()
191 dev->loop_vid_out.left += dev->crop_out.left; vivid_precalc_copy_rects()
200 dev->loop_vid_copy.left, dev->loop_vid_copy.top, vivid_precalc_copy_rects()
202 dev->loop_vid_out.left, dev->loop_vid_out.top, vivid_precalc_copy_rects()
204 dev->loop_vid_cap.left, dev->loop_vid_cap.top); vivid_precalc_copy_rects()
209 r_overlay.left += dev->compose_out.left - dev->overlay_out_left; vivid_precalc_copy_rects()
216 dev->loop_fb_copy.left -= dev->compose_out.left - dev->overlay_out_left; vivid_precalc_copy_rects()
225 dev->loop_fb_copy.left, dev->loop_fb_copy.top, vivid_precalc_copy_rects()
227 dev->loop_vid_overlay.left, dev->loop_vid_overlay.top, vivid_precalc_copy_rects()
229 dev->loop_vid_overlay_cap.left, dev->loop_vid_overlay_cap.top); vivid_precalc_copy_rects()
273 unsigned vid_cap_left = tpg_hdiv(tpg, p, dev->loop_vid_cap.left); vivid_copy_buffer()
292 voutbuf += tpg_hdiv(tpg, p, dev->loop_vid_out.left) + vivid_copy_buffer()
294 vcapbuf += tpg_hdiv(tpg, p, dev->compose_cap.left) + vivid_copy_buffer()
310 vosdbuf += (dev->loop_fb_copy.left * twopixsize) / 2 + vivid_copy_buffer()
318 vid_cap_right = tpg_hdiv(tpg, p, dev->loop_vid_cap.left + dev->loop_vid_cap.width); vivid_copy_buffer()
338 /* fill the left border with black */ vivid_copy_buffer()
339 if (dev->loop_vid_cap.left) vivid_copy_buffer()
369 ((dev->loop_vid_overlay.left - dev->loop_vid_copy.left) * vivid_copy_buffer()
378 dev->loop_vid_overlay.left, vivid_copy_buffer()
588 fb_x >= r->left && fb_x < r->left + r->width) valid_pix()
622 vbuf += dev->compose_cap.left * pixsize + dev->compose_cap.top * stride; vivid_overlay()
/linux-4.1.27/drivers/staging/rtl8723au/core/
H A Drtw_ieee80211.c450 int left, count; rtw_parse_wpa_ie23a() local
464 left = wpa_ie_len - 8; rtw_parse_wpa_ie23a()
467 if (left >= WPA_SELECTOR_LEN) { rtw_parse_wpa_ie23a()
472 left -= WPA_SELECTOR_LEN; rtw_parse_wpa_ie23a()
473 } else if (left > 0) { rtw_parse_wpa_ie23a()
476 __func__, left); rtw_parse_wpa_ie23a()
482 if (left >= 2) { rtw_parse_wpa_ie23a()
486 left -= 2; rtw_parse_wpa_ie23a()
488 if (count == 0 || left < count * WPA_SELECTOR_LEN) { rtw_parse_wpa_ie23a()
490 "%s: ie count botch (pairwise), count %u left %u\n", rtw_parse_wpa_ie23a()
491 __func__, count, left); rtw_parse_wpa_ie23a()
499 left -= WPA_SELECTOR_LEN; rtw_parse_wpa_ie23a()
501 } else if (left == 1) { rtw_parse_wpa_ie23a()
508 if (left >= 6) { rtw_parse_wpa_ie23a()
526 int left, count; rtw_parse_wpa2_ie23a() local
541 left = rsn_ie_len - 4; rtw_parse_wpa2_ie23a()
544 if (left >= RSN_SELECTOR_LEN) { rtw_parse_wpa2_ie23a()
548 left -= RSN_SELECTOR_LEN; rtw_parse_wpa2_ie23a()
549 } else if (left > 0) { rtw_parse_wpa2_ie23a()
552 __func__, left); rtw_parse_wpa2_ie23a()
557 if (left >= 2) { rtw_parse_wpa2_ie23a()
561 left -= 2; rtw_parse_wpa2_ie23a()
563 if (count == 0 || left < count * RSN_SELECTOR_LEN) { rtw_parse_wpa2_ie23a()
565 "%s: ie count botch (pairwise), count %u left %u\n", rtw_parse_wpa2_ie23a()
566 __func__, count, left); rtw_parse_wpa2_ie23a()
574 left -= RSN_SELECTOR_LEN; rtw_parse_wpa2_ie23a()
576 } else if (left == 1) { rtw_parse_wpa2_ie23a()
584 if (left >= 6) { rtw_parse_wpa2_ie23a()
/linux-4.1.27/drivers/media/platform/omap/
H A Domap_voutlib.c52 crop->left = ((pix->width - crop->width) >> 1) & ~1; omap_vout_default_crop()
74 if (try_win.left < 0) { omap_vout_try_window()
75 try_win.width += try_win.left; omap_vout_try_window()
76 try_win.left = 0; omap_vout_try_window()
86 if (try_win.left + try_win.width > fbuf->fmt.width) omap_vout_try_window()
87 try_win.width = fbuf->fmt.width - try_win.left; omap_vout_try_window()
176 if (try_crop.left < 0) { omap_vout_new_crop()
177 try_crop.width += try_crop.left; omap_vout_new_crop()
178 try_crop.left = 0; omap_vout_new_crop()
188 if (try_crop.left + try_crop.width > pix->width) omap_vout_new_crop()
189 try_crop.width = pix->width - try_crop.left; omap_vout_new_crop()
237 if (win->w.width + win->w.left > fbuf->fmt.width) { omap_vout_new_crop()
242 win->w.width = (fbuf->fmt.width - win->w.left) & ~1; omap_vout_new_crop()
293 win->w.left = ((fbuf->fmt.width - win->w.width) >> 1) & ~1; omap_vout_new_format()
/linux-4.1.27/sound/pci/
H A Dak4531_codec.c166 int left, right; snd_ak4531_get_double() local
169 left = (ak4531->regs[left_reg] >> left_shift) & mask; snd_ak4531_get_double()
173 left = mask - left; snd_ak4531_get_double()
176 ucontrol->value.integer.value[0] = left; snd_ak4531_get_double()
191 int left, right; snd_ak4531_put_double() local
193 left = ucontrol->value.integer.value[0] & mask; snd_ak4531_put_double()
196 left = mask - left; snd_ak4531_put_double()
199 left <<= left_shift; snd_ak4531_put_double()
203 left = (ak4531->regs[left_reg] & ~((mask << left_shift) | (mask << right_shift))) | left | right; snd_ak4531_put_double()
204 change = left != ak4531->regs[left_reg]; snd_ak4531_put_double()
205 ak4531->write(ak4531, left_reg, ak4531->regs[left_reg] = left); snd_ak4531_put_double()
207 left = (ak4531->regs[left_reg] & ~(mask << left_shift)) | left; snd_ak4531_put_double()
209 change = left != ak4531->regs[left_reg] || right != ak4531->regs[right_reg]; snd_ak4531_put_double()
210 ak4531->write(ak4531, left_reg, ak4531->regs[left_reg] = left); snd_ak4531_put_double()
/linux-4.1.27/arch/ia64/lib/
H A Dclear_user.S86 // len contains bytes left
97 // The use of len/len2 for countdown of the number of bytes left
122 (p6) br.cond.dpnt .dotail // we have less than 16 bytes left
138 // way would be to use ar.lc and derive how many byte were left by
139 // doing : left= 16*ar.lc + 16. this would avoid the addition at
179 EX( .Lexit2, (p7) st1 [buf]=r0 ) // only 1 byte left
189 // len contains bytes left
193 // if p6 -> coming from st8 or st2 : len2 contains what's left
194 // if p7 -> coming from st4 or st1 : len3 contains what's left
203 // len contains bytes left
H A Dmemset.S192 cmp.le p_scr, p0 = 8, cnt // just a few bytes left ?
246 cmp.gt p_scr, p0 = 8, cnt // just a few bytes left ?
276 cmp.gt p_scr, p0 = 8, cnt // just a few bytes left ?
329 (p_y) st1 [ptr1] = value, 1 // fill 1 (odd-aligned) byte [15, 14 (or less) left]
338 (p_yy) st2 [ptr2] = value, 4 // fill 2 (aligned) bytes [11, 10 (o less) left]
347 (p_y) st2 [ptr2] = value, 4 // fill 2 (aligned) bytes [7, 6 (or less) left]
352 (p_yy) st2 [ptr2] = value, 4 // fill 2 (aligned) bytes [3, 2 (or less) left]
H A Dmemcpy.S159 * until there are less than 8 bytes left over and then we do the tail,
219 // At this point, dst is aligned to 8 bytes and there at least 16-7=9 bytes left to copy:
222 sub cnt=in2,cnt // cnt = number of bytes left to copy
230 shr.u t2=cnt,3 // t2 = number of 8-byte words left to copy
258 // At this point, (p5,p4,p3) are set to the number of bytes left to copy (which is
/linux-4.1.27/net/rds/
H A Dtcp_recv.c162 size_t left = len, to_copy; rds_tcp_data_recv() local
171 while (left) { rds_tcp_data_recv()
189 if (left && tc->t_tinc_hdr_rem) { rds_tcp_data_recv()
190 to_copy = min(tc->t_tinc_hdr_rem, left); rds_tcp_data_recv()
199 left -= to_copy; rds_tcp_data_recv()
209 if (left && tc->t_tinc_data_rem) { rds_tcp_data_recv()
216 to_copy = min(tc->t_tinc_data_rem, left); rds_tcp_data_recv()
220 "left %zu data_rem %zu skb_len %d\n", rds_tcp_data_recv()
221 left, tc->t_tinc_data_rem, skb->len); rds_tcp_data_recv()
234 left -= to_copy; rds_tcp_data_recv()
254 rdsdebug("returning len %zu left %zu skb len %d rx queue depth %d\n", rds_tcp_data_recv()
255 len, left, skb->len, rds_tcp_data_recv()
257 return len - left; rds_tcp_data_recv()
/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
159 err = snd_hdac_exec_verb(codec, reg | AC_AMP_GET_LEFT, 0, &left); 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
183 left = val & 0xff; hda_reg_write_stereo_amp()
185 if (left == right) { hda_reg_write_stereo_amp()
187 return snd_hdac_exec_verb(codec, reg | left, 0, NULL); hda_reg_write_stereo_amp()
190 err = snd_hdac_exec_verb(codec, reg | AC_AMP_SET_LEFT | left, 0, NULL); hda_reg_write_stereo_amp()
/linux-4.1.27/drivers/staging/speakup/
H A Dspeakup_acnt.h15 #define SYNTH_ALMOST_EMPTY 'M' /* synth has less than 2 seconds of text left */
H A Di18n.c49 [MSG_EDGE_LEFT] = "left,",
126 [MSG_KEYNAME_LEFTBRACE] = "left brace",
129 [MSG_KEYNAME_LEFTCTRL] = "left control",
142 [MSG_KEYNAME_LEFTSHFT] = "left shift",
156 [MSG_KEYNAME_LEFTALT] = "left alt",
205 [MSG_KEYNAME_LEFT] = "left",
225 [MSG_KEYNAME_LEFTMETA] = "left meta",
279 [MSG_KEYNAME_KPLEFTPAR] = "keypad left paren",
303 [MSG_FUNCNAME_GOTO_LEFT] = "go to left edge",
324 [MSG_FUNCNAME_SAY_FROM_LEFT] = "say from left",
/linux-4.1.27/drivers/staging/rtl8188eu/core/
H A Drtw_ieee80211.c521 int left, count; rtw_parse_wpa_ie() local
538 left = wpa_ie_len - 8; rtw_parse_wpa_ie()
542 if (left >= WPA_SELECTOR_LEN) { rtw_parse_wpa_ie()
545 left -= WPA_SELECTOR_LEN; rtw_parse_wpa_ie()
546 } else if (left > 0) { rtw_parse_wpa_ie()
547 RT_TRACE(_module_rtl871x_mlme_c_, _drv_err_, ("%s: ie length mismatch, %u too much", __func__, left)); rtw_parse_wpa_ie()
552 if (left >= 2) { rtw_parse_wpa_ie()
555 left -= 2; rtw_parse_wpa_ie()
557 if (count == 0 || left < count * WPA_SELECTOR_LEN) { rtw_parse_wpa_ie()
559 "count %u left %u", __func__, count, left)); rtw_parse_wpa_ie()
567 left -= WPA_SELECTOR_LEN; rtw_parse_wpa_ie()
569 } else if (left == 1) { rtw_parse_wpa_ie()
575 if (left >= 6) { rtw_parse_wpa_ie()
590 int left, count; rtw_parse_wpa2_ie() local
605 left = rsn_ie_len - 4; rtw_parse_wpa2_ie()
608 if (left >= RSN_SELECTOR_LEN) { rtw_parse_wpa2_ie()
612 left -= RSN_SELECTOR_LEN; rtw_parse_wpa2_ie()
614 } else if (left > 0) { rtw_parse_wpa2_ie()
615 RT_TRACE(_module_rtl871x_mlme_c_, _drv_err_, ("%s: ie length mismatch, %u too much", __func__, left)); rtw_parse_wpa2_ie()
620 if (left >= 2) { rtw_parse_wpa2_ie()
623 left -= 2; rtw_parse_wpa2_ie()
625 if (count == 0 || left < count * RSN_SELECTOR_LEN) { rtw_parse_wpa2_ie()
627 "count %u left %u", __func__, count, left)); rtw_parse_wpa2_ie()
635 left -= RSN_SELECTOR_LEN; rtw_parse_wpa2_ie()
638 } else if (left == 1) { rtw_parse_wpa2_ie()
645 if (left >= 6) { rtw_parse_wpa2_ie()
955 uint left = len; rtw_ieee802_11_parse_elems() local
961 while (left >= 2) { rtw_ieee802_11_parse_elems()
966 left -= 2; rtw_ieee802_11_parse_elems()
968 if (elen > left) { rtw_ieee802_11_parse_elems()
970 DBG_88E("IEEE 802.11 element parse failed (id=%d elen=%d left=%lu)\n", rtw_ieee802_11_parse_elems()
971 id, elen, (unsigned long)left); rtw_ieee802_11_parse_elems()
1061 left -= elen; rtw_ieee802_11_parse_elems()
1064 if (left) rtw_ieee802_11_parse_elems()
/linux-4.1.27/arch/xtensa/include/uapi/asm/
H A Dipcbuf.h15 * Pad space is left for:
H A Dsembuf.h15 * Pad space is left for:
/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 Dashldi3.S3 ! 64-bit arithmetic shift left routine.
/linux-4.1.27/include/uapi/asm-generic/
H A Dipcbuf.h13 * Pad space is left for:
H A Dsembuf.h19 * Pad space is left for:
/linux-4.1.27/arch/parisc/include/uapi/asm/
H A Dsembuf.h11 * Pad space is left for:
H A Dmsgbuf.h11 * Pad space is left for:
H A Dshmbuf.h11 * Pad space is left for:
/linux-4.1.27/arch/powerpc/perf/
H A Dcore-fsl-emb.c327 s64 left = local64_read(&event->hw.period_left); fsl_emb_pmu_add() local
328 if (left < 0x80000000L) fsl_emb_pmu_add()
329 val = 0x80000000L - left; fsl_emb_pmu_add()
395 s64 left; fsl_emb_pmu_start() local
410 left = local64_read(&event->hw.period_left); fsl_emb_pmu_start()
412 if (left < 0x80000000L) fsl_emb_pmu_start()
413 val = 0x80000000L - left; fsl_emb_pmu_start()
610 s64 prev, delta, left; record_and_restart() local
628 left = local64_read(&event->hw.period_left) - delta; record_and_restart()
630 if (left <= 0) { record_and_restart()
631 left += period; record_and_restart()
632 if (left <= 0) record_and_restart()
633 left = period; record_and_restart()
637 if (left < 0x80000000LL) record_and_restart()
638 val = 0x80000000LL - left; record_and_restart()
643 local64_set(&event->hw.period_left, left); record_and_restart()
/linux-4.1.27/fs/xfs/libxfs/
H A Dxfs_btree.c391 * The header is called struct xfs_btree_block for reasons better left unknown
772 xfs_fsblock_t left = be64_to_cpu(block->bb_u.l.bb_leftsib); xfs_btree_readahead_lblock() local
775 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLFSBLOCK) { xfs_btree_readahead_lblock()
776 xfs_btree_reada_bufl(cur->bc_mp, left, 1, xfs_btree_readahead_lblock()
797 xfs_agblock_t left = be32_to_cpu(block->bb_u.s.bb_leftsib); xfs_btree_readahead_sblock() local
801 if ((lr & XFS_BTCUR_LEFTRA) && left != NULLAGBLOCK) { xfs_btree_readahead_sblock()
803 left, 1, cur->bc_ops->buf_ops); xfs_btree_readahead_sblock()
824 int lr) /* left/right bits */ xfs_btree_readahead()
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.
1556 /* Read-ahead to the left at this level. */ xfs_btree_decrement()
1572 /* Fail if we just went off the left edge of the tree. */ xfs_btree_decrement()
1581 * Stop when we don't go off the left edge of a block. xfs_btree_decrement()
1586 /* Read-ahead the left block for the next loop. */ xfs_btree_decrement()
1776 * - greater than, move left xfs_btree_lookup()
1795 * If we moved left, need the previous key number, xfs_btree_lookup()
1962 * Move 1 record left from cur/level if possible.
1972 struct xfs_buf *lbp; /* left buffer pointer */ xfs_btree_lshift()
1973 struct xfs_btree_block *left; /* left btree block */ xfs_btree_lshift() local
1974 int lrecs; /* left record count */ xfs_btree_lshift()
1978 union xfs_btree_ptr lptr; /* left btree pointer */ xfs_btree_lshift()
2000 /* If we've got no left sibling then we can't shift an entry left. */ xfs_btree_lshift()
2012 /* Set up the left neighbor as "left". */ xfs_btree_lshift()
2013 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp); xfs_btree_lshift()
2018 lrecs = xfs_btree_get_numrecs(left); xfs_btree_lshift()
2025 * We add one entry to the left side and remove one for the right side. xfs_btree_lshift()
2036 * If non-leaf, copy a key and a ptr to the left block. xfs_btree_lshift()
2037 * Log the changes to the left block. xfs_btree_lshift()
2041 union xfs_btree_key *lkp; /* left btree key */ xfs_btree_lshift()
2042 union xfs_btree_ptr *lpp; /* left address pointer */ xfs_btree_lshift()
2044 lkp = xfs_btree_key_addr(cur, lrecs, left); xfs_btree_lshift()
2047 lpp = xfs_btree_ptr_addr(cur, lrecs, left); xfs_btree_lshift()
2061 xfs_btree_key_addr(cur, lrecs - 1, left), lkp)); xfs_btree_lshift()
2064 union xfs_btree_rec *lrp; /* left record pointer */ xfs_btree_lshift()
2066 lrp = xfs_btree_rec_addr(cur, lrecs, left); xfs_btree_lshift()
2073 xfs_btree_rec_addr(cur, lrecs - 1, left), lrp)); xfs_btree_lshift()
2076 xfs_btree_set_numrecs(left, lrecs); xfs_btree_lshift()
2127 /* Slide the cursor value left one. */ xfs_btree_lshift()
2155 struct xfs_buf *lbp; /* left buffer pointer */ xfs_btree_rshift()
2156 struct xfs_btree_block *left; /* left btree block */ xfs_btree_rshift() local
2163 int lrecs; /* left record count */ xfs_btree_rshift()
2174 /* Set up variables for this block as "left". */ xfs_btree_rshift()
2175 left = xfs_btree_get_block(cur, level, &lbp); xfs_btree_rshift()
2178 error = xfs_btree_check_block(cur, left, level, lbp); xfs_btree_rshift()
2184 xfs_btree_get_sibling(cur, left, &rptr, XFS_BB_RIGHTSIB); xfs_btree_rshift()
2192 lrecs = xfs_btree_get_numrecs(left); xfs_btree_rshift()
2211 * copy the last left block entry to the hole. xfs_btree_rshift()
2219 lkp = xfs_btree_key_addr(cur, lrecs, left); xfs_btree_rshift()
2220 lpp = xfs_btree_ptr_addr(cur, lrecs, left); xfs_btree_rshift()
2255 lrp = xfs_btree_rec_addr(cur, lrecs, left); xfs_btree_rshift()
2272 * Decrement and log left's numrecs, bump and log right's numrecs. xfs_btree_rshift()
2274 xfs_btree_set_numrecs(left, --lrecs); xfs_btree_rshift()
2333 union xfs_btree_ptr lptr; /* left sibling block ptr */ __xfs_btree_split()
2334 struct xfs_buf *lbp; /* left buffer pointer */ __xfs_btree_split()
2335 struct xfs_btree_block *left; /* left btree block */ __xfs_btree_split() local
2355 /* Set up left block (current one). */ __xfs_btree_split()
2356 left = xfs_btree_get_block(cur, level, &lbp); __xfs_btree_split()
2359 error = xfs_btree_check_block(cur, left, level, lbp); __xfs_btree_split()
2380 xfs_btree_init_block_cur(cur, rbp, xfs_btree_get_level(left), 0); __xfs_btree_split()
2387 lrecs = xfs_btree_get_numrecs(left); __xfs_btree_split()
2396 * Copy btree block entries from the left block over to the __xfs_btree_split()
2402 union xfs_btree_key *lkp; /* left btree key */ __xfs_btree_split()
2403 union xfs_btree_ptr *lpp; /* left address pointer */ __xfs_btree_split()
2407 lkp = xfs_btree_key_addr(cur, src_index, left); __xfs_btree_split()
2408 lpp = xfs_btree_ptr_addr(cur, src_index, left); __xfs_btree_split()
2430 union xfs_btree_rec *lrp; /* left record pointer */ __xfs_btree_split()
2433 lrp = xfs_btree_rec_addr(cur, src_index, left); __xfs_btree_split()
2445 * Find the left block number by looking in the buffer. __xfs_btree_split()
2448 xfs_btree_get_sibling(cur, left, &rrptr, XFS_BB_RIGHTSIB); __xfs_btree_split()
2451 xfs_btree_set_sibling(cur, left, &rptr, XFS_BB_RIGHTSIB); __xfs_btree_split()
2454 xfs_btree_set_numrecs(left, lrecs); __xfs_btree_split()
2462 * point back to right instead of to left. __xfs_btree_split()
2474 * If it's just pointing past the last entry in left, then we'll __xfs_btree_split()
2706 struct xfs_buf *lbp; /* left buffer pointer */ xfs_btree_new_root()
2707 struct xfs_btree_block *left; /* left btree block */ xfs_btree_new_root() local
2741 * one the cursor is pointing at, so we set up variables "left" and xfs_btree_new_root()
2754 /* Our block is left, pick up the right block. */ xfs_btree_new_root()
2757 left = block; xfs_btree_new_root()
2764 /* Our block is right, pick up the left block. */ xfs_btree_new_root()
2769 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp); xfs_btree_new_root()
2782 if (xfs_btree_get_level(left) > 0) { xfs_btree_new_root()
2785 xfs_btree_key_addr(cur, 1, left), 1); xfs_btree_new_root()
2792 xfs_btree_rec_addr(cur, 1, left)); xfs_btree_new_root()
2863 /* Next, try shifting an entry to the left neighbor. */ xfs_btree_make_block_unfull()
2934 /* If we're off the left edge, return failure. */ xfs_btree_insrec()
3360 union xfs_btree_ptr lptr; /* left sibling block ptr */ xfs_btree_delrec()
3361 struct xfs_buf *lbp; /* left buffer pointer */ xfs_btree_delrec()
3362 struct xfs_btree_block *left; /* left btree block */ xfs_btree_delrec() local
3363 int lrecs = 0; /* left record count */ xfs_btree_delrec()
3475 * nothing left to do. xfs_btree_delrec()
3494 * If this is the root level, and there's only one entry left, xfs_btree_delrec()
3540 * tree balanced. Look at the left and right sibling blocks to xfs_btree_delrec()
3607 * won't make it too empty, and left-shifting an entry out xfs_btree_delrec()
3647 * If there's a left sibling, see if it's ok to shift an entry xfs_btree_delrec()
3665 left = xfs_btree_get_block(tcur, level, &lbp); xfs_btree_delrec()
3667 error = xfs_btree_check_block(cur, left, level, lbp); xfs_btree_delrec()
3672 xfs_btree_get_sibling(tcur, left, &cptr, XFS_BB_RIGHTSIB); xfs_btree_delrec()
3675 * If left block is full enough so that removing one entry xfs_btree_delrec()
3677 * of left to us works, we're done. xfs_btree_delrec()
3679 if (xfs_btree_get_numrecs(left) - 1 >= xfs_btree_delrec()
3701 lrecs = xfs_btree_get_numrecs(left); xfs_btree_delrec()
3716 * "left" to be the left neighbor. xfs_btree_delrec()
3721 error = xfs_btree_read_buf_block(cur, &lptr, 0, &left, &lbp); xfs_btree_delrec()
3732 * Set "left" to be the starting block, xfs_btree_delrec()
3736 left = block; xfs_btree_delrec()
3754 lrecs = xfs_btree_get_numrecs(left); 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()
3763 union xfs_btree_key *lkp; /* left btree key */ xfs_btree_delrec()
3764 union xfs_btree_ptr *lpp; /* left address pointer */ xfs_btree_delrec()
3768 lkp = xfs_btree_key_addr(cur, lrecs + 1, left); xfs_btree_delrec()
3769 lpp = xfs_btree_ptr_addr(cur, lrecs + 1, left); xfs_btree_delrec()
3786 union xfs_btree_rec *lrp; /* left record pointer */ xfs_btree_delrec()
3789 lrp = xfs_btree_rec_addr(cur, lrecs + 1, left); xfs_btree_delrec()
3802 xfs_btree_set_numrecs(left, lrecs + rrecs); xfs_btree_delrec()
3804 xfs_btree_set_sibling(cur, left, &cptr, XFS_BB_RIGHTSIB); xfs_btree_delrec()
3808 xfs_btree_get_sibling(cur, left, &cptr, XFS_BB_RIGHTSIB); xfs_btree_delrec()
3824 * If we joined with the left neighbor, set the buffer in the xfs_btree_delrec()
3825 * cursor to the left block, and fix up the index. 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
4039 /* grab the left hand block */ xfs_btree_change_owner()
4044 /* readahead the left most block for the next level down */ xfs_btree_change_owner()
/linux-4.1.27/arch/x86/include/asm/
H A Dbootparam_utils.h17 * Note: efi_info is commonly left uninitialized, but that field has a
37 /* fields in boot_params are left uninitialized, clear them */ sanitize_boot_params()
/linux-4.1.27/drivers/media/dvb-core/
H A Ddvb_math.h28 * computes log2 of a value; the result is shifted left by 24 bits
43 * computes log10 of a value; the result is shifted left by 24 bits
/linux-4.1.27/arch/mn10300/unit-asb2303/
H A Dleds.c33 ~0x20, /* left bottom - segE */
34 ~0x40, /* left top - segF */
/linux-4.1.27/fs/dlm/
H A Ddir.c88 int left; dlm_recover_directory() local
105 left = ls->ls_recover_buf->rc_header.h_length; dlm_recover_directory()
106 left -= sizeof(struct dlm_rcom); dlm_recover_directory()
112 if (left < sizeof(__be16)) dlm_recover_directory()
118 left -= sizeof(__be16); dlm_recover_directory()
129 if (namelen > left) dlm_recover_directory()
180 left -= namelen; dlm_recover_directory()
232 /* Find the rsb where we left off (or start again), then send rsb names
/linux-4.1.27/drivers/gpu/drm/qxl/
H A Dqxl_draw.c93 drawable->self_bitmap_area.left = 0; make_drawable()
197 rect.left = x; qxl_draw_opaque_fb()
232 drawable->u.copy.src_area.left = 0; qxl_draw_opaque_fb()
281 int left, right, top, bottom; qxl_draw_dirty_fb() local
299 left = clips->x1; qxl_draw_dirty_fb()
307 left = min_t(int, left, (int)clips_ptr->x1); qxl_draw_dirty_fb()
313 width = right - left; qxl_draw_dirty_fb()
331 drawable_rect.left = left; qxl_draw_dirty_fb()
347 left, top, width, height, depth, stride); qxl_draw_dirty_fb()
364 drawable->u.copy.src_area.left = 0; qxl_draw_dirty_fb()
379 rects[i].left = clips_ptr->x1; qxl_draw_dirty_fb()
422 rect.left = dx; qxl_draw_copyarea()
/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()
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()
281 struct interval_node *left = node->in_left; __rotate_right() local
284 node->in_left = left->in_right; __rotate_right()
286 left->in_right->in_parent = node; __rotate_right()
287 left->in_right = node; __rotate_right()
289 left->in_parent = parent; __rotate_right()
292 parent->in_right = left; __rotate_right()
294 parent->in_left = left; __rotate_right()
296 *root = left; __rotate_right()
298 node->in_parent = left; __rotate_right()
300 /* update max_high for node and left */ __rotate_right()
301 __rotate_change_maxhigh(node, left); __rotate_right()
520 } else { /* Both left and right child are not NULL */ interval_erase()
646 /* If we ever got the left, it means that the interval_search()
/linux-4.1.27/drivers/video/fbdev/
H A Darcfb.c248 unsigned int left, unsigned int right, unsigned int distance) arcfb_lcd_update_page()
256 xindex = left >> 6; arcfb_lcd_update_page()
263 src = (unsigned char __force *) par->info->screen_base + (left/8) + arcfb_lcd_update_page()
265 ks108_set_xaddr(par, chipindex, left); arcfb_lcd_update_page()
269 while (left <= right) { arcfb_lcd_update_page()
281 left++; arcfb_lcd_update_page()
295 * lcd chips. update_page uses the upper/left values to decide which
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()
321 static void arcfb_lcd_update_horiz(struct arcfb_par *par, unsigned int left, arcfb_lcd_update_horiz() argument
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
354 left = dx; arcfb_lcd_update()
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
/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,
320 static bool regions_are_adjacent(efi_memory_desc_t *left, regions_are_adjacent() argument
325 if (left == NULL || right == NULL) regions_are_adjacent()
328 left_end = left->phys_addr + left->num_pages * EFI_PAGE_SIZE; regions_are_adjacent()
334 * Returns whether region @left and region @right have compatible memory type
337 static bool regions_have_compatible_memory_type_attrs(efi_memory_desc_t *left, regions_have_compatible_memory_type_attrs() argument
344 return ((left->attribute ^ right->attribute) & mem_type_mask) == 0; regions_have_compatible_memory_type_attrs()
/linux-4.1.27/arch/x86/kernel/cpu/microcode/
H A Damd_early.c119 int offset, left; apply_ucode_in_initrd() local
136 left = size; apply_ucode_in_initrd()
149 while (left > 0) { apply_ucode_in_initrd()
157 left -= offset; apply_ucode_in_initrd()
162 *cont_sz = compute_container_size(*cont, left + offset); apply_ucode_in_initrd()
168 left = *cont_sz - offset; apply_ucode_in_initrd()
177 while (left > 0) { apply_ucode_in_initrd()
185 left -= offset; apply_ucode_in_initrd()
203 while (left > 0) { apply_ucode_in_initrd()
227 left -= offset; apply_ucode_in_initrd()
/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/drivers/isdn/hardware/avm/
H A Db1.c156 int i, left; b1_load_t4file() local
160 left = t4file->len; b1_load_t4file()
161 while (left > FWBUF_SIZE) { b1_load_t4file()
174 left -= FWBUF_SIZE; b1_load_t4file()
177 if (left) { b1_load_t4file()
179 if (copy_from_user(buf, dp, left)) b1_load_t4file()
182 memcpy(buf, dp, left); b1_load_t4file()
184 for (i = 0; i < left; i++) b1_load_t4file()
199 int i, j, left; b1_load_config() local
202 left = config->len; b1_load_config()
203 if (left) { b1_load_config()
207 b1_put_word(base, left); b1_load_config()
209 while (left > FWBUF_SIZE) { b1_load_config()
222 left -= FWBUF_SIZE; b1_load_config()
225 if (left) { b1_load_config()
227 if (copy_from_user(buf, dp, left)) b1_load_config()
230 memcpy(buf, dp, left); b1_load_config()
232 for (i = 0; i < left; ) { b1_load_config()
235 if (i < left) b1_load_config()
/linux-4.1.27/sound/pci/ctxfi/
H A Dctdaio.c32 unsigned short left; 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},
339 idx_l = idx_20k1[desc->type].left; daio_rsc_init()
343 idx_l = idx_20k2[desc->type].left; daio_rsc_init()
/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
195 bLeft = left * 0xff / 100; snd_msndmix_set()
196 wLeft = left * 0xffff / 100; snd_msndmix_set()
260 int left, right; snd_msndmix_volume_put() local
263 left = ucontrol->value.integer.value[0] % 101; snd_msndmix_volume_put()
266 change = msnd->left_levels[addr] != left snd_msndmix_volume_put()
268 snd_msndmix_set(msnd, addr, left, right); snd_msndmix_volume_put()
/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
504 double l = left->diff.period_ratio_delta; __hist_entry__cmp_compute()
511 double l = left->diff.period_ratio; __hist_entry__cmp_compute()
518 s64 l = left->diff.wdiff; __hist_entry__cmp_compute()
531 hist_entry__cmp_compute(struct hist_entry *left, struct hist_entry *right, hist_entry__cmp_compute() argument
534 bool pairs_left = hist_entry__has_pairs(left); hist_entry__cmp_compute()
544 p_left = get_pair_data(left, &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
566 p_left = get_pair_data(left, &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()
585 return left->dummy ? 1 : -1; hist_entry__cmp_compute_idx()
593 struct hist_entry *left __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/drivers/gpu/drm/panel/
H A Dpanel-sharp-lq101r1sx01.c136 static int sharp_setup_symmetrical_split(struct mipi_dsi_device *left, sharp_setup_symmetrical_split() argument
142 err = mipi_dsi_dcs_set_column_address(left, 0, mode->hdisplay / 2 - 1); sharp_setup_symmetrical_split()
144 dev_err(&left->dev, "failed to set column address: %d\n", err); sharp_setup_symmetrical_split()
148 err = mipi_dsi_dcs_set_page_address(left, 0, mode->vdisplay - 1); sharp_setup_symmetrical_split()
150 dev_err(&left->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()
228 * configurations, but this driver currently supports only the left- sharp_panel_prepare()
/linux-4.1.27/drivers/tty/hvc/
H A Dhvc_vio.c77 int left; member in struct:hvterm_priv
96 if (pv->left == 0) { hvterm_raw_get_chars()
98 pv->left = hvc_get_chars(pv->termno, pv->buf, count); hvterm_raw_get_chars()
104 for (i = 1; i < pv->left; ++i) { hvterm_raw_get_chars()
106 --pv->left; hvterm_raw_get_chars()
107 if (i < pv->left) { hvterm_raw_get_chars()
109 pv->left - i); hvterm_raw_get_chars()
115 got = min(count, pv->left); hvterm_raw_get_chars()
118 pv->left -= got; hvterm_raw_get_chars()
/linux-4.1.27/fs/btrfs/
H A Dctree.c1886 struct extent_buffer *left = NULL; balance_level() local
1960 left = read_node_slot(root, parent, pslot - 1); balance_level()
1961 if (left) { balance_level()
1962 btrfs_tree_lock(left); balance_level()
1963 btrfs_set_lock_blocking(left); balance_level()
1964 wret = btrfs_cow_block(trans, root, left, balance_level()
1965 parent, pslot - 1, &left); balance_level()
1984 if (left) { balance_level()
1985 orig_slot += btrfs_header_nritems(left); balance_level()
1986 wret = push_node_left(trans, root, left, mid, 1); balance_level()
2020 * So, pull some keys from the left. balance_level()
2021 * There has to be a left pointer at this point because balance_level()
2025 if (!left) { balance_level()
2030 wret = balance_node_right(trans, root, mid, left); balance_level()
2036 wret = push_node_left(trans, root, left, mid, 1); balance_level()
2061 if (left) { balance_level()
2062 if (btrfs_header_nritems(left) > orig_slot) { balance_level()
2063 extent_buffer_get(left); balance_level()
2064 /* left was locked after cow */ balance_level()
2065 path->nodes[level] = left; balance_level()
2073 orig_slot -= btrfs_header_nritems(left); balance_level()
2086 if (left) { balance_level()
2087 if (path->nodes[level] != left) balance_level()
2088 btrfs_tree_unlock(left); balance_level()
2089 free_extent_buffer(left); balance_level()
2104 struct extent_buffer *left = NULL; push_nodes_for_insert() local
2125 left = read_node_slot(root, parent, pslot - 1); push_nodes_for_insert()
2128 if (left) { push_nodes_for_insert()
2131 btrfs_tree_lock(left); push_nodes_for_insert()
2132 btrfs_set_lock_blocking(left); push_nodes_for_insert()
2134 left_nr = btrfs_header_nritems(left); push_nodes_for_insert()
2138 ret = btrfs_cow_block(trans, root, left, parent, push_nodes_for_insert()
2139 pslot - 1, &left); push_nodes_for_insert()
2144 left, mid, 0); push_nodes_for_insert()
2157 if (btrfs_header_nritems(left) > orig_slot) { push_nodes_for_insert()
2158 path->nodes[level] = left; push_nodes_for_insert()
2165 btrfs_header_nritems(left); push_nodes_for_insert()
2167 btrfs_tree_unlock(left); push_nodes_for_insert()
2168 free_extent_buffer(left); push_nodes_for_insert()
2172 btrfs_tree_unlock(left); push_nodes_for_insert()
2173 free_extent_buffer(left); push_nodes_for_insert()
3123 * This is used after shifting pointers to the left, so it stops
3181 * try to push data from one node into the next node left in the
3184 * returns 0 if some ptrs were pushed left, < 0 if there was some horrible
3185 * error, and > 0 if there was no room in the left hand block.
3259 * this will only push up to 1/2 the contents of the left node over
3438 * left and right, if either one works, it returns right away.
3565 * the leaf has left for both items and data
3594 struct extent_buffer *left = path->nodes[0]; __push_leaf_right() local
3627 int space = btrfs_leaf_free_space(root, left); __push_leaf_right()
3636 this_item_size = btrfs_item_size(left, item); __push_leaf_right()
3652 /* push left to right */ __push_leaf_right()
3655 push_space = btrfs_item_end_nr(left, left_nritems - push_items); __push_leaf_right()
3656 push_space -= leaf_data_end(root, left); __push_leaf_right()
3665 /* copy from the left data area */ __push_leaf_right()
3666 copy_extent_buffer(right, left, btrfs_leaf_data(right) + __push_leaf_right()
3668 btrfs_leaf_data(left) + leaf_data_end(root, left), __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()
3691 btrfs_set_header_nritems(left, left_nritems); __push_leaf_right()
3694 btrfs_mark_buffer_dirty(left); __push_leaf_right()
3696 clean_tree_block(trans, root->fs_info, left); __push_leaf_right()
3740 struct extent_buffer *left = path->nodes[0]; push_leaf_right() local
3779 left_nritems = btrfs_header_nritems(left); push_leaf_right()
3787 * no need to touch/dirty our left leaft. */ push_leaf_right()
3788 btrfs_tree_unlock(left); push_leaf_right()
3789 free_extent_buffer(left); push_leaf_right()
3805 * push some data in the path leaf to the left, trying to free up at
3815 int empty, struct extent_buffer *left, __push_leaf_left()
3869 /* push data from right to left */ __push_leaf_left()
3870 copy_extent_buffer(left, right, __push_leaf_left()
3871 btrfs_item_nr_offset(btrfs_header_nritems(left)), __push_leaf_left()
3878 copy_extent_buffer(left, right, btrfs_leaf_data(left) + __push_leaf_left()
3879 leaf_data_end(root, left) - push_space, __push_leaf_left()
3883 old_left_nritems = btrfs_header_nritems(left); __push_leaf_left()
3886 old_left_item_size = btrfs_item_offset_nr(left, old_left_nritems - 1); __push_leaf_left()
3892 ioff = btrfs_token_item_offset(left, item, &token); __push_leaf_left()
3893 btrfs_set_token_item_offset(left, item, __push_leaf_left()
3897 btrfs_set_header_nritems(left, old_left_nritems + push_items); __push_leaf_left()
3928 btrfs_mark_buffer_dirty(left); __push_leaf_left()
3942 path->nodes[0] = left; __push_leaf_left()
3945 btrfs_tree_unlock(left); __push_leaf_left()
3946 free_extent_buffer(left); __push_leaf_left()
3952 btrfs_tree_unlock(left); __push_leaf_left()
3953 free_extent_buffer(left); __push_leaf_left()
3958 * push some data in the path leaf to the left, trying to free up at
3970 struct extent_buffer *left; push_leaf_left() local
3988 left = read_node_slot(root, path->nodes[1], slot - 1); push_leaf_left()
3989 if (left == NULL) push_leaf_left()
3992 btrfs_tree_lock(left); push_leaf_left()
3993 btrfs_set_lock_blocking(left); push_leaf_left()
3995 free_space = btrfs_leaf_free_space(root, left); push_leaf_left()
4002 ret = btrfs_cow_block(trans, root, left, push_leaf_left()
4003 path->nodes[1], slot - 1, &left); push_leaf_left()
4011 free_space = btrfs_leaf_free_space(root, left); push_leaf_left()
4018 empty, left, free_space, right_nritems, push_leaf_left()
4021 btrfs_tree_unlock(left); push_leaf_left()
4022 free_extent_buffer(left); push_leaf_left()
4185 /* first try to make some room by pushing left and right */ split_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()
3812 __push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int data_size, int empty, struct extent_buffer *left, int free_space, u32 right_nritems, u32 max_slot) __push_leaf_left() argument
/linux-4.1.27/tools/lib/traceevent/
H A Devent-parse.c790 free_arg(arg->op.left); free_arg()
1659 struct print_arg *arg, *left, *right; process_cond() local
1664 left = alloc_arg(); process_cond()
1667 if (!arg || !left || !right) { process_cond()
1670 free_arg(left); process_cond()
1676 arg->op.left = left; process_cond()
1680 type = process_arg(event, left, &token); process_cond()
1685 type = process_op(event, left, &token); process_cond()
1802 if (!arg->op.left || arg->op.left->type == PRINT_NULL) set_op_prio()
1814 struct print_arg *left, *right = NULL; process_op() local
1821 if (arg->type == PRINT_OP && !arg->op.left) { process_op()
1839 /* make an empty left */ process_op()
1840 left = alloc_arg(); process_op()
1841 if (!left) process_op()
1844 left->type = PRINT_NULL; process_op()
1845 arg->op.left = left; process_op()
1859 left = alloc_arg(); process_op()
1860 if (!left) process_op()
1863 /* copy the top arg to the left */ process_op()
1864 *left = *arg; process_op()
1868 arg->op.left = left; process_op()
1892 left = alloc_arg(); process_op()
1893 if (!left) process_op()
1896 /* copy the top arg to the left */ process_op()
1897 *left = *arg; process_op()
1901 arg->op.left = left; process_op()
1919 if (left->type != PRINT_ATOM) { process_op()
1923 new_atom = realloc(left->atom.atom, process_op()
1924 strlen(left->atom.atom) + 3); process_op()
1928 left->atom.atom = new_atom; process_op()
1929 strcat(left->atom.atom, " *"); process_op()
1931 *arg = *left; process_op()
1932 free(left); process_op()
1948 arg->op.right = right->op.left; process_op()
1954 arg->op.left = right; process_op()
1961 left = alloc_arg(); process_op()
1962 if (!left) process_op()
1965 *left = *arg; process_op()
1969 arg->op.left = left; process_op()
1979 /* the arg is now the left side */ process_op()
2186 long long left, right; arg_num_eval() local
2202 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2209 *val = left || right; arg_num_eval()
2211 *val = left | right; arg_num_eval()
2214 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2221 *val = left && right; arg_num_eval()
2223 *val = left & right; arg_num_eval()
2226 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2234 *val = left < right; arg_num_eval()
2237 *val = left << right; arg_num_eval()
2240 *val = left <= right; arg_num_eval()
2248 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2256 *val = left > right; arg_num_eval()
2259 *val = left >> right; arg_num_eval()
2262 *val = left >= right; arg_num_eval()
2270 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2281 *val = left == right; arg_num_eval()
2284 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2293 *val = left != right; arg_num_eval()
2302 if (arg->op.left->type == PRINT_NULL) arg_num_eval()
2303 left = 0; arg_num_eval()
2305 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2311 *val = left - right; arg_num_eval()
2314 if (arg->op.left->type == PRINT_NULL) arg_num_eval()
2315 left = 0; arg_num_eval()
2317 ret = arg_num_eval(arg->op.left, &left); arg_num_eval()
2323 *val = left + right; arg_num_eval()
2985 arg->op.left = NULL; process_arg_token()
3395 unsigned long long left, right; eval_num_arg() local
3446 larg = arg->op.left; eval_num_arg()
3493 left = eval_num_arg(data, size, event, arg->op.left); eval_num_arg()
3495 if (left) eval_num_arg()
3496 val = eval_num_arg(data, size, event, arg->op.left); eval_num_arg()
3502 left = eval_num_arg(data, size, event, arg->op.left); eval_num_arg()
3511 val = left != 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()
3938 val = eval_num_arg(data, size, event, arg->op.left); print_str_arg()
3941 format, len_arg, arg->op.right->op.left); print_str_arg()
5504 print_args(args->op.left); print_args()
H A Dparse-filter.c208 free_arg(arg->num.left); free_arg()
213 free_arg(arg->exp.left); free_arg()
230 free_arg(arg->op.left); free_arg()
455 struct filter_arg *left; add_right() local
510 left = op->num.left; add_right()
517 * If left arg was a field not found then add_right()
520 if (left->type == FILTER_ARG_BOOLEAN) { add_right()
521 free_arg(left); add_right()
529 if (left->type != FILTER_ARG_FIELD) { add_right()
562 op->str.field = left->field.field; add_right()
579 /* We no longer have left or right args */ add_right()
581 free_arg(left); add_right()
633 op->exp.left = arg; add_left()
637 op->op.left = arg; add_left()
643 /* left arg of compares must be a field */ add_left()
647 op->num.left = arg; add_left()
779 other_child = old_child->op.left; reparent_op_arg()
780 } else if (old_child->op.left == arg) { reparent_op_arg()
781 ptr = &old_child->op.left; reparent_op_arg()
802 else if (parent->op.left == old_child) reparent_op_arg()
803 ptr = &parent->op.left; reparent_op_arg()
834 lval = test_arg(arg, arg->exp.left, error_str); test_arg()
843 lval = test_arg(arg, arg->num.left, error_str); test_arg()
853 lval = test_arg(arg, arg->op.left, error_str); test_arg()
894 return reparent_op_arg(parent, arg, arg->op.left, test_arg()
903 return reparent_op_arg(parent, arg, arg->op.left, test_arg()
1069 /* All expect a left arg except for NOT */ process_filter()
1072 /* Logic ops need a left expression */ process_filter()
1749 lval = get_arg_value(event, arg->exp.left, record, err); get_exp_value()
1828 lval = get_arg_value(event, arg->num.left, record, err); test_num()
1942 return test_filter(event, arg->op.left, record, err) && test_op()
1946 return test_filter(event, arg->op.left, record, err) || test_op()
2061 char *left = NULL; op_to_str() local
2076 left = arg_to_str(filter, arg->op.left); op_to_str()
2078 if (!left || !right) op_to_str()
2082 if (strcmp(left, "TRUE") == 0) op_to_str()
2084 else if (strcmp(left, "FALSE") == 0) op_to_str()
2095 /* Just return left value */ op_to_str()
2096 str = left; op_to_str()
2097 left = NULL; op_to_str()
2126 str = left; op_to_str()
2127 left = NULL; op_to_str()
2131 asprintf(&str, "(%s) %s (%s)", left, op, right); op_to_str()
2157 free(left); op_to_str()
2183 lstr = arg_to_str(filter, arg->exp.left); exp_to_str()
2239 lstr = arg_to_str(filter, arg->num.left); num_to_str()
/linux-4.1.27/drivers/input/mouse/
H A Dgpio_mouse.c39 - (gpio_get_value(gpio->left) ^ gpio->polarity); gpio_mouse_scan()
82 dev_dbg(&pdev->dev, "no left button defined\n"); gpio_mouse_probe()
132 pdata->bleft < 0 ? "" : "left ", gpio_mouse_probe()
H A Dvsxxxaa.c212 int left, middle, right; vsxxxaa_handle_REL_packet() local
242 left = buf[0] & 0x04; vsxxxaa_handle_REL_packet()
250 left ? "L" : "l", middle ? "M" : "m", right ? "R" : "r"); vsxxxaa_handle_REL_packet()
255 input_report_key(dev, BTN_LEFT, left); vsxxxaa_handle_REL_packet()
268 int left, middle, right, touch; vsxxxaa_handle_ABS_packet() local
292 left = buf[0] & 0x02; vsxxxaa_handle_ABS_packet()
301 left ? "L" : "l", middle ? "M" : "m", vsxxxaa_handle_ABS_packet()
307 input_report_key(dev, BTN_LEFT, left); vsxxxaa_handle_ABS_packet()
320 int left, middle, right; vsxxxaa_handle_POR_packet() local
351 left = buf[0] & 0x04; vsxxxaa_handle_POR_packet()
360 input_report_key(dev, BTN_LEFT, left); vsxxxaa_handle_POR_packet()
/linux-4.1.27/arch/arm/kernel/
H A Dperf_event.c101 s64 left = local64_read(&hwc->period_left); armpmu_event_set_period() local
105 if (unlikely(left <= -period)) { armpmu_event_set_period()
106 left = period; armpmu_event_set_period()
107 local64_set(&hwc->period_left, left); armpmu_event_set_period()
112 if (unlikely(left <= 0)) { armpmu_event_set_period()
113 left += period; armpmu_event_set_period()
114 local64_set(&hwc->period_left, left); armpmu_event_set_period()
125 if (left > (armpmu->max_period >> 1)) armpmu_event_set_period()
126 left = armpmu->max_period >> 1; armpmu_event_set_period()
128 local64_set(&hwc->prev_count, (u64)-left); armpmu_event_set_period()
130 armpmu->write_counter(event, (u64)(-left) & 0xffffffff); armpmu_event_set_period()
198 * may have been left counting. If we don't do this step then we may armpmu_start()
/linux-4.1.27/tools/testing/selftests/net/
H A Dpsock_lib.h107 fprintf(stderr, "ERROR: send failed left=%d\n", num); pair_udp_send()
111 fprintf(stderr, "ERROR: recv failed left=%d\n", num); pair_udp_send()
115 fprintf(stderr, "ERROR: data failed left=%d\n", num); pair_udp_send()
/linux-4.1.27/drivers/net/wan/
H A Dx25_asy.h30 int xleft; /* bytes left in XMIT queue */
/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
310 left = edge8_tab[rs1 & 0x7].left; edge()
315 left = edge8_tab_l[rs1 & 0x7].left; edge()
321 left = edge16_tab[(rs1 >> 1) & 0x3].left; edge()
327 left = edge16_tab_l[(rs1 >> 1) & 0x3].left; edge()
333 left = edge32_tab[(rs1 >> 2) & 0x1].left; edge()
339 left = edge32_tab_l[(rs1 >> 2) & 0x1].left; edge()
345 rd_val = right & left; edge()
347 rd_val = left; edge()
/linux-4.1.27/drivers/gpu/drm/omapdrm/
H A Dtcm-sita.c256 * sweep directions. The scan origin (e.g. top-left corner) will always be
257 * the p0 member of the field. Therfore, for a scan from top-left p0.x <= p1.x
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
450 /* find num_slots consecutive free slots to the left */ scan_r2l_b2t_one_dim()
464 /* move to left of 2D areas, top left of 1D */ scan_r2l_b2t_one_dim()
478 /* move to the left */ scan_r2l_b2t_one_dim()
485 /* set top-left corner */ scan_r2l_b2t_one_dim()
511 /* prefer top-left corner */ scan_areas_and_find_fit()
594 * @param x0, y0, w, h top, left, width, height of candidate area
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/drivers/block/drbd/
H A Ddrbd_interval.c28 sector_t left = interval_end(node->rb.rb_left); compute_subtree_last() local
29 if (left > max) compute_subtree_last()
30 max = left; compute_subtree_last()
148 /* Overlap if any must be on left side */ drbd_find_overlap()
/linux-4.1.27/drivers/char/xilinx_hwicap/
H A Dxilinx_hwicap.c48 * is left in a desynched state, requiring that a synch sequence be
259 * The icap is left in Synched state.
442 ssize_t left = count; hwicap_write() local
451 left += drvdata->write_buffer_in_use; hwicap_write()
454 if (left < 4) { hwicap_write()
465 while (left > 3) { hwicap_write()
467 /* be as many as 3 bytes left (at the end). */ hwicap_write()
468 len = left; hwicap_write()
503 left -= drvdata->write_buffer_in_use; hwicap_write()
507 left -= len; hwicap_write()
509 if ((left > 0) && (left < 4)) { hwicap_write()
511 buf + written, left)) { hwicap_write()
512 drvdata->write_buffer_in_use = left; hwicap_write()
513 written += left; hwicap_write()
514 left = 0; hwicap_write()
/linux-4.1.27/fs/ufs/
H A Dsymlink.c4 * Only fast symlinks left here - the rest is done by generic code. AV, 1999
/linux-4.1.27/include/trace/events/
H A Dgfpflags.h3 * first and the left over flags will end up showing by themselves.
/linux-4.1.27/include/uapi/linux/tc_ematch/
H A Dtc_em_meta.h88 struct tcf_meta_val left; member in struct:tcf_meta_hdr
/linux-4.1.27/arch/mn10300/lib/
H A D__ashldi3.S1 /* MN10300 64-bit arithmetic left shift
/linux-4.1.27/arch/powerpc/include/uapi/asm/
H A Dipcbuf.h8 * and forth between kernel and user space. Pad space is left for:
H A Dsembuf.h16 * Pad space is left for:
/linux-4.1.27/arch/arm/xen/
H A Dmm.c52 size_t left = size; dma_cache_maint() local
58 size_t len = left; dma_cache_maint()
83 left -= len; dma_cache_maint()
84 } while (left); dma_cache_maint()
/linux-4.1.27/arch/frv/lib/
H A D__ashldi3.S1 /* __ashldi3.S: 64-bit arithmetic shift left
/linux-4.1.27/arch/arm/mach-bcm/
H A Dbcm_5301x.c26 * possibly left over from the CFE boot loader. bcm5301x_abort_handler()
/linux-4.1.27/fs/ext2/
H A Dsymlink.c4 * Only fast symlinks left here - the rest is done by generic code. AV, 1999
/linux-4.1.27/fs/ext3/
H A Dsymlink.c4 * Only fast symlinks left here - the rest is done by generic code. AV, 1999
/linux-4.1.27/net/ipv4/
H A Dtcp_vegas.h10 u32 beg_snd_una; /* left edge during last RTT */
/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). */
H A Dau88x0_a3d.c174 static void a3dsrc_SetHrtfOutput(a3dsrc_t * a, short left, short right) a3dsrc_SetHrtfOutput() argument
178 a3d_addrA(a->slice, a->source, A3D_A_HrtfOutL), left); a3dsrc_SetHrtfOutput()
235 static void a3dsrc_GetHrtfOutput(a3dsrc_t * a, short *left, short *right)
238 *left =
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)
362 *left =
367 static void a3dsrc_GetGainCurrent(a3dsrc_t * a, short *left, short *right)
373 *left =
715 static void vortex_a3d_coord2ild(a3d_LRGains_t ild, int left, int right) vortex_a3d_coord2ild() argument
/linux-4.1.27/drivers/staging/sm750fb/
H A Dddk750_chip.c321 /* Disable Overlay, if a former application left it on */ ddk750_initHw()
326 /* Disable video alpha, if a former application left it on */ ddk750_initHw()
331 /* Disable alpha plane, if a former application left it on */ ddk750_initHw()
337 /* Disable LCD hardware cursor, if a former application left it on */ ddk750_initHw()
342 /* Disable CRT hardware cursor, if a former application left it on */ ddk750_initHw()
347 /* Disable ZV Port 0, if a former application left it on */ ddk750_initHw()
352 /* Disable ZV Port 1, if a former application left it on */ ddk750_initHw()
357 /* Disable ZV Port Power, if a former application left it on */ ddk750_initHw()
359 /* Disable DMA Channel, if a former application left it on */ ddk750_initHw()
367 /* Disable DMA Channel, if a former application left it on */ ddk750_initHw()
372 /* Disable DMA Power, if a former application left it on */ ddk750_initHw()
/linux-4.1.27/drivers/media/rc/keymaps/
H A Drc-kworld-plus-tv-analog.c27 { 0x02, KEY_3 }, /* Two keys have the same code: 3 and left */
46 /* Couldn't map key left/key right since those
/linux-4.1.27/arch/microblaze/lib/
H A Ddivsi3.S39 add r5, r5, r5 /* left shift logical r5 */
43 /* left shift logical r5 get the '1' into the carry */
H A Dmodsi3.S39 add r5, r5, r5 /* left shift logical r5 */
43 /* left shift logical r5 get the '1' into the carry */
H A Dudivsi3.S53 add r5, r5, r5 /* left shift logical r5 */
57 /* left shift logical r5 get the '1' into the carry */
H A Dumodsi3.S55 add r5, r5, r5 /* left shift logical r5 */
59 /* left shift logical r5 get the '1' into the carry */
/linux-4.1.27/include/linux/platform_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
/linux-4.1.27/arch/mn10300/unit-asb2305/
H A Dleds.c30 ~0x20202020, /* left bottom - segE */
31 ~0x40404040, /* left top - segF */
/linux-4.1.27/arch/mn10300/unit-asb2364/
H A Dleds.c33 ~0x20202020, /* left bottom - segE */
34 ~0x40404040, /* left top - segF */
/linux-4.1.27/drivers/media/pci/ngene/
H A Dngene-dvb.c73 int left, avail; ts_read() local
75 left = count; ts_read()
76 while (left) { ts_read()
82 if (avail > left) ts_read()
83 avail = left; ts_read()
85 left -= avail; ts_read()
/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()
419 chip->capture_source[0] != left || snd_saa7134_capsrc_set()
422 chip->capture_source[0] = left; snd_saa7134_capsrc_set()
477 if (left || right) { snd_saa7134_capsrc_set()
956 int left, right; snd_saa7134_volume_put() local
958 left = ucontrol->value.integer.value[0]; snd_saa7134_volume_put()
959 if (left < 0) snd_saa7134_volume_put()
960 left = 0; snd_saa7134_volume_put()
961 if (left > 20) snd_saa7134_volume_put()
962 left = 20; snd_saa7134_volume_put()
970 if (chip->mixer_volume[addr][0] != left) { snd_saa7134_volume_put()
972 right = left; snd_saa7134_volume_put()
976 left = right; snd_saa7134_volume_put()
983 left = 20; snd_saa7134_volume_put()
987 (left > 10) ? 0x00 : 0x10); snd_saa7134_volume_put()
991 (left > 10) ? 0x00 : 0x20); snd_saa7134_volume_put()
999 left = 20; snd_saa7134_volume_put()
1003 (left > 10) ? 0x00 : 0x10); snd_saa7134_volume_put()
1007 (left > 10) ? 0x00 : 0x20); snd_saa7134_volume_put()
1012 chip->mixer_volume[addr][0] = left; snd_saa7134_volume_put()
1057 int left, right; snd_saa7134_capsrc_put() local
1058 left = ucontrol->value.integer.value[0] & 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/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
192 * shifted to left neighbor
237 /* first item may be merge with last item in left neighbor */ check_left()
367 * from - number of items, which are shifted to left neighbor entirely
370 * which are shifted to left neighbor
615 * lbytes number of bytes which flow to the left neighbor from the
651 * check if node disappears if we shift tb->lnum[0] items to left
662 * number of items that will be shifted to left (right) neighbor is_leaf_removable()
729 * somewhere at the left side should exist first are_leaves_removable()
741 * we might check that left neighbor exists are_leaves_removable()
914 * Get free space of the left neighbor, which is stored in the parent
915 * node of the left neighbor.
960 /* Check whether left neighbor is in memory. */ is_left_neighbor_in_cache()
963 struct buffer_head *father, *left; is_left_neighbor_in_cache() local
968 /* Father of the left neighbor does not exist. */ is_left_neighbor_in_cache()
984 * Get position of the pointer to the left neighbor is_left_neighbor_in_cache()
985 * into the left father. is_left_neighbor_in_cache()
989 /* Get left neighbor block number. */ is_left_neighbor_in_cache()
992 /* Look for the left neighbor in the cache. */ is_left_neighbor_in_cache()
993 if ((left = sb_find_get_block(sb, left_neighbor_blocknr))) { is_left_neighbor_in_cache()
995 RFALSE(buffer_uptodate(left) && !B_IS_IN_TREE(left), is_left_neighbor_in_cache()
996 "vs-8170: left neighbor (%b %z) is not in the tree", is_left_neighbor_in_cache()
997 left, left); is_left_neighbor_in_cache()
998 put_bh(left); is_left_neighbor_in_cache()
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:
1212 * left neighbor of the current node. Calculate current get_parents()
1342 * we shift to the left, rnver is the number if we shift to the ip_check_balance()
1365 * 2 - shift only whole item to left ip_check_balance()
1366 * 3 - shift to left and bottle as much as possible ip_check_balance()
1417 * determine maximal number of items we can shift to the left ip_check_balance()
1419 * that can flow to the left neighbor from the left 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()
1546 * most liquid item to be shifted are shifted to the left ip_check_balance()
1570 * r_shift_num first items and r_shift_bytes of the left most ip_check_balance()
1672 * direction either to the left or to the right is required ip_check_balance()
1676 * if shifting to the left is better than ip_check_balance()
1686 * shifting to the left ip_check_balance()
1849 /* Check whether we can merge S[h] with left 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()
1989 /* check whether we can merge S with left neighbor. */ dc_check_balance_leaf()
1997 /* set parameter to merge S[0] with its left neighbor */ dc_check_balance_leaf()
2167 /* We need left neighbor to balance S[h]. */ get_neighbors()
2200 "PAP-8290: invalid child size of left neighbor"); get_neighbors()
/linux-4.1.27/lib/zlib_inflate/
H A Dinftrees.c32 int left; /* number of prefix codes available */ zlib_inflate_table() local
117 left = 1; zlib_inflate_table()
119 left <<= 1; zlib_inflate_table()
120 left -= count[len]; zlib_inflate_table()
121 if (left < 0) return -1; /* over-subscribed */ zlib_inflate_table()
123 if (left > 0 && (type == CODES || max != 1)) zlib_inflate_table()
256 left = (int)(1 << curr); zlib_inflate_table()
258 left -= count[curr + drop]; zlib_inflate_table()
259 if (left <= 0) break; zlib_inflate_table()
261 left <<= 1; zlib_inflate_table()
H A Dinflate.c169 left = strm->avail_out; \
180 strm->avail_out = left; \
263 input left to load n bits into the accumulator, or it continues. BITS(n)
276 state information is maintained to continue the loop where it left off
322 unsigned have, left; /* available input and output */ zlib_inflate() local
347 out = left; zlib_inflate()
435 if (copy > left) copy = left; zlib_inflate()
440 left -= copy; zlib_inflate()
558 if (have >= 6 && left >= 258) { zlib_inflate()
641 if (state->offset > state->whave + out - left) { zlib_inflate()
648 if (left == 0) goto inf_leave; zlib_inflate()
649 copy = out - left; zlib_inflate()
664 if (copy > left) copy = left; zlib_inflate()
665 left -= copy; zlib_inflate()
673 if (left == 0) goto inf_leave; zlib_inflate()
675 left--; zlib_inflate()
681 out -= left; zlib_inflate()
687 out = left; zlib_inflate()
/linux-4.1.27/drivers/media/i2c/soc_camera/
H A Dmt9t031.c214 * Could just do roundup(rect->left, [xy]bin * 2); but this is cheaper. mt9t031_set_params()
219 * MT9T031 datasheet imposes window left border alignment, depending on mt9t031_set_params()
228 rect->left &= ~1; mt9t031_set_params()
231 rect->left &= ~3; mt9t031_set_params()
234 rect->left = rect->left > roundup(MT9T031_COLUMN_SKIP, 6) ? mt9t031_set_params()
235 (rect->left / 6) * 6 : roundup(MT9T031_COLUMN_SKIP, 6); mt9t031_set_params()
241 xskip, yskip, rect->width, rect->height, rect->left, rect->top); mt9t031_set_params()
262 dev_dbg(&client->dev, "new physical left %u, top %u\n", mt9t031_set_params()
263 rect->left, rect->top); mt9t031_set_params()
270 ret = reg_write(client, MT9T031_COLUMN_START, rect->left); mt9t031_set_params()
306 soc_camera_limit_side(&rect.left, &rect.width, mt9t031_s_crop()
328 a->bounds.left = MT9T031_COLUMN_SKIP; mt9t031_cropcap()
786 mt9t031->rect.left = MT9T031_COLUMN_SKIP; mt9t031_probe()
/linux-4.1.27/arch/x86/kernel/cpu/
H A Dperf_event_amd_ibs.c75 s64 left = local64_read(&hwc->period_left); perf_event_set_period() local
82 if (unlikely(left <= -period)) { perf_event_set_period()
83 left = period; perf_event_set_period()
84 local64_set(&hwc->period_left, left); perf_event_set_period()
89 if (unlikely(left < (s64)min)) { perf_event_set_period()
90 left += period; perf_event_set_period()
91 local64_set(&hwc->period_left, left); perf_event_set_period()
102 if (left > max) { perf_event_set_period()
103 left -= max; perf_event_set_period()
104 if (left > max) perf_event_set_period()
105 left = max; perf_event_set_period()
106 else if (left < min) perf_event_set_period()
107 left = min; perf_event_set_period()
110 *hw_period = (u64)left; perf_event_set_period()
/linux-4.1.27/sound/isa/sb/
H A Dsb_mixer.c132 unsigned char left, right; snd_sbmixer_get_double() local
135 left = (snd_sbmixer_read(sb, left_reg) >> left_shift) & mask; snd_sbmixer_get_double()
138 ucontrol->value.integer.value[0] = left; snd_sbmixer_get_double()
153 unsigned char left, right, oleft, oright; snd_sbmixer_put_double() local
155 left = (ucontrol->value.integer.value[0] & mask) << left_shift; snd_sbmixer_put_double()
160 left = (oleft & ~((mask << left_shift) | (mask << right_shift))) | left | right; snd_sbmixer_put_double()
161 change = left != oleft; snd_sbmixer_put_double()
163 snd_sbmixer_write(sb, left_reg, left); snd_sbmixer_put_double()
167 left = (oleft & ~(mask << left_shift)) | left; snd_sbmixer_put_double()
169 change = left != oleft || right != oright; snd_sbmixer_put_double()
171 snd_sbmixer_write(sb, left_reg, left); snd_sbmixer_put_double()
216 /* duplicate case labels if left uncommented. */ snd_dt019x_input_sw_get()
/linux-4.1.27/sound/usb/
H A Dstream.c236 SNDRV_CHMAP_FL, /* left front */ convert_chmap()
240 SNDRV_CHMAP_SL, /* left surround */ convert_chmap()
242 SNDRV_CHMAP_FLC, /* left of center */ convert_chmap()
245 SNDRV_CHMAP_SL, /* side left */ convert_chmap()
251 SNDRV_CHMAP_FL, /* front left */ convert_chmap()
255 SNDRV_CHMAP_RL, /* back left */ convert_chmap()
257 SNDRV_CHMAP_FLC, /* front left of center */ convert_chmap()
260 SNDRV_CHMAP_SL, /* side left */ convert_chmap()
263 SNDRV_CHMAP_TFL, /* top front left */ convert_chmap()
266 SNDRV_CHMAP_TRL, /* top back left */ convert_chmap()
269 SNDRV_CHMAP_TFLC, /* top front left of center */ convert_chmap()
271 SNDRV_CHMAP_LLFE, /* left LFE */ convert_chmap()
273 SNDRV_CHMAP_TSL, /* top side left */ convert_chmap()
276 SNDRV_CHMAP_RLC, /* back left of center */ convert_chmap()
/linux-4.1.27/drivers/gpu/ipu-v3/
H A Dipu-cpmem.c609 offset = Y_OFFSET(pix, image->rect.left, image->rect.top); ipu_cpmem_set_image()
610 u_offset = U_OFFSET(pix, image->rect.left, ipu_cpmem_set_image()
612 v_offset = V_OFFSET(pix, image->rect.left, ipu_cpmem_set_image()
620 offset = Y_OFFSET(pix, image->rect.left, image->rect.top); ipu_cpmem_set_image()
621 u_offset = U2_OFFSET(pix, image->rect.left, ipu_cpmem_set_image()
623 v_offset = V2_OFFSET(pix, image->rect.left, ipu_cpmem_set_image()
631 offset = Y_OFFSET(pix, image->rect.left, image->rect.top); ipu_cpmem_set_image()
632 u_offset = UV_OFFSET(pix, image->rect.left, ipu_cpmem_set_image()
641 offset = Y_OFFSET(pix, image->rect.left, image->rect.top); ipu_cpmem_set_image()
642 u_offset = UV2_OFFSET(pix, image->rect.left, ipu_cpmem_set_image()
653 offset = image->rect.left * 2 + ipu_cpmem_set_image()
658 offset = image->rect.left * 4 + ipu_cpmem_set_image()
663 offset = image->rect.left * 3 + ipu_cpmem_set_image()
/linux-4.1.27/drivers/video/fbdev/msm/
H A Dmsm_fb.c73 int left; member in struct:msmfb_info::__anon10574
145 x = msmfb->update_info.left; msmfb_start_dma()
150 msmfb->update_info.left = msmfb->xres + 1; msmfb_start_dma()
193 static void msmfb_pan_update(struct fb_info *info, uint32_t left, uint32_t top, msmfb_pan_update() argument
204 left, top, eright, ebottom, yoffset, pan_display); msmfb_pan_update()
254 if (left == 0 && top == 0 && eright == info->var.xres && msmfb_pan_update()
265 if (left < msmfb->update_info.left) msmfb_pan_update()
266 msmfb->update_info.left = left; msmfb_pan_update()
274 msmfb->update_info.left, msmfb->update_info.top, msmfb_pan_update()
293 static void msmfb_update(struct fb_info *info, uint32_t left, uint32_t top, msmfb_update() argument
296 msmfb_pan_update(info, left, top, eright, ebottom, 0, 0); msmfb_update()
/linux-4.1.27/fs/nfs/blocklayout/
H A Dextent_tree.c96 struct pnfs_block_extent *left = ext_tree_prev(be); ext_try_to_merge_left() local
98 if (left && ext_can_merge(left, be)) { ext_try_to_merge_left()
99 left->be_length += be->be_length; ext_try_to_merge_left()
103 return left; ext_try_to_merge_left()
419 struct pnfs_block_extent *left = ext_tree_prev(be); ext_tree_mark_written() local
421 if (left && ext_can_merge(left, be)) { ext_tree_mark_written()
424 left->be_length += diff; ext_tree_mark_written()
/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()
171 left = max(0, left - balance); fmr2_s_ctrl()
173 tc9154a_set_attenuation(fmr2, abs(left - 68), TC9154A_CHANNEL_LEFT); fmr2_s_ctrl()

Completed in 7210 milliseconds

1234567891011>>