-
Notifications
You must be signed in to change notification settings - Fork 4
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
4 changed files
with
160 additions
and
128 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,139 @@ | ||
| // | ||
| // Copyright 2020 Matts966 | ||
| // | ||
| // 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. | ||
| // | ||
|
|
||
| #include <filesystem> | ||
|
|
||
| #include "zetasql/resolved_ast/resolved_ast.h" | ||
| #include "zetasql/base/logging.h" | ||
| #include "zetasql/base/status.h" | ||
| #include "zetasql/base/statusor.h" | ||
| #include "zetasql/public/analyzer.h" | ||
| #include "alphasql/identifier_resolver.h" | ||
| #include "absl/flags/flag.h" | ||
| #include "absl/flags/parse.h" | ||
| #include "boost/graph/graphviz.hpp" | ||
| #include "boost/graph/depth_first_search.hpp" | ||
| #include "absl/strings/str_join.h" | ||
|
|
||
| typedef std::pair<std::string, std::string> Edge; | ||
|
|
||
| ABSL_FLAG(std::string, output_path, "", | ||
| "Output path for DAG."); | ||
| ABSL_FLAG(std::string, external_required_tables_output_path, "", | ||
| "Output path for external required tables."); | ||
|
|
||
| struct table_queries { | ||
| std::vector<std::string> create; | ||
| std::vector<std::string> others; | ||
| }; | ||
|
|
||
| namespace alphasql { | ||
|
|
||
| using namespace zetasql; | ||
|
|
||
| // Returns <options> if it already has all arenas initialized, or otherwise | ||
| // populates <copy> as a copy for <options>, creates arenas in <copy> and | ||
| // returns it. This avoids unnecessary duplication of AnalyzerOptions, which | ||
| // might be expensive. | ||
| const AnalyzerOptions& GetOptionsWithArenas( | ||
| const AnalyzerOptions* options, std::unique_ptr<AnalyzerOptions>* copy) { | ||
| if (options->AllArenasAreInitialized()) { | ||
| return *options; | ||
| } | ||
| *copy = absl::make_unique<AnalyzerOptions>(*options); | ||
| (*copy)->CreateDefaultArenasIfNotSet(); | ||
| return **copy; | ||
| } | ||
|
|
||
| zetasql_base::StatusOr<std::map<ResolvedNodeKind, TableNamesSet>> ExtractTableNamesFromSQL(const std::string& sql_file_path, | ||
| TableNamesSet* table_names) { | ||
| LanguageOptions language_options; | ||
| language_options.EnableMaximumLanguageFeaturesForDevelopment(); | ||
| language_options.SetEnabledLanguageFeatures({FEATURE_V_1_3_ALLOW_DASHES_IN_TABLE_NAME}); | ||
| language_options.SetSupportsAllStatementKinds(); | ||
| AnalyzerOptions options(language_options); | ||
| options.mutable_language()->EnableMaximumLanguageFeaturesForDevelopment(); | ||
| options.CreateDefaultArenasIfNotSet(); | ||
|
|
||
| return identifier_resolver::GetNodeKindToTableNamesMap( | ||
| sql_file_path, options, table_names); | ||
| } | ||
|
|
||
| absl::Status UpdateTableQueriesMapAndVertices(const std::filesystem::path& file_path, | ||
| std::map<std::string, table_queries>& table_queries_map, | ||
| std::set<std::string>& vertices) { | ||
| if (file_path.extension() != ".bq" && file_path.extension() != ".sql") { | ||
| // std::cout << "not a sql file " << file_path << "!" << std::endl; | ||
| // Skip if not SQL. | ||
| return absl::OkStatus(); | ||
| } | ||
| std::cout << "Reading " << file_path << std::endl; | ||
|
|
||
| TableNamesSet table_names; | ||
| auto node_kind_to_table_names_or_status = ExtractTableNamesFromSQL(file_path.string(), &table_names); | ||
| if (!node_kind_to_table_names_or_status.ok()) { | ||
| return node_kind_to_table_names_or_status.status(); | ||
| } | ||
| std::map<ResolvedNodeKind, TableNamesSet> node_kind_to_table_names = node_kind_to_table_names_or_status.value(); | ||
|
|
||
| // Resolve file dependency from DML on DDL. | ||
| for (auto const& table_name : node_kind_to_table_names[RESOLVED_CREATE_TABLE_STMT]) { | ||
| const std::string table_string = absl::StrJoin(table_name, "."); | ||
| table_queries_map[table_string].create.push_back(file_path); | ||
| } | ||
| for (auto const& table_name : node_kind_to_table_names[RESOLVED_CREATE_TABLE_AS_SELECT_STMT]) { | ||
| const std::string table_string = absl::StrJoin(table_name, "."); | ||
| table_queries_map[table_string].create.push_back(file_path); | ||
| } | ||
|
|
||
| for (auto const& table_name : table_names) { | ||
| const std::string table_string = absl::StrJoin(table_name, "."); | ||
| table_queries_map[table_string].others.push_back(file_path); | ||
| } | ||
|
|
||
| vertices.insert(file_path); | ||
|
|
||
| return absl::OkStatus(); | ||
| } | ||
|
|
||
| void UpdateEdges(std::vector<Edge>& depends_on, | ||
| std::vector<std::string> dependents, std::vector<std::vector<std::string>> parents) { | ||
| if (!dependents.size()) return; | ||
| for (const auto& parent : parents) { | ||
| if (!parent.size()) continue; | ||
| for (const std::string& p : parent) { | ||
| for (const std::string& dep : dependents) { | ||
| if (dep != p) { | ||
| depends_on.push_back(std::make_pair(dep, p)); | ||
| } | ||
| } | ||
| } | ||
| return; | ||
| } | ||
| } | ||
| } | ||
|
|
||
| struct cycle_detector : public boost::dfs_visitor<> { | ||
| cycle_detector( bool& has_cycle) | ||
| : _has_cycle(has_cycle) { } | ||
|
|
||
| template <class Edge, class Graph> | ||
| void back_edge(Edge, Graph&) { | ||
| _has_cycle = true; | ||
| } | ||
| protected: | ||
| bool& _has_cycle; | ||
| }; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters