| /dalvik/dx/src/com/android/dx/cf/code/ |
| BytecodeArray.java | 881 int match = bytes.getInt(at); local
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| BaseRecognizer.java | 89 /** Match current input symbol against ttype. Attempt
100 public Object match(IntStream input, int ttype, BitSet follow) method in class:BaseRecognizer
103 //System.out.println("match "+((TokenStream)input).LT(1));
119 /** Match the wildcard: in a symbol */
165 * To get out of recovery mode, the parser must successfully match
172 * 5. next match() will reset errorRecovery mode
278 msg = "required (...)+ loop did not match anything at input "+
302 * an error and next valid token match
351 * token that the match() routine could not recover from.
443 * with the successful match exits errorRecovery mode)
[all...] |
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| recognizers.py | 197 def match(self, input, ttype, follow): member in class:BaseRecognizer
199 Match current input symbol against ttype. Attempt
226 """Match the wildcard: in a symbol"""
265 To get out of recovery mode, the parser must successfully match
272 5. next match() will reset errorRecovery mode
373 msg = "required (...)+ loop did not match anything at input " \
406 an error and next valid token match
456 token that the match() routine could not recover from.
562 with the successful match exits errorRecovery mode).
675 and LA(2) as if we were doing a normal match(), which advances th
1189 def match(self, s): member in class:Lexer
[all...] |
| /external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
| recognizers.rb | 379 # Attempt to match the current input symbol the token type
382 # the symbol doesn't match, attempt to use the follow-set
385 def match( type, follow ) method in class:ANTLR3.Scope
396 # match anything -- i.e. wildcard match. Simply consume
599 # with the successful match exits errorRecovery mode).
795 # Match needs to return the current input symbol, which gets put
1076 def match( expected ) method in class:ANTLR3.Hypothetical.Lexer.Hypothetical.Parser.Lexer
[all...] |
| /external/bison/src/ |
| tables.c | 197 match ACTROW[J]. */
347 actions that match the default are replaced with zero,
655 int match = 1; local
662 for (k = 0; match && k < t; k++)
665 match = 0;
667 if (match)
|
| /external/blktrace/ |
| blkiomon.c | 104 static long leftover = 0, driverdata = 0, match = 0, mismatch = 0, sequence = 0; variable
398 /* store trace if there is no match yet */
418 match++;
591 fprintf(debug.fp, "%ld leftover, %ld match, %ld mismatch, "
593 leftover, match, mismatch, driverdata, sequence);
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 40 // that match on every statement over a very large codebase.
48 // AST node twice. This struct is the key for looking up match
70 // Used to store the result of a match and possibly bound nodes.
102 // Returns true if a match is found in the subtree rooted at the
132 // no match in this recursive branch, the result set is empty
159 // hierarchy level. Thus, we try to match either of them.
164 // Match the Type.
165 if (!match(*TypeNode))
171 // on the same hierarchy level. Thus, we try to match all of them.
176 // Match the Type
248 bool match(const T &Node) { function in class:clang::ast_matchers::internal::__anon5220::MatchChildASTVisitor
462 void match(const ast_type_traits::DynTypedNode &Node) { function in class:clang::ast_matchers::internal::__anon5220::MatchASTVisitor
481 template <typename T> void match(const T &Node) { function in class:clang::ast_matchers::internal::__anon5220::MatchASTVisitor
977 void MatchFinder::match(const clang::ast_type_traits::DynTypedNode &Node, function in class:clang::ast_matchers::MatchFinder
[all...] |
| /external/dhcpcd/ |
| dhcp.c | 215 int match, n; local
224 match = 0;
226 match = 1;
232 match = 1;
234 if (match) {
[all...] |
| /external/fio/ |
| parse.c | 1019 * Option match, levenshtein distance. Handy for not quite remembering what
1129 int match = 0; local
1141 match = 1;
1153 if (show_all || match) {
1155 if (match)
1164 if (!match)
1180 log_info(" - showing closest match\n");
|
| /external/google-breakpad/src/testing/include/gmock/ |
| gmock-generated-matchers.h | 243 const bool match = inner_matcher_.MatchAndExplain(selected_args, local
246 return match;
922 // match the i-th argument in the list. Each argument of
[all...] |
| /external/icu/icu4c/source/i18n/ |
| csrsbcs.cpp | 890 UBool CharsetRecog_8859_1::match(InputText *textIn, CharsetMatch *results) const { function in class:CharsetRecog_8859_1
917 UBool CharsetRecog_8859_2::match(InputText *textIn, CharsetMatch *results) const { function in class:CharsetRecog_8859_2
959 UBool CharsetRecog_8859_5_ru::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_8859_5_ru
986 UBool CharsetRecog_8859_6_ar::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_8859_6_ar
1013 UBool CharsetRecog_8859_7_el::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_8859_7_el
1046 UBool CharsetRecog_8859_8_I_he::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_8859_8_I_he
1064 UBool CharsetRecog_8859_8_he::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_8859_8_he
1092 UBool CharsetRecog_8859_9_tr::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_8859_9_tr
1115 UBool CharsetRecog_windows_1256::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_windows_1256
1137 UBool CharsetRecog_windows_1251::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_windows_1251
1159 UBool CharsetRecog_KOI8_R::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_KOI8_R
1187 UBool CharsetRecog_IBM424_he_rtl::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_IBM424_he_rtl
1204 UBool CharsetRecog_IBM424_he_ltr::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_IBM424_he_ltr
1242 UBool CharsetRecog_IBM420_ar_rtl::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_IBM420_ar_rtl
1259 UBool CharsetRecog_IBM420_ar_ltr::match(InputText *textIn, CharsetMatch *results) const function in class:CharsetRecog_IBM420_ar_ltr
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| csdetest.cpp | 330 const UCharsetMatch *match; local
334 match = ucsdet_detect(csd, &status);
336 if (match == NULL) {
341 ucsdet_getUChars(match, detected, sLength, &status);
370 const UCharsetMatch *match; local
375 match = ucsdet_detect(csd, &status);
377 if (match == NULL) {
382 name = ucsdet_getName(match, &status);
383 conf = ucsdet_getConfidence(match, &status);
396 match = ucsdet_detect(csd, &status)
430 const UCharsetMatch *match; local
498 const UCharsetMatch *match; local
647 const UCharsetMatch *match; local
737 const UCharsetMatch *match; local
[all...] |
| srchtest.cpp | 271 errln("Error with the initialization of match start and length");
284 errln("Error next match found at %d (len:%d); expected %d (len:%d)",
310 errln("Error next match found at %d (len:%d); expected <NO MATCH>",
327 errln("Error previous match found at %d (len:%d); expected %d (len:%d)",
353 errln("Error previous match found at %d (len:%d); expected <NO MATCH>",
376 errln("Error following match starting at %d (overlap:%d) found at %d (len:%d); expected <NO MATCH>",
393 errln("Error following match starting at %d (overlap: %d) found at %d (len:%d); expected %d (len:%d)\n"
2358 int match = m_text_.indexOf(m_pattern_, start); local
2377 int match = m_text_.lastIndexOf(m_pattern_, 0, start); local
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/util/ |
| LocaleMatcher.java | 24 * Provides a way to match the languages (locales) supported by a product to the
25 * languages (locales) acceptable to a user, and get the best match. For
96 * @param languagePriorityList LocalePriorityList to match
108 * @param languagePriorityList LocalePriorityList to match
127 * perfect match, and 0 means that they are completely different. Note that
137 public double match(ULocale desired, ULocale desiredMax, ULocale supported, ULocale supportedMax) { method in class:LocaleMatcher
138 return matcherData.match(desired, desiredMax, supported, supportedMax);
169 * Get the best match for a LanguagePriorityList
171 * @param languageList list to match
193 * Convenience method: Get the best match for a LanguagePriorityLis
251 final double match = match(languageCode, maximized, tableKey, row.get0()); local
604 public double match(ULocale a, ULocale aMax, ULocale b, ULocale bMax) { method in class:LocaleMatcher.LanguageMatcherData
906 public static double match(ULocale a, ULocale b) { method in class:LocaleMatcher
[all...] |
| /external/libphonenumber/libphonenumber/src/com/google/i18n/phonenumbers/ |
| PhoneNumberMatcher.java | 85 * Pattern to check that brackets match. Opening brackets should be closed within a phone number.
98 * Note that if there is a match, we will always check any text found up to the first match as
105 // phone number. Will match a pattern like "(650) 223 3345 (754) 223 3321".
205 /** The last successful match, null unless in {@link State#READY}. */
243 * that represents a phone number. Returns the next match, null if none was found.
246 * @return the phone number match found, null if none can be found
259 PhoneNumberMatch match = extractMatch(candidate, start); local
260 if (match != null) {
261 return match;
330 PhoneNumberMatch match = parseAndVerify(rawString, offset); local
358 PhoneNumberMatch match = parseAndVerify(group.toString(), offset); local
367 PhoneNumberMatch match = parseAndVerify(group.toString(), offset + groupMatcher.start(1)); local
[all...] |
| /external/libvncserver/test/ |
| tjbench.c | 587 int temp1=0, temp2=0, match=0; local
595 match=1; break;
598 if(!match) usage(argv[0]);
|
| /external/lldb/source/Plugins/Process/gdb-remote/ |
| GDBRemoteRegisterContext.cpp | 915 bool match = true; local
[all...] |
| /external/lldb/source/Plugins/SymbolFile/DWARF/ |
| HashedNameToDIE.h | 661 const bool match = strcmp (name, strp_cstr) == 0; local
663 if (!match && m_header.header_data.HashDataHasFixedByteSize())
665 // If the string doesn't match and we have fixed size data,
672 // If the string does match, or we don't have fixed size data
682 if (match)
695 if (match)
698 return eResultKeyMismatch; // The key doesn't match, this function will get called
730 const bool match = regex.Execute(strp_cstr); local
732 if (!match && m_header.header_data.HashDataHasFixedByteSize())
734 // If the regex doesn't match and we have fixed size data
[all...] |
| /external/lldb/source/Symbol/ |
| Symtab.cpp | 796 // to check the symbols and match the symbol_type if any was given.
816 // to check the symbols and match the symbol_type if any was given.
844 // to check the symbols and match the symbol_type if any was given.
1157 const UniqueCStringMap<uint32_t>::Entry *match; local
1174 const UniqueCStringMap<uint32_t>::Entry *match; local
1191 const UniqueCStringMap<uint32_t>::Entry *match; local
[all...] |
| /external/lz4/lib/ |
| lz4hc.c | 164 const BYTE* match; local
168 /* HC4 match finder */
177 match = base + matchIndex;
178 if (*(match+ml) == *(ip+ml)
179 && (LZ4_read32(match) == LZ4_read32(ip)))
181 size_t mlt = LZ4_count(ip+MINMATCH, match+MINMATCH, iLimit) + MINMATCH;
182 if (mlt > ml) { ml = mlt; *matchpos = match; }
187 match = dictBase + matchIndex;
188 if (LZ4_read32(match) == LZ4_read32(ip))
193 mlt = LZ4_count(ip+MINMATCH, match+MINMATCH, vLimit) + MINMATCH
222 const BYTE* match; local
[all...] |
| /external/lz4/programs/ |
| frametest.c | 163 unsigned match, end; local
168 match = pos - offset;
170 while (pos < end) BBuffer[pos++] = BBuffer[match++];
|
| /external/nist-sip/java/gov/nist/core/ |
| GenericObject.java | 82 protected Match matchExpression; // Pattern matcher.
93 /** Set the pattern matcher. To match on the
94 * field of a sip message, set the match expression in the match template
95 * and invoke the match function. This useful because
100 * an incoming message, first parse it, and then construct a match template,
102 * match. The rules for matching are: A null object matches wild card -
103 * that is a match template of null matches any parsed SIP object.
104 * To match with any subfield, set the match template on a template objec
493 public boolean match(Object other) { method in class:GenericObject
[all...] |
| LexerCore.java | 158 // call this after you call match
201 /** Match the given token or throw an exception if no such token
204 public Token match(int tok) throws ParseException { method in class:LexerCore
206 Debug.println("match " + tok);
708 * @param c the character to match
|
| /external/openssh/openbsd-compat/ |
| glob.c | 171 static int match(Char *, Char *, Char *, int);
551 * If there was no match we are going to append the pattern
762 if (!match(pathend, pattern, restpattern, GLOB_LIMIT_RECUR)) {
899 match(Char *name, Char *pat, Char *patend, int recur) function
916 if (match(name, pat, patend, recur))
|
| /external/parameter-framework/tools/xmlGenerator/ |
| EddParser.py | 302 match = re.compile(r"[ \t]*\n?$").match variable in class:EmptyLine
315 match = re.compile(r"#").match variable in class:Commentary
325 match = re.compile(r".+=").match variable in class:Path
344 match = re.compile(tag + r" *:").match variable in class:GroupPath
378 match = re.compile(r"[a-zA-Z0-9_.]+ +(Is|IsNot|Includes|Excludes) +[a-zA-Z0-9_.]+").match variable in class:Rule
401 match = re.compile(r"ANY|ALL").match variable in class:Operator
430 match = re.compile(r"conf *:").match variable in class:Configuration
533 match = re.compile(r"(supConf|confGroup|confType) *:").match variable in class:GroupConfiguration
580 match = re.compile(r"domain *:").match variable in class:Domain
690 match = re.compile(r"(supDomain|domainGroup) *:").match variable in class:GroupDomain
[all...] |
