* @file dfs.c
* @author Sebastian Hack
* @date 20.04.2007
- * @version $Id: $
+ * @version $Id$
* @summary
*
* Simple depth first search on CFGs.
- *
- * Copyright (C) 2007 Universitaet Karlsruhe
- * Released under the GPL
*/
#include <assert.h>
#include "irtools.h"
{
const dfs_edge_t *p = a;
const dfs_edge_t *q = b;
+ (void) sz;
return !(p->src == q->src && p->tgt == q->tgt);
}
{
const dfs_node_t *p = a;
const dfs_node_t *q = b;
+ (void) sz;
+
return p->node != q->node;
}
if (tgt->ancestor == src)
edge->kind = DFS_EDGE_ANC;
- else if (_dfs_int_is_ancestor(src, tgt))
- edge->kind = DFS_EDGE_FWD;
else if (_dfs_int_is_ancestor(tgt, src))
edge->kind = DFS_EDGE_BACK;
+ else if (_dfs_int_is_ancestor(src, tgt))
+ edge->kind = DFS_EDGE_FWD;
else
edge->kind = DFS_EDGE_CROSS;
}