cairo_lang_lowering/implicits/
mod.rs1use cairo_lang_defs::diagnostic_utils::StableLocation;
2use cairo_lang_defs::ids::LanguageElementId;
3use cairo_lang_diagnostics::Maybe;
4use cairo_lang_semantic as semantic;
5use cairo_lang_utils::ordered_hash_set::OrderedHashSet;
6use cairo_lang_utils::unordered_hash_map::UnorderedHashMap;
7use cairo_lang_utils::unordered_hash_set::UnorderedHashSet;
8use cairo_lang_utils::{LookupIntern, Upcast};
9use id_arena::Arena;
10use itertools::{Itertools, chain, zip_eq};
11use semantic::TypeId;
12
13use crate::blocks::Blocks;
14use crate::db::{ConcreteSCCRepresentative, LoweringGroup};
15use crate::ids::{ConcreteFunctionWithBodyId, FunctionId, FunctionLongId, LocationId};
16use crate::{
17 BlockEnd, BlockId, DependencyType, Lowered, LoweringStage, MatchArm, MatchInfo, Statement,
18 VarUsage, Variable,
19};
20
21struct Context<'a> {
22 db: &'a dyn LoweringGroup,
23 lowered: &'a mut Lowered,
24 implicit_index: UnorderedHashMap<TypeId, usize>,
25 implicits_tys: Vec<TypeId>,
26 implicit_vars_for_block: UnorderedHashMap<BlockId, Vec<VarUsage>>,
27 visited: UnorderedHashSet<BlockId>,
28 location: LocationId,
29}
30
31pub fn lower_implicits(
33 db: &dyn LoweringGroup,
34 function_id: ConcreteFunctionWithBodyId,
35 lowered: &mut Lowered,
36) {
37 if let Err(diag_added) = inner_lower_implicits(db, function_id, lowered) {
38 lowered.blocks = Blocks::new_errored(diag_added);
39 }
40}
41
42pub fn inner_lower_implicits(
44 db: &dyn LoweringGroup,
45 function_id: ConcreteFunctionWithBodyId,
46 lowered: &mut Lowered,
47) -> Maybe<()> {
48 let semantic_function = function_id.base_semantic_function(db).function_with_body_id(db);
49 let location = LocationId::from_stable_location(
50 db,
51 StableLocation::new(semantic_function.untyped_stable_ptr(db)),
52 );
53 lowered.blocks.has_root()?;
54 let root_block_id = BlockId::root();
55
56 let implicits_tys = db.function_with_body_implicits(function_id)?;
57
58 let implicit_index = implicits_tys.iter().enumerate().map(|(i, ty)| (*ty, i)).collect();
59 let mut ctx = Context {
60 db,
61 lowered,
62 implicit_index,
63 implicits_tys,
64 implicit_vars_for_block: Default::default(),
65 visited: Default::default(),
66 location,
67 };
68
69 lower_function_blocks_implicits(&mut ctx, root_block_id)?;
71
72 let implicit_vars = &ctx.implicit_vars_for_block[&root_block_id];
74 ctx.lowered.parameters.splice(0..0, implicit_vars.iter().map(|var_usage| var_usage.var_id));
75
76 Ok(())
77}
78
79fn alloc_implicits(
82 db: &dyn LoweringGroup,
83 variables: &mut Arena<Variable>,
84 implicits_tys: &[TypeId],
85 location: LocationId,
86) -> Vec<VarUsage> {
87 implicits_tys
88 .iter()
89 .copied()
90 .map(|ty| VarUsage {
91 var_id: variables.alloc(Variable::with_default_context(db, ty, location)),
92 location,
93 })
94 .collect_vec()
95}
96
97fn block_body_implicits(
99 ctx: &mut Context<'_>,
100 block_id: BlockId,
101) -> Result<Vec<VarUsage>, cairo_lang_diagnostics::DiagnosticAdded> {
102 let mut implicits = ctx
103 .implicit_vars_for_block
104 .entry(block_id)
105 .or_insert_with(|| {
106 alloc_implicits(
107 ctx.db,
108 &mut ctx.lowered.variables,
109 &ctx.implicits_tys,
110 ctx.location.with_auto_generation_note(ctx.db, "implicits"),
111 )
112 })
113 .clone();
114 let require_implicits_libfunc_id = semantic::corelib::internal_require_implicit(ctx.db);
115 let mut remove = vec![];
116 for (i, statement) in ctx.lowered.blocks[block_id].statements.iter_mut().enumerate() {
117 if let Statement::Call(stmt) = statement {
118 if matches!(
119 stmt.function.lookup_intern(ctx.db),
120 FunctionLongId::Semantic(func_id)
121 if func_id.get_concrete(ctx.db).generic_function == require_implicits_libfunc_id
122 ) {
123 remove.push(i);
124 continue;
125 }
126 let callee_implicits = ctx.db.function_implicits(stmt.function)?;
127 let location = stmt.location.with_auto_generation_note(ctx.db, "implicits");
128
129 let indices = callee_implicits.iter().map(|ty| ctx.implicit_index[ty]).collect_vec();
130
131 let implicit_input_vars = indices.iter().map(|i| implicits[*i]);
132 stmt.inputs.splice(0..0, implicit_input_vars);
133 let implicit_output_vars = callee_implicits
134 .iter()
135 .copied()
136 .map(|ty| {
137 ctx.lowered
138 .variables
139 .alloc(Variable::with_default_context(ctx.db, ty, location))
140 })
141 .collect_vec();
142 for (i, var) in zip_eq(indices, implicit_output_vars.iter()) {
143 implicits[i] =
144 VarUsage { var_id: *var, location: ctx.lowered.variables[*var].location };
145 }
146 stmt.outputs.splice(0..0, implicit_output_vars);
147 }
148 }
149 for i in remove.into_iter().rev() {
150 ctx.lowered.blocks[block_id].statements.remove(i);
151 }
152 Ok(implicits)
153}
154
155fn lower_function_blocks_implicits(ctx: &mut Context<'_>, root_block_id: BlockId) -> Maybe<()> {
157 let mut blocks_to_visit = vec![root_block_id];
158 while let Some(block_id) = blocks_to_visit.pop() {
159 if !ctx.visited.insert(block_id) {
160 continue;
161 }
162 let implicits = block_body_implicits(ctx, block_id)?;
163 match &mut ctx.lowered.blocks[block_id].end {
165 BlockEnd::Return(rets, _location) => {
166 rets.splice(0..0, implicits.iter().cloned());
167 }
168 BlockEnd::Panic(_) => {
169 unreachable!("Panics should have been stripped in a previous phase.")
170 }
171 BlockEnd::Goto(block_id, remapping) => {
172 let target_implicits = ctx
173 .implicit_vars_for_block
174 .entry(*block_id)
175 .or_insert_with(|| {
176 alloc_implicits(
177 ctx.db,
178 &mut ctx.lowered.variables,
179 &ctx.implicits_tys,
180 ctx.location,
181 )
182 })
183 .clone();
184 let old_remapping = std::mem::take(&mut remapping.remapping);
185 remapping.remapping = chain!(
186 zip_eq(
187 target_implicits.into_iter().map(|var_usage| var_usage.var_id),
188 implicits
189 ),
190 old_remapping
191 )
192 .collect();
193 blocks_to_visit.push(*block_id);
194 }
195 BlockEnd::Match { info } => {
196 blocks_to_visit.extend(info.arms().iter().rev().map(|a| a.block_id));
197 match info {
198 MatchInfo::Enum(_) | MatchInfo::Value(_) => {
199 for MatchArm { arm_selector: _, block_id, var_ids: _ } in info.arms() {
200 assert!(
201 ctx.implicit_vars_for_block
202 .insert(*block_id, implicits.clone())
203 .is_none(),
204 "Multiple jumps to arm blocks are not allowed."
205 );
206 }
207 }
208 MatchInfo::Extern(stmt) => {
209 let callee_implicits = ctx.db.function_implicits(stmt.function)?;
210
211 let indices =
212 callee_implicits.iter().map(|ty| ctx.implicit_index[ty]).collect_vec();
213
214 let implicit_input_vars = indices.iter().map(|i| implicits[*i]);
215 stmt.inputs.splice(0..0, implicit_input_vars);
216 let location = stmt.location.with_auto_generation_note(ctx.db, "implicits");
217
218 for MatchArm { arm_selector: _, block_id, var_ids } in stmt.arms.iter_mut()
219 {
220 let mut arm_implicits = implicits.clone();
221 let mut implicit_input_vars = vec![];
222 for ty in callee_implicits.iter().copied() {
223 let var = ctx
224 .lowered
225 .variables
226 .alloc(Variable::with_default_context(ctx.db, ty, location));
227 implicit_input_vars.push(var);
228 let implicit_index = ctx.implicit_index[&ty];
229 arm_implicits[implicit_index] = VarUsage { var_id: var, location };
230 }
231 assert!(
232 ctx.implicit_vars_for_block
233 .insert(*block_id, arm_implicits)
234 .is_none(),
235 "Multiple jumps to arm blocks are not allowed."
236 );
237
238 var_ids.splice(0..0, implicit_input_vars);
239 }
240 }
241 }
242 }
243 BlockEnd::NotSet => unreachable!(),
244 }
245 }
246 Ok(())
247}
248
249pub fn function_implicits(db: &dyn LoweringGroup, function: FunctionId) -> Maybe<Vec<TypeId>> {
253 if let Some(body) = function.body(db)? {
254 return db.function_with_body_implicits(body);
255 }
256 Ok(function.signature(db)?.implicits)
257}
258
259pub trait FunctionImplicitsTrait<'a>: Upcast<dyn LoweringGroup + 'a> {
261 fn function_with_body_implicits(
263 &self,
264 function: ConcreteFunctionWithBodyId,
265 ) -> Maybe<Vec<TypeId>> {
266 let db = self.upcast();
267 let scc_representative = db.lowered_scc_representative(
268 function,
269 DependencyType::Call,
270 LoweringStage::PostBaseline,
271 );
272 let mut implicits = db.scc_implicits(scc_representative)?;
273
274 let precedence = db.function_declaration_implicit_precedence(
275 function.base_semantic_function(db).function_with_body_id(db),
276 )?;
277 precedence.apply(&mut implicits, db);
278
279 Ok(implicits)
280 }
281}
282impl<'a, T: Upcast<dyn LoweringGroup + 'a> + ?Sized> FunctionImplicitsTrait<'a> for T {}
283
284pub fn scc_implicits(db: &dyn LoweringGroup, scc: ConcreteSCCRepresentative) -> Maybe<Vec<TypeId>> {
286 let scc_functions = db.lowered_scc(scc.0, DependencyType::Call, LoweringStage::PostBaseline);
287 let mut all_implicits = OrderedHashSet::<_>::default();
288 for function in scc_functions {
289 all_implicits.extend(function.function_id(db)?.signature(db)?.implicits);
291 let direct_callees =
293 db.lowered_direct_callees(function, DependencyType::Call, LoweringStage::PostBaseline)?;
294 for direct_callee in direct_callees {
295 if let Some(callee_body) = direct_callee.body(db)? {
296 let callee_scc = db.lowered_scc_representative(
297 callee_body,
298 DependencyType::Call,
299 LoweringStage::PostBaseline,
300 );
301 if callee_scc != scc {
302 all_implicits.extend(db.scc_implicits(callee_scc)?);
303 }
304 } else {
305 all_implicits.extend(direct_callee.signature(db)?.implicits);
306 }
307 }
308 }
309 Ok(all_implicits.into_iter().collect())
310}