HomeSort by relevance Sort by last modified time
    Searched refs:nsub (Results 1 - 25 of 43) sorted by null

1 2

  /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/
frame_classify.c 58 for (n=(iLBCenc_inst->nsub-1); n>0; n--) {
65 maxW32 = WebRtcSpl_MaxValueW32(ssqEn, iLBCenc_inst->nsub - 1);
78 for (n=(iLBCenc_inst->nsub-1); n>0; n--) {
85 pos = WebRtcSpl_MaxIndexW32(ssqEn, iLBCenc_inst->nsub - 1) + 1;
decode.c 108 syntdenum + (LPC_FILTERORDER + 1) * (iLBCdec_inst->nsub - 1),
131 for (i = 0; i < iLBCdec_inst->nsub; i++) {
141 for (i=0;i<iLBCdec_inst->nsub;i++) {
161 iLBCdec_inst->old_syntdenum + (i+iLBCdec_inst->nsub-1)*(LPC_FILTERORDER+1),
164 for (i=1; i < iLBCdec_inst->nsub; i++) {
179 for (i=2; i < iLBCdec_inst->nsub; i++) {
218 for (i=0; i < iLBCdec_inst->nsub; i++) {
237 syntdenum, iLBCdec_inst->nsub*(LPC_FILTERORDER+1));
init_decode.c 37 iLBCdec_inst->nsub = NSUB_30MS;
46 iLBCdec_inst->nsub = NSUB_20MS;
init_encode.c 34 iLBCenc_inst->nsub = NSUB_30MS;
43 iLBCenc_inst->nsub = NSUB_20MS;
simple_interpolate_lsf.c 78 for (i = 1; i < iLBCenc_inst->nsub; i++) {
104 for (i = 0; i < iLBCenc_inst->nsub; i++) {
decode_residual.c 112 if (iLBCdec_inst->nsub > iLBC_encbits->startIdx + 1) {
121 size_t Nfor = iLBCdec_inst->nsub - iLBC_encbits->startIdx - 1;
148 meml_gotten = SUBL*(iLBCdec_inst->nsub+1-iLBC_encbits->startIdx);
defines.h 139 size_t nsub; member in struct:IlbcEncoder_
180 size_t nsub; member in struct:IlbcDecoder_
decoder_interpolate_lsf.c 66 for (i = 0; i < iLBCdec_inst->nsub; i++) {
encode.c 138 for (n=0; n<iLBCenc_inst->nsub; n++ ) {
264 Nfor = iLBCenc_inst->nsub-iLBCbits_inst->startIdx-1;
394 meml_gotten = SUBL*(iLBCenc_inst->nsub+1-iLBCbits_inst->startIdx);
506 if (subcount == (iLBCenc_inst->nsub - 1))
  /external/regex-re2/re2/
set.cc 51 int nsub = re->nsub(); local
52 re2::Regexp** sub = new re2::Regexp*[nsub + 1];
53 for (int i = 0; i < nsub; i++)
55 sub[nsub] = m;
57 re = re2::Regexp::Concat(sub, nsub + 1, pf);
regexp.cc 209 Regexp* Regexp::ConcatOrAlternate(RegexpOp op, Regexp** sub, int nsub,
211 if (nsub == 1)
217 subcopy = new Regexp*[nsub];
218 memmove(subcopy, sub, nsub * sizeof sub[0]);
220 nsub = FactorAlternation(sub, nsub, flags);
221 if (nsub == 1) {
228 if (nsub > kMaxNsub) {
231 int nbigsub = (nsub+kMaxNsub-1)/kMaxNsub;
238 nsub - (nbigsub-1)*kMaxNsub, flags
    [all...]
compile.cc 871 if (re->nsub() > 0) {
874 Regexp** subcopy = new Regexp*[re->nsub()];
876 for (int i = 1; i < re->nsub(); i++)
878 *pre = Regexp::Concat(subcopy, re->nsub(), re->parse_flags());
919 if (re->nsub() > 0) {
920 sub = re->sub()[re->nsub() - 1]->Incref();
922 Regexp** subcopy = new Regexp*[re->nsub()];
923 subcopy[re->nsub() - 1] = sub; // already have reference
924 for (int i = 0; i < re->nsub() - 1; i++)
926 *pre = Regexp::Concat(subcopy, re->nsub(), re->parse_flags())
    [all...]
regexp.h 108 // Matches concatenation of sub_[0..nsub-1].
110 // Matches union of sub_[0..nsub-1].
314 int nsub() { return nsub_; } function in class:re2::Regexp
480 static int FactorAlternation(Regexp** sub, int nsub, ParseFlags flags);
481 static int FactorAlternationRecursive(Regexp** sub, int nsub,
  /prebuilts/go/darwin-x86/src/regexp/testdata/
testregex.c 858 matchprint(regmatch_t* match, int nmatch, int nsub, char* ans, unsigned long test)
862 for (; nmatch > nsub + 1; nmatch--)
882 matchcheck(regmatch_t* match, int nmatch, int nsub, char* ans, char* re, char* s, int len, int flags, unsigned long test)
952 matchprint(match, nmatch, nsub, ans, test);
971 matchprint(match, nmatch, nsub, ans, test);
982 matchprint(match, nmatch + 1, nsub, NiL, test);
1078 extract(int* tabs, char* spec, char* re, char* s, char* ans, char* msg, char* accept, regmatch_t* match, int nmatch, int nsub, unsigned long skip, unsigned long level, unsigned long test)
1125 matchprint(match, nmatch, nsub, NiL, test);
1138 catchfree(regex_t* preg, int flags, int* tabs, char* spec, char* re, char* s, char* ans, char* msg, char* accept, regmatch_t* match, int nmatch, int nsub, unsigned long skip, unsigned long level, unsigned long test)
1227 int nsub; local
    [all...]
  /prebuilts/go/linux-x86/src/regexp/testdata/
testregex.c 858 matchprint(regmatch_t* match, int nmatch, int nsub, char* ans, unsigned long test)
862 for (; nmatch > nsub + 1; nmatch--)
882 matchcheck(regmatch_t* match, int nmatch, int nsub, char* ans, char* re, char* s, int len, int flags, unsigned long test)
952 matchprint(match, nmatch, nsub, ans, test);
971 matchprint(match, nmatch, nsub, ans, test);
982 matchprint(match, nmatch + 1, nsub, NiL, test);
1078 extract(int* tabs, char* spec, char* re, char* s, char* ans, char* msg, char* accept, regmatch_t* match, int nmatch, int nsub, unsigned long skip, unsigned long level, unsigned long test)
1125 matchprint(match, nmatch, nsub, NiL, test);
1138 catchfree(regex_t* preg, int flags, int* tabs, char* spec, char* re, char* s, char* ans, char* msg, char* accept, regmatch_t* match, int nmatch, int nsub, unsigned long skip, unsigned long level, unsigned long test)
1227 int nsub; local
    [all...]
  /prebuilts/go/darwin-x86/src/regexp/syntax/
simplify.go 23 nsub := sub.Simplify()
24 if nre == re && nsub != sub {
32 nre.Sub = append(nre.Sub, nsub)
  /prebuilts/go/linux-x86/src/regexp/syntax/
simplify.go 23 nsub := sub.Simplify()
24 if nre == re && nsub != sub {
32 nre.Sub = append(nre.Sub, nsub)
  /bionic/libc/upstream-netbsd/lib/libc/regex/
regex2.h 200 size_t nsub; /* copy of re_nsub */ member in struct:re_guts
engine.c 110 regmatch_t *pmatch; /* [nsub+1] (0 element unused) */
262 m->pmatch = (regmatch_t *)malloc((m->g->nsub + 1) *
268 for (i = 1; i <= m->g->nsub; i++)
299 for (i = 1; i <= m->g->nsub; i++) {
326 if (i <= m->g->nsub)
538 assert(0 < i && i <= m->g->nsub);
543 assert(0 < i && i <= m->g->nsub);
673 assert(0 < i && i <= m->g->nsub);
735 assert(0 < i && i <= m->g->nsub);
746 assert(0 < i && i <= m->g->nsub);
    [all...]
  /external/llvm/lib/Support/
regex2.h 151 size_t nsub; /* copy of re_nsub */ member in struct:re_guts
regengine.inc 74 llvm_regmatch_t *pmatch; /* [nsub+1] (0 element unused) */
210 m->pmatch = (llvm_regmatch_t *)malloc((m->g->nsub + 1) *
216 for (i = 1; i <= m->g->nsub; i++)
248 for (i = 1; i <= m->g->nsub; i++) {
275 if (i <= m->g->nsub)
461 assert(0 < i && i <= m->g->nsub);
466 assert(0 < i && i <= m->g->nsub);
585 assert(0 < i && i <= m->g->nsub);
648 assert(0 < i && i <= m->g->nsub);
659 assert(0 < i && i <= m->g->nsub);
    [all...]
  /external/regex-re2/re2/testing/
dump.cc 114 for (int i = 0; i < re->nsub(); i++)
  /external/swiftshader/third_party/LLVM/lib/Support/
regex2.h 148 size_t nsub; /* copy of re_nsub */ member in struct:re_guts
regengine.inc 74 llvm_regmatch_t *pmatch; /* [nsub+1] (0 element unused) */
210 m->pmatch = (llvm_regmatch_t *)malloc((m->g->nsub + 1) *
216 for (i = 1; i <= m->g->nsub; i++)
248 for (i = 1; i <= m->g->nsub; i++) {
275 if (i <= m->g->nsub)
461 assert(0 < i && i <= m->g->nsub);
466 assert(0 < i && i <= m->g->nsub);
585 assert(0 < i && i <= m->g->nsub);
648 assert(0 < i && i <= m->g->nsub);
659 assert(0 < i && i <= m->g->nsub);
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
HTMLEntities.properties 249 nsub=8836

Completed in 384 milliseconds

1 2