HomeSort by relevance Sort by last modified time
    Searched refs:DepNode (Results 1 - 17 of 17) sorted by null

  /build/kati/
exec.h 22 struct DepNode;
25 void Exec(const vector<DepNode*>& roots, Evaluator* ev);
command.h 24 struct DepNode;
40 void Eval(DepNode* n, vector<Command*>* commands);
41 const DepNode* current_dep_node() const { return current_dep_node_; }
45 DepNode* current_dep_node_;
dep.h 32 struct DepNode {
33 DepNode(Symbol output, bool is_phony, bool is_restat);
37 vector<DepNode*> deps;
38 vector<DepNode*> order_onlys;
39 vector<DepNode*> parents;
60 vector<DepNode*>* nodes);
ninja.h 27 struct DepNode;
30 void GenerateNinja(const vector<DepNode*>& nodes,
exec.cc 53 double ExecNode(DepNode* n, DepNode* needed_by) {
80 for (DepNode* d : n->order_onlys) {
89 for (DepNode* d : n->deps) {
147 void Exec(const vector<DepNode*>& roots, Evaluator* ev) {
149 for (DepNode* root : roots) {
153 for (DepNode* root : roots) {
dep.cc 39 static vector<DepNode*>* g_dep_node_pool;
182 DepNode* n) const {
196 void FillDepNodeLoc(const Rule* r, DepNode* n) const {
204 DepNode* n) const {
228 DepNode::DepNode(Symbol o, bool p, bool r)
308 void Build(vector<Symbol> targets, vector<DepNode*>* nodes) {
340 DepNode* n = BuildPlan(target, Intern(""));
448 bool CanPickImplicitRule(const Rule* rule, Symbol output, DepNode* n,
506 DepNode* n
    [all...]
query.go 22 func showDeps(w io.Writer, n *DepNode, indent int, seen map[string]int) {
43 func showNode(w io.Writer, n *DepNode) {
67 func handleNodeQuery(w io.Writer, q string, nodes []*DepNode) {
ninja.cc 172 const DepNode* node;
203 void Generate(const vector<DepNode*>& nodes,
224 void PopulateNinjaNodes(const vector<DepNode*>& nodes) {
226 for (DepNode* node : nodes) {
231 void PopulateNinjaNode(DepNode* node) {
252 for (DepNode* d : node->deps) {
255 for (DepNode* d : node->order_onlys) {
457 bool GetDepfile(const DepNode* node, string* cmd_buf, string* depfile) {
472 const DepNode* node = nn->node;
481 const DepNode* node = nn->node
    [all...]
depgraph.go 29 nodes []*DepNode
37 func (g *DepGraph) Nodes() []*DepNode { return g.nodes }
43 seen := make(map[*DepNode]bool)
44 var fix func(n *DepNode)
45 fix = func(n *DepNode) {
dep.go 26 // DepNode represents a makefile rule for an output.
27 type DepNode struct {
30 Deps []*DepNode
31 OrderOnlys []*DepNode
32 Parents []*DepNode
41 func (n *DepNode) String() string {
57 done map[string]*DepNode
283 func (db *depBuilder) buildPlan(output string, neededBy string, tsvs Vars) (*DepNode, error) {
294 n := &DepNode{Output: output, IsPhony: db.phony[output]}
297 // create depnode for phony targets
    [all...]
exec.go 46 func (ex *Executor) makeJobs(n *DepNode, neededBy *job) error {
90 var deps []*DepNode
172 var nodes []*DepNode
178 m := make(map[string]*DepNode)
command.cc 125 const DepNode* n = ce_->current_dep_node();
193 void CommandEvaluator::Eval(DepNode* n, vector<Command*>* commands) {
evalcmd.go 290 func createRunners(ctx *execContext, n *DepNode) ([]runner, bool, error) {
345 func evalCommands(nodes []*DepNode, vars Vars) error {
main.cc 180 vector<DepNode*> nodes;
serialize.go 190 func (ns *depNodesSerializer) serializeDepNodes(nodes []*DepNode) {
511 func deserializeNodes(g serializableGraph) (r []*DepNode, err error) {
529 nodeMap := make(map[string]*DepNode)
536 d := &DepNode{
ninja.go 73 nodes []*DepNode
406 func (n *NinjaGenerator) dependency(node *DepNode) (string, string) {
479 func (n *NinjaGenerator) emitNode(node *DepNode) error {
worker.go 34 n *DepNode

Completed in 703 milliseconds