2011-12-12 14:02:37 +00:00
|
|
|
/*
|
|
|
|
* This program source code file is part of KiCad, a free EDA CAD application.
|
|
|
|
*
|
|
|
|
* Copyright (C) 2004-2010 Jean-Pierre Charras, jean-pierre.charras@gpisa-lab.inpg.fr
|
|
|
|
* Copyright (C) 2011 Wayne Stambaugh <stambaughw@verizon.net>
|
|
|
|
* Copyright (C) 1992-2011 KiCad Developers, see change_log.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 2
|
|
|
|
* 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, you may find one here:
|
|
|
|
* http://www.gnu.org/licenses/old-licenses/gpl-2.0.html
|
|
|
|
* or you may search the http://www.gnu.org website for the version 2 license,
|
|
|
|
* or you may write to the Free Software Foundation, Inc.,
|
|
|
|
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
|
|
|
|
*/
|
|
|
|
|
2010-11-21 18:28:32 +00:00
|
|
|
/**
|
|
|
|
* @file clean.cpp
|
2011-11-24 19:57:41 +00:00
|
|
|
* @brief functions to clean tracks: remove null lenght and redundant segments
|
2010-11-21 18:28:32 +00:00
|
|
|
*/
|
2007-05-06 16:03:28 +00:00
|
|
|
|
|
|
|
|
2012-01-23 04:33:36 +00:00
|
|
|
#include <fctsys.h>
|
|
|
|
#include <class_drawpanel.h>
|
|
|
|
#include <pcbcommon.h>
|
|
|
|
#include <wxPcbStruct.h>
|
|
|
|
#include <pcbnew.h>
|
|
|
|
#include <class_board.h>
|
|
|
|
#include <class_track.h>
|
2012-09-07 19:29:44 +00:00
|
|
|
#include <connect.h>
|
|
|
|
#include <dialog_cleaning_options.h>
|
2011-09-23 13:57:12 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// Helper class used to clean tracks and vias
|
|
|
|
class TRACKS_CLEANER: CONNECTIONS
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
BOARD * m_Brd;
|
|
|
|
|
|
|
|
public:
|
|
|
|
TRACKS_CLEANER( BOARD * aPcb );
|
|
|
|
|
|
|
|
/**
|
|
|
|
* the cleanup function.
|
|
|
|
* return true if some item was modified
|
|
|
|
*/
|
2014-04-13 18:24:44 +00:00
|
|
|
bool CleanupBoard(PCB_EDIT_FRAME *aFrame, bool aCleanVias,
|
|
|
|
bool aMergeSegments, bool aDeleteUnconnected);
|
2007-06-14 05:31:55 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
private:
|
2007-05-06 16:03:28 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
/**
|
|
|
|
* Removes redundant vias like vias at same location
|
|
|
|
* or on pad through
|
|
|
|
*/
|
|
|
|
bool clean_vias();
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Removes dangling tracks
|
|
|
|
*/
|
|
|
|
bool deleteUnconnectedTracks();
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Merge colinear segments and remove null len segments
|
|
|
|
*/
|
2014-04-13 18:24:44 +00:00
|
|
|
bool clean_segments();
|
2012-09-07 19:29:44 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* helper function
|
|
|
|
* Rebuild list of tracks, and connected tracks
|
|
|
|
* this info must be rebuilt when tracks are erased
|
|
|
|
*/
|
|
|
|
void buildTrackConnectionInfo();
|
|
|
|
|
|
|
|
/**
|
|
|
|
* helper function
|
|
|
|
* merge aTrackRef and aCandidate, when possible,
|
|
|
|
* i.e. when they are colinear, same width, and obviously same layer
|
|
|
|
*/
|
2012-09-11 07:33:17 +00:00
|
|
|
TRACK* mergeCollinearSegmentIfPossible( TRACK* aTrackRef,
|
2014-04-25 17:13:33 +00:00
|
|
|
TRACK* aCandidate, ENDPOINT_T aEndType );
|
2014-04-30 19:16:22 +00:00
|
|
|
|
|
|
|
const ZONE_CONTAINER* zoneForTrackEndpoint( const TRACK *aTrack,
|
|
|
|
ENDPOINT_T aEndPoint );
|
|
|
|
|
|
|
|
bool testTrackEndpointDangling( TRACK *aTrack, ENDPOINT_T aEndPoint );
|
2012-09-07 19:29:44 +00:00
|
|
|
};
|
2007-10-19 23:02:11 +00:00
|
|
|
|
2013-03-08 07:29:30 +00:00
|
|
|
/* Install the cleanup dialog frame to know what should be cleaned
|
2007-10-27 18:05:50 +00:00
|
|
|
*/
|
2013-03-08 07:29:30 +00:00
|
|
|
void PCB_EDIT_FRAME::Clean_Pcb()
|
2007-05-06 16:03:28 +00:00
|
|
|
{
|
2010-11-21 18:28:32 +00:00
|
|
|
DIALOG_CLEANING_OPTIONS dlg( this );
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2013-03-06 09:04:27 +00:00
|
|
|
if( dlg.ShowModal() != wxID_OK )
|
|
|
|
return;
|
|
|
|
|
|
|
|
wxBusyCursor( dummy );
|
|
|
|
TRACKS_CLEANER cleaner( GetBoard() );
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
cleaner.CleanupBoard( this, dlg.m_cleanVias, dlg.m_mergeSegments,
|
2014-04-13 18:24:44 +00:00
|
|
|
dlg.m_deleteUnconnectedSegm );
|
2011-12-22 13:28:11 +00:00
|
|
|
m_canvas->Refresh( true );
|
2007-06-14 05:31:55 +00:00
|
|
|
}
|
|
|
|
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2007-10-27 18:05:50 +00:00
|
|
|
/* Main cleaning function.
|
|
|
|
* Delete
|
|
|
|
* - Redundant points on tracks (merge aligned segments)
|
|
|
|
* - vias on pad
|
2014-04-25 06:00:04 +00:00
|
|
|
* - null length segments
|
2011-09-15 17:58:35 +00:00
|
|
|
* Create segments when track ends are incorrectly connected:
|
2007-10-27 18:05:50 +00:00
|
|
|
* i.e. when a track end covers a pad or a via but is not exactly on the pad or the via center
|
|
|
|
*/
|
2014-04-13 18:24:44 +00:00
|
|
|
bool TRACKS_CLEANER::CleanupBoard( PCB_EDIT_FRAME *aFrame,
|
|
|
|
bool aCleanVias,
|
|
|
|
bool aMergeSegments,
|
|
|
|
bool aDeleteUnconnected )
|
2007-06-14 05:31:55 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
bool modified = false;
|
2010-11-21 18:28:32 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// delete redundant vias
|
2014-04-13 18:24:44 +00:00
|
|
|
modified |= (aCleanVias && clean_vias());
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// Remove null segments and intermediate points on aligned segments
|
2014-04-13 18:24:44 +00:00
|
|
|
modified |= (aMergeSegments && clean_segments());
|
2009-08-03 07:55:08 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// Delete dangling tracks
|
2014-04-13 18:24:44 +00:00
|
|
|
modified |= (aDeleteUnconnected && deleteUnconnectedTracks());
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2014-04-13 18:24:44 +00:00
|
|
|
if( modified )
|
|
|
|
{
|
|
|
|
// Clear undo and redo lists to avoid inconsistencies between lists
|
|
|
|
aFrame->GetScreen()->ClearUndoRedoList();
|
|
|
|
aFrame->SetCurItem( NULL );
|
|
|
|
aFrame->Compile_Ratsnest( NULL, true );
|
|
|
|
aFrame->OnModify();
|
|
|
|
}
|
2012-09-07 19:29:44 +00:00
|
|
|
return modified;
|
|
|
|
}
|
2007-06-14 05:31:55 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
TRACKS_CLEANER::TRACKS_CLEANER( BOARD * aPcb ): CONNECTIONS( aPcb )
|
|
|
|
{
|
|
|
|
m_Brd = aPcb;
|
2011-09-15 17:58:35 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// Build connections info
|
|
|
|
BuildPadsList();
|
|
|
|
buildTrackConnectionInfo();
|
|
|
|
}
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
void TRACKS_CLEANER::buildTrackConnectionInfo()
|
|
|
|
{
|
|
|
|
BuildTracksCandidatesList( m_Brd->m_Track, NULL);
|
2007-05-06 16:03:28 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// clear flags and variables used in cleanup
|
2014-04-30 19:16:22 +00:00
|
|
|
for( TRACK *track = m_Brd->m_Track; track != NULL; track = track->Next() )
|
2010-11-21 18:28:32 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
track->start = NULL;
|
|
|
|
track->end = NULL;
|
|
|
|
track->m_PadsConnected.clear();
|
2013-03-31 13:27:46 +00:00
|
|
|
track->SetState( START_ON_PAD|END_ON_PAD|BUSY, false );
|
2010-11-21 18:28:32 +00:00
|
|
|
}
|
2007-05-06 16:03:28 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// Build connections info tracks to pads
|
|
|
|
SearchTracksConnectedToPads();
|
2014-04-30 19:16:22 +00:00
|
|
|
for( TRACK *track = m_Brd->m_Track; track != NULL; track = track->Next() )
|
2010-11-21 18:28:32 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
// Mark track if connected to pads
|
|
|
|
for( unsigned jj = 0; jj < track->m_PadsConnected.size(); jj++ )
|
|
|
|
{
|
|
|
|
D_PAD * pad = track->m_PadsConnected[jj];
|
2007-05-06 16:03:28 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
if( pad->HitTest( track->GetStart() ) )
|
|
|
|
{
|
|
|
|
track->start = pad;
|
2013-03-31 13:27:46 +00:00
|
|
|
track->SetState( START_ON_PAD, true );
|
2012-09-07 19:29:44 +00:00
|
|
|
}
|
2007-05-06 16:03:28 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
if( pad->HitTest( track->GetEnd() ) )
|
|
|
|
{
|
|
|
|
track->end = pad;
|
2013-03-31 13:27:46 +00:00
|
|
|
track->SetState( END_ON_PAD, true );
|
2012-09-07 19:29:44 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2007-05-06 16:03:28 +00:00
|
|
|
}
|
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
bool TRACKS_CLEANER::clean_vias()
|
2010-11-21 18:28:32 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
bool modified = false;
|
2010-11-21 18:28:32 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
for( VIA* via = GetFirstVia( m_Brd->m_Track ); via != NULL;
|
|
|
|
via = GetFirstVia( via->Next() ) )
|
2010-11-21 18:28:32 +00:00
|
|
|
{
|
2014-04-30 19:16:22 +00:00
|
|
|
// Correct via m_End defects (if any), should never happen
|
|
|
|
if( via->GetStart() != via->GetEnd() )
|
2012-09-07 19:29:44 +00:00
|
|
|
{
|
2014-05-05 00:19:16 +00:00
|
|
|
wxFAIL_MSG( wxT( "Via with mismatching ends" ) );
|
2014-04-30 19:16:22 +00:00
|
|
|
via->SetEnd( via->GetStart() );
|
2014-04-25 06:00:04 +00:00
|
|
|
}
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
/* Important: these cleanups only do thru hole vias, they don't
|
|
|
|
* (yet) handle high density interconnects */
|
|
|
|
if( via->GetViaType() != VIA_THROUGH )
|
2010-11-21 18:28:32 +00:00
|
|
|
{
|
2014-04-30 19:16:22 +00:00
|
|
|
// Search and delete others vias at same location
|
|
|
|
VIA* next_via;
|
|
|
|
for( VIA* alt_via = GetFirstVia( via->Next() ); alt_via != NULL;
|
|
|
|
alt_via = next_via )
|
2014-04-25 06:00:04 +00:00
|
|
|
{
|
2014-04-30 19:16:22 +00:00
|
|
|
next_via = GetFirstVia( alt_via->Next() );
|
|
|
|
|
|
|
|
if( (alt_via->GetViaType() == VIA_THROUGH) &&
|
|
|
|
(alt_via->GetStart() == via->GetStart()) )
|
|
|
|
{
|
|
|
|
// delete via
|
|
|
|
alt_via->DeleteStructure();
|
|
|
|
modified = true;
|
|
|
|
}
|
|
|
|
}
|
2010-11-21 18:28:32 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
/* To delete through Via on THT pads at same location
|
|
|
|
* Examine the list of connected pads:
|
|
|
|
* if one through pad is found, the via can be removed */
|
|
|
|
for( unsigned ii = 0; ii < via->m_PadsConnected.size(); ++ii )
|
|
|
|
{
|
|
|
|
const D_PAD *pad = via->m_PadsConnected[ii];
|
2010-11-21 18:28:32 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
if( (pad->GetLayerMask() & ALL_CU_LAYERS) == ALL_CU_LAYERS )
|
|
|
|
{
|
|
|
|
// redundant: delete the via
|
|
|
|
via->DeleteStructure();
|
|
|
|
modified = true;
|
|
|
|
break;
|
|
|
|
}
|
2014-04-25 06:00:04 +00:00
|
|
|
}
|
2010-11-21 18:28:32 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
return modified;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Utility for checking if a track/via ends on a zone
|
|
|
|
const ZONE_CONTAINER* TRACKS_CLEANER::zoneForTrackEndpoint( const TRACK *aTrack,
|
|
|
|
ENDPOINT_T aEndPoint )
|
|
|
|
{
|
|
|
|
// Vias are special cased, since they get a layer range, not a single one
|
|
|
|
LAYER_NUM top_layer, bottom_layer;
|
|
|
|
const VIA *via = dynamic_cast<const VIA*>( aTrack );
|
|
|
|
|
|
|
|
if( via )
|
|
|
|
via->LayerPair( &top_layer, &bottom_layer );
|
|
|
|
else
|
2010-11-21 18:28:32 +00:00
|
|
|
{
|
2014-04-30 19:16:22 +00:00
|
|
|
top_layer = aTrack->GetLayer();
|
|
|
|
bottom_layer = top_layer;
|
|
|
|
}
|
|
|
|
return m_Brd->HitTestForAnyFilledArea( aTrack->GetEndPoint( aEndPoint ),
|
|
|
|
top_layer, bottom_layer, aTrack->GetNetCode() );
|
|
|
|
}
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
/** Utility: does the endpoint unconnected processed for one endpoint of one track
|
|
|
|
* Returns true if the track must be deleted, false if not necessarily */
|
|
|
|
bool TRACKS_CLEANER::testTrackEndpointDangling( TRACK *aTrack, ENDPOINT_T aEndPoint )
|
|
|
|
{
|
|
|
|
bool flag_erase = false;
|
|
|
|
|
|
|
|
TRACK* other = aTrack->GetTrack( m_Brd->m_Track, NULL, aEndPoint );
|
|
|
|
if( (other == NULL) &&
|
|
|
|
(zoneForTrackEndpoint( aTrack, aEndPoint ) == NULL) )
|
|
|
|
flag_erase = true; // Start endpoint is neither on pad, zone or other track
|
|
|
|
else // segment, via or zone connected to this end
|
|
|
|
{
|
|
|
|
// Fill connectivity informations
|
|
|
|
if( aEndPoint == ENDPOINT_START )
|
|
|
|
aTrack->start = other;
|
|
|
|
else
|
|
|
|
aTrack->end = other;
|
2010-11-21 18:28:32 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
/* If a via is connected to this end, test if this via has a second item connected.
|
|
|
|
* If not, remove the current segment (the via would then become
|
|
|
|
* unconnected and remove on the following pass) */
|
|
|
|
VIA* via = dynamic_cast<VIA*>( other );
|
|
|
|
if( via )
|
2010-11-21 18:28:32 +00:00
|
|
|
{
|
2014-04-30 19:16:22 +00:00
|
|
|
// search for another segment following the via
|
|
|
|
aTrack->SetState( BUSY, true );
|
2012-09-07 19:29:44 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
other = via->GetTrack( m_Brd->m_Track, NULL, aEndPoint );
|
|
|
|
|
|
|
|
// There is a via on the start but it goes nowhere
|
|
|
|
if( (other == NULL) &&
|
|
|
|
(zoneForTrackEndpoint( via, aEndPoint ) == NULL) )
|
|
|
|
flag_erase = true;
|
|
|
|
|
|
|
|
aTrack->SetState( BUSY, false );
|
2010-11-21 18:28:32 +00:00
|
|
|
}
|
|
|
|
}
|
2014-04-30 19:16:22 +00:00
|
|
|
return flag_erase;
|
2010-11-21 18:28:32 +00:00
|
|
|
}
|
|
|
|
|
2007-05-06 16:03:28 +00:00
|
|
|
/*
|
2007-10-27 12:24:09 +00:00
|
|
|
* Delete dangling tracks
|
|
|
|
* Vias:
|
|
|
|
* If a via is only connected to a dangling track, it also will be removed
|
2007-08-10 19:14:51 +00:00
|
|
|
*/
|
2012-09-07 19:29:44 +00:00
|
|
|
bool TRACKS_CLEANER::deleteUnconnectedTracks()
|
2007-05-06 16:03:28 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
if( m_Brd->m_Track == NULL )
|
|
|
|
return false;
|
2010-11-21 18:28:32 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
bool modified = false;
|
2014-04-30 19:16:22 +00:00
|
|
|
bool item_erased;
|
|
|
|
do // Iterate when at least one track is deleted
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
item_erased = false;
|
|
|
|
TRACK* next_track;
|
2014-04-30 19:16:22 +00:00
|
|
|
for( TRACK *track = m_Brd->m_Track; track != NULL; track = next_track )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
next_track = track->Next();
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
bool flag_erase = false; // Start without a good reason to erase it
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
/* if a track endpoint is not connected to a pad, test if
|
|
|
|
* the endpoint is connected to another track or to a zone.
|
|
|
|
* For via test, an enhancement could be to test if
|
|
|
|
* connected to 2 items on different layers. Currently
|
|
|
|
* a via must be connected to 2 items, that can be on the
|
|
|
|
* same layer */
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
// Check if there is nothing attached on the start
|
|
|
|
if( !(track->GetState( START_ON_PAD )) )
|
|
|
|
flag_erase |= testTrackEndpointDangling( track, ENDPOINT_START );
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2014-04-30 19:16:22 +00:00
|
|
|
// Check if there is nothing attached on the end
|
|
|
|
if( !(track->GetState( END_ON_PAD )) )
|
|
|
|
flag_erase |= testTrackEndpointDangling( track, ENDPOINT_END );
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
if( flag_erase )
|
2011-09-07 19:41:04 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
// remove segment from board
|
|
|
|
track->DeleteStructure();
|
2014-04-30 19:16:22 +00:00
|
|
|
|
|
|
|
/* keep iterating, because a track connected to the deleted track
|
|
|
|
* now perhaps is not connected and should be deleted */
|
2012-09-07 19:29:44 +00:00
|
|
|
item_erased = true;
|
|
|
|
modified = true;
|
2011-09-07 19:41:04 +00:00
|
|
|
}
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
2014-04-30 19:16:22 +00:00
|
|
|
} while( item_erased );
|
2012-09-07 19:29:44 +00:00
|
|
|
|
|
|
|
return modified;
|
2007-05-06 16:03:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-02-19 04:02:19 +00:00
|
|
|
// Delete null length segments, and intermediate points ..
|
2012-09-07 19:29:44 +00:00
|
|
|
bool TRACKS_CLEANER::clean_segments()
|
2007-05-06 16:03:28 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
bool modified = false;
|
2009-06-11 18:30:03 +00:00
|
|
|
TRACK* segment, * nextsegment;
|
2007-10-19 19:58:31 +00:00
|
|
|
TRACK* other;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2010-11-21 18:28:32 +00:00
|
|
|
// Delete null segments
|
2012-09-07 19:29:44 +00:00
|
|
|
for( segment = m_Brd->m_Track; segment; segment = nextsegment )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2009-06-11 18:30:03 +00:00
|
|
|
nextsegment = segment->Next();
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
if( segment->IsNull() ) // Length segment = 0; delete it
|
2014-04-13 18:24:44 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
segment->DeleteStructure();
|
2014-04-13 18:24:44 +00:00
|
|
|
modified = true;
|
|
|
|
}
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// Delete redundant segments, i.e. segments having the same end points
|
|
|
|
// and layers
|
|
|
|
for( segment = m_Brd->m_Track; segment; segment = segment->Next() )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2009-06-11 18:30:03 +00:00
|
|
|
for( other = segment->Next(); other; other = nextsegment )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2009-06-11 18:30:03 +00:00
|
|
|
nextsegment = other->Next();
|
2012-09-07 19:29:44 +00:00
|
|
|
bool erase = false;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2007-10-19 19:58:31 +00:00
|
|
|
if( segment->Type() != other->Type() )
|
2007-08-10 19:14:51 +00:00
|
|
|
continue;
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2007-10-19 19:58:31 +00:00
|
|
|
if( segment->GetLayer() != other->GetLayer() )
|
2007-08-10 19:14:51 +00:00
|
|
|
continue;
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2014-02-25 10:40:34 +00:00
|
|
|
if( segment->GetNetCode() != other->GetNetCode() )
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
|
|
|
|
2013-01-13 00:04:00 +00:00
|
|
|
if( ( segment->GetStart() == other->GetStart() ) &&
|
|
|
|
( segment->GetEnd() == other->GetEnd() ) )
|
2012-09-07 19:29:44 +00:00
|
|
|
erase = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2013-01-13 00:04:00 +00:00
|
|
|
if( ( segment->GetStart() == other->GetEnd() ) &&
|
|
|
|
( segment->GetEnd() == other->GetStart() ) )
|
2012-09-07 19:29:44 +00:00
|
|
|
erase = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2012-02-19 04:02:19 +00:00
|
|
|
// Delete redundant point
|
2007-08-10 19:14:51 +00:00
|
|
|
if( erase )
|
|
|
|
{
|
2007-10-19 19:58:31 +00:00
|
|
|
other->DeleteStructure();
|
2012-09-07 19:29:44 +00:00
|
|
|
modified = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-09-11 07:33:17 +00:00
|
|
|
// merge collinear segments:
|
2012-09-07 19:29:44 +00:00
|
|
|
for( segment = m_Brd->m_Track; segment; segment = nextsegment )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2007-10-19 19:58:31 +00:00
|
|
|
TRACK* segStart;
|
|
|
|
TRACK* segEnd;
|
2007-10-19 23:02:11 +00:00
|
|
|
TRACK* segDelete;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2009-06-11 18:30:03 +00:00
|
|
|
nextsegment = segment->Next();
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2011-10-01 19:24:27 +00:00
|
|
|
if( segment->Type() != PCB_TRACE_T )
|
2007-08-10 19:14:51 +00:00
|
|
|
continue;
|
|
|
|
|
2014-04-13 18:24:44 +00:00
|
|
|
unsigned flag = 0;
|
|
|
|
bool no_inc = false;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// search for a possible point connected to the START point of the current segment
|
2007-10-19 23:02:11 +00:00
|
|
|
for( segStart = segment->Next(); ; )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2014-04-25 17:13:33 +00:00
|
|
|
segStart = segment->GetTrack( segStart, NULL, ENDPOINT_START );
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2007-10-19 19:58:31 +00:00
|
|
|
if( segStart )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2007-10-19 19:58:31 +00:00
|
|
|
// the two segments must have the same width
|
2013-01-13 00:04:00 +00:00
|
|
|
if( segment->GetWidth() != segStart->GetWidth() )
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
|
|
|
|
2007-10-19 19:58:31 +00:00
|
|
|
// it cannot be a via
|
2011-10-01 19:24:27 +00:00
|
|
|
if( segStart->Type() != PCB_TRACE_T )
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
|
|
|
|
2012-02-19 04:02:19 +00:00
|
|
|
// We must have only one segment connected
|
2013-03-28 06:40:19 +00:00
|
|
|
segStart->SetState( BUSY, true );
|
2014-04-25 17:13:33 +00:00
|
|
|
other = segment->GetTrack( m_Brd->m_Track, NULL, ENDPOINT_START );
|
2013-03-28 06:40:19 +00:00
|
|
|
segStart->SetState( BUSY, false );
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2007-10-19 19:58:31 +00:00
|
|
|
if( other == NULL )
|
2012-02-19 04:02:19 +00:00
|
|
|
flag = 1; // OK
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2011-09-15 17:58:35 +00:00
|
|
|
if( flag ) // We have the starting point of the segment is connected to an other segment
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2014-04-25 17:13:33 +00:00
|
|
|
segDelete = mergeCollinearSegmentIfPossible( segment, segStart, ENDPOINT_START );
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2007-10-19 23:02:11 +00:00
|
|
|
if( segDelete )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2010-11-21 18:28:32 +00:00
|
|
|
no_inc = 1;
|
2007-10-19 23:02:11 +00:00
|
|
|
segDelete->DeleteStructure();
|
2012-09-07 19:29:44 +00:00
|
|
|
modified = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
// search for a possible point connected to the END point of the current segment:
|
2007-10-19 23:02:11 +00:00
|
|
|
for( segEnd = segment->Next(); ; )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2014-04-25 17:13:33 +00:00
|
|
|
segEnd = segment->GetTrack( segEnd, NULL, ENDPOINT_END );
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2007-10-19 19:58:31 +00:00
|
|
|
if( segEnd )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2013-01-13 00:04:00 +00:00
|
|
|
if( segment->GetWidth() != segEnd->GetWidth() )
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2011-10-01 19:24:27 +00:00
|
|
|
if( segEnd->Type() != PCB_TRACE_T )
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
|
|
|
|
2012-02-19 04:02:19 +00:00
|
|
|
// We must have only one segment connected
|
2013-03-28 06:40:19 +00:00
|
|
|
segEnd->SetState( BUSY, true );
|
2014-04-25 17:13:33 +00:00
|
|
|
other = segment->GetTrack( m_Brd->m_Track, NULL, ENDPOINT_END );
|
2013-03-28 06:40:19 +00:00
|
|
|
segEnd->SetState( BUSY, false );
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2007-10-19 19:58:31 +00:00
|
|
|
if( other == NULL )
|
2012-02-19 04:02:19 +00:00
|
|
|
flag |= 2; // Ok
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
else
|
2011-09-07 19:41:04 +00:00
|
|
|
{
|
2007-08-10 19:14:51 +00:00
|
|
|
break;
|
2011-09-07 19:41:04 +00:00
|
|
|
}
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
|
2011-09-15 17:58:35 +00:00
|
|
|
if( flag & 2 ) // We have the ending point of the segment is connected to an other segment
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2014-04-25 17:13:33 +00:00
|
|
|
segDelete = mergeCollinearSegmentIfPossible( segment, segEnd, ENDPOINT_END );
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2007-10-19 23:02:11 +00:00
|
|
|
if( segDelete )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2014-04-13 18:24:44 +00:00
|
|
|
no_inc = true;
|
2007-10-19 23:02:11 +00:00
|
|
|
segDelete->DeleteStructure();
|
2012-09-07 19:29:44 +00:00
|
|
|
modified = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-02-19 04:02:19 +00:00
|
|
|
if( no_inc ) // The current segment was modified, retry to merge it
|
2009-06-11 18:30:03 +00:00
|
|
|
nextsegment = segment->Next();
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
return modified;
|
2007-05-06 16:03:28 +00:00
|
|
|
}
|
|
|
|
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2012-02-19 04:02:19 +00:00
|
|
|
/** Function used by clean_segments.
|
2012-09-11 07:33:17 +00:00
|
|
|
* Test if aTrackRef and aCandidate (which must have a common end) are collinear.
|
2007-10-27 18:05:50 +00:00
|
|
|
* and see if the common point is not on a pad (i.e. if this common point can be removed).
|
2012-09-11 07:33:17 +00:00
|
|
|
* the ending point of aTrackRef is the start point (aEndType == START)
|
2011-11-15 19:21:16 +00:00
|
|
|
* or the end point (aEndType != START)
|
2012-09-07 19:29:44 +00:00
|
|
|
* flags START_ON_PAD and END_ON_PAD must be set before calling this function
|
2011-11-15 19:21:16 +00:00
|
|
|
* if the common point can be deleted, this function
|
|
|
|
* change the common point coordinate of the aTrackRef segm
|
2007-10-27 18:05:50 +00:00
|
|
|
* (and therefore connect the 2 other ending points)
|
2011-11-15 19:21:16 +00:00
|
|
|
* and return aCandidate (which can be deleted).
|
2007-10-27 18:05:50 +00:00
|
|
|
* else return NULL
|
2007-08-10 19:14:51 +00:00
|
|
|
*/
|
2012-09-11 07:33:17 +00:00
|
|
|
TRACK* TRACKS_CLEANER::mergeCollinearSegmentIfPossible( TRACK* aTrackRef, TRACK* aCandidate,
|
2014-04-25 17:13:33 +00:00
|
|
|
ENDPOINT_T aEndType )
|
2007-05-06 16:03:28 +00:00
|
|
|
{
|
2013-01-13 00:04:00 +00:00
|
|
|
if( aTrackRef->GetWidth() != aCandidate->GetWidth() )
|
2011-11-15 19:21:16 +00:00
|
|
|
return NULL;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2011-11-15 19:21:16 +00:00
|
|
|
bool is_colinear = false;
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2011-11-15 19:21:16 +00:00
|
|
|
// Trivial case: superimposed tracks ( tracks, not vias ):
|
|
|
|
if( aTrackRef->Type() == PCB_TRACE_T && aCandidate->Type() == PCB_TRACE_T )
|
|
|
|
{
|
2013-01-13 00:04:00 +00:00
|
|
|
if( ( aTrackRef->GetStart() == aCandidate->GetStart() ) &&
|
|
|
|
( aTrackRef->GetEnd() == aCandidate->GetEnd() ) )
|
2012-09-07 19:29:44 +00:00
|
|
|
return aCandidate;
|
2011-11-15 19:21:16 +00:00
|
|
|
|
2013-01-13 00:04:00 +00:00
|
|
|
if( ( aTrackRef->GetStart() == aCandidate->GetEnd() ) &&
|
|
|
|
( aTrackRef->GetEnd() == aCandidate->GetStart() ) )
|
2012-09-07 19:29:44 +00:00
|
|
|
return aCandidate;
|
2011-11-15 19:21:16 +00:00
|
|
|
}
|
|
|
|
|
2013-01-13 00:04:00 +00:00
|
|
|
int refdx = aTrackRef->GetEnd().x - aTrackRef->GetStart().x;
|
|
|
|
int refdy = aTrackRef->GetEnd().y - aTrackRef->GetStart().y;
|
2011-11-15 19:21:16 +00:00
|
|
|
|
2013-01-13 00:04:00 +00:00
|
|
|
int segmdx = aCandidate->GetEnd().x - aCandidate->GetStart().x;
|
|
|
|
int segmdy = aCandidate->GetEnd().y - aCandidate->GetStart().y;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2007-10-27 18:05:50 +00:00
|
|
|
// test for vertical alignment (easy to handle)
|
2007-08-10 19:14:51 +00:00
|
|
|
if( refdx == 0 )
|
|
|
|
{
|
|
|
|
if( segmdx != 0 )
|
|
|
|
return NULL;
|
|
|
|
else
|
2011-11-15 19:21:16 +00:00
|
|
|
is_colinear = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2007-10-27 18:05:50 +00:00
|
|
|
// test for horizontal alignment (easy to handle)
|
2007-08-10 19:14:51 +00:00
|
|
|
if( refdy == 0 )
|
|
|
|
{
|
|
|
|
if( segmdy != 0 )
|
|
|
|
return NULL;
|
|
|
|
else
|
2011-11-15 19:21:16 +00:00
|
|
|
is_colinear = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
|
2011-09-15 17:58:35 +00:00
|
|
|
/* test if alignment in other cases
|
2011-11-24 19:57:41 +00:00
|
|
|
* We must have refdy/refdx == segmdy/segmdx, (i.e. same slope)
|
|
|
|
* or refdy * segmdx == segmdy * refdx
|
|
|
|
*/
|
2011-11-15 19:21:16 +00:00
|
|
|
if( is_colinear == false )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2011-11-24 19:57:41 +00:00
|
|
|
if( ( double)refdy * segmdx != (double)refdx * segmdy )
|
2007-08-10 19:14:51 +00:00
|
|
|
return NULL;
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2011-11-15 19:21:16 +00:00
|
|
|
is_colinear = true;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
|
2007-10-27 18:05:50 +00:00
|
|
|
/* Here we have 2 aligned segments:
|
2011-09-15 17:58:35 +00:00
|
|
|
* We must change the pt_ref common point only if not on a pad
|
|
|
|
* (this function) is called when there is only 2 connected segments,
|
|
|
|
*and if this point is not on a pad, it can be removed and the 2 segments will be merged
|
|
|
|
*/
|
2014-04-25 17:13:33 +00:00
|
|
|
if( aEndType == ENDPOINT_START )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
// We do not have a pad, which is a always terminal point for a track
|
|
|
|
if( aTrackRef->GetState( START_ON_PAD) )
|
2007-08-10 19:14:51 +00:00
|
|
|
return NULL;
|
|
|
|
|
2011-09-15 17:58:35 +00:00
|
|
|
/* change the common point coordinate of pt_segm to use the other point
|
|
|
|
* of pt_segm (pt_segm will be removed later) */
|
2013-01-13 00:04:00 +00:00
|
|
|
if( aTrackRef->GetStart() == aCandidate->GetStart() )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2013-01-13 00:04:00 +00:00
|
|
|
aTrackRef->SetStart( aCandidate->GetEnd());
|
2012-09-07 19:29:44 +00:00
|
|
|
aTrackRef->start = aCandidate->end;
|
|
|
|
aTrackRef->SetState( START_ON_PAD, aCandidate->GetState( END_ON_PAD) );
|
2011-11-15 19:21:16 +00:00
|
|
|
return aCandidate;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
2007-10-27 18:05:50 +00:00
|
|
|
else
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2013-01-13 00:04:00 +00:00
|
|
|
aTrackRef->SetStart( aCandidate->GetStart() );
|
2012-09-07 19:29:44 +00:00
|
|
|
aTrackRef->start = aCandidate->start;
|
|
|
|
aTrackRef->SetState( START_ON_PAD, aCandidate->GetState( START_ON_PAD) );
|
2011-11-15 19:21:16 +00:00
|
|
|
return aCandidate;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
}
|
2011-11-15 19:21:16 +00:00
|
|
|
else // aEndType == END
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2012-09-07 19:29:44 +00:00
|
|
|
// We do not have a pad, which is a always terminal point for a track
|
|
|
|
if( aTrackRef->GetState( END_ON_PAD) )
|
2007-08-10 19:14:51 +00:00
|
|
|
return NULL;
|
|
|
|
|
2011-09-15 17:58:35 +00:00
|
|
|
/* change the common point coordinate of pt_segm to use the other point
|
|
|
|
* of pt_segm (pt_segm will be removed later) */
|
2013-01-13 00:04:00 +00:00
|
|
|
if( aTrackRef->GetEnd() == aCandidate->GetStart() )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2013-01-13 00:04:00 +00:00
|
|
|
aTrackRef->SetEnd( aCandidate->GetEnd() );
|
2012-09-07 19:29:44 +00:00
|
|
|
aTrackRef->end = aCandidate->end;
|
|
|
|
aTrackRef->SetState( END_ON_PAD, aCandidate->GetState( END_ON_PAD) );
|
2011-11-15 19:21:16 +00:00
|
|
|
return aCandidate;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
2007-10-27 18:05:50 +00:00
|
|
|
else
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2013-01-13 00:04:00 +00:00
|
|
|
aTrackRef->SetEnd( aCandidate->GetStart() );
|
2012-09-07 19:29:44 +00:00
|
|
|
aTrackRef->end = aCandidate->start;
|
|
|
|
aTrackRef->SetState( END_ON_PAD, aCandidate->GetState( START_ON_PAD) );
|
2011-11-15 19:21:16 +00:00
|
|
|
return aCandidate;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
}
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2007-08-10 19:14:51 +00:00
|
|
|
return NULL;
|
2007-05-06 16:03:28 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2012-01-26 09:37:36 +00:00
|
|
|
bool PCB_EDIT_FRAME::RemoveMisConnectedTracks()
|
2007-05-06 16:03:28 +00:00
|
|
|
{
|
2012-01-26 09:37:36 +00:00
|
|
|
/* finds all track segments which are mis-connected (to more than one net).
|
|
|
|
* When such a bad segment is found, it is flagged to be removed.
|
|
|
|
* All tracks having at least one flagged segment are removed.
|
|
|
|
*/
|
2007-10-15 03:26:38 +00:00
|
|
|
TRACK* segment;
|
|
|
|
TRACK* other;
|
|
|
|
TRACK* next;
|
2007-08-10 19:14:51 +00:00
|
|
|
int net_code_s, net_code_e;
|
2010-11-21 18:28:32 +00:00
|
|
|
bool isModified = false;
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2010-04-16 16:28:35 +00:00
|
|
|
for( segment = GetBoard()->m_Track; segment; segment = (TRACK*) segment->Next() )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2013-03-28 06:40:19 +00:00
|
|
|
segment->SetState( FLAG0, false );
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2007-10-15 03:26:38 +00:00
|
|
|
// find the netcode for segment using anything connected to the "start" of "segment"
|
2007-08-10 19:14:51 +00:00
|
|
|
net_code_s = -1;
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
if( segment->start && segment->start->Type()==PCB_PAD_T )
|
2007-10-15 03:26:38 +00:00
|
|
|
{
|
|
|
|
// get the netcode of the pad to propagate.
|
2014-02-25 10:40:34 +00:00
|
|
|
net_code_s = ((D_PAD*)(segment->start))->GetNetCode();
|
2007-10-15 03:26:38 +00:00
|
|
|
}
|
2007-08-10 19:14:51 +00:00
|
|
|
else
|
|
|
|
{
|
2014-04-25 17:13:33 +00:00
|
|
|
other = segment->GetTrack( GetBoard()->m_Track, NULL, ENDPOINT_START );
|
2011-09-16 14:13:02 +00:00
|
|
|
|
2007-10-15 03:26:38 +00:00
|
|
|
if( other )
|
2014-02-25 10:40:34 +00:00
|
|
|
net_code_s = other->GetNetCode();
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2007-08-10 19:14:51 +00:00
|
|
|
if( net_code_s < 0 )
|
2007-10-15 03:26:38 +00:00
|
|
|
continue; // the "start" of segment is not connected
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2007-10-15 03:26:38 +00:00
|
|
|
// find the netcode for segment using anything connected to the "end" of "segment"
|
2007-08-10 19:14:51 +00:00
|
|
|
net_code_e = -1;
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2012-09-07 19:29:44 +00:00
|
|
|
if( segment->end && segment->end->Type()==PCB_PAD_T )
|
2007-10-15 03:26:38 +00:00
|
|
|
{
|
2014-02-25 10:40:34 +00:00
|
|
|
net_code_e = ((D_PAD*)(segment->end))->GetNetCode();
|
2007-10-15 03:26:38 +00:00
|
|
|
}
|
2007-08-10 19:14:51 +00:00
|
|
|
else
|
|
|
|
{
|
2014-04-25 17:13:33 +00:00
|
|
|
other = segment->GetTrack( GetBoard()->m_Track, NULL, ENDPOINT_END );
|
2011-09-07 19:41:04 +00:00
|
|
|
|
2007-10-15 03:26:38 +00:00
|
|
|
if( other )
|
2014-02-25 10:40:34 +00:00
|
|
|
net_code_e = other->GetNetCode();
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if( net_code_e < 0 )
|
2007-10-15 03:26:38 +00:00
|
|
|
continue; // the "end" of segment is not connected
|
2007-08-10 19:14:51 +00:00
|
|
|
|
2012-01-26 09:37:36 +00:00
|
|
|
// Netcodes do not agree, so mark the segment as "to be removed"
|
2007-08-10 19:14:51 +00:00
|
|
|
if( net_code_s != net_code_e )
|
|
|
|
{
|
2013-03-28 06:40:19 +00:00
|
|
|
segment->SetState( FLAG0, true );
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2012-01-26 09:37:36 +00:00
|
|
|
// Remove tracks having a flagged segment
|
2012-09-07 19:29:44 +00:00
|
|
|
for( segment = GetBoard()->m_Track; segment; segment = next )
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2007-10-15 03:26:38 +00:00
|
|
|
next = (TRACK*) segment->Next();
|
2008-03-10 15:00:22 +00:00
|
|
|
|
2011-09-15 17:58:35 +00:00
|
|
|
if( segment->GetState( FLAG0 ) ) // Segment is flagged to be removed
|
2007-08-10 19:14:51 +00:00
|
|
|
{
|
2013-03-28 06:40:19 +00:00
|
|
|
segment->SetState( FLAG0, false );
|
2010-11-21 18:28:32 +00:00
|
|
|
isModified = true;
|
2010-04-16 16:28:35 +00:00
|
|
|
GetBoard()->m_Status_Pcb = 0;
|
2012-01-26 09:37:36 +00:00
|
|
|
Remove_One_Track( NULL, segment );
|
2011-09-15 17:58:35 +00:00
|
|
|
|
2012-01-26 09:37:36 +00:00
|
|
|
// the current segment is deleted,
|
|
|
|
// we do not know the next "not yet tested" segment,
|
|
|
|
// so restart to the beginning
|
2010-11-21 18:28:32 +00:00
|
|
|
next = GetBoard()->m_Track;
|
2007-08-10 19:14:51 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-11-21 18:28:32 +00:00
|
|
|
return isModified;
|
2007-05-06 16:03:28 +00:00
|
|
|
}
|