1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331
|
/***************************************************************************
* This file is part of KDevelop *
* Copyright 2007 Andreas Pakulat <apaku@gmx.de> *
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU Library 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 Library General Public *
* License along with this program; if not, write to the *
* Free Software Foundation, Inc., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
***************************************************************************/
#include "makeoutputmodel.h"
#include <QFileInfo>
#include <QFont>
#include <ktexteditor/cursor.h>
#include <kurl.h>
#include <kglobalsettings.h>
#include <kdebug.h>
#include <klocale.h>
#include <interfaces/icore.h>
#include <interfaces/idocumentcontroller.h>
#include "outputfilters.h"
FilteredItem::FilteredItem(const QString& line)
: originalLine( line )
, type( QVariant::fromValue( MakeOutputModel::StandardItem ) )
, shortenedText( line )
, isActivatable(false)
, lineNo(-1)
, columnNo(-1)
{
kDebug() << "created item with type:" << type << type.value<MakeOutputModel::OutputItemType>();
}
const int MakeOutputModel::MakeItemTypeRole = Qt::UserRole + 1;
MakeOutputModel::MakeOutputModel( const KUrl& builddir, QObject* parent )
: QAbstractListModel(parent), buildDir( builddir )
{
}
QVariant MakeOutputModel::data( const QModelIndex& idx, int role ) const
{
if( isValidIndex(idx) )
{
switch( role )
{
case Qt::DisplayRole:
return items.at( idx.row() ).shortenedText;
break;
case MakeOutputModel::MakeItemTypeRole:
return items.at( idx.row() ).type;
break;
case Qt::FontRole:
return KGlobalSettings::fixedFont();
break;
default:
break;
}
}
return QVariant();
}
int MakeOutputModel::rowCount( const QModelIndex& parent ) const
{
if( !parent.isValid() )
return items.count();
return 0;
}
QVariant MakeOutputModel::headerData( int, Qt::Orientation, int ) const
{
return QVariant();
}
bool MakeOutputModel::isValidIndex( const QModelIndex& idx ) const
{
return ( idx.isValid() && idx.row() >= 0 && idx.row() < rowCount() && idx.column() == 0 );
}
void MakeOutputModel::activate( const QModelIndex& index )
{
if( index.model() != this || !isValidIndex(index) )
{
kDebug(9037) << "not my model, returning";
return;
}
kDebug(9037) << "Model activated" << index.row();
FilteredItem item = items.at( index.row() );
if( item.isActivatable )
{
kDebug() << "activating:" << item.lineNo << item.url;
KTextEditor::Cursor range( item.lineNo, item.columnNo );
KDevelop::IDocumentController *docCtrl = KDevelop::ICore::self()->documentController();
docCtrl->openDocument( item.url, range );
} else
{
kDebug() << "not an activateable item";
}
}
QModelIndex MakeOutputModel::nextHighlightIndex( const QModelIndex ¤tIdx )
{
int startrow = isValidIndex(currentIdx) ? currentIdx.row() + 1 : 0;
if( !errorItems.empty() )
{
kDebug() << "searching next error";
// Jump to the next error item
std::set< int >::const_iterator next = errorItems.lower_bound( startrow );
if( next == errorItems.end() )
next = errorItems.begin();
return index( *next, 0, QModelIndex() );
}
for( int row = 0; row < rowCount(); ++row )
{
int currow = (startrow + row) % rowCount();
if( items.at( currow ).isActivatable )
{
return index( currow, 0, QModelIndex() );
}
}
return QModelIndex();
}
QModelIndex MakeOutputModel::previousHighlightIndex( const QModelIndex ¤tIdx )
{
//We have to ensure that startrow is >= rowCount - 1 to get a positive value from the % operation.
int startrow = rowCount() + (isValidIndex(currentIdx) ? currentIdx.row() : rowCount()) - 1;
if(!errorItems.empty())
{
kDebug() << "searching previous error";
// Jump to the previous error item
std::set< int >::const_iterator previous = errorItems.lower_bound( currentIdx.row() );
if( previous == errorItems.begin() )
previous = errorItems.end();
--previous;
return index( *previous, 0, QModelIndex() );
}
for ( int row = 0; row < rowCount(); ++row )
{
int currow = (startrow - row) % rowCount();
if( items.at( currow ).isActivatable )
{
return index( currow, 0, QModelIndex() );
}
}
return QModelIndex();
}
KUrl MakeOutputModel::urlForFile( const QString& filename ) const
{
QFileInfo fi(filename);
KUrl u;
if( fi.isRelative() )
{
if( currentDirs.isEmpty() )
{
u = buildDir;
u.addPath( filename );
return u;
}
QLinkedList<QString>::const_iterator it = currentDirs.constEnd() - 1;
do {
u = KUrl( *it );
u.addPath( filename );
} while( (it-- != currentDirs.constBegin()) && !QFileInfo(u.toLocalFile()).exists() );
return u;
} else
{
u = KUrl( filename );
}
return u;
}
void MakeOutputModel::addLines( const QStringList& lines )
{
if( lines.isEmpty() )
return;
lineBuffer << lines;
QMetaObject::invokeMethod(this, "addLineBatch", Qt::QueuedConnection);
}
void MakeOutputModel::addLineBatch()
{
// only add this many lines in one batch, then return to the event loop
// this prevents overly long UI lockup and is simple enough to implement
const int maxLines = 50;
const int linesInBatch = qMin(lineBuffer.count(), maxLines);
beginInsertRows( QModelIndex(), rowCount(), rowCount() + linesInBatch - 1);
for(int i = 0; i < linesInBatch; ++i) {
const QString line = lineBuffer.dequeue();
FilteredItem item( line );
bool matched = false;
OutputItemType itemType = StandardItem;
foreach( const ErrorFormat& errFormat, ErrorFormat::errorFormats )
{
QRegExp regEx = errFormat.expression;
if( regEx.indexIn( line ) != -1 && !( line.contains( "Each undeclared identifier is reported only once" ) || line.contains( "for each function it appears in." ) ) )
{
kDebug() << "found an error:" << line;
item.url = urlForFile( regEx.cap( errFormat.fileGroup ) );
item.lineNo = regEx.cap( errFormat.lineGroup ).toInt() - 1;
if(errFormat.columnGroup>=0)
item.columnNo = regEx.cap( errFormat.columnGroup ).toInt() - 1;
else
item.columnNo = 0;
//item.shortenedText = regEx.cap( errFormat.textGroup );
QString txt = regEx.cap(errFormat.textGroup);
if(txt.contains("error", Qt::CaseInsensitive))
itemType = ErrorItem;
if(txt.contains("warning", Qt::CaseInsensitive))
itemType = WarningItem;
if(txt.contains("note", Qt::CaseInsensitive))
itemType = InformationItem;
// Make the item clickable if it comes with the necessary file & line number information
if (errFormat.fileGroup > 0 && errFormat.lineGroup > 0)
item.isActivatable = true;
matched = true;
break;
}
}
if( !matched )
{
foreach( const ActionFormat& actFormat, ActionFormat::actionFormats )
{
QRegExp regEx = actFormat.expression;
if( regEx.indexIn( line ) != -1 )
{
kDebug() << "found an action" << line << actFormat.tool << actFormat.toolGroup << actFormat.fileGroup;
itemType = MakeOutputModel::ActionItem;
if( actFormat.fileGroup != -1 && actFormat.toolGroup != -1 )
{
item.shortenedText = QString( "%1 %2 (%3)").arg( actFormat.action ).arg( regEx.cap( actFormat.fileGroup ) ).arg( regEx.cap( actFormat.toolGroup ) );
}
if( actFormat.action == "cd" )
{
QLinkedList<QString>::iterator pos = currentDirs.insert( currentDirs.end(), regEx.cap( actFormat.fileGroup ) );
positionInCurrentDirs.insert( regEx.cap( actFormat.fileGroup ) , pos );
}
// Special case for cmake: we parse the "Compiling <objectfile>" expression
// and use it to find out about the build paths encountered during a build.
// They are later searched by urlForFile to find source files corresponding to
// compiler errors.
if ( actFormat.action == i18n("compiling") && actFormat.tool == "cmake")
{
KUrl url = buildDir;
url.addPath(regEx.cap( actFormat.fileGroup ));
QString dirName = url.toLocalFile();
// Use map to check for duplicates, to avoid O(n^2) behaviour
PositionMap::iterator it = positionInCurrentDirs.find(dirName);
// Encountered new build directory?
if (it == positionInCurrentDirs.end())
{
QLinkedList<QString>::iterator pos = currentDirs.insert( currentDirs.end(), dirName );
positionInCurrentDirs.insert( dirName, pos );
}
else
{
// Build dir already in currentDirs, but move it to back of currentDirs list
// (this gives us most-recently-used semantics in urlForFile)
currentDirs.erase(it.value());
QLinkedList<QString>::iterator pos = currentDirs.insert( currentDirs.end(), dirName );
it.value() = pos;
}
}
matched = true;
break;
}
}
}
item.type = QVariant::fromValue( itemType );
kDebug() << "adding item:" << item.shortenedText << itemType;
if( itemType == ErrorItem )
errorItems.insert(items.size());
items << item;
}
endInsertRows();
if (!lineBuffer.isEmpty()) {
QMetaObject::invokeMethod(this, "addLineBatch", Qt::QueuedConnection);
}
}
void MakeOutputModel::addLine( const QString& l )
{
addLines( QStringList() << l );
}
#include "makeoutputmodel.moc"
|