2 * Copyright (c) 2009 VeriSign, Inc. All rights reserved.
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. The name of the author may not be used to endorse or promote products
14 * derived from this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
17 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
18 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
19 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
20 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
21 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
22 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
23 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
25 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 package com.versign.tat.dnssec;
31 import java.util.HashMap;
34 import org.xbill.DNS.Name;
39 public class TrustAnchorStore {
40 private Map<String, SRRset> mMap;
42 public TrustAnchorStore() {
46 private String key(Name n, int dclass) {
47 return "T" + dclass + "/" + Util.nameToString(n);
50 public void store(SRRset rrset) {
52 mMap = new HashMap<String, SRRset>();
54 String k = key(rrset.getName(), rrset.getDClass());
55 rrset.setSecurityStatus(SecurityStatus.SECURE);
60 private SRRset lookup(String key) {
61 if (mMap == null) return null;
65 public SRRset find(Name n, int dclass) {
66 if (mMap == null) return null;
68 while (n.labels() > 0) {
69 String k = key(n, dclass);
71 if (r != null) return r;
78 public boolean isBelowTrustAnchor(Name n, int dclass) {
79 return find(n, dclass) != null;