// Copyright 2011 Google Inc. 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. #ifndef NINJA_STATE_H_ #define NINJA_STATE_H_ #pragma once #include #include #include using namespace std; #include "eval_env.h" #include "hash_map.h" struct BuildLog; struct Edge; struct Node; struct Rule; /// Global state (file status, loaded rules) for a single run. struct State { static const Rule kPhonyRule; State(); void AddRule(const Rule* rule); const Rule* LookupRule(const string& rule_name); Edge* AddEdge(const Rule* rule); Node* GetNode(StringPiece path); Node* LookupNode(StringPiece path); Node* SpellcheckNode(const string& path); void AddIn(Edge* edge, StringPiece path); void AddOut(Edge* edge, StringPiece path); bool AddDefault(StringPiece path, string* error); /// Reset state. Keeps all nodes and edges, but restores them to the /// state where we haven't yet examined the disk for dirty state. void Reset(); /// Dump the nodes (useful for debugging). void Dump(); /// @return the root node(s) of the graph. (Root nodes have no output edges). /// @param error where to write the error message if somethings went wrong. vector RootNodes(string* error); vector DefaultNodes(string* error); /// Mapping of path -> Node. typedef ExternalStringHashMap::Type Paths; Paths paths_; /// All the rules used in the graph. map rules_; /// All the edges of the graph. vector edges_; BindingEnv bindings_; vector defaults_; struct BuildLog* build_log_; }; #endif // NINJA_STATE_H_