Home
last modified time | relevance | path

Searched refs:p0 (Results 1 – 25 of 134) sorted by relevance

123456

/kernel/linux/linux-5.10/arch/nds32/kernel/
Dex-entry.S22 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 …]
Dex-exit.S29 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 …]
/kernel/linux/linux-5.10/arch/x86/include/asm/
Dxor_avx.h29 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 …]
/kernel/linux/linux-5.10/arch/hexagon/mm/
Dcopy_user_template.S19 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 …]
/kernel/linux/linux-5.10/arch/hexagon/lib/
Dmemset.S29 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 …]
Dmemcpy_likely_aligned.S10 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 …]
Ddivsi3.S10 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 …]
Dudivsi3.S13 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)
/kernel/liteos_m/testsuites/sample/kernel/mem/
DIt_los_mem_017.c40 void *p0 = NULL; in TestCase() local
46 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
47 ICUNIT_GOTO_NOT_EQUAL(p0, NULL, p0, EXIT); in TestCase()
48 p[0] = p0; in TestCase()
51 p0 = LOS_MemRealloc(g_memPool, p0, size); in TestCase()
52 ICUNIT_GOTO_EQUAL(p0, NULL, p0, EXIT); in TestCase()
55 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
56 ICUNIT_GOTO_NOT_EQUAL(p0, NULL, p0, EXIT); in TestCase()
57 p[1] = p0; in TestCase()
59 ret = LOS_MemFree(g_memPool, p0); in TestCase()
DIt_los_mem_014.c42 void *p0 = NULL; in TestCase() local
47 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
48 p[i] = p0; in TestCase()
49 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
57 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
58 ICUNIT_GOTO_EQUAL(p0, NULL, p0, EXIT); in TestCase()
66 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
67 ICUNIT_GOTO_EQUAL(p0, p[0], p0, EXIT); in TestCase()
75 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
76 …ICUNIT_GOTO_EQUAL(p0, p[2], p0, EXIT); // 2, assert the adderess of new node is same as the releas… in TestCase()
DIt_los_mem_038.c41 void *p0 = NULL; in TestCase() local
53 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0; p0 != NULL; i++) { in TestCase()
54 p[i] = p0; in TestCase()
55 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
63 …p0 = LOS_MemRealloc(g_memPool, p[j], size / 2); // 2, The reallocated memory is half of its previo… in TestCase()
64 if (p0 == NULL) { in TestCase()
80 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0; p0 != NULL; i++) { in TestCase()
81 p[i] = p0; in TestCase()
82 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
99 p0 = LOS_MemRealloc(g_memPool, p[j], size * 2); in TestCase()
[all …]
DIt_los_mem_015.c42 void *p0 = NULL; in TestCase() local
47 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
48 p[i] = p0; in TestCase()
49 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
63 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
64 ICUNIT_GOTO_EQUAL(p0, NULL, p0, EXIT); in TestCase()
69 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
70 ICUNIT_GOTO_EQUAL(p0, p[0], p0, EXIT); in TestCase()
72 ret = LOS_MemFree(g_memPool, p0); in TestCase()
DIt_los_mem_020.c40 void *p0 = NULL; in TestCase() local
46 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
47 p[i] = p0; in TestCase()
48 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
56 p0 = LOS_MemRealloc(g_memPool, p[0], (UINT32)(size * 1.5)); in TestCase()
57 ICUNIT_GOTO_EQUAL(p0, NULL, p0, EXIT); in TestCase()
63 p0 = LOS_MemRealloc(g_memPool, p[0], (UINT32)(size * 1.5)); in TestCase()
64 ICUNIT_GOTO_EQUAL(p0, p[0], p0, EXIT); in TestCase()
DIt_los_mem_035.c41 void *p0 = NULL; in TestCase() local
51 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0, i = 0; p0 != NULL; i++) { in TestCase()
52 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
69 for (p0 = LOS_MemAlloc(g_memPool, size), i = 0; p0 != NULL; i++) { in TestCase()
70 f0 = p0; in TestCase()
71 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
88 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0, i = 0; p0 != NULL; i++) { in TestCase()
89 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
96 p0 = f0; in TestCase()
107 f0 = (void *)((char *)p0 + ((UINT32)size + LOS_DLNK_NODE_HEAD_SIZE)); in TestCase()
DIt_los_mem_013.c41 void *p0 = NULL; in TestCase() local
46 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
47 ICUNIT_GOTO_NOT_EQUAL(p0, NULL, 0, EXIT); in TestCase()
49 …ret = LOS_MemFree(g_memPool, (void *)((char *)p0 + 16)); // 16, Get an illegal memory node address. in TestCase()
52 ret = LOS_MemFree(g_memPool, p0); in TestCase()
55 …ret = LOS_MemFree(g_memPool, (void *)((char *)p0 + 16)); // 16, Get an illegal memory node address. in TestCase()
58 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
59 ICUNIT_GOTO_NOT_EQUAL(p0, NULL, 0, EXIT); in TestCase()
61 …ret = LOS_MemFree(g_memPool, (void *)((char *)p0 - 16)); // 16, Get an illegal memory node address. in TestCase()
64 ret = LOS_MemFree(g_memPool, p0); in TestCase()
[all …]
DIt_los_mem_036.c41 void *p0 = NULL; in TestCase() local
54 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0; p0 != NULL; i++) { in TestCase()
59 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
88 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
89 f0 = p0; in TestCase()
94 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
129 for (p0 = LOS_MemAlloc(g_memPool, size), f0 = p0; p0 != NULL; i++) { in TestCase()
134 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
141 p0 = f0; in TestCase()
166 f0 = p0; in TestCase()
DIt_los_mem_037.c41 void *p0 = NULL; in TestCase() local
53 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
54 ICUNIT_GOTO_NOT_EQUAL(p0, NULL, count, EXIT); in TestCase()
56 …f0 = LOS_MemRealloc(g_memPool, p0, size / 2); // 2, The reallocated memory is half of its previous… in TestCase()
59 …f0 = LOS_MemRealloc(g_memPool, p0, size * 2); // 2, The reallocated memory is 2 times of its previ… in TestCase()
71 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
72 ICUNIT_GOTO_NOT_EQUAL(p0, NULL, count, EXIT); in TestCase()
74 …f0 = LOS_MemRealloc(g_memPool, p0, size / 2); // 2, The reallocated memory is half of its previous… in TestCase()
77 …f0 = LOS_MemRealloc(g_memPool, p0, size * 2); // 2, The reallocated memory is 2 times of its previ… in TestCase()
91 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
[all …]
DIt_los_mem_008.c42 void *p0 = NULL; in TestCase() local
47 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
48 p[i] = p0; in TestCase()
49 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
59 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
61 ICUNIT_GOTO_EQUAL(p0, p[i / 2], p0, EXIT); in TestCase()
63 ret = LOS_MemFree(g_memPool, p0); in TestCase()
DIt_los_mem_019.c39 void *p0 = NULL; in TestCase() local
45 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
46 p[i] = p0; in TestCase()
47 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
54 p0 = LOS_MemRealloc(g_memPool, p[0], size); in TestCase()
55 ICUNIT_GOTO_EQUAL(p0, p[0], p0, EXIT); in TestCase()
DIt_los_mem_018.c39 void *p0 = NULL; in TestCase() local
46 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
47 p[i] = p0; in TestCase()
48 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
55 …p0 = LOS_MemRealloc(g_memPool, p[0], size / 2); // 2, The reallocated memory size is half of its p… in TestCase()
56 ICUNIT_GOTO_EQUAL(p0, p[0], p0, EXIT); in TestCase()
DIt_los_mem_011.c40 void *p0 = NULL; in TestCase() local
44 ret = LOS_MemFree(NULL, p0); in TestCase()
47 ret = LOS_MemFree(g_memPool, p0); in TestCase()
50 p0 = (void *)((char *)g_memPool - 4); // 4, Get an illegal memory node address. in TestCase()
51 ret = LOS_MemFree(g_memPool, p0); in TestCase()
54 p0 = (void *)((char *)g_memPool + TEST_MEM_SIZE + 4); // 4, Get an illegal memory node address. in TestCase()
55 ret = LOS_MemFree(g_memPool, p0); in TestCase()
DIt_los_mem_007.c42 void *p0 = NULL; in TestCase() local
48 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
49 p[i] = p0; in TestCase()
50 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
60 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
61 ICUNIT_GOTO_EQUAL(p0, p[0], 0, EXIT); in TestCase()
DIt_los_mem_009.c42 void *p0 = NULL; in TestCase() local
47 for (p0 = LOS_MemAlloc(g_memPool, size); p0 != NULL; i++) { in TestCase()
48 p[i] = p0; in TestCase()
49 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
59 p0 = LOS_MemAlloc(g_memPool, size); in TestCase()
60 ICUNIT_GOTO_EQUAL(p0, p[i - 1], 0, EXIT); in TestCase()
/kernel/linux/linux-5.10/drivers/gpu/drm/omapdrm/
Dtcm.h52 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()
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()
257 area->p0.x <= area->p1.x)); in tcm_area_is_valid()
[all …]
/kernel/linux/linux-5.10/arch/nds32/lib/
Dmemmove.S25 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

123456