Home
last modified time | relevance | path

Searched refs:nsub (Results 1 – 25 of 28) sorted by relevance

12

/external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/ilbc/
Ddecode.c107 … decresidual, syntdenum + (LPC_FILTERORDER + 1)*(iLBCdec_inst->nsub - 1), in WebRtcIlbcfix_DecodeImpl()
130 for (i = 0; i < iLBCdec_inst->nsub; i++) { in WebRtcIlbcfix_DecodeImpl()
140 for (i=0;i<iLBCdec_inst->nsub;i++) { in WebRtcIlbcfix_DecodeImpl()
160 iLBCdec_inst->old_syntdenum + (i+iLBCdec_inst->nsub-1)*(LPC_FILTERORDER+1), in WebRtcIlbcfix_DecodeImpl()
163 for (i=1; i < iLBCdec_inst->nsub; i++) { in WebRtcIlbcfix_DecodeImpl()
178 for (i=2; i < iLBCdec_inst->nsub; i++) { in WebRtcIlbcfix_DecodeImpl()
217 for (i=0; i < iLBCdec_inst->nsub; i++) { in WebRtcIlbcfix_DecodeImpl()
236 syntdenum, iLBCdec_inst->nsub*(LPC_FILTERORDER+1)); in WebRtcIlbcfix_DecodeImpl()
Dframe_classify.c58 for (n=(iLBCenc_inst->nsub-1); n>0; n--) { in WebRtcIlbcfix_FrameClassify()
65 maxW32 = WebRtcSpl_MaxValueW32(ssqEn, (int16_t)(iLBCenc_inst->nsub-1)); in WebRtcIlbcfix_FrameClassify()
78 for (n=(iLBCenc_inst->nsub-1); n>0; n--) { in WebRtcIlbcfix_FrameClassify()
85 pos = WebRtcSpl_MaxIndexW32(ssqEn, (int16_t)(iLBCenc_inst->nsub-1)) + 1; in WebRtcIlbcfix_FrameClassify()
Dinit_encode.c34 iLBCenc_inst->nsub = NSUB_30MS; in WebRtcIlbcfix_InitEncode()
43 iLBCenc_inst->nsub = NSUB_20MS; in WebRtcIlbcfix_InitEncode()
Dinit_decode.c37 iLBCdec_inst->nsub = NSUB_30MS; in WebRtcIlbcfix_InitDecode()
46 iLBCdec_inst->nsub = NSUB_20MS; in WebRtcIlbcfix_InitDecode()
Dsimple_interpolate_lsf.c77 for (i = 1; i < iLBCenc_inst->nsub; i++) { in WebRtcIlbcfix_SimpleInterpolateLsf()
103 for (i = 0; i < iLBCenc_inst->nsub; i++) { in WebRtcIlbcfix_SimpleInterpolateLsf()
Ddefines.h139 int16_t nsub; member
180 int16_t nsub; member
Ddecode_residual.c113 Nfor = iLBCdec_inst->nsub-iLBC_encbits->startIdx-1; in WebRtcIlbcfix_DecodeResidual()
152 meml_gotten = SUBL*(iLBCdec_inst->nsub+1-iLBC_encbits->startIdx); in WebRtcIlbcfix_DecodeResidual()
Dencode.c138 for (n=0; n<iLBCenc_inst->nsub; n++ ) { in WebRtcIlbcfix_EncodeImpl()
264 Nfor = iLBCenc_inst->nsub-iLBCbits_inst->startIdx-1; in WebRtcIlbcfix_EncodeImpl()
395 meml_gotten = SUBL*(iLBCenc_inst->nsub+1-iLBCbits_inst->startIdx); in WebRtcIlbcfix_EncodeImpl()
507 if (subcount == (iLBCenc_inst->nsub - 1)) in WebRtcIlbcfix_EncodeImpl()
Ddecoder_interpolate_lsf.c65 for (i = 0; i < iLBCdec_inst->nsub; i++) { in WebRtcIlbcfix_DecoderInterpolateLsp()
Denhancer_interface.c347 (iLBCdec_inst->nsub-1)*(LPC_FILTERORDER+1)], in WebRtcIlbcfix_EnhancerInterface()
358 (iLBCdec_inst->nsub-1)*(LPC_FILTERORDER+1)], in WebRtcIlbcfix_EnhancerInterface()
/external/chromium_org/third_party/re2/re2/
Dset.cc51 int nsub = re->nsub(); in Add() local
52 re2::Regexp** sub = new re2::Regexp*[nsub + 1]; in Add()
53 for (int i = 0; i < nsub; i++) in Add()
55 sub[nsub] = m; in Add()
57 re = re2::Regexp::Concat(sub, nsub + 1, pf); in Add()
Dregexp.cc209 Regexp* Regexp::ConcatOrAlternate(RegexpOp op, Regexp** sub, int nsub, in ConcatOrAlternate() argument
211 if (nsub == 1) in ConcatOrAlternate()
217 subcopy = new Regexp*[nsub]; in ConcatOrAlternate()
218 memmove(subcopy, sub, nsub * sizeof sub[0]); in ConcatOrAlternate()
220 nsub = FactorAlternation(sub, nsub, flags); in ConcatOrAlternate()
221 if (nsub == 1) { in ConcatOrAlternate()
228 if (nsub > kMaxNsub) { in ConcatOrAlternate()
231 int nbigsub = (nsub+kMaxNsub-1)/kMaxNsub; in ConcatOrAlternate()
238 nsub - (nbigsub-1)*kMaxNsub, flags, in ConcatOrAlternate()
245 re->AllocSub(nsub); in ConcatOrAlternate()
[all …]
Dcompile.cc872 if (re->nsub() > 0) { in IsAnchorStart()
875 Regexp** subcopy = new Regexp*[re->nsub()]; in IsAnchorStart()
877 for (int i = 1; i < re->nsub(); i++) in IsAnchorStart()
879 *pre = Regexp::Concat(subcopy, re->nsub(), re->parse_flags()); in IsAnchorStart()
920 if (re->nsub() > 0) { in IsAnchorEnd()
921 sub = re->sub()[re->nsub() - 1]->Incref(); in IsAnchorEnd()
923 Regexp** subcopy = new Regexp*[re->nsub()]; in IsAnchorEnd()
924 subcopy[re->nsub() - 1] = sub; // already have reference in IsAnchorEnd()
925 for (int i = 0; i < re->nsub() - 1; i++) in IsAnchorEnd()
927 *pre = Regexp::Concat(subcopy, re->nsub(), re->parse_flags()); in IsAnchorEnd()
Dregexp.h314 int nsub() { return nsub_; } in nsub() function
480 static int FactorAlternation(Regexp** sub, int nsub, ParseFlags flags);
481 static int FactorAlternationRecursive(Regexp** sub, int nsub,
Dparse.cc645 if (re->op() == kRegexpConcat && re->nsub() >= 2) { in LeadingRegexp()
661 if (re->op() == kRegexpConcat && re->nsub() >= 2) { in RemoveLeadingRegexp()
667 if (re->nsub() == 2) { in RemoveLeadingRegexp()
689 while (re->op() == kRegexpConcat && re->nsub() > 0) in LeadingString()
755 switch (re->nsub()) { in RemoveLeadingString()
759 LOG(DFATAL) << "Concat of " << re->nsub(); in RemoveLeadingString()
/external/regex-re2/re2/
Dset.cc51 int nsub = re->nsub(); in Add() local
52 re2::Regexp** sub = new re2::Regexp*[nsub + 1]; in Add()
53 for (int i = 0; i < nsub; i++) in Add()
55 sub[nsub] = m; in Add()
57 re = re2::Regexp::Concat(sub, nsub + 1, pf); in Add()
Dregexp.cc209 Regexp* Regexp::ConcatOrAlternate(RegexpOp op, Regexp** sub, int nsub, in ConcatOrAlternate() argument
211 if (nsub == 1) in ConcatOrAlternate()
217 subcopy = new Regexp*[nsub]; in ConcatOrAlternate()
218 memmove(subcopy, sub, nsub * sizeof sub[0]); in ConcatOrAlternate()
220 nsub = FactorAlternation(sub, nsub, flags); in ConcatOrAlternate()
221 if (nsub == 1) { in ConcatOrAlternate()
228 if (nsub > kMaxNsub) { in ConcatOrAlternate()
231 int nbigsub = (nsub+kMaxNsub-1)/kMaxNsub; in ConcatOrAlternate()
238 nsub - (nbigsub-1)*kMaxNsub, flags, in ConcatOrAlternate()
245 re->AllocSub(nsub); in ConcatOrAlternate()
[all …]
Dcompile.cc871 if (re->nsub() > 0) { in IsAnchorStart()
874 Regexp** subcopy = new Regexp*[re->nsub()]; in IsAnchorStart()
876 for (int i = 1; i < re->nsub(); i++) in IsAnchorStart()
878 *pre = Regexp::Concat(subcopy, re->nsub(), re->parse_flags()); in IsAnchorStart()
919 if (re->nsub() > 0) { in IsAnchorEnd()
920 sub = re->sub()[re->nsub() - 1]->Incref(); in IsAnchorEnd()
922 Regexp** subcopy = new Regexp*[re->nsub()]; in IsAnchorEnd()
923 subcopy[re->nsub() - 1] = sub; // already have reference in IsAnchorEnd()
924 for (int i = 0; i < re->nsub() - 1; i++) in IsAnchorEnd()
926 *pre = Regexp::Concat(subcopy, re->nsub(), re->parse_flags()); in IsAnchorEnd()
Dregexp.h314 int nsub() { return nsub_; } in nsub() function
480 static int FactorAlternation(Regexp** sub, int nsub, ParseFlags flags);
481 static int FactorAlternationRecursive(Regexp** sub, int nsub,
Dparse.cc645 if (re->op() == kRegexpConcat && re->nsub() >= 2) { in LeadingRegexp()
661 if (re->op() == kRegexpConcat && re->nsub() >= 2) { in RemoveLeadingRegexp()
667 if (re->nsub() == 2) { in RemoveLeadingRegexp()
689 while (re->op() == kRegexpConcat && re->nsub() > 0) in LeadingString()
755 switch (re->nsub()) { in RemoveLeadingString()
759 LOG(DFATAL) << "Concat of " << re->nsub(); in RemoveLeadingString()
/external/llvm/lib/Support/
Dregcomp.c214 g->nsub = 0; in llvm_regcomp()
238 preg->re_nsub = g->nsub; in llvm_regcomp()
317 p->g->nsub++; in p_ere_exp()
318 subno = p->g->nsub; in p_ere_exp()
389 assert(backrefnum <= p->g->nsub); in p_ere_exp()
557 p->g->nsub++; in p_simp_re()
558 subno = p->g->nsub; in p_simp_re()
588 assert(i <= p->g->nsub); in p_simp_re()
Dregex2.h151 size_t nsub; /* copy of re_nsub */ member
Dregengine.inc74 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);
/external/chromium_org/third_party/re2/re2/testing/
Ddump.cc114 for (int i = 0; i < re->nsub(); i++) in DumpRegexpAppending()
/external/regex-re2/re2/testing/
Ddump.cc114 for (int i = 0; i < re->nsub(); i++) in DumpRegexpAppending()

12