Searched refs:Fast (Results 26 - 36 of 36) sorted by relevance
12
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAG.cpp | 3563 bool Fast; local
3566 TLI.allowsUnalignedMemoryAccesses(VT, &Fast) && Fast)
|
| H A D | LegalizeDAG.cpp | 2314 SDValue Fast = DAG.getNode(ISD::SINT_TO_FP, dl, MVT::f32, Op0);
2332 return DAG.getNode(ISD::SELECT, dl, MVT::f32, SignBitTest, Slow, Fast);
|
| H A D | DAGCombiner.cpp | 5979 if ((DAG.getTarget().Options.AllowFPOpFusion == FPOpFusion::Fast ||
6057 if ((DAG.getTarget().Options.AllowFPOpFusion == FPOpFusion::Fast ||
|
| /external/llvm/lib/IR/ |
| H A D | AsmWriter.cpp | 72 case CallingConv::Fast: Out << "fastcc"; break;
1206 // Fast path: Don't construct and populate a TypePrinting object if we
|
| H A D | Verifier.cpp | 854 case CallingConv::Fast:
|
| /external/llvm/lib/Target/CppBackend/ |
| H A D | CPPBackend.cpp | 271 case CallingConv::Fast: Out << "CallingConv::Fast"; break;
|
| /external/llvm/lib/Target/X86/ |
| H A D | X86FrameLowering.cpp | 1411 CallingConvention == CallingConv::Fast) {
|
| H A D | X86ISelLowering.cpp | 1473 X86TargetLowering::allowsUnalignedMemoryAccesses(EVT VT, bool *Fast) const {
1474 if (Fast)
1475 *Fast = Subtarget->isUnalignedMemAccessFast();
1820 // C & StdCall & Fast Calling Convention implementation
1826 // For info on fast calling convention see Fast Calling Convention (tail call)
1882 return (CC == CallingConv::Fast || CC == CallingConv::GHC ||
2711 // Fast Calling Convention (tail call) implementation
3180 case CallingConv::Fast:
11143 case CallingConv::Fast:
|
| /external/dropbear/libtommath/ |
| H A D | bn.tex | 291 that is very flexible, complete and performs well in resource contrained environments. Fast RSA for example can
|
| /external/llvm/lib/AsmParser/ |
| H A D | LLParser.cpp | 1315 case lltok::kw_fastcc: CC = CallingConv::Fast; break;
|
| /external/dropbear/libtomcrypt/ |
| H A D | crypt.tex | 2849 \hline Yarrow & yarrow\_desc & Fast short-term PRNG \\
2850 \hline Fortuna & fortuna\_desc & Fast long-term PRNG (recommended) \\
4890 When making random primes the trial division step is in fact an optimized implementation of \textit{Implementation of Fast RSA Key Generation on Smart Cards}\footnote{Chenghuai Lu, Andre L. M. dos Santos and Francisco R. Pimentel}.
|
Completed in 437 milliseconds
12