Home
last modified time | relevance | path

Searched refs:cmp (Results 1 – 25 of 596) sorted by relevance

12345678910>>...24

/linux-6.15/drivers/clk/sunxi-ng/
H A Dccu_mp.c123 max_m = cmp->m.max ?: 1 << cmp->m.width; in ccu_mp_round_rate()
127 max_p = cmp->p.max ?: 1 << cmp->p.width; in ccu_mp_round_rate()
176 reg = readl(cmp->common.base + cmp->common.reg); in ccu_mp_recalc_rate()
224 max_m = cmp->m.max ?: 1 << cmp->m.width; in ccu_mp_set_rate()
228 max_p = cmp->p.max ?: 1 << cmp->p.width; in ccu_mp_set_rate()
238 reg = readl(cmp->common.base + cmp->common.reg); in ccu_mp_set_rate()
239 reg &= ~GENMASK(cmp->m.width + cmp->m.shift - 1, cmp->m.shift); in ccu_mp_set_rate()
240 reg &= ~GENMASK(cmp->p.width + cmp->p.shift - 1, cmp->p.shift); in ccu_mp_set_rate()
241 reg |= (m - cmp->m.offset) << cmp->m.shift; in ccu_mp_set_rate()
245 reg |= (p - cmp->p.offset) << cmp->p.shift; in ccu_mp_set_rate()
[all …]
/linux-6.15/net/sched/
H A Dem_cmp.c25 unsigned char *ptr = tcf_get_base_ptr(skb, cmp->layer) + cmp->off; in em_cmp_match()
28 if (!tcf_valid_offset(skb, ptr, cmp->align)) in em_cmp_match()
31 switch (cmp->align) { in em_cmp_match()
39 if (cmp_needs_transformation(cmp)) in em_cmp_match()
49 if (cmp_needs_transformation(cmp)) in em_cmp_match()
57 if (cmp->mask) in em_cmp_match()
58 val &= cmp->mask; in em_cmp_match()
60 switch (cmp->opnd) { in em_cmp_match()
62 return val == cmp->val; in em_cmp_match()
64 return val < cmp->val; in em_cmp_match()
[all …]
/linux-6.15/arch/sparc/lib/
H A Dstrncmp_32.S15 cmp %o2, 3
27 cmp %o0, 0
31 cmp %o0, %g2
43 cmp %o0, 0
47 cmp %o0, %g2
59 cmp %o0, 0
63 cmp %o0, %g2
75 cmp %o0, 0
88 cmp %o4, 0
100 cmp %o0, 0
[all …]
H A Dmemscan_32.S23 cmp %o1, 0
36 cmp %g3, 0
84 cmp %g2, 0
93 cmp %g2, 0
101 cmp %g2, 0
109 cmp %g2, 0
123 cmp %o2, 0
131 cmp %g2, %o1
/linux-6.15/scripts/coccinelle/misc/
H A Dminmax.cocci23 binary operator cmp = {>, >=};
30 * ((x) cmp@p (y) ? (x) : (y))
38 binary operator cmp = {>, >=};
45 * if ((x) cmp@p (y)) {
58 binary operator cmp = {<, <=};
71 binary operator cmp = {<, <=};
78 * ((x) cmp@p (y) ? (x) : (y))
93 * if ((x) cmp@p (y)) {
110 - ((x) cmp (y) ? (x) : (y))
125 - if ((x) cmp (y)) {
[all …]
/linux-6.15/arch/arm/lib/
H A Dlib1funcs.S120 cmp \divisor, #(1 << 8)
124 cmp \divisor, #(1 << 4)
128 cmp \divisor, #(1 << 2)
183 cmp \dividend, #1
219 cmp r0, r1
268 cmp r1, #0
276 cmp r3, r1
283 cmp ip, #0
298 cmp ip, #0
310 cmp r1, #0
[all …]
/linux-6.15/arch/hexagon/lib/
H A Dmemset.S29 p0 = cmp.eq(r2, #0)
30 p1 = cmp.gtu(r2, #7)
59 p1 = cmp.eq(r2, #1)
72 p1 = cmp.eq(r2, #2)
84 p0 = cmp.gtu(r2, #7)
85 p1 = cmp.eq(r2, #4)
98 p1 = cmp.eq(r3, #1)
114 p1 = cmp.eq(r2, #8)
125 p1 = cmp.eq(r2, #4)
136 p1 = cmp.eq(r2, #2)
[all …]
H A Dmemcpy.S255 p3 = cmp.gtu(back, #8);
261 p1 = cmp.eq(prolog, #0);
310 p2 = cmp.gtu(offset, #7);
322 p0 = cmp.gt(over, #0);
329 p0 = cmp.gt(rest, #16);
339 p3 = cmp.gtu(kernel, #0);
349 p3 = cmp.gtu(dalign, #24);
367 p3 = cmp.eq(kernel, rest);
443 p3 = cmp.eq(epilogdws, #0);
455 p3 = cmp.eq(kernel, #0);
[all …]
H A Ddivsi3.S10 p0 = cmp.gt(r0,#-1)
11 p1 = cmp.gt(r1,#-1)
18 p0 = cmp.gtu(r3,r2)
23 p1 = cmp.gtu(r3,r4)
35 p0 = cmp.gtu(r6,#4)
52 p0 = cmp.gtu(r4,r2)
58 p0 = cmp.gtu(r6,r2)
/linux-6.15/arch/sparc/net/
H A Dbpf_jit_asm_32.S16 cmp r_OFF, 0
22 cmp r_TMP, 3
45 cmp r_OFF, 0
51 cmp r_TMP, 1
68 cmp r_OFF, 0
81 cmp r_OFF, 0
101 cmp %o0, 0; \
144 cmp r_OFF, r_TMP
158 cmp r_OFF, r_TMP
172 cmp r_OFF, r_TMP
[all …]
/linux-6.15/include/linux/
H A Drbtree.h233 c = cmp(node, parent); in rb_find_add_cached()
269 c = cmp(node, parent); in rb_find_add()
297 int (*cmp)(struct rb_node *, const struct rb_node *)) in rb_find_add_rcu()
305 c = cmp(node, parent); in rb_find_add_rcu()
330 int (*cmp)(const void *key, const struct rb_node *)) in rb_find()
335 int c = cmp(key, node); in rb_find()
366 int c = cmp(key, node); in rb_find_rcu()
395 int c = cmp(key, node); in rb_find_first()
422 if (node && cmp(key, node)) in rb_next_match()
434 #define rb_for_each(node, key, tree, cmp) \ argument
[all …]
/linux-6.15/security/selinux/ss/
H A Dhashtab.h23 int (*cmp)(const void *key1, const void *key2); /* comparison func */ member
77 int cmp = key_params.cmp(key, cur->key); in hashtab_insert() local
79 if (cmp == 0) in hashtab_insert()
81 if (cmp < 0) in hashtab_insert()
109 int cmp = key_params.cmp(key, cur->key); in hashtab_search() local
111 if (cmp == 0) in hashtab_search()
113 if (cmp < 0) in hashtab_search()
/linux-6.15/arch/arm/mach-tegra/
H A Dreset-handler.S46 cmp r6, #TEGRA20
62 cmp r8, r9
79 cmp r8, r9
99 cmp r1, #0
148 cmp r5, #0
197 cmp r10, #0
200 cmp lr, #0
211 cmp lr, #0
224 cmp r10, #0
228 cmp lr, #0
[all …]
/linux-6.15/arch/powerpc/math-emu/
H A Dfcmpu.c17 long cmp; in fcmpu() local
31 FP_CMP_D(cmp, A, B, 2); in fcmpu()
32 cmp = code[(cmp + 1) & 3]; in fcmpu()
35 __FPU_FPSCR |= (cmp << 12); in fcmpu()
38 *ccr |= (cmp << ((7 - crfD) << 2)); in fcmpu()
H A Dfcmpo.c17 long cmp; in fcmpo() local
34 FP_CMP_D(cmp, A, B, 2); in fcmpo()
35 cmp = code[(cmp + 1) & 3]; in fcmpo()
38 __FPU_FPSCR |= (cmp << 12); in fcmpo()
41 *ccr |= (cmp << ((7 - crfD) << 2)); in fcmpo()
/linux-6.15/lib/
H A Dlist_sort.c13 static struct list_head *merge(void *priv, list_cmp_func_t cmp, in merge() argument
20 if (cmp(priv, a, b) <= 0) { in merge()
49 static void merge_final(void *priv, list_cmp_func_t cmp, struct list_head *head, in merge_final() argument
57 if (cmp(priv, a, b) <= 0) { in merge_final()
87 cmp(priv, b, b); in merge_final()
189 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp) in list_sort() argument
229 a = merge(priv, cmp, b, a); in list_sort()
251 list = merge(priv, cmp, pending, list); in list_sort()
255 merge_final(priv, cmp, head, pending, list); in list_sort()
/linux-6.15/arch/arm/include/debug/
H A Dtegra.S74 cmp \rp, #1 @ needs initialization?
87 cmp \rv, #3 @ so accept either
91 cmp \rv, #0 @ UART 0?
93 cmp \rv, #1 @ UART 1?
95 cmp \rv, #2 @ UART 2?
97 cmp \rv, #3 @ UART 3?
99 cmp \rv, #4 @ UART 4?
141 cmp \rp, #0 @ Valid UART address?
193 cmp \rx, #0
199 cmp \rx, #0
[all …]
/linux-6.15/arch/arm/mach-at91/
H A Dpm_suspend.S36 cmp \r_mckid, #0
44 cmp r8, r7
103 cmp r8, #1
379 cmp r2, #0
458 cmp r2, #0
837 cmp tmp1, #1
843 cmp tmp1, #2
849 cmp tmp1, #3
855 cmp tmp1, #4
861 cmp tmp1, #5
[all …]
/linux-6.15/tools/lib/
H A Dlist_sort.c13 static struct list_head *merge(void *priv, list_cmp_func_t cmp, in merge() argument
20 if (cmp(priv, a, b) <= 0) { in merge()
49 static void merge_final(void *priv, list_cmp_func_t cmp, struct list_head *head, in merge_final() argument
56 if (cmp(priv, a, b) <= 0) { in merge_final()
172 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp) in list_sort() argument
212 a = merge(priv, cmp, b, a); in list_sort()
234 list = merge(priv, cmp, pending, list); in list_sort()
238 merge_final(priv, cmp, head, pending, list); in list_sort()
/linux-6.15/arch/arm64/lib/
H A Dmemcmp.S41 cmp data1, data2
54 cmp data1, data2
64 cmp limit, 96
85 cmp data1, data2
89 cmp data1, data2
98 cmp data1, data2
102 cmp data1, data2
110 cmp data1, data2
123 cmp data1w, data2w
/linux-6.15/arch/mips/math-emu/
H A Dsp_cmp.c12 int ieee754sp_cmp(union ieee754sp x, union ieee754sp y, int cmp, int sig) in ieee754sp_cmp() argument
30 return (cmp & IEEE754_CUN) != 0; in ieee754sp_cmp()
41 return (cmp & IEEE754_CLT) != 0; in ieee754sp_cmp()
43 return (cmp & IEEE754_CEQ) != 0; in ieee754sp_cmp()
45 return (cmp & IEEE754_CGT) != 0; in ieee754sp_cmp()
H A Ddp_cmp.c12 int ieee754dp_cmp(union ieee754dp x, union ieee754dp y, int cmp, int sig) in ieee754dp_cmp() argument
30 return (cmp & IEEE754_CUN) != 0; in ieee754dp_cmp()
41 return (cmp & IEEE754_CLT) != 0; in ieee754dp_cmp()
43 return (cmp & IEEE754_CEQ) != 0; in ieee754dp_cmp()
45 return (cmp & IEEE754_CGT) != 0; in ieee754dp_cmp()
/linux-6.15/tools/include/linux/
H A Drbtree.h235 int (*cmp)(struct rb_node *, const struct rb_node *)) in rb_find_add()
243 c = cmp(node, parent); in rb_find_add()
268 int (*cmp)(const void *key, const struct rb_node *)) in rb_find()
273 int c = cmp(key, node); in rb_find()
296 int (*cmp)(const void *key, const struct rb_node *)) in rb_find_first()
302 int c = cmp(key, node); in rb_find_first()
326 int (*cmp)(const void *key, const struct rb_node *)) in rb_next_match()
329 if (node && cmp(key, node)) in rb_next_match()
341 #define rb_for_each(node, key, tree, cmp) \ argument
342 for ((node) = rb_find_first((key), (tree), (cmp)); \
[all …]
/linux-6.15/arch/x86/lib/
H A Dmemmove_64.S35 cmp %rdi, %rsi
39 cmp %rdi, %r8
42 #define CHECK_LEN cmp $0x20, %rdx; jb 1f
53 cmp $680, %rdx
118 cmp $0x20, %rdx
120 cmp $680, %rdx
122 cmp %dil, %sil
193 cmp $2, %rdx
204 cmp $1, %rdx
/linux-6.15/arch/alpha/include/asm/
H A Dcmpxchg.h119 unsigned long prev, tmp, cmp, addr64; in ____cmpxchg_u8() local
136 : "=&r" (prev), "=&r" (new), "=&r" (tmp), "=&r" (cmp), "=&r" (addr64) in ____cmpxchg_u8()
145 unsigned long prev, tmp, cmp, addr64; in ____cmpxchg_u16() local
162 : "=&r" (prev), "=&r" (new), "=&r" (tmp), "=&r" (cmp), "=&r" (addr64) in ____cmpxchg_u16()
171 unsigned long prev, cmp; in ____cmpxchg_u32() local
184 : "=&r"(prev), "=&r"(cmp), "=m"(*m) in ____cmpxchg_u32()
193 unsigned long prev, cmp; in ____cmpxchg_u64() local
206 : "=&r"(prev), "=&r"(cmp), "=m"(*m) in ____cmpxchg_u64()

12345678910>>...24