| /src/external/mpl/bind/dist/bin/tests/system/isctest/ |
| transfer.py | 12 from re import Pattern
18 zone: str, source_ns: str | None, msg: str | Pattern, port: int | None = None
19 ) -> Pattern:
26 Always returns a compiled Pattern. When source_ns or port is None,
35 or a compiled Pattern whose .pattern is spliced in as-is
41 msg_str = msg.pattern if isinstance(msg, Pattern) else re.escape(msg)
|
| text.py | 15 from re import Match, Pattern
22 FlexPattern = str | Pattern
25 def compile_pattern(string: FlexPattern) -> Pattern:
26 if isinstance(string, Pattern):
30 raise TypeError("only string and re.Pattern allowed")
35 Implement a grep-like interface for pattern matching in texts and files.
42 def igrep(self, pattern: FlexPattern) -> Iterator[Match]:
44 Iterate over the lines matching the pattern.
46 regex = compile_pattern(pattern)
53 def grep(self, pattern: FlexPattern) -> list[Match]
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/IR/ |
| DiagnosticHandler.cpp | 25 std::shared_ptr<Regex> Pattern;
30 Pattern = std::make_shared<Regex>(Val);
32 if (!Pattern->isValid(RegexError))
47 "pass-remarks", cl::value_desc("pattern"),
56 "pass-remarks-missed", cl::value_desc("pattern"),
66 "pass-remarks-analysis", cl::value_desc("pattern"),
75 return (PassRemarksAnalysisOptLoc.Pattern &&
76 PassRemarksAnalysisOptLoc.Pattern->match(PassName));
79 return (PassRemarksMissedOptLoc.Pattern &&
80 PassRemarksMissedOptLoc.Pattern->match(PassName))
[all...] |
| /src/lib/libcurses/PSD.doc/ |
| twinkle1.c | 52 static int Pattern, /* current pattern number */
53 Numstars; /* number of stars in pattern */
96 * Make the current board setup. It picks a random pattern and
97 * calls ison() to determine if the character is on that pattern
106 Pattern = rand() % MAXPATTERNS;
119 * Return TRUE if (y, x) is on the current pattern.
124 switch (Pattern) {
133 case 2: /* holy pattern! */
|
| twinkle2.c | 50 static int Pattern, /* current pattern number */
51 Numstars; /* number of stars in pattern */
164 * Make the current board setup. It picks a random pattern and
165 * calls ison() to determine if the character is on that pattern
174 Pattern = rand() % MAXPATTERNS;
187 * Return TRUE if (y, x) is on the current pattern.
192 switch (Pattern) {
201 case 2: /* holy pattern! */
|
| /src/external/apache2/llvm/dist/llvm/utils/lit/lit/ |
| BooleanExpression.py | 43 # Tokenization pattern.
44 Pattern = re.compile(r'\A\s*([()]|[-+=._a-zA-Z0-9]+|&&|\|\||!)\s*(.*)\Z')
49 m = re.match(BooleanExpression.Pattern, string)
|
| /src/external/mpl/bind/dist/bin/tests/system/isctest/log/ |
| watchlog.py | 12 from re import Match, Pattern
75 def _setup_wait(self, patterns: OneOrMore[FlexPattern]) -> list[Pattern]:
80 def _prepare_patterns(self, strings: OneOrMore[FlexPattern]) -> list[Pattern]:
82 Convert a mix of string(s) and/or pattern(s) into a list of patterns.
94 def _wait_for_match(self, regexes: list[Pattern]) -> Match:
108 f"{' | '.join([regex.pattern for regex in regexes])}"
116 either a regular expression pattern, or a string which should be
136 pattern = Re(r"next key event in ([0-9]+) seconds")
139 match = watcher.wait_for_line(pattern)
215 Block execution until the specified pattern sequence is found in th
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| SymbolRewriter.cpp | 30 // + Transform (pattern transformation)
35 // + Transform (pattern transformation)
39 // + Transform (pattern transformation)
159 const std::string Pattern;
163 : RewriteDescriptor(DT), Pattern(std::string(P)),
185 std::string Name = Regex(Pattern).sub(Transform, C.getName(), &Error);
228 /// Represents a rewrite for a regular expression based pattern for functions.
229 /// A pattern for the function name is provided and a transformation for that
230 /// pattern to determine the target function name create the rewrite rule.
235 /// Represents a rewrite for a global variable based upon a matching pattern
[all...] |
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| DAGISelMatcherOpt.cpp | 97 // matched pattern has a chain but the root node doesn't.
98 const PatternToMatch &Pattern = CM->getPattern();
101 Pattern.getSrcPattern()->NodeHasProperty(SDNPHasChain, CGP))
108 // because the code in the pattern generator doesn't handle it right. We
111 Pattern.getSrcPattern()->NodeHasProperty(SDNPOutGlue, CGP))
133 Pattern));
335 // If we're down to a single pattern to match, then we don't need this scope
|
| DAGISelMatcherEmitter.cpp | 228 // Get where the pattern prototype was instantiated
338 "Using only 16 bits to encode offset into Pattern Table");
340 "The sizes of Pattern and include vectors should be the same");
624 const ComplexPattern &Pattern = CCPM->getPattern();
625 OS << "OPC_CheckComplexPat, /*CP*/" << getComplexPat(Pattern) << ", /*#*/"
629 OS << " // " << Pattern.getSelectFunc();
631 for (unsigned i = 0, e = Pattern.getNumOperands(); i != e; ++i)
634 if (Pattern.hasProperty(SDNPHasChain))
899 // Emit the predicate code corresponding to this pattern.
915 // Emit pattern predicates
[all...] |
| DAGISelMatcherGen.cpp | 54 const PatternToMatch &Pattern;
57 /// PatWithNoTypes - This is a clone of Pattern.getSrcPattern() that starts
90 /// physreg input to the pattern. The first elt is the Register node, the
91 /// second is the recorded slot number the input pattern match saved it in.
101 MatcherGen(const PatternToMatch &pattern, const CodeGenDAGPatterns &cgp);
146 MatcherGen::MatcherGen(const PatternToMatch &pattern,
148 : Pattern(pattern), CGP(cgp), NextRecordedOperandNo(0),
150 // We need to produce the matcher tree for the patterns source pattern. To do
156 // To figure out the fewest number of type checks needed, clone the pattern,
[all...] |
| DAGISelMatcher.h | 1 //===- DAGISelMatcher.h - Representation of DAG pattern matcher -*- C++ -*-===//
30 Matcher *ConvertPatternToMatcher(const PatternToMatch &Pattern,unsigned Variant,
403 /// to see if the entire pattern is capable of matching. This predicate does
690 const ComplexPattern &Pattern;
703 CheckComplexPatMatcher(const ComplexPattern &pattern, unsigned matchnumber,
705 : Matcher(CheckComplexPat), Pattern(pattern), MatchNumber(matchnumber),
708 const ComplexPattern &getPattern() const { return Pattern; }
721 return &cast<CheckComplexPatMatcher>(M)->Pattern == &Pattern &
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/ |
| ASTMatchersInternal.cpp | 535 /// Consumes the name suffix from each pattern in the set and removes the ones
552 /// A match will be a pattern that was fully consumed, that also matches the
555 return llvm::any_of(Patterns, [&](const Pattern &Pattern) {
556 return Pattern.P.empty() &&
557 (AllowFullyQualified || !Pattern.IsFullyQualified);
562 struct Pattern {
567 llvm::SmallVector<Pattern, 8> Patterns;
653 for (const StringRef Pattern : Names) {
654 if (Pattern.startswith("::"))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Index/ |
| IndexDecl.cpp | 211 const CXXRecordDecl *Pattern = CTD->getTemplatedDecl();
213 for (const NamedDecl *ND : Pattern->lookup(D->getDeclName())) {
|
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaTemplateVariadic.cpp | 606 Sema::CheckPackExpansion(TypeSourceInfo *Pattern, SourceLocation EllipsisLoc,
609 QualType Result = CheckPackExpansion(Pattern->getType(),
610 Pattern->getTypeLoc().getSourceRange(),
616 TLB.pushFullCopy(Pattern->getTypeLoc());
623 QualType Sema::CheckPackExpansion(QualType Pattern, SourceRange PatternRange,
627 // The pattern of a pack expansion shall name one or more
631 // A pattern containing a deduced type can't occur "naturally" but arises in
633 if (!Pattern->containsUnexpandedParameterPack() &&
634 !Pattern->getContainedDeducedType()) {
640 return Context.getPackExpansionType(Pattern, NumExpansions
[all...] |
| SemaTemplateDeduction.cpp | 689 /// Prepare to deduce the packs named within Pattern.
692 TemplateDeductionInfo &Info, TemplateArgument Pattern)
694 unsigned NumNamedPacks = addPacks(Pattern);
725 unsigned addPacks(TemplateArgument Pattern) {
751 auto Collect = [&](TemplateArgument Pattern) {
753 S.collectUnexpandedParameterPacks(Pattern, Unexpanded);
762 // Look for unexpanded packs in the pattern.
763 Collect(Pattern);
769 // the sizes of the packs in this pattern.
1068 QualType Pattern = Expansion->getPattern()
[all...] |
| SemaTemplateInstantiateDecl.cpp | 947 TypeAliasDecl *Pattern = D->getTemplatedDecl();
950 if (getPreviousDeclForInstantiation<TypedefNameDecl>(Pattern)) {
951 DeclContext::lookup_result Found = Owner->lookup(Pattern->getDeclName());
958 InstantiateTypedefNameDecl(Pattern, /*IsTypeAlias=*/true));
1234 // parameters into the pattern type and checking the result.
1380 EnumDecl *Enum, EnumDecl *Pattern) {
1384 Enum->setLocation(Pattern->getLocation());
1389 for (auto *EC : Pattern->enumerators()) {
1426 if (Pattern->getDeclContext()->isFunctionOrMethod() &&
1459 CXXRecordDecl *Pattern = D->getTemplatedDecl()
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/FileCheck/ |
| FileCheckImpl.h | 453 // Pattern handling code.
456 /// Class holding the Pattern global state, shared by all patterns: tables
460 friend class Pattern;
463 /// When matching a given pattern, this holds the value of all the string
464 /// variables defined in previous patterns. In a pattern, only the last
474 /// When matching a given pattern, this holds the pointers to the classes
476 /// matching a pattern all definitions for that pattern are recorded in the
477 /// NumericVariableDefs table in the Pattern instance of that pattern
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-profgen/ |
| PerfReader.cpp | 578 constexpr static const char *const Pattern =
597 Regex RegMmap2(Pattern);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Basic/ |
| CodeGenOptions.h | 285 RK_WithPattern, // Remark pattern specified via '-Rgroup=regexp'.
288 /// Optimization remark with an optional regular expression pattern.
291 std::string Pattern;
295 OptRemark() : Kind(RK_Missing), Pattern(""), Regex(nullptr) {}
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/ |
| ELFYAML.h | 280 Optional<yaml::BinaryRef> Pattern;
|
| /src/external/apache2/llvm/dist/clang/lib/CodeGen/ |
| CGDecl.cpp | 1008 /// Generate a constant filled with either a pattern or zeroes.
1059 /// Replace all padding bytes in a given constant with either a pattern byte or
1198 // If the initializer is a repeated byte pattern, use memset.
1199 llvm::Value *Pattern =
1201 if (Pattern) {
1203 if (!isa<llvm::UndefValue>(Pattern)) {
1204 const llvm::APInt &AP = cast<llvm::ConstantInt>(Pattern)->getValue();
1717 case LangOptions::TrivialAutoVarInitKind::Pattern:
1752 case LangOptions::TrivialAutoVarInitKind::Pattern: {
1874 (trivialAutoVarInit == LangOptions::TrivialAutoVarInitKind::Pattern)
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/powerplay/inc/ |
| smu72_discrete.h | 44 SMIO_Pattern Pattern[SMU_MAX_SMIO_LEVELS];
|
| smu73_discrete.h | 43 SMIO_Pattern Pattern[SMU_MAX_SMIO_LEVELS];
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| ExprCXX.h | 4037 /// A pack expansion expression contains a pattern (which itself is an
4048 /// pattern is \c static_cast<Types&&>(args). When the \c forward function
4064 Stmt *Pattern;
4067 PackExpansionExpr(QualType T, Expr *Pattern, SourceLocation EllipsisLoc,
4069 : Expr(PackExpansionExprClass, T, Pattern->getValueKind(),
4070 Pattern->getObjectKind()),
4073 Pattern(Pattern) {
4079 /// Retrieve the pattern of the pack expansion.
4080 Expr *getPattern() { return reinterpret_cast<Expr *>(Pattern); }
[all...] |
