/tags/release-0.1-rc2/hive/external/ql/src/java/org/apache/hadoop/hive/ql/tools/LineageInfo.java
Java | 158 lines | 76 code | 24 blank | 58 comment | 7 complexity | ad37c9b110120f86b3396a0445746a00 MD5 | raw file
Possible License(s): Apache-2.0, BSD-3-Clause, JSON, CPL-1.0
- /**
- * Licensed to the Apache Software Foundation (ASF) under one
- * or more contributor license agreements. See the NOTICE file
- * distributed with this work for additional information
- * regarding copyright ownership. The ASF licenses this file
- * to you 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.
- */
- package org.apache.hadoop.hive.ql.tools;
- import java.io.IOException;
- import java.util.ArrayList;
- import java.util.LinkedHashMap;
- import java.util.Map;
- import java.util.Stack;
- import java.util.TreeSet;
- import org.apache.hadoop.hive.ql.lib.DefaultGraphWalker;
- import org.apache.hadoop.hive.ql.lib.DefaultRuleDispatcher;
- import org.apache.hadoop.hive.ql.lib.Dispatcher;
- import org.apache.hadoop.hive.ql.lib.GraphWalker;
- import org.apache.hadoop.hive.ql.lib.Node;
- import org.apache.hadoop.hive.ql.lib.NodeProcessor;
- import org.apache.hadoop.hive.ql.lib.NodeProcessorCtx;
- import org.apache.hadoop.hive.ql.lib.Rule;
- import org.apache.hadoop.hive.ql.parse.ASTNode;
- import org.apache.hadoop.hive.ql.parse.BaseSemanticAnalyzer;
- import org.apache.hadoop.hive.ql.parse.HiveParser;
- import org.apache.hadoop.hive.ql.parse.ParseDriver;
- import org.apache.hadoop.hive.ql.parse.ParseException;
- import org.apache.hadoop.hive.ql.parse.SemanticException;
- /**
- *
- * This class prints out the lineage info. It takes sql as input and prints
- * lineage info. Currently this prints only input and output tables for a given
- * sql. Later we can expand to add join tables etc.
- *
- */
- public class LineageInfo implements NodeProcessor {
- /**
- * Stores input tables in sql.
- */
- TreeSet<String> inputTableList = new TreeSet<String>();
- /**
- * Stores output tables in sql.
- */
- TreeSet<String> OutputTableList = new TreeSet<String>();
- /**
- *
- * @return java.util.TreeSet
- */
- public TreeSet<String> getInputTableList() {
- return inputTableList;
- }
- /**
- * @return java.util.TreeSet
- */
- public TreeSet<String> getOutputTableList() {
- return OutputTableList;
- }
- /**
- * Implements the process method for the NodeProcessor interface.
- */
- public Object process(Node nd, Stack<Node> stack, NodeProcessorCtx procCtx,
- Object... nodeOutputs) throws SemanticException {
- ASTNode pt = (ASTNode) nd;
- switch (pt.getToken().getType()) {
- case HiveParser.TOK_TAB:
- OutputTableList.add(BaseSemanticAnalyzer.getUnescapedName((ASTNode)pt.getChild(0)));
- break;
- case HiveParser.TOK_TABREF:
- ASTNode tabTree = (ASTNode) pt.getChild(0);
- String table_name = (tabTree.getChildCount() == 1) ?
- BaseSemanticAnalyzer.getUnescapedName((ASTNode)tabTree.getChild(0)) :
- BaseSemanticAnalyzer.getUnescapedName((ASTNode)tabTree.getChild(0)) + "." + tabTree.getChild(1);
- inputTableList.add(table_name);
- break;
- }
- return null;
- }
- /**
- * parses given query and gets the lineage info.
- *
- * @param query
- * @throws ParseException
- */
- public void getLineageInfo(String query) throws ParseException,
- SemanticException {
- /*
- * Get the AST tree
- */
- ParseDriver pd = new ParseDriver();
- ASTNode tree = pd.parse(query);
- while ((tree.getToken() == null) && (tree.getChildCount() > 0)) {
- tree = (ASTNode) tree.getChild(0);
- }
- /*
- * initialize Event Processor and dispatcher.
- */
- inputTableList.clear();
- OutputTableList.clear();
- // create a walker which walks the tree in a DFS manner while maintaining
- // the operator stack. The dispatcher
- // generates the plan from the operator tree
- Map<Rule, NodeProcessor> rules = new LinkedHashMap<Rule, NodeProcessor>();
- // The dispatcher fires the processor corresponding to the closest matching
- // rule and passes the context along
- Dispatcher disp = new DefaultRuleDispatcher(this, rules, null);
- GraphWalker ogw = new DefaultGraphWalker(disp);
- // Create a list of topop nodes
- ArrayList<Node> topNodes = new ArrayList<Node>();
- topNodes.add(tree);
- ogw.startWalking(topNodes, null);
- }
- public static void main(String[] args) throws IOException, ParseException,
- SemanticException {
- String query = args[0];
- LineageInfo lep = new LineageInfo();
- lep.getLineageInfo(query);
- for (String tab : lep.getInputTableList()) {
- System.out.println("InputTable=" + tab);
- }
- for (String tab : lep.getOutputTableList()) {
- System.out.println("OutputTable=" + tab);
- }
- }
- }