2023-07-07 20:26:36 +00:00
|
|
|
#include <hamlib/rig.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
#include "fifo.h"
|
|
|
|
|
|
|
|
|
|
|
|
void initFIFO(FIFO *fifo)
|
|
|
|
{
|
|
|
|
fifo->head = 0;
|
|
|
|
fifo->tail = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
// returns RIG_OK if added
|
|
|
|
// return -RIG error if overflow
|
|
|
|
int push(FIFO *fifo, const char *msg)
|
|
|
|
{
|
|
|
|
int len = strlen(msg);
|
|
|
|
|
|
|
|
for (int i = 0; i < len; ++i)
|
|
|
|
{
|
|
|
|
fifo->data[fifo->tail] = msg[i];
|
|
|
|
fifo->tail = (fifo->tail + 1) % FIFO_SIZE;
|
|
|
|
|
|
|
|
if (fifo->tail == fifo->head) { return -RIG_EDOM; }
|
|
|
|
}
|
|
|
|
|
|
|
|
return RIG_OK;
|
|
|
|
}
|
|
|
|
|
|
|
|
char pop(FIFO *fifo)
|
|
|
|
{
|
|
|
|
if (fifo->tail == fifo->head) { return -1; }
|
|
|
|
|
|
|
|
char c = fifo->data[fifo->head];
|
|
|
|
fifo->head = (fifo->head + 1) % FIFO_SIZE;
|
|
|
|
return c;
|
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef TEST
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
FIFO fifo;
|
|
|
|
initFIFO(&fifo);
|
|
|
|
|
|
|
|
const char *str = "Hello, World!\n";
|
|
|
|
|
|
|
|
// Pushing the string onto the FIFO
|
|
|
|
push(&fifo, str);
|
|
|
|
|
|
|
|
// Popping and printing one character at a time
|
|
|
|
int c;
|
2023-07-08 03:23:28 +00:00
|
|
|
|
2023-07-07 20:26:36 +00:00
|
|
|
while ((c = pop(&fifo)) != -1)
|
|
|
|
{
|
|
|
|
printf("%c", c);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif
|