Commit 43eec2cc authored by Matthias Braun's avatar Matthias Braun
Browse files

constnes and comment improvements for irheights

[r27711]
parent 6094bf5b
...@@ -34,12 +34,13 @@ typedef struct _heights_t heights_t; ...@@ -34,12 +34,13 @@ typedef struct _heights_t heights_t;
/** /**
* Get the height of a node inside a basic block. * Get the height of a node inside a basic block.
* The height of the node is the maximal number of edges between a sink node in that block and the node itself (plus 1). * The height of the node is the maximal number of edges between a sink node in
* that block and the node itself (plus 1).
* @param h The heights object. * @param h The heights object.
* @param irn The node. * @param irn The node.
* @return The height of the node. * @return The height of the node.
*/ */
FIRM_API unsigned get_irn_height(heights_t *h, const ir_node *irn); FIRM_API unsigned get_irn_height(const heights_t *h, const ir_node *irn);
/** /**
* Check, if a certain node is reachable according to data dependence edges from another node. * Check, if a certain node is reachable according to data dependence edges from another node.
......
...@@ -84,7 +84,7 @@ static void height_dump_cb(void *data, FILE *f, const ir_node *irn) ...@@ -84,7 +84,7 @@ static void height_dump_cb(void *data, FILE *f, const ir_node *irn)
* @param tgt The node we try to reach. * @param tgt The node we try to reach.
* @return 1, one of tgt can be reached from curr, 0 else. * @return 1, one of tgt can be reached from curr, 0 else.
*/ */
static bool search(heights_t *h, const ir_node *curr, const ir_node *tgt) static bool search(const heights_t *h, const ir_node *curr, const ir_node *tgt)
{ {
irn_height_t *h_curr; irn_height_t *h_curr;
irn_height_t *h_tgt; irn_height_t *h_tgt;
...@@ -124,9 +124,11 @@ static bool search(heights_t *h, const ir_node *curr, const ir_node *tgt) ...@@ -124,9 +124,11 @@ static bool search(heights_t *h, const ir_node *curr, const ir_node *tgt)
} }
/** /**
* Check, if one node can be reached from another one, according to data dependence. * Check, if one node can be reached from another one, according to data
* dependence.
*/ */
int heights_reachable_in_block(heights_t *h, const ir_node *n, const ir_node *m) int heights_reachable_in_block(heights_t *h, const ir_node *n,
const ir_node *m)
{ {
int res = 0; int res = 0;
irn_height_t *hn = phase_get_irn_data(&h->phase, n); irn_height_t *hn = phase_get_irn_data(&h->phase, n);
...@@ -218,9 +220,9 @@ static void compute_heights_in_block_walker(ir_node *block, void *data) ...@@ -218,9 +220,9 @@ static void compute_heights_in_block_walker(ir_node *block, void *data)
compute_heights_in_block(block, h); compute_heights_in_block(block, h);
} }
unsigned get_irn_height(heights_t *heights, const ir_node *irn) unsigned get_irn_height(const heights_t *heights, const ir_node *irn)
{ {
irn_height_t *h = phase_get_irn_data(&heights->phase, irn); const irn_height_t *h = phase_get_irn_data(&heights->phase, irn);
assert(h && "No height information for node"); assert(h && "No height information for node");
return h->height; return h->height;
} }
......
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