qos_list.h

Go to the documentation of this file.

#ifndef __QOS_LIST_H__
#define __QOS_LIST_H__

#ifdef QOS_KS
  #include <linux/list.h>
#else /* QOS_KS */
  /* this is to force to include <linux/list.h> in user space*/
  #undef offsetof
  #define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
  #define container_of(ptr, type, member) ({                      \
        const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
        (type *)( (char *)__mptr - offsetof(type,member) );})
  #define __KERNEL__
  #define __ASM_I386_PROCESSOR_H
  #define _LINUX_KERNEL_H
  #define __ASM_SYSTEM_H
  #include <linux/list.h> /* included in user space! */
  #undef __KERNEL__
  #undef __ASM_I386_PROCESSOR_H
  #undef _LINUX_KERNEL_H
  #undef __ASM_SYSTEM_H
#endif /* QOS_KS */

/* @todo (low) check all list operations, in particular the use of NULL value and *_NULL macro */
/* @todo (low) rename the macro parameters name adding __ */
/* @todo (mid) move here other functions? */
#define INIT_LIST_HEAD_NULL(ptr) do { (ptr)->prev = NULL; (ptr)->next = NULL; } while (0)

#define list_add_ordered(head, obj_type, obj, list_field, ord_field, ret) \
do { \
  struct list_head *h; \
  if (list_empty(&head)) { \
    list_add(&((obj)->list_field ), &(head)); \
    goto __ret1; \
  } else { \
    for (h = (head).next; h != &(head); h = h->next) { \
      if ( kal_time_lt( (obj)->ord_field, (list_entry(h, struct obj_type, list_field)->ord_field) ) ) { \
        break; \
      } \
    } \
    list_add_tail(&((obj)->list_field), h); \
  } \
  if (&((obj)->list_field) == (head).next) { \
    goto __ret1; \
  } \
  (ret) = 0; \
  break; \
__ret1: \
  (ret) = 1; \
} while (0)

static inline void list_del_null(struct list_head *entry)
{
  list_del(entry);
  entry->next = entry->prev = 0;
}

#endif /* __QOS_LIST_H__ */

---