len0rd/dtc
1
0
Fork 0
mirror of https://github.com/dgibson/dtc.git synced 2025-10-13 16:27:39 -04:00
Code Issues Projects Releases Packages Wiki Activity Actions

Rework tracking of reserve entries during processing. This is initial work

Browse source 
to allow more powerful handling of reserve entries.
This commit is contained in:
David Gibson 2005-10-24 18:18:38 +10:00
parent fccb194a14
commit f040d95b84
7 changed files with 119 additions and 58 deletions
Download patch file Download diff file Expand all files Collapse all files

27
treesource.c
View file

@ -26,18 +26,6 @@ extern void yyerror(char const *);
struct boot_info *the_boot_info;
struct data build_mem_reserve(struct data d)
{
/*
* FIXME: Should reconcile the -R parameter here now?
*/
if (d.len % 16 != 0) {
yyerror("Memory Reserve entries are <u64 addr, u64 size>\n");
}
return d;
}
struct boot_info *dt_from_source(FILE *f)
{
the_boot_info = NULL;
@ -158,19 +146,12 @@ static void write_tree_source_node(FILE *f, struct node *tree, int level)
void write_tree_source(FILE *f, struct boot_info *bi)
{
int i;
assert((bi->mem_reserve_data.len % sizeof(struct reserve_entry)) == 0);
for (i = 0;
i < (bi->mem_reserve_data.len / sizeof(struct reserve_entry));
i++) {
struct reserve_entry *re = ((struct reserve_entry *)
bi->mem_reserve_data.val) + i;
struct reserve_info *re;
for (re = bi->reservelist; re; re = re->next) {
fprintf(f, "/memreserve/\t%016llx-%016llx;\n",
(unsigned long long)be64_to_cpu(re->address),
(unsigned long long)(be64_to_cpu(re->address)
+ be64_to_cpu(re->size) - 1));
(unsigned long long)re->re.address,
(unsigned long long)(re->re.address + re->re.size - 1));
}
write_tree_source_node(f, bi->dt, 0);