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

  /external/speex/libspeex/
cb_search.h 63 int complexity,
89 int complexity,
ltp.h 75 int complexity,
118 int complexity,
sb_celp.h 92 int complexity; member in struct:SBEncState
nb_celp.h 111 int complexity; /**< Complexity setting (0-10 from least complex to most complex) */ member in struct:EncState
cb_search.c 254 int complexity,
288 N=complexity;
291 /* Complexity isn't as important for the codebooks as it is for the pitch */
584 int complexity,
nb_celp.c 203 st->complexity=2;
353 if (!st->submodes[st->submodeID] || (st->complexity>2 && SUBMODE(have_subframe_gain)<3) || SUBMODE(forced_pitch_gain) || SUBMODE(lbr_pitch) != -1
719 if (st->complexity==0)
748 if (st->complexity==0)
793 exc, syn_resp, st->complexity, 0, st->plc_tuning, &st->cumul_gain);
847 innov, syn_resp, bits, stack, st->complexity, SUBMODE(double_codebook));
865 innov2, syn_resp, bits, stack, st->complexity, 0);
883 if (st->complexity!=0)
    [all...]
sb_celp.c 266 st->complexity=2;
696 innov, syn_resp, bits, stack, st->complexity, SUBMODE(double_codebook));
711 innov2, syn_resp, bits, stack, st->complexity, 0);
    [all...]
ltp.c 545 int complexity,
570 N=complexity;
772 int complexity,
  /external/skia/bench/
PathBench.cpp 42 virtual int complexity() { return 0; } function in class:PathBench
69 count >>= (3 * complexity());
155 virtual int complexity() { return 1; } function in class:SawToothPathBench
180 virtual int complexity() { return 2; } function in class:LongCurvedPathBench
201 virtual int complexity() { return 2; } function in class:LongLinePathBench
  /frameworks/av/media/libstagefright/codecs/m4v_h263/dec/src/
vop.cpp 548 mp4dec_log("DecodeVOLHeader(): Shape Complexity estimation is not supported.\n");
555 currVol->complexity.text_1 = BitstreamReadBits16(stream, 4);
563 currVol->complexity.text_2 = BitstreamReadBits16(stream, 4);
569 currVol->complexity.mc = BitstreamReadBits16(stream, 6);
908 if ((currVol->complexity.text_1 >> 3) & 0x1) /* intra */
910 if (currVol->complexity.text_1 & 0x1) /* not_coded */
912 if ((currVol->complexity.text_2 >> 3) & 0x1) /* dct_coefs */
914 if ((currVol->complexity.text_2 >> 2) & 0x1) /* dct_lines */
916 if ((currVol->complexity.text_2 >> 1) & 0x1) /* vlc_symbols */
918 if (currVol->complexity.text_2 & 0x1) /* vlc_bits *
    [all...]
mp4lib_int.h 27 #define FAST_IDCT /* , for fast Variable complexity IDCT */
47 /* complexity estimation parameters */
92 int complexity_estDisable; /* VOL disable complexity estimation */
93 int complexity_estMethod; /* VOL complexity estimation method */
94 Complexity_Est complexity; /* complexity estimation flags */ member in struct:tagVol
  /external/webrtc/src/
common_types.h 491 VideoCodecComplexity complexity; member in struct:webrtc::VideoCodecH264
507 VideoCodecComplexity complexity; member in struct:webrtc::VideoCodecVP8
  /external/llvm/utils/TableGen/
CodeGenDAGPatterns.h 638 unsigned complexity, unsigned uid)
640 Dstregs(dstregs), AddedComplexity(complexity), ID(uid) {}
647 unsigned AddedComplexity; // Add to matching pattern complexity.
659 /// Compute the complexity metric for the input pattern. This roughly
  /external/opencv/ml/src/
mltree.cpp 822 node->complexity = 0;
    [all...]
  /external/quake/quake/src/QW/client/
r_edge.c 29 low depth complexity -- 1 to 3 or so
  /external/quake/quake/src/WinQuake/
r_edge.cpp 29 low depth complexity -- 1 to 3 or so
  /external/opencv/ml/include/
ml.h 691 int complexity; member in struct:CvDTreeNode
    [all...]
  /external/iproute2/doc/
ip-cref.tex     [all...]

Completed in 465 milliseconds