aboutsummaryrefslogtreecommitdiffstats
path: root/datarouter-prov/src/main/java/com/att/research/datarouter/provisioning/beans/NodeClass.java
blob: 321885b49be0e6f7fcef2274fa6bb60870b3dab4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
/*******************************************************************************
 * ============LICENSE_START==================================================
 * * org.onap.dmaap
 * * ===========================================================================
 * * Copyright © 2017 AT&T Intellectual Property. All rights reserved.
 * * ===========================================================================
 * * 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.
 * * See the License for the specific language governing permissions and
 * * limitations under the License.
 * * ============LICENSE_END====================================================
 * *
 * * ECOMP is a trademark and service mark of AT&T Intellectual Property.
 * *
 ******************************************************************************/

package com.att.research.datarouter.provisioning.beans;

import java.sql.Connection;
import java.sql.PreparedStatement;
import java.sql.ResultSet;
import java.sql.SQLException;
import java.util.Collection;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;
import java.util.TreeSet;

import org.apache.log4j.Logger;

import com.att.research.datarouter.provisioning.utils.DB;

/**
 * This class is used to aid in the mapping of node names from/to node IDs.
 *
 * @author Robert P. Eby
 * @version $Id: NodeClass.java,v 1.2 2014/01/15 16:08:43 eby Exp $
 */
public abstract class NodeClass extends Syncable {
	private static Map<String, Integer> map;

	public NodeClass() {
		// init on first use
		if (map == null) {
			reload();
		}
	}

	/**
	 * Add nodes to the NODES table, when the NODES parameter value is changed.
	 * Nodes are only added to the table, they are never deleted.  The node name is normalized
	 * to contain the domain (if missing).
	 * @param nodes a pipe separated list of the current nodes
	 */
	public static void setNodes(String[] nodes) {
		if (map == null)
			reload();
		int nextid = 0;
		for (Integer n : map.values()) {
			if (n >= nextid)
				nextid = n+1;
		}
		// take | separated list, add domain if needed.
		Logger intlogger = Logger.getLogger("com.att.research.datarouter.provisioning.internal");
		for (String node : nodes) {
			node = normalizeNodename(node);
			if (!map.containsKey(node)) {
				intlogger.info("..adding "+node+" to NODES with index "+nextid);
				map.put(node, nextid);
				PreparedStatement ps = null;
				try {
					DB db = new DB();
					@SuppressWarnings("resource")
					Connection conn = db.getConnection();
					ps = conn.prepareStatement("insert into NODES (NODEID, NAME, ACTIVE) values (?, ?, 1)");
					ps.setInt(1, nextid);
					ps.setString(2, node);
					ps.execute();
					ps.close();
					db.release(conn);
				} catch (SQLException e) {
					intlogger.warn("PROV0005 doInsert: "+e.getMessage());
					e.printStackTrace();
				} finally {
					try {
						ps.close();
					} catch (SQLException e) {
						e.printStackTrace();
					}
				}
				nextid++;
			}
		}
	}

	public static void reload() {
		Map<String, Integer> m = new HashMap<String, Integer>();
		PreparedStatement ps = null;
		try {
			DB db = new DB();
			@SuppressWarnings("resource")
			Connection conn = db.getConnection();
			String sql = "select NODEID, NAME from NODES";
			ps = conn.prepareStatement(sql);
			ResultSet rs = ps.executeQuery();
			while (rs.next()) {
				int id = rs.getInt("NODEID");
				String name = rs.getString("NAME");
				m.put(name, id);
			}
			rs.close();
			ps.close();
			db.release(conn);
		} catch (SQLException e) {
			e.printStackTrace();
		} finally {
			try {
				ps.close();
			} catch (SQLException e) {
				e.printStackTrace();
			}
		}
		map = m;
	}

	public static Integer lookupNodeName(final String name) throws IllegalArgumentException {
		Integer n = map.get(name);
		if (n == null)
			throw new IllegalArgumentException("Invalid node name: "+name);
		return n;
	}

	public static Collection<String> lookupNodeNames(String patt) throws IllegalArgumentException {
		Collection<String> coll = new TreeSet<String>();
		final Set<String> keyset = map.keySet();
		for (String s : patt.toLowerCase().split(",")) {
			if (s.endsWith("*")) {
				s = s.substring(0, s.length()-1);
				for (String s2 : keyset) {
					if (s2.startsWith(s))
						coll.add(s2);
				}
			} else if (keyset.contains(s)) {
				coll.add(s);
			} else if (keyset.contains(normalizeNodename(s))) {
				coll.add(normalizeNodename(s));
			} else {
				throw new IllegalArgumentException("Invalid node name: "+s);
			}
		}
		return coll;
	}

	protected String lookupNodeID(int n) {
		for (String s : map.keySet()) {
			if (map.get(s) == n)
				return s;
		}
		return null;
	}

	public static String normalizeNodename(String s) {
		if (s != null && s.indexOf('.') <= 0) {
			Parameters p = Parameters.getParameter(Parameters.PROV_DOMAIN);
			if (p != null) {
				String domain = p.getValue();
				s += "." + domain;
			}
		}
		return s.toLowerCase();
	}
}