Searched refs:p0 (Results 1 - 25 of 138) sorted by relevance

123456

/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/
H A Dudivmodsi4.S28 p0 = cmp.gtu(r1,r0) define
34 if (p0) jumpr r31
39 p0 = cmp.eq(r6,#0) define
40 if (p0.new) r4 = #0
45 p0 = cmp.gtu(r2,r1) define
46 if (!p0.new) r1 = sub(r1,r2)
47 if (!p0.new) r0 = add(r0,r3)
51 p0 = cmp.gtu(r2,r1) define
52 if (!p0.new) r1 = sub(r1,r4)
53 if (!p0
[all...]
H A Ddivsi3.S26 p0 = cmp.ge(r0,#0) define
40 p1 = xor(p0,p1)
41 p0 = cmp.gtu(r2,r5) define
47 p1 = xor(p0,p1)
48 p0 = cmp.gtu(r2,r5) define
54 if (p0) jumpr r31
66 p0 = cmp.gtu(r2,r1) define
67 if (!p0.new) r1 = sub(r1,r2)
68 if (!p0.new) r0 = add(r0,r3)
72 p0 define
[all...]
H A Dfastmath_dlib_asm.S114 p0 = cmp.eq(manth, zerol) define
117 p0 = OR(p0, p1) define
118 if(p0.new) k = add(kl, #31)
125 p0 = cmp.eq(mantexpa, zero) define
135 p0 = OR(p0, p1) define
136 if( p0.new) manta = OR(manta,maxneg)
137 if(!p0.new) manta = OR(manta,exp)
142 p0 define
249 p0 = cmp.eq(manth, zerol) define
252 p0 = OR(p0, p1) define
260 p0 = cmp.eq(mantexpa, zero) define
270 p0 = OR(p0, p1) define
277 p0 = OR(p0, p1) define
366 p0 = cmp.eq(mantch, zero0l) define
370 p0 = or(p0, p1) define
380 p0 = cmp.eq(mantexpa, zero0) define
387 p0 = or(p0, p1) define
394 p0 = or(p0, p1) define
[all...]
H A Ddfmul.S68 p0 = dfclass(A,#2) define
69 p0 = dfclass(B,#2) define
97 if (!p0) jump .Lmul_abnormal
124 p0 = !cmp.gt(EXP0,BTMPH) define
125 p0 = cmp.gt(EXP0,BTMPL) define
126 if (!p0.new) jump:nt .Lmul_ovf_unf
149 p0 = cmp.eq(AL,#0) define
150 p0 = bitsclr(AH,BTMPL) define
151 if (!p0.new) jumpr:t r31
155 p0 define
166 p0 = dfcmp.eq(A,A) define
187 p0 = cmp.gt(EXP1,##BIAS+BIAS-2) // overflow define
191 p0 = cmp.gt(EXP1,#0) define
235 p0 = cmp.gtu(ONE,PP_LL) // Did we extract all zeros? define
250 p0 = dfcmp.eq(A,A) // realize exception define
275 p0 = !cmp.eq(TMP,#1) // If not round-to-zero and define
276 p0 = !cmp.eq(PP_LL_L,#2) // Not rounding the other way, define
278 p0 = dfcmp.eq(A,A) // Realize FP exception if enabled define
297 p0 = dfclass(A,#0x0f) // A not NaN? define
310 p0 = dfclass(A,#0x08) // A is infinity define
311 p0 = dfclass(B,#0x01) // B is zero define
328 p0 = bitsclr(AH,TMP) define
357 p0 = cmp.gt(BTMPH,#1) // Round towards pos/neg inf? define
362 p0 = cmp.eq(BTMPH,#3) // if rounding towards right inf define
378 p0 = dfcmp.uo(A,A) // force exception if enabled define
383 p0 = dfclass(B,#0x0f) // if B is not NaN define
[all...]
H A Dudivsi3.S27 p0 = cmp.gtu(r1,r0) define
33 if (p0) jumpr r31
42 p0 = cmp.gtu(r2,r1) define
43 if (!p0.new) r1 = sub(r1,r2)
44 if (!p0.new) r0 = add(r0,r3)
48 p0 = cmp.gtu(r2,r1) define
49 if (!p0.new) r0 = add(r0,r3)
H A Dmemcpy_likely_aligned.S24 p0 = bitsclr(r1,#7) define
25 p0 = bitsclr(r0,#7) define
26 if (p0.new) r5:4 = memd(r1)
30 if (!p0) jump .Lmemcpy_call
31 if (p0) memd(r0++#8) = r5:4
32 if (p0) r5:4 = memd(r1+#8)
H A Dmodsi3.S33 p0 = cmp.gtu(r1,r2) define
37 if (p0) jumpr r31
48 p0 = cmp.gtu(r2,r0) define
49 if (!p0.new) r0 = sub(r0,r2)
54 p0 = cmp.gtu(r2,r0) define
55 if (!p0.new) r0 = sub(r0,r1)
H A Dumodsi3.S27 p0 = cmp.gtu(r1,r0) define
31 if (p0) jumpr r31
41 p0 = cmp.gtu(r2,r0) define
42 if (!p0.new) r0 = sub(r0,r2)
47 p0 = cmp.gtu(r2,r0) define
48 if (!p0.new) r0 = sub(r0,r1)
H A Ddfaddsub.S136 p0 = cmp.gtu(EXPA,ZTMPH) // must be pretty high in case of large cancellation define
137 p0 = !cmp.gtu(EXPA,ZTMPL) define
138 if (!p0.new) jump:nt .Ladd_ovf_unf
143 p0 = cmp.eq(ATMPH,#0) define
144 p0 = cmp.eq(ATMPL,#0) define
145 if (p0.new) jump:nt .Ladd_zero // or maybe conversion handles zero case correctly?
173 p0 = cmp.eq(TMP,#2) define
174 if (p0.new) AH = xor(AH,BH)
194 p0 = cmp.eq(ATMPH,#0) define
195 p0 define
207 p0 = cmp.gt(EXPB,##BIAS+BIAS-2) define
211 p0 = cmp.gt(EXPB,#0) define
245 p0 = !cmp.eq(TMP,#1) // If not round-to-zero and define
246 p0 = !cmp.eq(EXPB,#2) // Not rounding the other way, define
253 p0 = dfcmp.eq(A,A) define
269 p0 = dfclass(A,#0x0f) // A not NaN? define
287 p0 = dfclass(A,#4) define
315 p0 = cmp.gt(AH,#-1) define
327 p0 = cmp.gt(ATMPH,#-1) define
337 p0 = dfcmp.eq(A,B) define
347 p0 = dfclass(B,#0x0f) // if B is not NaN define
358 p0 = dfcmp.eq(ATMP,A) // is A also zero? define
367 p0 = cmp.eq(A,B) define
378 p0 = cmp.eq(TMP,#2) define
385 p0 = !cmp.eq(AH,BH) // Do they have different signs define
386 p0 = dfclass(B,#8) // And is B also infinite? define
[all...]
H A Ddffma.S58 #define P_TMP p0
335 p0 = cmp.eq(TMP,#2) define
336 if (p0.new) AH = ##0x80000000
349 p0 = cmp.gtu(ONE,CTMP) define
350 if (p0.new) jump:nt .Ladd_yields_zero
387 p0 = cmp.gt(EXPA,##BIAS+BIAS) define
388 if (p0.new) jump:nt .Lfma_ovf
391 p0 = cmp.gt(EXPA,#0) define
392 if (p0.new) jump:nt .Lpossible_unf
421 p0 define
449 p0 = cmp.eq(AL,#0) define
450 p0 = bitsclr(AH,TMP) define
455 p0 = bitsset(ATMPH,TMP) define
466 p0 = dfcmp.eq(A,A) define
486 p0 = !cmp.eq(BL,#1) define
487 p0 = !cmp.eq(BH,#2) define
490 p0 = dfcmp.eq(ATMP,ATMP) define
523 p0 = dfclass(A,#0x0f) // A NaN? define
533 p0 = dfclass(A,#0x08) // a is inf define
534 p0 = dfclass(B,#0x01) // b is zero define
551 p0 = bitsclr(AH,TMP) define
577 p0 = dfclass(C,#0x10) define
594 p0 = dfcmp.eq(A,C) define
603 p0 = dfclass(B,#0x10) define
630 p0 = dfclass(C,#0x10) define
635 p0 = dfcmp.eq(B,C) // is C also zero? define
646 p0 = cmp.eq(B,C) // yes, scalar equals. +0++0 or -0+-0 define
658 p0 = cmp.eq(TMP,#2) define
671 p0 = dfclass(C,#0x10) // is C NaN? define
677 p0 = dfclass(C,#0x08) // is C inf? define
684 p0 = dfclass(C,#0x01) // is C zero? define
[all...]
H A Ddivdi3.S49 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend define
53 if (p0) jump .hexagon_divdi3_return // if divisor > dividend, we're done, so return
58 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder define
65 r1:0 = vmux(p0, r1:0, r9:8) // choose either current quotient or new quotient (r9:8)
66 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Dmoddi3.S47 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend define
51 if (p0) jump .hexagon_moddi3_return // if divisor > dividend, we're done, so return
56 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder define
63 r1:0 = vmux(p0, r1:0, r9:8) // choose either current quotient or new quotient (r9:8)
64 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Dudivdi3.S41 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend define
45 if (p0) jumpr r31 // if divisor > dividend, we're done, so return
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder define
57 r1:0 = vmux(p0, r1:0, r9:8) // choose either current quotient or new quotient (r9:8)
58 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Dudivmoddi4.S41 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend define
45 if (p0) jumpr r31 // if divisor > dividend, we're done, so return
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder define
57 r1:0 = vmux(p0, r1:0, r9:8) // choose either current quotient or new quotient (r9:8)
58 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Dumoddi3.S41 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend define
45 if (p0) jump .hexagon_umoddi3_return // if divisor > dividend, we're done, so return
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder define
57 r1:0 = vmux(p0, r1:0, r9:8) // choose either current quotient or new quotient (r9:8)
58 r3:2 = vmux(p0, r3:2, r7:6) // choose either current remainder or new remainder (r7:6)
H A Ddfminmax.S40 p0 = dfclass(A,#0x10) // If A is a number define
45 if (p0) A = B // if A is NaN use B
60 p0 = dfclass(A,#0x10) define
65 if (p0) A = B
/freebsd-11-stable/contrib/libarchive/tar/test/
H A Dtest_option_r.c34 char *p0, *p1; local
40 p0 = NULL;
52 p0 = slurpfile(&s, "archive.tar");
53 if (!assert(p0 != NULL))
57 assertEqualMem(p0 + 0, "f1", 3);
58 assertEqualMem(p0 + 512, "abc", 3);
59 assertEqualMem(p0 + 1024, "\0\0\0\0\0\0\0\0", 8);
60 assertEqualMem(p0 + 1536, "\0\0\0\0\0\0\0\0", 8);
85 assertEqualMem(p0, p1, 1024);
93 free(p0);
[all...]
H A Dtest_option_C_mtree.c33 char *p0; local
36 p0 = NULL;
75 p0 = slurpfile(&s, "output.tar");
76 if (!assert(p0 != NULL))
80 assertEqualMem(p0 + 0, "./foo", 5);
81 assertEqualMem(p0 + 512, "abc", 3);
82 assertEqualMem(p0 + 1024, "\0\0\0\0\0\0\0\0", 8);
83 assertEqualMem(p0 + 1536, "\0\0\0\0\0\0\0\0", 8);
85 free(p0);
/freebsd-11-stable/contrib/netbsd-tests/lib/csu/arch/ia64/
H A Dh_initfini_align.S24 cmp.eq p1, p0 = 0, loc1
25 (p0) mov ret0 = 0
34 (p1) cmp.eq p1, p0 = 0, loc1
35 (p0) mov ret0 = 0
/freebsd-11-stable/sys/dev/adlink/
H A Dadlink.c109 struct page0 *p0; member in struct:softc
141 sc->sample += sc->p0->chunksize / 2;
147 sc->p0->state = EIO;
149 if (sc->p0->state != STATE_RUN) {
150 printf("adlink: stopping %d\n", sc->p0->state);
158 bus_write_4(sc->res[0], 0x28, sc->p0->chunksize);
176 *paddr = vtophys(sc->p0);
182 if (offset - o >= sc->p0->chunksize) {
183 o += sc->p0->chunksize;
206 if (sc->p0
[all...]
/freebsd-11-stable/lib/msun/tests/
H A Dlrint_test.c89 test(lrint, 0x7fffffff.8p0, IGNORE, FE_INVALID);
90 test(lrint, -0x80000000.4p0, -0x80000000l, FE_INEXACT);
93 test(lrint, -0x80000000.8p0, IGNORE, FE_INVALID);
94 test(lrint, 0x80000000.0p0, IGNORE, FE_INVALID);
95 test(lrint, 0x7fffffff.4p0, 0x7fffffffl, FE_INEXACT);
100 test(lrint, 0x7fffffff.8p0, 0x7fffffffl, FE_INEXACT);
101 test(lrint, -0x80000000.8p0, -0x80000000l, FE_INEXACT);
102 test(lrint, 0x80000000.0p0, IGNORE, FE_INVALID);
107 test(lrint, 0x8000000000000000.0p0, IGNORE, FE_INVALID);
109 test(lrint, 0x7ffffffffffffc00.0p0,
[all...]
H A Dlround_test.c79 test(lround, 0x7fffffff.8p0, IGNORE, FE_INVALID);
80 test(lround, -0x80000000.8p0, IGNORE, FE_INVALID);
81 test(lround, 0x80000000.0p0, IGNORE, FE_INVALID);
82 test(lround, 0x7fffffff.4p0, 0x7fffffffl, FE_INEXACT);
83 test(lround, -0x80000000.4p0, -0x80000000l, FE_INEXACT);
87 test(lround, 0x8000000000000000.0p0, IGNORE, FE_INVALID);
89 test(lround, 0x7ffffffffffffc00.0p0, 0x7ffffffffffffc00l, 0);
91 test(lround, -0x8000000000000800.0p0, IGNORE, FE_INVALID);
93 test(lround, -0x8000000000000000.0p0, -0x8000000000000000l, 0);
100 test(llround, 0x8000000000000000.0p0, IGNOR
[all...]
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_endian.h70 unsigned int p0 = p[0]; local
72 return ((p0 << 8) | p1);
86 unsigned int p0 = p[0]; local
88 return ((p0 << 24) | (p1 << 16) | (p2 << 8) | p3);
108 unsigned int p0 = p[0]; local
110 return ((p1 << 8) | p0);
124 unsigned int p0 = p[0]; local
126 return ((p3 << 24) | (p2 << 16) | (p1 << 8) | p0);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64LegalizerInfo.cpp35 const LLT p0 = LLT::pointer(0, 64); local
53 const LLT v2p0 = LLT::vector(2, p0);
62 .legalFor({p0, s1, s8, s16, s32, s64, v2s32, v4s32, v2s64})
79 .legalFor({p0, s16, s32, s64, v2s32, v4s32, v2s64})
108 .legalFor({{p0, s64}})
111 getActionDefinitionsBuilder(G_PTR_MASK).legalFor({p0});
190 if (Ty0 != s32 && Ty0 != s64 && Ty0 != p0)
210 if (Ty1 == p0)
222 .legalForTypesWithMemDesc({{s32, p0, 8, 8},
223 {s32, p0, 1
[all...]
/freebsd-11-stable/share/doc/psd/04.uprog/
H A DMakefile5 SRCS= p.mac p0 p1 p2 p3 p4 p5 p6 p8 p9

Completed in 124 milliseconds

123456