Searched refs:gtu (Results 1 - 19 of 19) sorted by relevance

/freebsd-11-stable/contrib/groff/src/libs/libgroff/
H A Dglyphuni.cpp494 glyph_to_unicode *gtu = new glyph_to_unicode[1]; local
495 gtu->value = (char *)glyph_to_unicode_list[i].value;
496 glyph_to_unicode_table.define(glyph_to_unicode_list[i].key, gtu);
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/builtins/hexagon/
H A Ddivsi3.S35 p2 = cmp.gtu(r2,r1)
41 p0 = cmp.gtu(r2,r5)
48 p0 = cmp.gtu(r2,r5)
66 p0 = cmp.gtu(r2,r1)
72 p0 = cmp.gtu(r2,r1)
H A Dmodsi3.S33 p0 = cmp.gtu(r1,r2)
48 p0 = cmp.gtu(r2,r0)
54 p0 = cmp.gtu(r2,r0)
H A Dudivmodsi4.S28 p0 = cmp.gtu(r1,r0)
45 p0 = cmp.gtu(r2,r1)
51 p0 = cmp.gtu(r2,r1)
H A Dudivsi3.S27 p0 = cmp.gtu(r1,r0)
42 p0 = cmp.gtu(r2,r1)
48 p0 = cmp.gtu(r2,r1)
H A Dumodsi3.S27 p0 = cmp.gtu(r1,r0)
41 p0 = cmp.gtu(r2,r0)
47 p0 = cmp.gtu(r2,r0)
H A Ddivdi3.S49 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend
58 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
H A Dmoddi3.S47 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend
56 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
H A Dudivdi3.S41 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
H A Dudivmoddi4.S41 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
H A Dumoddi3.S41 p0 = cmp.gtu(r5:4,r3:2) // check if divisor > dividend
50 p0 = cmp.gtu(r13:12,r3:2) // set predicate reg if shifted divisor > current remainder
H A Ddffma.S255 P_CARRY = cmp.gtu(STICKIES,ZERO) // If we have sticky bits from C shift
301 EXACT = cmp.gtu(ONE,STICKIES)
313 P_TMP = cmp.gtu(ONE,CTMP) // is result true zero?
349 p0 = cmp.gtu(ONE,CTMP)
421 p0 = cmp.gtu(ONE,B)
518 p3 = cmp.gtu(ATMP,BTMP)
H A Ddfaddsub.S87 BIGB = cmp.gtu(EXPB,EXPA) // Is B substantially greater than A?
136 p0 = cmp.gtu(EXPA,ZTMPH) // must be pretty high in case of large cancellation
137 p0 = !cmp.gtu(EXPA,ZTMPL)
263 p3 = cmp.gtu(ATMP,BTMP)
H A Ddfmul.S235 p0 = cmp.gtu(ONE,PP_LL) // Did we extract all zeros?
291 p3 = cmp.gtu(ATMP,BTMP)
H A Ddfdiv.S182 P_TMP = cmp.gtu(DENOM,REM)
265 P_TMP = cmp.gtu(B,TMPPAIR)
H A Ddfsqrt.S120 P_EXP1 = cmp.gtu(SHIFTAMT,#0)
/freebsd-11-stable/crypto/openssl/crypto/bn/asm/
H A Dia64-mont.pl323 (p33) cmp.gtu p34,p32=n[1],t[1] // (p17)
765 { .mmi; cmp.gtu p34,p32=n1,t0;;
769 { .mii; (p32)cmp.gtu p35,p33=n2,t[7]
774 (p33)cmp.gtu p34,p32=n3,t[6]
779 (p32)cmp.gtu p35,p33=n4,t[5] }
784 { .mii; (p33)cmp.gtu p34,p32=n5,t[4]
789 (p32)cmp.gtu p35,p33=n6,t[3]
794 (p33)cmp.gtu p34,p32=n7,t[2] }
799 { .mii; (p32)cmp.gtu p35,p33=n8,t[1]
804 (p33)cmp.gtu p3
[all...]
H A Dia64.S251 (p19) cmp.gtu.unc p56,p0=r40,r38 }
/freebsd-11-stable/crypto/openssl/crypto/rc4/asm/
H A Drc4-ia64.pl581 cmp.gtu pSmall, p0 = $threshold, DataLen

Completed in 188 milliseconds