/* OpenIDA - Outil d'analyse de fichiers binaires
* layout.c - mise en place de graphique
*
* Copyright (C) 2009-2012 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 "../analysis/binary.h"
#include "../common/extstr.h"
#include "../gtkext/gtkbufferview.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 *, GtkViewPanel **, 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, GtkViewPanel **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(GTK_WIDGET(views[i]));
/* Définition du graphique */
cmds = strdup("digraph G {\noverlap=false;\n splines=true;\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, "}");
layout = create_graph_layout(cmds);
/* Affichage du graphique */
place_nodes_of_graph_layout(layout, 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. [OUT] *
* *
* Description : Etablit tous les liens entre les différents morceaux de code.*
* *
* Retour : - *
* *
* Remarques : - *
* *
******************************************************************************/
static char *complete_graph_links(const GtkGraphView *view, GtkViewPanel **views, size_t count, char *desc)
{
GOpenidaBinary *binary; /* Binaire rattaché aux vues */
GArchInstruction *instrs; /* Instructions pour assembleur*/
GBufferView *buffer; /* Tampon d'une partie de code */
vmpa_t end; /* Adresse finale du tampon */
size_t i; /* Boucle de parcours #1 */
GArchInstruction *last; /* Dernière instruc. d'un bloc */
vmpa_t addr; /* Addresse d'instruction */
GArchInstruction **dests; /* Instr. 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 */
size_t k; /* Boucle de parcours #3 */
char cmd[LINKS_DESC_LEN]; /* Tampon pour l'ajout de liens*/
GArchInstruction *next; /* Instruction suivante */
if (count == 0)
return desc;
binary = gtk_view_panel_get_binary(views[0]);
instrs = g_openida_binary_get_instructions(binary);
for (i = 0; i < count; i++)
{
buffer = gtk_buffer_view_get_buffer(GTK_BUFFER_VIEW(views[i]));
g_buffer_view_get_restrictions(buffer, NULL, &end);
last = g_arch_instruction_find_by_address(instrs, end, true);
g_arch_instruction_get_location(last, NULL, NULL, &addr);
if (g_arch_instruction_has_destinations(last))
{
dcount = g_arch_instruction_get_destinations(last, &dests, &types);
for (j = 0; j < dcount; j++)
{
g_arch_instruction_get_location(dests[j], NULL, NULL, &addr);
for (k = 0; k < count; k++)
if (gtk_view_panel_contain_address(views[k], addr))
break;
if (k < count)
switch (types[j])
{
case ILT_JUMP:
snprintf(cmd, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]);
desc = stradd(desc, cmd);
break;
case ILT_JUMP_IF_TRUE:
snprintf(cmd, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]);
desc = stradd(desc, cmd);
break;
case ILT_JUMP_IF_FALSE:
snprintf(cmd, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]);
desc = stradd(desc, cmd);
break;
default:
break;
}
}
}
/* Si la ligne n'est pas la dernière, on suit le flux normal */
else if (addr != end)
{
next = g_arch_instruction_get_next_iter(instrs, last, end);
if (next == NULL) continue;
g_arch_instruction_get_location(next, NULL, NULL, &addr);
for (k = 0; k < count; k++)
if (gtk_view_panel_contain_address(views[k], addr))
break;
if (k < count)
{
snprintf(cmd, LINKS_DESC_LEN, "_%p -> _%p;\n", views[i], views[k]);
desc = stradd(desc, cmd);
}
}
}
return desc;
}