sol-list.h

Go to the documentation of this file.

/*
 * This file is part of the Soletta (TM) Project
 *
 * Copyright (C) 2015 Intel Corporation. All rights reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * 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.
 */

#pragma once

#include <stdlib.h>
#include <stdbool.h>
#include <stddef.h>

#ifdef __cplusplus
extern "C" {
#endif

typedef struct sol_list {
    struct sol_list *next; 
    struct sol_list *prev; 
} sol_list;

#define SOL_LIST_INIT(name) { &(name), &(name) }

#define SOL_LIST_GET_CONTAINER(list, type, member) (type *)((char *)(list) - offsetof(type, member))

#define SOL_LIST_FOREACH(list, itr) for (itr = (list)->next; itr != (list); itr = itr->next)

#define SOL_LIST_FOREACH_SAFE(list, itr, itr_next) for (itr = (list)->next, itr_next = itr->next; itr != (list); itr = itr_next, itr_next = itr_next->next)

static inline void
sol_list_init(struct sol_list *list)
{
    list->next = list->prev = list;
}

static inline void
sol_list_append(struct sol_list *list, struct sol_list *new_l)
{
    new_l->next = list;
    new_l->prev = list->prev;
    list->prev->next = new_l;
    list->prev = new_l;
}

static inline void
sol_list_prepend(struct sol_list *list, struct sol_list *new_l)
{
    new_l->prev = list;
    new_l->next = list->next;
    list->next->prev = new_l;
    list->next = new_l;
}

static inline void
sol_list_remove(struct sol_list *list)
{
    list->next->prev = list->prev;
    list->prev->next = list->next;
}

static inline bool
sol_list_is_empty(struct sol_list *list)
{
    return list->next == list;
}

static inline void
sol_list_steal(struct sol_list *list, struct sol_list *new_head)
{
    list->prev->next = new_head;
    list->next->prev = new_head;
    new_head->next = list->next;
    new_head->prev = list->prev;
    sol_list_init(list);
}

#ifdef __cplusplus
}
#endif