libFirm
1.20
Main Page
Related Pages
Modules
Data Structures
Files
Modules
Here is a list of all modules:
Code Generation
Source References
Analyses
Callgraph
Control Dependence
Basic Block Execution Frequency
Node Heights
Dominance Information
Dynamic Reverse Edges
Loops
Memory Disambiguator
Reverse Edges
Value Information
Abstract Data Structures
Arrays
Set (custom Compare)
Linked Lists
Double Ended Queue
Pointer Map
Priority Queue
Pointer Set
Generic Hashset
Union-Find
Memory Allocation
Algorithms
Bipartite Matching
Gauss Jordan Elimination
Hash Functions
Hungarian Algorithm
Identifiers
Visualisation
Convenience Interface
Procedure Graph
Construction Support
Traversing
Nodes
Node Opcodes
ASM node
Add node
Alloc node
Anchor node
And node
Bad node
Block node
Borrow node
Bound node
Builtin node
Call node
Carry node
Cast node
Cmp node
Cond node
Confirm node
Const node
Conv node
CopyB node
Deleted node
Div node
Dummy node
End node
Eor node
Free node
IJmp node
Id node
InstOf node
Jmp node
Load node
Minus node
Mod node
Mul node
Mulh node
Mux node
NoMem node
Not node
Or node
Phi node
Pin node
Proj node
Raise node
Return node
Rotl node
Sel node
Shl node
Shr node
Shrs node
Start node
Store node
Sub node
Switch node
SymConst node
Sync node
Tuple node
Unknown node
Input and Output
Value Modes
Transformations and Optimisations
Flags
Graph Transformations
Local Optimizations
Program
Correctness Tests
Flags
Lowering
Target Machine Values
Entities
Entity Initializers
Type System
Reverse Type Edges
Type Opcodes
Class
Struct
Union
Method
Array
Enumeration
Pointer
Primitive
None
Code
Unknown
Compound
Class
Struct
Union
Frame
Traversing
Generated on Tue Mar 6 2012 16:43:28 for libFirm by
1.7.4