1
0
mirror of https://github.com/RIOT-OS/RIOT.git synced 2025-01-17 17:52:47 +01:00

core/lifo: remove lifo.c, keep api with lifo.h

use LOG_DEBUG instead of DEBUG
This commit is contained in:
Karl Fessel 2021-02-26 12:27:08 +01:00
parent a68cfacdd4
commit 9ab0681634
2 changed files with 49 additions and 77 deletions

View File

@ -23,6 +23,8 @@
#ifndef LIFO_H #ifndef LIFO_H
#define LIFO_H #define LIFO_H
#include "log.h"
#ifdef __cplusplus #ifdef __cplusplus
extern "C" { extern "C" {
#endif #endif
@ -35,7 +37,10 @@ extern "C" {
* @return 1, if empty * @return 1, if empty
* @return 0, otherwise. * @return 0, otherwise.
*/ */
int lifo_empty(int *array); static inline int lifo_empty(int *array)
{
return array[0] == -1;
}
/** /**
* @brief Initialize a lifo array. * @brief Initialize a lifo array.
@ -45,7 +50,13 @@ int lifo_empty(int *array);
* @param[in,out] array An array of size *n* + 1. Must not be `NULL`. * @param[in,out] array An array of size *n* + 1. Must not be `NULL`.
* @param[in] n Maximum integer value the lifo is able to store. * @param[in] n Maximum integer value the lifo is able to store.
*/ */
void lifo_init(int *array, int n); static inline void lifo_init(int *array, int n)
{
LOG_DEBUG("lifo_init(%i)\n", n);
for (int i = 0; i <= n; i++) {
array[i] = -1;
}
}
/** /**
* @brief Insert an element into the lifo * @brief Insert an element into the lifo
@ -58,7 +69,24 @@ void lifo_init(int *array, int n);
* the array - 1, must not be stored already. * the array - 1, must not be stored already.
* *
*/ */
void lifo_insert(int *array, int i); static inline void lifo_insert(int *array, int i)
{
LOG_DEBUG("lifo_insert(%i)\n", i);
int index = i + 1;
#ifdef DEVELHELP
if ((array[index] != -1) && (array[0] != -1)) {
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]);
}
#endif
array[index] = array[0];
array[0] = i;
}
/** /**
* @brief Extract the least recently inserted element from the lifo. * @brief Extract the least recently inserted element from the lifo.
@ -70,7 +98,24 @@ void lifo_insert(int *array, int i);
* @return -1, if the lifo is empty. * @return -1, if the lifo is empty.
* @return the least recently inserted element, otherwise. * @return the least recently inserted element, otherwise.
*/ */
int lifo_get(int *array); static inline int lifo_get(int *array)
{
DEBUG("lifo_get\n");
int head = array[0];
if (head != -1) {
array[0] = array[head + 1];
}
#ifdef DEVELHELP
/* make sure a double insert does not result in an infinite
* resource of values */
array[head + 1] = -1;
#endif
DEBUG("lifo_get: returning %i\n", head);
return head;
}
#ifdef __cplusplus #ifdef __cplusplus
} }

View File

@ -1,73 +0,0 @@
/*
* Copyright (C) 2013 Freie Universität Berlin
*
* 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.
*/
/**
* @ingroup core_util
* @{
* @file
* @brief LIFO buffer implementation
*
* @author Heiko Will <hwill@inf.fu-berlin.de>
* @}
*/
#include "lifo.h"
#include "log.h"
#define ENABLE_DEBUG 0
#include "debug.h"
int lifo_empty(int *array)
{
return array[0] == -1;
}
void lifo_init(int *array, int n)
{
DEBUG("lifo_init(%i)\n", n);
for (int i = 0; i <= n; i++) {
array[i] = -1;
}
}
void lifo_insert(int *array, int i)
{
DEBUG("lifo_insert(%i)\n", i);
int index = i + 1;
#ifdef DEVELHELP
if ((array[index] != -1) && (array[0] != -1)) {
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]);
}
#endif
array[index] = array[0];
array[0] = i;
}
int lifo_get(int *array)
{
DEBUG("lifo_get\n");
int head = array[0];
if (head != -1) {
array[0] = array[head + 1];
}
#ifdef DEVELHELP
/* make sure a double insert does not result in an infinite
* resource of values */
array[head + 1] = -1;
#endif
DEBUG("lifo_get: returning %i\n", head);
return head;
}