/* OpenIDA - Outil d'analyse de fichiers binaires * layout.c - mise en place de graphique * * Copyright (C) 2009 Cyrille Bagard * * This file is part of OpenIDA. * * OpenIDA is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 3 of the License, or * (at your option) any later version. * * OpenIDA is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with Foobar. If not, see . */ #include "layout.h" #include #include #include #include "dot.h" #include "node.h" #include "../common/extstr.h" /* Taille maximale des descriptions de liens */ #define LINKS_DESC_LEN 128 /* Etablit tous les liens entre les différents morceaux de code. */ static char *complete_graph_links(const GtkGraphView *, GtkBinView **, size_t, char *); /****************************************************************************** * * * Paramètres : view = support où placer les différents éléments. * * views = morceaux de code à afficher de façon organisée. * * count = quantité de ces morceaux de code. * * * * Description : Dispose une série de morceaux d'affichage en graphique. * * * * Retour : - * * * * Remarques : - * * * ******************************************************************************/ bool build_graph_view(GtkGraphView *view, GtkBinView **views, size_t count) { GGraphNode **nodes; /* Intermédiaires en place */ size_t i; /* Boucle de parcours */ char *cmds; /* Description à envoyer à dot */ graph_layout *layout; /* Graphique construit */ GtkLinkRenderer **links; /* Liens graphiques construits */ size_t links_count; /* Quantité de ces liens */ /* Création de la glue */ nodes = (GGraphNode **)calloc(count, sizeof(GGraphNode *)); for (i = 0; i < count; i++) nodes[i] = g_graph_node_new(views[i]); /* Définition du graphique */ cmds = strdup("digraph G {\noverlap=false;\n splines=true;\n"); //cmds = strdup("digraph G {\n"); for (i = 0; i < count; i++) cmds = g_graph_node_register_for_dot(nodes[i], cmds); cmds = complete_graph_links(view, views, count, cmds); cmds = stradd(cmds, "}"); printf("first step :: '%s'\n", cmds); layout = create_graph_layout(cmds); /* Affichage du graphique */ place_nodes_of_graph_layout(layout, GTK_FIXED(view), nodes, count); links = create_links_from_graph_layout(layout, &links_count); gtk_graph_view_attach_links(view, links, links_count); gtk_widget_queue_draw(GTK_WIDGET(view)); delete_graph_layout(layout); /* TODO : free nodes */ return true; } /****************************************************************************** * * * Paramètres : view = support contenant les différentes lignes. * * views = morceaux de code à afficher de façon organisée. * * count = quantité de ces morceaux de code. * * desc = description du graphique à compléter. * * * * Description : Etablit tous les liens entre les différents morceaux de code.* * * * Retour : - * * * * Remarques : - * * * ******************************************************************************/ static char *complete_graph_links(const GtkGraphView *view, GtkBinView **views, size_t count, char *desc) { size_t i; /* Boucle de parcours #1 */ GRenderingLine *last; /* Dernière ligne d'un bloc */ GRenderingLine **dests; /* Ligne visée par une autre */ InstructionLinkType *types; /* Type de lien entre lignes */ size_t dcount; /* Nombre de liens de dest. */ size_t j; /* Boucle de parcours #2 */ vmpa_t addr; /* Addresse de destination */ size_t k; /* Boucle de parcours #3 */ char buffer[LINKS_DESC_LEN]; /* Tampon pour l'ajout de liens*/ GRenderingLine *next; /* Ligne suivante dans le flux */ for (i = 0; i < count; i++) { last = gtk_bin_view_get_last_line(views[i]); if (g_rendering_line_has_destinations(last)) { dcount = g_rendering_line_get_destinations(last, &dests, &types); for (j = 0; j < dcount; j++) { addr = get_rendering_line_address(dests[j]); for (k = 0; k < count; k++) if (gtk_bin_view_contain_address(views[k], addr)) break; if (k < count) switch (types[j]) { case ILT_JUMP: snprintf(buffer, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]); desc = stradd(desc, buffer); break; case ILT_JUMP_IF_TRUE: snprintf(buffer, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]); desc = stradd(desc, buffer); break; case ILT_JUMP_IF_FALSE: snprintf(buffer, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]); desc = stradd(desc, buffer); break; default: break; } } } /* Si la ligne n'est pas la dernière, on suit le flux normal */ else if (last != gtk_bin_view_get_last_line(view)) { next = g_rendering_line_get_next_iter(gtk_bin_view_get_lines(GTK_BIN_VIEW(view)), last, gtk_bin_view_get_last_line(GTK_BIN_VIEW(view))); if (next == NULL) continue; addr = get_rendering_line_address(next); for (k = 0; k < count; k++) if (gtk_bin_view_contain_address(views[k], addr)) break; if (k < count) { snprintf(buffer, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]); desc = stradd(desc, buffer); } } } return desc; }