Add dff-name-style

verilog/CST/BUILD

@@ -299,6 +299,7 @@ cc_test(
     deps = [
         ":expression",
         ":match-test-utils",
+        ":verilog-matchers",  # fixdeps: keep
         ":verilog-nonterminals",
         "//common/analysis:syntax-tree-search",
         "//common/analysis:syntax-tree-search-test-utils",
@@ -748,13 +749,15 @@ cc_test(
     deps = [
         ":match-test-utils",
         ":statement",
+        ":verilog-matchers",
         ":verilog-nonterminals",
         "//common/analysis:syntax-tree-search",
         "//common/analysis:syntax-tree-search-test-utils",
         "//common/analysis/matcher:matcher-builders",
         "//common/text:concrete-syntax-tree",
         "//common/text:symbol",
         "//common/text:text-structure",
+        "//common/text:tree-utils",
         "//common/util:logging",
         "//verilog/analysis:verilog-analyzer",
         "@com_google_absl//absl/strings:string_view",

verilog/CST/expression.cc

@@ -183,4 +183,33 @@ const verible::TokenInfo *ReferenceIsSimpleIdentifier(
   return ReferenceBaseIsSimple(base_node);
 }
 
+const verible::SyntaxTreeLeaf *GetIncrementDecrementOperator(
+    const verible::Symbol &expr) {
+  if (expr.Kind() != SymbolKind::kNode) return nullptr;
+
+  const SyntaxTreeNode &node = verible::SymbolCastToNode(expr);
+
+  if (!node.MatchesTag(NodeEnum::kIncrementDecrementExpression)) return nullptr;
+
+  // Structure changes depending on the type of IncrementDecrement
+  bool is_post = node.front().get()->Kind() == SymbolKind::kNode;
+
+  return verible::GetSubtreeAsLeaf(
+      expr, NodeEnum::kIncrementDecrementExpression, is_post ? 1 : 0);
+}
+
+const verible::SyntaxTreeNode *GetIncrementDecrementOperand(
+    const verible::Symbol &expr) {
+  if (expr.Kind() != SymbolKind::kNode) return nullptr;
+
+  const SyntaxTreeNode &node = verible::SymbolCastToNode(expr);
+
+  if (!node.MatchesTag(NodeEnum::kIncrementDecrementExpression)) return nullptr;
+
+  // Structure changes depending on the type of IncrementDecrement
+  bool is_post = node.front().get()->Kind() == SymbolKind::kNode;
+  return verible::GetSubtreeAsNode(
+      expr, NodeEnum::kIncrementDecrementExpression, is_post ? 0 : 1);
+}
+
 }  // namespace verilog

verilog/CST/expression.h

@@ -116,6 +116,16 @@ std::vector<verible::TreeSearchMatch> FindAllReferenceFullExpressions(
 const verible::TokenInfo *ReferenceIsSimpleIdentifier(
     const verible::Symbol &reference);
 
+// Return the operator for a kIncrementDecrementExpression
+// This function would extract the leaf containing '++' from expression '++a'
+const verible::SyntaxTreeLeaf *GetIncrementDecrementOperator(
+    const verible::Symbol &expr);
+
+// Return the operator for a kIncrementDecrementExpression
+// This function would extract the leaf containing 'a' from expression '++a'
+const verible::SyntaxTreeNode *GetIncrementDecrementOperand(
+    const verible::Symbol &expr);
+
 }  // namespace verilog
 
 #endif  // VERIBLE_VERILOG_CST_EXPRESSION_H_