2018-08-22 17:20:08 +02:00
|
|
|
/****************************************************************************
|
|
|
|
**
|
|
|
|
** Copyright (C) 2018 The Qt Company Ltd.
|
|
|
|
** Contact: https://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 https://www.qt.io/terms-conditions. For further
|
|
|
|
** information use the contact form at https://www.qt.io/contact-us.
|
|
|
|
**
|
|
|
|
** GNU General Public License Usage
|
|
|
|
** Alternatively, this file may be used under the terms of the GNU
|
|
|
|
** General Public License version 3 as published by the Free Software
|
|
|
|
** Foundation with exceptions as appearing in the file LICENSE.GPL3-EXCEPT
|
|
|
|
** included in the packaging of this file. Please review the following
|
|
|
|
** information to ensure the GNU General Public License requirements will
|
|
|
|
** be met: https://www.gnu.org/licenses/gpl-3.0.html.
|
|
|
|
**
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
#include "googletest.h"
|
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
#include "mocktaskscheduler.h"
|
2018-08-28 12:08:37 +02:00
|
|
|
|
2018-08-22 17:20:08 +02:00
|
|
|
#include <symbolindexertaskqueue.h>
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
using ClangBackEnd::FilePathId;
|
2018-08-22 21:13:05 +02:00
|
|
|
using ClangBackEnd::SymbolsCollectorInterface;
|
|
|
|
using ClangBackEnd::SymbolIndexerTask;
|
|
|
|
using ClangBackEnd::SymbolStorageInterface;
|
|
|
|
|
|
|
|
using Callable = ClangBackEnd::SymbolIndexerTask::Callable;
|
2018-08-22 17:20:08 +02:00
|
|
|
|
|
|
|
MATCHER_P2(IsTask, filePathId, projectPartId,
|
|
|
|
std::string(negation ? "is't" : "is")
|
2018-08-22 21:13:05 +02:00
|
|
|
+ PrintToString(SymbolIndexerTask(filePathId, projectPartId, Callable{})))
|
2018-08-22 17:20:08 +02:00
|
|
|
{
|
|
|
|
const SymbolIndexerTask &task = arg;
|
|
|
|
|
|
|
|
return task.filePathId == filePathId && task.projectPartId == projectPartId;
|
|
|
|
}
|
|
|
|
|
|
|
|
class SymbolIndexerTaskQueue : public testing::Test
|
|
|
|
{
|
|
|
|
protected:
|
2018-09-11 17:02:45 +02:00
|
|
|
NiceMock<MockTaskScheduler<Callable>> mockTaskScheduler;
|
|
|
|
ClangBackEnd::SymbolIndexerTaskQueue queue{mockTaskScheduler};
|
2018-08-22 17:20:08 +02:00
|
|
|
};
|
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, AddTasks)
|
|
|
|
{
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 2}, 1, Callable{}},
|
|
|
|
{{1, 4}, 1, Callable{}}});
|
2018-08-22 17:20:08 +02:00
|
|
|
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 1}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}},
|
|
|
|
{{1, 5}, 1, Callable{}}});
|
2018-08-22 17:20:08 +02:00
|
|
|
|
|
|
|
ASSERT_THAT(queue.tasks(),
|
2018-08-30 16:18:19 +02:00
|
|
|
ElementsAre(IsTask(FilePathId{1, 1}, 1),
|
|
|
|
IsTask(FilePathId{1, 2}, 1),
|
|
|
|
IsTask(FilePathId{1, 3}, 1),
|
|
|
|
IsTask(FilePathId{1, 4}, 1),
|
|
|
|
IsTask(FilePathId{1, 5}, 1)));
|
2018-08-22 17:20:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, ReplaceTask)
|
|
|
|
{
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 1}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}},
|
|
|
|
{{1, 5}, 1, Callable{}}});
|
2018-08-22 17:20:08 +02:00
|
|
|
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 2}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}}});
|
2018-08-22 17:20:08 +02:00
|
|
|
|
|
|
|
ASSERT_THAT(queue.tasks(),
|
2018-08-30 16:18:19 +02:00
|
|
|
ElementsAre(IsTask(FilePathId{1, 1}, 1),
|
|
|
|
IsTask(FilePathId{1, 2}, 1),
|
|
|
|
IsTask(FilePathId{1, 3}, 1),
|
|
|
|
IsTask(FilePathId{1, 5}, 1)));
|
2018-08-22 17:20:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, AddTaskWithDifferentProjectId)
|
|
|
|
{
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 1}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}},
|
|
|
|
{{1, 5}, 1, Callable{}}});
|
2018-08-22 17:20:08 +02:00
|
|
|
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 2}, 2, Callable{}},
|
|
|
|
{{1, 3}, 2, Callable{}}});
|
2018-08-22 17:20:08 +02:00
|
|
|
|
|
|
|
ASSERT_THAT(queue.tasks(),
|
2018-08-30 16:18:19 +02:00
|
|
|
ElementsAre(IsTask(FilePathId{1, 1}, 1),
|
|
|
|
IsTask(FilePathId{1, 2}, 2),
|
|
|
|
IsTask(FilePathId{1, 3}, 1),
|
|
|
|
IsTask(FilePathId{1, 3}, 2),
|
|
|
|
IsTask(FilePathId{1, 5}, 1)));
|
2018-08-22 17:20:08 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, RemoveTaskByProjectParts)
|
|
|
|
{
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 1}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}},
|
|
|
|
{{1, 5}, 1, Callable{}}});
|
|
|
|
queue.addOrUpdateTasks({{{1, 2}, 2, Callable{}},
|
|
|
|
{{1, 3}, 2, Callable{}}});
|
|
|
|
queue.addOrUpdateTasks({{{1, 2}, 3, Callable{}},
|
|
|
|
{{1, 3}, 3, Callable{}}});
|
|
|
|
queue.addOrUpdateTasks({{{1, 2}, 4, Callable{}},
|
|
|
|
{{1, 3}, 4, Callable{}}});
|
|
|
|
|
|
|
|
queue.removeTasks({2, 3});
|
2018-08-22 17:20:08 +02:00
|
|
|
|
|
|
|
ASSERT_THAT(queue.tasks(),
|
2018-08-30 16:18:19 +02:00
|
|
|
ElementsAre(IsTask(FilePathId{1, 1}, 1),
|
|
|
|
IsTask(FilePathId{1, 2}, 4),
|
|
|
|
IsTask(FilePathId{1, 3}, 1),
|
|
|
|
IsTask(FilePathId{1, 3}, 4),
|
|
|
|
IsTask(FilePathId{1, 5}, 1)));
|
2018-08-22 17:20:08 +02:00
|
|
|
}
|
2018-08-28 12:08:37 +02:00
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, ProcessTasksCallsFreeSlotsAndAddTasksInScheduler)
|
|
|
|
{
|
|
|
|
InSequence s;
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 1}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}},
|
|
|
|
{{1, 5}, 1, Callable{}}});
|
2018-08-28 12:08:37 +02:00
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
EXPECT_CALL(mockTaskScheduler, freeSlots()).WillRepeatedly(Return(2));
|
|
|
|
EXPECT_CALL(mockTaskScheduler, addTasks(SizeIs(2)));
|
2018-08-28 12:08:37 +02:00
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
queue.processEntries();
|
2018-08-28 12:08:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, ProcessTasksCallsFreeSlotsAndAddTasksWithNoTaskInSchedulerIfTaskAreEmpty)
|
|
|
|
{
|
|
|
|
InSequence s;
|
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
EXPECT_CALL(mockTaskScheduler, freeSlots()).WillRepeatedly(Return(2));
|
|
|
|
EXPECT_CALL(mockTaskScheduler, addTasks(IsEmpty()));
|
2018-08-28 12:08:37 +02:00
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
queue.processEntries();
|
2018-08-28 12:08:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, ProcessTasksCallsFreeSlotsAndMoveAllTasksInSchedulerIfMoreSlotsAreFree)
|
|
|
|
{
|
|
|
|
InSequence s;
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 1}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}},
|
|
|
|
{{1, 5}, 1, Callable{}}});
|
2018-08-28 12:08:37 +02:00
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
EXPECT_CALL(mockTaskScheduler, freeSlots()).WillRepeatedly(Return(4));
|
|
|
|
EXPECT_CALL(mockTaskScheduler, addTasks(SizeIs(3)));
|
2018-08-28 12:08:37 +02:00
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
queue.processEntries();
|
2018-08-28 12:08:37 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
TEST_F(SymbolIndexerTaskQueue, ProcessTasksRemovesProcessedTasks)
|
|
|
|
{
|
2018-08-30 16:18:19 +02:00
|
|
|
queue.addOrUpdateTasks({{{1, 1}, 1, Callable{}},
|
|
|
|
{{1, 3}, 1, Callable{}},
|
|
|
|
{{1, 5}, 1, Callable{}}});
|
2018-09-11 17:02:45 +02:00
|
|
|
ON_CALL(mockTaskScheduler, freeSlots()).WillByDefault(Return(2));
|
2018-08-28 12:08:37 +02:00
|
|
|
|
2018-09-11 17:02:45 +02:00
|
|
|
queue.processEntries();
|
2018-08-28 12:08:37 +02:00
|
|
|
|
|
|
|
ASSERT_THAT(queue.tasks(), SizeIs(1));
|
|
|
|
}
|
2018-08-22 17:20:08 +02:00
|
|
|
}
|