KiCad PCB EDA Suite
Loading...
Searching...
No Matches
pns_meander_skew_placer.cpp
Go to the documentation of this file.
1/*
2 * KiRouter - a push-and-(sometimes-)shove PCB router
3 *
4 * Copyright (C) 2013-2015 CERN
5 * Copyright The KiCad Developers, see AUTHORS.txt for contributors.
6 * Author: Tomasz Wlostowski <[email protected]>
7 *
8 * This program is free software: you can redistribute it and/or modify it
9 * under the terms of the GNU General Public License as published by the
10 * Free Software Foundation, either version 3 of the License, or (at your
11 * option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful, but
14 * WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 * General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License along
19 * with this program. If not, see <http://www.gnu.org/licenses/>.
20 */
21
23
24#include <core/typeinfo.h>
26
27#include "pns_node.h"
28#include "pns_itemset.h"
29#include "pns_topology.h"
30#include "pns_solid.h"
31
32#include "pns_router.h"
33#include "pns_debug_decorator.h"
34
35#include <board.h>
36#include <netinfo.h>
37
38namespace PNS {
39
41 MEANDER_PLACER ( aRouter )
42{
43 // Init temporary variables (do not leave uninitialized members)
50}
51
52
56
57
58bool MEANDER_SKEW_PLACER::Start( const VECTOR2I& aP, ITEM* aStartItem )
59{
60 if( !aStartItem || !aStartItem->OfKind( ITEM::SEGMENT_T | ITEM::ARC_T) )
61 {
62 Router()->SetFailureReason( _( "Please select a differential pair track you want to tune." ) );
63 return false;
64 }
65
66 m_initialSegment = static_cast<LINKED_ITEM*>( aStartItem );
67 m_currentNode = nullptr;
69
70 m_world = Router()->GetWorld( )->Branch();
71 m_originLine = m_world->AssembleLine( m_initialSegment );
72
73 TOPOLOGY topo( m_world );
74 m_tunedPath = topo.AssembleTrivialPath( m_initialSegment, nullptr, true );
75
77 {
78 Router()->SetFailureReason( _( "Unable to find complementary differential pair "
79 "net for skew tuning. Make sure the names of the nets belonging "
80 "to a differential pair end with either _N/_P or +/-." ) );
81 return false;
82 }
83
84 if( m_originPair.Gap() < 0 )
85 m_originPair.SetGap( Router()->Sizes().DiffPairGap() );
86
87 if( !m_originPair.PLine().SegmentCount() ||
88 !m_originPair.NLine().SegmentCount() )
89 return false;
90
91 m_tunedPathP = topo.AssembleTuningPath( Router()->GetInterface(), m_originPair.PLine().GetLink( 0 ), &m_startPad_p,
92 &m_endPad_p );
93
96
97 if( m_startPad_p )
98 {
99 m_padToDieLengthP += m_startPad_p->GetPadToDie();
100 m_padToDieDelayP += m_startPad_p->GetPadToDieDelay();
101 }
102
103 if( m_endPad_p )
104 {
105 m_padToDieLengthP += m_endPad_p->GetPadToDie();
106 m_padToDieDelayP += m_endPad_p->GetPadToDieDelay();
107 }
108
109 m_tunedPathN = topo.AssembleTuningPath( Router()->GetInterface(), m_originPair.NLine().GetLink( 0 ), &m_startPad_n,
110 &m_endPad_n );
111
114
115 if( m_startPad_n )
116 {
117 m_padToDieLengthN += m_startPad_n->GetPadToDie();
118 m_padToDieDelayN += m_startPad_n->GetPadToDieDelay();
119 }
120
121 if( m_endPad_n )
122 {
123 m_padToDieLengthN += m_endPad_n->GetPadToDie();
124 m_padToDieDelayN += m_endPad_n->GetPadToDieDelay();
125 }
126
127 m_world->Remove( m_originLine );
128
130 m_currentEnd = VECTOR2I( 0, 0 );
131
132 const BOARD_CONNECTED_ITEM* conItem = static_cast<BOARD_CONNECTED_ITEM*>( aStartItem->GetSourceItem() );
133 m_netClass = conItem->GetEffectiveNetClass();
134 m_settings.m_netClass = m_netClass;
135
136 bool pIsActive = ( m_originPair.NetP() == m_originLine.Net() );
141
142 // Query interface for aggregate chain contribution (other nets in same chain)
143 long long int extraSignalLen = 0;
144 long long int extraSignalDelay = 0;
146 extraSignalLen, extraSignalDelay );
147
148 if( pIsActive )
149 {
150 m_coupledLength = lenN + extraSignalLen;
151 m_lastLength = lenP + extraSignalLen;
152 m_coupledDelay = delayN + extraSignalDelay;
153 m_lastDelay = delayP + extraSignalDelay;
155 }
156 else
157 {
158 m_coupledLength = lenP + extraSignalLen;
159 m_lastLength = lenN + extraSignalLen;
160 m_coupledDelay = delayP + extraSignalDelay;
161 m_lastDelay = delayN + extraSignalDelay;
163 }
164
166 m_baselineDelay = m_settings.m_isTimeDomain ? origPathDelay() : 0;
167
169
171
172 return true;
173}
174
175
183
184
192
193
195{
196 return m_lastLength - m_coupledLength; // Includes aggregate chain contribution if applicable
197}
198
199
200bool MEANDER_SKEW_PLACER::Move( const VECTOR2I& aP, ITEM* aEndItem )
201{
203
204 bool isPositive = m_originPair.NetP() == m_originLine.Net();
205
206 for( const ITEM* item : m_tunedPathP.CItems() )
207 {
208 if( const LINE* l = dyn_cast<const LINE*>( item ) )
209 {
210 PNS_DBG( Dbg(), AddItem, l, BLUE, 10000, wxT( "tuned-path-skew-p" ) );
211
212 m_router->GetInterface()->DisplayPathLine( l->CLine(), isPositive ? 1 : 0 );
213 }
214 }
215
216 for( const ITEM* item : m_tunedPathN.CItems() )
217 {
218 if( const LINE* l = dyn_cast<const LINE*>( item ) )
219 {
220 PNS_DBG( Dbg(), AddItem, l, YELLOW, 10000, wxT( "tuned-path-skew-n" ) );
221
222 m_router->GetInterface()->DisplayPathLine( l->CLine(), isPositive ? 0 : 1 );
223 }
224 }
225
226 // Convert the user-facing skew target (active total minus coupled total) into a meander-only
227 // doMove target. m_coupledLength already includes the chain-extras aggregate captured at
228 // Start(); the chain extras and any unmeasured stub on the active net are absorbed by the
229 // chain rather than by the meander, so subtract them here. Without this, the meander
230 // over-corrects by exactly chainNarrowingOffset() whenever the diff pair belongs to a chain.
231 const long long offset = chainNarrowingOffset();
232
233 return doMove( aP, aEndItem, m_coupledLength + m_settings.m_targetSkew.Opt() - offset,
234 m_coupledLength + m_settings.m_targetSkew.Min() - offset,
235 m_coupledLength + m_settings.m_targetSkew.Max() - offset );
236}
237
238
240{
242}
243
244
249
250
252{
253 auto calculateTargetSkew = [this]( const int64_t targetSkewDelay )
254 {
255 const int64_t curSkewDelay = m_lastDelay - m_coupledDelay;
256 const int64_t skewDelayDifference = targetSkewDelay - curSkewDelay;
257
258 int64_t skewLengthDiff = m_router->GetInterface()->CalculateLengthForDelay(
259 std::abs( skewDelayDifference ), m_originPair.Width(), true, m_originPair.Gap(),
260 m_router->GetCurrentLayer(), m_netClass );
261
262 const int64_t curSkew = CurrentSkew();
263 skewLengthDiff = skewDelayDifference > 0 ? skewLengthDiff : -skewLengthDiff;
264
265 return static_cast<int>( curSkew + skewLengthDiff );
266 };
267
268 if( m_settings.m_isTimeDomain )
269 {
270 const int minSkew = calculateTargetSkew( m_settings.m_targetSkewDelay.Min() );
271 m_settings.m_targetSkew.SetMin( static_cast<int>( minSkew ) );
272
273 const int optSkew = calculateTargetSkew( m_settings.m_targetSkewDelay.Opt() );
274 m_settings.m_targetSkew.SetOpt( static_cast<int>( optSkew ) );
275
276 const int maxSkew = calculateTargetSkew( m_settings.m_targetSkewDelay.Max() );
277 m_settings.m_targetSkew.SetMax( static_cast<int>( maxSkew ) );
278 }
279}
280}
A base class derived from BOARD_ITEM for items that can be connected and have a net,...
virtual NETCLASS * GetEffectiveNetClass() const
Return the NETCLASS for this item.
ROUTER * Router() const
Return current router settings.
ROUTER * m_router
DEBUG_DECORATOR * Dbg() const
Base class for PNS router board items.
Definition pns_item.h:98
BOARD_ITEM * GetSourceItem() const
Definition pns_item.h:202
bool OfKind(int aKindMask) const
Definition pns_item.h:181
Represents a track on a PCB, connecting two non-trivial joints (that is, vias, pads,...
Definition pns_line.h:62
long long int chainNarrowingOffset() const
Return the length offset to subtract when converting a user-facing total signal length target into a ...
int64_t m_baselineDelay
Aggregate length/delay of other nets in the same chain, cached at Start().
int m_currentWidth
Meander settings.
void initChainExtras()
Cache the per-session chain-extras length/delay (other nets in the same chain) so per-Move use does n...
MEANDER_SETTINGS m_settings
The current end point.
int64_t lineDelay(const ITEM_SET &aLine, const SOLID *aStartPad, const SOLID *aEndPad) const
Calculate the total delay of the line represented by an item set (tracks and vias)
NODE * m_world
Width of the meandered trace(s).
VECTOR2I getSnappedStartPoint(LINKED_ITEM *aStartItem, VECTOR2I aStartPoint)
long long int lineLength(const ITEM_SET &aLine, const SOLID *aStartPad, const SOLID *aEndPad) const
Calculate the total length of the line represented by an item set (tracks and vias)
bool doMove(const VECTOR2I &aP, ITEM *aEndItem, long long int aTargetLength, long long int aTargetMin, long long int aTargetMax)
LINKED_ITEM * m_initialSegment
Total length added by pad to die size.
MEANDER_PLACER(ROUTER *aRouter)
VECTOR2I m_currentStart
Current world state.
int64_t origPathDelay() const override
long long int origPathLength() const override
bool Move(const VECTOR2I &aP, ITEM *aEndItem) override
Function Move()
bool Start(const VECTOR2I &aP, ITEM *aStartItem) override
Function Start()
long long int TuningLengthResult() const override
Return the resultant length or skew of the tuned traces.
void calculateTimeDomainTargets() override
current routing start point (end of tail, beginning of head)
int64_t TuningDelayResult() const override
Return the resultant delay or skew of the tuned traces.
NODE * Branch()
Create a lightweight copy (called branch) of self that tracks the changes (added/removed items) wrs t...
Definition pns_node.cpp:157
virtual bool GetSignalAggregate(NET_HANDLE aNetP, NET_HANDLE aNetN, long long &aExtraLength, long long &aExtraDelay) const =0
ROUTER_IFACE * GetInterface() const
Definition pns_router.h:240
void SetFailureReason(const wxString &aReason)
Definition pns_router.h:235
NODE * GetWorld() const
Definition pns_router.h:186
const DIFF_PAIR AssembleDiffPair(SEGMENT *aStart)
const ITEM_SET AssembleTuningPath(ROUTER_IFACE *aRouterIface, ITEM *aStart, SOLID **aStartPad=nullptr, SOLID **aEndPad=nullptr)
Like AssembleTrivialPath, but follows the track length algorithm, which discards segments that are fu...
const ITEM_SET AssembleTrivialPath(ITEM *aStart, std::pair< const JOINT *, const JOINT * > *aTerminalJoints=nullptr, bool aFollowLockedSegments=false)
Assemble a trivial path between two joints given a starting item.
@ BLUE
Definition color4d.h:56
@ YELLOW
Definition color4d.h:67
#define _(s)
Push and Shove diff pair dimensions (gap) settings dialog.
EDA_ANGLE abs(const EDA_ANGLE &aAngle)
Definition eda_angle.h:400
#define PNS_DBG(dbg, method,...)
Casted dyn_cast(From aObject)
A lightweight dynamic downcast.
Definition typeinfo.h:60
VECTOR2< int32_t > VECTOR2I
Definition vector2d.h:687