blob: 845c9470af93fe05fc958026497c14b577d1a4ae [file] [log] [blame]
// 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
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// 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 <map>
#include <string>
#include <vector>
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;
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<Node*> RootNodes(string* error);
vector<Node*> DefaultNodes(string* error);
/// Mapping of path -> Node.
typedef ExternalStringHashMap<Node*>::Type Paths;
Paths paths_;
/// All the rules used in the graph.
map<string, const Rule*> rules_;
/// All the edges of the graph.
vector<Edge*> edges_;
BindingEnv bindings_;
vector<Node*> defaults_;
struct BuildLog* build_log_;
#endif // NINJA_STATE_H_