/freebsd-current/contrib/llvm-project/llvm/lib/Target/M68k/GISel/ |
H A D | M68kLegalizerInfo.cpp | 27 const LLT p0 = LLT::pointer(0, 32); local 35 .legalFor({s32, p0}) 38 getActionDefinitionsBuilder({G_FRAME_INDEX, G_GLOBAL_VALUE}).legalFor({p0}); 41 .legalForTypesWithMemDesc({{s32, p0, s32, 4}, 42 {s32, p0, s16, 4}, 43 {s32, p0, s8, 4}, 44 {s16, p0, s16, 2}, 45 {s8, p0, s8, 1}, 46 {p0, p0, s3 [all...] |
/freebsd-current/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/ |
H A D | udivmodsi4.S | 28 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 D | divsi3.S | 26 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 D | fastmath_dlib_asm.S | 114 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 D | dfmul.S | 68 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 D | udivsi3.S | 27 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 D | memcpy_likely_aligned.S | 24 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 D | modsi3.S | 33 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 D | umodsi3.S | 27 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 D | dfaddsub.S | 136 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 D | dffma.S | 58 #define P_TMP p0 333 p0 = cmp.eq(TMP,#2) define 334 if (p0.new) AH = ##0x80000000 347 p0 = cmp.gtu(ONE,CTMP) define 348 if (p0.new) jump:nt .Ladd_yields_zero 385 p0 = cmp.gt(EXPA,##BIAS+BIAS) define 386 if (p0.new) jump:nt .Lfma_ovf 389 p0 = cmp.gt(EXPA,#0) define 390 if (p0.new) jump:nt .Lpossible_unf 419 p0 define 447 p0 = cmp.eq(AL,#0) define 448 p0 = bitsclr(AH,TMP) define 453 p0 = bitsset(ATMPH,TMP) define 464 p0 = dfcmp.eq(A,A) define 484 p0 = !cmp.eq(BL,#1) define 485 p0 = !cmp.eq(BH,#2) define 488 p0 = dfcmp.eq(ATMP,ATMP) define 521 p0 = dfclass(A,#0x0f) // A NaN? define 531 p0 = dfclass(A,#0x08) // a is inf define 532 p0 = dfclass(B,#0x01) // b is zero define 549 p0 = bitsclr(AH,TMP) define 575 p0 = dfclass(C,#0x10) define 592 p0 = dfcmp.eq(A,C) define 601 p0 = dfclass(B,#0x10) define 628 p0 = dfclass(C,#0x10) define 633 p0 = dfcmp.eq(B,C) // is C also zero? define 644 p0 = cmp.eq(B,C) // yes, scalar equals. +0++0 or -0+-0 define 656 p0 = cmp.eq(TMP,#2) define 669 p0 = dfclass(C,#0x10) // is C NaN? define 675 p0 = dfclass(C,#0x08) // is C inf? define 682 p0 = dfclass(C,#0x01) // is C zero? define [all...] |
H A D | divdi3.S | 49 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)
|
/freebsd-current/contrib/libarchive/tar/test/ |
H A D | test_option_r.c | 33 char *p0, *p1; local 39 p0 = NULL; 51 p0 = slurpfile(&s, "archive.tar"); 52 if (!assert(p0 != NULL)) 56 assertEqualMem(p0 + 0, "f1", 3); 57 assertEqualMem(p0 + 512, "abc", 3); 58 assertEqualMem(p0 + 1024, "\0\0\0\0\0\0\0\0", 8); 59 assertEqualMem(p0 + 1536, "\0\0\0\0\0\0\0\0", 8); 84 assertEqualMem(p0, p1, 1024); 92 free(p0); [all...] |
H A D | test_option_C_mtree.c | 32 char *p0; local 35 p0 = NULL; 74 p0 = slurpfile(&s, "output.tar"); 75 if (!assert(p0 != NULL)) 79 assertEqualMem(p0 + 0, "./foo", 5); 80 assertEqualMem(p0 + 512, "abc", 3); 81 assertEqualMem(p0 + 1024, "\0\0\0\0\0\0\0\0", 8); 82 assertEqualMem(p0 + 1536, "\0\0\0\0\0\0\0\0", 8); 84 free(p0);
|
/freebsd-current/contrib/netbsd-tests/lib/csu/arch/ia64/ |
H A D | h_initfini_align.S | 24 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-current/contrib/arm-optimized-routines/string/aarch64/ |
H A D | strnlen-sve.S | 26 0: ldff1b z0.b, p0/z, [x0, x2] 27 rdffrs p1.b, p0/z 32 cmpeq p2.b, p0/z, z0.b, 0 36 1: whilelo p0.b, x2, x1 42 ldff1b z0.b, p0/z, [x0, x2] 43 rdffrs p1.b, p0/z 49 cmpeq p2.b, p0/z, z0.b, 0 52 8: brkb p2.b, p0/z, p2.b
|
H A D | memcmp-sve.S | 23 0: whilelo p0.b, x3, x2 /* while off < max */ 26 ld1b z0.b, p0/z, [x0, x3] /* read vectors bounded by max. */ 27 ld1b z1.b, p0/z, [x1, x3] 34 cmpne p1.b, p0/z, z0.b, z1.b /* while no inequalities */ 38 1: brkb p1.b, p0/z, p1.b /* find first such */
|
H A D | strlen-sve.S | 26 rdffrs p0.b, p2/z 37 1: brkb p0.b, p2/z, p1.b 38 incp x1, p0.b 44 2: cmpeq p1.b, p0/z, z0.b, 0 49 incp x1, p0.b
|
H A D | strcpy-sve.S | 34 rdffrs p0.b, p2/z 49 1: cmpeq p1.b, p0/z, z0.b, 0 /* search for zeros */ 54 st1b z0.b, p0, [x0, x2] 55 incp x2, p0.b 59 2: brka p0.b, p2/z, p1.b 60 st1b z0.b, p0, [x0, x2] 64 incp x0, p0.b
|
H A D | strncmp-sve.S | 24 0: whilelo p0.b, x3, x2 /* while off < max */ 27 ldff1b z0.b, p0/z, [x0, x3] 28 ldff1b z1.b, p0/z, [x1, x3] 29 rdffrs p1.b, p0/z 38 cmpeq p1.b, p0/z, z0.b, z1.b /* compare strings */ 39 cmpne p2.b, p0/z, z0.b, 0 /* search for ~zero */ 40 nands p2.b, p0/z, p1.b, p2.b /* ~(eq & ~zero) -> ne | zero */ 44 1: brkb p2.b, p0/z, p2.b /* find first such */
|
/freebsd-current/contrib/googletest/googlemock/include/gmock/ |
H A D | gmock-more-actions.h | 204 #define GMOCK_INTERNAL_DECL_TYPE_AND_1_VALUE_PARAMS(p0) , typename p0##_type 205 #define GMOCK_INTERNAL_DECL_TYPE_AND_2_VALUE_PARAMS(p0, p1) \ 206 , typename p0##_type, typename p1##_type 207 #define GMOCK_INTERNAL_DECL_TYPE_AND_3_VALUE_PARAMS(p0, p1, p2) \ 208 , typename p0##_type, typename p1##_type, typename p2##_type 209 #define GMOCK_INTERNAL_DECL_TYPE_AND_4_VALUE_PARAMS(p0, p1, p2, p3) \ 210 , typename p0##_type, typename p1##_type, typename p2##_type, \ 212 #define GMOCK_INTERNAL_DECL_TYPE_AND_5_VALUE_PARAMS(p0, p1, p2, p3, p4) \ 213 , typename p0##_typ [all...] |
/freebsd-current/sys/dev/adlink/ |
H A D | adlink.c | 109 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-current/lib/msun/tests/ |
H A D | lrint_test.c | 86 test(lrint, 0x7fffffff.8p0, IGNORE, FE_INVALID); 87 test(lrint, -0x80000000.4p0, (long)-0x80000000l, FE_INEXACT); 90 test(lrint, -0x80000000.8p0, IGNORE, FE_INVALID); 91 test(lrint, 0x80000000.0p0, IGNORE, FE_INVALID); 92 test(lrint, 0x7fffffff.4p0, 0x7fffffffl, FE_INEXACT); 97 test(lrint, 0x7fffffff.8p0, 0x7fffffffl, FE_INEXACT); 98 test(lrint, -0x80000000.8p0, -0x80000000l, FE_INEXACT); 99 test(lrint, 0x80000000.0p0, IGNORE, FE_INVALID); 104 test(lrint, 0x8000000000000000.0p0, IGNORE, FE_INVALID); 106 test(lrint, 0x7ffffffffffffc00.0p0, [all...] |
H A D | lround_test.c | 79 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, (long)-0x8000000000000000l, 0); 100 test(llround, 0x8000000000000000.0p0, IGNOR [all...] |
/freebsd-current/contrib/llvm-project/llvm/lib/Target/X86/GISel/ |
H A D | X86LegalizerInfo.cpp | 43 const LLT p0 = LLT::pointer(0, TM.getPointerSizeInBits(0)); local 60 const LLT v2p0 = LLT::fixed_vector(2, p0); 66 const LLT v4p0 = LLT::fixed_vector(4, p0); 81 return typeInSet(0, {p0, s1, s8, s16, s32, s64})(Query) || 87 return typeInSet(0, {p0, s8, s16, s32})(Query) || 254 const std::initializer_list<LLT> IntTypes32 = {s8, s16, s32, p0}; 255 const std::initializer_list<LLT> IntTypes64 = {s8, s16, s32, s64, p0}; 308 return typeInSet(0, {s8, s16, s32, p0})(Query) || 334 .legalForCartesianProduct(Is64Bit ? PtrTypes64 : PtrTypes32, {p0}) 338 getActionDefinitionsBuilder(G_INTTOPTR).legalFor({{p0, sMaxScala [all...] |