Home
last modified time | relevance | path

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

12345678910>>...24

/linux-6.6.21/drivers/clk/sunxi-ng/
Dccu_mp.c103 struct ccu_mp *cmp = data; in ccu_mp_round_rate() local
107 if (cmp->common.features & CCU_FEATURE_FIXED_POSTDIV) in ccu_mp_round_rate()
108 rate *= cmp->fixed_post_div; in ccu_mp_round_rate()
110 max_m = cmp->m.max ?: 1 << cmp->m.width; in ccu_mp_round_rate()
111 max_p = cmp->p.max ?: 1 << ((1 << cmp->p.width) - 1); in ccu_mp_round_rate()
113 if (!clk_hw_can_set_rate_parent(&cmp->common.hw)) { in ccu_mp_round_rate()
120 if (cmp->common.features & CCU_FEATURE_FIXED_POSTDIV) in ccu_mp_round_rate()
121 rate /= cmp->fixed_post_div; in ccu_mp_round_rate()
128 struct ccu_mp *cmp = hw_to_ccu_mp(hw); in ccu_mp_disable() local
130 return ccu_gate_helper_disable(&cmp->common, cmp->enable); in ccu_mp_disable()
[all …]
/linux-6.6.21/net/sched/
Dem_cmp.c16 static inline int cmp_needs_transformation(struct tcf_em_cmp *cmp) in cmp_needs_transformation() argument
18 return unlikely(cmp->flags & TCF_EM_CMP_TRANS); in cmp_needs_transformation()
24 struct tcf_em_cmp *cmp = (struct tcf_em_cmp *) em->data; in em_cmp_match() local
25 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()
[all …]
/linux-6.6.21/arch/sparc/lib/
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
79 cmp %o0, %g2
88 cmp %o4, 0
[all …]
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.6.21/scripts/coccinelle/misc/
Dminmax.cocci23 binary operator cmp = {>, >=};
30 * ((x) cmp@p (y) ? (x) : (y))
38 binary operator cmp = {>, >=};
45 * if ((x) cmp@p (y)) {
56 binary operator cmp = {<, <=};
63 * ((x) cmp@p (y) ? (x) : (y))
71 binary operator cmp = {<, <=};
78 * if ((x) cmp@p (y)) {
89 binary operator cmp = {>=, >};
95 - ((x) cmp (y) ? (x) : (y))
[all …]
/linux-6.6.21/arch/arm/lib/
Dlib1funcs.S67 1: cmp \divisor, #0x10000000
75 1: cmp \divisor, #0x80000000
86 1: cmp \dividend, \divisor
89 cmp \dividend, \divisor, lsr #1
92 cmp \dividend, \divisor, lsr #2
95 cmp \dividend, \divisor, lsr #3
98 cmp \dividend, #0 @ Early termination?
115 cmp \divisor, #(1 << 16)
120 cmp \divisor, #(1 << 8)
124 cmp \divisor, #(1 << 4)
[all …]
/linux-6.6.21/arch/hexagon/lib/
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)
91 p0 = cmp.gtu(r2, #11)
98 p1 = cmp.eq(r3, #1)
114 p1 = cmp.eq(r2, #8)
125 p1 = cmp.eq(r2, #4)
[all …]
Dmemcpy.S185 p2 = cmp.eq(len, #0); /* =0 */
187 p0 = cmp.gtu(len, #23); /* %1, <24 */
188 p1 = cmp.eq(ptr_in, ptr_out); /* attempt to overwrite self */
192 p3 = cmp.gtu(len, #95); /* %8 < 97 */
255 p3 = cmp.gtu(back, #8);
261 p1 = cmp.eq(prolog, #0);
267 nokernel = cmp.eq(kernel,#0);
276 p2 = cmp.eq(kernel, #1); /* skip ovr if kernel == 0 */
310 p2 = cmp.gtu(offset, #7);
322 p0 = cmp.gt(over, #0);
[all …]
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.6.21/arch/sparc/net/
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
73 cmp r_OFF, r_HEADLEN
81 cmp r_OFF, 0
86 cmp r_OFF, r_HEADLEN
101 cmp %o0, 0; \
138 cmp %o0, 0; \
[all …]
/linux-6.6.21/security/selinux/ss/
Dhashtab.h22 int (*cmp)(const void *key1, const void *key2); member
76 int cmp = key_params.cmp(key, cur->key); in hashtab_insert() local
78 if (cmp == 0) in hashtab_insert()
80 if (cmp < 0) in hashtab_insert()
108 int cmp = key_params.cmp(key, cur->key); in hashtab_search() local
110 if (cmp == 0) in hashtab_search()
112 if (cmp < 0) in hashtab_search()
/linux-6.6.21/arch/arm/mach-tegra/
Dreset-handler.S40 cmp r0, #0 @ CPU0?
46 cmp r6, #TEGRA20
62 cmp r8, r9
79 cmp r8, r9
99 cmp r1, #0
148 cmp r5, #0
153 cmp r6, #TEGRA20
169 cmp r6, #TEGRA30
197 cmp r10, #0
200 cmp lr, #0
[all …]
/linux-6.6.21/arch/ia64/lib/
Dmemcpy_mck.S95 cmp.gt p15,p0=8,in2 // check for small size
96 cmp.ne p13,p0=0,r28 // check dest alignment
97 cmp.ne p14,p0=0,r29 // check src alignment
104 cmp.le p6,p0 = 1,r30 // for .align_dest
119 cmp.lt p6,p0=2*PREFETCH_DIST,cnt
120 cmp.lt p7,p8=1,cnt
145 cmp.eq p10,p0=r29,r0 // do we really need to loop?
147 cmp.le p6,p0=8,tmp
149 cmp.le p7,p0=16,tmp
151 cmp.eq p16,p17 = r0,r0
[all …]
Dmemset.S68 cmp.ne p_nz, p_zr = value, r0 // use stf.spill if value is zero
69 cmp.eq p_scr, p0 = cnt, r0
81 cmp.ne p_unalgn, p0 = tmp, r0 //
84 cmp.gt p_scr, p0 = 16, cnt // is it a minimalistic task?
118 cmp.gt p_scr, p0 = tmp, cnt // is it a minimalistic task?
137 cmp.gt p_scr, p0 = PREF_AHEAD, linecnt // check against actual value
186 cmp.lt p_scr, p0 = ptr9, ptr1 // do we need more prefetching?
194 cmp.le p_scr, p0 = 8, cnt // just a few bytes left ?
207 cmp.gt p_scr, p0 = PREF_AHEAD, linecnt // check against actual value
240 cmp.lt p_scr, p0 = ptr9, ptr1 // do we need more prefetching?
[all …]
/linux-6.6.21/arch/powerpc/math-emu/
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()
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.6.21/tools/lib/
Dlist_sort.c15 static struct list_head *merge(void *priv, list_cmp_func_t cmp, in merge() argument
22 if (cmp(priv, a, b) <= 0) { in merge()
51 static void merge_final(void *priv, list_cmp_func_t cmp, struct list_head *head, in merge_final() argument
59 if (cmp(priv, a, b) <= 0) { in merge_final()
89 cmp(priv, b, b); in merge_final()
184 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp) in list_sort() argument
224 a = merge(priv, cmp, b, a); in list_sort()
246 list = merge(priv, cmp, pending, list); in list_sort()
250 merge_final(priv, cmp, head, pending, list); in list_sort()
/linux-6.6.21/lib/
Dlist_sort.c16 static struct list_head *merge(void *priv, list_cmp_func_t cmp, in merge() argument
23 if (cmp(priv, a, b) <= 0) { in merge()
52 static void merge_final(void *priv, list_cmp_func_t cmp, struct list_head *head, in merge_final() argument
60 if (cmp(priv, a, b) <= 0) { in merge_final()
90 cmp(priv, b, b); in merge_final()
185 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp) in list_sort() argument
225 a = merge(priv, cmp, b, a); in list_sort()
247 list = merge(priv, cmp, pending, list); in list_sort()
251 merge_final(priv, cmp, head, pending, list); in list_sort()
/linux-6.6.21/arch/arm/include/debug/
Dtegra.S74 cmp \rp, #1 @ needs initialization?
85 cmp \rv, #2 @ 2 and 3 mean DCC, UART
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
[all …]
/linux-6.6.21/arch/alpha/include/asm/
Dxchg.h131 unsigned long prev, tmp, cmp, addr64; in ____cmpxchg() local
148 : "=&r" (prev), "=&r" (new), "=&r" (tmp), "=&r" (cmp), "=&r" (addr64) in ____cmpxchg()
157 unsigned long prev, tmp, cmp, addr64; in ____cmpxchg() local
174 : "=&r" (prev), "=&r" (new), "=&r" (tmp), "=&r" (cmp), "=&r" (addr64) in ____cmpxchg()
183 unsigned long prev, cmp; in ____cmpxchg() local
196 : "=&r"(prev), "=&r"(cmp), "=m"(*m) in ____cmpxchg()
205 unsigned long prev, cmp; in ____cmpxchg() local
218 : "=&r"(prev), "=&r"(cmp), "=m"(*m) in ____cmpxchg()
/linux-6.6.21/arch/arm64/lib/
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.6.21/arch/mips/math-emu/
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()
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.6.21/include/linux/
Drbtree.h224 int (*cmp)(struct rb_node *, const struct rb_node *)) in rb_find_add()
232 c = cmp(node, parent); in rb_find_add()
257 int (*cmp)(const void *key, const struct rb_node *)) in rb_find()
262 int c = cmp(key, node); in rb_find()
285 int (*cmp)(const void *key, const struct rb_node *)) in rb_find_first()
291 int c = cmp(key, node); in rb_find_first()
315 int (*cmp)(const void *key, const struct rb_node *)) in rb_next_match()
318 if (node && cmp(key, node)) in rb_next_match()
330 #define rb_for_each(node, key, tree, cmp) \ argument
331 for ((node) = rb_find_first((key), (tree), (cmp)); \
[all …]
/linux-6.6.21/tools/include/linux/
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 …]

12345678910>>...24