/* * Copyright (C) 2013-2015, 2019 by the Konclude Developer Team. * * This file is part of the reasoning system Konclude. * For details and support, see . * * Konclude is free software: you can redistribute it and/or modify * it under the terms of version 3 of the GNU Lesser General Public * License (LGPLv3) as published by the Free Software Foundation. * * Konclude 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 (Lesser) General Public License for more details. * * You should have received a copy of the GNU (Lesser) General Public * License along with Konclude. If not, see . * */ #include "CTaskReserveArrayQueueConsumer.h" #include "CTaskReserveArrayQueue.h" namespace Konclude { namespace Scheduler { CTaskReserveArrayQueueConsumer::CTaskReserveArrayQueueConsumer(CTaskReserveArrayQueue* arrayQueue) : CLinkerBase(this), mArrayQueue(arrayQueue) { mTakenTask = 0; mRequestedTask = 0; } CTask* CTaskReserveArrayQueueConsumer::getTask() { CTask* task = nullptr; bool moreTasksAvailable = true; task = nullptr; while (moreTasksAvailable && !task) { ++mRequestedTask; moreTasksAvailable = mArrayQueue->tryGetTask(task); } if (task != nullptr) { ++mTakenTask; } return task; } cint64 CTaskReserveArrayQueueConsumer::getTakenTask() { return mTakenTask; } cint64 CTaskReserveArrayQueueConsumer::getRequestedTask() { return mRequestedTask; } }; // end namespace Scheduler }; // end namespace Konclude