2025cf9e19
Based on 1 normalized pattern(s): this program is free software you can redistribute it and or modify it under the terms and conditions of the gnu general public license version 2 as published by the free software foundation this program is distributed in the hope it will be useful but without any warranty without even the implied warranty of merchantability or fitness for a particular purpose see the gnu general public license for more details extracted by the scancode license scanner the SPDX license identifier GPL-2.0-only has been chosen to replace the boilerplate/reference in 263 file(s). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Allison Randal <allison@lohutok.net> Reviewed-by: Alexios Zavras <alexios.zavras@intel.com> Cc: linux-spdx@vger.kernel.org Link: https://lkml.kernel.org/r/20190529141901.208660670@linutronix.de Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
70 lines
1.8 KiB
C
70 lines
1.8 KiB
C
/* SPDX-License-Identifier: GPL-2.0-only */
|
|
/*
|
|
* Copyright (C) 2015, Intel Corporation
|
|
* Author: Jiang Liu <jiang.liu@linux.intel.com>
|
|
*/
|
|
#ifndef _LINUX_RESOURCE_EXT_H
|
|
#define _LINUX_RESOURCE_EXT_H
|
|
#include <linux/types.h>
|
|
#include <linux/list.h>
|
|
#include <linux/ioport.h>
|
|
#include <linux/slab.h>
|
|
|
|
/* Represent resource window for bridge devices */
|
|
struct resource_win {
|
|
struct resource res; /* In master (CPU) address space */
|
|
resource_size_t offset; /* Translation offset for bridge */
|
|
};
|
|
|
|
/*
|
|
* Common resource list management data structure and interfaces to support
|
|
* ACPI, PNP and PCI host bridge etc.
|
|
*/
|
|
struct resource_entry {
|
|
struct list_head node;
|
|
struct resource *res; /* In master (CPU) address space */
|
|
resource_size_t offset; /* Translation offset for bridge */
|
|
struct resource __res; /* Default storage for res */
|
|
};
|
|
|
|
extern struct resource_entry *
|
|
resource_list_create_entry(struct resource *res, size_t extra_size);
|
|
extern void resource_list_free(struct list_head *head);
|
|
|
|
static inline void resource_list_add(struct resource_entry *entry,
|
|
struct list_head *head)
|
|
{
|
|
list_add(&entry->node, head);
|
|
}
|
|
|
|
static inline void resource_list_add_tail(struct resource_entry *entry,
|
|
struct list_head *head)
|
|
{
|
|
list_add_tail(&entry->node, head);
|
|
}
|
|
|
|
static inline void resource_list_del(struct resource_entry *entry)
|
|
{
|
|
list_del(&entry->node);
|
|
}
|
|
|
|
static inline void resource_list_free_entry(struct resource_entry *entry)
|
|
{
|
|
kfree(entry);
|
|
}
|
|
|
|
static inline void
|
|
resource_list_destroy_entry(struct resource_entry *entry)
|
|
{
|
|
resource_list_del(entry);
|
|
resource_list_free_entry(entry);
|
|
}
|
|
|
|
#define resource_list_for_each_entry(entry, list) \
|
|
list_for_each_entry((entry), (list), node)
|
|
|
|
#define resource_list_for_each_entry_safe(entry, tmp, list) \
|
|
list_for_each_entry_safe((entry), (tmp), (list), node)
|
|
|
|
#endif /* _LINUX_RESOURCE_EXT_H */
|