queue.c

模擬無線通訊論文的模擬程式, 可用此程式驗證論文方法是否正確

/* include */
#include "queue.h"
#include <list>

/* namespace */
using namespace std;

/****************************************************** 
 * global variables 
 ******************************************************/
/* event queue (container) */
static list<event_t> event_queue[MAX_BS];
/******************************************************/

/* initial */
void initialize_queue(u8 bs_size)
{
/* loop counter */
int i;

    for(i=0; i<bs_size; ++i){
        event_queue[i].clear();
    } 
}

/* get size from queue */
int get_event_queue_size(u8 bs_index){
    return event_queue[bs_index].size();    
}

/* events add to queue */
void queue_add_event(event_t *ins_event)
{
    event_queue[ins_event->bs_location].push_back(*ins_event);
}


/* get first event from queue */
void get_event_from_queue(event_t *get_event, u8 bs_index)
{
    if(event_queue[bs_index].size() == 0) return;
    /* get event */
    memcpy(get_event, &event_queue[bs_index].front(), sizeof(event_t));
    /* remove it */
    event_queue[bs_index].pop_front();
}

/* print event queue*/
void print_event_queue(u8 bs_index)
{
/* iterator */
list<event_t>::iterator pos;

    if(event_queue[bs_index].size() == 0) return;
    
    printf("Queue(%d) ", bs_index);
    for(pos = event_queue[bs_index].begin(); 
        pos != event_queue[bs_index].end(); ++pos){
        printf("%s (%f), ", pos->type ? "departure" : "arrival", pos->timestamp);
    } 
    printf("\n");    
}


/* free all queue item */
void free_event_queue(u8 bs_index)
{
    event_queue[bs_index].clear();     
}