| /external/chromium_org/third_party/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 | 872 if (re->nsub() > 0) {
875 Regexp** subcopy = new Regexp*[re->nsub()];
877 for (int i = 1; i < re->nsub(); i++)
879 *pre = Regexp::Concat(subcopy, re->nsub(), re->parse_flags());
920 if (re->nsub() > 0) {
921 sub = re->sub()[re->nsub() - 1]->Incref();
923 Regexp** subcopy = new Regexp*[re->nsub()];
924 subcopy[re->nsub() - 1] = sub; // already have reference
925 for (int i = 0; i < re->nsub() - 1; i++)
927 *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,
|
| /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,
|
| /external/chromium_org/third_party/webrtc/modules/audio_coding/codecs/ilbc/ |
| frame_classify.c | 58 for (n=(iLBCenc_inst->nsub-1); n>0; n--) {
65 maxW32 = WebRtcSpl_MaxValueW32(ssqEn, (int16_t)(iLBCenc_inst->nsub-1));
78 for (n=(iLBCenc_inst->nsub-1); n>0; n--) {
85 pos = WebRtcSpl_MaxIndexW32(ssqEn, (int16_t)(iLBCenc_inst->nsub-1)) + 1;
|
| decode.c | 107 decresidual, syntdenum + (LPC_FILTERORDER + 1)*(iLBCdec_inst->nsub - 1),
130 for (i = 0; i < iLBCdec_inst->nsub; i++) {
140 for (i=0;i<iLBCdec_inst->nsub;i++) {
160 iLBCdec_inst->old_syntdenum + (i+iLBCdec_inst->nsub-1)*(LPC_FILTERORDER+1),
163 for (i=1; i < iLBCdec_inst->nsub; i++) {
178 for (i=2; i < iLBCdec_inst->nsub; i++) {
217 for (i=0; i < iLBCdec_inst->nsub; i++) {
236 syntdenum, iLBCdec_inst->nsub*(LPC_FILTERORDER+1));
|
| init_encode.c | 34 iLBCenc_inst->nsub = NSUB_30MS;
43 iLBCenc_inst->nsub = NSUB_20MS;
|
| defines.h | 139 int16_t nsub; member in struct:iLBC_Enc_Inst_t_
180 int16_t nsub; member in struct:iLBC_Dec_Inst_t_
|
| init_decode.c | 37 iLBCdec_inst->nsub = NSUB_30MS;
46 iLBCdec_inst->nsub = NSUB_20MS;
|
| simple_interpolate_lsf.c | 77 for (i = 1; i < iLBCenc_inst->nsub; i++) {
103 for (i = 0; i < iLBCenc_inst->nsub; i++) {
|
| decode_residual.c | 111 Nfor = iLBCdec_inst->nsub-iLBC_encbits->startIdx-1;
150 meml_gotten = SUBL*(iLBCdec_inst->nsub+1-iLBC_encbits->startIdx);
|
| decoder_interpolate_lsf.c | 65 for (i = 0; i < iLBCdec_inst->nsub; i++) {
|
| encode.c | 136 for (n=0; n<iLBCenc_inst->nsub; n++ ) {
262 Nfor = iLBCenc_inst->nsub-iLBCbits_inst->startIdx-1;
393 meml_gotten = SUBL*(iLBCenc_inst->nsub+1-iLBCbits_inst->startIdx);
506 if (subcount == (iLBCenc_inst->nsub - 1))
|
| enhancer_interface.c | 346 (iLBCdec_inst->nsub-1)*(LPC_FILTERORDER+1)],
357 (iLBCdec_inst->nsub-1)*(LPC_FILTERORDER+1)],
|
| /external/llvm/lib/Support/ |
| 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...] |
| regcomp.c | 214 g->nsub = 0;
238 preg->re_nsub = g->nsub;
317 p->g->nsub++;
318 subno = p->g->nsub;
389 assert(backrefnum <= p->g->nsub);
557 p->g->nsub++;
558 subno = p->g->nsub;
588 assert(i <= p->g->nsub);
[all...] |
| /ndk/sources/host-tools/ndk-stack/regex/ |
| engine.c | 74 regmatch_t *pmatch; /* [nsub+1] (0 element unused) */
206 m->pmatch = (regmatch_t *)malloc((m->g->nsub + 1) *
212 for (i = 1; i <= (int)m->g->nsub; i++)
244 for (i = 1; i <= m->g->nsub; i++) {
271 if (i <= (int)m->g->nsub)
452 assert(0 < i && i <= m->g->nsub);
457 assert(0 < i && i <= m->g->nsub);
576 assert(0 < i && i <= m->g->nsub);
639 assert(0 < i && i <= m->g->nsub);
650 assert(0 < i && i <= m->g->nsub);
[all...] |
| /bionic/libc/upstream-netbsd/lib/libc/regex/ |
| 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/apache-xml/src/main/java/org/apache/xml/serializer/ |
| HTMLEntities.properties | 249 nsub=8836
|
| /external/chromium_org/third_party/markupsafe/ |
| _constants.py | 177 'nsub': 8836,
|
| /external/chromium_org/third_party/re2/re2/testing/ |
| dump.cc | 114 for (int i = 0; i < re->nsub(); i++)
|
