
gcc/c/ChangeLog: PR c++/61339 * c-decl.c: Change class-key from class to struct and vice versa to match convention and avoid -Wclass-is-pod and -Wstruct-no-pod. * gimple-parser.c: Same. gcc/c-family/ChangeLog: PR c++/61339 * c-format.c (check_argument_type): Change class-key from class to struct and vice versa to match convention and avoid -Wclass-is-pod and -Wstruct-no-pod. * c-pretty-print.h: Same. gcc/cp/ChangeLog: PR c++/61339 * constexpr.c (cxx_eval_call_expression): Change class-key from class to struct and vice versa to match convention and avoid -Wclass-is-pod and -Wstruct-no-pod. * constraint.cc (get_concept_definition): Same. * cp-tree.h: Same. * cxx-pretty-print.h: Same. * error.c: Same. * logic.cc (term_list::replace): Same. * name-lookup.c (find_local_binding): Same. * pt.c (tsubst_binary_right_fold): Same. * search.c (field_accessor_p): Same. * semantics.c (expand_or_defer_fn): Same. gcc/lto/ChangeLog: PR c++/61339 * lto-dump.c: Change class-key from classi to struct and vice versa to match convention and avoid -Wclass-is-pod and -Wstruct-no-pod. gcc/ChangeLog: PR c++/61339 * align.h: Change class-key from class to struct and vice versa to match convention and avoid -Wclass-is-pod and -Wstruct-no-pod. * alloc-pool.h: Same. * asan.c (shadow_mem_size): Same. * auto-profile.c: Same. * basic-block.h: Same. * bitmap.h: Same. * cfgexpand.c (set_rtl): Same. (expand_one_stack_var_at): Same. * cfghooks.h: Same. * cfgloop.h: Same. * cgraph.h: Same. * config/i386/i386.h: Same. * df-problems.c (df_print_bb_index): Same. * df-scan.c: Same. * df.h (df_single_use): Same. * diagnostic-show-locus.c (layout::print_annotation_line): Same. (layout::annotation_line_showed_range_p): Same. (get_printed_columns): Same. (correction::ensure_terminated): Same. (line_corrections::~line_corrections): Same. * dojump.h: Same. * dse.c: Same. * dump-context.h: Same. * dumpfile.h: Same. * dwarf2out.c: Same. * edit-context.c: Same. * fibonacci_heap.c (test_union_of_equal_heaps): Same. * flags.h: Same. * function.c (assign_stack_local): Same. * function.h: Same. * gcc.c: Same. * gcov.c (block_info::block_info): Same. * genattrtab.c: Same. * genextract.c: Same. * genmatch.c (comparison_code_p): Same. (id_base::id_base): Same. (decision_tree::print): Same. * genoutput.c: Same. * genpreds.c (write_one_predicate_function): Same. * genrecog.c (validate_pattern): Same. (find_operand_positions): Same. (optimize_subroutine_group): Same. (merge_pattern_transition::merge_pattern_transition): Same. (merge_pattern_info::merge_pattern_info): Same. (merge_state_result::merge_state_result): Same. (merge_into_state): Same. * gensupport.c: Same. * gensupport.h: Same. * ggc-common.c (init_ggc_heuristics): Same. * ggc-tests.c (test_union): Same. * gimple-loop-interchange.cc (dump_induction): Same. * gimple-loop-versioning.cc: Same. * gimple-match.h (gimple_match_cond::any_else): Same. * gimple-ssa-backprop.c: Same. * gimple-ssa-sprintf.c: Same. * gimple-ssa-store-merging.c (store_operand_info::store_operand_info): Same. (store_immediate_info::store_immediate_info): Same. (merged_store_group::apply_stores): Same. (get_location_for_stmts): Same. * gimple-ssa-strength-reduction.c: Same. * gimple-ssa-warn-alloca.c: Same. * gimple-ssa-warn-restrict.c (pass_wrestrict::execute): Same. * godump.c (go_type_decl): Same. * hash-map-tests.c (test_map_of_strings_to_int): Same. * hash-map.h: Same. * hash-set-tests.c (test_set_of_strings): Same. * hsa-brig.c: Same. * hsa-common.h: Same. * hsa-gen.c (transformable_switch_to_sbr_p): Same. * input.c (assert_loceq): Same. * input.h: Same. * ipa-cp.c: Same. * ipa-devirt.c (possible_polymorphic_call_targets_1): Same. * ipa-fnsummary.h: Same. * ipa-inline.h: Same. * ipa-prop.h: Same. * ipa-split.c (visit_bb): Same. * ira-int.h (minmax_set_iter_next): Same. * loop-invariant.c: Same. * loop-iv.c: Same. * lra-eliminations.c: Same. * lra-int.h: Same. * lra-lives.c (mark_regno_dead): Same. * lra-remat.c: Same. * lra-spills.c: Same. * lto-streamer.h: Same. * mem-stats.h: Same. * omp-grid.c (omp_grid_lastprivate_predicate): Same. * omp-low.c (omp_clause_aligned_alignment): Same. * optabs-query.h (get_vcond_eq_icode): Same. * optabs.h: Same. * opts.c (wrap_help): Same. * poly-int.h: Same. * predict.c (predict_paths_leading_to_edge): Same. * pretty-print.h: Same. * profile-count.h: Same. * read-md.h: Same. * read-rtl-function.c: Same. * ree.c: Same. * reginfo.c: Same. * regrename.c: Same. * regrename.h: Same. * reload.h: Same. * rtl-iter.h: Same. * rtl.h (costs_add_n_insns): Same. * sanopt.c: Same. * sched-int.h: Same. * sel-sched-ir.h: Same. * selftest.h: Same. * sese.h (vec_find): Same. * stmt.c: Same. * target-globals.h: Same. * tree-affine.c (aff_combination_find_elt): Same. * tree-affine.h: Same. * tree-data-ref.h: Same. * tree-outof-ssa.c (ssa_is_replaceable_p): Same. * tree-predcom.c: Same. * tree-scalar-evolution.c (find_var_scev_info): Same. * tree-ssa-alias.h: Same. * tree-ssa-ccp.c: Same. * tree-ssa-coalesce.c (ssa_conflicts_dump): Same. * tree-ssa-loop-im.c (for_all_locs_in_loop): Same. (rewrite_mem_refs): Same. (execute_sm_if_changed): Same. (hoist_memory_references): Same. * tree-ssa-loop-ivopts.c (operator<=): Same. * tree-ssa-loop.h: Same. * tree-ssa-pre.c (get_or_alloc_expr_for_name): Same. * tree-ssa-structalias.c: Same. * tree-switch-conversion.h (cluster::cluster): Same. (simple_cluster::simple_cluster): Same. * tree-vect-patterns.c (type_conversion_p): Same. * tree-vectorizer.c (dump_stmt_cost): Same. * tree-vectorizer.h (loop_vec_info_for_loop): Same. * tree.c (protected_set_expr_location): Same. * tree.h (desired_pro_or_demotion_p): Same. (fndecl_built_in_p): Same. * unique-ptr-tests.cc: Same. * var-tracking.c (delete_variable_part): Same. * varasm.c (assemble_real): Same. (tree_output_constant_def): Same. * vec.c: Same. * wide-int-bitmask.h: Same. * wide-int.h (decompose): Same. From-SVN: r273308
236 lines
4.9 KiB
C++
236 lines
4.9 KiB
C++
/* Unit tests for unique-ptr.h.
|
|
Copyright (C) 2017-2019 Free Software Foundation, Inc.
|
|
|
|
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"
|
|
#define INCLUDE_UNIQUE_PTR
|
|
#include "system.h"
|
|
#include "coretypes.h"
|
|
#include "selftest.h"
|
|
|
|
#if CHECKING_P
|
|
|
|
namespace selftest {
|
|
|
|
namespace {
|
|
|
|
/* A class for counting ctor and dtor invocations. */
|
|
|
|
class stats
|
|
{
|
|
public:
|
|
stats () : ctor_count (0), dtor_count (0) {}
|
|
|
|
int ctor_count;
|
|
int dtor_count;
|
|
};
|
|
|
|
/* A class that uses "stats" to track its ctor and dtor invocations. */
|
|
|
|
class foo
|
|
{
|
|
public:
|
|
foo (stats &s) : m_s (s) { ++m_s.ctor_count; }
|
|
~foo () { ++m_s.dtor_count; }
|
|
|
|
int example_method () const { return 42; }
|
|
|
|
private:
|
|
foo (const foo&);
|
|
foo & operator= (const foo &);
|
|
|
|
private:
|
|
stats &m_s;
|
|
};
|
|
|
|
/* A struct for testing unique_ptr<T[]>. */
|
|
|
|
class has_default_ctor
|
|
{
|
|
public:
|
|
has_default_ctor () : m_field (42) {}
|
|
int m_field;
|
|
};
|
|
|
|
/* A dummy struct for testing unique_xmalloc_ptr. */
|
|
|
|
struct dummy
|
|
{
|
|
int field;
|
|
};
|
|
|
|
} // anonymous namespace
|
|
|
|
/* Verify that the default ctor inits ptrs to NULL. */
|
|
|
|
static void
|
|
test_null_ptr ()
|
|
{
|
|
gnu::unique_ptr<void *> p;
|
|
ASSERT_EQ (NULL, p);
|
|
|
|
gnu::unique_xmalloc_ptr<void *> q;
|
|
ASSERT_EQ (NULL, q);
|
|
}
|
|
|
|
/* Verify that deletion happens when a unique_ptr goes out of scope. */
|
|
|
|
static void
|
|
test_implicit_deletion ()
|
|
{
|
|
stats s;
|
|
ASSERT_EQ (0, s.ctor_count);
|
|
ASSERT_EQ (0, s.dtor_count);
|
|
|
|
{
|
|
gnu::unique_ptr<foo> f (new foo (s));
|
|
ASSERT_NE (NULL, f);
|
|
ASSERT_EQ (1, s.ctor_count);
|
|
ASSERT_EQ (0, s.dtor_count);
|
|
}
|
|
|
|
/* Verify that the foo was implicitly deleted. */
|
|
ASSERT_EQ (1, s.ctor_count);
|
|
ASSERT_EQ (1, s.dtor_count);
|
|
}
|
|
|
|
/* Verify that we can assign to a NULL unique_ptr. */
|
|
|
|
static void
|
|
test_overwrite_of_null ()
|
|
{
|
|
stats s;
|
|
ASSERT_EQ (0, s.ctor_count);
|
|
ASSERT_EQ (0, s.dtor_count);
|
|
|
|
{
|
|
gnu::unique_ptr<foo> f;
|
|
ASSERT_EQ (NULL, f);
|
|
ASSERT_EQ (0, s.ctor_count);
|
|
ASSERT_EQ (0, s.dtor_count);
|
|
|
|
/* Overwrite with a non-NULL value. */
|
|
f = gnu::unique_ptr<foo> (new foo (s));
|
|
ASSERT_EQ (1, s.ctor_count);
|
|
ASSERT_EQ (0, s.dtor_count);
|
|
}
|
|
|
|
/* Verify that the foo is implicitly deleted. */
|
|
ASSERT_EQ (1, s.ctor_count);
|
|
ASSERT_EQ (1, s.dtor_count);
|
|
}
|
|
|
|
/* Verify that we can assign to a non-NULL unique_ptr. */
|
|
|
|
static void
|
|
test_overwrite_of_non_null ()
|
|
{
|
|
stats s;
|
|
ASSERT_EQ (0, s.ctor_count);
|
|
ASSERT_EQ (0, s.dtor_count);
|
|
|
|
{
|
|
gnu::unique_ptr<foo> f (new foo (s));
|
|
ASSERT_NE (NULL, f);
|
|
ASSERT_EQ (1, s.ctor_count);
|
|
ASSERT_EQ (0, s.dtor_count);
|
|
|
|
/* Overwrite with a different value. */
|
|
f = gnu::unique_ptr<foo> (new foo (s));
|
|
ASSERT_EQ (2, s.ctor_count);
|
|
ASSERT_EQ (1, s.dtor_count);
|
|
}
|
|
|
|
/* Verify that the 2nd foo was implicitly deleted. */
|
|
ASSERT_EQ (2, s.ctor_count);
|
|
ASSERT_EQ (2, s.dtor_count);
|
|
}
|
|
|
|
/* Verify that unique_ptr's overloaded ops work. */
|
|
|
|
static void
|
|
test_overloaded_ops ()
|
|
{
|
|
stats s;
|
|
gnu::unique_ptr<foo> f (new foo (s));
|
|
ASSERT_EQ (42, f->example_method ());
|
|
ASSERT_EQ (42, (*f).example_method ());
|
|
ASSERT_EQ (f, f);
|
|
ASSERT_NE (NULL, f.get ());
|
|
|
|
gnu::unique_ptr<foo> g (new foo (s));
|
|
ASSERT_NE (f, g);
|
|
}
|
|
|
|
/* Verify that the gnu::unique_ptr specialization for T[] works. */
|
|
|
|
static void
|
|
test_array_new ()
|
|
{
|
|
const int num = 10;
|
|
gnu::unique_ptr<has_default_ctor[]> p (new has_default_ctor[num]);
|
|
ASSERT_NE (NULL, p.get ());
|
|
/* Verify that operator[] works, and that the default ctor was called
|
|
on each element. */
|
|
for (int i = 0; i < num; i++)
|
|
ASSERT_EQ (42, p[i].m_field);
|
|
}
|
|
|
|
/* Verify that gnu::unique_xmalloc_ptr works. */
|
|
|
|
static void
|
|
test_xmalloc ()
|
|
{
|
|
gnu::unique_xmalloc_ptr<dummy> p (XNEW (dummy));
|
|
ASSERT_NE (NULL, p.get ());
|
|
}
|
|
|
|
/* Verify the gnu::unique_xmalloc_ptr specialization for T[]. */
|
|
|
|
static void
|
|
test_xmalloc_array ()
|
|
{
|
|
const int num = 10;
|
|
gnu::unique_xmalloc_ptr<dummy[]> p (XNEWVEC (dummy, num));
|
|
ASSERT_NE (NULL, p.get ());
|
|
|
|
/* Verify that operator[] works. */
|
|
for (int i = 0; i < num; i++)
|
|
p[i].field = 42;
|
|
for (int i = 0; i < num; i++)
|
|
ASSERT_EQ (42, p[i].field);
|
|
}
|
|
|
|
/* Run all of the selftests within this file. */
|
|
|
|
void
|
|
unique_ptr_tests_cc_tests ()
|
|
{
|
|
test_null_ptr ();
|
|
test_implicit_deletion ();
|
|
test_overwrite_of_null ();
|
|
test_overwrite_of_non_null ();
|
|
test_overloaded_ops ();
|
|
test_array_new ();
|
|
test_xmalloc ();
|
|
test_xmalloc_array ();
|
|
}
|
|
|
|
} // namespace selftest
|
|
|
|
#endif /* #if CHECKING_P */
|