/*
 * Copyright © 2014 Intel Corporation
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sub license, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 *
 * The above copyright notice and this permission notice (including the
 * next paragraph) shall be included in all copies or substantial portions
 * of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
 * IN NO EVENT SHALL PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR
 * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
 * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
 * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 *
 * Authors:
 *     Wei Lin<wei.w.lin@intel.com>
 *     Yuting Yang<yuting.yang@intel.com>
 */

#include "cm_basic_queue.h"
#include "cm_basic_list.h"

bool CQueue::Push(void *element)
{
	bool ret;

	mQueueCriticalSection.Acquire();

	ret = this->Add(element);

	mQueueCriticalSection.Release();

	return ret;
}

void *CQueue::Pop(void)
{
	void *element = { 0 };

	mQueueCriticalSection.Acquire();

	if (this->IsEmpty()) {
		CM_ASSERT(0);
	} else {
		CQueue::CIterator end = this->End();
		--end;

		element = *end;

		this->Remove(end);
	}

	mQueueCriticalSection.Release();

	return element;

}

void *CQueue::GetNext(void *element)
{
	CIterator iterator = Find(element);
	CNode *myPrev = iterator.m_Ptr->GetPrevious();
	if (myPrev != NULL) {
		return myPrev->GetElement();
	} else {
		return NULL;
	}
}

void *CQueue::Top(void)
{

	void *element = { 0 };

	if (this->IsEmpty()) {
		CM_ASSERT(0);
	} else {
		CQueue::CIterator end = this->End();
		--end;

		element = *end;
	}

	return element;

}
