2013-11-27 16:28:31 +01:00
|
|
|
/*
|
|
|
|
* Copyright (C) 2013 Freie Universität Berlin
|
|
|
|
*
|
2014-07-31 19:45:27 +02:00
|
|
|
* This file is subject to the terms and conditions of the GNU Lesser
|
|
|
|
* General Public License v2.1. See the file LICENSE in the top level
|
|
|
|
* directory for more details.
|
2013-11-27 16:28:31 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @ingroup core_util
|
|
|
|
* @{
|
2015-05-22 07:34:41 +02:00
|
|
|
* @file
|
2013-11-27 17:54:30 +01:00
|
|
|
* @brief LIFO buffer implementation
|
2014-02-23 15:09:43 +01:00
|
|
|
*
|
|
|
|
* @author Heiko Will <hwill@inf.fu-berlin.de>
|
2013-11-27 16:28:31 +01:00
|
|
|
* @}
|
|
|
|
*/
|
|
|
|
|
2013-12-16 17:54:58 +01:00
|
|
|
#include "lifo.h"
|
2015-02-25 16:31:03 +01:00
|
|
|
#include "log.h"
|
2010-12-10 16:49:29 +01:00
|
|
|
|
2020-10-22 11:32:06 +02:00
|
|
|
#define ENABLE_DEBUG 0
|
2013-12-17 17:18:40 +01:00
|
|
|
#include "debug.h"
|
|
|
|
|
2013-06-20 18:18:29 +02:00
|
|
|
int lifo_empty(int *array)
|
|
|
|
{
|
2010-12-10 16:49:29 +01:00
|
|
|
return array[0] == -1;
|
|
|
|
}
|
|
|
|
|
2013-06-20 18:18:29 +02:00
|
|
|
void lifo_init(int *array, int n)
|
|
|
|
{
|
2013-12-17 17:18:40 +01:00
|
|
|
DEBUG("lifo_init(%i)\n", n);
|
2013-06-24 22:37:35 +02:00
|
|
|
for (int i = 0; i <= n; i++) {
|
2010-12-10 16:49:29 +01:00
|
|
|
array[i] = -1;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-20 18:18:29 +02:00
|
|
|
void lifo_insert(int *array, int i)
|
|
|
|
{
|
2013-12-17 17:18:40 +01:00
|
|
|
DEBUG("lifo_insert(%i)\n", i);
|
|
|
|
|
2013-06-20 18:18:29 +02:00
|
|
|
int index = i + 1;
|
2013-12-17 17:18:40 +01:00
|
|
|
|
2015-09-12 12:43:15 +02:00
|
|
|
#ifdef DEVELHELP
|
2013-12-17 17:18:40 +01:00
|
|
|
if ((array[index] != -1) && (array[0] != -1)) {
|
2020-03-30 17:02:08 +02:00
|
|
|
LOG_WARNING(
|
|
|
|
"lifo_insert: overwriting array[%i] == %i with %i\n\n\n\t\tThe lifo is broken now.\n\n\n", index,
|
|
|
|
array[index], array[0]);
|
2013-12-17 17:18:40 +01:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2010-12-10 16:49:29 +01:00
|
|
|
array[index] = array[0];
|
|
|
|
array[0] = i;
|
|
|
|
}
|
|
|
|
|
2013-06-20 18:18:29 +02:00
|
|
|
int lifo_get(int *array)
|
|
|
|
{
|
2013-12-17 17:18:40 +01:00
|
|
|
DEBUG("lifo_get\n");
|
2010-12-10 16:49:29 +01:00
|
|
|
int head = array[0];
|
2013-06-20 18:18:29 +02:00
|
|
|
|
2013-06-24 22:37:35 +02:00
|
|
|
if (head != -1) {
|
2013-06-20 18:18:29 +02:00
|
|
|
array[0] = array[head + 1];
|
2010-12-10 16:49:29 +01:00
|
|
|
}
|
2013-12-19 17:02:18 +01:00
|
|
|
|
2015-09-12 12:43:15 +02:00
|
|
|
#ifdef DEVELHELP
|
2013-12-19 17:02:18 +01:00
|
|
|
/* make sure a double insert does not result in an infinite
|
|
|
|
* resource of values */
|
2020-03-30 17:02:08 +02:00
|
|
|
array[head + 1] = -1;
|
2013-12-19 17:02:18 +01:00
|
|
|
#endif
|
2013-06-20 18:18:29 +02:00
|
|
|
|
2013-12-18 17:06:06 +01:00
|
|
|
DEBUG("lifo_get: returning %i\n", head);
|
2010-12-10 16:49:29 +01:00
|
|
|
return head;
|
|
|
|
}
|