llir-opt
0.0.1
Low-Level Post-Link Optimiser for OCaml and C
|
#include <passes/pta/graph.h>
Classes | |
class | SetIterator |
Public Member Functions | |
SetNode * | Set () |
Creates a set node. | |
DerefNode * | Deref (SetNode *set) |
Creates a deref node. | |
RootNode * | Root (SetNode *set) |
Creates a root node. | |
SetNode * | Get (ID< SetNode * > id) const |
Returns a set mapped to an id. | |
DerefNode * | Get (ID< DerefNode * > id) const |
Returns a deref mapped to an id. | |
SetNode * | Find (ID< SetNode * > id) |
Finds a set node, given its ID. | |
DerefNode * | Find (ID< DerefNode * > id) const |
Finds a deref node, given its ID. | |
SetNode * | Union (SetNode *a, SetNode *b) |
Unifies two nodes. | |
SetIterator | begin () |
Iterator over sets - begin. | |
SetIterator | end () |
Iterator over sets - end. | |
Friends | |
class | SCCSolver |
Class storing and representing the graph.