GP-6921: from GP-X

GP-6921: stashed changes

GP-6921: basic plugin

GP-6921: viable plugin

GP-6921: tags

GP-6921: bug fix

GP-6921: NPE

GP-6921: minor mods

GP-6921: aisle 9

GP-6921: working the bugs...

GP-6921: close to previous script results

GP-6921: intermediate stuff

GP-6921: mostly working

GP-6921: building struct

GP-6921: better action names

GP-6921: suggestions

GP-6921: better messaging

GP-6921: start on docs

GP-6921: docs

GP-6921: doc edits

GP-6921: one more suggestion pass

GP-6921: better conflict resolution

GP-6921: shrink

GP-6921: matching

GP-6921: more options; include offset equals

GP-6921: more options; include offset equals

GP-6921: from review (ongoing)

GP-6921: one more...

GP-6921: actions

GP-6921: from review...

GP-6921: temp

GP-6921: bookmarks?

GP-6921: tag -> bkmk

GP-6921: tag -> bkmk (pt2)

GP-6921: merge?

GP-6921: pinning mod

GP-6921: revert

GP-6921: revert

GP-6921: post-review

GP-6921: skip merge

GP-6921: finally

GP-6921: and release

GP-6921: mo' betta

GP-6921: mo' betta

GP-6921: mo' betta

GP-6921: typo

GP-6921: help oops

GP-6921: help oops

Ghidra/Features/CodeCompare/src/main/java/ghidra/features/codecompare/graphanalysis/DataVertex.java

@@ -4,9 +4,9 @@
  * Licensed under the Apache License, Version 2.0 (the "License");
  * you may not use this file except in compliance with the License.
  * You may obtain a copy of the License at
- * 
+ *
  *      http://www.apache.org/licenses/LICENSE-2.0
- * 
+ *
  * Unless required by applicable law or agreed to in writing, software
  * distributed under the License is distributed on an "AS IS" BASIS,
  * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
@@ -212,4 +212,34 @@ public class DataVertex {
 		}
 		return PcodeOp.isCommutative(opc);
 	}
+
+	public PcodeOpAST getOp() {
+		return op;
+	}
+
+	public VarnodeAST getVarnode() {
+		return vn;
+	}
+
+	public ArrayList<DataVertex> getSources() {
+		return sources;
+	}
+
+	/**
+	 * Get the depth at which the pairing occurred
+	 * @return depth of pairing
+	 */
+	public int getDepthPaired() {
+		int size = ngrams.size();
+		if (size <= 0) {
+			return 0;
+		}
+		DataNGram gramPaired = ngrams.get(size - 1);
+		for (DataNGram gram : ngrams) {
+			if (gram.hash == gramPaired.hash) {
+				return gram.depth;
+			}
+		}
+		return 0;
+	}
 }

Ghidra/Features/CodeCompare/src/main/java/ghidra/features/codecompare/graphanalysis/Pinning.java

@@ -908,4 +908,8 @@ public class Pinning {
 		}
 		return result;
 	}
+
+	public Map<DataVertex, DataVertex> getPinMap() {
+		return pinMap;
+	}
 }