summaryrefslogtreecommitdiff
path: root/src/main.rs
blob: e7d70b3215ad6b77bec3a1ebb17237553d9c9292 (plain)
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
use std::io::{self, Result, Write};
use std::collections::{HashSet, HashMap};
use crate::errors::*;

mod errors;

fn sortuniq<T: Ord>(mut vec: Vec<T>) -> Vec<T> {
    if vec.len() == 0 {
        return vec;
    }

    vec.sort();

    let mut last_added_at = 0;
    for i in 1..vec.len() {
        if vec[i] != vec[last_added_at] {
            vec.swap(i, last_added_at + 1);
            last_added_at += 1;
        }
    }

    assert!(last_added_at + 1 <= vec.len());
    vec.resize_with(last_added_at + 1, || panic!(""));
    vec
}

#[allow(dead_code)]
fn deduplicate<T: std::hash::Hash + Eq + Copy>(mut vec: Vec<T>) -> Vec<T> {
    if vec.len() == 0 {
        return vec;
    }

    let mut seen = HashSet::new();
    seen.insert(vec[0]);

    let mut last_added_at = 0;
    for i in 1..vec.len() {
        if !seen.contains(&vec[i]) {
            seen.insert(vec[i]);
            vec.swap(i, last_added_at + 1);
            last_added_at += 1;
        }
    }

    assert!(last_added_at + 1 <= vec.len());
    vec.resize_with(last_added_at + 1, || panic!(""));
    vec
}

struct RefInfo<'repo> {
    reference: git2::Reference<'repo>,
    commit: git2::Commit<'repo>,
}

#[derive(Debug, Clone)]
enum HistoryNode {
    Genesis(git2::Oid),
    Merge(git2::Oid, Vec<usize>),
    Reference(git2::Oid, Vec<usize>),
}

impl HistoryNode {
    fn oid(&self) -> git2::Oid {
        match self {
            &HistoryNode::Genesis(oid) => oid,
            &HistoryNode::Merge(oid, _) => oid,
            &HistoryNode::Reference(oid, _) => oid,
        }
    }
}

struct HistoryCache<F: Fn(&git2::Oid) -> bool> {
    nodes: Vec<HistoryNode>,
    cache: HashMap<git2::Oid, usize>,
    is_reference: F,
}

impl<F: Fn(&git2::Oid) -> bool> HistoryCache<F> {
    fn new(is_reference: F) -> Self {
        HistoryCache {
            nodes: Vec::new(),
            cache: HashMap::new(),
            is_reference
        }
    }

    fn node_for(&self, key: usize) -> Option<&HistoryNode> {
        self.nodes.get(key)
    }

    fn build_history(&mut self, commit: &git2::Commit) -> usize {
        let oid = commit.id();

        if let Some(&key) = self.cache.get(&oid) {
            return key;
        }

        // eprintln!("build_history: inspecting {} {}", &oid.to_string()[0..8], commit.summary().expect("no summary?"));

        let parents = commit.parents().collect::<Vec<_>>();
        macro_rules! build_recursive {
            () => {{
                let list = parents.iter().map(|c| self.build_history(c)).collect::<Vec<_>>();
                let list = self.simplify_merge(&list);
                sortuniq(list)
            }}
        }

        let key = self.nodes.len();
        self.nodes.push(HistoryNode::Genesis(git2::Oid::zero()));  // reserve the place

        let node = if (self.is_reference)(&oid) {
            HistoryNode::Reference(oid, build_recursive!())
        } else if parents.len() == 1 {
            return self.build_history(&parents[0]);
        } else if parents.len() == 0 {
            HistoryNode::Genesis(oid)
        } else {
            HistoryNode::Merge(oid, build_recursive!())
        };

        self.nodes[key] = node;
        self.cache.insert(oid, key);
        key
    }

    fn simplify_merge(&self, parents: &Vec<usize>) -> Vec<usize> {
        let mut result: Vec<usize> = Vec::new();

        for &parent in parents {
            match &self.nodes[parent] {
                HistoryNode::Genesis(_) => result.push(parent),
                HistoryNode::Reference(_, _) => result.push(parent),
                HistoryNode::Merge(_, ps) => result.append(&mut self.simplify_merge(ps)),
            }
        }

        result
    }
}

fn write_dot<W: Write, F: Fn(&git2::Oid) -> bool>(stream: &mut W, history: &mut HistoryCache<F>, seen: &mut HashSet<usize>, refmap: &HashMap<git2::Oid, RefInfo>, key: usize) -> Result<()> {
    if !seen.insert(key) {
        return Ok(());
    }

    let next_keys;

    match history.node_for(key).unwrap() {
        HistoryNode::Genesis(oid) => {
            writeln!(stream, "\t\"{}\" [label=\"G\"];", oid)?;
            next_keys = Vec::new();
        },
        HistoryNode::Reference(oid, parents) => {
            writeln!(stream, "\t\"{}\" [label=\"{}\"];", oid, refmap.get(oid).unwrap().reference.shorthand().expect("Reference name not valid utf8"))?;
            // writeln!(stream, "\t\"{}\" [label=\"R\"];", oid)?;
            for &parent in parents {
                let node = history.node_for(parent).unwrap();
                writeln!(stream, "\t\"{}\" -> \"{}\";", node.oid(), oid)?;
            }
            next_keys = parents.clone();
        },
        HistoryNode::Merge(oid, parents) => {
            writeln!(stream, "\t\"{}\" [label=\"\"];", oid)?;
            for &parent in parents {
                let node = history.node_for(parent).unwrap();
                writeln!(stream, "\t\"{}\" -> \"{}\";", node.oid(), oid)?;
            }
            next_keys = parents.clone();
        },
    }

    for key in next_keys {
        write_dot(stream, history, seen, refmap, key)?;
    }

    Ok(())
}

fn main() -> Result<()> {
    let args = std::env::args().collect::<Vec<_>>();
    if args.len() != 2 {
        eprintln!("Usage: {} <repo-dir>", args[0]);
        std::process::exit(1);
    }

    let repo = git2::Repository::open(&args[1]).to_io_result()?;

    let mut refmap: HashMap<git2::Oid, RefInfo> = HashMap::new();

    for reference in repo.references().to_io_result()? {
        let reference = reference.to_io_result()?;
        if reference.is_tag() || reference.is_remote() {
            let reference = reference.resolve().to_io_result()?;
            match reference.peel_to_commit() {
                Ok(commit) => {
                    let oid = reference.target().expect("Resolved reference is not a direct reference?");
                    refmap.insert(oid, RefInfo { reference, commit });
                    // println!("{} {}",
                    //          reference.name().expect("Invalid utf8 in reference name"),
                    //          commit.id());
                }
                Err(_) => {},
            }
        }
    }

    let mut history_cache = HistoryCache::new(|oid| refmap.contains_key(oid));

    for (_oid, info) in &refmap {
        let _key = history_cache.build_history(&info.commit);
        // println!("{}: {:?}", oid, history_cache.node_for(key));
    }

    let mut keys_done = HashSet::new();
    println!("digraph G {{");
    println!("\trankdir=\"BT\";");
    // println!("\tnode [shape=point]");
    println!("\tedge [arrowhead=none]");
    println!("\tsep=\"+100\";");
    for (_oid, info) in &refmap {
        let key = history_cache.build_history(&info.commit);
        write_dot(&mut io::stdout(), &mut history_cache, &mut keys_done, &refmap, key)?;
    }
    println!("}}");

    Ok(())
}