96 lines
2.6 KiB
C++
96 lines
2.6 KiB
C++
/* Measuring the complexity of svalues/regions.
|
|
Copyright (C) 2020-2021 Free Software Foundation, Inc.
|
|
Contributed by David Malcolm <dmalcolm@redhat.com>.
|
|
|
|
This file is part of GCC.
|
|
|
|
GCC 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, or (at your option)
|
|
any later version.
|
|
|
|
GCC 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 GCC; see the file COPYING3. If not see
|
|
<http://www.gnu.org/licenses/>. */
|
|
|
|
#include "config.h"
|
|
#include "system.h"
|
|
#include "coretypes.h"
|
|
#include "tree.h"
|
|
#include "diagnostic-core.h"
|
|
#include "gimple-pretty-print.h"
|
|
#include "function.h"
|
|
#include "basic-block.h"
|
|
#include "gimple.h"
|
|
#include "gimple-iterator.h"
|
|
#include "diagnostic-core.h"
|
|
#include "graphviz.h"
|
|
#include "options.h"
|
|
#include "cgraph.h"
|
|
#include "tree-dfa.h"
|
|
#include "stringpool.h"
|
|
#include "convert.h"
|
|
#include "target.h"
|
|
#include "fold-const.h"
|
|
#include "tree-pretty-print.h"
|
|
#include "tristate.h"
|
|
#include "bitmap.h"
|
|
#include "selftest.h"
|
|
#include "function.h"
|
|
#include "json.h"
|
|
#include "analyzer/analyzer.h"
|
|
#include "analyzer/analyzer-logging.h"
|
|
#include "options.h"
|
|
#include "cgraph.h"
|
|
#include "cfg.h"
|
|
#include "digraph.h"
|
|
#include "analyzer/call-string.h"
|
|
#include "analyzer/program-point.h"
|
|
#include "analyzer/store.h"
|
|
#include "analyzer/complexity.h"
|
|
#include "analyzer/svalue.h"
|
|
#include "analyzer/region.h"
|
|
|
|
#if ENABLE_ANALYZER
|
|
|
|
namespace ana {
|
|
|
|
/* struct complexity. */
|
|
|
|
/* Get complexity for a new node that references REG
|
|
(the complexity of REG, plus one for the new node). */
|
|
|
|
complexity::complexity (const region *reg)
|
|
: m_num_nodes (reg->get_complexity ().m_num_nodes + 1),
|
|
m_max_depth (reg->get_complexity ().m_max_depth + 1)
|
|
{
|
|
}
|
|
|
|
/* Get complexity for a new node that references SVAL.
|
|
(the complexity of SVAL, plus one for the new node). */
|
|
|
|
complexity::complexity (const svalue *sval)
|
|
: m_num_nodes (sval->get_complexity ().m_num_nodes + 1),
|
|
m_max_depth (sval->get_complexity ().m_max_depth + 1)
|
|
{
|
|
}
|
|
|
|
/* Get complexity for a new node that references nodes with complexity
|
|
C1 and C2. */
|
|
|
|
complexity
|
|
complexity::from_pair (const complexity &c1, const complexity &c2)
|
|
{
|
|
return complexity (c1.m_num_nodes + c2.m_num_nodes + 1,
|
|
MAX (c1.m_max_depth, c2.m_max_depth) + 1);
|
|
}
|
|
|
|
} // namespace ana
|
|
|
|
#endif /* #if ENABLE_ANALYZER */
|