diff options
author | Evan Martin <martine@danga.com> | 2011-01-08 17:44:15 (GMT) |
---|---|---|
committer | Evan Martin <martine@danga.com> | 2011-01-08 17:44:15 (GMT) |
commit | 0a186ab0cbcd2015d2cf9afd8460c7b60e4bcbdd (patch) | |
tree | 65e698b8e86a5c1336bad9234cda326ac23ab330 /src/ninja.h | |
parent | 83056869b618a27c0b3d8ec86e15e9f15777c172 (diff) | |
download | Ninja-0a186ab0cbcd2015d2cf9afd8460c7b60e4bcbdd.zip Ninja-0a186ab0cbcd2015d2cf9afd8460c7b60e4bcbdd.tar.gz Ninja-0a186ab0cbcd2015d2cf9afd8460c7b60e4bcbdd.tar.bz2 |
split out graph into its own header
Diffstat (limited to 'src/ninja.h')
-rw-r--r-- | src/ninja.h | 109 |
1 files changed, 8 insertions, 101 deletions
diff --git a/src/ninja.h b/src/ninja.h index 3ece1ab..26432c3 100644 --- a/src/ninja.h +++ b/src/ninja.h @@ -14,6 +14,11 @@ using namespace std; #include "eval_env.h" #include "hash_map.h" +struct Edge; +struct FileStat; +struct Node; +struct Rule; + int ReadFile(const string& path, string* contents, string* err); struct DiskInterface { @@ -34,106 +39,6 @@ struct RealDiskInterface : public DiskInterface { virtual string ReadFile(const string& path, string* err); }; -struct Node; -struct FileStat { - FileStat(const string& path) : path_(path), mtime_(-1), node_(NULL) {} - void Touch(int mtime); - // Return true if the file exists (mtime_ got a value). - bool Stat(DiskInterface* disk_interface); - - // Return true if we needed to stat. - bool StatIfNecessary(DiskInterface* disk_interface) { - if (status_known()) - return false; - Stat(disk_interface); - return true; - } - - bool exists() const { - assert(status_known()); - return mtime_ != 0; - } - - bool status_known() const { - return mtime_ != -1; - } - - string path_; - // Possible values of mtime_: - // -1: file hasn't been examined - // 0: we looked, and file doesn't exist - // >0: actual file's mtime - time_t mtime_; - Node* node_; -}; - -struct Edge; -struct Node { - Node(FileStat* file) : file_(file), dirty_(false), in_edge_(NULL) {} - - bool dirty() const { return dirty_; } - void MarkDirty(); - void MarkDependentsDirty(); - - FileStat* file_; - bool dirty_; - Edge* in_edge_; - vector<Edge*> out_edges_; -}; - -struct Rule { - Rule(const string& name) : name_(name) { } - - bool ParseCommand(const string& command, string* err) { - return command_.Parse(command, err); - } - string name_; - EvalString command_; - EvalString description_; - EvalString depfile_; -}; - -struct State; -struct Edge { - Edge() : rule_(NULL), env_(NULL), implicit_deps_(0), order_only_deps_(0) {} - - void MarkDirty(Node* node); - bool RecomputeDirty(State* state, DiskInterface* disk_interface, string* err); - string EvaluateCommand(); // XXX move to env, take env ptr - string GetDescription(); - bool LoadDepFile(State* state, DiskInterface* disk_interface, string* err); - - void Dump(); - - enum InOut { IN, OUT }; - - const Rule* rule_; - vector<Node*> inputs_; - vector<Node*> outputs_; - Env* env_; - - // XXX There are three types of inputs. - // 1) explicit deps, which show up as $in on the command line; - // 2) implicit deps, which the target depends on implicitly (e.g. C headers), - // and changes in them cause the target to rebuild; - // 3) order-only deps, which are needed before the target builds but which - // don't cause the target to rebuild. - // Currently we stuff all of these into inputs_ and keep counts of #2 and #3 - // when we need to compute subsets. This is suboptimal; should think of a - // better representation. (Could make each pointer into a pair of a pointer - // and a type of input, or if memory matters could use the low bits of the - // pointer...) - int implicit_deps_; - int order_only_deps_; - bool is_implicit(int index) { - return index >= ((int)inputs_.size()) - order_only_deps_ - implicit_deps_ && - !is_order_only(index); - } - bool is_order_only(int index) { - return index >= ((int)inputs_.size()) - order_only_deps_; - } -}; - struct StatCache { typedef hash_map<string, FileStat*> Paths; Paths paths_; @@ -141,6 +46,7 @@ struct StatCache { void Dump(); void Reload(); }; + struct State { State(); @@ -151,7 +57,8 @@ struct State { Edge* AddEdge(const Rule* rule); Node* GetNode(const string& path); Node* LookupNode(const string& path); - void AddInOut(Edge* edge, Edge::InOut inout, const string& path); + void AddIn(Edge* edge, const string& path); + void AddOut(Edge* edge, const string& path); StatCache stat_cache_; map<string, const Rule*> rules_; |