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

Turn this function into a StackFunction.

Browse Source 
Sun Nov  6 17:06:52 2005  Soeren Sandmann  <sandmann@redhat.com>

        * profile.c (add_trace_to_tree): Turn this function into a
        StackFunction.

        * stackstash.c (stack_node_foreach_trace): Make this function take
        a StackFunction, and reimplement with do_callback().
This commit is contained in:
Soeren Sandmann
2005-11-06 22:10:30 +00:00
committed by Søren Sandmann Pedersen
parent c0aed2a4de
commit c1bfbbf9b8
5 changed files with 31 additions and 58 deletions
Download Patch File Download Diff File Expand all files Collapse all files

22
profile.c
View File

@ -29,15 +29,6 @@
typedef struct Node Node;
static void
update()
{
#if 0
while (g_main_pending())
g_main_iteration (FALSE);
#endif
}
struct Profile
{
StackStash * stash;
@ -243,27 +234,24 @@ profile_new (StackStash *stash)
}
static void
add_trace_to_tree (GSList *trace, gpointer data)
add_trace_to_tree (GSList *trace, gint size, gpointer data)
{
GSList *list;
GPtrArray *nodes_to_unmark = g_ptr_array_new ();
ProfileDescendant *parent = NULL;
int i, len;
ProfileDescendant **tree = data;
guint size = ((StackNode *)trace->data)->size;
trace = g_slist_reverse (g_slist_copy (trace));
for (list = trace; list != NULL; list = list->next)
{
StackNode *node = list->data;
gpointer address = list->data;
ProfileDescendant *match = NULL;
update();
for (match = *tree; match != NULL; match = match->siblings)
{
if (match->name == node->address)
if (match->name == address)
break;
}
@ -276,7 +264,7 @@ add_trace_to_tree (GSList *trace, gpointer data)
seen_tree_node = NULL;
for (n = parent; n != NULL; n = n->parent)
{
if (n->name == node->address)
if (n->name == address)
seen_tree_node = n;
}
@ -300,7 +288,7 @@ add_trace_to_tree (GSList *trace, gpointer data)
{
match = g_new (ProfileDescendant, 1);
match->name = node->address;
match->name = address;
match->non_recursion = 0;
match->self = 0;
match->children = NULL;