projects
/
libfirm
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
sparc: fix float to short conversion
[libfirm]
/
ir
/
ana
/
dfs_t.h
diff --git
a/ir/ana/dfs_t.h
b/ir/ana/dfs_t.h
index
b64534c
..
7af7bef
100644
(file)
--- a/
ir/ana/dfs_t.h
+++ b/
ir/ana/dfs_t.h
@@
-1,5
+1,5
@@
/*
/*
- * Copyright (C) 1995-200
7
University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-200
8
University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
*
* This file is part of libFirm.
*
@@
-21,37
+21,35
@@
* @file dfs_t.h
* @author Sebastian Hack
* @date 21.04.2007
* @file dfs_t.h
* @author Sebastian Hack
* @date 21.04.2007
- * @version $Id$
- * @summary
+ * @brief
*
* depth first search internal stuff.
*/
#ifndef FIRM_ANA_DFS_T_H
#define FIRM_ANA_DFS_T_H
*
* depth first search internal stuff.
*/
#ifndef FIRM_ANA_DFS_T_H
#define FIRM_ANA_DFS_T_H
-#include "firm_config.h"
#include "hashptr.h"
#include "absgraph.h"
#include "obst.h"
#include "dfs.h"
#include "hashptr.h"
#include "absgraph.h"
#include "obst.h"
#include "dfs.h"
-struct
_
dfs_node_t {
+struct dfs_node_t {
int visited;
const void *node;
const void *ancestor;
int pre_num;
int max_pre_num;
int visited;
const void *node;
const void *ancestor;
int pre_num;
int max_pre_num;
- int
post_num;
- int
level;
+ int post_num;
+ int level;
};
};
-struct
_
dfs_edge_t {
+struct dfs_edge_t {
const void *src, *tgt;
dfs_node_t *s, *t;
dfs_edge_kind_t kind;
};
const void *src, *tgt;
dfs_node_t *s, *t;
dfs_edge_kind_t kind;
};
-struct
_
dfs_t {
+struct dfs_t {
void *graph;
const absgraph_t *graph_impl;
struct obstack obst;
void *graph;
const absgraph_t *graph_impl;
struct obstack obst;
@@
-67,20
+65,20
@@
struct _dfs_t {
unsigned edges_classified : 1;
};
unsigned edges_classified : 1;
};
-static
struct _dfs_node_t *_dfs_get_node(const struct _
dfs_t *self, const void *node)
+static
dfs_node_t *_dfs_get_node(const
dfs_t *self, const void *node)
{
{
-
struct _
dfs_node_t templ;
+ dfs_node_t templ;
memset(&templ, 0, sizeof(templ));
templ.node = node;
memset(&templ, 0, sizeof(templ));
templ.node = node;
- return
set_insert(self->nodes, &templ, sizeof(templ), HASH_PTR
(node));
+ return
(dfs_node_t*) set_insert(self->nodes, &templ, sizeof(templ), hash_ptr
(node));
}
#define _dfs_int_is_ancestor(n, m) ((m)->pre_num >= (n)->pre_num && (m)->pre_num <= (n)->max_pre_num)
}
#define _dfs_int_is_ancestor(n, m) ((m)->pre_num >= (n)->pre_num && (m)->pre_num <= (n)->max_pre_num)
-static
INLINE int _dfs_is_ancestor(const struct _
dfs_t *dfs, const void *a, const void *b)
+static
inline int _dfs_is_ancestor(const
dfs_t *dfs, const void *a, const void *b)
{
{
-
struct _
dfs_node_t *n = _dfs_get_node(dfs, a);
-
struct _
dfs_node_t *m = _dfs_get_node(dfs, b);
+ dfs_node_t *n = _dfs_get_node(dfs, a);
+ dfs_node_t *m = _dfs_get_node(dfs, b);
return _dfs_int_is_ancestor(n, m);
}
return _dfs_int_is_ancestor(n, m);
}