#include <glib.h>
#include "binfile.h"
#include "process.h"
#include "stackstash.h"
#include "profile.h"

typedef struct RealProfile RealProfile;
typedef struct Node Node;

static void
update()
{
#if 0
    while (g_main_pending())
	g_main_iteration (FALSE);
#endif
}

static guint
direct_hash_no_null (gconstpointer v)
{
    g_assert (v);
    return GPOINTER_TO_UINT (v);
}

struct Node
{
    ProfileObject *object;

    Node *siblings;		/* siblings in the call tree */
    Node *children;		/* children in the call tree */
    Node *parent;		/* parent in call tree */
    Node *next;			/* nodes that corresponding to same object */

    guint total;
    guint self;
    
    gboolean toplevel;
};

struct RealProfile
{
    Profile profile;

    Node *call_tree;
    GHashTable *profile_objects;
    GHashTable *nodes_by_object;
};

static ProfileObject *
profile_object_new (void)
{
    ProfileObject *obj = g_new (ProfileObject, 1);
    obj->total = 0;
    obj->self = 0;
    
    return obj;
}

static void
profile_object_free (ProfileObject *obj)
{
    g_free (obj->name);
    g_free (obj);
}

static char *
generate_key (RealProfile *profile, Process *process, gulong address)
{
    if (address)
    {
	const Symbol *symbol = process_lookup_symbol (process, address);

	return g_strdup_printf ("%p%s", symbol->address, symbol->name);
    }
    else
    {
	return g_strdup_printf ("p:%p", process_get_cmdline (process));
    }
}

static char *
generate_presentation_name (RealProfile *profile, Process *process, gulong address)
{
    /* FIXME using 0 to indicate "process" is broken */
    if (address)
    {
	const Symbol *symbol = process_lookup_symbol (process, address);

	return g_strdup_printf ("%s", symbol->name);
    }
    else
    {
	return g_strdup_printf ("%s", process_get_cmdline (process));
    }
#if 0
    /* FIXME - don't return addresses and stuff */
    return generate_key (profile, process, address);
#endif
}

static void
ensure_profile_node (RealProfile *profile, Process *process, gulong address)
{
    char *key = generate_key (profile, process, address);

    if (!g_hash_table_lookup (profile->profile_objects, key))
    {
	ProfileObject *object;

	object = profile_object_new ();
	object->name = generate_presentation_name (profile, process, address);

	g_hash_table_insert (profile->profile_objects, key, object);
    }
    else
    {
	g_free (key);
    }
}

static ProfileObject *
lookup_profile_object (RealProfile *profile, Process *process, gulong address)
{
    ProfileObject *object;
    char *key = generate_key (profile, process, address);
    object = g_hash_table_lookup (profile->profile_objects, key);
    g_free (key);
    g_assert (object);
    return object;
}

static void
generate_object_table (Process *process, GSList *trace, gint size, gpointer data)
{
    RealProfile *profile = data;
    GSList *list;

    ensure_profile_node (profile, process, 0);

    for (list = trace; list != NULL; list = list->next)
    {
	update ();
	ensure_profile_node (profile, process, (gulong)list->data);
    }

    profile->profile.profile_size += size;
}

static Node *
node_new ()
{
    Node *node = g_new (Node, 1);
    node->siblings = NULL;
    node->children = NULL;
    node->parent = NULL;
    node->next = NULL;
    node->object = NULL;
    node->self = 0;
    node->total = 0;
    
    return node;
}

static Node *
node_add_trace (RealProfile *profile, Node *node, Process *process,
		GSList *trace, gint size,
		GHashTable *seen_objects)
{
    ProfileObject *object;
    Node *match = NULL;

    if (!trace)
	return node;
    
    object = lookup_profile_object (profile, process, (gulong)trace->data);
    for (match = node; match != NULL; match = match->siblings)
    {
	if (match->object == object)
	    break;
    }

    if (!match)
    {
	match = node_new ();
	match->object = object;
	match->siblings = node;
	node = match;

	if (g_hash_table_lookup (seen_objects, object))
	    match->toplevel = FALSE;
	else
	    match->toplevel = TRUE;

	match->next = g_hash_table_lookup (profile->nodes_by_object, object);
	g_hash_table_insert (profile->nodes_by_object, object, match);
    }

    g_hash_table_insert (seen_objects, object, GINT_TO_POINTER (1));

#if 0
    g_print ("%s adds %d\n", match->object->name, size);
#endif
    match->total += size;
    if (!trace->next)
	match->self += size;
    
    match->children = node_add_trace (profile, match->children, process, trace->next, size,
				      seen_objects);
    
    return node;
}

#if 0
static void
dump_trace (GSList *trace)
{
    g_print ("TRACE: ");
    while (trace)
    {
	g_print ("%x ", trace->data);
	trace = trace->next;
    }
    g_print ("\n\n");
}
#endif
 
static void
generate_call_tree (Process *process, GSList *trace, gint size, gpointer data)
{
    RealProfile *profile = data;
    Node *match = NULL;
    ProfileObject *proc = lookup_profile_object (profile, process, 0);
    GHashTable *seen_objects;

    for (match = profile->call_tree; match; match = match->siblings)
    {
	if (match->object == proc)
	    break;
    }

    if (!match)
    {
	match = node_new ();
	match->object = proc;
	match->siblings = profile->call_tree;
	profile->call_tree = match;
	match->toplevel = TRUE;
    }

    g_hash_table_insert (profile->nodes_by_object, proc, match);

    match->total += size;
    if (!trace)
	match->self += size;

    seen_objects = g_hash_table_new (direct_hash_no_null, g_direct_equal);

    g_hash_table_insert (seen_objects, proc, GINT_TO_POINTER (1));

    update ();
    match->children = node_add_trace (profile, match->children, process,
				      trace, size, seen_objects);
    
    g_hash_table_destroy (seen_objects);
}

static void
build_object_list (gpointer key, gpointer value, gpointer data)
{
    Profile *profile = data;
    Node *node = value;
    ProfileObject *object = key;

    while (node)
    {
	object->self += node->self;
	if (node->toplevel)
	    object->total += node->total;

	node = node->next;
    }
    
    profile->objects = g_list_prepend (profile->objects, object);
}

static void
link_parents (Node *node, Node *parent)
{
    if (!node)
	return;
    
    node->parent = parent;
    
    link_parents (node->siblings, parent);
    link_parents (node->children, node);
}

Profile *
profile_new (StackStash *stash)
{
    RealProfile *real_profile = g_new (RealProfile, 1);

    real_profile->profile_objects =
	g_hash_table_new_full (g_str_hash, g_str_equal,
			       g_free, (GDestroyNotify)profile_object_free);

    real_profile->call_tree = NULL;

    real_profile->nodes_by_object =
	g_hash_table_new (direct_hash_no_null, g_direct_equal);
    real_profile->profile.objects = NULL;

    real_profile->profile.profile_size = 0;

    stack_stash_foreach (stash, generate_object_table, real_profile);
    stack_stash_foreach (stash, generate_call_tree, real_profile);
    link_parents (real_profile->call_tree, NULL);
    
    g_hash_table_foreach (real_profile->nodes_by_object, build_object_list, real_profile);

    return (Profile *)real_profile;
}

static void
add_trace_to_tree (ProfileDescendant **tree, GList *trace, guint size)
{
    GList *list;
    GList *nodes_to_unmark = NULL;
    GList *nodes_to_unmark_recursive = NULL;
    ProfileDescendant *parent = NULL;
    
    GHashTable *seen_objects =
	g_hash_table_new (direct_hash_no_null, g_direct_equal);

    for (list = trace; list != NULL; list = list->next)
    {
	Node *node = list->data;
	ProfileDescendant *match = NULL;

	update();
    
	for (match = *tree; match != NULL; match = match->siblings)
	{
	    if (match->object == node->object)
		break;
	}
	
	if (!match)
	{
	    ProfileDescendant *seen_tree_node;
	    
	    seen_tree_node = g_hash_table_lookup (seen_objects, node->object);
	    
	    if (seen_tree_node)
	    {
		ProfileDescendant *node;
		
		g_assert (parent);
		
		for (node = parent; node != seen_tree_node->parent; node = node->parent)
		{
		    node->non_recursion -= size;
		    --node->marked_non_recursive;
		}
		
		match = seen_tree_node;
		
		g_hash_table_destroy (seen_objects);
		seen_objects =
		    g_hash_table_new (direct_hash_no_null, g_direct_equal);
		
		for (node = match; node != NULL; node = node->parent)
		    g_hash_table_insert (seen_objects, node->object, node);
	    }
	}
	
	if (!match)
	{
	    match = g_new (ProfileDescendant, 1);
	    
	    match->object = node->object;
	    match->non_recursion = 0;
	    match->total = 0;
	    match->self = 0;
	    match->children = NULL;
	    match->marked_non_recursive = 0;
	    match->marked_total = FALSE;
	    match->parent = parent;
	    
	    match->siblings = *tree;
	    *tree = match;
	}
	
	if (!match->marked_non_recursive)
	{
	    nodes_to_unmark = g_list_prepend (nodes_to_unmark, match);
	    match->non_recursion += size;
	    ++match->marked_non_recursive;
	}
	
	if (!match->marked_total)
	{
	    nodes_to_unmark_recursive = g_list_prepend (
		nodes_to_unmark_recursive, match);
	    
	    match->total += size;
	    match->marked_total = TRUE;
	}
	
	if (!list->next)
	    match->self += size;
	
	g_hash_table_insert (seen_objects, node->object, match);
	
	tree = &(match->children);
	parent = match;
    }
    
    g_hash_table_destroy (seen_objects);
    
    for (list = nodes_to_unmark; list != NULL; list = list->next)
    {
	ProfileDescendant *tree_node = list->data;
	
	tree_node->marked_non_recursive = 0;
    }
    
    for (list = nodes_to_unmark_recursive; list != NULL; list = list->next)
    {
	ProfileDescendant *tree_node = list->data;
	
	tree_node->marked_total = FALSE;
    }
    
    g_list_free (nodes_to_unmark);
}

static void
node_list_leaves (Node *node, GList **leaves)
{
    Node *n;
    
    if (node->self > 0)
	*leaves = g_list_prepend (*leaves, node);

    for (n = node->children; n != NULL; n = n->siblings)
	node_list_leaves (n, leaves);
}

static void
add_leaf_to_tree (ProfileDescendant **tree, Node *leaf, Node *top)
{
    GList *trace = NULL;
    Node *node;

    for (node = leaf; node != top->parent; node = node->parent)
	trace = g_list_prepend (trace, node);

    add_trace_to_tree (tree, trace, leaf->self);
    
    g_list_free (trace);
}

ProfileDescendant *
profile_create_descendants (Profile *prf, ProfileObject *object)
{
    ProfileDescendant *tree = NULL;
    RealProfile *profile = (RealProfile *)prf;
    Node *node;

    node = g_hash_table_lookup (profile->nodes_by_object, object);

    while (node)
    {
	update();
	if (node->toplevel)
	{
	    GList *leaves = NULL;
	    GList *list;

	    node_list_leaves (node, &leaves);

	    for (list = leaves; list != NULL; list = list->next)
		add_leaf_to_tree (&tree, list->data, node);

	    g_list_free (leaves);
	}
	node = node->next;
    }

    return tree;
}

static ProfileCaller *
profile_caller_new (void)
{
    ProfileCaller *caller = g_new (ProfileCaller, 1);
    caller->next = NULL;
    caller->self = 0;
    caller->total = 0;
    return caller;
}

ProfileCaller *
profile_list_callers (Profile       *prf,
		      ProfileObject *callee)
{
    RealProfile *profile = (RealProfile *)prf;
    Node *callee_node;
    Node *node;
    GHashTable *callers_by_object;
    GHashTable *seen_callers;
    ProfileCaller *result = NULL;

    callers_by_object =
	g_hash_table_new (g_direct_hash, g_direct_equal);
    seen_callers = g_hash_table_new (g_direct_hash, g_direct_equal);

    callee_node = g_hash_table_lookup (profile->nodes_by_object, callee);

    for (node = callee_node; node; node = node->next)
    {
	ProfileObject *object;
	if (node->parent)
	    object = node->parent->object;
	else
	    object = NULL;

	if (!g_hash_table_lookup (callers_by_object, object))
	{
	    ProfileCaller *caller = profile_caller_new ();
	    caller->object = object;
	    g_hash_table_insert (callers_by_object, object, caller);

	    caller->next = result;
	    result = caller;
	}
    }

    for (node = callee_node; node != NULL; node = node->next)
    {
	Node *top_caller;
	Node *top_callee;
	Node *n;
	ProfileCaller *caller;
	ProfileObject *object;

	if (node->parent)
	    object = node->parent->object;
	else
	    object = NULL;

	caller = g_hash_table_lookup (callers_by_object, object);

	/* find topmost node/parent pair identical to this node/parent */
	top_caller = node->parent;
	top_callee = node;
	for (n = node; n && n->parent; n = n->parent)
	{
	    if (n->object == node->object		   &&
		n->parent->object == node->parent->object)
	    {
		top_caller = n->parent;
		top_callee = n;
	    }
	}
	
	if (!g_hash_table_lookup (seen_callers, top_caller))
	{
	    caller->total += top_callee->total;
	    
	    g_hash_table_insert (seen_callers, top_caller, (void *)0x1);
	}
	
	if (node->self > 0)
	    caller->self += node->self;
    }
    
    g_hash_table_destroy (seen_callers);
    g_hash_table_destroy (callers_by_object);
    
    return result;
    
}

static void
node_free (Node *node)
{
    if (!node)
	return;

    node_free (node->siblings);
    node_free (node->children);
    g_free (node);
}

void
profile_free (Profile *prf)
{
    RealProfile *profile = (RealProfile *)prf;

    g_list_free (prf->objects);
    g_hash_table_destroy (profile->profile_objects);
    node_free (profile->call_tree);
    g_hash_table_destroy (profile->nodes_by_object);
    g_free (prf);
}

void
profile_descendant_free    (ProfileDescendant *descendant)
{
    if (!descendant)
	return;

    profile_descendant_free (descendant->siblings);
    profile_descendant_free (descendant->children);

    g_free (descendant);
}

void
profile_caller_free (ProfileCaller *caller)
{
    if (!caller)
	return;

    profile_caller_free (caller->next);
    g_free (caller);
}