list.h 4.92 KB
Newer Older
1 2 3 4 5
/*
 * Licensed to the OpenAirInterface (OAI) Software Alliance under one or more
 * contributor license agreements.  See the NOTICE file distributed with
 * this work for additional information regarding copyright ownership.
 * The OpenAirInterface Software Alliance licenses this file to You under
6
 * the OAI Public License, Version 1.1  (the "License"); you may not use this file
7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
 * except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *      http://www.openairinterface.org/?page_id=698
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 *-------------------------------------------------------------------------------
 * For more information about the OpenAirInterface (OAI) Software Alliance:
 *      contact@openairinterface.org
 */

Lionel Gauthier's avatar
Lionel Gauthier committed
22

23 24 25 26 27 28 29
/*! \file pad_list.c
* \brief list management primimtives
* \author Mohamed Said MOSLI BOUKSIAA, Lionel GAUTHIER, Navid Nikaein
* \date 2012 - 2014
* \version 0.5
* @ingroup util
*/
Lionel Gauthier's avatar
Lionel Gauthier committed
30

31 32 33 34 35 36 37 38 39 40 41 42 43
/*
                                 list.h
                             -------------------
  AUTHOR  : Lionel GAUTHIER
  COMPANY : EURECOM
  EMAIL   : Lionel.Gauthier@eurecom.fr

 ***************************************************************************/
#ifndef __LIST_H__
#    define __LIST_H__

//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
44 45 46
#include<linux/types.h>
#include<stdlib.h>
#include<sys/queue.h>
laurent's avatar
laurent committed
47 48
#include <string.h>

49

50
#include "UTIL/MEM/mem_block.h"
51 52

//-----------------------------------------------------------------------------
53 54 55 56 57 58 59 60 61
void         list_init (list_t* , char *);
void         list_free (list_t* listP);
mem_block_t* list_get_head (list_t*);
mem_block_t* list_remove_head (list_t* );
mem_block_t* list_remove_element (mem_block_t*, list_t*);
void         list_add_head (mem_block_t* , list_t* );
void         list_add_tail_eurecom (mem_block_t* , list_t* );
void         list_add_list (list_t* , list_t* );
void         list_display (list_t* );
62
//-----------------------------------------------------------------------------
63 64 65 66 67 68 69 70 71 72 73
void         list2_init           (list2_t*, char*);
void         list2_free           (list2_t* );
mem_block_t* list2_get_head       (list2_t*);
mem_block_t* list2_get_tail       (list2_t*);
mem_block_t* list2_remove_element (mem_block_t* , list2_t* );
mem_block_t* list2_remove_head    (list2_t* );
mem_block_t* list2_remove_tail    (list2_t* );
void         list2_add_head       (mem_block_t* , list2_t* );
void         list2_add_tail       (mem_block_t* , list2_t* );
void         list2_add_list       (list2_t* , list2_t* );
void         list2_display        (list2_t* );
74
//-----------------------------------------------------------------------------
75
/* The following lists are used for sorting numbers */
76 77
#ifndef LINUX_LIST
/*! \brief the node structure */
78
struct node {
79 80
  struct node* next; /*!< \brief is a node pointer */
  double val; /*!< \brief is a the value of a node pointer*/
81 82
};
//-----------------------------------------------------------------------------
83
/*! \brief the list structure */
84
struct list {
85 86 87
  struct node* head; /*!< \brief is a node pointer */
  ssize_t size; /*!< \brief is the list size*/
};
88 89 90
#else
//-----------------------------------------------------------------------------
struct entry {
91 92
  double val;
  LIST_ENTRY(entry) entries;
93 94 95
};
//-----------------------------------------------------------------------------
struct list {
96 97
  LIST_HEAD(listhead, entry) head;
  ssize_t size;
98 99
};
#endif
100
//-----------------------------------------------------------------------------
101 102 103 104 105 106
void   push_front  (struct list*, double); 
void   initialize  (struct list*);         
void   del         (struct list*);         
void   totable     (double*, struct list*);
int compare (const void * a, const void * b);
int32_t calculate_median(struct list *loc_list);
107

laurent's avatar
laurent committed
108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140

typedef struct {
  size_t size;
  size_t mallocedSize;
  size_t atomSize;
  size_t increment;
} varArray_t;
 
static inline varArray_t * initVarArray(size_t increment, size_t atomSize) {
    varArray_t * tmp=malloc(sizeof(varArray_t)+increment*atomSize);
    tmp->size=0;
    tmp->atomSize=atomSize;
    tmp->mallocedSize=increment;
    tmp->increment=increment;
    return(tmp);
}

static inline void * dataArray(varArray_t * input) {
  return input+1;
}

static inline void appendVarArray(varArray_t * input, void* data) {
  if (input->size>=input->mallocedSize) {
     input->mallocedSize+=input->increment;
     input=realloc(input,sizeof(varArray_t)+input->mallocedSize*input->atomSize);
  }
  memcpy((uint8_t*)(input+1)+input->atomSize*input->size++, data, input->atomSize);
}

static inline void freeVarArray(varArray_t * input) {
   free(input);
}

141
#endif