aboutsummaryrefslogtreecommitdiffstats
path: root/src/main/java/org/onap/aai/rest/dsl/DslListener.java
blob: e41a9460673bc8f1c0679fe3b6f2611904cd359a (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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
/**
 * ============LICENSE_START=======================================================
 * org.onap.aai
 * ================================================================================
 * Copyright © 2017-2018 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=========================================================
 */
package org.onap.aai.rest.dsl;

import com.att.eelf.configuration.EELFLogger;
import com.att.eelf.configuration.EELFManager;
import org.antlr.v4.runtime.tree.TerminalNode;
import org.onap.aai.AAIDslBaseListener;
import org.onap.aai.AAIDslParser;
import org.onap.aai.edges.EdgeIngestor;
import org.onap.aai.edges.EdgeRule;
import org.onap.aai.edges.EdgeRuleQuery;
import org.onap.aai.edges.exceptions.AmbiguousRuleChoiceException;
import org.onap.aai.edges.exceptions.EdgeRuleNotFoundException;
import org.springframework.beans.factory.annotation.Autowired;

import java.util.HashMap;
import java.util.List;
import java.util.Map;

/**
 * The Class DslListener.
 */
public class DslListener extends AAIDslBaseListener {

	private static final EELFLogger LOGGER = EELFManager.getInstance().getLogger(DslQueryProcessor.class);
	private final EdgeIngestor edgeRules;

	//TODO Use StringBuilder to build the query than concat
	String query = "";

	Map<Integer, String> unionMap = new HashMap<>();
	Map<String, String> flags = new HashMap<>();

	String currentNode = "";
	String prevsNode = "";
	int commas = 0;

	int unionKey = 0;
	int unionMembers = 0;
	boolean isUnionBeg = false;
	boolean isUnionTraversal = false;

	boolean isTraversal = false;
	boolean isWhereTraversal = false;
	String whereTraversalNode = "";

	String limitQuery = "";
	boolean isNot = false;

	/**
	 * Instantiates a new DslListener.
	 */
	@Autowired
	public DslListener(EdgeIngestor edgeIngestor) {
		this.edgeRules = edgeIngestor;
	}

	@Override
	public void enterAaiquery(AAIDslParser.AaiqueryContext ctx) {
		query += "builder";
	}

	@Override
	public void enterDslStatement(AAIDslParser.DslStatementContext ctx) {
		// LOGGER.info("Statement Enter"+ctx.getText());
		/*
		 * This block of code is entered for every query statement
		 */
		if (isUnionBeg) {
			isUnionBeg = false;
			isUnionTraversal = true;

		} else if (unionMembers > 0) {
			unionMembers--;
			query += ",builder.newInstance()";
			isUnionTraversal = true;
		}

	}

	@Override
	public void exitDslStatement(AAIDslParser.DslStatementContext ctx) {
		/*
		 * Nothing to be done here for now
		 * LOGGER.info("Statement Exit"+ctx.getText());
		 */
	}

	@Override
	public void exitAaiquery(AAIDslParser.AaiqueryContext ctx) {
		/*
		 * dedup is by default for all queries If the query has limit in it
		 * include this as well LOGGER.info("Statement Exit"+ctx.getText());
		 */

		query += ".cap('x').unfold().dedup()" + limitQuery;
	}

	/*
	 * TODO: The contexts are not inherited from a single parent in AAIDslParser
	 * Need to find a way to do that
	 */
	@Override
	public void enterSingleNodeStep(AAIDslParser.SingleNodeStepContext ctx) {
		
		prevsNode = currentNode;
		currentNode = ctx.NODE().getText();

		this.generateQuery();
		if (ctx.STORE() != null && ctx.STORE().getText().equals("*")) {
			flags.put(currentNode, "store");
		}

	}

	@Override
	public void enterSingleQueryStep(AAIDslParser.SingleQueryStepContext ctx) {
		
		prevsNode = currentNode;
		currentNode = ctx.NODE().getText();
		this.generateQuery();

		if (ctx.STORE() != null && ctx.STORE().getText().equals("*")) {
			flags.put(currentNode, "store");
		}
	}

	@Override
	public void enterMultiQueryStep(AAIDslParser.MultiQueryStepContext ctx) {
		
		prevsNode = currentNode;
		currentNode = ctx.NODE().getText();
		this.generateQuery();
		
		if (ctx.STORE() != null && ctx.STORE().getText().equals("*")) {
			flags.put(currentNode, "store");
		}

	}

	/*
	 * Generates the QueryBuilder syntax for the dsl query
	 */
	private void generateQuery() {
		String edgeType = "";

		if (isUnionTraversal || isTraversal || isWhereTraversal) {
			String previousNode = prevsNode;
			if (isUnionTraversal) {
				previousNode = unionMap.get(unionKey);
				isUnionTraversal = false;
			}

			EdgeRuleQuery edgeRuleQuery = new EdgeRuleQuery.Builder(previousNode, currentNode).build();
			EdgeRule edgeRule = null;

			try {
				edgeRule = edgeRules.getRule(edgeRuleQuery);
			} catch (EdgeRuleNotFoundException | AmbiguousRuleChoiceException e) {
			}

			if (edgeRule == null) {
				edgeType = "EdgeType.COUSIN";
			} else if ("none".equalsIgnoreCase(edgeRule.getContains())){
				edgeType = "EdgeType.COUSIN";
			}else {
				edgeType = "EdgeType.TREE";
			}

			query += ".createEdgeTraversal(" + edgeType + ", '" + previousNode + "','" + currentNode + "')";

		}

		else
			query += ".getVerticesByProperty('aai-node-type', '" + currentNode + "')";
	}

	@Override
	public void exitSingleNodeStep(AAIDslParser.SingleNodeStepContext ctx) {

		generateExitStep();
	}

	@Override
	public void exitSingleQueryStep(AAIDslParser.SingleQueryStepContext ctx) {
		generateExitStep();
	}

	@Override
	public void exitMultiQueryStep(AAIDslParser.MultiQueryStepContext ctx) {
		generateExitStep();

	}

	private void generateExitStep() {
		if (flags.containsKey(currentNode)) {
			String storeFlag = flags.get(currentNode);
			if (storeFlag != null && storeFlag.equals("store"))
				query += ".store('x')";
			flags.remove(currentNode);
		}
	}

	@Override
	public void enterUnionQueryStep(AAIDslParser.UnionQueryStepContext ctx) {
		isUnionBeg = true;

		unionKey++;
		unionMap.put(unionKey, currentNode);
		query += ".union(builder.newInstance()";

		List<TerminalNode> commaNodes = ctx.COMMA();

		for (TerminalNode node : commaNodes) {
			unionMembers++;
		}
	}

	@Override
	public void exitUnionQueryStep(AAIDslParser.UnionQueryStepContext ctx) {
		isUnionBeg = false;
		unionMap.remove(unionKey);

		query += ")";
		unionKey--;

	}

	@Override
	public void enterFilterTraverseStep(AAIDslParser.FilterTraverseStepContext ctx) {
		isWhereTraversal = true;
		whereTraversalNode = currentNode;
		query += ".where(builder.newInstance()";
	}

	@Override
	public void exitFilterTraverseStep(AAIDslParser.FilterTraverseStepContext ctx) {
		query += ")";
		isWhereTraversal = false;
		currentNode = whereTraversalNode;
	}

	@Override
	public void enterFilterStep(AAIDslParser.FilterStepContext ctx) {
		if (ctx.NOT() != null && ctx.NOT().getText().equals("!"))
			isNot = true;

		List<TerminalNode> nodes = ctx.KEY();
		String key = ctx.KEY(0).getText();

		if (isNot) {
			query += ".getVerticesExcludeByProperty(";
			isNot = false;
		} else
			query += ".getVerticesByProperty(";

		if (nodes.size() == 2) {
			query += key + "," + ctx.KEY(1).getText();
			query += ")";
		}

		if (nodes.size() > 2) {

			for (TerminalNode node : nodes) {
				if (node.getText().equals(key))
					continue;

				query += key + "," + node.getText();
				query += ")";
			}

		}

	}

	@Override
	public void exitFilterStep(AAIDslParser.FilterStepContext ctx) {
		// For now do nothing
	}

	@Override
	public void enterTraverseStep(AAIDslParser.TraverseStepContext ctx) {
		isTraversal = true;
	}

	@Override
	public void exitTraverseStep(AAIDslParser.TraverseStepContext ctx) {
		isTraversal = false;
	}

	@Override
	public void enterLimitStep(AAIDslParser.LimitStepContext ctx) {
		String value = ctx.NODE().getText();
		limitQuery += ".limit(" + value + ")";
	}
}