libFirm 1.20
|
libfirm/analyze_irg_args.h [code] | Read/write analyze of graph argument, which have mode reference |
libfirm/be.h [code] | Generic backend types and interfaces |
libfirm/begin.h [code] | Should be included in all public firm headers at the beginning |
libfirm/callgraph.h [code] | Representation and computation of the callgraph |
libfirm/cdep.h [code] | Control dependence analysis |
libfirm/cgana.h [code] | Intraprozedural analyses to estimate the call graph |
libfirm/compound_path.h [code] | Deprecated way to initialize compound entites! (use ir_initializer stuff instead) Declarations for functions and datastructures to represent compound type initializers |
libfirm/dbginfo.h [code] | Implements the Firm interface to debug information |
libfirm/end.h [code] | Should be included in all public firm headers at the end |
libfirm/execfreq.h [code] | Compute an estimate of basic block executions |
libfirm/firm.h [code] | Central firm header |
libfirm/firm_common.h [code] | Common firm declarations |
libfirm/firm_types.h [code] | Definition of opaque firm types |
libfirm/firmstat.h [code] | Statistics for Firm |
libfirm/heights.h [code] | Compute heights of nodes inside basic blocks |
libfirm/ident.h [code] | Data type for unique names |
libfirm/irarch.h [code] | Some machine dependent optimizations |
libfirm/ircgopt.h [code] | Removal of unreachable methods |
libfirm/ircons.h [code] | Various irnode constructors |
libfirm/irconsconfirm.h [code] | Construction of Confirm nodes |
libfirm/irdom.h [code] | Construct and access dominator tree |
libfirm/irdump.h [code] | Write vcg representation of firm to file |
libfirm/iredgekinds.h [code] | Declares different kind of edges between nodes |
libfirm/iredges.h [code] | Public header for the automatically updating outs |
libfirm/irextbb.h [code] | Extended basis block support |
libfirm/irflag.h [code] | Flags to control optimizations |
libfirm/irgmod.h [code] | Support for ir graph modification |
libfirm/irgopt.h [code] | Optimizations for a whole ir graph, i.e., a procedure |
libfirm/irgraph.h [code] | Entry point to the representation of procedure code |
libfirm/irgwalk.h [code] | Traverse an ir graph |
libfirm/irhooks.h [code] | Generic hooks for various libFirm functions |
libfirm/irio.h [code] | Input/Output textual representation of firm |
libfirm/irloop.h [code] | Loop datastructure and access functions |
libfirm/irmemory.h [code] | Memory disambiguator |
libfirm/irmode.h [code] | Data modes of operations |
libfirm/irnode.h [code] | Representation of an intermediate operation |
libfirm/irop.h [code] | Representation of opcode of intermediate operation |
libfirm/iropt.h [code] | Iropt --- optimizations of an ir node |
libfirm/iroptimize.h [code] | Available Optimisations of libFirm |
libfirm/irouts.h [code] | Compute and access out edges (also called def-use edges) |
libfirm/irpass.h [code] | Manager for transformation passes |
libfirm/irprintf.h [code] | A little printf understanding some firm types |
libfirm/irprog.h [code] | Entry point to the representation of a whole program |
libfirm/irtypeinfo.h [code] | Data structure to hold type information for nodes |
libfirm/irverify.h [code] | Check irnodes for correctness |
libfirm/lowering.h [code] | Lowering of high level constructs |
libfirm/nodeops.h [code] | |
libfirm/opcodes.h [code] | |
libfirm/timing.h [code] | Platform neutral timing utilities |
libfirm/trouts.h [code] | Reverse edges that reference types/entities |
libfirm/tv.h [code] | Representation of and static computations on target machine values |
libfirm/typerep.h [code] | Declarations for functions and datastructures to represent types |
libfirm/vrp.h [code] | Analyse the graph with value range propagation |
libfirm/adt/array.h [code] | Dynamic and flexible arrays for C |
libfirm/adt/bipartite.h [code] | Implements bipartite matchings |
libfirm/adt/cpset.h [code] | Set of pointers with a custom compare function |
libfirm/adt/gaussjordan.h [code] | Solves a system of linear equations |
libfirm/adt/gaussseidel.h [code] | |
libfirm/adt/hashptr.h [code] | Hash functions |
libfirm/adt/hashset.h [code] | Generic hashset functions |
libfirm/adt/hungarian.h [code] | Solving the Minimum Assignment Problem using the Hungarian Method |
libfirm/adt/list.h [code] | |
libfirm/adt/obst.h [code] | Provides obstack_chunk_alloc and obstack_chunk_free for obstack.h |
libfirm/adt/obstack.h [code] | |
libfirm/adt/pdeq.h [code] | Double ended queue of generic pointers |
libfirm/adt/plist.h [code] | Simple, non circular, double linked pointer list. Created because the properties of the standard circular list were not very well suited for the interference graph implementation. This list uses an obstack and a free-list to efficiently manage its elements |
libfirm/adt/pmap.h [code] | Simplified hashmap for pointer->pointer relations |
libfirm/adt/pqueue.h [code] | Implementation of a priority queue. This is the ported version of the original Java implementation by Matthias Braun |
libfirm/adt/pset.h [code] | Optimized version of set for sets containing only pointers (deprecated) |
libfirm/adt/pset_new.h [code] | Hashset containing pointers |
libfirm/adt/set.h [code] | Hashset: datastructure containing objects accessible by their key |
libfirm/adt/unionfind.h [code] | Union-Find datastructure |
libfirm/adt/xmalloc.h [code] | Never failing wrappers for malloc() & friends |