Commit 7ebf13d7 authored by Andreas Zwinkau's avatar Andreas Zwinkau
Browse files

API stripping

All removed functions had no implementation.

[r28105]
parent eada6d36
...@@ -657,12 +657,6 @@ FIRM_API ir_entity *get_irn_entity_attr(ir_node *n); ...@@ -657,12 +657,6 @@ FIRM_API ir_entity *get_irn_entity_attr(ir_node *n);
/** Returns non-zero for constant-like nodes. */ /** Returns non-zero for constant-like nodes. */
FIRM_API int is_irn_constlike(const ir_node *node); FIRM_API int is_irn_constlike(const ir_node *node);
/**
* Returns non-zero for nodes that must be always optimized
* (Phi, Id. Proj, Cond, Block, Confirm ...).
*/
FIRM_API int is_irn_always_opt(const ir_node *node);
/** /**
* Returns non-zero for nodes that are allowed to have keep-alives and * Returns non-zero for nodes that are allowed to have keep-alives and
* are neither Block nor PhiM. * are neither Block nor PhiM.
......
...@@ -106,15 +106,6 @@ FIRM_API int conv_opt(ir_graph *irg); ...@@ -106,15 +106,6 @@ FIRM_API int conv_opt(ir_graph *irg);
*/ */
FIRM_API ir_graph_pass_t *conv_opt_pass(const char *name); FIRM_API ir_graph_pass_t *conv_opt_pass(const char *name);
/**
* Do the scalar replacement optimization.
* Make a date flow analyze and split the
* data flow edges.
*
* @param irg the graph which should be optimized
*/
FIRM_API void data_flow_scalar_replacement_opt(ir_graph *irg);
/** /**
* A callback that checks whether a entity is an allocation * A callback that checks whether a entity is an allocation
* routine. * routine.
...@@ -621,9 +612,6 @@ FIRM_API int scalar_replacement_opt(ir_graph *irg); ...@@ -621,9 +612,6 @@ FIRM_API int scalar_replacement_opt(ir_graph *irg);
*/ */
FIRM_API ir_graph_pass_t *scalar_replacement_opt_pass(const char *name); FIRM_API ir_graph_pass_t *scalar_replacement_opt_pass(const char *name);
/** Performs strength reduction for the passed graph. */
FIRM_API void reduce_strength(ir_graph *irg);
/** /**
* Optimizes tail-recursion calls by converting them into loops. * Optimizes tail-recursion calls by converting them into loops.
* Depends on the flag opt_tail_recursion. * Depends on the flag opt_tail_recursion.
......
...@@ -274,9 +274,6 @@ FIRM_API void set_entity_linkage(ir_entity *entity, ir_linkage linkage); ...@@ -274,9 +274,6 @@ FIRM_API void set_entity_linkage(ir_entity *entity, ir_linkage linkage);
FIRM_API void add_entity_linkage(ir_entity *entity, ir_linkage linkage); FIRM_API void add_entity_linkage(ir_entity *entity, ir_linkage linkage);
FIRM_API void remove_entity_linkage(ir_entity *entity, ir_linkage linkage); FIRM_API void remove_entity_linkage(ir_entity *entity, ir_linkage linkage);
/** Returns 1 if the value of a global symbol never changes in a program */
FIRM_API int is_entity_constant(const ir_entity *ent);
/** /**
* This enumeration flags the volatility of entities and Loads/Stores. * This enumeration flags the volatility of entities and Loads/Stores.
* @deprecated * @deprecated
...@@ -2241,80 +2238,8 @@ FIRM_API long get_type_nr(const ir_type *tp); ...@@ -2241,80 +2238,8 @@ FIRM_API long get_type_nr(const ir_type *tp);
*/ */
typedef int (compare_types_func_t)(const void *tp1, const void *tp2); typedef int (compare_types_func_t)(const void *tp1, const void *tp2);
/** Compares two types by their name.
*
* Compares the opcode and the name of the types. If these are
* equal returns 0, else non-zero.
*/
FIRM_API int compare_names(const void *tp1, const void *tp2);
/** Compares two types strict.
*
* returns 0 if tp1 == tp2, else non-zero
*/
FIRM_API int compare_strict(const void *tp1, const void *tp2);
/* ------------------------------------------------------------------------ */ /* ------------------------------------------------------------------------ */
/** Computes a hash value by the type name.
*
* Uses the name of the type and the type opcode to compute the hash.
*/
FIRM_API int firm_hash_name(ir_type *tp);
/* ------------------------------------------------------------------------ */
/** Finalize type construction.
*
* Indicate that a type is so far completed that it can be
* distinguished from other types. Mature_type hashes the type into a
* table. It uses the function in compare_types_func to compare the
* types.
*
* If it finds a type identical to tp it returns this type. It turns
* tp into the Id type. All places formerly pointing to tp will now
* point to the found type. All entities of tp now refer to the found
* type as their owner, but they are not a member of this type. This
* is invalid firm -- the entities must be replaced by entities of the
* found type. The Id type will be removed from the representation
* automatically, but within an unknown time span. It occupies memory
* for this time.
*
* @param tp The type to mature.
*/
FIRM_API ir_type *mature_type(ir_type *tp);
/** Finalize type construction.
*
* Indicate that a type is so far completed that it can be
* distinguished from other types. mature_type() hashes the type into a
* table. It uses the function in compare_types_func to compare the
* types.
*
* If it finds a type identical to tp it returns this type. It frees
* type tp and all its entities.
*
* @param tp The type to mature.
*/
FIRM_API ir_type *mature_type_free(ir_type *tp);
/** Finalize type construction.
*
* Indicate that a type is so far completed that it can be
* distinguished from other types. Mature_type hashes the type into a
* table. It uses the function in compare_types_func to compare the
* types.
*
* If it find a type identical to tp it returns this type. It frees
* the entities and turns the type into an Id type. All places
* formerly pointing to tp will now point to the found type. The Id
* type will be removed from the representation automatically, but
* within an unknown time span. It occupies memory for this time.
*
* @param tp The type to mature.
*/
FIRM_API ir_type *mature_type_free_entities(ir_type *tp);
/** A data type to treat types and entities as the same. */ /** A data type to treat types and entities as the same. */
typedef union { typedef union {
ir_type *typ; /**< points to a type */ ir_type *typ; /**< points to a type */
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment