| /external/llvm/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 94 // matched pattern has a chain but the root node doesn't.
95 const PatternToMatch &Pattern = CM->getPattern();
98 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP))
105 // because the code in the pattern generator doesn't handle it right. We
108 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP))
130 Pattern));
322 // If we're down to a single pattern to match, then we don't need this scope
|
| DAGISelMatcherEmitter.cpp | 426 const ComplexPattern &Pattern = CCPM->getPattern();
427 OS << "OPC_CheckComplexPat, /*CP*/" << getComplexPat(Pattern) << ", /*#*/"
431 OS.PadToColumn(CommentIndent) << "// " << Pattern.getSelectFunc();
433 for (unsigned i = 0, e = Pattern.getNumOperands(); i != e; ++i)
436 if (Pattern.hasProperty(SDNPHasChain))
639 // Emit pattern predicates.
657 // Emit the predicate code corresponding to this pattern.
680 OS << " default: llvm_unreachable(\"Invalid pattern # in table?\");\n";
693 // If the complex pattern wants the root of the match, pass it in as the
698 // If the complex pattern wants the parent of the operand being matched
[all...] |
| /external/swiftshader/third_party/LLVM/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 76 // to the root of the pattern.
104 // matched pattern has a chain but the root node doesn't.
105 const PatternToMatch &Pattern = CM->getPattern();
108 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP))
115 // because the code in the pattern generator doesn't handle it right. We
118 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP))
141 Pattern));
172 /// SinkPatternPredicates - Pattern predicates can be checked at any level of
173 /// the matching tree. The generator dumps them at the top level of the pattern
175 /// optimization sinks them as far down into the pattern as possible
[all...] |
| DAGISelMatcherEmitter.cpp | 384 const ComplexPattern &Pattern = CCPM->getPattern();
385 OS << "OPC_CheckComplexPat, /*CP*/" << getComplexPat(Pattern) << ", /*#*/"
389 OS.PadToColumn(CommentIndent) << "// " << Pattern.getSelectFunc();
391 for (unsigned i = 0, e = Pattern.getNumOperands(); i != e; ++i)
394 if (Pattern.hasProperty(SDNPHasChain))
600 // Emit pattern predicates.
624 // Emit the predicate code corresponding to this pattern.
644 OS << " default: assert(0 && \"Invalid pattern # in table?\");\n";
657 // If the complex pattern wants the root of the match, pass it in as the
662 // If the complex pattern wants the parent of the operand being matched
[all...] |
| /external/v8/src/profiler/ |
| tick-sample.cc | 27 struct Pattern {
33 static Pattern patterns[] = {
57 for (Pattern* pattern = patterns; pattern->bytes_count; ++pattern) {
58 for (int* offset_ptr = pattern->offsets; *offset_ptr != -1; ++offset_ptr) {
61 MSAN_MEMORY_IS_INITIALIZED(pc - offset, pattern->bytes_count);
62 if (!memcmp(pc - offset, pattern->bytes, pattern->bytes_count)
[all...] |
| /frameworks/rs/tests/java_api/RSUnitTests/src/com/android/rs/unittest/ |
| UT_check_dims.java | 30 static final int Pattern = 0xA5A5A5A5;
51 s.set_pattern(Pattern);
55 mData[i] = Pattern;
|
| /frameworks/rs/tests/java_api/RSUnitTests/supportlibsrc_gen/com/android/rs/unittest/ |
| UT_check_dims.java | 32 static final int Pattern = 0xA5A5A5A5;
53 s.set_pattern(Pattern);
57 mData[i] = Pattern;
|
| /packages/apps/Settings/tests/robotests/src/com/android/settings/password/ |
| ChooseLockGenericControllerTest.java | 42 import java.util.regex.Pattern;
176 .containsMatch(Pattern.compile(lock.toString(), Pattern.CASE_INSENSITIVE));
185 ScreenLockType.PATTERN,
197 ScreenLockType.PATTERN,
|
| /packages/apps/TV/common/src/com/android/tv/common/util/ |
| PostalCodeUtils.java | 30 import java.util.regex.Pattern;
46 private static final Map<String, Pattern> REGION_PATTERN = new HashMap<>();
50 REGION_PATTERN.put(Locale.US.getCountry(), Pattern.compile(POSTCODE_REGEX_US));
53 Pattern.compile(POSTCODE_REGEX_GB + "|" + POSTCODE_REGEX_GB_GIR));
122 Pattern pattern = REGION_PATTERN.get(region.toUpperCase()); local
123 return pattern == null || pattern.matcher(postcode).matches();
|
| /build/kati/ |
| strutil.cc | 189 Pattern::Pattern(StringPiece pat) : pat_(pat), percent_index_(pat.find('%')) {}
191 bool Pattern::Match(StringPiece str) const {
197 bool Pattern::MatchImpl(StringPiece str) const {
202 StringPiece Pattern::Stem(StringPiece str) const {
209 void Pattern::AppendSubst(StringPiece str,
238 void Pattern::AppendSubstRef(StringPiece str,
|
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
| sre_parse.py | 4 # convert re-style regular expression to sre pattern
65 class Pattern:
66 # master pattern object. keeps track of global attributes
92 def __init__(self, pattern, data=None):
93 self.pattern = pattern
143 return SubPattern(self.pattern, self.data[index])
332 raise error, "pattern not properly closed"
385 raise error, "pattern not properly closed"
396 # parse a simple pattern
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
| sre_parse.py | 4 # convert re-style regular expression to sre pattern
65 class Pattern:
66 # master pattern object. keeps track of global attributes
90 def __init__(self, pattern, data=None):
91 self.pattern = pattern
132 return SubPattern(self.pattern, self.data[index])
316 raise error, "pattern not properly closed"
369 raise error, "pattern not properly closed"
380 # parse a simple pattern
[all...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Protocol/PlatformMemTest/ |
| PlatformMemTest.h | 76 // This describes the pattern for testing all memory cells
81 VOID *Pattern; // Array of patterns
90 EFI_PHYSICAL_ADDRESS *Pattern; // Array of patterns
|
| /external/clang/lib/ASTMatchers/ |
| ASTMatchersInternal.cpp | 369 /// Consumes the name suffix from each pattern in the set and removes the ones
385 /// A match will be a pattern that was fully consumed, that also matches the
395 struct Pattern {
399 llvm::SmallVector<Pattern, 8> Patterns;
482 for (const StringRef Pattern : Names) {
483 if (Pattern.startswith("::")) {
484 if (FullName == Pattern)
486 } else if (FullName.endswith(Pattern) &&
487 FullName.drop_back(Pattern.size()).endswith("::")) {
|
| /external/desugar/test/java/com/google/devtools/build/android/desugar/classes_for_testing_type_inference/testsubjects/ |
| TestSubject.java | 26 import java.util.regex.Pattern;
43 Pattern.compile((String) key);
|
| /external/guava/guava/src/com/google/common/base/ |
| Predicates.java | 30 import java.util.regex.Pattern;
248 * regular expression pattern. The test used is equivalent to
249 * {@code Pattern.compile(pattern).matcher(arg).find()}
251 * @throws java.util.regex.PatternSyntaxException if the pattern is invalid
254 @GwtIncompatible(value = "java.util.regex.Pattern")
255 public static Predicate<CharSequence> containsPattern(String pattern) {
256 return new ContainsPatternFromStringPredicate(pattern);
262 * regular expression pattern. The test used is equivalent to
263 * {@code pattern.matcher(arg).find()
578 final Pattern pattern; field in class:Predicates.ContainsPatternPredicate
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| SymbolRewriter.cpp | 31 // + Transform (pattern transformation)
36 // + Transform (pattern transformation)
40 // + Transform (pattern transformation)
137 const std::string Pattern;
141 : RewriteDescriptor(DT), Pattern(P), Transform(T) { }
160 std::string Name = Regex(Pattern).sub(Transform, C.getName(), &Error);
203 /// Represents a rewrite for a regular expression based pattern for functions.
204 /// A pattern for the function name is provided and a transformation for that
205 /// pattern to determine the target function name create the rewrite rule.
211 /// Represents a rewrite for a global variable based upon a matching pattern
[all...] |
| /external/markdown/markdown/ |
| inlinepatterns.py | 6 objects, one per pattern. Pattern objects must be instances of classes
7 that extend markdown.Pattern. Each pattern object uses a single regular
10 pattern.getCompiledRegExp() # returns a regular expression
12 pattern.handleMatch(m) # takes a match object and returns
15 All of python markdown's built-in patterns subclass from Pattern,
21 Pattern takes care of adding the "^(.*)" and "(.*)!".
112 The pattern classes
116 class Pattern
[all...] |
| /external/python/cpython2/Lib/ |
| sre_parse.py | 4 # convert re-style regular expression to sre pattern
65 class Pattern:
66 # master pattern object. keeps track of global attributes
92 def __init__(self, pattern, data=None):
93 self.pattern = pattern
143 return SubPattern(self.pattern, self.data[index])
332 raise error, "pattern not properly closed"
385 raise error, "pattern not properly closed"
396 # parse a simple pattern
[all...] |
| /external/python/cpython2/Mac/Modules/qd/ |
| qdsupport.py | 62 Pattern = StructOutputBufferType('Pattern')
63 Pattern_ptr = StructInputBufferType('Pattern')
|
| /external/python/cpython3/Lib/ |
| sre_parse.py | 4 # convert re-style regular expression to sre pattern
74 class Pattern:
75 # master pattern object. keeps track of global attributes
111 def __init__(self, pattern, data=None):
112 self.pattern = pattern
165 return SubPattern(self.pattern, self.data[index])
204 i, j = self.pattern.groupwidths[av]
244 raise error("bad escape (end of pattern)",
470 # parse a simple pattern
[all...] |
| /libcore/ojluni/src/main/java/java/util/regex/ |
| Pattern.java | 48 * an instance of this class. The resulting pattern can then be used to create
52 * matcher, so many matchers can share the same pattern.
57 * Pattern p = Pattern.{@link #compile compile}("a*b");
67 * boolean b = Pattern.matches("a*b", "aaaaab");</pre></blockquote>
70 * is less efficient since it does not allow the compiled pattern to be reused.
539 * <tt>"\\u2014"</tt>, while not equal, compile into the same pattern, which
563 * The script names supported by <code>Pattern</code> are the valid script names
572 * The block names supported by <code>Pattern</code> are the valid block names
924 private final String pattern; field in class:Pattern
984 public String pattern() { method in class:Pattern
[all...] |
| /packages/apps/Messaging/src/com/android/messaging/receiver/ |
| SmsReceiver.java | 36 import java.util.regex.Pattern;
65 private static ArrayList<Pattern> sIgnoreSmsPatterns;
312 // Get the pattern set from GServices
319 sIgnoreSmsPatterns = new ArrayList<Pattern>();
322 sIgnoreSmsPatterns.add(Pattern.compile(ignoreSmsExpressions[i]));
354 for (final Pattern pattern : sIgnoreSmsPatterns) {
355 if (pattern.matcher(messageBody).matches()) {
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/ |
| sre_parse.py | 4 # convert re-style regular expression to sre pattern
66 class Pattern:
67 # master pattern object. keeps track of global attributes
91 def __init__(self, pattern, data=None):
92 self.pattern = pattern
133 return SubPattern(self.pattern, self.data[index])
317 raise error, "pattern not properly closed"
370 raise error, "pattern not properly closed"
381 # parse a simple pattern
[all...] |
| /prebuilts/gdb/linux-x86/lib/python2.7/ |
| sre_parse.py | 4 # convert re-style regular expression to sre pattern
66 class Pattern:
67 # master pattern object. keeps track of global attributes
91 def __init__(self, pattern, data=None):
92 self.pattern = pattern
133 return SubPattern(self.pattern, self.data[index])
317 raise error, "pattern not properly closed"
370 raise error, "pattern not properly closed"
381 # parse a simple pattern
[all...] |
