abg-comp-filter.h

Go to the documentation of this file.

// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
// -*- Mode: C++ -*-
//
// Copyright (C) 2013-2023 Red Hat, Inc.
//
// Author: Dodji Seketeli
 
/// @file
///
/// This header declares filters for the diff trees resulting from
/// comparing ABI Corpora.
 
#ifndef __ABG_COMP_FILTER_H__
#define __ABG_COMP_FILTER_H__
 
#include "abg-comparison.h"
 
namespace abigail
{
namespace comparison
{
/// Facilities to walk, categorize and possibly filter nodes of the
/// diff tree.
namespace filtering
{
 
bool
has_harmless_name_change(const decl_base_sptr& f, const decl_base_sptr& s);
 
bool union_diff_has_harmless_changes(const diff *d);
 
bool
has_harmful_name_change(const decl_base_sptr& f, const decl_base_sptr& s);
 
bool
has_harmful_name_change(const diff* dif);
 
bool
has_virtual_mem_fn_change(const function_decl_diff* diff);
 
bool
is_decl_only_class_with_size_change(const class_or_union& first,
                    const class_or_union& second);
 
bool
is_decl_only_class_with_size_change(const class_or_union_sptr& first,
                    const class_or_union_sptr& second);
 
bool
is_decl_only_class_with_size_change(const diff *diff);
 
bool
has_decl_only_def_change(const decl_base_sptr& first,
             const decl_base_sptr& second);
 
bool
has_decl_only_def_change(const diff *d);
 
bool
has_class_decl_only_def_change(const class_or_union_sptr& first,
                   const class_or_union_sptr& second);
 
bool
has_enum_decl_only_def_change(const enum_type_decl_sptr& first,
                  const enum_type_decl_sptr& second);
 
bool
has_class_decl_only_def_change(const diff *diff);
 
bool
has_enum_decl_only_def_change(const diff *diff);
 
bool
has_basic_type_name_change(const diff *);
 
bool
has_class_or_union_type_name_change(const diff *d);
 
bool
has_basic_or_class_type_name_change(const diff *d);
 
bool
is_mostly_distinct_diff(const diff *d);
 
bool
has_anonymous_data_member_change(const diff *d);
 
bool
has_anonymous_data_member_change(const diff_sptr &d);
 
bool
has_data_member_replaced_by_anon_dm(const diff* diff);
 
bool
is_var_1_dim_unknown_size_array_change(const diff*);
 
bool
is_var_1_dim_unknown_size_array_change(const var_decl_sptr& var1,
                       const var_decl_sptr& var2);
 
bool
has_strict_fam_conversion(const class_decl_sptr& first,
              const class_decl_sptr& second);
 
bool
has_strict_fam_conversion(const diff *d);
 
struct filter_base;
/// Convenience typedef for a shared pointer to filter_base
typedef shared_ptr<filter_base> filter_base_sptr;
/// Convenience typedef for a vector of filter_base_sptr
typedef std::vector<filter_base_sptr> filters;
 
/// The base class for the diff tree node filter.
///
/// It's intended to walk a tree of diff nodes and tag each relevant
/// name into one or several categories depending on well choosen
/// properties of the diff nodes.
struct filter_base : public diff_node_visitor
{
  friend void
  apply_filter(filter_base_sptr f, diff_sptr deef);
}; //end class filter_base
 
void
apply_filter(filter_base& filter, diff_sptr d);
 
void
apply_filter(filter_base& filter, corpus_diff_sptr d);
 
void
apply_filter(filter_base_sptr filter, diff_sptr d);
 
class harmless_filter;
/// Convenience typedef for a shared pointer to a harmless_filter.
typedef shared_ptr<harmless_filter> harmless_filter_sptr;
 
/// A filter that walks the diff nodes tree and tags relevant diff
/// nodes into categories considered to represent harmless changes.
class harmless_filter : public filter_base
{
  virtual bool
  visit(diff*, bool);
 
  virtual void
  visit_end(diff*);
}; // end class harmless_filter
 
class harmless_harmful_filter;
/// A convenience typedef for a shared pointer to harmful_filter.
typedef shared_ptr<harmless_harmful_filter> harmful_harmless_filter_sptr;
 
/// A filter that walks the diff nodes tree and tags relevant diff
/// nodes into categories considered to represent potentially harmless
/// or harmful changes.
class harmless_harmful_filter : public filter_base
{
  virtual bool
  visit(diff*, bool);
 
  virtual void
  visit_end(diff*);
}; // end class harmless_harmful_filter
 
} // end namespace filtering
} // end namespace comparison
} // end namespace abigail
 
#endif // __ABG_COMP_FILTER_H__