mirror of
https://github.com/rtic-rs/rtic.git
synced 2025-02-17 13:58:38 +01:00
58 lines
1.5 KiB
Rust
58 lines
1.5 KiB
Rust
use core::ops;
|
|
use std::collections::{BTreeMap, BTreeSet};
|
|
|
|
use crate::syntax::{
|
|
analyze::{self, Priority},
|
|
ast::{App, Dispatcher},
|
|
};
|
|
use syn::Ident;
|
|
|
|
/// Extend the upstream `Analysis` struct with our field
|
|
pub struct Analysis {
|
|
parent: analyze::Analysis,
|
|
pub interrupts: BTreeMap<Priority, (Ident, Dispatcher)>,
|
|
pub max_async_prio: Option<u8>,
|
|
}
|
|
|
|
impl ops::Deref for Analysis {
|
|
type Target = analyze::Analysis;
|
|
|
|
fn deref(&self) -> &Self::Target {
|
|
&self.parent
|
|
}
|
|
}
|
|
|
|
// Assign an interrupt to each priority level
|
|
pub fn app(analysis: analyze::Analysis, app: &App) -> Analysis {
|
|
let mut available_interrupt = app.args.dispatchers.clone();
|
|
|
|
// the set of priorities (each priority only once)
|
|
let priorities = app
|
|
.software_tasks
|
|
.values()
|
|
.map(|task| task.args.priority)
|
|
.collect::<BTreeSet<_>>();
|
|
|
|
// map from priorities to interrupts (holding name and attributes)
|
|
|
|
let interrupts: BTreeMap<Priority, _> = priorities
|
|
.iter()
|
|
.filter(|prio| **prio > 0) // 0 prio tasks are run in main
|
|
.copied()
|
|
.rev()
|
|
.map(|p| (p, available_interrupt.pop().expect("UNREACHABLE")))
|
|
.collect();
|
|
|
|
let max_async_prio = app
|
|
.hardware_tasks
|
|
.iter()
|
|
.map(|(_, task)| task.args.priority)
|
|
.min()
|
|
.map(|v| v - 1); // One less than the smallest HW task
|
|
|
|
Analysis {
|
|
parent: analysis,
|
|
interrupts,
|
|
max_async_prio,
|
|
}
|
|
}
|