Legend:
Library
Module
Module type
Parameter
Class
Class type
Tries on BIL.
Bil provides two prefix tries trees.
The default one is not normalized and will compare bil statements literally. This means that comparison is sensitive to variable names and immediate values. Depending on your context it may be find or not. For example, two SP variables may compare as different if one of them was obtained from different compilation (and met the other one through some persistent storage, e.g., file on hard disk). Moreover, BIL obtained from different lifters will have different names for the same registers. All this issues are addressed in normalized Trie.
normalize ?subst bil normalize BIL. If subst is provided, then substitute each occurrence of the fst expression to the snd expression before the normalization. The effect of normalization is the following:
1. All immediate values are compared equal 2. All variables are compared nominally 3. BIL is simplified to reduce the syntactic differences (but the comparison is still syntactic, and (x + 2) will be compared differently to (2 + x).
add trie ~key ~data associates data with key. If trie already has some value associated with key, then the value will be overwritten (rebound)
val change : 'at->key->('a option->'a option)-> unit
change trie key f if trie has data associated with key then f will be called with Some data, otherwise it will be called with None. If f returns None then there will be no data associated with key, if f returns Some thing, then thing will be associated with key
val walk : 'at->key->init:'b->f:('b->'a option->'b)->'b
walk trie key ~init ~f walks down the tree starting from the root and ending with the last token of the key. Function f is fold over values associated with all substrings of the key, starting from a zero substring.
longest_match trie key find a value associated with a longest substring of key. Returns a pair - a length of matched key and the value, associated with that key.