lib: add memrange infrastructure
The memrange infrastructure allows for keeping track of the machine's physical address space. Each memory_range entry in a memory_ranges structure can be tagged with an arbitrary value. It supports merging and deleting ranges as well as filling in holes in the address space with a particular tag. The memrange infrastructure will serve as a shared implementation for address tracking by the MTRR and coreboot mem table code. Change-Id: Id5bea9d2a419114fca55c59af0fdca063551110e Signed-off-by: Aaron Durbin <adurbin@chromium.org> Reviewed-on: http://review.coreboot.org/2888 Tested-by: build bot (Jenkins) Reviewed-by: Stefan Reinauer <stefan.reinauer@coreboot.org>
This commit is contained in:
committed by
Stefan Reinauer
parent
3ece5ac40c
commit
a05a8522ce
107
src/include/memrange.h
Normal file
107
src/include/memrange.h
Normal file
@@ -0,0 +1,107 @@
|
||||
/*
|
||||
* This file is part of the coreboot project.
|
||||
*
|
||||
* Copyright (C) 2013 Google, Inc.
|
||||
*
|
||||
* This program is free software; you can redistribute it and/or modify
|
||||
* it under the terms of the GNU General Public License as published by
|
||||
* the Free Software Foundation; version 2 of the License.
|
||||
*
|
||||
* This program is distributed in the hope that 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.
|
||||
*
|
||||
* You should have received a copy of the GNU General Public License
|
||||
* along with this program; if not, write to the Free Software
|
||||
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
||||
*/
|
||||
#ifndef MEMRANGE_H_
|
||||
#define MEMRANGE_H_
|
||||
|
||||
#include <device/resource.h>
|
||||
|
||||
/* A memranges structure consists of a list of range_entry(s). The structure
|
||||
* is exposed so that a memranges can be used on the stack if needed. */
|
||||
struct memranges {
|
||||
struct range_entry *entries;
|
||||
};
|
||||
|
||||
/* Each region within a memranges structure is represented by a
|
||||
* range_entry structure. Use the associated range_entry_(base|end|size|tag)
|
||||
* functions to interrogate its properties. i.e. don't rely on one's own
|
||||
* interpretation of the fields. */
|
||||
struct range_entry {
|
||||
resource_t begin;
|
||||
resource_t end;
|
||||
unsigned long tag;
|
||||
struct range_entry *next;
|
||||
};
|
||||
|
||||
/* Return inclusive base address of memory range. */
|
||||
static inline resource_t range_entry_base(const struct range_entry *r)
|
||||
{
|
||||
return r->begin;
|
||||
}
|
||||
|
||||
/* Return exclusive end address of memory range. */
|
||||
static inline resource_t range_entry_end(const struct range_entry *r)
|
||||
{
|
||||
return r->end + 1;
|
||||
}
|
||||
|
||||
/* Return size of of memory range. */
|
||||
static inline resource_t range_entry_size(const struct range_entry *r)
|
||||
{
|
||||
return r->end - r->begin + 1;
|
||||
}
|
||||
|
||||
static inline unsigned long range_entry_tag(const struct range_entry *r)
|
||||
{
|
||||
return r->tag;
|
||||
}
|
||||
|
||||
/* Iterate over each entry in a memranges structure. Ranges cannot
|
||||
* be deleted while processing each entry as the list cannot be safely
|
||||
* traversed after such an operation.
|
||||
* r - range_entry pointer.
|
||||
* ranges - memranges pointer */
|
||||
#define memranges_each_entry(r, ranges) \
|
||||
for (r = (ranges)->entries; r != NULL; r = r->next)
|
||||
|
||||
/* Initialize and fill a memranges structure according to the
|
||||
* mask and match type for all memory resources. Tag each entry with the
|
||||
* specified type. */
|
||||
void memranges_init(struct memranges *ranges,
|
||||
unsigned long mask, unsigned long match,
|
||||
unsigned long tag);
|
||||
|
||||
/* Remove and free all entries within the memranges structure. */
|
||||
void memranges_teardown(struct memranges *ranges);
|
||||
|
||||
/* Add memory resources that match with the corresponding mask and match.
|
||||
* Each entry will be tagged with the provided tag. e.g. To populate
|
||||
* all cacheable memory resources in the range:
|
||||
* memranges_add_resources(range, IORESOURCE_CACHEABLE,
|
||||
* IORESROUCE_CACHEABLE, my_cacheable_tag); */
|
||||
void memranges_add_resources(struct memranges *ranges,
|
||||
unsigned long mask, unsigned long match,
|
||||
unsigned long tag);
|
||||
|
||||
/* Fill all address ranges up to limit (exclusive) not covered by an entry by
|
||||
* inserting new entries with the provided tag. */
|
||||
void memranges_fill_holes_up_to(struct memranges *ranges,
|
||||
resource_t limit, unsigned long tag);
|
||||
|
||||
/* Create a hole in the range by deleting/modifying entries that overlap with
|
||||
* the region specified by base and size. */
|
||||
void memranges_create_hole(struct memranges *ranges,
|
||||
resource_t base, resource_t size);
|
||||
|
||||
/* Insert a resource to the given memranges. All existing ranges
|
||||
* covered by range specified by base and size will be removed before a
|
||||
* new one is added. */
|
||||
void memranges_insert(struct memranges *ranges,
|
||||
resource_t base, resource_t size, unsigned long tag);
|
||||
|
||||
#endif /* MEMRANGE_H_ */
|
Reference in New Issue
Block a user