b890a1228d
As per discussion with lawyers[tm], it's not a good idea to
shorten the license header too much - not for legal reasons
but because there are tools that look for them, and giving
them a standard pattern simplifies things.
However, we got confirmation that we don't have to update
every file ever added to coreboot whenever the FSF gets a
new lease, but can drop the address instead.
util/kconfig is excluded because that's imported code that
we may want to synchronize every now and then.
$ find * -type f -exec sed -i "s:Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, *MA[, ]*02110-1301[, ]*USA:Foundation, Inc.:" {} +
$ find * -type f -exec sed -i "s:Foundation, Inc., 51 Franklin Street, Suite 500, Boston, MA 02110-1335, USA:Foundation, Inc.:" {} +
$ find * -type f -exec sed -i "s:Foundation, Inc., 59 Temple Place[-, ]*Suite 330, Boston, MA *02111-1307[, ]*USA:Foundation, Inc.:" {} +
$ find * -type f -exec sed -i "s:Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.:Foundation, Inc.:" {} +
$ find * -type f
-a \! -name \*.patch \
-a \! -name \*_shipped \
-a \! -name LICENSE_GPL \
-a \! -name LGPL.txt \
-a \! -name COPYING \
-a \! -name DISCLAIMER \
-exec sed -i "/Foundation, Inc./ N;s:Foundation, Inc.* USA\.* *:Foundation, Inc. :;s:Foundation, Inc. $:Foundation, Inc.:" {} +
Change-Id: Icc968a5a5f3a5df8d32b940f9cdb35350654bef9
Signed-off-by: Patrick Georgi <pgeorgi@chromium.org>
Reviewed-on: http://review.coreboot.org/9233
Tested-by: build bot (Jenkins)
Reviewed-by: Vladimir Serbinenko <phcoder@gmail.com>
123 lines
2.8 KiB
C
123 lines
2.8 KiB
C
/*
|
|
* fmap_sections.c, track which sections of the image will contain CBFSes
|
|
*
|
|
* Copyright (C) 2015 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.
|
|
*/
|
|
|
|
#include "cbfs_sections.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_annotation_impl(const struct flashmap_descriptor *node,
|
|
const char *annotation)
|
|
{
|
|
if (strcmp(annotation, SECTION_ANNOTATION_CBFS) == 0 &&
|
|
node->list_len == 0) {
|
|
struct descriptor_node *list_node = malloc(sizeof(*list_node));
|
|
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;
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
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;
|
|
}
|