/* * This program source code file is part of KiCad, a free EDA CAD application. * * Copyright (C) 2009 Jean-Pierre Charras, jaen-pierre.charras@gipsa-lab.inpg.com * Copyright (C) 2011 Wayne Stambaugh * Copyright (C) 1992-2011 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 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 */ /** * @file sch_sheet_path.cpp * @brief SCH_SHEET_PATH class implementation. */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include SCH_SHEET_PATH::SCH_SHEET_PATH() { for( int i = 0; iType() == SCH_SHEET_T ) { SCH_SHEET* sheet = (SCH_SHEET*) schitem; Push( sheet ); if( aPath == Path() ) return true; if( BuildSheetPathInfoFromSheetPathValue( aPath ) ) return true; Pop(); } schitem = schitem->Next(); } return false; } int SCH_SHEET_PATH::Cmp( const SCH_SHEET_PATH& aSheetPathToTest ) const { if( m_numSheets > aSheetPathToTest.m_numSheets ) return 1; if( m_numSheets < aSheetPathToTest.m_numSheets ) return -1; //otherwise, same number of sheets. for( unsigned i = 0; iGetTimeStamp() > aSheetPathToTest.m_sheets[i]->GetTimeStamp() ) return 1; if( m_sheets[i]->GetTimeStamp() < aSheetPathToTest.m_sheets[i]->GetTimeStamp() ) return -1; } return 0; } SCH_SHEET* SCH_SHEET_PATH::Last() const { if( m_numSheets ) return m_sheets[m_numSheets - 1]; return NULL; } SCH_SCREEN* SCH_SHEET_PATH::LastScreen() const { SCH_SHEET* lastSheet = Last(); if( lastSheet ) return lastSheet->GetScreen(); return NULL; } SCH_ITEM* SCH_SHEET_PATH::LastDrawList() const { SCH_SHEET* lastSheet = Last(); if( lastSheet && lastSheet->GetScreen() ) return lastSheet->GetScreen()->GetDrawItems(); return NULL; } SCH_ITEM* SCH_SHEET_PATH::FirstDrawList() const { SCH_ITEM* item = NULL; if( m_numSheets && m_sheets[0]->GetScreen() ) item = m_sheets[0]->GetScreen()->GetDrawItems(); /* @fixme - These lists really should be one of the boost pointer containers. This * is a brain dead hack to allow reverse iteration of EDA_ITEM linked * list. */ SCH_ITEM* lastItem = NULL; while( item ) { lastItem = item; item = item->Next(); } return lastItem; } void SCH_SHEET_PATH::Push( SCH_SHEET* aSheet ) { wxCHECK_RET( m_numSheets < DSLSZ, wxString::Format( _( "Schematic sheets can only be nested %d levels deep." ), DSLSZ ) ); m_sheets[ m_numSheets ] = aSheet; m_numSheets++; } SCH_SHEET* SCH_SHEET_PATH::Pop() { if( m_numSheets > 0 ) { m_numSheets--; return m_sheets[m_numSheets]; } return NULL; } wxString SCH_SHEET_PATH::Path() const { wxString s, t; s = wxT( "/" ); // This is the root path // start at 1 to avoid the root sheet, // which does not need to be added to the path // it's timestamp changes anyway. for( unsigned i = 1; i < m_numSheets; i++ ) { t.Printf( _( "%8.8lX/" ), (long unsigned) m_sheets[i]->GetTimeStamp() ); s = s + t; } return s; } wxString SCH_SHEET_PATH::PathHumanReadable() const { wxString s; s = wxT( "/" ); // start at 1 to avoid the root sheet, as above. for( unsigned i = 1; i< m_numSheets; i++ ) { s = s + m_sheets[i]->GetName() + wxT( "/" ); } return s; } SCH_ITEM* SCH_SHEET_PATH::FindPreviousItem( KICAD_T aType, SCH_ITEM* aLastItem, bool aWrap ) const { bool hasWrapped = false; bool firstItemFound = false; SCH_ITEM* drawItem = FirstDrawList(); while( drawItem ) { if( drawItem->Type() == aType ) { if( aLastItem == NULL || firstItemFound ) { return drawItem; } else if( !firstItemFound && drawItem == aLastItem ) { firstItemFound = true; } } drawItem = drawItem->Back(); if( drawItem == NULL && aLastItem && aWrap && !hasWrapped ) { hasWrapped = true; drawItem = FirstDrawList(); } } return NULL; } SCH_SHEET_PATH& SCH_SHEET_PATH::operator=( const SCH_SHEET_PATH& d1 ) { if( this == &d1 ) // Self assignment is bad! return *this; m_numSheets = d1.m_numSheets; unsigned i; for( i = 0; i < m_numSheets; i++ ) m_sheets[i] = d1.m_sheets[i]; for( ; i < DSLSZ; i++ ) m_sheets[i] = 0; return *this; } bool SCH_SHEET_PATH::operator==( const SCH_SHEET_PATH& d1 ) const { if( m_numSheets != d1.m_numSheets ) return false; for( unsigned i = 0; i < m_numSheets; i++ ) { if( m_sheets[i] != d1.m_sheets[i] ) return false; } return true; } bool SCH_SHEET_PATH::TestForRecursion( const wxString& aSrcFileName, const wxString& aDestFileName ) const { wxFileName rootFn = g_RootSheet->GetFileName(); wxFileName srcFn = aSrcFileName; wxFileName destFn = aDestFileName; if( srcFn.IsRelative() ) srcFn.MakeAbsolute( rootFn.GetPath() ); if( destFn.IsRelative() ) destFn.MakeAbsolute( rootFn.GetPath() ); // The source and destination sheet file names cannot be the same. if( srcFn == destFn ) return true; /// @todo Store sheet file names with full path, either relative to project path /// or absolute path. The current design always assumes subsheet files are /// located in the project folder which may or may not be desirable. unsigned i = 0; while( i < m_numSheets ) { wxFileName cmpFn = m_sheets[i]->GetFileName(); if( cmpFn.IsRelative() ) cmpFn.MakeAbsolute( rootFn.GetPath() ); // Test if the file name of the destination sheet is in anywhere in this sheet path. if( cmpFn == destFn ) break; i++; } // The destination sheet file name was not found in the sheet path or the destination // sheet file name is the root sheet so no recursion is possible. if( i >= m_numSheets || i == 0 ) return false; // Walk back up to the root sheet to see if the source file name is already a parent in // the sheet path. If so, recursion will occur. do { i -= 1; wxFileName cmpFn = m_sheets[i]->GetFileName(); if( cmpFn.IsRelative() ) cmpFn.MakeAbsolute( rootFn.GetPath() ); if( cmpFn == srcFn ) return true; } while( i != 0 ); // The source sheet file name is not a parent of the destination sheet file name. return false; } int SCH_SHEET_PATH::FindSheet( const wxString& aFileName ) const { for( unsigned i = 0; i < m_numSheets; i++ ) { if( m_sheets[i]->GetFileName().CmpNoCase( aFileName ) == 0 ) return (int)i; } return SHEET_NOT_FOUND; } SCH_SHEET* SCH_SHEET_PATH::FindSheetByName( const wxString& aSheetName ) { for( unsigned i = 0; i < m_numSheets; i++ ) { if( m_sheets[i]->GetName().CmpNoCase( aSheetName ) == 0 ) return m_sheets[i]; } return NULL; } /********************************************************************/ /* Class SCH_SHEET_LIST to handle the list of Sheets in a hierarchy */ /********************************************************************/ SCH_SHEET_LIST::SCH_SHEET_LIST( SCH_SHEET* aSheet ) { m_index = 0; m_count = 0; m_list = NULL; m_isRootSheet = false; if( aSheet == NULL ) aSheet = g_RootSheet; BuildSheetList( aSheet ); } SCH_SHEET_PATH* SCH_SHEET_LIST::GetFirst() { m_index = 0; if( GetCount() > 0 ) return &( m_list[0] ); return NULL; } SCH_SHEET_PATH* SCH_SHEET_LIST::GetNext() { if( m_index < GetCount() ) m_index++; return GetSheet( m_index ); } SCH_SHEET_PATH* SCH_SHEET_LIST::GetLast() { if( GetCount() == 0 ) return NULL; m_index = GetCount() - 1; return GetSheet( m_index ); } SCH_SHEET_PATH* SCH_SHEET_LIST::GetPrevious() { if( m_index == 0 ) return NULL; m_index -= 1; return GetSheet( m_index ); } SCH_SHEET_PATH* SCH_SHEET_LIST::GetSheet( int aIndex ) const { if( aIndex < GetCount() ) return &( m_list[aIndex] ); return NULL; } SCH_SHEET_PATH* SCH_SHEET_LIST::GetSheetByPath( const wxString aPath, bool aHumanReadable ) { SCH_SHEET_PATH* sheet = GetFirst(); wxString sheetPath; while( sheet ) { sheetPath = ( aHumanReadable ) ? sheet->PathHumanReadable() : sheet->Path(); if( sheetPath == aPath ) return sheet; sheet = GetNext(); } return NULL; } void SCH_SHEET_LIST::BuildSheetList( SCH_SHEET* aSheet ) { wxCHECK_RET( aSheet != NULL, wxT( "Cannot build sheet list from undefined sheet." ) ); if( aSheet == g_RootSheet ) m_isRootSheet = true; if( m_list == NULL ) { int count = aSheet->CountSheets(); m_count = count; m_index = 0; m_list = new SCH_SHEET_PATH[ count ]; m_currList.Clear(); } m_currList.Push( aSheet ); m_list[m_index] = m_currList; m_index++; if( aSheet->GetScreen() ) { EDA_ITEM* strct = m_currList.LastDrawList(); while( strct ) { if( strct->Type() == SCH_SHEET_T ) { SCH_SHEET* sheet = (SCH_SHEET*) strct; BuildSheetList( sheet ); } strct = strct->Next(); } } m_currList.Pop(); } SCH_ITEM* SCH_SHEET_LIST::FindNextItem( KICAD_T aType, SCH_SHEET_PATH** aSheetFoundIn, SCH_ITEM* aLastItem, bool aWrap ) { bool hasWrapped = false; bool firstItemFound = false; SCH_ITEM* drawItem = NULL; SCH_SHEET_PATH* sheet = GetFirst(); while( sheet ) { drawItem = sheet->LastDrawList(); while( drawItem ) { if( drawItem->Type() == aType ) { if( aLastItem == NULL || firstItemFound ) { if( aSheetFoundIn ) *aSheetFoundIn = sheet; return drawItem; } else if( !firstItemFound && drawItem == aLastItem ) { firstItemFound = true; } } drawItem = drawItem->Next(); } sheet = GetNext(); if( sheet == NULL && aLastItem && aWrap && !hasWrapped ) { hasWrapped = true; sheet = GetFirst(); } } return NULL; } SCH_ITEM* SCH_SHEET_LIST::FindPreviousItem( KICAD_T aType, SCH_SHEET_PATH** aSheetFoundIn, SCH_ITEM* aLastItem, bool aWrap ) { bool hasWrapped = false; bool firstItemFound = false; SCH_ITEM* drawItem = NULL; SCH_SHEET_PATH* sheet = GetLast(); while( sheet ) { drawItem = sheet->FirstDrawList(); while( drawItem ) { if( drawItem->Type() == aType ) { if( aLastItem == NULL || firstItemFound ) { if( aSheetFoundIn ) *aSheetFoundIn = sheet; return drawItem; } else if( !firstItemFound && drawItem == aLastItem ) { firstItemFound = true; } } drawItem = drawItem->Back(); } sheet = GetPrevious(); if( sheet == NULL && aLastItem && aWrap && !hasWrapped ) { hasWrapped = true; sheet = GetLast(); } } return NULL; } bool SCH_SHEET_LIST::TestForRecursion( const SCH_SHEET_LIST& aSrcSheetHierarchy, const wxString& aDestFileName ) const { wxFileName rootFn = g_RootSheet->GetFileName(); wxFileName destFn = aDestFileName; if( destFn.IsRelative() ) destFn.MakeAbsolute( rootFn.GetPath() ); // Test each SCH_SHEET_PATH in this SCH_SHEET_LIST for potential recursion. for( int i = 0; i < m_count; i++ ) { // Test each SCH_SHEET_PATH in the source sheet. for( int j = 0; j < aSrcSheetHierarchy.GetCount(); j++ ) { SCH_SHEET_PATH* sheetPath = aSrcSheetHierarchy.GetSheet( j ); for( unsigned k = 0; k < sheetPath->GetCount(); k++ ) { if( m_list[i].TestForRecursion( sheetPath->GetSheet( k )->GetFileName(), aDestFileName ) ) return true; } } } // The source sheet file can safely be added to the destination sheet file. return false; } SCH_SHEET* SCH_SHEET_LIST::FindSheetByName( const wxString& aSheetName ) { for( int i = 0; i < m_count; i++ ) { SCH_SHEET* sheet = m_list[i].FindSheetByName( aSheetName ); if( sheet ) return sheet; } return NULL; }