Searched defs:Multiple (Results 1 - 5 of 5) sorted by relevance

/external/dropbear/libtommath/
H A Dbn.tex86 release the textbook ``Implementing Multiple Precision Arithmetic'' has been placed in the public domain with every new
440 \subsection{Multiple Initializations}
1792 \section{Least Common Multiple}
/external/llvm/lib/Analysis/
H A DMemoryBuiltins.cpp211 Value *Multiple = NULL; local
212 if (ComputeMultiple(MallocArg, ElementSize, Multiple,
214 return Multiple;
H A DValueTracking.cpp1175 /// Multiple. If unsuccessful, it returns false. It looks
1177 bool llvm::ComputeMultiple(Value *V, unsigned Base, Value *&Multiple, argument
1193 Multiple = V;
1200 // Multiple is 1.
1201 Multiple = ConstantInt::get(T, 1);
1206 Multiple = ConstantInt::get(T, CI->getZExtValue() / Base);
1221 return ComputeMultiple(I->getOperand(0), Base, Multiple,
1251 Multiple = ConstantExpr::getMul(MulC, Op1C);
1258 Multiple = Op1;
1275 Multiple
[all...]
/external/dropbear/libtomcrypt/
H A Dcrypt.tex4314 \subsubsection{SEQUENCE Multiple Argument Lists}
/external/llvm/lib/Target/PowerPC/
H A DPPCISelLowering.cpp743 unsigned Multiple = ByteSize/EltSize; // Number of BV entries per spltval. local
745 assert(Multiple > 1 && Multiple <= 4 && "How can this happen?");
754 if (UniquedVals[i&(Multiple-1)].getNode() == 0)
755 UniquedVals[i&(Multiple-1)] = N->getOperand(i);
756 else if (UniquedVals[i&(Multiple-1)] != N->getOperand(i))
760 // Okay, if we reached this point, UniquedVals[0..Multiple-1] contains
768 for (unsigned i = 0; i != Multiple-1; ++i) {
776 if (UniquedVals[Multiple-1].getNode() == 0)
778 int Val = cast<ConstantSDNode>(UniquedVals[Multiple
[all...]

Completed in 512 milliseconds