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

  /external/eigen/Eigen/src/Core/util/
XprHelper.h 674 template<typename T,bool Vectorized=false,typename EnaleIf = void>
679 template<typename T,bool Vectorized>
680 struct scalar_div_cost<std::complex<T>, Vectorized> {
688 template<bool Vectorized>
689 struct scalar_div_cost<signed long,Vectorized,typename conditional<sizeof(long)==8,void,false_type>::type> { enum { value = 24 }; };
690 template<bool Vectorized>
691 struct scalar_div_cost<unsigned long,Vectorized,typename conditional<sizeof(long)==8,void,false_type>::type> { enum { value = 21 }; };
    [all...]
  /external/llvm/lib/Transforms/Vectorize/
LoadStoreVectorizer.cpp 39 STATISTIC(NumScalarsVectorized, "Number of scalar accesses vectorized");
462 // vectorize it (the vectorized load is inserted at the location of the
651 bool Vectorized = false;
653 Vectorized = vectorizeLoadChain(Operands, &InstructionsProcessed);
655 Vectorized = vectorizeStoreChain(Operands, &InstructionsProcessed);
657 Changed |= Vectorized;
    [all...]
SLPVectorizer.cpp 247 /// possible scalar operand in vectorized instruction.
326 /// Returns the vectorized root.
401 /// be vectorized to use the original vector (or aggregate "bitcast" to a vector).
410 /// \returns the pointer to the vectorized value if \p VL is already
411 /// vectorized, or NULL. They may happen in cycles.
419 /// this subtree gets vectorized, we may need to extract the values from the
435 /// vectorized code.
440 /// generating vectorized code.
457 /// The Scalars are vectorized into this value. It is initialized to Null.
465 TreeEntry *newTreeEntry(ArrayRef<Value *> VL, bool Vectorized) {
    [all...]
  /external/eigen/Eigen/src/Core/
AssignEvaluator.h 106 Vectorized = int(Traversal) == InnerVectorizedTraversal
116 : Vectorized ? InnerPacketSize
    [all...]

Completed in 520 milliseconds