| /Linux-v5.15/arch/nds32/kernel/ |
| D | ex-entry.S | 22 smw.adm $p0, [$sp], $p0, #0x1
29 sethi $p0, hi20(has_fpu)
30 lbsi $p0, [$p0+lo12(has_fpu)]
31 beqz $p0, skip_fucop_ctl
32 mfsr $p0, $FUCOP_CTL
33 smw.adm $p0, [$sp], $p0, #0x1
34 bclr $p0, $p0, #FUCOP_CTL_offCP0EN
35 mtsr $p0, $FUCOP_CTL
67 andi $p0, $r20, #PSW_mskPOM
69 cmovz $fp, $p1, $p0
[all …]
|
| D | ex-exit.S | 29 sethi $p0, hi20(has_fpu)
30 lbsi $p0, [$p0+lo12(has_fpu)]
31 beqz $p0, 2f
53 pop $p0
54 cmovn $sp, $p0, $p0
94 lwi $p0, [$sp+(#IPSW_OFFSET)] ! Check if in nested interrupt
95 andi $p0, $p0, #PSW_mskINTL
96 bnez $p0, resume_kernel ! done with iret
139 lwi $p0, [$sp+(#IPSW_OFFSET)] ! Check if in nested interrupt
140 andi $p0, $p0, #PSW_mskINTL
[all …]
|
| /Linux-v5.15/arch/hexagon/mm/ |
| D | copy_user_template.S | 19 p0 = cmp.gtu(bytes,#0) define
20 if (!p0.new) jump:nt .Ldone
26 p0 = bitsclr(r3,#7) define
27 if (!p0.new) jump:nt .Loop_not_aligned_8
52 p0 = bitsclr(r4,#7) define
53 if (p0.new) jump:nt .Lalign
56 p0 = bitsclr(r3,#3) define
57 if (!p0.new) jump:nt .Loop_not_aligned_4
82 p0 = bitsclr(r3,#1) define
83 if (!p0.new) jump:nt .Loop_not_aligned
[all …]
|
| /Linux-v5.15/arch/hexagon/lib/ |
| D | memset.S | 29 p0 = cmp.eq(r2, #0) define
36 if p0 jumpr r31 /* count == 0, so return */
41 p0 = tstbit(r9, #0) define
58 p0 = tstbit(r9, #1) define
60 if !p0 jump 3f /* skip initial byte store */
71 p0 = tstbit(r9, #2) define
73 if !p0 jump 4f /* skip initial half store */
84 p0 = cmp.gtu(r2, #7) define
86 if !p0 jump 5f /* skip initial word store */
91 p0 = cmp.gtu(r2, #11) define
[all …]
|
| D | memcpy_likely_aligned.S | 10 p0 = bitsclr(r1,#7) define
11 p0 = bitsclr(r0,#7) define
12 if (p0.new) r5:4 = memd(r1)
13 if (p0.new) r7:6 = memd(r1+#8)
16 if (!p0) jump:nt .Lmemcpy_call
17 if (p0) r9:8 = memd(r1+#16)
18 if (p0) r11:10 = memd(r1+#24)
19 p0 = cmp.gtu(r2,#64) define
22 if (p0) jump:nt .Lmemcpy_call
23 if (!p0) memd(r0) = r5:4
[all …]
|
| D | divsi3.S | 10 p0 = cmp.gt(r0,#-1) define
15 p3 = xor(p0,p1)
18 p0 = cmp.gtu(r3,r2) define
26 r0 = mux(p0,#0,r0)
27 p0 = or(p0,p1) define
28 if (p0.new) jumpr:nt r31
35 p0 = cmp.gtu(r6,#4) define
39 if (!p0) r6 = #3
50 if (!p0.new) r0 = add(r0,r5)
51 if (!p0.new) r2 = sub(r2,r4)
[all …]
|
| D | udivsi3.S | 13 p0 = cmp.gtu(r1,r0) define
19 if (p0) jumpr r31
28 p0 = cmp.gtu(r2,r1) define
29 if (!p0.new) r1 = sub(r1,r2)
30 if (!p0.new) r0 = add(r0,r3)
34 p0 = cmp.gtu(r2,r1) define
35 if (!p0.new) r0 = add(r0,r3)
|
| D | umodsi3.S | 12 p0 = cmp.gtu(r1,r0) define
16 if (p0) jumpr r31
26 p0 = cmp.gtu(r2,r0) define
27 if (!p0.new) r0 = sub(r0,r2)
32 p0 = cmp.gtu(r2,r0) define
33 if (!p0.new) r0 = sub(r0,r1)
|
| D | modsi3.S | 17 p0 = cmp.gtu(r1,r2) define
21 if (p0) jumpr r31
32 p0 = cmp.gtu(r2,r0) define
33 if (!p0.new) r0 = sub(r0,r2)
38 p0 = cmp.gtu(r2,r0) define
39 if (!p0.new) r0 = sub(r0,r1)
|
| /Linux-v5.15/arch/x86/include/asm/ |
| D | xor_avx.h | 29 static void xor_avx_2(unsigned long bytes, unsigned long *p0, unsigned long *p1) in xor_avx_2() argument
41 "m" (p0[i / sizeof(*p0)])); \ in xor_avx_2()
43 "=m" (p0[i / sizeof(*p0)])); \ in xor_avx_2()
48 p0 = (unsigned long *)((uintptr_t)p0 + 512); in xor_avx_2()
55 static void xor_avx_3(unsigned long bytes, unsigned long *p0, unsigned long *p1, in xor_avx_3() argument
70 "m" (p0[i / sizeof(*p0)])); \ in xor_avx_3()
72 "=m" (p0[i / sizeof(*p0)])); \ in xor_avx_3()
77 p0 = (unsigned long *)((uintptr_t)p0 + 512); in xor_avx_3()
85 static void xor_avx_4(unsigned long bytes, unsigned long *p0, unsigned long *p1, in xor_avx_4() argument
102 "m" (p0[i / sizeof(*p0)])); \ in xor_avx_4()
[all …]
|
| /Linux-v5.15/arch/nds32/lib/ |
| D | memmove.S | 25 slt $p0, $r0, $r1 ! check if $r0 < $r1
26 beqz $p0, do_reverse ! branch if dst > src
34 lmw.bim $p0, [$r1], $p0 ! Read a word from src
36 smw.bim $p0, [$r0], $p0 ! Copy the word to det
49 lmw.adm $p0, [$r1], $p0 ! Read a word from src
51 smw.adm $p0, [$r0], $p0 ! Copy the word to det
59 lb.bi $p0, [$r1], $t0 ! Read a byte from src
61 sb.bi $p0, [$r0], $t0 ! copy the byte to det
|
| D | memset.S | 16 slli $p0, $r1, #8 ! $p0 = 0000ab00
17 or $r1, $r1, $p0 ! $r1 = 0000abab
18 slli $p0, $r1, #16 ! $p0 = abab0000
19 or $r1, $r1, $p0 ! $r1 = abababab
|
| D | clear_user.S | 20 srli $p0, $r1, #2 ! $p0 = number of word to clear
22 beqz $p0, byte_clear ! Only less than a word to clear
25 addi $p0, $p0, #-1 ! Decrease word count
26 bnez $p0, word_clear ! Continue looping to clear all words
|
| /Linux-v5.15/scripts/coccinelle/misc/ |
| D | minmax.cocci | 172 for p0 in p:
173 coccilib.report.print_report(p0, "WARNING opportunity for max()")
179 for p0 in p:
180 coccilib.org.print_todo(p0, "WARNING opportunity for max()")
186 for p0 in p:
187 coccilib.report.print_report(p0, "WARNING opportunity for max()")
193 for p0 in p:
194 coccilib.org.print_todo(p0, "WARNING opportunity for max()")
200 for p0 in p:
201 coccilib.report.print_report(p0, "WARNING opportunity for min()")
[all …]
|
| D | doubleinit.cocci | 19 position p0,p;
23 struct I s =@p0 { ..., .fld@p = E, ...};
27 position r.p0,p;
31 struct I s =@p0 { ..., .fld@p = E, ...};
34 p0 << r.p0;
41 cocci.print_main(fld,p0)
46 p0 << r.p0;
54 coccilib.report.print_report(p0[0],msg)
|
| /Linux-v5.15/arch/hexagon/include/asm/ |
| D | bitops.h | 39 " { P0 = tstbit(R12,R11); R12 = clrbit(R12,R11); }\n" in test_and_clear_bit()
41 " {if (!P1) jump 1b; %0 = mux(P0,#1,#0);}\n" in test_and_clear_bit()
44 : "r10", "r11", "r12", "p0", "p1", "memory" in test_and_clear_bit()
63 " { P0 = tstbit(R12,R11); R12 = setbit(R12,R11); }\n" in test_and_set_bit()
65 " {if (!P1) jump 1b; %0 = mux(P0,#1,#0);}\n" in test_and_set_bit()
68 : "r10", "r11", "r12", "p0", "p1", "memory" in test_and_set_bit()
89 " { P0 = tstbit(R12,R11); R12 = togglebit(R12,R11); }\n" in test_and_change_bit()
91 " {if (!P1) jump 1b; %0 = mux(P0,#1,#0);}\n" in test_and_change_bit()
94 : "r10", "r11", "r12", "p0", "p1", "memory" in test_and_change_bit()
166 "{P0 = tstbit(%1,%2); if (P0.new) %0 = #1; if (!P0.new) %0 = #0;}\n" in __test_bit()
[all …]
|
| D | cmpxchg.h | 32 " memw_locked(%1,P0) = %2;\n" /* store into memory */ in __xchg()
33 " if (!P0) jump 1b;\n" in __xchg()
36 : "memory", "p0" in __xchg()
63 " { P0 = cmp.eq(%0,%2);\n" \
64 " if (!P0.new) jump:nt 2f; }\n" \
65 " memw_locked(%1,p0) = %3;\n" \
66 " if (!P0) jump 1b;\n" \
70 : "memory", "p0" \
|
| D | atomic.h | 21 " memw_locked(%0,p0) = %1;\n" in arch_atomic_set()
22 " if (!P0) jump 1b;\n" in arch_atomic_set()
25 : "memory", "p0", "r6" in arch_atomic_set()
70 " { P0 = cmp.eq(%0,%2);\n" in arch_atomic_cmpxchg()
71 " if (!P0.new) jump:nt 2f; }\n" in arch_atomic_cmpxchg()
72 " memw_locked(%1,P0) = %3;\n" in arch_atomic_cmpxchg()
73 " if (!P0) jump 1b;\n" in arch_atomic_cmpxchg()
77 : "memory", "p0" in arch_atomic_cmpxchg()
|
| /Linux-v5.15/drivers/gpu/drm/omapdrm/ |
| D | tcm.h | 52 struct tcm_pt p0; member
228 slice->p0.y != slice->p1.y && in tcm_slice()
229 (slice->p0.x || (slice->p1.x != slice->tcm->width - 1))) { in tcm_slice()
232 slice->p1.y = (slice->p0.x) ? slice->p0.y : slice->p1.y - 1; in tcm_slice()
234 parent->p0.x = 0; in tcm_slice()
235 parent->p0.y = slice->p1.y + 1; in tcm_slice()
249 area->p0.y <= area->p1.y && in tcm_area_is_valid()
250 /* 1D coordinate relationship + p0.x check */ in tcm_area_is_valid()
252 area->p0.x < area->tcm->width && in tcm_area_is_valid()
253 area->p0.x + area->p0.y * area->tcm->width <= in tcm_area_is_valid()
[all …]
|
| D | tcm-sita.c | 171 area->p0.x = pos % tcm->width; in sita_reserve_1d()
172 area->p0.y = pos / tcm->width; in sita_reserve_1d()
193 area->p0.x = pos % tcm->width; in sita_reserve_2d()
194 area->p0.y = pos / tcm->width; in sita_reserve_2d()
195 area->p1.x = area->p0.x + w - 1; in sita_reserve_2d()
196 area->p1.y = area->p0.y + h - 1; in sita_reserve_2d()
213 pos = area->p0.x + area->p0.y * tcm->width; in sita_free()
215 w = area->p1.x - area->p0.x + 1; in sita_free()
216 h = area->p1.y - area->p0.y + 1; in sita_free()
|
| /Linux-v5.15/arch/ia64/lib/ |
| D | memset.S | 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?
248 cmp.gt p_scr, p0 = 8, cnt // just a few bytes left ?
[all …]
|
| /Linux-v5.15/Documentation/devicetree/bindings/ata/ |
| D | ahci-ceva.txt | 8 - ceva,p0-cominit-params: OOB timing value for COMINIT parameter for port 0.
16 - ceva,p0-comwake-params: OOB timing value for COMWAKE parameter for port 0.
24 - ceva,p0-burst-params: Burst timing value for COM parameter for port 0.
32 - ceva,p0-retry-params: Retry interval timing value for port 0.
51 ceva,p0-cominit-params = /bits/ 8 <0x0F 0x25 0x18 0x29>;
52 ceva,p0-comwake-params = /bits/ 8 <0x04 0x0B 0x08 0x0F>;
53 ceva,p0-burst-params = /bits/ 8 <0x0A 0x08 0x4A 0x06>;
54 ceva,p0-retry-params = /bits/ 16 <0x0216 0x7F06>;
|
| /Linux-v5.15/drivers/scsi/qla4xxx/ |
| D | ql4_dbg.c | 106 offsetof(struct isp_reg, u2.isp4022.p0.ext_hw_conf), in qla4xxx_dump_registers()
107 readw(&ha->reg->u2.isp4022.p0.ext_hw_conf)); in qla4xxx_dump_registers()
109 offsetof(struct isp_reg, u2.isp4022.p0.port_ctrl), in qla4xxx_dump_registers()
110 readw(&ha->reg->u2.isp4022.p0.port_ctrl)); in qla4xxx_dump_registers()
112 offsetof(struct isp_reg, u2.isp4022.p0.port_status), in qla4xxx_dump_registers()
113 readw(&ha->reg->u2.isp4022.p0.port_status)); in qla4xxx_dump_registers()
115 (uint8_t) offsetof(struct isp_reg, u2.isp4022.p0.gp_out), in qla4xxx_dump_registers()
116 readw(&ha->reg->u2.isp4022.p0.gp_out)); in qla4xxx_dump_registers()
118 (uint8_t) offsetof(struct isp_reg, u2.isp4022.p0.gp_in), in qla4xxx_dump_registers()
119 readw(&ha->reg->u2.isp4022.p0.gp_in)); in qla4xxx_dump_registers()
[all …]
|
| /Linux-v5.15/tools/memory-model/Documentation/ |
| D | explanation.txt | 115 P0()
131 Here the P0() function represents the interrupt handler running on one
134 Thus, P0 stores the data in buf and then sets flag. Meanwhile, P1
162 instance, P1 might run entirely before P0 begins, in which case r1 and
163 r2 will both be 0 at the end. Or P0 might run entirely before P1
167 routines run concurrently. One possibility is that P1 runs after P0's
196 Since r1 = 1, P0 must store 1 to flag before P1 loads 1 from
202 P1 must load 0 from buf before P0 stores 1 to it; otherwise r2
206 P0 stores 1 to buf before storing 1 to flag, since it executes
209 Since an instruction (in this case, P0's store to flag) cannot
[all …]
|
| /Linux-v5.15/tools/testing/selftests/bpf/prog_tests/ |
| D | sockmap_listen.c | 946 int s, c0, c1, p0, p1; in redir_to_connected() local
971 p0 = xaccept_nonblock(s, NULL, NULL); in redir_to_connected()
972 if (p0 < 0) in redir_to_connected()
986 err = add_to_sockmap(sock_mapfd, p0, p1); in redir_to_connected()
1015 xclose(p0); in redir_to_connected()
1241 int s, c0, c1, p0, err; in test_reuseport_select_connected() local
1274 p0 = xaccept_nonblock(s, NULL, NULL); in test_reuseport_select_connected()
1275 if (p0 < 0) in test_reuseport_select_connected()
1278 p0 = xsocket(family, sotype, 0); in test_reuseport_select_connected()
1279 if (p0 < 0) in test_reuseport_select_connected()
[all …]
|
