boltbuild 0.1.0

BoltBuild is a programmable build system.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137

use super::Context;
use crate::node::Node;
use crate::task::Task;
use mlua::prelude::{LuaError, LuaResult};
use mlua::Result;
use std::collections::hash_map::Entry;
use std::collections::HashSet;

impl Context {
    pub(crate) fn declare_products(
        &mut self,
        nodes: &Vec<Node>,
        mut new_dependencies: Vec<(usize, usize, String)>,
        task_index: usize,
        new_task: Option<&Task>,
    ) -> LuaResult<()> {
        for node in nodes {
            if self.products.contains_key(node.path()) {
                let task = &self.tasks[self.products[node.path()]];
                return Err(LuaError::RuntimeError(format!(
                    "cannot declared product {}: already a product of task\n  {}",
                    node, task
                )));
            }
            for (index, task) in self.tasks.iter().enumerate() {
                if task.inputs.iter().any(|x| x == node) {
                    new_dependencies.push((task_index, index, format!("dependency on {}", node)));
                }
            }
        }

        self.add_dependencies(new_dependencies, new_task)?;

        for node in nodes {
            /* in case the same node is added twice */
            match self.products.entry(node.path().clone()) {
                Entry::Vacant(vacant_entry) => {
                    vacant_entry.insert(task_index);
                }
                Entry::Occupied(_) => (),
            }
        }
        Ok(())
    }

    pub(crate) fn add_dependencies(
        &mut self,
        mut new_dependencies: Vec<(usize, usize, String)>,
        new_task: Option<&Task>,
    ) -> Result<()> {
        if !new_dependencies.is_empty() {
            let mut commit_dependencies = Vec::new();
            new_dependencies.sort();
            while !new_dependencies.is_empty() {
                let (producer, consumer, reason) = new_dependencies.remove(0);
                let mut set = vec![(producer, consumer, reason)];
                while !new_dependencies.is_empty() {
                    if producer == new_dependencies[0].0 {
                        set.push(new_dependencies.remove(0));
                    } else {
                        break;
                    }
                }
                self.add_dependency_set(&set, &commit_dependencies, new_task)?;
                commit_dependencies.extend(set);
            }
            if new_task.is_some() {
                self.task_dependencies.push(Vec::new());
            }
            for (producer, consumer, reason) in commit_dependencies {
                self.task_dependencies[producer].push((consumer, reason));
            }
        } else if new_task.is_some() {
            self.task_dependencies.push(Vec::new());
        }

        Ok(())
    }

    fn add_dependency_set(
        &mut self,
        new_dependencies: &[(usize, usize, String)],
        committed_dependencies: &[(usize, usize, String)],
        new_task: Option<&Task>,
    ) -> Result<()> {
        let mut start = HashSet::new();
        let mut queue = Vec::new();
        let mut seen = HashSet::new();
        for (producer, consumer, reason) in new_dependencies {
            start.insert(*producer);
            queue.push((*consumer, vec![(*producer, reason)]));
        }

        while let Some(item) = queue.pop() {
            let (producer, path) = item;
            if start.contains(&producer) {
                return Err(LuaError::RuntimeError(format!(
                    "Cycle detected in task dependency:\n  {}\n  {}",
                    path.iter()
                        .map(|x| format!(
                            "{}\n    ({})",
                            self.tasks.get(x.0).or(new_task).unwrap(),
                            x.1
                        ))
                        .collect::<Vec<_>>()
                        .join("\n  "),
                    self.tasks.get(producer).or(new_task).unwrap()
                )));
            }

            if producer < self.task_dependencies.len() {
                for (consumer, reason) in &self.task_dependencies[producer] {
                    if seen.contains(consumer) {
                        continue;
                    }
                    seen.insert(*consumer);
                    let mut path = path.clone();
                    path.push((producer, reason));
                    queue.push((*consumer, path));
                }
                for (p, consumer, reason) in committed_dependencies.iter() {
                    if *p == producer {
                        if seen.contains(consumer) {
                            continue;
                        }
                        seen.insert(*consumer);
                        let mut path = path.clone();
                        path.push((*p, reason));
                        queue.push((*consumer, path));
                    }
                }
            }
        }

        Ok(())
    }
}