/freebsd-11-stable/crypto/openssl/crypto/sha/asm/ |
H A D | sha512-mips.pl | 126 my ($T1,$tmp0,$tmp1,$tmp2)=(@X[4],@X[5],@X[6],@X[7]); 177 $ADDU $T1,$X[0],$h 187 $ADDU $T1,$tmp2 191 $ADDU $T1,$tmp0 196 $ADDU $T1,$X[0],$h # $i 213 $ADDU $T1,$tmp2 216 $ADDU $T1,$tmp0 232 $ADDU $T1,$tmp2 # +=K[$i] 234 $ADDU $d,$T1 235 $ADDU $h,$T1 [all...] |
H A D | sha256-armv4.pl | 46 $T1="r3"; $t3="r3"; 282 my ($T0,$T1,$T2,$T3,$T4,$T5)=("q8","q9","q10","q11","d24","d25"); 306 &vext_8 ($T1,@X[2],@X[3],4); # X[9..12] 313 &vadd_i32 (@X[0],@X[0],$T1); # X[0..3] += X[9..12] 316 &vshr_u32 ($T1,$T0,$sigma0[2]); 325 &veor ($T1,$T1,$T2); 334 &veor ($T1,$T1,$T3); # sigma0(X[1..4]) 343 &vadd_i32 (@X[0],@X[0],$T1); # [all...] |
H A D | sha512-armv8.pl | 67 my ($T0,$T1,$T2)=(@X[($i-8)&15],@X[($i-9)&15],@X[($i-10)&15]); 122 ror $T1,@X[($j+1)&15],#$sigma0[0] 129 eor $T1,$T1,@X[($j+1)&15],ror#$sigma0[1] 137 eor $T1,$T1,@X[($j+1)&15],lsr#$sigma0[2] // sigma0(X[i+1]) 146 add @X[$j],@X[$j],$T1
|
H A D | sha512-x86_64.pl | 143 ($T1,$a0,$a1,$a2,$a3)=("%r12","%r13","%r14","%r15","%rdi"); 155 ($T1,$a0,$a1,$a2,$a3)=("%r12d","%r13d","%r14d","%r15d","%edi"); 187 mov $T1,`$SZ*($i&0xf)`(%rsp) 192 add $h,$T1 # T1+=h 197 add $a2,$T1 # T1+=Ch(e,f,g) 200 add ($Tbl),$T1 # T1+=K[round] 209 add $a0,$T1 # T [all...] |
H A D | sha512-armv4.pl | 473 my ($t0,$t1,$t2,$T1,$K,$Ch,$Maj)=map("d$_",(24..31)); # temps 499 vadd.i64 $T1,$Ch,$h 502 vadd.i64 $T1,$t2 509 vadd.i64 $T1,$K 512 vadd.i64 $d,$T1 513 vadd.i64 $Maj,$T1
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Sparc/ |
H A D | SparcISelDAGToDAG.cpp | 249 SDValue T1 = CurDAG->getCopyToReg(Sub1, dl, Reg1, Sub1, T0.getValue(1)); local 253 Ops.push_back(T1.getValue(1)); 264 SDValue T1 = CurDAG->getCopyFromReg(Chain, dl, Reg1, MVT::i32, local 274 T1, 283 Chain = CurDAG->getCopyToReg(T1, dl, GPVR, Pair, T1.getValue(1));
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/RPC/ |
H A D | RPCSerialization.h | 141 template <typename T1, typename T2> 142 class RPCTypeName<std::pair<T1, T2>> { 147 raw_string_ostream(Name) << "std::pair<" << RPCTypeNameSequence<T1, T2>() 478 /// SerializationTraits for Expected<T1> from an Expected<T2>. 479 template <typename ChannelT, typename T1, typename T2> 480 class SerializationTraits<ChannelT, Expected<T1>, Expected<T2>> { 487 return SerializationTraits<ChannelT, T1, T2>::serialize(C, *ValOrErr); 500 return SerializationTraits<ChannelT, T1, T2>::deserialize(C, *ValOrErr); 509 /// SerializationTraits for Expected<T1> from a T2. 510 template <typename ChannelT, typename T1, typenam [all...] |
/freebsd-11-stable/sys/crypto/skein/ |
H A D | skein.h | 233 #define Skein_Set_T1(ctxPtr,T1) Skein_Set_Tweak(ctxPtr,1,T1) 236 #define Skein_Set_T0_T1(ctxPtr,T0,T1) \ 239 Skein_Set_T1(ctxPtr,(T1)); \
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | PointerUnion.h | 35 /// using Ret = typename PointerUnionTypeSelector<T1, T2, EQ, NE>::Return; 38 /// Ret will be EQ type if T1 is same as T2 or NE type otherwise. 39 template <typename T1, typename T2, typename RET_EQ, typename RET_NE> 49 template <typename T1, typename T2, typename RET_EQ, typename RET_NE> 51 PointerUnionTypeSelector<T1, T2, RET_EQ, RET_NE>> { 53 typename PointerUnionTypeSelector<T1, T2, RET_EQ, RET_NE>::Return;
|
H A D | iterator.h | 337 typename T1 = typename std::remove_reference<decltype(**std::declval<WrappedIteratorT>())>::type, 338 typename T2 = typename std::add_pointer<T1>::type> 339 using raw_pointer_iterator = pointer_iterator<pointee_iterator<WrappedIteratorT, T1>, T2>;
|
H A D | FoldingSet.h | 750 template <typename T1, typename T2> 751 struct FoldingSetTrait<std::pair<T1, T2>> { 752 static inline void Profile(const std::pair<T1, T2> &P,
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | PatternMatch.h | 1207 template <typename T0, typename T1, unsigned Opcode> struct TwoOps_match { 1209 T1 Op2; 1211 TwoOps_match(const T0 &Op1, const T1 &Op2) : Op1(Op1), Op2(Op2) {} 1223 template <typename T0, typename T1, typename T2, unsigned Opcode> 1226 T1 Op2; 1229 ThreeOps_match(const T0 &Op1, const T1 &Op2, const T2 &Op3) 1736 template <typename T0 = void, typename T1 = void, typename T2 = void, 1744 template <typename T0, typename T1> struct m_Intrinsic_Ty<T0, T1> { 1746 match_combine_and<typename m_Intrinsic_Ty<T0>::Ty, Argument_match<T1>>; [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.cpp | 331 static bool TypesAreContradictory(MVT::SimpleValueType T1, 335 if (T1 == T2) return false; 339 if (T1 == MVT::iPTR) 343 return !MVT(T1).isInteger() || MVT(T1).isVector();
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/ |
H A D | MallocOverflowSecurityChecker.cpp | 148 template <typename T1> 149 void Erase(const T1 *DR, 152 if (const auto *CheckDR = dyn_cast<T1>(Check.variable))
|
/freebsd-11-stable/crypto/openssh/ |
H A D | blocks.c | 71 T1 = h + Sigma1(e) + Ch(e,f,g) + k + w; \ 76 e = d + T1; \ 80 a = T1 + T2; 93 uint64 T1; local
|
/freebsd-11-stable/lib/msun/ld80/ |
H A D | s_expl.c | 125 * Our T1 and T2 are chosen to be approximately the points where method 126 * A and method B have the same accuracy. Tang's T1 and T2 are the 135 T1 = -0.1659, /* ~-30.625/128 * log(2) */ variable 196 if (T1 < x && x < T2) {
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/ |
H A D | CloneDetection.h | 194 template <typename T1, typename... Ts> 195 static void constrainClones(std::vector<CloneGroup> &CloneGroups, T1 C,
|
/freebsd-11-stable/sbin/iscontrol/ |
H A D | fsm.c | 62 T1 = 1, enumerator in enum:__anon4803 197 return T1; 214 return T1; 218 return T1; 647 | T8 | |T1 | | | 704 case T1: state = S2; break;
|
/freebsd-11-stable/crypto/openssl/crypto/ec/asm/ |
H A D | ecp_nistz256-avx2.pl | 157 $T0,$T1,$T2,$T3, $T4,$T5,$T6,$T7)=map("%ymm$_",(0..15)); 194 vpunpcklqdq $X3, $X2, $T1 # T1 = [D2 C2 D0 C0] 203 vperm2i128 \$0x20, $T1, $T0, $X0 # X0 = [D0 C0 B0 A0] 205 vperm2i128 \$0x31, $T1, $T0, $X2 # X2 = [D2 C2 B2 A2] 216 vpand $T7, $X0, $T1 # out[1] = (in[0] >> shift) & mask; 239 vmovdqa $T1, 32*1(%rdi) 251 vpand $T7, $Y0, $T1 # out[1] = (in[0] >> shift) & mask; 273 vmovdqa $T1, 32*10-448(%rax) 308 my ($T0,$T1, [all...] |
/freebsd-11-stable/lib/msun/ld128/ |
H A D | s_expl.c | 106 * Our T1 and T2 are chosen to be approximately the points where method 107 * A and method B have the same accuracy. Tang's T1 and T2 are the 115 * Split the interval [T1, T2] into two intervals [T1, T3] and [T3, T2]. 118 * into the [T1, T3] interval. 127 T1 = -0.1659, /* ~-30.625/128 * log(2) */ variable 235 if (T1 < x && x < T2) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | Error.h | 434 template <class T1> friend class ExpectedAsOutParameter; 584 template <class T1> 585 static bool compareThisIfSameType(const T1 &a, const T1 &b) { 589 template <class T1, class T2> 590 static bool compareThisIfSameType(const T1 &a, const T2 &b) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | IRBuilder.cpp | 584 template <typename T0, typename T1, typename T2, typename T3> 588 ArrayRef<T1> TransitionArgs, ArrayRef<T2> DeoptArgs, 606 template <typename T0, typename T1, typename T2, typename T3> 610 ArrayRef<T1> TransitionArgs, ArrayRef<T2> DeoptArgs, ArrayRef<T3> GCArgs, 657 template <typename T0, typename T1, typename T2, typename T3> 661 uint32_t Flags, ArrayRef<T0> InvokeArgs, ArrayRef<T1> TransitionArgs,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | Analysis.cpp | 255 static bool isNoopBitcast(Type *T1, Type *T2, argument 257 return T1 == T2 || (T1->isPointerTy() && T2->isPointerTy()) || 258 (isa<VectorType>(T1) && isa<VectorType>(T2) && 259 TLI.isTypeLegal(EVT::getEVT(T1)) && TLI.isTypeLegal(EVT::getEVT(T2)));
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MC/ |
H A D | MCELFStreamer.cpp | 173 // used in the object file. The greater of T1 and T2 is selected based on the 176 // If neither T1 < T2 nor T2 < T1 according to this ordering, use T2 (the user 178 static unsigned CombineSymbolTypes(unsigned T1, unsigned T2) { argument 181 if (T1 == Type) 184 return T1;
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | ASTContext.h | 2320 /// Determine whether the given types \p T1 and \p T2 are equivalent. 2321 bool hasSameType(QualType T1, QualType T2) const { argument 2322 return getCanonicalType(T1) == getCanonicalType(T2); 2324 bool hasSameType(const Type *T1, const Type *T2) const { argument 2325 return getCanonicalType(T1) == getCanonicalType(T2); 2345 bool hasSameUnqualifiedType(QualType T1, QualType T2) const { argument 2346 return getCanonicalType(T1).getTypePtr() == 2383 bool UnwrapSimilarTypes(QualType &T1, QualType &T2); 2384 bool UnwrapSimilarArrayTypes(QualType &T1, QualType &T2); 2393 bool hasSimilarType(QualType T1, QualTyp [all...] |