HomeSort by relevance Sort by last modified time
    Searched defs:Multiple (Results 1 - 4 of 4) sorted by null

  /external/llvm/lib/Analysis/
MemoryBuiltins.cpp 105 // If malloc call's arg can be determined to be a multiple of ElementSize,
106 // return the multiple. Otherwise, return NULL.
108 Value *Multiple = NULL;
109 if (ComputeMultiple(MallocArg, ElementSize, Multiple,
111 return Multiple;
173 /// argument passed to malloc is a multiple of the size of the malloced type,
174 /// then return that multiple. For non-array mallocs, the multiple is
  /external/dropbear/libtommath/
bn.tex 86 release the textbook ``Implementing Multiple Precision Arithmetic'' has been placed in the public domain with every new
248 source code is also accessible for computer science students attempting to learn ``BigNum'' or multiple precision
334 The basic ``multiple precision integer'' type is known as the ``mp\_int'' within LibTomMath. This data type is used to
440 \subsection{Multiple Initializations}
454 are available for use. A complementary mp\_clear\_multi() function allows multiple mp\_int variables to be free'd
    [all...]
  /external/dropbear/libtomcrypt/
crypt.tex 254 related issue is if you use the same symmetric cipher, hash or public key state data in multiple threads. Normally
    [all...]
  /external/llvm/lib/Target/PowerPC/
PPCISelLowering.cpp 710 // multiple elements of the buildvector are folded together into a single
714 unsigned Multiple = ByteSize/EltSize; // Number of BV entries per spltval.
716 assert(Multiple > 1 && Multiple <= 4 && "How can this happen?");
725 if (UniquedVals[i&(Multiple-1)].getNode() == 0)
726 UniquedVals[i&(Multiple-1)] = N->getOperand(i);
727 else if (UniquedVals[i&(Multiple-1)] != N->getOperand(i))
731 // Okay, if we reached this point, UniquedVals[0..Multiple-1] contains
739 for (unsigned i = 0; i != Multiple-1; ++i) {
747 if (UniquedVals[Multiple-1].getNode() == 0
    [all...]

Completed in 249 milliseconds