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
use std::collections::HashSet;
use cairo_lang_defs::ids::{FreeFunctionId, GenericFunctionId};
use cairo_lang_diagnostics::Maybe;
use cairo_lang_semantic::TypeId;
use cairo_lang_utils::strongly_connected_components::{compute_scc, GraphNode};
use itertools::Itertools;
use crate::db::{LoweringGroup, SCCRepresentative};
pub fn function_scc_representative(
db: &dyn LoweringGroup,
function: FreeFunctionId,
) -> SCCRepresentative {
SCCRepresentative(db.function_scc(function).into_iter().min().unwrap_or(function))
}
pub fn function_scc_explicit_implicits(
db: &dyn LoweringGroup,
function: SCCRepresentative,
) -> Maybe<HashSet<TypeId>> {
let scc = function_scc(db, function.0);
let mut explicit_implicits = HashSet::new();
for func in scc {
let current_implicits: HashSet<TypeId> =
db.free_function_declaration_implicits(func)?.into_iter().collect();
explicit_implicits.extend(current_implicits);
}
Ok(explicit_implicits)
}
pub fn function_all_implicits(
db: &dyn LoweringGroup,
function: cairo_lang_semantic::FunctionId,
) -> Maybe<Vec<TypeId>> {
match db.lookup_intern_function(function).function.generic_function {
GenericFunctionId::Free(free_function) => db.free_function_all_implicits_vec(free_function),
GenericFunctionId::Extern(extern_function) => {
db.extern_function_declaration_implicits(extern_function)
}
GenericFunctionId::TraitFunction(_) | GenericFunctionId::ImplFunction(_) => todo!(),
}
}
pub fn free_function_all_implicits(
db: &dyn LoweringGroup,
function: FreeFunctionId,
) -> Maybe<HashSet<TypeId>> {
let scc_representative = db.function_scc_representative(function);
let mut all_implicits = db.function_scc_explicit_implicits(scc_representative.clone())?;
for direct_callee in db.free_function_definition_direct_callees(function)? {
let current_implicits =
match db.lookup_intern_function(direct_callee).function.generic_function {
GenericFunctionId::Free(free_function) => {
let direct_callee_representative =
db.function_scc_representative(free_function);
if direct_callee_representative == scc_representative {
continue;
}
db.free_function_all_implicits(direct_callee_representative.0)?
}
GenericFunctionId::Extern(extern_function) => {
db.extern_function_declaration_implicits(extern_function)?.into_iter().collect()
}
GenericFunctionId::TraitFunction(_) | GenericFunctionId::ImplFunction(_) => todo!(),
};
all_implicits.extend(¤t_implicits);
}
Ok(all_implicits)
}
pub fn free_function_all_implicits_vec(
db: &dyn LoweringGroup,
function: FreeFunctionId,
) -> Maybe<Vec<TypeId>> {
let implicits_set = db.free_function_all_implicits(function)?;
let mut implicits_vec = implicits_set.into_iter().collect_vec();
let semantic_db = db.upcast();
let precedence = db.implicit_precedence();
implicits_vec.sort_by_cached_key(|type_id| {
if let Some(idx) = precedence.iter().position(|item| item == type_id) {
return (idx, "".to_string());
}
(precedence.len(), type_id.format(semantic_db))
});
Ok(implicits_vec)
}
pub fn function_scc(db: &dyn LoweringGroup, function_id: FreeFunctionId) -> Vec<FreeFunctionId> {
compute_scc::<FreeFunctionNode<'_>>(FreeFunctionNode {
free_function_id: function_id,
db: db.upcast(),
})
}
#[derive(Clone)]
struct FreeFunctionNode<'a> {
free_function_id: FreeFunctionId,
db: &'a dyn LoweringGroup,
}
impl<'a> GraphNode for FreeFunctionNode<'a> {
type NodeId = FreeFunctionId;
fn get_neighbors(&self) -> Vec<Self> {
self.db
.free_function_definition_direct_free_function_callees(self.free_function_id)
.unwrap_or_default()
.into_iter()
.map(|free_function_id| FreeFunctionNode { free_function_id, db: self.db })
.collect()
}
fn get_id(&self) -> Self::NodeId {
self.free_function_id
}
}
pub fn function_may_panic(
db: &dyn LoweringGroup,
function: cairo_lang_semantic::FunctionId,
) -> Maybe<bool> {
match db.lookup_intern_function(function).function.generic_function {
GenericFunctionId::Free(free_function) => db.free_function_may_panic(free_function),
GenericFunctionId::Extern(extern_function) => {
Ok(db.extern_function_declaration_signature(extern_function)?.panicable)
}
GenericFunctionId::TraitFunction(_) | GenericFunctionId::ImplFunction(_) => todo!(),
}
}
pub fn free_function_may_panic(
db: &dyn LoweringGroup,
free_function: FreeFunctionId,
) -> Maybe<bool> {
let scc_representative = db.function_scc_representative(free_function);
for direct_callee in db.free_function_definition_direct_callees(free_function)? {
match db.lookup_intern_function(direct_callee).function.generic_function {
GenericFunctionId::Free(free_function) => {
let direct_callee_representative = function_scc_representative(db, free_function);
if direct_callee_representative == scc_representative {
continue;
}
if db.free_function_may_panic(direct_callee_representative.0)? {
return Ok(true);
}
}
GenericFunctionId::Extern(extern_function) => {
if db.extern_function_declaration_signature(extern_function)?.panicable {
return Ok(true);
}
}
GenericFunctionId::TraitFunction(_) | GenericFunctionId::ImplFunction(_) => todo!(),
};
}
Ok(false)
}