pilota-build 0.13.10

Compile thrift and protobuf idl into rust code at compile-time.
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

use std::sync::Arc;

use petgraph::{Graph, algo::has_path_connecting, graph::NodeIndex};
use rustc_hash::FxHashMap;

use super::{
    rir::Item,
    ty::{self},
};
use crate::symbol::DefId;

#[derive(Debug)]
pub struct WorkspaceGraph {
    pub(crate) graph: Graph<DefId, ()>,
    pub(crate) node_map: FxHashMap<DefId, NodeIndex>,
    pub(crate) id_map: FxHashMap<NodeIndex, DefId>,
}

impl WorkspaceGraph {
    pub fn from_items(items: impl Iterator<Item = (DefId, Arc<Item>)> + Clone) -> Self {
        let mut graph: Graph<DefId, ()> = Graph::new();
        let mut node_map = FxHashMap::default();
        let mut id_map = FxHashMap::default();
        items.clone().for_each(|(def_id, _)| {
            let node_index = graph.add_node(def_id);
            node_map.insert(def_id, node_index);
            id_map.insert(node_index, def_id);
        });

        fn visit(
            graph: &mut Graph<DefId, ()>,
            idx: NodeIndex,
            node_map: &FxHashMap<DefId, NodeIndex>,
            ty: &ty::Ty,
        ) {
            match &ty.kind {
                ty::Path(p) => {
                    graph.add_edge(idx, node_map[&p.did], ());
                }
                ty::Vec(ty) | ty::Set(ty) | ty::BTreeSet(ty) => {
                    visit(graph, idx, node_map, ty);
                }
                ty::Map(ty1, ty2) | ty::BTreeMap(ty1, ty2) => {
                    visit(graph, idx, node_map, ty1);
                    visit(graph, idx, node_map, ty2);
                }
                ty::Arc(ty) => {
                    visit(graph, idx, node_map, ty);
                }
                _ => {}
            }
        }

        items.for_each(|(def_id, item)| {
            let idx = node_map[&def_id];
            match &*item {
                Item::Message(s) => s.fields.iter().for_each(|f| {
                    visit(&mut graph, idx, &node_map, &f.ty);
                }),
                Item::Enum(e) => {
                    e.variants.iter().flat_map(|v| &v.fields).for_each(|ty| {
                        visit(&mut graph, idx, &node_map, ty);
                    });
                }
                Item::NewType(t) => {
                    visit(&mut graph, idx, &node_map, &t.ty);
                }
                _ => {}
            };
        });
        Self {
            graph,
            node_map,
            id_map,
        }
    }

    pub fn is_nested(&self, a: DefId, b: DefId) -> bool {
        let a = self.node_map[&a];
        let b = self.node_map[&b];
        has_path_connecting(&self.graph, a, b, None)
    }
}