forked from qt-creator/qt-creator
		
	Getting the #include directives ready for Qt5. This includes the new-project wizards. Change-Id: Ia9261f1e8faec06b9285b694d2b7e9a095978d2b Reviewed-by: Eike Ziller <eike.ziller@nokia.com>
		
			
				
	
	
		
			158 lines
		
	
	
		
			4.5 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			158 lines
		
	
	
		
			4.5 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
| /**************************************************************************
 | |
| **
 | |
| ** This file is part of Qt Creator
 | |
| **
 | |
| ** Copyright (c) 2012 Nokia Corporation and/or its subsidiary(-ies).
 | |
| **
 | |
| ** Contact: Nokia Corporation (qt-info@nokia.com)
 | |
| **
 | |
| **
 | |
| ** GNU Lesser General Public License Usage
 | |
| **
 | |
| ** This file may be used under the terms of the GNU Lesser General Public
 | |
| ** License version 2.1 as published by the Free Software Foundation and
 | |
| ** appearing in the file LICENSE.LGPL included in the packaging of this file.
 | |
| ** Please review the following information to ensure the GNU Lesser General
 | |
| ** Public License version 2.1 requirements will be met:
 | |
| ** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
 | |
| **
 | |
| ** In addition, as a special exception, Nokia gives you certain additional
 | |
| ** rights. These rights are described in the Nokia Qt LGPL Exception
 | |
| ** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
 | |
| **
 | |
| ** Other Usage
 | |
| **
 | |
| ** Alternatively, this file may be used in accordance with the terms and
 | |
| ** conditions contained in a signed written agreement between you and Nokia.
 | |
| **
 | |
| ** If you have questions regarding the use of this file, please contact
 | |
| ** Nokia at qt-info@nokia.com.
 | |
| **
 | |
| **************************************************************************/
 | |
| 
 | |
| #include "DependencyTable.h"
 | |
| #include "CppDocument.h"
 | |
| 
 | |
| #include <QDebug>
 | |
| 
 | |
| using namespace CPlusPlus;
 | |
| 
 | |
| QStringList DependencyTable::filesDependingOn(const QString &fileName) const
 | |
| {
 | |
|     int index = fileIndex.value(fileName, -1);
 | |
|     if (index == -1) {
 | |
|         qWarning() << fileName << "not in the snapshot";
 | |
|         return QStringList();
 | |
|     }
 | |
| 
 | |
|     QStringList deps;
 | |
|     for (int i = 0; i < files.size(); ++i) {
 | |
|         const QBitArray &bits = includeMap.at(i);
 | |
| 
 | |
|         if (bits.testBit(index))
 | |
|             deps.append(files.at(i));
 | |
|     }
 | |
| 
 | |
|     return deps;
 | |
| }
 | |
| 
 | |
| QHash<QString, QStringList> DependencyTable::dependencyTable() const
 | |
| {
 | |
|     QHash<QString, QStringList> depMap;
 | |
| 
 | |
|     for (int index = 0; index < files.size(); ++index) {
 | |
|         QStringList deps;
 | |
|         for (int i = 0; i < files.size(); ++i) {
 | |
|             const QBitArray &bits = includeMap.at(i);
 | |
| 
 | |
|             if (bits.testBit(index))
 | |
|                 deps.append(files.at(i));
 | |
|         }
 | |
|         depMap[files.at(index)] = deps;
 | |
|     }
 | |
| 
 | |
|     return depMap;
 | |
| }
 | |
| 
 | |
| bool DependencyTable::isValidFor(const Snapshot &snapshot) const
 | |
| {
 | |
|     const int documentCount = snapshot.size();
 | |
|     if (documentCount != files.size())
 | |
|         return false;
 | |
| 
 | |
|     for (Snapshot::const_iterator it = snapshot.begin(); it != snapshot.end(); ++it) {
 | |
|         QHash<QString, QStringList>::const_iterator i = includesPerFile.find(it.key());
 | |
|         if (i == includesPerFile.end())
 | |
|             return false;
 | |
| 
 | |
|         if (i.value() != it.value()->includedFiles())
 | |
|             return false;
 | |
|     }
 | |
| 
 | |
|     return true;
 | |
| }
 | |
| 
 | |
| void DependencyTable::build(const Snapshot &snapshot)
 | |
| {
 | |
|     includesPerFile.clear();
 | |
|     files.clear();
 | |
|     fileIndex.clear();
 | |
|     includes.clear();
 | |
|     includeMap.clear();
 | |
| 
 | |
|     const int documentCount = snapshot.size();
 | |
|     files.resize(documentCount);
 | |
|     includeMap.resize(documentCount);
 | |
| 
 | |
|     int i = 0;
 | |
|     for (Snapshot::const_iterator it = snapshot.begin(); it != snapshot.end();
 | |
|             ++it, ++i) {
 | |
|         files[i] = it.key();
 | |
|         fileIndex[it.key()] = i;
 | |
|     }
 | |
| 
 | |
|     for (int i = 0; i < files.size(); ++i) {
 | |
|         const QString fileName = files.at(i);
 | |
|         if (Document::Ptr doc = snapshot.document(files.at(i))) {
 | |
|             QBitArray bitmap(files.size());
 | |
|             QList<int> directIncludes;
 | |
|             const QStringList documentIncludes = doc->includedFiles();
 | |
|             includesPerFile.insert(fileName, documentIncludes);
 | |
| 
 | |
|             foreach (const QString &includedFile, documentIncludes) {
 | |
|                 int index = fileIndex.value(includedFile);
 | |
| 
 | |
|                 if (index == -1)
 | |
|                     continue;
 | |
|                 else if (! directIncludes.contains(index))
 | |
|                     directIncludes.append(index);
 | |
| 
 | |
|                 bitmap.setBit(index, true);
 | |
|             }
 | |
| 
 | |
|             includeMap[i] = bitmap;
 | |
|             includes[i] = directIncludes;
 | |
|         }
 | |
|     }
 | |
| 
 | |
|     bool changed;
 | |
| 
 | |
|     do {
 | |
|         changed = false;
 | |
| 
 | |
|         for (int i = 0; i < files.size(); ++i) {
 | |
|             QBitArray bitmap = includeMap.value(i);
 | |
|             QBitArray previousBitmap = bitmap;
 | |
| 
 | |
|             foreach (int includedFileIndex, includes.value(i)) {
 | |
|                 bitmap |= includeMap.value(includedFileIndex);
 | |
|             }
 | |
| 
 | |
|             if (bitmap != previousBitmap) {
 | |
|                 includeMap[i] = bitmap;
 | |
|                 changed = true;
 | |
|             }
 | |
|         }
 | |
|     } while (changed);
 | |
| }
 |