/*
 * StarPU
 * Copyright (C) INRIA 2008-2009 (see AUTHORS file)
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License as published by
 * the Free Software Foundation; either version 2.1 of the License, or (at
 * your option) any later version.
 *
 * This program 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 in COPYING.LGPL for more details.
 */

#ifndef __FIFO_QUEUES_H__
#define __FIFO_QUEUES_H__

#include <core/mechanisms/queues.h>

struct starpu_fifo_jobq_s {
	/* the actual list */
	starpu_job_list_t jobq;

	/* the number of tasks currently in the queue */
	unsigned njobs;

	/* the number of tasks that were processed */
	unsigned nprocessed;

	/* only meaningful if the queue is only used by a single worker */
	double exp_start;
	double exp_end;
	double exp_len;
};

struct starpu_jobq_s *_starpu_create_fifo(void);
void _starpu_destroy_fifo(struct starpu_jobq_s *jobq);

int _starpu_fifo_push_task(struct starpu_jobq_s *q, starpu_job_t task);
int _starpu_fifo_push_prio_task(struct starpu_jobq_s *q, starpu_job_t task);

starpu_job_t _starpu_fifo_pop_task(struct starpu_jobq_s *q);
struct starpu_job_list_s * _starpu_fifo_pop_every_task(struct starpu_jobq_s *q, uint32_t where);

void _starpu_init_fifo_queues_mechanisms(void);
void _starpu_deinit_fifo_queues_mechanisms(void);

#endif // __FIFO_QUEUES_H__