move into the com.verisign.tat package (leaving unbound behind. sniff.)

[captive-validator.git] / src / com / versign / tat / dnssec / ValUtils.java

diff --git a/src/se/rfc/unbound/ValUtils.java b/src/com/versign/tat/dnssec/ValUtils.java
similarity index 96%
rename from src/se/rfc/unbound/ValUtils.java
rename to src/com/versign/tat/dnssec/ValUtils.java
index 6778b3c..8e5a344 100644 (file)
--- a/src/se/rfc/unbound/ValUtils.java
+++ b/src/com/versign/tat/dnssec/ValUtils.java
@@ -28,7 +28,7 @@
  *
  */
 
-package se.rfc.unbound;
+package com.versign.tat.dnssec;
 
 import java.security.MessageDigest;
 import java.security.NoSuchAlgorithmException;
@@ -470,12 +470,33 @@ public class ValUtils
     return false;
   }
 
-  private static RRSIGRecord rrsetFirstSig(RRset rrset) {
+  public static RRSIGRecord rrsetFirstSig(RRset rrset) {
       for (Iterator i = rrset.sigs(); i.hasNext(); ) {
           return (RRSIGRecord) i.next();
       }
       return null;
   }
+  
+  public static Name longestCommonName(Name domain1, Name domain2) {
+    if (domain1 == null || domain2 == null) return null;
+    // for now, do this in a a fairly brute force way
+    // FIXME: convert this to direct operations on the byte[]
+    
+    int this_labels = domain1.labels();
+    int name_labels = domain2.labels();
+    
+    int l = (this_labels < name_labels) ? this_labels : name_labels;
+    for (int i = l; i > 0; i--)
+    {
+      Name n = new Name(domain2, name_labels - i);
+      if (n.equals(name, offset(this_labels - i)))
+      {
+        return n;
+      }
+    }
+    
+    return root;
+  }
   /**
    * Determine by looking at a signed RRset whether or not the rrset name was
    * the result of a wildcard expansion.