/external/llvm/include/llvm/CodeGen/ |
MachineTraceMetrics.h | 373 unsigned Factor = SchedModel.getLatencyFactor(); 374 return (Scaled + Factor - 1) / Factor;
|
/external/llvm/lib/Transforms/Scalar/ |
Reassociate.cpp | 78 /// factor of some product. 79 struct Factor { 83 Factor(Value *Base, unsigned Power) : Base(Base), Power(Power) {} 87 bool operator()(const Factor &LHS, const Factor &RHS) { 94 bool operator()(const Factor &LHS, const Factor &RHS) { 101 bool operator()(const Factor &LHS, const Factor &RHS) { 108 bool operator()(const Factor &LHS, const Factor &RHS) [all...] |
LoopStrengthReduce.cpp | 782 // Get the cost of the scaling factor used in F for LU. [all...] |
/external/libvpx/libvpx/vp8/encoder/ |
ratectrl.c | 394 /* Initial factor: set target size to: |3.0 * per_frame_bandwidth|. */ 398 /* adjustment up based on q: this factor ranges from ~1.2 to 2.2. */ 793 /* For streaming applications the most important factor is [all...] |
/external/eigen/Eigen/src/Core/ |
VectorwiseOp.h | 386 const ReplicateReturnType replicate(Index factor) const; 397 template<int Factor> const Replicate<ExpressionType,(IsVertical?Factor:1),(IsHorizontal?Factor:1)> 398 replicate(Index factor = Factor) const 400 return Replicate<ExpressionType,Direction==Vertical?Factor:1,Direction==Horizontal?Factor:1> 401 (_expression(),Direction==Vertical?factor:1,Direction==Horizontal?factor:1) [all...] |
Replicate.h | 39 Factor = (RowFactor==Dynamic || ColFactor==Dynamic) ? Dynamic : RowFactor*ColFactor 41 typedef typename nested<MatrixType,Factor>::type MatrixTypeNested; 169 VectorwiseOp<ExpressionType,Direction>::replicate(Index factor) const 172 (_expression(),Direction==Vertical?factor:1,Direction==Horizontal?factor:1);
|
/external/libffi/src/powerpc/ |
darwin.S | 198 .byte 0x1 ; uleb128 0x1; CIE Code Alignment Factor 199 .byte 0x7c ; sleb128 -4; CIE Data Alignment Factor
|
darwin_closure.S | 257 .byte 0x1 ; uleb128 0x1; CIE Code Alignment Factor 258 .byte 0x7c ; sleb128 -4; CIE Data Alignment Factor
|
linux64.S | 149 .uleb128 0x1 # CIE Code Alignment Factor 150 .sleb128 -8 # CIE Data Alignment Factor
|
linux64_closure.S | 206 .uleb128 0x1 # CIE Code Alignment Factor 207 .sleb128 -8 # CIE Data Alignment Factor
|
ppc_closure.S | 286 .uleb128 0x1 # CIE Code Alignment Factor 287 .sleb128 -4 # CIE Data Alignment Factor
|
/external/libffi/src/s390/ |
sysv.S | 162 .uleb128 0x1 # CIE Code Alignment Factor 163 .sleb128 -4 # CIE Data Alignment Factor 361 .uleb128 0x1 # CIE Code Alignment Factor 362 .sleb128 -8 # CIE Data Alignment Factor
|
/external/libffi/src/alpha/ |
osf.S | 309 .byte 0x1 # uleb128 0x1; CIE Code Alignment Factor 310 .byte 0x78 # sleb128 -8; CIE Data Alignment Factor
|
/external/libffi/src/sparc/ |
v8.S | 209 .byte 0x1 ! uleb128 0x1; CIE Code Alignment Factor 210 .byte 0x80-WS ! sleb128 -WS; CIE Data Alignment Factor
|
v9.S | 243 .byte 0x1 ! uleb128 0x1; CIE Code Alignment Factor 244 .byte 0x78 ! sleb128 -8; CIE Data Alignment Factor
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineAddSub.cpp | 459 // Input Instr I Factor AddSub0 AddSub1 464 Value *Factor = 0; 469 Factor = Opnd0_0; 471 Factor = Opnd0_1; 473 if (Factor) { 474 AddSub0 = (Factor == Opnd0_0) ? Opnd0_1 : Opnd0_0; 475 AddSub1 = (Factor == Opnd1_0) ? Opnd1_1 : Opnd1_0; 478 Factor = Opnd0_1; 483 if (!Factor) 497 return createFMul(Factor, NewAddSub) [all...] |
/external/llvm/lib/CodeGen/ |
MachineTraceMetrics.cpp | 820 unsigned Factor = MTM.SchedModel.getResourceFactor(K); 823 << PRDepths[K]/Factor << " ops x" << Factor << ")\n"; [all...] |
MachineScheduler.cpp | [all...] |
/external/libffi/src/pa/ |
hpux32.S | 312 .uleb128 0x1 ;# CIE Code Alignment Factor 313 .sleb128 4 ;# CIE Data Alignment Factor
|
linux.S | 301 .uleb128 0x1 ;# CIE Code Alignment Factor 302 .sleb128 4 ;# CIE Data Alignment Factor
|
/external/libffi/src/mips/ |
o32.S | 315 .uleb128 0x1 # CIE Code Alignment Factor 316 .sleb128 4 # CIE Data Alignment Factor
|
/external/llvm/lib/Analysis/ |
ScalarEvolutionExpander.cpp | 204 /// FactorOutConstant - Test if S is divisible by Factor, using signed 205 /// division. If so, update S with Factor divided out and return true. 213 const SCEV *Factor, 217 if (Factor->isOne()) 221 if (S == Factor) { 226 // For a Constant, check for a multiple of the given factor. 232 if (const SCEVConstant *FC = dyn_cast<SCEVConstant>(Factor)) { 253 // of the given factor. 257 // operand which is a multiple of the given factor. If so, we can 258 // factor it [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
LoopVectorize.cpp | 136 /// block to a specified vectorization factor (VF). 140 /// counts that are known to be a multiple of the vectorization factor. 148 /// and reduction variables that were found to a given vectorization factor. 269 /// The unroll factor. Each entry in the map stores this number of vector 291 /// The vectorization SIMD factor to use. Each vector will have this many 294 /// The vectorization unroll factor to use. Each scalar is vectorized to this 358 /// to what vectorization factor. 650 /// \return The most profitable vectorization factor and the cost of that VF. 652 /// then this vectorization factor will be selected if vectorization is 662 /// \return The most profitable unroll factor [all...] |
/external/llvm/lib/IR/ |
ConstantFold.cpp | 609 // alignof-like expression, factor out known factors. [all...] |
/external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/ |
ia64-mont.pl | 236 // 7*(n+7) ticks on Itanium (the one codenamed Merced). Factor of 7 493 // factor is a tad higher: 33 or 34, if not 35. Exact measurement and
|