nl.han.ica.ap.purify.App.java Source code

Introduction

Here is the source code for nl.han.ica.ap.purify.App.java

Source

/**
 * Copyright (c) 2013 HAN University of Applied Sciences
 * Arjan Oortgiese
 * Boyd Hofman
 * Joll Portier
 * Michiel Westerbeek
 * Tim Waalewijn
 * 
 * Permission is hereby granted, free of charge, to any person
 * obtaining a copy of this software and associated documentation
 * files (the "Software"), to deal in the Software without
 * restriction, including without limitation the rights to use,
 * copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following
 * conditions:
 * 
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
 * OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
 * HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
 * OTHER DEALINGS IN THE SOFTWARE.
 */
package nl.han.ica.ap.purify;

import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.List;

import org.antlr.v4.runtime.ANTLRInputStream;
import org.antlr.v4.runtime.CommonTokenStream;
import org.antlr.v4.runtime.tree.ParseTree;
import org.antlr.v4.runtime.tree.ParseTreeWalker;

import nl.han.ica.ap.purify.language.java.JavaLexer;
import nl.han.ica.ap.purify.language.java.JavaParser;
import nl.han.ica.ap.purify.language.java.callgraph.CallGraph;
import nl.han.ica.ap.purify.language.java.callgraph.listeners.ClassNodeListener;
import nl.han.ica.ap.purify.language.java.callgraph.listeners.EdgeListener;
import nl.han.ica.ap.purify.modles.IDetector;
import nl.han.ica.ap.purify.modles.ISolver;
import nl.han.ica.ap.purify.modles.SourceFile;
import nl.han.ica.ap.purify.module.java.duplicatecode.DuplicatedCodeDetector;
import nl.han.ica.ap.purify.module.java.magicnumber.MagicNumberDetector;
import nl.han.ica.ap.purify.module.java.magicnumber.MagicNumberSolver;
import nl.han.ica.ap.purify.module.java.removeparameter.RemoveParameterDetector;
import nl.han.ica.ap.purify.module.java.removeparameter.RemoveParameterSolver;
import nl.han.ica.ap.purify.module.java.unusedmethod.UnusedMethodDetector;
import nl.han.ica.ap.purify.module.java.unusedmethod.UnusedMethodSolver;

/**
 * Example magic numbers runner. 
 */
public class App {
    private static CallGraph graph;

    private static final String COMMAND_LINE_PARAM_MISSING = "Add at least one file as command line parameter.";

    public static void main(String[] args) {
        if (args.length < 1) {
            System.err.println(COMMAND_LINE_PARAM_MISSING);
            return;
        }

        graph = new CallGraph();
        ClassNodeListener classNodelistener = new ClassNodeListener(graph);
        EdgeListener edgelistener = new EdgeListener(graph);
        ParseTreeWalker walker = new ParseTreeWalker();

        List<SourceFile> sourceFiles = new ArrayList<SourceFile>();

        List<IDetector> detectors = new ArrayList<IDetector>();
        detectors.add(new DuplicatedCodeDetector());
        detectors.add(new MagicNumberDetector());
        detectors.add(new RemoveParameterDetector());
        detectors.add(new UnusedMethodDetector());

        List<ISolver> solvers = new ArrayList<ISolver>();
        solvers.add(new MagicNumberSolver());
        solvers.add(new RemoveParameterSolver());
        solvers.add(new UnusedMethodSolver());

        for (int i = 0; i < args.length; i++) {
            ANTLRInputStream input = null;
            InputStream is = null;

            if (args[i] != null) {
                try {
                    is = new FileInputStream(args[i]);
                } catch (FileNotFoundException e) {
                    e.printStackTrace();
                    continue;
                }
            }

            try {
                input = new ANTLRInputStream(is);
            } catch (IOException e) {
                e.printStackTrace();
                continue;
            }

            JavaLexer lexer = new JavaLexer(input);
            CommonTokenStream tokens = new CommonTokenStream(lexer);
            JavaParser parser = new JavaParser(tokens);
            ParseTree tree = parser.compilationUnit();

            SourceFile file = new SourceFile(args[i], tokens, tree);

            sourceFiles.add(file);
        }

        for (SourceFile file : sourceFiles) {
            classNodelistener.setCurrentSourceFile(file);
            walker.walk(classNodelistener, file.getParseTree());
        }

        for (SourceFile file : sourceFiles) {
            edgelistener.setSourceFile(file);
            walker.walk(edgelistener, file.getParseTree());
        }

        for (SourceFile file : sourceFiles) {
            for (IDetector detector : detectors) {
                detector.analyze(file);
            }
        }

        for (IDetector detector : detectors) {
            detector.detect();
        }

        for (SourceFile file : sourceFiles) {
            for (ISolver solver : solvers) {
                solver.solve(file);
            }
        }

        for (SourceFile file : sourceFiles) {
            System.out.println("--------- FILE: " + file.getPath() + " ---------");

            for (int i = file.getIssuesSize() - 1; i >= 0; i--) {
                System.out.println(file.getIssue(i));
            }
        }

        for (SourceFile file : sourceFiles) {
            System.out.println("====== " + file.getPath() + "====== ");
            System.out.println(file.getRewriter().getText());
        }
    }

    /**
     * Get the call graph.
     * 
     * @return Call graph.
     */
    public static CallGraph getCallGraph() {
        return graph;
    }
}