forked from qt-creator/qt-creator
		
	Change-Id: Ib5423fdd064e4546f848c0b640b0ed0514c26d3a Reviewed-by: Leena Miettinen <riitta-leena.miettinen@digia.com> Reviewed-by: Kai Koehne <kai.koehne@digia.com>
		
			
				
	
	
		
			91 lines
		
	
	
		
			2.9 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
			
		
		
	
	
			91 lines
		
	
	
		
			2.9 KiB
		
	
	
	
		
			C++
		
	
	
	
	
	
/****************************************************************************
 | 
						|
**
 | 
						|
** Copyright (C) 2014 Digia Plc and/or its subsidiary(-ies).
 | 
						|
** Contact: http://www.qt-project.org/legal
 | 
						|
**
 | 
						|
** This file is part of Qt Creator.
 | 
						|
**
 | 
						|
** Commercial License Usage
 | 
						|
** Licensees holding valid commercial Qt licenses may use this file in
 | 
						|
** accordance with the commercial license agreement provided with the
 | 
						|
** Software or, alternatively, in accordance with the terms contained in
 | 
						|
** a written agreement between you and Digia.  For licensing terms and
 | 
						|
** conditions see http://qt.digia.com/licensing.  For further information
 | 
						|
** use the contact form at http://qt.digia.com/contact-us.
 | 
						|
**
 | 
						|
** GNU Lesser General Public License Usage
 | 
						|
** Alternatively, 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, Digia gives you certain additional
 | 
						|
** rights.  These rights are described in the Digia Qt LGPL Exception
 | 
						|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
 | 
						|
**
 | 
						|
****************************************************************************/
 | 
						|
 | 
						|
#include "ASTPath.h"
 | 
						|
 | 
						|
#include <cplusplus/AST.h>
 | 
						|
#include <cplusplus/TranslationUnit.h>
 | 
						|
 | 
						|
#ifdef WITH_AST_PATH_DUMP
 | 
						|
#  include <QDebug>
 | 
						|
#  include <typeinfo>
 | 
						|
#endif // WITH_AST_PATH_DUMP
 | 
						|
 | 
						|
using namespace CPlusPlus;
 | 
						|
 | 
						|
QList<AST *> ASTPath::operator()(int line, int column)
 | 
						|
{
 | 
						|
    _nodes.clear();
 | 
						|
    _line = line;
 | 
						|
    _column = column;
 | 
						|
 | 
						|
    if (_doc) {
 | 
						|
        if (TranslationUnit *unit = _doc->translationUnit())
 | 
						|
            accept(unit->ast());
 | 
						|
    }
 | 
						|
 | 
						|
    return _nodes;
 | 
						|
}
 | 
						|
 | 
						|
#ifdef WITH_AST_PATH_DUMP
 | 
						|
void ASTPath::dump(const QList<AST *> nodes)
 | 
						|
{
 | 
						|
    qDebug() << "ASTPath dump," << nodes.size() << "nodes:";
 | 
						|
    for (int i = 0; i < nodes.size(); ++i)
 | 
						|
        qDebug() << qPrintable(QString(i + 1, QLatin1Char('-'))) << typeid(*nodes.at(i)).name();
 | 
						|
}
 | 
						|
#endif // WITH_AST_PATH_DUMP
 | 
						|
 | 
						|
bool ASTPath::preVisit(AST *ast)
 | 
						|
{
 | 
						|
    unsigned firstToken = ast->firstToken();
 | 
						|
    unsigned lastToken = ast->lastToken();
 | 
						|
 | 
						|
    if (firstToken > 0) {
 | 
						|
        if (lastToken <= firstToken)
 | 
						|
            return false;
 | 
						|
 | 
						|
        unsigned startLine, startColumn;
 | 
						|
        getTokenStartPosition(firstToken, &startLine, &startColumn);
 | 
						|
 | 
						|
        if (_line > startLine || (_line == startLine && _column >= startColumn)) {
 | 
						|
 | 
						|
            unsigned endLine, endColumn;
 | 
						|
            getTokenEndPosition(lastToken - 1, &endLine, &endColumn);
 | 
						|
 | 
						|
            if (_line < endLine || (_line == endLine && _column <= endColumn)) {
 | 
						|
                _nodes.append(ast);
 | 
						|
                return true;
 | 
						|
            }
 | 
						|
        }
 | 
						|
    }
 | 
						|
 | 
						|
    return false;
 | 
						|
}
 |