Home
last modified time | relevance | path

Searched refs:left (Results 1 - 25 of 1312) sorted by relevance

12345678910>>...53

/kernel/linux/linux-5.10/include/kunit/
H A Dtest.h740 left, \
746 typeof(left) __left = (left); \
756 #left, \
768 left, \
776 left, ==, right, \
784 left, \
792 left, !=, right, \
800 left, \
808 left, <, righ
[all...]
/kernel/linux/linux-6.6/include/kunit/
H A Dtest.h680 left, \
686 const typeof(left) __left = (left); \
690 .left_text = #left, \
710 left, \
719 left, op, right, \
725 left, \
734 left, op, right, \
740 left, \
746 const char *__left = (left); \
[all...]
/kernel/linux/linux-5.10/include/media/
H A Dv4l2-rect.h62 if (r->left < boundary->left) in v4l2_rect_map_inside()
63 r->left = boundary->left; in v4l2_rect_map_inside()
66 if (r->left + r->width > boundary->left + boundary->width) in v4l2_rect_map_inside()
67 r->left = boundary->left + boundary->width - r->width; in v4l2_rect_map_inside()
95 return r1->top == r2->top && r1->left == r2->left; in v4l2_rect_same_position()
[all...]
/kernel/linux/linux-6.6/include/media/
H A Dv4l2-rect.h62 if (r->left < boundary->left) in v4l2_rect_map_inside()
63 r->left = boundary->left; in v4l2_rect_map_inside()
66 if (r->left + r->width > boundary->left + boundary->width) in v4l2_rect_map_inside()
67 r->left = boundary->left + boundary->width - r->width; in v4l2_rect_map_inside()
95 return r1->top == r2->top && r1->left == r2->left; in v4l2_rect_same_position()
[all...]
/kernel/linux/linux-5.10/arch/parisc/math-emu/
H A Dsfsub.c42 register unsigned int left, right, result, extent; in sgl_fsub() local
50 left = *leftptr; in sgl_fsub()
55 Sgl_xortointp1(left,right,/*to*/save); in sgl_fsub()
60 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) in sgl_fsub()
62 if (Sgl_iszero_mantissa(left)) in sgl_fsub()
80 *dstptr = left; in sgl_fsub()
89 if (Sgl_isone_signaling(left)) in sgl_fsub()
95 Sgl_set_quiet(left); in sgl_fsub()
113 *dstptr = left; in sgl_fsub()
116 } /* End left Na in sgl_fsub()
[all...]
H A Dsfcmp.c42 register unsigned int left, right; in sgl_fcmp() local
46 left = *leftptr; in sgl_fcmp()
52 if( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
58 if( ( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
59 && Sgl_isnotzero_mantissa(left) in sgl_fcmp()
60 && (Exception(cond) || Sgl_isone_signaling(left))) in sgl_fcmp()
76 else if( ((Sgl_exponent(left) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
77 && Sgl_isnotzero_mantissa(left)) in sgl_fcmp()
90 Sgl_xortointp1(left,right,xorresult); in sgl_fcmp()
93 /* left negativ in sgl_fcmp()
[all...]
H A Dsfadd.c42 register unsigned int left, right, result, extent; in sgl_fadd() local
52 left = *leftptr; in sgl_fadd()
57 Sgl_xortointp1(left,right,/*to*/save); in sgl_fadd()
62 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) in sgl_fadd()
64 if (Sgl_iszero_mantissa(left)) in sgl_fadd()
82 *dstptr = left; in sgl_fadd()
91 if (Sgl_isone_signaling(left)) in sgl_fadd()
97 Sgl_set_quiet(left); in sgl_fadd()
115 *dstptr = left; in sgl_fadd()
118 } /* End left Na in sgl_fadd()
[all...]
/kernel/linux/linux-6.6/arch/parisc/math-emu/
H A Dsfsub.c42 register unsigned int left, right, result, extent; in sgl_fsub() local
50 left = *leftptr; in sgl_fsub()
55 Sgl_xortointp1(left,right,/*to*/save); in sgl_fsub()
60 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) in sgl_fsub()
62 if (Sgl_iszero_mantissa(left)) in sgl_fsub()
80 *dstptr = left; in sgl_fsub()
89 if (Sgl_isone_signaling(left)) in sgl_fsub()
95 Sgl_set_quiet(left); in sgl_fsub()
113 *dstptr = left; in sgl_fsub()
116 } /* End left Na in sgl_fsub()
[all...]
H A Dsfcmp.c42 register unsigned int left, right; in sgl_fcmp() local
46 left = *leftptr; in sgl_fcmp()
52 if( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
58 if( ( (Sgl_exponent(left) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
59 && Sgl_isnotzero_mantissa(left) in sgl_fcmp()
60 && (Exception(cond) || Sgl_isone_signaling(left))) in sgl_fcmp()
76 else if( ((Sgl_exponent(left) == SGL_INFINITY_EXPONENT) in sgl_fcmp()
77 && Sgl_isnotzero_mantissa(left)) in sgl_fcmp()
90 Sgl_xortointp1(left,right,xorresult); in sgl_fcmp()
93 /* left negativ in sgl_fcmp()
[all...]
H A Dsfadd.c42 register unsigned int left, right, result, extent; in sgl_fadd() local
52 left = *leftptr; in sgl_fadd()
57 Sgl_xortointp1(left,right,/*to*/save); in sgl_fadd()
62 if ((result_exponent = Sgl_exponent(left)) == SGL_INFINITY_EXPONENT) in sgl_fadd()
64 if (Sgl_iszero_mantissa(left)) in sgl_fadd()
82 *dstptr = left; in sgl_fadd()
91 if (Sgl_isone_signaling(left)) in sgl_fadd()
97 Sgl_set_quiet(left); in sgl_fadd()
115 *dstptr = left; in sgl_fadd()
118 } /* End left Na in sgl_fadd()
[all...]
/kernel/linux/linux-5.10/scripts/kconfig/
H A Dexpr.c22 e->left.sym = sym; in expr_alloc_symbol()
30 e->left.expr = ce; in expr_alloc_one()
38 e->left.expr = e1; in expr_alloc_two()
47 e->left.sym = s1; in expr_alloc_comp()
77 e->left = org->left; in expr_copy()
80 e->left.expr = expr_copy(org->left.expr); in expr_copy()
88 e->left.sym = org->left in expr_copy()
[all...]
/kernel/linux/linux-6.6/scripts/kconfig/
H A Dexpr.c22 e->left.sym = sym; in expr_alloc_symbol()
30 e->left.expr = ce; in expr_alloc_one()
38 e->left.expr = e1; in expr_alloc_two()
47 e->left.sym = s1; in expr_alloc_comp()
77 e->left = org->left; in expr_copy()
80 e->left.expr = expr_copy(org->left.expr); in expr_copy()
88 e->left.sym = org->left in expr_copy()
[all...]
/kernel/linux/linux-5.10/net/sunrpc/
H A Dsysctl.c90 size_t left, len; in proc_dodebug() local
97 left = *lenp; in proc_dodebug()
101 while (left && isspace(*p)) { in proc_dodebug()
102 left--; in proc_dodebug()
105 if (!left) in proc_dodebug()
108 if (left > sizeof(tmpbuf) - 1) in proc_dodebug()
110 memcpy(tmpbuf, p, left); in proc_dodebug()
111 tmpbuf[left] = '\0'; in proc_dodebug()
115 left -= (s - tmpbuf); in proc_dodebug()
116 if (left in proc_dodebug()
[all...]
/kernel/linux/linux-6.6/net/sunrpc/
H A Dsysctl.c71 size_t left, len; in proc_dodebug() local
78 left = *lenp; in proc_dodebug()
82 while (left && isspace(*p)) { in proc_dodebug()
83 left--; in proc_dodebug()
86 if (!left) in proc_dodebug()
89 if (left > sizeof(tmpbuf) - 1) in proc_dodebug()
91 memcpy(tmpbuf, p, left); in proc_dodebug()
92 tmpbuf[left] = '\0'; in proc_dodebug()
96 left -= (s - tmpbuf); in proc_dodebug()
97 if (left in proc_dodebug()
[all...]
/kernel/liteos_a/kernel/base/ipc/
H A Dlos_ipcdebug.c40 UINT32 left = start; in OsArraySortByTime() local
45 while (left < right) { in OsArraySortByTime()
46 while ((left < right) && (sortArray[right] < sortParam->ipcDebugCBCnt) && (pivot < sortParam->ipcDebugCBCnt) && in OsArraySortByTime()
51 if (left < right) { in OsArraySortByTime()
52 sortArray[left] = sortArray[right]; in OsArraySortByTime()
54 left++; in OsArraySortByTime()
57 while ((left < right) && (sortArray[left] < sortParam->ipcDebugCBCnt) && (pivot < sortParam->ipcDebugCBCnt) && in OsArraySortByTime()
58 compareFunc(sortParam, pivot, sortArray[left])) { in OsArraySortByTime()
59 left in OsArraySortByTime()
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Duidgid.h69 static inline bool uid_eq(kuid_t left, kuid_t right) in uid_eq() argument
71 return __kuid_val(left) == __kuid_val(right); in uid_eq()
74 static inline bool gid_eq(kgid_t left, kgid_t right) in gid_eq() argument
76 return __kgid_val(left) == __kgid_val(right); in gid_eq()
79 static inline bool uid_gt(kuid_t left, kuid_t right) in uid_gt() argument
81 return __kuid_val(left) > __kuid_val(right); in uid_gt()
84 static inline bool gid_gt(kgid_t left, kgid_t right) in gid_gt() argument
86 return __kgid_val(left) > __kgid_val(right); in gid_gt()
89 static inline bool uid_gte(kuid_t left, kuid_t right) in uid_gte() argument
91 return __kuid_val(left) > in uid_gte()
94 gid_gte(kgid_t left, kgid_t right) gid_gte() argument
99 uid_lt(kuid_t left, kuid_t right) uid_lt() argument
104 gid_lt(kgid_t left, kgid_t right) gid_lt() argument
109 uid_lte(kuid_t left, kuid_t right) uid_lte() argument
114 gid_lte(kgid_t left, kgid_t right) gid_lte() argument
[all...]
H A Dregset.h22 size_t left; member
27 if (s->left) { in membuf_zero()
28 if (size > s->left) in membuf_zero()
29 size = s->left; in membuf_zero()
32 s->left -= size; in membuf_zero()
34 return s->left; in membuf_zero()
39 if (s->left) { in membuf_write()
40 if (size > s->left) in membuf_write()
41 size = s->left; in membuf_write()
44 s->left in membuf_write()
[all...]
/kernel/linux/linux-6.6/include/linux/
H A Duidgid.h69 static inline bool uid_eq(kuid_t left, kuid_t right) in uid_eq() argument
71 return __kuid_val(left) == __kuid_val(right); in uid_eq()
74 static inline bool gid_eq(kgid_t left, kgid_t right) in gid_eq() argument
76 return __kgid_val(left) == __kgid_val(right); in gid_eq()
79 static inline bool uid_gt(kuid_t left, kuid_t right) in uid_gt() argument
81 return __kuid_val(left) > __kuid_val(right); in uid_gt()
84 static inline bool gid_gt(kgid_t left, kgid_t right) in gid_gt() argument
86 return __kgid_val(left) > __kgid_val(right); in gid_gt()
89 static inline bool uid_gte(kuid_t left, kuid_t right) in uid_gte() argument
91 return __kuid_val(left) > in uid_gte()
94 gid_gte(kgid_t left, kgid_t right) gid_gte() argument
99 uid_lt(kuid_t left, kuid_t right) uid_lt() argument
104 gid_lt(kgid_t left, kgid_t right) gid_lt() argument
109 uid_lte(kuid_t left, kuid_t right) uid_lte() argument
114 gid_lte(kgid_t left, kgid_t right) gid_lte() argument
[all...]
H A Dregset.h22 size_t left; member
27 if (s->left) { in membuf_zero()
28 if (size > s->left) in membuf_zero()
29 size = s->left; in membuf_zero()
32 s->left -= size; in membuf_zero()
34 return s->left; in membuf_zero()
39 if (s->left) { in membuf_write()
40 if (size > s->left) in membuf_write()
41 size = s->left; in membuf_write()
44 s->left in membuf_write()
[all...]
/kernel/linux/linux-5.10/fs/quota/
H A Dkqid.c8 * @left: A qid value
13 bool qid_eq(struct kqid left, struct kqid right) in qid_eq() argument
15 if (left.type != right.type) in qid_eq()
17 switch(left.type) { in qid_eq()
19 return uid_eq(left.uid, right.uid); in qid_eq()
21 return gid_eq(left.gid, right.gid); in qid_eq()
23 return projid_eq(left.projid, right.projid); in qid_eq()
32 * @left: The possibly lesser qid value
35 * Return true if left is less than right and false otherwise.
37 bool qid_lt(struct kqid left, struc argument
[all...]
/kernel/linux/linux-6.6/fs/quota/
H A Dkqid.c8 * @left: A qid value
13 bool qid_eq(struct kqid left, struct kqid right) in qid_eq() argument
15 if (left.type != right.type) in qid_eq()
17 switch(left.type) { in qid_eq()
19 return uid_eq(left.uid, right.uid); in qid_eq()
21 return gid_eq(left.gid, right.gid); in qid_eq()
23 return projid_eq(left.projid, right.projid); in qid_eq()
32 * @left: The possibly lesser qid value
35 * Return true if left is less than right and false otherwise.
37 bool qid_lt(struct kqid left, struc argument
[all...]
/kernel/linux/linux-5.10/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) in node_copy() argument
84 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in node_copy()
85 uint32_t value_size = le32_to_cpu(left in node_copy()
173 shift(struct btree_node *left, struct btree_node *right, int count) shift() argument
202 struct btree_node *left = l->n; __rebalance2() local
242 struct child left, right; rebalance2() local
269 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
300 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
350 struct btree_node *left = l->n; __rebalance3() local
376 struct child left, center, right; rebalance3() local
[all...]
/kernel/linux/linux-5.10/drivers/media/pci/bt8xx/
H A Dbtcx-risc.c87 if (win->left < 0) { in btcx_screen_clips()
88 /* left */ in btcx_screen_clips()
89 clips[n].c.left = 0; in btcx_screen_clips()
91 clips[n].c.width = -win->left; in btcx_screen_clips()
95 if (win->left + win->width > swidth) { in btcx_screen_clips()
97 clips[n].c.left = swidth - win->left; in btcx_screen_clips()
99 clips[n].c.width = win->width - clips[n].c.left; in btcx_screen_clips()
105 clips[n].c.left = 0; in btcx_screen_clips()
113 clips[n].c.left in btcx_screen_clips()
[all...]
/kernel/linux/linux-5.10/drivers/video/fbdev/core/
H A Dsyscopyarea.c33 int left, right; in bitcpy() local
81 left = -shift & (bits - 1); in bitcpy()
89 *dst = comp(*src << left, *dst, first); in bitcpy()
97 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
112 *dst = comp(d0 << left, *dst, first); in bitcpy()
118 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
130 *dst++ = d0 >> right | d1 << left; in bitcpy()
133 *dst++ = d0 >> right | d1 << left; in bitcpy()
136 *dst++ = d0 >> right | d1 << left; in bitcpy()
139 *dst++ = d0 >> right | d1 << left; in bitcpy()
227 int const left = shift & (bits-1); bitcpy_rev() local
303 d0 <<= left; bitcpy_rev() local
[all...]
/kernel/linux/linux-6.6/drivers/video/fbdev/core/
H A Dsyscopyarea.c33 int left, right; in bitcpy() local
81 left = -shift & (bits - 1); in bitcpy()
89 *dst = comp(*src << left, *dst, first); in bitcpy()
97 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
112 *dst = comp(d0 << left, *dst, first); in bitcpy()
118 *dst = comp(d0 >> right | d1 << left, *dst, in bitcpy()
130 *dst++ = d0 >> right | d1 << left; in bitcpy()
133 *dst++ = d0 >> right | d1 << left; in bitcpy()
136 *dst++ = d0 >> right | d1 << left; in bitcpy()
139 *dst++ = d0 >> right | d1 << left; in bitcpy()
227 int const left = shift & (bits-1); bitcpy_rev() local
303 d0 <<= left; bitcpy_rev() local
[all...]

Completed in 10 milliseconds

12345678910>>...53