PNS_ITEM* PNS_ROUTER::syncTrack( TRACK* aTrack ) { PNS_SEGMENT* s = new PNS_SEGMENT( SEG( aTrack->GetStart(), aTrack->GetEnd() ), aTrack->GetNetCode() ); s->SetWidth( aTrack->GetWidth() ); s->SetLayers( PNS_LAYERSET( aTrack->GetLayer() ) ); s->SetParent( aTrack ); return s; }
bool PNS_LINE_PLACER::FixRoute( const VECTOR2I& aP, PNS_ITEM* aEndItem ) { bool realEnd = false; int lastV; PNS_LINE pl = Trace(); if( m_currentMode == RM_MarkObstacles && !Settings().CanViolateDRC() && m_world->CheckColliding( &pl ) ) return false; const SHAPE_LINE_CHAIN& l = pl.CLine(); if( !l.SegmentCount() ) { if( pl.EndsWithVia() ) { m_lastNode->Add( pl.Via().Clone() ); Router()->CommitRouting( m_lastNode ); m_lastNode = NULL; m_currentNode = NULL; m_idle = true; } return true; } VECTOR2I p_pre_last = l.CPoint( -1 ); const VECTOR2I p_last = l.CPoint( -1 ); DIRECTION_45 d_last( l.CSegment( -1 ) ); if( l.PointCount() > 2 ) p_pre_last = l.CPoint( -2 ); if( aEndItem && m_currentNet >= 0 && m_currentNet == aEndItem->Net() ) realEnd = true; if( realEnd || m_placingVia ) lastV = l.SegmentCount(); else lastV = std::max( 1, l.SegmentCount() - 1 ); PNS_SEGMENT* lastSeg = NULL; for( int i = 0; i < lastV; i++ ) { const SEG& s = pl.CSegment( i ); PNS_SEGMENT* seg = new PNS_SEGMENT( s, m_currentNet ); seg->SetWidth( pl.Width() ); seg->SetLayer( m_currentLayer ); m_lastNode->Add( seg ); lastSeg = seg; } if( pl.EndsWithVia() ) m_lastNode->Add( pl.Via().Clone() ); if( realEnd ) simplifyNewLine( m_lastNode, lastSeg ); Router()->CommitRouting( m_lastNode ); m_lastNode = NULL; m_currentNode = NULL; if( !realEnd ) { setInitialDirection( d_last ); m_currentStart = m_placingVia ? p_last : p_pre_last; m_startItem = NULL; m_placingVia = false; m_chainedPlacement = !pl.EndsWithVia(); m_splitSeg = false; initPlacement(); } else { m_idle = true; } return realEnd; }