void PNS_ROUTER::markViolations( PNS_NODE* aNode, PNS_ITEMSET& aCurrent, PNS_NODE::ITEM_VECTOR& aRemoved ) { for( PNS_ITEM* item : aCurrent.Items() ) { PNS_NODE::OBSTACLES obstacles; aNode->QueryColliding( item, obstacles, PNS_ITEM::ANY ); if( item->OfKind( PNS_ITEM::LINE ) ) { PNS_LINE* l = static_cast<PNS_LINE*>( item ); if( l->EndsWithVia() ) { PNS_VIA v( l->Via() ); aNode->QueryColliding( &v, obstacles, PNS_ITEM::ANY ); } } for( PNS_OBSTACLE& obs : obstacles ) { int clearance = aNode->GetClearance( item, obs.m_item ); std::unique_ptr<PNS_ITEM> tmp( obs.m_item->Clone() ); tmp->Mark( MK_VIOLATION ); m_iface->DisplayItem( tmp.get(), -1, clearance ); aRemoved.push_back( obs.m_item ); } } }
void PNS_LOGGER::Log ( const PNS_ITEM* aItem, int aKind, const std::string aName ) { m_theLog << "aItem " << aKind << " " << aName << " "; m_theLog << aItem->Net() << " " << aItem->Layers().Start() << " " << aItem->Layers().End() << " " << aItem->Marker() << " " << aItem->Rank(); switch( aItem->Kind() ) { case PNS_ITEM::LINE: { PNS_LINE* l = (PNS_LINE*) aItem; m_theLog << " line "; m_theLog << l->Width() << " " << ( l->EndsWithVia() ? 1 : 0 ) << " "; dumpShape ( l->Shape() ); m_theLog << std::endl; break; } case PNS_ITEM::VIA: { m_theLog << " via 0 0 "; dumpShape ( aItem->Shape() ); m_theLog << std::endl; break; } case PNS_ITEM::SEGMENT: { PNS_SEGMENT* s =(PNS_SEGMENT*) aItem; m_theLog << " line "; m_theLog << s->Width() << " 0 linechain 2 0 " << s->Seg().A.x << " " << s->Seg().A.y << " " << s->Seg().B.x << " " <<s->Seg().B.y << std::endl; break; } case PNS_ITEM::SOLID: { PNS_SOLID* s = (PNS_SOLID*) aItem; m_theLog << " solid 0 0 "; dumpShape( s->Shape() ); m_theLog << std::endl; break; } default: break; } }
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; }