forked from qt-creator/qt-creator
By adding the expression document to the bindings object. Since ResolveExpression is always initialized with the context of a TypeOfExpression object, the symbols and names in the expression document will at least live as long as the most outer TypeOfExpression object. Done-with: Orgad Shaneh <orgads@gmail.com> Task-number: QTCREATORBUG-14253 Change-Id: Ia97c7401a2ada9a36113a04cf39e2283393421dd Reviewed-by: Orgad Shaneh <orgads@gmail.com> Reviewed-by: Nikolai Kosjar <nikolai.kosjar@theqtcompany.com>
1067 lines
34 KiB
C++
1067 lines
34 KiB
C++
/****************************************************************************
|
|
**
|
|
** Copyright (C) 2015 The Qt Company Ltd.
|
|
** Contact: http://www.qt.io/licensing
|
|
**
|
|
** 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 The Qt Company. For licensing terms and
|
|
** conditions see http://www.qt.io/terms-conditions. For further information
|
|
** use the contact form at http://www.qt.io/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 or version 3 as published by the Free
|
|
** Software Foundation and appearing in the file LICENSE.LGPLv21 and
|
|
** LICENSE.LGPLv3 included in the packaging of this file. Please review the
|
|
** following information to ensure the GNU Lesser General Public License
|
|
** requirements will be met: https://www.gnu.org/licenses/lgpl.html and
|
|
** http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
|
|
**
|
|
** In addition, as a special exception, The Qt Company gives you certain additional
|
|
** rights. These rights are described in The Qt Company LGPL Exception
|
|
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
|
|
**
|
|
****************************************************************************/
|
|
|
|
#include "ResolveExpression.h"
|
|
|
|
#include "LookupContext.h"
|
|
#include "Overview.h"
|
|
#include "CppRewriter.h"
|
|
#include "TypeOfExpression.h"
|
|
#include "TypeResolver.h"
|
|
|
|
#include <cplusplus/Control.h>
|
|
#include <cplusplus/AST.h>
|
|
#include <cplusplus/Scope.h>
|
|
#include <cplusplus/Names.h>
|
|
#include <cplusplus/Symbols.h>
|
|
#include <cplusplus/Literals.h>
|
|
#include <cplusplus/CoreTypes.h>
|
|
#include <cplusplus/TypeVisitor.h>
|
|
#include <cplusplus/NameVisitor.h>
|
|
#include <cplusplus/Templates.h>
|
|
|
|
#include <QList>
|
|
#include <QDebug>
|
|
#include <QSet>
|
|
|
|
#include <map>
|
|
|
|
using namespace CPlusPlus;
|
|
|
|
static const bool debug = ! qgetenv("QTC_LOOKUPCONTEXT_DEBUG").isEmpty();
|
|
|
|
namespace {
|
|
|
|
template <typename T>
|
|
static QList<T> removeDuplicates(const QList<T> &results)
|
|
{
|
|
QList<T> uniqueList;
|
|
QSet<T> processed;
|
|
foreach (const T &r, results) {
|
|
if (processed.contains(r))
|
|
continue;
|
|
|
|
processed.insert(r);
|
|
uniqueList.append(r);
|
|
}
|
|
|
|
return uniqueList;
|
|
}
|
|
|
|
static int evaluateFunctionArgument(const FullySpecifiedType &actualTy,
|
|
const FullySpecifiedType &formalTy)
|
|
{
|
|
int score = 0;
|
|
if (actualTy.type()->match(formalTy.type())) {
|
|
++score;
|
|
if (actualTy.isConst() == formalTy.isConst())
|
|
++score;
|
|
} else if (actualTy.simplified().type()->match(formalTy.simplified().type())) {
|
|
++score;
|
|
if (actualTy.simplified().isConst() == formalTy.simplified().isConst())
|
|
++score;
|
|
} else {
|
|
PointerType *actualAsPointer = actualTy.type()->asPointerType();
|
|
PointerType *formalAsPointer = formalTy.type()->asPointerType();
|
|
|
|
if (actualAsPointer && formalAsPointer) {
|
|
FullySpecifiedType actualElementType = actualAsPointer->elementType();
|
|
FullySpecifiedType formalElementType = formalAsPointer->elementType();
|
|
if (actualElementType.type()->match(formalElementType.type())) {
|
|
++score;
|
|
if (actualElementType.isConst() == formalElementType.isConst())
|
|
++score;
|
|
}
|
|
}
|
|
}
|
|
|
|
return score;
|
|
}
|
|
|
|
} // end of anonymous namespace
|
|
|
|
/////////////////////////////////////////////////////////////////////
|
|
// ResolveExpression
|
|
/////////////////////////////////////////////////////////////////////
|
|
ResolveExpression::ResolveExpression(const LookupContext &context,
|
|
const QSet<const Declaration *> &autoDeclarationsBeingResolved)
|
|
: ASTVisitor(context.expressionDocument()->translationUnit()),
|
|
_scope(0),
|
|
_context(context),
|
|
bind(context.expressionDocument()->translationUnit()),
|
|
_autoDeclarationsBeingResolved(autoDeclarationsBeingResolved),
|
|
_reference(false)
|
|
{ }
|
|
|
|
ResolveExpression::~ResolveExpression()
|
|
{ }
|
|
|
|
QList<LookupItem> ResolveExpression::operator()(ExpressionAST *ast, Scope *scope)
|
|
{ return resolve(ast, scope); }
|
|
|
|
QList<LookupItem> ResolveExpression::reference(ExpressionAST *ast, Scope *scope)
|
|
{ return resolve(ast, scope, true); }
|
|
|
|
QList<LookupItem> ResolveExpression::resolve(ExpressionAST *ast, Scope *scope, bool ref)
|
|
{
|
|
if (! scope)
|
|
return QList<LookupItem>();
|
|
|
|
std::swap(_scope, scope);
|
|
std::swap(_reference, ref);
|
|
|
|
const QList<LookupItem> result = expression(ast);
|
|
|
|
std::swap(_reference, ref);
|
|
std::swap(_scope, scope);
|
|
|
|
return result;
|
|
}
|
|
|
|
QList<LookupItem> ResolveExpression::expression(ExpressionAST *ast)
|
|
{
|
|
const QList<LookupItem> previousResults = switchResults(QList<LookupItem>());
|
|
accept(ast);
|
|
return removeDuplicates(switchResults(previousResults));
|
|
}
|
|
|
|
QList<LookupItem> ResolveExpression::switchResults(const QList<LookupItem> &results)
|
|
{
|
|
const QList<LookupItem> previousResults = _results;
|
|
_results = results;
|
|
return previousResults;
|
|
}
|
|
|
|
void ResolveExpression::addResults(const QList<Symbol *> &symbols)
|
|
{
|
|
foreach (Symbol *symbol, symbols) {
|
|
LookupItem item;
|
|
item.setType(symbol->type());
|
|
item.setScope(symbol->enclosingScope());
|
|
item.setDeclaration(symbol);
|
|
_results.append(item);
|
|
}
|
|
}
|
|
|
|
void ResolveExpression::addResults(const QList<LookupItem> &items)
|
|
{
|
|
_results += items;
|
|
}
|
|
|
|
void ResolveExpression::addResult(const FullySpecifiedType &ty, Scope *scope,
|
|
LookupScope *binding)
|
|
{
|
|
LookupItem item;
|
|
item.setType(ty);
|
|
item.setScope(scope);
|
|
item.setBinding(binding);
|
|
|
|
_results.append(item);
|
|
}
|
|
|
|
bool ResolveExpression::visit(IdExpressionAST *ast)
|
|
{
|
|
accept(ast->name);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(BinaryExpressionAST *ast)
|
|
{
|
|
if (tokenKind(ast->binary_op_token) == T_COMMA && ast->right_expression && ast->right_expression->asQtMethod() != 0) {
|
|
|
|
if (ast->left_expression && ast->left_expression->asQtMethod() != 0)
|
|
thisObject();
|
|
else
|
|
accept(ast->left_expression);
|
|
|
|
QtMethodAST *qtMethod = ast->right_expression->asQtMethod();
|
|
if (DeclaratorAST *d = qtMethod->declarator) {
|
|
if (d->core_declarator) {
|
|
if (DeclaratorIdAST *declaratorId = d->core_declarator->asDeclaratorId()) {
|
|
if (NameAST *nameAST = declaratorId->name) {
|
|
if (LookupScope *binding = baseExpression(_results, T_ARROW)) {
|
|
_results.clear();
|
|
addResults(binding->lookup(nameAST->name));
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
accept(ast->left_expression);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(CastExpressionAST *ast)
|
|
{
|
|
Scope *dummyScope = _context.expressionDocument()->globalNamespace();
|
|
FullySpecifiedType ty = bind(ast->type_id, dummyScope);
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ConditionAST *)
|
|
{
|
|
// nothing to do.
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ConditionalExpressionAST *ast)
|
|
{
|
|
if (ast->left_expression)
|
|
accept(ast->left_expression);
|
|
|
|
else if (ast->right_expression)
|
|
accept(ast->right_expression);
|
|
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(CppCastExpressionAST *ast)
|
|
{
|
|
Scope *dummyScope = _context.expressionDocument()->globalNamespace();
|
|
FullySpecifiedType ty = bind(ast->type_id, dummyScope);
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(DeleteExpressionAST *)
|
|
{
|
|
FullySpecifiedType ty(control()->voidType());
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ArrayInitializerAST *)
|
|
{
|
|
// nothing to do.
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(NewExpressionAST *ast)
|
|
{
|
|
if (ast->new_type_id) {
|
|
Scope *dummyScope = _context.expressionDocument()->globalNamespace();
|
|
FullySpecifiedType ty = bind(ast->new_type_id, dummyScope);
|
|
FullySpecifiedType ptrTy(control()->pointerType(ty));
|
|
addResult(ptrTy, _scope);
|
|
}
|
|
// nothing to do.
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(TypeidExpressionAST *)
|
|
{
|
|
const Name *stdName = control()->identifier("std");
|
|
const Name *tiName = control()->identifier("type_info");
|
|
const Name *q = control()->qualifiedNameId(control()->qualifiedNameId(/* :: */ 0, stdName), tiName);
|
|
|
|
FullySpecifiedType ty(control()->namedType(q));
|
|
addResult(ty, _scope);
|
|
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(TypenameCallExpressionAST *)
|
|
{
|
|
// nothing to do
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(TypeConstructorCallAST *)
|
|
{
|
|
// nothing to do.
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(SizeofExpressionAST *)
|
|
{
|
|
FullySpecifiedType ty(control()->integerType(IntegerType::Int));
|
|
ty.setUnsigned(true);
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(PointerLiteralAST *)
|
|
{
|
|
FullySpecifiedType ty(control()->integerType(IntegerType::Int)); // Handling as Int.
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(NumericLiteralAST *ast)
|
|
{
|
|
const Token &tk = tokenAt(ast->literal_token);
|
|
|
|
Type *type = 0;
|
|
bool isUnsigned = false;
|
|
|
|
if (tk.is(T_CHAR_LITERAL)) {
|
|
type = control()->integerType(IntegerType::Char);
|
|
} else if (tk.is(T_WIDE_CHAR_LITERAL)) {
|
|
type = control()->integerType(IntegerType::WideChar);
|
|
} else if (tk.is(T_UTF16_CHAR_LITERAL)) {
|
|
type = control()->integerType(IntegerType::Char16);
|
|
} else if (tk.is(T_UTF32_CHAR_LITERAL)) {
|
|
type = control()->integerType(IntegerType::Char32);
|
|
} else if (const NumericLiteral *literal = numericLiteral(ast->literal_token)) {
|
|
isUnsigned = literal->isUnsigned();
|
|
if (literal->isInt())
|
|
type = control()->integerType(IntegerType::Int);
|
|
else if (literal->isLong())
|
|
type = control()->integerType(IntegerType::Long);
|
|
else if (literal->isLongLong())
|
|
type = control()->integerType(IntegerType::LongLong);
|
|
else if (literal->isFloat())
|
|
type = control()->floatType(FloatType::Float);
|
|
else if (literal->isDouble())
|
|
type = control()->floatType(FloatType::Double);
|
|
else if (literal->isLongDouble())
|
|
type = control()->floatType(FloatType::LongDouble);
|
|
else
|
|
type = control()->integerType(IntegerType::Int);
|
|
}
|
|
|
|
FullySpecifiedType ty(type);
|
|
ty.setUnsigned(isUnsigned);
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(BoolLiteralAST *)
|
|
{
|
|
FullySpecifiedType ty(control()->integerType(IntegerType::Bool));
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ThisExpressionAST *)
|
|
{
|
|
thisObject();
|
|
return false;
|
|
}
|
|
|
|
void ResolveExpression::thisObject()
|
|
{
|
|
Scope *scope = _scope;
|
|
for (; scope; scope = scope->enclosingScope()) {
|
|
if (Function *fun = scope->asFunction()) {
|
|
if (Class *klass = scope->enclosingClass()) {
|
|
FullySpecifiedType classTy(control()->namedType(klass->name()));
|
|
FullySpecifiedType ptrTy(control()->pointerType(classTy));
|
|
addResult(ptrTy, fun->enclosingScope());
|
|
break;
|
|
} else if (const Name *name = fun->name()) {
|
|
if (const QualifiedNameId *q = name->asQualifiedNameId()) {
|
|
if (q->base()) {
|
|
FullySpecifiedType classTy(control()->namedType(q->base()));
|
|
FullySpecifiedType ptrTy(control()->pointerType(classTy));
|
|
addResult(ptrTy, fun->enclosingScope());
|
|
}
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
bool ResolveExpression::visit(CompoundExpressionAST *ast)
|
|
{
|
|
CompoundStatementAST *cStmt = ast->statement;
|
|
if (cStmt && cStmt->statement_list)
|
|
accept(cStmt->statement_list->lastValue());
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(LambdaExpressionAST *ast)
|
|
{
|
|
accept(ast->statement);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ReturnStatementAST *ast)
|
|
{
|
|
accept(ast->expression);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(NestedExpressionAST *ast)
|
|
{
|
|
accept(ast->expression);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(StringLiteralAST *ast)
|
|
{
|
|
const Token &tk = tokenAt(ast->literal_token);
|
|
int intId;
|
|
switch (tk.kind()) {
|
|
case T_WIDE_STRING_LITERAL:
|
|
intId = IntegerType::WideChar;
|
|
break;
|
|
case T_UTF16_STRING_LITERAL:
|
|
intId = IntegerType::Char16;
|
|
break;
|
|
case T_UTF32_STRING_LITERAL:
|
|
intId = IntegerType::Char32;
|
|
break;
|
|
default:
|
|
intId = IntegerType::Char;
|
|
break;
|
|
}
|
|
FullySpecifiedType charTy = control()->integerType(intId);
|
|
charTy.setConst(true);
|
|
FullySpecifiedType ty(control()->pointerType(charTy));
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ThrowExpressionAST *)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(TypeIdAST *)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(UnaryExpressionAST *ast)
|
|
{
|
|
accept(ast->expression);
|
|
unsigned unaryOp = tokenKind(ast->unary_op_token);
|
|
if (unaryOp == T_AMPER) {
|
|
QMutableListIterator<LookupItem > it(_results);
|
|
while (it.hasNext()) {
|
|
LookupItem p = it.next();
|
|
FullySpecifiedType ty = p.type();
|
|
ty.setType(control()->pointerType(ty));
|
|
p.setType(ty);
|
|
it.setValue(p);
|
|
}
|
|
} else if (unaryOp == T_STAR) {
|
|
QMutableListIterator<LookupItem > it(_results);
|
|
while (it.hasNext()) {
|
|
LookupItem p = it.next();
|
|
FullySpecifiedType ty = p.type();
|
|
NamedType *namedTy = ty->asNamedType();
|
|
if (namedTy != 0) {
|
|
const QList<LookupItem> types = _context.lookup(namedTy->name(), p.scope());
|
|
if (!types.empty())
|
|
ty = types.front().type();
|
|
}
|
|
bool added = false;
|
|
if (PointerType *ptrTy = ty->asPointerType()) {
|
|
p.setType(ptrTy->elementType());
|
|
it.setValue(p);
|
|
added = true;
|
|
} else if (namedTy != 0) {
|
|
const Name *starOp = control()->operatorNameId(OperatorNameId::StarOp);
|
|
if (LookupScope *b = _context.lookupType(namedTy->name(), p.scope(), p.binding())) {
|
|
foreach (const LookupItem &r, b->find(starOp)) {
|
|
Symbol *overload = r.declaration();
|
|
if (Function *funTy = overload->type()->asFunctionType()) {
|
|
if (maybeValidPrototype(funTy, 0)) {
|
|
FullySpecifiedType retTy = funTy->returnType().simplified();
|
|
p.setType(retTy);
|
|
p.setScope(funTy->enclosingScope());
|
|
it.setValue(p);
|
|
added = true;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (!added)
|
|
it.remove();
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(CompoundLiteralAST *ast)
|
|
{
|
|
accept(ast->type_id);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(QualifiedNameAST *ast)
|
|
{
|
|
if (const Name *name = ast->name) {
|
|
const QList<LookupItem> candidates = _context.lookup(name, _scope);
|
|
addResults(candidates);
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
namespace {
|
|
|
|
class DeduceAutoCheck : public ASTVisitor
|
|
{
|
|
public:
|
|
DeduceAutoCheck(const Identifier *id, TranslationUnit *tu)
|
|
: ASTVisitor(tu), _id(id), _block(false)
|
|
{
|
|
accept(tu->ast());
|
|
}
|
|
|
|
virtual bool preVisit(AST *)
|
|
{
|
|
if (_block)
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
virtual bool visit(SimpleNameAST *ast)
|
|
{
|
|
if (ast->name
|
|
&& ast->name->identifier()
|
|
&& strcmp(ast->name->identifier()->chars(), _id->chars()) == 0) {
|
|
_block = true;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
virtual bool visit(MemberAccessAST *ast)
|
|
{
|
|
accept(ast->base_expression);
|
|
return false;
|
|
}
|
|
|
|
const Identifier *_id;
|
|
bool _block;
|
|
};
|
|
|
|
} // namespace anonymous
|
|
|
|
bool ResolveExpression::visit(SimpleNameAST *ast)
|
|
{
|
|
QList<LookupItem> candidates = _context.lookup(ast->name, _scope);
|
|
QList<LookupItem> newCandidates;
|
|
|
|
for (QList<LookupItem>::iterator it = candidates.begin(); it != candidates.end(); ++ it) {
|
|
LookupItem& item = *it;
|
|
if (!item.type()->isUndefinedType())
|
|
continue;
|
|
|
|
if (item.declaration() == 0)
|
|
continue;
|
|
|
|
if (item.type().isAuto()) {
|
|
const Declaration *decl = item.declaration()->asDeclaration();
|
|
if (!decl)
|
|
continue;
|
|
|
|
// Stop on recursive auto declarations
|
|
if (_autoDeclarationsBeingResolved.contains(decl))
|
|
continue;
|
|
|
|
const StringLiteral *initializationString = decl->getInitializer();
|
|
if (initializationString == 0)
|
|
continue;
|
|
|
|
const QByteArray &initializer =
|
|
QByteArray::fromRawData(initializationString->chars(),
|
|
initializationString->size()).trimmed();
|
|
|
|
// Skip lambda-function initializers
|
|
if (initializer.length() > 0 && initializer[0] == '[')
|
|
continue;
|
|
|
|
TypeOfExpression exprTyper;
|
|
exprTyper.setExpandTemplates(true);
|
|
Document::Ptr doc = _context.document(QString::fromLocal8Bit(decl->fileName()));
|
|
exprTyper.init(doc, _context.snapshot(), _context.bindings(),
|
|
QSet<const Declaration* >(_autoDeclarationsBeingResolved) << decl);
|
|
|
|
Document::Ptr exprDoc =
|
|
documentForExpression(exprTyper.preprocessedExpression(initializer));
|
|
exprDoc->check();
|
|
_context.bindings()->addExpressionDocument(exprDoc);
|
|
|
|
DeduceAutoCheck deduceAuto(ast->name->identifier(), exprDoc->translationUnit());
|
|
if (deduceAuto._block)
|
|
continue;
|
|
|
|
newCandidates += exprTyper(extractExpressionAST(exprDoc), exprDoc,
|
|
decl->enclosingScope());
|
|
} else {
|
|
item.setType(item.declaration()->type());
|
|
item.setScope(item.declaration()->enclosingScope());
|
|
}
|
|
}
|
|
|
|
addResults(candidates);
|
|
addResults(newCandidates);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(TemplateIdAST *ast)
|
|
{
|
|
const QList<LookupItem> candidates = _context.lookup(ast->name, _scope);
|
|
addResults(candidates);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(DestructorNameAST *)
|
|
{
|
|
FullySpecifiedType ty(control()->voidType());
|
|
addResult(ty, _scope);
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(OperatorFunctionIdAST *)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ConversionFunctionIdAST *)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::maybeValidPrototype(Function *funTy, unsigned actualArgumentCount)
|
|
{
|
|
return funTy->maybeValidPrototype(actualArgumentCount);
|
|
}
|
|
|
|
bool ResolveExpression::visit(CallAST *ast)
|
|
{
|
|
const QList<LookupItem> baseResults = resolve(ast->base_expression, _scope);
|
|
|
|
if (ast->base_expression->asLambdaExpression()) {
|
|
_results = baseResults;
|
|
return false;
|
|
}
|
|
|
|
// Compute the types of the actual arguments.
|
|
unsigned actualArgumentCount = 0;
|
|
|
|
QList< QList<LookupItem> > arguments;
|
|
for (ExpressionListAST *exprIt = ast->expression_list; exprIt; exprIt = exprIt->next) {
|
|
if (_reference)
|
|
arguments.append(resolve(exprIt->value, _scope));
|
|
|
|
++actualArgumentCount;
|
|
}
|
|
|
|
if (_reference) {
|
|
typedef std::multimap<int, LookupItem> LookupMap;
|
|
LookupMap sortedResults;
|
|
foreach (const LookupItem &base, baseResults) {
|
|
if (Function *funTy = base.type()->asFunctionType()) {
|
|
if (! maybeValidPrototype(funTy, actualArgumentCount))
|
|
continue;
|
|
|
|
int score = 0;
|
|
|
|
for (unsigned i = 0, argc = funTy->argumentCount(); i < argc; ++i) {
|
|
const FullySpecifiedType formalTy = funTy->argumentAt(i)->type();
|
|
|
|
FullySpecifiedType actualTy;
|
|
if (i < unsigned(arguments.size())) {
|
|
const QList<LookupItem> actual = arguments.at(i);
|
|
if (actual.isEmpty())
|
|
continue;
|
|
|
|
actualTy = actual.first().type();
|
|
} else {
|
|
actualTy = formalTy;
|
|
score += 2;
|
|
continue;
|
|
}
|
|
|
|
score += evaluateFunctionArgument(actualTy, formalTy);
|
|
}
|
|
|
|
sortedResults.insert(LookupMap::value_type(-score, base));
|
|
}
|
|
}
|
|
|
|
_results.clear();
|
|
for (LookupMap::const_iterator it = sortedResults.begin(); it != sortedResults.end(); ++it)
|
|
_results.append(it->second);
|
|
if (_results.isEmpty())
|
|
_results = baseResults;
|
|
|
|
return false;
|
|
}
|
|
|
|
const Name *functionCallOp = control()->operatorNameId(OperatorNameId::FunctionCallOp);
|
|
|
|
foreach (const LookupItem &result, baseResults) {
|
|
FullySpecifiedType ty = result.type().simplified();
|
|
Scope *scope = result.scope();
|
|
|
|
if (NamedType *namedTy = ty->asNamedType()) {
|
|
if (LookupScope *b = _context.lookupType(namedTy->name(), scope)) {
|
|
foreach (const LookupItem &r, b->find(functionCallOp)) {
|
|
Symbol *overload = r.declaration();
|
|
if (Function *funTy = overload->type()->asFunctionType()) {
|
|
if (maybeValidPrototype(funTy, actualArgumentCount))
|
|
addResult(funTy->returnType().simplified(), scope);
|
|
}
|
|
}
|
|
}
|
|
|
|
} else if (Function *funTy = ty->asFunctionType()) {
|
|
if (maybeValidPrototype(funTy, actualArgumentCount))
|
|
addResult(funTy->returnType().simplified(), scope, result.binding());
|
|
|
|
} else if (Class *classTy = ty->asClassType()) {
|
|
// Constructor call
|
|
FullySpecifiedType ctorTy = control()->namedType(classTy->name());
|
|
addResult(ctorTy, scope);
|
|
} else if (Template *templateTy = ty->asTemplateType()) {
|
|
// template function
|
|
if (Symbol *declaration = templateTy->declaration()) {
|
|
if (Function *funTy = declaration->asFunction()) {
|
|
if (maybeValidPrototype(funTy, actualArgumentCount))
|
|
addResult(funTy->returnType().simplified(), scope);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ArrayAccessAST *ast)
|
|
{
|
|
const QList<LookupItem> baseResults = resolve(ast->base_expression, _scope);
|
|
const Name *arrayAccessOp = control()->operatorNameId(OperatorNameId::ArrayAccessOp);
|
|
|
|
foreach (const LookupItem &result, baseResults) {
|
|
FullySpecifiedType ty = result.type().simplified();
|
|
Scope *scope = result.scope();
|
|
|
|
TypeResolver typeResolver(*_context.bindings());
|
|
typeResolver.resolve(&ty, &scope, result.binding());
|
|
|
|
if (PointerType *ptrTy = ty->asPointerType()) {
|
|
addResult(ptrTy->elementType().simplified(), scope);
|
|
|
|
} else if (ArrayType *arrTy = ty->asArrayType()) {
|
|
addResult(arrTy->elementType().simplified(), scope);
|
|
|
|
} else if (NamedType *namedTy = ty->asNamedType()) {
|
|
if (LookupScope *b = _context.lookupType(namedTy->name(), scope)) {
|
|
foreach (const LookupItem &r, b->find(arrayAccessOp)) {
|
|
Symbol *overload = r.declaration();
|
|
if (Function *funTy = overload->type()->asFunctionType()) {
|
|
// ### TODO: check the actual arguments
|
|
addResult(funTy->returnType().simplified(), scope);
|
|
}
|
|
}
|
|
|
|
}
|
|
}
|
|
}
|
|
return false;
|
|
}
|
|
|
|
QList<LookupItem> ResolveExpression::getMembers(LookupScope *binding, const Name *memberName) const
|
|
{
|
|
Q_UNUSED(binding);
|
|
Q_UNUSED(memberName);
|
|
|
|
// ### port me
|
|
QList<LookupItem> members;
|
|
#if 0
|
|
const QList<LookupItem> originalMembers = binding->find(memberName);
|
|
|
|
foreach (const LookupItem &m, originalMembers) {
|
|
if (! m.binding() || ! m.binding()->templateId()) {
|
|
members.append(m);
|
|
continue;
|
|
}
|
|
|
|
Symbol *decl = m.declaration();
|
|
|
|
if (Class *klass = decl->scope()->asClass()) {
|
|
if (klass->templateParameters() != 0) {
|
|
SubstitutionMap map;
|
|
|
|
const TemplateNameId *templateId = m.binding()->templateId();
|
|
unsigned count = qMin(klass->templateParameterCount(), templateId->templateArgumentCount());
|
|
|
|
for (unsigned i = 0; i < count; ++i) {
|
|
map.bind(klass->templateParameterAt(i)->name(), templateId->templateArgumentAt(i));
|
|
}
|
|
|
|
SubstitutionEnvironment env;
|
|
if (m.scope())
|
|
env.switchScope(m.scope());
|
|
env.setContext(_context);
|
|
|
|
env.enter(&map);
|
|
FullySpecifiedType instantiatedTy = rewriteType(decl->type(), &env, _context.control().data());
|
|
|
|
Overview oo;
|
|
oo.showReturnTypes = true;
|
|
oo.showFunctionSignatures = true;
|
|
|
|
qDebug() << "original:" << oo(decl->type(), decl->name()) << "inst:" << oo(instantiatedTy, decl->name());
|
|
|
|
LookupItem newItem;
|
|
newItem = m;
|
|
newItem.setType(instantiatedTy);
|
|
members.append(newItem);
|
|
}
|
|
}
|
|
}
|
|
#endif
|
|
|
|
return members;
|
|
}
|
|
|
|
bool ResolveExpression::visit(MemberAccessAST *ast)
|
|
{
|
|
// The candidate types for the base expression are stored in
|
|
// _results.
|
|
const QList<LookupItem> baseResults = resolve(ast->base_expression, _scope);
|
|
|
|
// Evaluate the expression-id that follows the access operator.
|
|
const Name *memberName = 0;
|
|
if (ast->member_name)
|
|
memberName = ast->member_name->name;
|
|
|
|
// Remember the access operator.
|
|
const int accessOp = tokenKind(ast->access_token);
|
|
|
|
if (LookupScope *binding = baseExpression(baseResults, accessOp))
|
|
addResults(binding->find(memberName));
|
|
|
|
return false;
|
|
}
|
|
|
|
LookupScope *ResolveExpression::findClass(const FullySpecifiedType &originalTy, Scope *scope,
|
|
LookupScope *enclosingBinding) const
|
|
{
|
|
FullySpecifiedType ty = originalTy.simplified();
|
|
LookupScope *binding = 0;
|
|
|
|
if (Class *klass = ty->asClassType()) {
|
|
if (scope->isBlock())
|
|
binding = _context.lookupType(klass->name(), scope, enclosingBinding);
|
|
if (!binding)
|
|
binding = _context.lookupType(klass, enclosingBinding);
|
|
}
|
|
|
|
else if (NamedType *namedTy = ty->asNamedType())
|
|
binding = _context.lookupType(namedTy->name(), scope, enclosingBinding);
|
|
|
|
else if (Function *funTy = ty->asFunctionType())
|
|
return findClass(funTy->returnType(), scope);
|
|
|
|
return binding;
|
|
}
|
|
|
|
LookupScope *ResolveExpression::baseExpression(const QList<LookupItem> &baseResults,
|
|
int accessOp,
|
|
bool *replacedDotOperator) const
|
|
{
|
|
if (Q_UNLIKELY(debug))
|
|
qDebug() << "In ResolveExpression::baseExpression with" << baseResults.size() << "results...";
|
|
int i = 0;
|
|
TypeResolver typeResolver(*_context.bindings());
|
|
|
|
foreach (const LookupItem &r, baseResults) {
|
|
if (!r.type().type() || !r.scope())
|
|
continue;
|
|
FullySpecifiedType ty = r.type().simplified();
|
|
FullySpecifiedType originalType = ty;
|
|
Scope *scope = r.scope();
|
|
|
|
if (Q_UNLIKELY(debug))
|
|
qDebug("trying result #%d", ++i);
|
|
|
|
typeResolver.resolve(&ty, &scope, r.binding());
|
|
|
|
if (accessOp == T_ARROW) {
|
|
if (PointerType *ptrTy = ty->asPointerType()) {
|
|
FullySpecifiedType type = ptrTy->elementType();
|
|
if (LookupScope *binding
|
|
= findClassForTemplateParameterInExpressionScope(r.binding(),
|
|
type)) {
|
|
return binding;
|
|
}
|
|
if (LookupScope *binding = findClass(type, scope))
|
|
return binding;
|
|
|
|
} else {
|
|
LookupScope *binding
|
|
= findClassForTemplateParameterInExpressionScope(r.binding(),
|
|
ty);
|
|
|
|
if (! binding)
|
|
binding = findClass(ty, scope, r.binding());
|
|
|
|
if (binding){
|
|
// lookup for overloads of operator->
|
|
|
|
const OperatorNameId *arrowOp
|
|
= control()->operatorNameId(OperatorNameId::ArrowOp);
|
|
foreach (const LookupItem &r, binding->find(arrowOp)) {
|
|
Symbol *overload = r.declaration();
|
|
if (! overload)
|
|
continue;
|
|
Scope *functionScope = overload->enclosingScope();
|
|
|
|
if (Function *funTy = overload->type()->asFunctionType()) {
|
|
FullySpecifiedType retTy = funTy->returnType().simplified();
|
|
|
|
typeResolver.resolve(&retTy, &functionScope, r.binding());
|
|
|
|
if (! retTy->isPointerType() && ! retTy->isNamedType())
|
|
continue;
|
|
|
|
if (PointerType *ptrTy = retTy->asPointerType())
|
|
retTy = ptrTy->elementType();
|
|
|
|
if (LookupScope *retBinding = findClass(retTy, functionScope))
|
|
return retBinding;
|
|
|
|
if (scope != functionScope) {
|
|
if (LookupScope *retBinding = findClass(retTy, scope))
|
|
return retBinding;
|
|
}
|
|
|
|
if (LookupScope *origin = binding->instantiationOrigin()) {
|
|
foreach (Symbol *originSymbol, origin->symbols()) {
|
|
Scope *originScope = originSymbol->asScope();
|
|
if (originScope && originScope != scope
|
|
&& originScope != functionScope) {
|
|
if (LookupScope *retBinding
|
|
= findClass(retTy, originScope))
|
|
return retBinding;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
} else if (accessOp == T_DOT) {
|
|
if (replacedDotOperator) {
|
|
*replacedDotOperator = originalType->isPointerType() || ty->isPointerType();
|
|
if (PointerType *ptrTy = ty->asPointerType())
|
|
ty = ptrTy->elementType();
|
|
}
|
|
|
|
if (LookupScope *binding
|
|
= findClassForTemplateParameterInExpressionScope(r.binding(),
|
|
ty)) {
|
|
return binding;
|
|
}
|
|
|
|
LookupScope *enclosingBinding = 0;
|
|
if (LookupScope *binding = r.binding()) {
|
|
if (binding->instantiationOrigin())
|
|
enclosingBinding = binding;
|
|
}
|
|
|
|
if (LookupScope *binding = findClass(ty, scope, enclosingBinding))
|
|
return binding;
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
LookupScope *ResolveExpression::findClassForTemplateParameterInExpressionScope(
|
|
LookupScope *resultBinding,
|
|
const FullySpecifiedType &ty) const
|
|
{
|
|
if (resultBinding) {
|
|
if (LookupScope *origin = resultBinding->instantiationOrigin()) {
|
|
foreach (Symbol *originSymbol, origin->symbols()) {
|
|
if (Scope *originScope = originSymbol->asScope()) {
|
|
if (LookupScope *retBinding = findClass(ty, originScope))
|
|
return retBinding;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
bool ResolveExpression::visit(PostIncrDecrAST *ast)
|
|
{
|
|
const QList<LookupItem> baseResults = resolve(ast->base_expression, _scope);
|
|
_results = baseResults;
|
|
return false;
|
|
}
|
|
|
|
bool ResolveExpression::visit(ObjCMessageExpressionAST *ast)
|
|
{
|
|
const QList<LookupItem> receiverResults = resolve(ast->receiver_expression, _scope);
|
|
|
|
foreach (const LookupItem &result, receiverResults) {
|
|
FullySpecifiedType ty = result.type().simplified();
|
|
LookupScope *binding = 0;
|
|
|
|
if (ObjCClass *clazz = ty->asObjCClassType()) {
|
|
// static access, e.g.:
|
|
// [NSObject description];
|
|
binding = _context.lookupType(clazz);
|
|
} else if (PointerType *ptrTy = ty->asPointerType()) {
|
|
if (NamedType *namedTy = ptrTy->elementType()->asNamedType()) {
|
|
// dynamic access, e.g.:
|
|
// NSObject *obj = ...; [obj release];
|
|
binding = _context.lookupType(namedTy->name(), result.scope());
|
|
}
|
|
}
|
|
|
|
if (binding) {
|
|
foreach (const LookupItem &r, binding->lookup(ast->selector->name)) {
|
|
Symbol *s = r.declaration();
|
|
if (ObjCMethod *m = s->asObjCMethod())
|
|
addResult(m->returnType(), result.scope());
|
|
}
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
const LookupContext &ResolveExpression::context() const
|
|
{
|
|
return _context;
|
|
}
|