| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineAddSub.cpp | 115 if (match(LHS, m_Xor(m_Value(XorLHS), m_ConstantInt(XorRHS)))) {
222 if (match(LHS, m_Mul(m_Value(W), m_Value(X))) &&
223 match(RHS, m_Mul(m_Value(Y), m_Value(Z)))) {
244 if (match(LHS, m_Not(m_Value(X)))) // ~X + C --> (C-1) - X
249 match(LHS, m_And(m_Value(X), m_ConstantInt(C2))) &&
289 if (match(FV, m_Zero()) && match(TV, m_Sub(m_Value(N), m_Specific(A))))
293 if (match(TV, m_Zero()) && match(FV, m_Sub(m_Value(N), m_Specific(A))))
336 if (match(RHS, m_Xor(m_Value(A), m_Value(B))) &
[all...] |
| /external/llvm/utils/lit/lit/ExampleTests/LLVM.InTree/test/ |
| lit.cfg | 74 m = re.match('set ([^ ]+) "([^"]*)"', line)
100 def addSuffixes(match):
101 if match[0] == '{' and match[-1] == '}':
102 cfg.suffixes = ['.' + s for s in match[1:-1].split(',')]
104 cfg.suffixes = ['.' + match]
117 m = simpleLibData.match(lib)
123 m = conditionalLibData.match(lib)
125 funcname,arg,match = m.groups()
126 addSuffixes(match)
[all...] |
| /external/llvm/utils/lit/lit/ExampleTests/LLVM.OutOfTree/src/test/ |
| lit.cfg | 74 m = re.match('set ([^ ]+) "([^"]*)"', line)
100 def addSuffixes(match):
101 if match[0] == '{' and match[-1] == '}':
102 cfg.suffixes = ['.' + s for s in match[1:-1].split(',')]
104 cfg.suffixes = ['.' + match]
117 m = simpleLibData.match(lib)
123 m = conditionalLibData.match(lib)
125 funcname,arg,match = m.groups()
126 addSuffixes(match)
[all...] |
| /external/skia/tests/ |
| PackBitsTest.cpp | 40 bool match = gTests[i].fCount == srcCount && memcmp(gTests[i].fSrc, src, local
42 REPORTER_ASSERT(reporter, match);
57 bool match = memcmp(src, src2, size * sizeof(uint16_t)) == 0; local
58 REPORTER_ASSERT(reporter, match);
93 bool match = gTests[i].fCount == srcCount && local
96 REPORTER_ASSERT(reporter, match);
111 bool match = memcmp(src, src2, size * sizeof(uint8_t)) == 0; local
112 REPORTER_ASSERT(reporter, match);
121 bool match = memcmp(src, src2 + skip, write) == 0; local
122 REPORTER_ASSERT(reporter, match);
[all...] |
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma_3/RegExp/ |
| 15.10.6.2-1.js | 29 * Performs a regular expression match of string against the regular
31 * the match, or null if the string did not match.
42 * 7. Call [[Match]], giving it the arguments S and i.
43 * If [[Match]] returned failure, go to step 8;
54 * there is a match; not from i to i+1, but from i to "endIndex" e:
59 * first match 'a b'. The next match will begin AFTER this, and so
81 actualmatch = string.match(pattern);
89 actualmatch = string.match(pattern)
[all...] |
| regress-87231.js | 34 * Recall that "?" means "match 0 or 1 times". Here, it should NOT do
35 * greedy matching: it should match 0 times instead of 1. This allows
36 * the 2nd subexpression to make the only match it can: the single 'A'.
37 * Such "altruism" is the only way there can be a successful global match...
59 actualmatch = string.match(pattern);
65 actualmatch = string.match(pattern);
71 actualmatch = string.match(pattern);
82 actualmatch = string.match(pattern);
88 actualmatch = string.match(pattern);
94 actualmatch = string.match(pattern)
[all...] |
| 15.10.2-1.js | 63 actualmatch = string.match(pattern);
70 actualmatch = string.match(pattern);
77 actualmatch = string.match(pattern);
84 actualmatch = string.match(pattern);
91 actualmatch = string.match(pattern);
98 actualmatch = string.match(pattern);
105 actualmatch = string.match(pattern);
112 actualmatch = string.match(pattern);
119 actualmatch = string.match(pattern);
126 actualmatch = string.match(pattern)
[all...] |
| /external/webkit/Source/WebCore/icu/unicode/ |
| usearch.h | 38 * There are 2 match options for selection:<br>
60 * Generally, match results in the forward direction will match the result
71 * <li> If the following match is to be found, the position should not be the
73 * character. Vice versa, if the preceding match is to be found,
77 * <li> If a following pattern match is to be found, any position within a
79 * preceding pattern match is to be found, a invalid starting point
123 * printf("Found match at %d pos, length is %d\n", pos,
188 * at which matches are detected. If a match is found, but
189 * the match's start or end index is not a boundary as
[all...] |
| /external/webkit/Source/WebKit/chromium/src/gtk/ |
| WebFontInfo.cpp | 152 FcPattern* match = FcFontMatch(0, pattern, &result); local
157 if (!match) {
158 FcPatternDestroy(match);
165 if (FcPatternGetBool(match, FC_ANTIALIAS, 0, &b) == FcResultMatch)
167 if (FcPatternGetBool(match, FC_EMBEDDED_BITMAP, 0, &b) == FcResultMatch)
169 if (FcPatternGetBool(match, FC_AUTOHINT, 0, &b) == FcResultMatch)
171 if (FcPatternGetBool(match, FC_HINTING, 0, &b) == FcResultMatch)
173 if (FcPatternGetInteger(match, FC_HINT_STYLE, 0, &i) == FcResultMatch)
175 if (FcPatternGetInteger(match, FC_RGBA, 0, &i) == FcResultMatch) {
193 FcPatternDestroy(match);
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/grid/ |
| GridMatch.java | 24 * A match for a drag within a GridLayout, corresponding to an alignment with another
35 /** Row or column for the match */
48 * Constructs a match.
51 * @param distance the absolute distance from the ideal match - used to find the best
52 * match
53 * @param matchedLine the actual X or Y location of the ideal match
83 * Describes the match for the user
85 * @param layout the GridLayout containing the match
86 * @return a short description for the user of the match
134 * Computes the sorting priority of this match, giving baseline matches highe
[all...] |
| /external/chromium/chrome/browser/autocomplete/ |
| search_provider.cc | 94 // description of the new first match in the call to
186 AutocompleteMatch match; local
187 match.provider = this;
188 match.contents.assign(l10n_util::GetStringUTF16(IDS_EMPTY_KEYWORD_VALUE));
189 match.contents_class.push_back(
191 matches_.push_back(match);
530 // the most relevant match for each result.
613 // match having a relevance greater than the previous, but they might be
631 // match will outrank us for URL-like inputs anyway, so we need not do
635 AutocompleteMatch match; local
898 AutocompleteMatch& match = *i; local
[all...] |
| /external/clang/unittests/Tooling/ |
| TestVisitor.h | 103 /// \brief Expect 'Match' *not* to occur at the given 'Line' and 'Column'.
106 void DisallowMatch(Twine Match, unsigned Line, unsigned Column) {
107 DisallowedMatches.push_back(MatchCandidate(Match, Line, Column));
110 /// \brief Expect 'Match' to occur at the given 'Line' and 'Column'.
114 void ExpectMatch(Twine Match, unsigned Line, unsigned Column) {
115 ExpectedMatches.push_back(ExpectedMatch(Match, Line, Column));
128 /// \brief Checks an actual match against expected and disallowed matches.
132 void Match(StringRef Name, SourceLocation Location) {
179 MatchCandidate const &Match) {
180 return Stream << Match.ExpectedNam
[all...] |
| /external/iproute2/examples/diffserv/ |
| Edge32-ca-u32 | 58 match ip tos 0x88 0xfc \
62 match ip tos 0x88 0xfc \
71 match ip tos 0x88 0xfc \
75 match ip tos 0x88 0xfc \
83 match ip tos 0x88 0xfc \
87 match ip tos 0x88 0xfc \
98 match ip tos 0x90 0xfc \
102 match ip tos 0x90 0xfc \
110 match ip tos 0x90 0xfc \
114 match ip tos 0x90 0xfc
[all...] |
| /external/iptables/extensions/ |
| libxt_ipvs.c | 50 "IPVS match options:\n"
54 "[!] --vproto protocol VIP protocol to match; by number or name,\n"
56 "[!] --vaddr address[/mask] VIP address to match\n"
57 "[!] --vport port VIP port to match; by number or name,\n"
62 " match, e.g. 21 for FTP\n"
224 static void ipvs_mt4_print(const void *ip, const struct xt_entry_match *match,
227 const struct xt_ipvs_mtinfo *data = (const void *)match->data;
231 static void ipvs_mt6_print(const void *ip, const struct xt_entry_match *match,
234 const struct xt_ipvs_mtinfo *data = (const void *)match->data;
238 static void ipvs_mt4_save(const void *ip, const struct xt_entry_match *match)
[all...] |
| libxt_iprange.c | 30 "iprange match options:\n"
31 "[!] --src-range ip[-ip] Match source IP in the specified range\n"
32 "[!] --dst-range ip[-ip] Match destination IP in the specified range\n");
92 "will never match\n", arg, dash + 1);
159 "iprange match: You must specify `--src-range' or `--dst-range'");
174 static void iprange_print(const void *ip, const struct xt_entry_match *match,
177 const struct ipt_iprange_info *info = (const void *)match->data;
194 iprange_mt4_print(const void *ip, const struct xt_entry_match *match,
197 const struct xt_iprange_mtinfo *info = (const void *)match->data;
220 iprange_mt6_print(const void *ip, const struct xt_entry_match *match,
[all...] |
| /external/iptables/iptables/ |
| iptables.xslt | 15 <xsl:template match="iptables-rules/table/chain/rule/conditions/*">
16 <!-- <match> is the psuedo module when a match module doesn't need to be loaded
18 <xsl:if test="name() != 'match'">
25 <xsl:template match="iptables-rules/table/chain/rule/actions|table/chain/rule/conditions">
29 <xsl:template match="iptables-rules/table/chain/rule/actions/goto">
34 <xsl:template match="iptables-rules/table/chain/rule/actions/call">
40 <xsl:template match="iptables-rules/table/chain/rule/actions/*">
47 <xsl:template match="iptables-rules/table/chain/rule/actions//*|iptables-rules/table/chain/rule/conditions//*" priority="0">
59 <xsl:template match="iptables-rules/table/chain/rule/actions/call/*|iptables-rules/table/chain/rule/actions/goto/*"
[all...] |
| /external/webkit/Tools/Scripts/webkitpy/common/checkout/ |
| changelog.py | 55 match = re.match(self.date_line_regexp, self._contents, re.MULTILINE)
56 if not match:
60 self._author_name = match.group("name") if match else None
61 self._author_email = match.group("email") if match else None
63 match = re.search("^\s+Reviewed by (?P<reviewer>.*?)[\.,]?\s*$", self._contents, re.MULTILINE) # Discard everything after the first period
64 self._reviewer_text = match.group("reviewer") if match else Non
[all...] |
| /frameworks/base/core/java/android/content/ |
| UriMatcher.java | 72 <p>Then when you need to match against a URI, call {@link #match}, providing
79 int match = sURIMatcher.match(url);
80 switch (match)
123 * @param code the code to match for the root URI
142 * Add a URI to match, and the code to return when this URI is
143 * matched. URI nodes may be exact match string, the token "*"
147 * @param authority the authority to match
148 * @param path the path to match. * may be used as a wild card fo
[all...] |
| /external/chromium/chrome/common/extensions/docs/examples/api/omnibox/extension-docs/ |
| background.html | 52 * Locates a match from the supplied keywords against text.
60 * @returns {String|null} A string containing <match> markup
61 * corresponding to the matched text, or null if no match was found.
76 style.push('<match>');
78 style.push('</match>');
93 * length, then alphabetically by name. An exact match will be
98 var match = null;
113 if (!match && searchText == name) {
114 match = this.corpus_[i]; // An exact match
[all...] |
| /frameworks/base/core/java/android/content/pm/ |
| ResolveInfo.java | 37 * The activity or broadcast receiver that corresponds to this resolution match,
44 * The service that corresponds to this resolution match, if this
56 * The declared priority of this match. Comes from the "priority"
71 * IntentFilter. This is a match constant, a combination of
75 public int match; field in class:ResolveInfo
94 * match's label. From the "label" attribute or, if not set, 0.
106 * match's icon. From the "icon" attribute or, if not set, 0.
190 * Return the icon resource identifier to use for this match. If the
191 * match defines an icon, that is used; else if the activity defines
194 * @return The icon associated with this match
[all...] |
| /external/opencv/cvaux/src/ |
| cvbgfg_gaussmix.cpp | 77 Return -1 if no match was found; otherwise the index in match[] is returned
82 static int icvMatchTest( double* src_pixel, int nChannels, int* match,
84 /*static int icvMatchTest2( double* src_pixel, int nChannels, int* match,
95 int* match,
99 int* match,
102 static void icvUpdatePartialWindow( double* src_pixel, int nChannels, int* match,
105 int* match,
112 static void icvBackgroundTest( const int nChannels, int n, int i, int j, int *match, CvGaussBGModel* bg_model );
127 //If there is no match the last gaussian in the list is replaced by the new gaussia
283 int match[CV_BGFG_MOG_MAX_NGAUSSIANS]; local
[all...] |
| /external/icu4c/test/cintltst/ |
| ucsdetst.c | 127 const UCharsetMatch *match; local
139 match = ucsdet_detect(csd, &status);
141 if (match == NULL) {
146 dLength = ucsdet_getUChars(match, detected, sLength, &status);
173 const UCharsetMatch *match; local
178 match = ucsdet_detect(csd, &status);
180 if (match == NULL) {
185 name = ucsdet_getName(match, &status);
186 conf = ucsdet_getConfidence(match, &status);
198 match = ucsdet_detect(csd, &status)
236 const UCharsetMatch *match; local
289 const UCharsetMatch *match; local
394 const UCharsetMatch *match; local
479 const UCharsetMatch *match; local
557 const UCharsetMatch *match; local
[all...] |
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 1 //===- FileCheck.cpp - Check that File's Contents match what is expected --===//
59 /// FixedStr - If non-empty, this pattern is a fixed string match with the
84 /// Match - Match the pattern string against the input buffer Buffer. This
85 /// returns the position that is matched or npos if there is no match. If
86 /// there is a match, the size of the matched string is returned in MatchLen.
89 /// variables and is updated if this match defines new values.
90 size_t Match(StringRef Buffer, size_t &MatchLen,
93 /// PrintFailureInfo - Print additional information about a failure to match
104 /// should correspond to a perfect match
[all...] |
| /external/regex-re2/re2/ |
| re2.h | 39 // Example: successful match
42 // Example: unsuccessful match (requires full match):
89 // to match any substring of the text.
119 // match regular expressions at the front of a string and skip over
120 // them as they match. This requires use of the "StringPiece" type,
136 // by 0 bytes. If the regular expression being used might match
141 // anchor your match at the beginning of the string. For example, you
152 // match arguments are determined at run time.
159 // bool match = RE2::FullMatchN(input, pattern, args, n)
[all...] |
| /bionic/libc/unistd/ |
| getopt_long.c | 168 * Returns -1 if short_too is set and the option does not match long_options.
176 int i, match; local
179 match = -1;
197 /* exact match */
198 match = i;
203 * a partial match of a single character.
208 if (match == -1) /* partial match */
209 match = i;
220 if (match != -1) { /* option found *
[all...] |
