| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Transformer/ |
| Transformer.h | 33 Transformer(transformer::RewriteRule Rule, ChangeConsumer Consumer)
34 : Rule(std::move(Rule)), Consumer(std::move(Consumer)) {}
45 transformer::RewriteRule Rule;
|
| RewriteRule.h | 72 // * Target: the source code impacted by the rule. This identifies an AST node,
84 // explanations of the entire rewrite should be set in the rule
99 // Or, if you are changing the node corresponding to the rule's matcher, you can
136 /// diagnostic `Explanation` with the rule.
169 // Every rewrite rule is triggered by a match against some AST node.
171 // a rewrite rule is applied.
257 // A *rewrite rule* describes a transformation of source code. A simple rule
270 // as a `Case` and a rule is a list of cases.
272 // Rule cases have an additional, implicit, component: the parameters. These ar
[all...] |
| /src/external/apache2/llvm/dist/clang/include/clang/Basic/ |
| AttrSubjectMatchRules.h | 24 const char *getSubjectMatchRuleSpelling(SubjectMatchRule Rule);
|
| /src/external/apache2/llvm/dist/llvm/utils/TableGen/ |
| Attributes.cpp | 75 for (auto *Rule : CompatRules) {
76 StringRef FuncName = Rule->getValueAsString("CompatFunc");
89 for (auto *Rule : MergeRules) {
90 StringRef FuncName = Rule->getValueAsString("MergeFunc");
|
| GICombinerEmitter.cpp | 131 /// A unique ID for this rule
136 /// A unique ID that can be used for anonymous objects belonging to this rule.
141 /// The record defining this rule.
167 /// add it to the rule with:
220 /// Export expansions for this rule
329 StringRef makeNameForAnonInstr(CombineRule &Rule) {
331 format("__anon%" PRIu64 "_%u", Rule.getID(), Rule.allocUID())));
334 StringRef makeDebugName(CombineRule &Rule, StringRef Name) {
335 return insertStrTab(Name.empty() ? makeNameForAnonInstr(Rule) : StringRef(Name))
[all...] |
| GlobalISelEmitter.cpp | 499 /// Determines if the table should be instrumented for rule coverage tracking.
674 for (Matcher *Rule : Rules)
675 Rule->emit(Table);
805 /// Generates code to check that a match rule matches.
812 /// A list of matchers that all need to succeed for the current rule to match.
819 /// A list of actions that need to be taken when all predicates in this rule
975 /// Report the maximum number of temporary operands needed by the rule
1142 RuleMatcher &Rule) const = 0;
1213 RuleMatcher &Rule) const override;
1264 RuleMatcher &Rule) const override
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Transformer/ |
| RewriteRule.cpp | 238 ApplyRuleCallback(RewriteRule Rule) : Rule(std::move(Rule)) {}
243 for (auto &Matcher : transformer::detail::buildMatchers(Rule))
251 transformer::detail::findSelectedCase(Result, Rule);
260 RewriteRule Rule;
269 rewriteDescendantsImpl(const T &Node, RewriteRule Rule,
271 ApplyRuleCallback Callback(std::move(Rule));
279 transformer::detail::rewriteDescendants(const Decl &Node, RewriteRule Rule,
281 return rewriteDescendantsImpl(Node, std::move(Rule), Result)
[all...] |
| Transformer.cpp | 25 for (auto &Matcher : transformer::detail::buildMatchers(Rule))
34 transformer::detail::findSelectedCase(Result, Rule);
|
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/Refactoring/ |
| RefactoringActionRulesInternal.h | 57 // Construct the target action rule by extracting the evaluated
59 auto Rule =
61 if (!Rule)
62 return Consumer.handleError(Rule.takeError());
63 Rule->invoke(Consumer, Context);
68 /// Scans the list of requirements in a rule and visits all the refactoring
120 "Expected a refactoring action rule type");
125 class Rule final : public RefactoringActionRule {
127 Rule(std::tuple<RequirementTypes...> Requirements)
151 return std::make_unique<Rule>(std::make_tuple(Requirements...))
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/MIRParser/ |
| MILexer.cpp | 325 static Cursor maybeLexIndex(Cursor C, MIToken &Token, StringRef Rule,
327 if (!C.remaining().startswith(Rule) || !isdigit(C.peek(Rule.size())))
330 C.advance(Rule.size());
338 static Cursor maybeLexIndexAndName(Cursor C, MIToken &Token, StringRef Rule,
340 if (!C.remaining().startswith(Rule) || !isdigit(C.peek(Rule.size())))
343 C.advance(Rule.size());
348 unsigned StringOffset = Rule.size() + Number.size();
379 const StringRef Rule = "%subreg."
[all...] |
| /src/external/apache2/llvm/dist/clang/tools/clang-refactor/ |
| ClangRefactor.cpp | 188 /// refactoring action rule.
261 for (const auto &Rule : this->ActionRules) {
262 if (Rule->hasSelectionRequirement()) {
274 for (const auto &Rule : this->ActionRules) {
277 Rule->visitRefactoringOptions(OptionCreator);
370 // Initializes the selected subcommand and refactoring rule based on the
376 auto Rule = getMatchingRule(**Subcommand);
377 if (!Rule)
378 return Rule.takeError();
381 MatchingRule = *Rule;
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaAttr.cpp | 747 getParentAttrMatcherRule(attr::SubjectMatchRule Rule) {
749 switch (Rule) {
760 bool isNegatedAttrMatcherSubRule(attr::SubjectMatchRule Rule) {
762 switch (Rule) {
813 // - a top-level rule and one of its sub-rules. E.g. variable and
815 // - a sub-rule and a sibling that's negated. E.g.
819 for (const auto &Rule : Rules) {
820 attr::SubjectMatchRule MatchRule = attr::SubjectMatchRule(Rule.first);
827 // A sub-rule contradicts a parent rule
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Basic/ |
| Attributes.cpp | 28 const char *attr::getSubjectMatchRuleSpelling(attr::SubjectMatchRule Rule) {
29 switch (Rule) {
35 llvm_unreachable("Invalid subject match rule");
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| LegalizerInfo.cpp | 104 // Make sure the rule won't (trivially) loop forever.
105 static bool hasNoSimpleLoops(const LegalizeRule &Rule, const LegalityQuery &Q,
107 switch (Rule.getAction()) {
121 static bool mutationIsSane(const LegalizeRule &Rule,
126 if (Rule.getAction() == Custom || Rule.getAction() == Legal)
133 switch (Rule.getAction()) {
142 if (Rule.getAction() == FewerElements) {
151 } else if (Rule.getAction() == MoreElements)
169 if (Rule.getAction() == NarrowScalar)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPULibFunc.cpp | 362 const ManglingRule& Rule;
366 const ManglingRule& rule)
367 : Leads(leads), Rule(rule), Index(0) {}
374 if (Index >= int(sizeof Rule.Param/sizeof Rule.Param[0])) return P;
376 const char R = Rule.Param[Index];
395 if (Index == (Rule.Lead[1] - 1)) P = Leads[1];
452 default: llvm_unreachable("Unhandeled param rule");
553 for (auto Rule : manglingRules
[all...] |
| /src/external/public-domain/tz/dist/ |
| ziguard.awk | 109 Rule_Eire = $0 ~ /^#?Rule[\t ]+Eire[\t ]/
125 Rule_Namibia = $0 ~ /^#?Rule[\t ]+Namibia[\t ]/
245 # In rearguard form, change the Japan rule line with "Sat>=8 25:00"
247 if ($0 ~ /^Rule/ && $2 == "Japan") {
264 if ($0 ~ /^Rule/) {
305 if (packrat_ignored && $0 !~ /^Rule/) {
|
| /src/external/apache2/llvm/dist/clang/utils/TableGen/ |
| ClangAttrEmitter.cpp | 1728 // Lookup the options in the sub-rule first, in case the sub-rule
1745 assert(isSubRule() && "Not a sub-rule");
1799 assert(IsRule && "not a rule!");
1808 getRule(const AttributeSubjectMatchRule &Rule) {
1809 return RuleOrAggregateRuleSet(Rule, /*IsRule=*/true);
1903 continue; // Assume that the rule will be included as well.
1932 for (const auto &Rule : Rules) {
1933 OS << (Rule.isSubRule() ? "ATTR_MATCH_SUB_RULE" : "ATTR_MATCH_RULE") << '(';
1934 OS << Rule.getEnumValueName() << ", \"" << Rule.getSpelling() << "\",
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| GenericTaintChecker.cpp | 249 /// Get the propagation rule for a given function.
280 /// taint rule.
428 TaintPropagationRule Rule =
469 if (!Rule.isNull())
470 return Rule;
496 if (Rule.isNull()) {
561 // First, try generating a propagation rule for this function.
562 TaintPropagationRule Rule = TaintPropagationRule::getTaintPropagationRule(
564 if (!Rule.isNull()) {
565 ProgramStateRef State = Rule.process(Call, C)
[all...] |
| /src/external/gpl3/gcc/dist/libstdc++-v3/src/c++20/ |
| tzdb.cc | 118 struct Rule;
123 // Each _Node contains a tzdb and a vector<Rule> with the rule set.
129 vector<Rule> rules;
184 // The data structures defined in this file (Rule, on_day, at_time etc.)
269 // The IN and ON fields of a RULE record, e.g. "March lastSunday".
338 // fields of a Rule line. The FROM field is a year and TO is a year or
400 // Expand "%s" to the variable part, given by Rule::letters.
500 // If this object references a named Rule then we can't populate
553 // A RULE record from the tzdata.zi timezone info file
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/com_err/ |
| parse.c | 625 /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
699 positive, shift that token. If negative, reduce the rule whose
724 /* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
731 /* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
871 YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
884 # define YY_REDUCE_PRINT(Rule) \
[all...] |
| /src/external/gpl3/binutils/dist/binutils/ |
| arparse.c | 655 /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
748 positive, shift that token. If negative, reduce the rule whose
778 /* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
788 /* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
931 YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
944 # define YY_REDUCE_PRINT(Rule) \
[all...] |
| /src/external/gpl3/binutils.old/dist/binutils/ |
| arparse.c | 655 /* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
748 positive, shift that token. If negative, reduce the rule whose
778 /* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
788 /* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
931 YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
944 # define YY_REDUCE_PRINT(Rule) \
[all...] |
| /src/sys/external/bsd/acpica/dist/compiler/ |
| dtcompilerparser.tab.c | 484 /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
501 /* YYRLINE[YYN] -- source line where rule number YYN was defined. */
530 /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
537 /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
544 /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
575 positive, shift that token. If negative, reduce the rule which
823 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
836 # define YY_REDUCE_PRINT(Rule) \
839 yy_reduce_print (yyvsp, Rule); \
849 # define YY_REDUCE_PRINT(Rule)
[all...] |
| dtparser.tab.c | 503 /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
527 /* YYRLINE[YYN] -- source line where rule number YYN was defined. */
566 /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
574 /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
582 /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
621 positive, shift that token. If negative, reduce the rule which
905 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
918 # define YY_REDUCE_PRINT(Rule) \
921 yy_reduce_print (yyvsp, Rule); \
931 # define YY_REDUCE_PRINT(Rule)
[all...] |
| prparser.tab.c | 505 /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
530 /* YYRLINE[YYN] -- source line where rule number YYN was defined. */
569 /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
577 /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
585 /* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state
624 positive, shift that token. If negative, reduce the rule which
908 YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
921 # define YY_REDUCE_PRINT(Rule) \
924 yy_reduce_print (yyvsp, Rule); \
934 # define YY_REDUCE_PRINT(Rule)
[all...] |
