Searched defs:Factor (Results 1 - 25 of 31) sorted by relevance

12

/external/llvm/include/llvm/Transforms/Scalar/
H A DReassociate.h48 struct Factor { struct in namespace:llvm::reassociate
51 Factor(Value *Base, unsigned Power) : Base(Base), Power(Power) {} function in struct:llvm::reassociate::Factor
86 SmallVectorImpl<reassociate::Factor> &Factors);
88 SmallVectorImpl<reassociate::Factor> &Factors);
91 Value *RemoveFactorFromExpression(Value *V, Value *Factor);
/external/llvm/lib/CodeGen/
H A DInterleavedAccessPass.cpp24 // E.g. An interleaved load (Factor = 2):
32 // E.g. An interleaved store (Factor = 3):
120 /// \p Factor like:
121 /// <Index, Index+Factor, ..., Index+(NumElts-1)*Factor>
122 static bool isDeInterleaveMaskOfFactor(ArrayRef<int> Mask, unsigned Factor, argument
124 // Check all potential start indices from 0 to (Factor - 1).
125 for (Index = 0; Index < Factor; Index++) {
128 // Check that elements are in ascending order by Factor. Ignore undef
131 if (Mask[i] >= 0 && static_cast<unsigned>(Mask[i]) != Index + i * Factor)
146 isDeInterleaveMask(ArrayRef<int> Mask, unsigned &Factor, unsigned &Index) argument
165 isReInterleaveMask(ArrayRef<int> Mask, unsigned &Factor) argument
224 unsigned Factor, Index; local
344 unsigned Factor; local
[all...]
H A DMachineScheduler.cpp1800 unsigned Factor = SchedModel->getResourceFactor(PIdx); local
1801 RemainingCounts[PIdx] += (Factor * PI->Cycles);
2036 unsigned Factor = SchedModel->getResourceFactor(PIdx); local
2037 unsigned Count = Factor * Cycles;
2039 << " +" << Cycles << "x" << Factor << "u\n"); local
/external/llvm/lib/Target/X86/
H A DX86ShuffleDecodeConstantPool.cpp136 unsigned Factor = ElSize / EltTySize; local
139 Constant *COp = C->getAggregateElement(i * Factor);
188 unsigned Factor = ElSize / EltTySize; local
191 Constant *COp = C->getAggregateElement(i * Factor);
/external/llvm/lib/Target/ARM/
H A DARMTargetTransformInfo.cpp497 unsigned Factor,
501 assert(Factor >= 2 && "Invalid interleave factor");
507 if (Factor <= TLI->getMaxSupportedInterleaveFactor() && !EltIs64Bits) {
509 Type *SubVecTy = VectorType::get(VecTy->getScalarType(), NumElts / Factor);
513 if (NumElts % Factor == 0 && (SubVecSize == 64 || SubVecSize == 128))
514 return Factor;
517 return BaseT::getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
496 getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, unsigned Alignment, unsigned AddressSpace) argument
/external/llvm/lib/Target/PowerPC/
H A DPPCTargetTransformInfo.cpp411 unsigned Factor,
429 Cost += Factor*(LT.first-1);
410 getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, unsigned Alignment, unsigned AddressSpace) argument
/external/swiftshader/third_party/LLVM/lib/Analysis/
H A DInlineCost.cpp583 float Factor = 1.0f; local
586 Factor += 0.5f;
591 Factor += 2.0f;
593 Factor += 1.5f;
594 return Factor;
H A DScalarEvolutionExpander.cpp178 /// FactorOutConstant - Test if S is divisible by Factor, using signed
179 /// division. If so, update S with Factor divided out and return true.
187 const SCEV *Factor,
191 if (Factor->isOne())
195 if (S == Factor) {
206 if (const SCEVConstant *FC = dyn_cast<SCEVConstant>(Factor)) {
233 const SCEVConstant *FC = cast<SCEVConstant>(Factor);
244 // Without TargetData, check if Factor can be factored out of any of the
249 if (FactorOutConstant(SOp, Remainder, Factor, SE, TD) &&
264 if (!FactorOutConstant(Step, StepRem, Factor, S
185 FactorOutConstant(const SCEV *&S, const SCEV *&Remainder, const SCEV *Factor, ScalarEvolution &SE, const TargetData *TD) argument
[all...]
/external/libvpx/libvpx/vp8/encoder/
H A Dratectrl.c1066 double Factor = 0.99; local
1071 projected_size_based_on_q = (int)(Factor * projected_size_based_on_q);
1072 Factor += factor_adjustment;
1074 if (Factor >= 0.999) Factor = 0.999;
1214 double Factor = 0.99; local
1230 double Factor =
1234 Factor = Factor/1.2683;
1236 Oq = pow( Factor, (1.
[all...]
/external/llvm/include/llvm/CodeGen/
H A DMachineTraceMetrics.h381 unsigned Factor = SchedModel.getLatencyFactor(); local
382 return (Scaled + Factor - 1) / Factor;
H A DBasicTTIImpl.h557 unsigned Factor,
565 assert(Factor > 1 && NumElts % Factor == 0 && "Invalid interleave factor");
567 unsigned NumSubElts = NumElts / Factor;
612 UsedInsts.set((Index + Elt * Factor) / NumEltsPerLegalInst);
630 assert(Indices.size() <= Factor &&
634 assert(Index < Factor && "Invalid index for interleaved memory op");
639 Instruction::ExtractElement, VT, Index + i * Factor);
662 Cost += ExtSubCost * Factor;
556 getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, unsigned Alignment, unsigned AddressSpace) argument
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.cpp312 unsigned Factor = NumParts / NumIntermediates; local
314 Ops[i] = getCopyFromParts(DAG, DL, &Parts[i * Factor], Factor,
610 unsigned Factor = NumParts / NumIntermediates; local
612 getCopyToParts(DAG, DL, Ops[i], &Parts[i*Factor], Factor, PartVT, V);
/external/llvm/lib/Target/AArch64/
H A DAArch64TargetTransformInfo.cpp496 unsigned Factor,
500 assert(Factor >= 2 && "Invalid interleave factor");
503 if (Factor <= TLI->getMaxSupportedInterleaveFactor()) {
505 Type *SubVecTy = VectorType::get(VecTy->getScalarType(), NumElts / Factor);
509 if (NumElts % Factor == 0 && (SubVecSize == 64 || SubVecSize == 128))
510 return Factor;
513 return BaseT::getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
495 getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, unsigned Alignment, unsigned AddressSpace) argument
/external/swiftshader/third_party/LLVM/lib/Transforms/Scalar/
H A DReassociate.cpp103 Value *RemoveFactorFromExpression(Value *V, Value *Factor);
572 /// multiplication sequence, and if this sequence contains a multiply by Factor,
573 /// remove Factor from the tree and return the new tree.
574 Value *Reassociate::RemoveFactorFromExpression(Value *V, Value *Factor) { argument
584 if (Factors[i].Op == Factor) {
591 if (ConstantInt *FC1 = dyn_cast<ConstantInt>(Factor))
805 Value *Factor = Factors[i];
806 if (!Duplicates.insert(Factor)) continue;
808 unsigned Occ = ++FactorOccurrences[Factor];
809 if (Occ > MaxOcc) { MaxOcc = Occ; MaxOccVal = Factor; }
[all...]
H A DLoopStrengthReduce.cpp2072 if (const SCEVConstant *Factor =
2075 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2076 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2077 } else if (const SCEVConstant *Factor =
2081 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2082 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2535 int64_t Factor = *I; local
2538 if (Base.AM.BaseOffs == INT64_MIN && Factor == -1)
2540 int64_t NewBaseOffs = (uint64_t)Base.AM.BaseOffs * Factor;
2541 if (NewBaseOffs / Factor !
2606 int64_t Factor = *I; local
[all...]
/external/swiftshader/src/Renderer/
H A DPixelProcessor.hpp173 struct Factor struct in class:sw::PixelProcessor
313 Factor factor;
/external/eigen/Eigen/src/Core/
H A DCoreEvaluators.h1175 Factor = (RowFactor==Dynamic || ColFactor==Dynamic) ? Dynamic : RowFactor*ColFactor enumerator in enum:Eigen::internal::unary_evaluator::__anon5088
1177 typedef typename internal::nested_eval<ArgType,Factor>::type ArgTypeNested;
/external/llvm/include/llvm/Analysis/
H A DTargetTransformInfoImpl.h340 unsigned Factor,
339 getInterleavedMemoryOpCost(unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, unsigned Alignment, unsigned AddressSpace) argument
/external/llvm/lib/Analysis/
H A DTargetTransformInfo.cpp351 unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices,
353 int Cost = TTIImpl->getInterleavedMemoryOpCost(Opcode, VecTy, Factor, Indices,
350 getInterleavedMemoryOpCost( unsigned Opcode, Type *VecTy, unsigned Factor, ArrayRef<unsigned> Indices, unsigned Alignment, unsigned AddressSpace) const argument
H A DScalarEvolutionExpander.cpp219 /// FactorOutConstant - Test if S is divisible by Factor, using signed
220 /// division. If so, update S with Factor divided out and return true.
227 const SCEV *Factor, ScalarEvolution &SE,
230 if (Factor->isOne())
234 if (S == Factor) {
245 if (const SCEVConstant *FC = dyn_cast<SCEVConstant>(Factor)) {
266 const SCEVConstant *FC = cast<SCEVConstant>(Factor);
280 if (!FactorOutConstant(Step, StepRem, Factor, SE, DL))
285 if (!FactorOutConstant(Start, Remainder, Factor, SE, DL))
226 FactorOutConstant(const SCEV *&S, const SCEV *&Remainder, const SCEV *Factor, ScalarEvolution &SE, const DataLayout &DL) argument
/external/llvm/lib/IR/
H A DConstantFold.cpp2236 ConstantInt *Factor = ConstantInt::get(CI->getType(), NumElements); local
2237 NewIdxs[i] = ConstantExpr::getSRem(CI, Factor);
2240 Constant *Div = ConstantExpr::getSDiv(CI, Factor);
/external/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp993 /// and if this sequence contains a multiply by Factor,
994 /// remove Factor from the tree and return the new tree.
995 Value *ReassociatePass::RemoveFactorFromExpression(Value *V, Value *Factor) { argument
1013 if (Factors[i].Op == Factor) {
1020 if (ConstantInt *FC1 = dyn_cast<ConstantInt>(Factor)) {
1027 } else if (ConstantFP *FC1 = dyn_cast<ConstantFP>(Factor)) {
1506 Value *Factor = Factors[i];
1507 if (!Duplicates.insert(Factor).second)
1510 unsigned Occ = ++FactorOccurrences[Factor];
1513 MaxOccVal = Factor;
[all...]
/external/swiftshader/third_party/LLVM/lib/VMCore/
H A DConstantFold.cpp2280 ConstantInt *Factor = ConstantInt::get(CI->getType(), local
2282 NewIdxs[i] = ConstantExpr::getSRem(CI, Factor);
2285 Constant *Div = ConstantExpr::getSDiv(CI, Factor);
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineAddSub.cpp445 // Input Instr I Factor AddSub0 AddSub1
450 Value *Factor = nullptr; local
455 Factor = Opnd0_0;
457 Factor = Opnd0_1;
459 if (Factor) {
460 AddSub0 = (Factor == Opnd0_0) ? Opnd0_1 : Opnd0_0;
461 AddSub1 = (Factor == Opnd1_0) ? Opnd1_1 : Opnd1_0;
464 Factor = Opnd0_1;
469 if (!Factor)
489 Value *RI = createFMul(Factor, NewAddSu
[all...]
/external/clang/lib/Driver/
H A DTools.cpp3397 unsigned Build = 0, Factor = 1; local
3398 for (; Version > 10000; Version = Version / 10, Factor = Factor * 10)
3399 Build = Build + (Version % 10) * Factor;

Completed in 2379 milliseconds

12