Home
last modified time | relevance | path

Searched refs:RuleSet (Results 1 – 5 of 5) sorted by relevance

/wasmtime-44.0.1/cranelift/isle/isle/src/
H A Drecursion.rs8 trie_again::{Binding, RuleSet},
12 pub fn check(terms: &[(TermId, RuleSet)], termenv: &TermEnv) -> Result<(), Vec<Error>> { in check() argument
37 fn terms_in_cycles(terms: &[(TermId, RuleSet)]) -> HashSet<TermId> { in terms_in_cycles()
101 fn terms_in_rule_set(rule_set: &RuleSet) -> HashSet<TermId> { in terms_in_rule_set()
H A Dserialize.rs24 use crate::trie_again::{Binding, BindingId, Constraint, Rule, RuleSet};
28 pub fn serialize(rules: &RuleSet) -> Block { in serialize()
160 fn respect_priority(rules: &RuleSet, order: &mut [usize], partition_point: usize) -> usize { in respect_priority() argument
216 fn partition(self, rules: &RuleSet, order: &mut [usize]) -> PartitionResults { in partition() argument
379 rules: &'a RuleSet,
391 fn new(rules: &'a RuleSet) -> Decomposition<'a> { in new()
H A Doverlap.rs12 pub fn check(termenv: &TermEnv) -> Result<Vec<(TermId, trie_again::RuleSet)>, Vec<Error>> { in check() argument
107 fn check_overlaps(terms: &[(TermId, trie_again::RuleSet)], env: &TermEnv) -> Errors { in check_overlaps() argument
H A Dtrie_again.rs222 pub struct RuleSet { struct
232 pub fn build(termenv: &sema::TermEnv) -> (Vec<(sema::TermId, RuleSet)>, Vec<Error>) { in build() argument
253 impl RuleSet { impl
401 rules: RuleSet,
H A Dcodegen.rs9 use crate::trie_again::{Binding, BindingId, Constraint, RuleSet};
61 terms: &[(TermId, RuleSet)], in codegen() argument
72 terms: &'a [(TermId, RuleSet)],
82 ruleset: &'a RuleSet,
104 ruleset: &'a RuleSet, in new() argument
164 terms: &'a [(TermId, RuleSet)], in compile() argument