2013-07-16 19:58:43 +00:00
|
|
|
// -*- mode: C++ -*-
|
|
|
|
//
|
2019-01-07 13:54:47 +00:00
|
|
|
// Copyright (C) 2013-2019 Red Hat, Inc.
|
2013-07-02 01:08:18 +00:00
|
|
|
//
|
|
|
|
// This file is part of the GNU Application Binary Interface Generic
|
|
|
|
// Analysis and Instrumentation Library (libabigail). This library is
|
|
|
|
// free software; you can redistribute it and/or modify it under the
|
2013-07-16 19:58:43 +00:00
|
|
|
// terms of the GNU Lesser General Public License as published by the
|
|
|
|
// Free Software Foundation; either version 3, or (at your option) any
|
2013-07-02 01:08:18 +00:00
|
|
|
// later version.
|
|
|
|
|
|
|
|
// This library 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
|
2013-07-16 19:58:43 +00:00
|
|
|
// General Lesser Public License for more details.
|
2013-07-02 01:08:18 +00:00
|
|
|
|
2013-07-16 19:58:43 +00:00
|
|
|
// You should have received a copy of the GNU Lesser General Public
|
|
|
|
// License along with this program; see the file COPYING-LGPLV3. If
|
|
|
|
// not, see <http://www.gnu.org/licenses/>.
|
2013-07-02 01:08:18 +00:00
|
|
|
|
|
|
|
/// @file
|
|
|
|
|
2013-07-03 00:22:35 +00:00
|
|
|
#ifndef __ABG_VIZ_DOT_H__
|
|
|
|
#define __ABG_VIZ_DOT_H__
|
2013-07-02 01:08:18 +00:00
|
|
|
|
2013-07-03 00:22:35 +00:00
|
|
|
#include <abg-viz-common.h>
|
2013-07-02 01:08:18 +00:00
|
|
|
|
|
|
|
namespace abigail
|
|
|
|
{
|
|
|
|
|
|
|
|
/// Base class for graph nodes.
|
|
|
|
struct node_base
|
2013-07-03 05:32:21 +00:00
|
|
|
{
|
2013-08-02 03:16:22 +00:00
|
|
|
/// Possible derived types.
|
2013-07-03 05:32:21 +00:00
|
|
|
enum type { child, parent };
|
|
|
|
|
|
|
|
std::string _M_id;
|
|
|
|
static units_type _M_count_total; // Start at zero.
|
|
|
|
units_type _M_count;
|
|
|
|
type _M_type;
|
|
|
|
float _M_x_space; // Column spacing.
|
|
|
|
float _M_y_space; // Row spacing.
|
|
|
|
const style& _M_style;
|
|
|
|
|
|
|
|
explicit
|
2017-04-12 07:53:10 +00:00
|
|
|
node_base(const std::string& __id, type __t, const style& __sty)
|
2013-07-03 05:32:21 +00:00
|
|
|
: _M_id(__id), _M_count(++_M_count_total),
|
|
|
|
_M_type(__t), _M_x_space(0.4), _M_y_space(0.2), _M_style(__sty)
|
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
|
|
|
/// Useful constants.
|
|
|
|
extern const style parent_sty;
|
|
|
|
extern const style child_sty;
|
|
|
|
|
2013-07-02 01:08:18 +00:00
|
|
|
|
2013-08-02 03:16:22 +00:00
|
|
|
/**
|
2013-07-02 01:08:18 +00:00
|
|
|
Parent node.
|
|
|
|
|
|
|
|
Some characteristics:
|
2013-07-03 05:32:21 +00:00
|
|
|
- name (text anchor = start ie left).
|
|
|
|
- background box x and y size
|
|
|
|
- style info
|
2013-07-02 01:08:18 +00:00
|
|
|
- (optional) template parameters
|
|
|
|
|
|
|
|
*/
|
2013-07-03 05:32:21 +00:00
|
|
|
struct parent_node : public node_base
|
2013-07-02 01:08:18 +00:00
|
|
|
{
|
2017-04-12 07:53:10 +00:00
|
|
|
parent_node(const std::string& __id)
|
2013-07-03 05:32:21 +00:00
|
|
|
: node_base(__id, node_base::parent, parent_sty)
|
|
|
|
{ }
|
2013-07-02 01:08:18 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2013-08-02 03:16:22 +00:00
|
|
|
/**
|
2013-07-02 01:08:18 +00:00
|
|
|
Child node.
|
|
|
|
|
|
|
|
Some characteristics:
|
|
|
|
- horizontal name (text anchor = start ie left).
|
|
|
|
- background box
|
|
|
|
- (optional) template parameters
|
|
|
|
|
|
|
|
*/
|
2013-07-03 05:32:21 +00:00
|
|
|
struct child_node : public node_base
|
2013-07-02 01:08:18 +00:00
|
|
|
{
|
2017-04-12 07:53:10 +00:00
|
|
|
child_node(const std::string& __id)
|
2013-07-03 05:32:21 +00:00
|
|
|
: node_base(__id, node_base::child, child_sty)
|
|
|
|
{ }
|
2013-07-02 01:08:18 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2013-08-02 03:16:22 +00:00
|
|
|
/**
|
2013-07-02 01:08:18 +00:00
|
|
|
DOT "graph" style notation for class inheritance.
|
|
|
|
|
2013-07-03 05:32:21 +00:00
|
|
|
This is a compact DOT representation of a single class inheritance.
|
2013-07-02 01:08:18 +00:00
|
|
|
|
2013-07-03 05:32:21 +00:00
|
|
|
It is composed of the following data points for each parent
|
2013-07-02 01:08:18 +00:00
|
|
|
|
|
|
|
- parent classes
|
|
|
|
- child classes
|
|
|
|
- name
|
|
|
|
|
|
|
|
Including typographic information to compute line length, and C++
|
|
|
|
niceities like grouping and overload sets.
|
|
|
|
|
|
|
|
It's constructed by creating a digraph, starting from the base node.
|
|
|
|
*/
|
|
|
|
struct dot
|
|
|
|
{
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
const std::string _M_title;
|
|
|
|
|
|
|
|
std::ostringstream _M_sstream;
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
2019-04-15 17:05:18 +00:00
|
|
|
dot(const std::string &__title)
|
|
|
|
: _M_title(__title)
|
2013-07-03 05:32:21 +00:00
|
|
|
{ }
|
2013-07-02 01:08:18 +00:00
|
|
|
|
|
|
|
// Empty when the output buffer is.
|
|
|
|
bool
|
|
|
|
empty() { return _M_sstream.str().empty(); }
|
|
|
|
|
|
|
|
void
|
|
|
|
start_element();
|
|
|
|
|
|
|
|
void
|
|
|
|
finish_element();
|
|
|
|
|
|
|
|
void
|
|
|
|
add_title();
|
|
|
|
|
|
|
|
void
|
2013-07-03 05:32:21 +00:00
|
|
|
add_node(const node_base&);
|
|
|
|
|
|
|
|
void
|
|
|
|
add_edge(const node_base&, const node_base&);
|
|
|
|
|
|
|
|
void
|
|
|
|
add_parent(const parent_node&);
|
2013-07-02 01:08:18 +00:00
|
|
|
|
|
|
|
void
|
2013-07-03 05:32:21 +00:00
|
|
|
add_child_to_node(const child_node&, const node_base&);
|
2013-07-02 01:08:18 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
write();
|
|
|
|
|
|
|
|
void
|
|
|
|
start()
|
|
|
|
{
|
|
|
|
this->start_element();
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
finish()
|
|
|
|
{
|
|
|
|
this->finish_element();
|
|
|
|
this->write();
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
// XXX connect external xml file to input.
|
|
|
|
// parse input, pick apart elements, attributes.
|
|
|
|
|
|
|
|
}// end namespace abigail
|
|
|
|
|
|
|
|
#endif //__ABG_VIZ_DOT_H__
|