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

  /external/chromium_org/third_party/opus/src/silk/
control_codec.c 55 opus_int Complexity /* I */
116 /* Set encoding complexity */
118 ret += silk_setup_complexity( &psEnc->sCmn, encControl->complexity );
315 opus_int Complexity /* I */
320 /* Set encoding complexity */
321 silk_assert( Complexity >= 0 && Complexity <= 10 );
322 if( Complexity < 2 ) {
333 } else if( Complexity < 4 ) {
344 } else if( Complexity < 6 )
    [all...]
structs.h 164 opus_int Complexity; /* Complexity setting */
169 opus_int pitchEstimationComplexity; /* Complexity level for pitch estimator */
172 opus_int LTPQuantLowComplexity; /* Flag for low complexity LTP quantization */
enc_API.c 122 encStatus->complexity = state_Fxx[ 0 ].sCmn.Complexity;
210 tmp_complexity = encControl->complexity;
211 encControl->complexity = 0;
541 encControl->complexity = tmp_complexity;
  /external/llvm/lib/Target/X86/
X86ISelDAGToDAG.cpp     [all...]
  /external/llvm/lib/Analysis/
ScalarEvolution.cpp 456 /// SCEVComplexityCompare - Return true if the complexity of the LHS is less
457 /// than the complexity of the RHS. This comparator is used to canonicalize
564 // Addrec complexity grows with operand count.
630 /// complexity, and group objects of the same complexity together by value.
632 /// consecutive and that complexity is monotonically increasing.
651 // Do the rough sort by complexity.
654 // Now that we are sorted by complexity, group elements of the same
655 // complexity. Note that this is, at worst, N^2, but the vector is likely to
660 unsigned Complexity = S->getSCEVType()
    [all...]

Completed in 54 milliseconds