/linux/drivers/clk/sunxi-ng/ |
H A D | ccu_mp.c | 112 struct ccu_mp *cmp = data; in ccu_mp_round_rate() local 117 if (cmp->common.features & CCU_FEATURE_FIXED_POSTDIV) in ccu_mp_round_rate() 118 rate *= cmp->fixed_post_div; in ccu_mp_round_rate() 120 if (cmp->common.features & CCU_FEATURE_DUAL_DIV) in ccu_mp_round_rate() 123 max_m = cmp->m.max ?: 1 << cmp->m.width; in ccu_mp_round_rate() 125 max_p = cmp->p.max ?: 1 << ((1 << cmp->p.width) - 1); in ccu_mp_round_rate() 127 max_p = cmp->p.max ?: 1 << cmp in ccu_mp_round_rate() 145 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_disable() local 152 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_enable() local 159 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_is_enabled() local 167 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_recalc_rate() local 201 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_determine_rate() local 210 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_set_rate() local 256 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_get_parent() local 263 struct ccu_mp *cmp = hw_to_ccu_mp(hw); ccu_mp_set_parent() local [all...] |
/linux/net/sched/ |
H A D | em_cmp.c | 16 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 in em_cmp_match() [all...] |
/linux/arch/sparc/lib/ |
H A D | strncmp_32.S | 15 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 [all...] |
H A D | memscan_32.S | 23 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/scripts/coccinelle/misc/ |
H A D | minmax.cocci | 23 binary operator cmp = {>, >=}; 30 * ((x) cmp@p (y) ? (x) : (y)) 38 binary operator cmp = {>, >=}; 45 * if ((x) cmp@p (y)) { 58 binary operator cmp = {<, <=}; 64 return ((x) cmp@p 0 ? (x) : 0); 71 binary operator cmp = {<, <=}; 78 * ((x) cmp@p (y) ? (x) : (y)) 86 binary operator cmp = {<, <=}; 93 * if ((x) cmp [all...] |
/linux/arch/arm/lib/ |
H A D | lib1funcs.S | 67 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 \diviso [all...] |
/linux/arch/hexagon/lib/ |
H A D | memset.S | 29 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 [all...] |
H A D | memcpy.S | 185 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 [all...] |
H A D | divsi3.S | 10 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)
|
H A D | modsi3.S | 10 p2 = cmp.ge(r0,#0) 17 p0 = cmp.gtu(r1,r2) 24 p1 = cmp.eq(r3,#0) 32 p0 = cmp.gtu(r2,r0) 38 p0 = cmp.gtu(r2,r0)
|
/linux/arch/sparc/net/ |
H A D | bpf_jit_asm_32.S | 16 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 [all...] |
/linux/include/linux/ |
H A D | rbtree.h | 217 * @cmp: operator defining the node order 224 int (*cmp)(const struct rb_node *new, const struct rb_node *exist)) in rb_find_add_cached() 233 c = cmp(node, parent); in rb_find_add_cached() 254 * @cmp: operator defining the node order 261 int (*cmp)(struct rb_node *, const struct rb_node *)) in rb_find_add() 269 c = cmp(node, parent); in rb_find_add() 288 * @cmp: operator defining the node order 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() 324 * @cmp 434 rb_for_each(node,key,tree,cmp) global() argument [all...] |
/linux/security/selinux/ss/ |
H A D | hashtab.h | 23 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/arch/arm/mach-tegra/ |
H A D | reset-handler.S | 40 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 l [all...] |
/linux/arch/powerpc/math-emu/ |
H A D | fcmpu.c | 17 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 D | fcmpo.c | 17 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/lib/ |
H A D | list_sort.c | 13 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() 83 * element comparison is needed, so the client's cmp() in merge_final() 87 cmp(priv, b, b); in merge_final() 100 * @priv: private data, opaque to list_sort(), passed to @cmp 102 * @cmp: the elements comparison function 104 * The comparison function @cmp must return > 0 if @a should sort after 113 * - Antisymmetry: cmp( 189 list_sort(void * priv,struct list_head * head,list_cmp_func_t cmp) list_sort() argument [all...] |
/linux/arch/arm/include/debug/ |
H A D | tegra.S | 74 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 \r [all...] |
/linux/arch/arm/mach-at91/ |
H A D | pm_suspend.S | 36 cmp \r_mckid, #0 44 cmp r8, r7 103 cmp r8, #1 173 cmp tmp1, #UDDRC_STAT_SELFREF_TYPE_SW 177 cmp r7, #AT91_PM_BACKUP 305 cmp tmp1, #UDDRC_STAT_OPMODE_NORMAL 344 cmp r1, #AT91_MEMCTRL_MC 353 cmp r1, #AT91_MEMCTRL_DDRSDR 364 cmp r3, #AT91_DDRSDRC_MD_LOW_POWER_DDR 379 cmp r [all...] |
/linux/tools/lib/ |
H A D | list_sort.c | 13 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() 90 * @priv: private data, opaque to list_sort(), passed to @cmp 92 * @cmp: the elements comparison function 94 * The comparison function @cmp must return > 0 if @a should sort after 101 * This is compatible with two styles of @cmp function: 172 void list_sort(void *priv, struct list_head *head, list_cmp_func_t cmp) in list_sort() argument 212 a = merge(priv, cmp, in list_sort() [all...] |
/linux/arch/arm64/lib/ |
H A D | memcmp.S | 41 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/arch/mips/math-emu/ |
H A D | sp_cmp.c | 12 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 D | dp_cmp.c | 12 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/tools/include/linux/ |
H A D | rbtree.h | 228 * @cmp: operator defining the node order 235 int (*cmp)(struct rb_node *, const struct rb_node *)) in rb_find_add() 243 c = cmp(node, parent); in rb_find_add() 262 * @cmp: operator defining the node order 268 int (*cmp)(const void *key, const struct rb_node *)) in rb_find() 273 int c = cmp(key, node); in rb_find() 290 * @cmp: operator defining node order 296 int (*cmp)(const void *key, const struct rb_node *)) in rb_find_first() 302 int c = cmp(key, node); in rb_find_first() 320 * @cmp 341 rb_for_each(node,key,tree,cmp) global() argument [all...] |
/linux/arch/x86/lib/ |
H A D | memmove_64.S | 35 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
|