varun-r-mallya/sysprof
1
0
Fork 0
mirror of https://github.com/varun-r-mallya/sysprof.git synced 2026-02-10 15:10:53 +00:00
Code Issues Packages Projects Releases Wiki Activity

Store a pointer to the root of the call tree

Browse Source 
Sat Apr 23 19:12:52 2005  Søren Sandmann  <sandmann@redhat.com>

	* profile.c: Store a pointer to the root of the call tree

	* profile.c (profile_load): Call sfile_input_free()

	* sfile.c (sformat_free): Implement this function
This commit is contained in:
Søren Sandmann
2005-04-23 23:18:42 +00:00
committed by Søren Sandmann Pedersen
parent 8424be6024
commit 984c6e1710
4 changed files with 103 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

80
sfile.c
View File

@ -67,7 +67,6 @@ struct Transition
struct State
{
GQueue *transitions;
guint marked : 1; /* Used by sformat_free */
};
struct Fragment
@ -128,14 +127,6 @@ set_invalid_content_error (GError **err, const char *format, ...)
va_end (args);
}
static State *
state_new (void)
{
State *state = g_new (State, 1);
state->transitions = g_queue_new ();
return state;
}
static Transition *
transition_new (const char *element,
TransitionKind kind,
@ -159,6 +150,38 @@ transition_new (const char *element,
return t;
}
static void
transition_free (Transition *transition)
{
if (transition->element)
g_free (transition->element);
g_free (transition);
}
static State *
state_new (void)
{
State *state = g_new (State, 1);
state->transitions = g_queue_new ();
return state;
}
static void
state_free (State *state)
{
GList *list;
for (list = state->transitions->head; list; list = list->next)
{
Transition *transition = list->data;
transition_free (transition);
}
g_queue_free (state->transitions);
g_free (state);
}
SFormat *
sformat_new (gpointer f)
{
@ -188,10 +211,41 @@ sformat_new_optional (gpointer f)
}
#endif
static void
add_state (State *state, GHashTable *seen_states, GQueue *todo_list)
{
if (!g_hash_table_lookup (seen_states, state))
{
g_hash_table_insert (seen_states, state, state);
g_queue_push_tail (todo_list, state);
}
}
void
sformat_free (SFormat *format)
{
/* FIXME */
GHashTable *seen_states = g_hash_table_new (g_direct_hash, g_direct_equal);
GQueue *todo_list = g_queue_new ();
add_state (format->begin, seen_states, todo_list);
add_state (format->end, seen_states, todo_list);
while (!g_queue_is_empty (todo_list))
{
GList *list;
State *state = g_queue_pop_head (todo_list);
for (list = state->transitions->head; list != NULL; list = list->next)
{
Transition *transition = list->data;
add_state (transition->to, seen_states, todo_list);
}
state_free (state);
}
g_hash_table_destroy (seen_states);
g_queue_free (todo_list);
}
static GQueue *
@ -1553,6 +1607,12 @@ sfile_output_save (SFileOutput *sfile,
}
void
sfile_input_free (SFileInput *file)
{
/* FIXME */
}
void
sfile_output_free (SFileOutput *sfile)
{