blob: c5f016f08a0b72cd50034735fedd8f2e14f25e4f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
|
/* track which sections of the image will contain CBFSes */
/*
* 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.
*/
#include "cbfs_sections.h"
#include "common.h"
#include <assert.h>
#include <stdlib.h>
#include <string.h>
struct descriptor_node {
const struct flashmap_descriptor *val;
struct descriptor_node *next;
};
static struct descriptor_list {
struct descriptor_node *head;
struct descriptor_node *tail;
} cbfs_sections;
static bool seen_primary_section = false;
static void descriptor_list_prepend(struct descriptor_list *list,
struct descriptor_node *new_head)
{
assert(list);
assert(new_head);
new_head->next = list->head;
list->head = new_head;
if (!list->tail)
list->tail = new_head;
}
static void descriptor_list_append(struct descriptor_list *list,
struct descriptor_node *new_tail)
{
assert(list);
assert(new_tail);
if (list->tail)
list->tail->next = new_tail;
list->tail = new_tail;
if (!list->head)
list->head = new_tail;
}
/* Implementation of cbfs module's callback; invoked during fmd file parsing */
bool fmd_process_flag_cbfs(const struct flashmap_descriptor *node)
{
struct descriptor_node *list_node;
if (node->list_len != 0)
return false;
list_node = (struct descriptor_node *)malloc(sizeof(*list_node));
if (!list_node) {
ERROR("Cannot allocate CBFS flag node!\n");
return false;
}
list_node->val = node;
list_node->next = NULL;
if (strcmp(node->name, SECTION_NAME_PRIMARY_CBFS) == 0) {
descriptor_list_prepend(&cbfs_sections, list_node);
seen_primary_section = true;
} else {
descriptor_list_append(&cbfs_sections, list_node);
}
return true;
}
cbfs_section_iterator_t cbfs_sections_iterator(void)
{
return cbfs_sections.head;
}
bool cbfs_sections_iterator_advance(cbfs_section_iterator_t *it)
{
assert(it);
if (!*it)
return false;
*it = (*it)->next;
return true;
}
const struct flashmap_descriptor *cbfs_sections_iterator_deref(
cbfs_section_iterator_t it)
{
assert(it);
return it->val;
}
bool cbfs_sections_primary_cbfs_accounted_for(void)
{
return seen_primary_section;
}
void cbfs_sections_cleanup(void)
{
for (struct descriptor_node *cur = cbfs_sections.head, *next = NULL;
cur; cur = next) {
next = cur->next;
free(cur);
}
cbfs_sections.head = NULL;
cbfs_sections.tail = NULL;
}
|
