summaryrefslogtreecommitdiffhomepage
path: root/ir/kaps
diff options
context:
space:
mode:
authorMichael Beck <mm.beck@gmx.net>2011-04-24 15:54:52 +0200
committerMichael Beck <mm.beck@gmx.net>2011-04-24 16:04:48 +0200
commiteebab16e6be8c73ebb7cb01d04567136f36b7337 (patch)
treea7d7222ce5be15caabb364a5b953f9265e1221fe /ir/kaps
parent4879e4b506f42496f00991f8472e91814e383bfb (diff)
Fixed some size_t related warnings.
Diffstat (limited to 'ir/kaps')
-rw-r--r--ir/kaps/html_dumper.c4
-rw-r--r--ir/kaps/kaps.c4
-rw-r--r--ir/kaps/pbqp_node.c8
3 files changed, 8 insertions, 8 deletions
diff --git a/ir/kaps/html_dumper.c b/ir/kaps/html_dumper.c
index 11ffb6e..a6cfc91 100644
--- a/ir/kaps/html_dumper.c
+++ b/ir/kaps/html_dumper.c
@@ -103,8 +103,8 @@ static void dump_edge_costs(pbqp_t *pbqp)
fputs("<p>", pbqp->dump_file);
for (src_index = 0; src_index < pbqp->num_nodes; ++src_index) {
pbqp_node_t *src_node = get_node(pbqp, src_index);
- unsigned edge_index;
- unsigned len;
+ size_t edge_index;
+ size_t len;
if (!src_node)
continue;
diff --git a/ir/kaps/kaps.c b/ir/kaps/kaps.c
index 7c8d253..8bbb415 100644
--- a/ir/kaps/kaps.c
+++ b/ir/kaps/kaps.c
@@ -44,8 +44,8 @@ pbqp_node_t *get_node(pbqp_t *pbqp, unsigned index)
pbqp_edge_t *get_edge(pbqp_t *pbqp, unsigned src_index, unsigned tgt_index)
{
- int i;
- int len;
+ size_t i;
+ size_t len;
pbqp_node_t *src_node;
pbqp_node_t *tgt_node;
diff --git a/ir/kaps/pbqp_node.c b/ir/kaps/pbqp_node.c
index 37cda95..d7dba26 100644
--- a/ir/kaps/pbqp_node.c
+++ b/ir/kaps/pbqp_node.c
@@ -53,8 +53,8 @@ pbqp_node_t *alloc_node(pbqp_t *pbqp, unsigned node_index, vector_t *costs)
int is_connected(pbqp_node_t *node, pbqp_edge_t *edge)
{
pbqp_edge_t **edges;
- unsigned edge_index;
- unsigned edge_len;
+ size_t edge_index;
+ size_t edge_len;
assert(node);
if (edge->src != node && edge->tgt != node) return 0;
@@ -75,8 +75,8 @@ int is_connected(pbqp_node_t *node, pbqp_edge_t *edge)
void disconnect_edge(pbqp_node_t *node, pbqp_edge_t *edge)
{
pbqp_edge_t **edges;
- unsigned edge_index;
- unsigned edge_len;
+ size_t edge_index;
+ size_t edge_len;
edges = node->edges;
edge_len = ARR_LEN(edges);