test_sch_rule_area_destruction.cpp

Go to the documentation of this file.

/*
 * This program source code file is part of KiCad, a free EDA CAD application.
 *
 * Copyright The KiCad Developers, see AUTHORS.TXT for contributors.
 *
 * This program 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.
 *
 * This program 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 this program.  If not, see <https://www.gnu.org/licenses/>.
 */

 
#include <qa_utils/wx_utils/unit_test_utils.h>
 
#include <sch_line.h>
#include <sch_rule_area.h>
 
 
BOOST_AUTO_TEST_SUITE( SchRuleAreaDestruction )
 
 

BOOST_AUTO_TEST_CASE( RuleAreaDestroyedBeforeContainedItems )
{
    auto ruleArea = std::make_unique<SCH_RULE_AREA>();
    auto line1 = std::make_unique<SCH_LINE>( VECTOR2I( 0, 0 ), LAYER_WIRE );
    auto line2 = std::make_unique<SCH_LINE>( VECTOR2I( 100, 0 ), LAYER_WIRE );
 
    // Simulate what RefreshContainedItemsAndDirectives does
    ruleArea->m_items.insert( line1.get() );
    line1->AddRuleAreaToCache( ruleArea.get() );
 
    ruleArea->m_items.insert( line2.get() );
    line2->AddRuleAreaToCache( ruleArea.get() );
 
    BOOST_CHECK_EQUAL( line1->GetRuleAreaCache().size(), 1u );
    BOOST_CHECK_EQUAL( line2->GetRuleAreaCache().size(), 1u );
 
    // Destroy rule area first (the problematic ordering from FreeDrawList)
    ruleArea.reset();
 
    // Contained items should no longer reference the destroyed rule area
    BOOST_CHECK_EQUAL( line1->GetRuleAreaCache().size(), 0u );
    BOOST_CHECK_EQUAL( line2->GetRuleAreaCache().size(), 0u );
 
    // Destroying items should not crash (previously called RemoveItem on freed memory)
    line1.reset();
    line2.reset();
}
 

BOOST_AUTO_TEST_CASE( ContainedItemsDestroyedBeforeRuleArea )
{
    auto ruleArea = std::make_unique<SCH_RULE_AREA>();
    auto line1 = std::make_unique<SCH_LINE>( VECTOR2I( 0, 0 ), LAYER_WIRE );
    auto line2 = std::make_unique<SCH_LINE>( VECTOR2I( 100, 0 ), LAYER_WIRE );
 
    ruleArea->m_items.insert( line1.get() );
    line1->AddRuleAreaToCache( ruleArea.get() );
 
    ruleArea->m_items.insert( line2.get() );
    line2->AddRuleAreaToCache( ruleArea.get() );
 
    BOOST_CHECK_EQUAL( ruleArea->m_items.size(), 2u );
 
    // Destroy items first (the normal ordering)
    line1.reset();
    line2.reset();
 
    // Rule area should have had items removed by their destructors
    BOOST_CHECK_EQUAL( ruleArea->m_items.size(), 0u );
 
    ruleArea.reset();
}
 
 
BOOST_AUTO_TEST_SUITE_END()