| /Linux-v4.19/arch/hexagon/mm/ |
| D | strnlen_user.S | 52 P0 = cmp.eq(mod8,#0); define
55 if (P0.new) jump:t dw_loop; /* fire up the oven */
63 P0 = cmp.eq(tmp1,#0); define
64 if (P0.new) jump:nt exit_found;
70 P0 = cmp.eq(mod8,#0); define
73 if (!P0) jump alignment_loop;
84 P0 = vcmpb.eq(dbuf,dcmp); define
87 tmp1 = P0;
88 P0 = cmp.gtu(end,start); define
93 if (!P0) jump end_check;
[all …]
|
| /Linux-v4.19/tools/memory-model/litmus-tests/ |
| D | ISA2+pooncerelease+poacquirerelease+poacquireonce.litmus | 7 * to order P0()'s initial write against P2()'s final read. The reason
9 * case (P2() to P0()), each process reads from the preceding process's
16 P0(int *x, int *y)
|
| D | Z6.0+pooncerelease+poacquirerelease+fencembonceonce.litmus | 9 * P0's write, which means that there are two non-rf links: P1() to P2()
11 * to P0() is a read-to-write link (AKA a "from-reads" or just "fr" link).
19 P0(int *x, int *y)
|
| D | S+poonceonces.litmus | 6 * Starting with a two-process release-acquire chain ordering P0()'s
14 P0(int *x, int *y)
|
| D | ISA2+pooncelock+pooncelock+pombonce.litmus | 7 * litmus test (P0() and P1()) are not visible to external process P2().
13 P0(int *x, int *y, spinlock_t *mylock)
|
| D | CoWW+poonceonce.litmus | 12 P0(int *x)
|
| D | CoRR+poonceonce+Once.litmus | 12 P0(int *x)
|
| D | MP+poonceonces.litmus | 12 P0(int *x, int *y)
|
| D | LB+poonceonces.litmus | 12 P0(int *x, int *y)
|
| D | S+fencewmbonceonce+poacquireonce.litmus | 12 P0(int *x, int *y)
|
| D | MP+pooncerelease+poacquireonce.litmus | 13 P0(int *x, int *y)
|
| D | CoRW+poonceonce+Once.litmus | 12 P0(int *x)
|
| D | CoWR+poonceonce+Once.litmus | 12 P0(int *x)
|
| D | R+poonceonces.litmus | 13 P0(int *x, int *y)
|
| D | LB+poacquireonce+pooncerelease.litmus | 13 P0(int *x, int *y)
|
| D | MP+fencewmbonceonce+fencermbonceonce.litmus | 13 P0(int *x, int *y)
|
| D | SB+poonceonces.litmus | 13 P0(int *x, int *y)
|
| D | SB+rfionceonce-poonceonces.litmus | 11 P0(int *x, int *y)
|
| D | R+fencembonceonces.litmus | 14 P0(int *x, int *y)
|
| D | SB+fencembonceonces.litmus | 14 P0(int *x, int *y)
|
| D | MP+onceassign+derefonce.litmus | 17 P0(int *x, int **y)
|
| /Linux-v4.19/drivers/ata/ |
| D | ata_piix.c | 122 P0 = 0, /* port 0 */ enumerator
360 { P0, NA, P1, NA }, /* 000b */
361 { P1, NA, P0, NA }, /* 001b */
364 { P0, P1, IDE, IDE }, /* 100b */
365 { P1, P0, IDE, IDE }, /* 101b */
366 { IDE, IDE, P0, P1 }, /* 110b */
367 { IDE, IDE, P1, P0 }, /* 111b */
376 { P0, P2, P1, P3 }, /* 00b */
378 { P0, P2, IDE, IDE }, /* 10b */
393 { P0, P2, NA, NA }, /* 00b */
[all …]
|
| /Linux-v4.19/arch/hexagon/kernel/ |
| D | vm_entry.S | 297 P0 = tstbit(R0, #HVM_VMEST_UM_SFT); define
298 if (!P0.new) jump:nt restore_all;
320 P0 = cmp.eq(R0, #0); if (!P0.new) jump:nt check_work_pending; define
381 P0 = cmp.eq(R24, #0); define
385 if P0 jump check_work_pending
|
| /Linux-v4.19/tools/memory-model/Documentation/ |
| D | explanation.txt | 113 P0()
129 Here the P0() function represents the interrupt handler running on one
132 Thus, P0 stores the data in buf and then sets flag. Meanwhile, P1
160 instance, P1 might run entirely before P0 begins, in which case r1 and
161 r2 will both be 0 at the end. Or P0 might run entirely before P1
165 routines run concurrently. One possibility is that P1 runs after P0's
194 Since r1 = 1, P0 must store 1 to flag before P1 loads 1 from
200 P1 must load 0 from buf before P0 stores 1 to it; otherwise r2
204 P0 stores 1 to buf before storing 1 to flag, since it executes
225 P0()
[all …]
|
| /Linux-v4.19/arch/c6x/lib/ |
| D | mpyll.S | 30 ;; P0 = X0*Y0
34 ;; result = (P2 << 64) + (P1 << 32) + P0
|
